group_id
stringlengths 12
18
| problem_description
stringlengths 85
3.02k
| candidates
listlengths 3
20
|
|---|---|---|
aoj_0053_cpp
|
素数の和
p(i)
を小さい方から
i
番目の素数とします。例えば、7 は、2, 3, 5, 7 と小さい方から 4 番目の素数なので、
p(4) = 7
です。
n
が与えられたとき、
i = 1
から
n
までの
p(i)
の和
s
s = p(1) + p(2) +
....
+ p(n)
を出力するプログラムを作成してください。例えば、
n = 9
のとき、
s = 2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 = 100
となります。
Input
複数のデータセットが与えられます。各データセットに整数
n
(
n
≤ 10000) が与えられます。
n
が 0 のとき入力の最後とします。データセットの数は 50 を超えません。
Output
各データセットの
n
に対して、
s
を１行に出力して下さい。
Sample Input
2
9
0
Output for the Sample Input
5
100
|
[
{
"submission_id": "aoj_0053_10849130",
"code_snippet": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint sushu(int a)\n{\n int i;\n for(i=2; i<=sqrt(a); i++)\n {\n if(a%i==0)\n return 0;\n }\n return 1;\n}\nint main()\n{\n int n,i,j,t;\n while(~scanf(\"%d\",&n)&&n!=0)\n {\n i=0;\n t=0;\n for(j=2;i<=n-1;j++)\n {\n if(sushu(j)==1)\n {\n i++;\n t=t+j;\n }\n }\n printf(\"%d\\n\",t);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 2820,
"score_of_the_acc": -0.2466,
"final_rank": 15
},
{
"submission_id": "aoj_0053_7095489",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n, sum;\n bool sosu[300010];\n while(cin >> n, n!=0){\n sum = 0;\n memset(sosu, false, sizeof(sosu));\n for(int i=2;i<200000;i++){\n if(!sosu[i]){\n sum += i;\n n--;\n if(n == 0) break;\n for(int j=i+i;j<300000;j+=i){\n sosu[j] = true;\n }\n }\n }\n cout << sum << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3380,
"score_of_the_acc": -0.0398,
"final_rank": 4
},
{
"submission_id": "aoj_0053_6923562",
"code_snippet": "#line 1 \"/home/maspy/compro/library/my_template.hpp\"\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\n\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n// https://trap.jp/post/1224/\n#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)\n#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)\n#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)\n#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))\n#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)\n#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\n#define FOR_R(...) \\\n overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\n\n#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))\n#define all(x) x.begin(), x.end()\n#define len(x) ll(x.size())\n#define elif else if\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n\nll SUM(vector<int> &A) {\n ll sum = 0;\n for (auto &&a: A) sum += a;\n return sum;\n}\n\ntemplate <typename T>\nT SUM(vector<T> &A) {\n T sum = T(0);\n for (auto &&a: A) sum += a;\n return sum;\n}\n\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)))\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n\nint popcnt(int x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(ll x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T, typename U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <typename T, typename U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <typename T, typename U>\npair<T, T> divmod(T x, U y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\nll binary_search(function<bool(ll)> check, ll ok, ll ng) {\n assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n if (check(x))\n ok = x;\n else\n ng = x;\n }\n return ok;\n}\n\ntemplate <typename F>\ndouble binary_search_real(F check, double ok, double ng, int iter = 100) {\n FOR(iter) {\n double x = (ok + ng) / 2;\n if (check(x)) {\n ok = x;\n } else {\n ng = x;\n }\n }\n return (ok + ng) / 2;\n}\n\ntemplate <class T, class S>\ninline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\ntemplate <class T, class S>\ninline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\nvi s_to_vi(const string &S, char first_char) {\n vi A(S.size());\n FOR(i, S.size()) { A[i] = S[i] - first_char; }\n return A;\n}\n\ntemplate <typename T>\nvector<T> cumsum(vector<T> &A, int off = 1) {\n int N = A.size();\n vector<T> B(N + 1);\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\ntemplate <typename CNT, typename T>\nvc<CNT> bincount(const vc<T> &A, int size) {\n vc<CNT> C(size);\n for (auto &&x: A) { ++C[x]; }\n return C;\n}\n\ntemplate <typename T>\nvector<int> argsort(const vector<T> &A) {\n // stable\n vector<int> ids(A.size());\n iota(all(ids), 0);\n sort(all(ids),\n [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\n int n = len(I);\n vc<T> B(n);\n FOR(i, n) B[i] = A[I[i]];\n return B;\n}\n#line 1 \"/home/maspy/compro/library/other/io.hpp\"\n// based on yosupo's fastio\n#include <unistd.h>\n\nnamespace detail {\ntemplate <typename T, decltype(&T::is_modint) = &T::is_modint>\nstd::true_type check_value(int);\ntemplate <typename T>\nstd::false_type check_value(long);\n} // namespace detail\n\ntemplate <typename T>\nstruct is_modint : decltype(detail::check_value<T>(0)) {};\ntemplate <typename T>\nusing is_modint_t = enable_if_t<is_modint<T>::value>;\ntemplate <typename T>\nusing is_not_modint_t = enable_if_t<!is_modint<T>::value>;\n\nstruct Scanner {\n FILE *fp;\n char line[(1 << 15) + 1];\n size_t st = 0, ed = 0;\n void reread() {\n memmove(line, line + st, ed - st);\n ed -= st;\n st = 0;\n ed += fread(line + ed, 1, (1 << 15) - ed, fp);\n line[ed] = '\\0';\n }\n bool succ() {\n while (true) {\n if (st == ed) {\n reread();\n if (st == ed) return false;\n }\n while (st != ed && isspace(line[st])) st++;\n if (st != ed) break;\n }\n if (ed - st <= 50) {\n bool sep = false;\n for (size_t i = st; i < ed; i++) {\n if (isspace(line[i])) {\n sep = true;\n break;\n }\n }\n if (!sep) reread();\n }\n return true;\n }\n template <class T, enable_if_t<is_same<T, string>::value, int> = 0>\n bool read_single(T &ref) {\n if (!succ()) return false;\n while (true) {\n size_t sz = 0;\n while (st + sz < ed && !isspace(line[st + sz])) sz++;\n ref.append(line + st, sz);\n st += sz;\n if (!sz || st != ed) break;\n reread();\n }\n return true;\n }\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\n bool read_single(T &ref) {\n if (!succ()) return false;\n bool neg = false;\n if (line[st] == '-') {\n neg = true;\n st++;\n }\n ref = T(0);\n while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }\n if (neg) ref = -ref;\n return true;\n }\n template <class T, is_modint_t<T> * = nullptr>\n bool read_single(T &ref) {\n long long val = 0;\n bool f = read_single(val);\n ref = T(val);\n return f;\n }\n bool read_single(double &ref) {\n string s;\n if (!read_single(s)) return false;\n ref = std::stod(s);\n return true;\n }\n bool read_single(char &ref) {\n string s;\n if (!read_single(s) || s.size() != 1) return false;\n ref = s[0];\n return true;\n }\n template <class T>\n bool read_single(vector<T> &ref) {\n for (auto &d: ref) {\n if (!read_single(d)) return false;\n }\n return true;\n }\n template <class T, class U>\n bool read_single(pair<T, U> &p) {\n return (read_single(p.first) && read_single(p.second));\n }\n template <class A, class B, class C>\n bool read_single(tuple<A, B, C> &p) {\n return (read_single(get<0>(p)) && read_single(get<1>(p))\n && read_single(get<2>(p)));\n }\n template <class A, class B, class C, class D>\n bool read_single(tuple<A, B, C, D> &p) {\n return (read_single(get<0>(p)) && read_single(get<1>(p))\n && read_single(get<2>(p)) && read_single(get<3>(p)));\n }\n void read() {}\n template <class H, class... T>\n void read(H &h, T &... t) {\n bool f = read_single(h);\n assert(f);\n read(t...);\n }\n Scanner(FILE *fp) : fp(fp) {}\n};\n\nstruct Printer {\n Printer(FILE *_fp) : fp(_fp) {}\n ~Printer() { flush(); }\n\n static constexpr size_t SIZE = 1 << 15;\n FILE *fp;\n char line[SIZE], small[50];\n size_t pos = 0;\n void flush() {\n fwrite(line, 1, pos, fp);\n pos = 0;\n }\n void write(const char &val) {\n if (pos == SIZE) flush();\n line[pos++] = val;\n }\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\n void write(T val) {\n if (pos > (1 << 15) - 50) flush();\n if (val == 0) {\n write('0');\n return;\n }\n if (val < 0) {\n write('-');\n val = -val; // todo min\n }\n size_t len = 0;\n while (val) {\n small[len++] = char(0x30 | (val % 10));\n val /= 10;\n }\n for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }\n pos += len;\n }\n void write(const string &s) {\n for (char c: s) write(c);\n }\n void write(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++) write(s[i]);\n }\n void write(const double &x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << x;\n string s = oss.str();\n write(s);\n }\n void write(const long double &x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << x;\n string s = oss.str();\n write(s);\n }\n template <class T, is_modint_t<T> * = nullptr>\n void write(T &ref) {\n write(ref.val);\n }\n template <class T>\n void write(const vector<T> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) write(' ');\n write(val[i]);\n }\n }\n template <class T, class U>\n void write(const pair<T, U> &val) {\n write(val.first);\n write(' ');\n write(val.second);\n }\n template <class A, class B, class C>\n void write(const tuple<A, B, C> &val) {\n auto &[a, b, c] = val;\n write(a), write(' '), write(b), write(' '), write(c);\n }\n template <class A, class B, class C, class D>\n void write(const tuple<A, B, C, D> &val) {\n auto &[a, b, c, d] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);\n }\n template <class A, class B, class C, class D, class E>\n void write(const tuple<A, B, C, D, E> &val) {\n auto &[a, b, c, d, e] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);\n }\n template <class A, class B, class C, class D, class E, class F>\n void write(const tuple<A, B, C, D, E, F> &val) {\n auto &[a, b, c, d, e, f] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);\n }\n template <class T, size_t S>\n void write(const array<T, S> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) write(' ');\n write(val[i]);\n }\n }\n void write(i128 val) {\n string s;\n bool negative = 0;\n if(val < 0){\n negative = 1;\n val = -val;\n }\n while (val) {\n s += '0' + int(val % 10);\n val /= 10;\n }\n if(negative) s += \"-\";\n reverse(all(s));\n if (len(s) == 0) s = \"0\";\n write(s);\n }\n};\n\nScanner scanner = Scanner(stdin);\nPrinter printer = Printer(stdout);\n\nvoid flush() { printer.flush(); }\nvoid print() { printer.write('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n printer.write(head);\n if (sizeof...(Tail)) printer.write(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid read() {}\ntemplate <class Head, class... Tail>\nvoid read(Head &head, Tail &... tail) {\n scanner.read(head);\n read(tail...);\n}\n\n#define INT(...) \\\n int __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define CHAR(...) \\\n char __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n read(__VA_ARGS__)\n\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n read(name)\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n read(name)\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\n#line 2 \"/home/maspy/compro/library/nt/primetest.hpp\"\nstruct m64 {\n using i64 = int64_t;\n using u64 = uint64_t;\n using u128 = __uint128_t;\n\n inline static u64 m, r, n2; // r * m = -1 (mod 1<<64), n2 = 1<<128 (mod m)\n static void set_mod(u64 m) {\n assert(m < (1ull << 62));\n assert((m & 1) == 1);\n m64::m = m;\n n2 = -u128(m) % m;\n r = m;\n FOR(_, 5) r *= 2 - m * r;\n r = -r;\n assert(r * m == -1ull);\n }\n static u64 reduce(u128 b) { return (b + u128(u64(b) * r) * m) >> 64; }\n\n u64 x;\n m64() : x(0) {}\n m64(u64 x) : x(reduce(u128(x) * n2)){};\n u64 val() const {\n u64 y = reduce(x);\n return y >= m ? y - m : y;\n }\n m64 &operator+=(m64 y) {\n x += y.x - (m << 1);\n x = (i64(x) < 0 ? x + (m << 1) : x);\n return *this;\n }\n m64 &operator-=(m64 y) {\n x -= y.x;\n x = (i64(x) < 0 ? x + (m << 1) : x);\n return *this;\n }\n m64 &operator*=(m64 y) {\n x = reduce(u128(x) * y.x);\n return *this;\n }\n m64 operator+(m64 y) const { return m64(*this) += y; }\n m64 operator-(m64 y) const { return m64(*this) -= y; }\n m64 operator*(m64 y) const { return m64(*this) *= y; }\n bool operator==(m64 y) const {\n return (x >= m ? x - m : x) == (y.x >= m ? y.x - m : y.x);\n }\n bool operator!=(m64 y) const { return not operator==(y); }\n m64 pow(u64 n) const {\n m64 y = 1, z = *this;\n for (; n; n >>= 1, z *= z)\n if (n & 1) y *= z;\n return y;\n }\n};\n\nbool primetest(const uint64_t x) {\n using u64 = uint64_t;\n if (x == 2 or x == 3 or x == 5 or x == 7) return true;\n if (x % 2 == 0 or x % 3 == 0 or x % 5 == 0 or x % 7 == 0) return false;\n if (x < 121) return x > 1;\n const u64 d = (x - 1) >> __builtin_ctzll(x - 1);\n m64::set_mod(x);\n const m64 one(1), minus_one(x - 1);\n auto ok = [&](u64 a) {\n auto y = m64(a).pow(d);\n u64 t = d;\n while (y != one and y != minus_one and t != x - 1) y *= y, t <<= 1;\n if (y != minus_one and t % 2 == 0) return false;\n return true;\n };\n if (x < (1ull << 32)) {\n for (u64 a: {2, 7, 61})\n if (not ok(a)) return false;\n } else {\n for (u64 a: {2, 325, 9375, 28178, 450775, 9780504, 1795265022}) {\n if (x <= a) return true;\n if (not ok(a)) return false;\n }\n }\n return true;\n}\n#line 4 \"main.cpp\"\n\nvoid solve() {\n while (1) {\n LL(N);\n if (N == 0) break;\n ll ANS = 0;\n ll cnt = 0;\n ll p = 2;\n while (cnt < N) {\n if (primetest(p++)) {\n ANS += p - 1;\n ++cnt;\n }\n }\n print(ANS);\n }\n}\n\nsigned main() {\n cout << fixed << setprecision(15);\n\n ll T = 1;\n // LL(T);\n FOR(T) solve();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3152,
"score_of_the_acc": -0.1443,
"final_rank": 9
},
{
"submission_id": "aoj_0053_5518741",
"code_snippet": "#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\n\nconst ll inf = 1ll << 60;\nconst ll mod = (ll)1e9 + 7;\n\n#define rep(i, n) for (ll i = 0; i < (ll)n; i++)\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define range(v, b, e) v.begin() + b, v.begin() + e\n#define print(s) cout << s;\n#define println(s) cout << s << endl;\n#define printd(s, f) cout << fixed << setprecision(f) << s << endl;\n\nvector<ll> out;\nvoid output()\n{\n for (auto i : out)\n {\n println(i);\n }\n}\n\ntemplate<typename T> bool isPrime(T n)\n{\n\tif (n == 2)\n\t{\n\t\treturn true;\n\t}\n\telse if ((n == 1) || (n % 2 == 0))\n\t{\n\t\treturn false;\n\t}\n\n\tfor (T i = 3; i * i <= n; i += 2)\n\t{\n\t\tif (n % i == 0)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nint main()\n{\n vector<ll> p;\n ull sum = 0;\n for (ll i = 2; ; i++)\n {\n if (isPrime(i))\n {\n sum += i;\n p.push_back(sum);\n\n if (p.size() >= 10000)\n {\n break;\n }\n }\n }\n\n ll n;\n while (cin >> n)\n {\n if (n == 0)\n {\n break;\n }\n\n out.push_back(p[n - 1]);\n }\n\n output();\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3256,
"score_of_the_acc": -0.0097,
"final_rank": 3
},
{
"submission_id": "aoj_0053_5239879",
"code_snippet": "#include <bits/stdc++.h>\n#define NIL (-1)\n#define LL long long\nusing namespace std;\nconst int64_t MOD = 1e9 + 7;\nconst int INF = INT_MAX;\nconst double PI = acos(-1.0);\n\nbool check(int64_t n) {\n\tbool ret = 1;\n\tfor (int64_t i = 2; i <= sqrt(n); i++) {\n\t\tif ((n / i) && (n % i == 0)) ret = 0;\n\t}\n\treturn ret;\n}\n\nint main() {\n\tvector<int64_t> vec = { 2 };\n\tfor (int64_t n = 3;; n += 2) {\n\t\tif (check(n)) vec.push_back(n);\n\t\tif (vec.size() == 10010) break;\n\t}\n\t//cout << vec.back() << endl;\n\n\tvector<int64_t> sn = vec;\n\tfor (int i = 1; i < vec.size(); i++) {\n\t\tsn[i] += sn[i - 1];\n\t}\n\t//cout << sn.back() << endl;\n\n\tint64_t N;\n\twhile (cin >> N) {\n\t\tif (!N) break;\n\t\tcout << sn[N - 1] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3288,
"score_of_the_acc": -0.12,
"final_rank": 6
},
{
"submission_id": "aoj_0053_3628396",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool Check(int num)\n{\n if(num < 2){ \n return false;\n }\n else if(num == 2){ \n return true;\n }\n else if(num % 2 == 0){ \n return false;\n }\n\n double sq = sqrt(num);\n for(int i = 3;i <= sq;i += 2){\n if (num % i == 0){\n return false;\n }\n }\n\n return true;\n}\n\nint main()\n{\n while(1){\n int N;\n cin>>N;\n\n if(N == 0){\n break;\n }\n\n int t = 1;\n int ans = 2;\n \n if(N != 1){\n for(int i = 3;;i = i + 2){\n bool ch = Check(i);\n if(ch == true){\n ans += i;\n ++t;\n }\n\n if(t == N){\n break;\n }\n }\n }\n\n cout<<ans<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3000,
"score_of_the_acc": -0.1821,
"final_rank": 11
},
{
"submission_id": "aoj_0053_3628105",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nint main() {\n int n;\n vector<int> pri(1000000, 1);\n vector<int> p_sum;\n pri[0] = 0;\n pri[1] = 0;\n\n for(int i = 2; i < sqrt(1000000); i++) {\n for(int j = i*i; j < 1000000; j+=i) {\n pri[j] = 0;\n }\n }\n\n int cnt\t= 0;\n p_sum.push_back(2);\n\n for(int i = 3; i < 1000000; i++) {\n if(pri[i] == 1) {\n p_sum.push_back(i+p_sum[cnt]);\n cnt++;\n } \n }\n\n while(cin >> n, n) {\n cout << p_sum[n-1] <<\tendl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7212,
"score_of_the_acc": -0.0974,
"final_rank": 5
},
{
"submission_id": "aoj_0053_3628059",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n int map[5000000]={};\n for(int i=2; i<=5000000; ++i){\n for(int j=2; i*j<=5000000; ++j){\n map[i*j] = 1;\n //cout << i*j << endl;\n }\n }\n vector<int> iv;\n for(int i=2; i<500000; ++i){\n if(map[i]==0){iv.push_back(i);}\n }\n /* for(auto i: iv){\n cout << i << endl;\n } */\n int n;\n while(cin >> n,n){\n int ans = 0;\n for(int i=0; i<n; ++i){\n ans += iv[i];\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 22660,
"score_of_the_acc": -1.1659,
"final_rank": 19
},
{
"submission_id": "aoj_0053_3627915",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\n vector<int> p;\n\n p.push_back(2);\n\n\tfor(int i=3;i<=1000000;i+=2){\n\t int k=0;\n\t for(int j=3;j<=sqrt(i);j+=2)\n\t\t{\n\t\t if(i%j==0)\n\t\t\t{\n\t\t\t k=1;\n\t\t\t break;\n\t\t\t}\n\t\t}\n\t \n\t if(k==0)\n\t\tp.push_back(i);\n\t}\n\t\n while(1){\n\n\tint n;\n\n\tcin >> n;\n\n\tif(n == 0)\n\t break;\n\n\tint sum = 0;\n\t\n\tfor(int i=0;i<n;++i)\n\t sum += p[i];\n\n\tcout << sum << endl;\n\t\n }\n\t\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 3256,
"score_of_the_acc": -0.2425,
"final_rank": 14
},
{
"submission_id": "aoj_0053_3580336",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nlong long int ar[1000000],m[1000000],m2[1000000];\n\nvoid _seive_ (long long int n)\n{\n long long int i,j;\n for (i=2;i<=n;++i){\n\n for (j=(i*i);j<=n;j+=i){\n\n ar[j-1]=1;\n\n }\n }\n j=0;\n m2[1]=2;\n for (i=2;i<=n;++i){\n\n if(ar[i-1]==0){\n\n ++j;\n m[j]=i;\n if(j>1){\n\n m2[j]= m[j]+m2[j-1];\n\n }\n }\n }\n\n return ;\n}\n\nint main()\n{\n long long int num;\n\n _seive_(1000000);\n while(scanf(\"%lld\",&num)==1 && num!=0) {\n\n cout<<m2[num]<<endl;\n\n }\n\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 12184,
"score_of_the_acc": -0.2076,
"final_rank": 13
},
{
"submission_id": "aoj_0053_3557963",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <vector>\n#include <utility>\n#include <cstring>\n#include <iomanip>\n#include <numeric>\n#include <cmath>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1<<30;\nconst int MOD = 1e9 + 7;\nconst int MAX_N = 1e8;\nbool isPrime(ll x)\n{\n if(x % 2 == 0) return false;\n for(ll i = 3; i * i <= x; i += 2) if(x % i == 0) return false;\n return true;\n}\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n vector<ll> prime;\n prime.push_back(2);\n for(ll x = 3; prime.size() < 10010; x += 2) if(isPrime(x)) prime.push_back(x);\n vector<ll> sum(10010, 0);\n for(int i = 1; i < 10010; i++) sum[i] += sum[i - 1] + (ll)prime[i - 1];\n while(cin >> n, n)\n {\n cout << sum[n] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3136,
"score_of_the_acc": -0.007,
"final_rank": 2
},
{
"submission_id": "aoj_0053_3541249",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nusing ll = long long;\n\n// 𝑂(𝑁*log(log 𝑁))\nvector<int> eratosthenes(int N)\n{\n vector<int> res;\n vector<bool> prime(N + 1, 1);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= N; ++i)\n {\n if (prime[i] == true)\n {\n for (int j = 2 * i; j <= N; j += i)\n {\n prime[j] = false;\n }\n }\n }\n for (int i = 0; i <= N; ++i)\n {\n if (prime[i] == true)\n res.push_back(i);\n }\n return res;\n}\n\nll n;\n\nint main()\n{\n auto p = eratosthenes(100000000);\n while (cin >> n)\n {\n if (n == 0)\n return 0;\n ll ans = 0;\n for (int i = 0; i < n; i++)\n {\n ans += p[i];\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 740,
"memory_kb": 47920,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0053_3541248",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nusing ll = long long;\n\n// 𝑂(𝑁*log(log 𝑁))\nvector<int> eratosthenes(int N)\n{\n vector<int> res;\n vector<bool> prime(N + 1, 1);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= N; ++i)\n {\n if (prime[i] == true)\n {\n for (int j = 2 * i; j <= N; j += i)\n {\n prime[j] = false;\n }\n }\n }\n for (int i = 0; i <= N; ++i)\n {\n if (prime[i] == true)\n res.push_back(i);\n }\n return res;\n}\n\nll n;\n\nint main()\n{\n auto p = eratosthenes(10000000);\n while (cin >> n)\n {\n if (n == 0)\n return 0;\n ll ans = 0;\n for (int i = 0; i < n; i++)\n {\n ans += p[i];\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 8016,
"score_of_the_acc": -0.1563,
"final_rank": 10
},
{
"submission_id": "aoj_0053_3434028",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i, n) for(int i=0; i<(n); ++i)\n#define FOR(i, m, n) for(int i=(m); i<(n); ++i)\n#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define Cout(x) cout << (x) << endl\n#define Cout2(x, y) cout << (x) << \" \" << (y) << endl\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define forauto(i, a) for(auto i : a)cout << i << \" \"; puts(\"\");\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef vector<LL> VL;\ntypedef vector<string> VS;\ntypedef vector<bool> VB;\ntypedef vector<vector<int>> VVI;\ntypedef pair<int, int> PII;\nconst int inf = 1e9;\nconst double pi = acos(-1.0);\n\n//素数判定\nbool isPrime(int n) {\n\tif (n == 2)return true;\n\tif (n < 2 || n % 2 == 0)return false;\n\n\tfor (int i = 3; i*i <= n; i += 2) {\n\t\tif (n%i == 0)return false;\n\t}\n\treturn true;\n}\n\nint solve(int n) {\n\tint ans = 0, num = 0;\n\tfor (int i = 2; num != n; i++) {\n\t\tif (isPrime(i)) {\n\t\t\tans += i;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main() {\n\twhile (true) {\n\t\tint n; cin >> n;\n\t\tif (n == 0)break;\n\n\t\tCout(solve(n));\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 2980,
"score_of_the_acc": -0.1405,
"final_rank": 8
},
{
"submission_id": "aoj_0053_3354083",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define lint long long\n#define P pair<int, int>\n#define LLP pair<long long, long long>\n#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)\n#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)\n#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)\n#define SORT(x) sort((x).begin(), (x).end())\n#define SORT_INV(x) sort((x).rbegin(), (x).rend())\n\nconst int IINF = 1e9 + 10;\nconst long long LLINF = (long long)1e18 + 10;\nconst long long MOD = (long long)1e9 + 7;\nconst int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};\nconst int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};\nconst double EPS = 1e-8;\n\nvoid eratosthenes(int n, vector<bool> &isPrime){\n isPrime.resize(n + 1, true);\n for(int i = 0 ; i < 2 ; ++i){\n isPrime[i] = false;\n }\n for(int i = 2 ; i * i <= n ; ++i){\n if(isPrime[i]){\n for(int j = i ; i * j <= n ; ++j){\n isPrime[i * j] = false;\n }\n }\n }\n return;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n;\n while(cin >> n, n){\n\n vector<bool> isPrime;\n eratosthenes(1000000, isPrime);\n\n lint ans = 0;\n int cnt = 0;\n rep(i, 1000000){\n if(isPrime[i]){\n ans += i;\n ++cnt;\n }\n if(cnt == n){\n break;\n }\n }\n cout << ans << endl;\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3292,
"score_of_the_acc": -0.1201,
"final_rank": 7
},
{
"submission_id": "aoj_0053_3354075",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\nconst ll MOD = 1000000007;\nconst int IINF = INT_MAX;\nconst ll LLINF = LLONG_MAX;\nconst int MAX_N = int(2e5 + 5);\nconst double EPS = 1e-8;\nconst int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define REPR(i, n) for (int i = n; i >= 0; i--)\n#define SORT(v) sort((v).begin(), (v).end())\n#define ALL(v) (v).begin(), (v).end()\n\nbool prime[int(1e7)+5];\n\nint main() {\n int m = int(1e7);\n vector<ll> p;\n fill(prime,prime+m+1,true);\n prime[0] = false;\n prime[1] = false;\n for(int i=2;i*i<=m;i++){\n if(prime[i]){\n for(int j=i*i;j<=m;j+=i){\n prime[j] = false;\n }\n }\n }\n p.push_back(0);\n for(ll i=2;p.size()<10005;i++){\n if(prime[i]) p.push_back(i);\n }\n for(int i=0;i<p.size();i++){\n p[i+1] += p[i];\n }\n while(1){\n int n;\n cin >> n;\n if(n==0)break;\n cout << p[n] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 12940,
"score_of_the_acc": -0.2792,
"final_rank": 16
},
{
"submission_id": "aoj_0053_3354032",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<utility>\n#include<string>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<map>\n#include<climits>\n#include<set>\n\n#define REP(i, n) for(int i = 0;i < n;i++)\n#define REPR(i, n) for(int i = n;i >= 0;i--)\n#define FOR(i, m, n) for(int i = m;i < n;i++)\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\n#define SORT(v, n) sort(v, v+n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define llong long long\n#define pb(a) push_back(a)\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\nint dx[4] = {1,0,0,-1};\nint dy[4] = {0,1,-1,0};\n#define MOD 1000000007\n#define ARRAY_MAX 1000005\n\nconst int INF = 1e9+7;\n\n\n/*素数のみの配列を返す*/\nvector<ll> Eratosthenes(ll n,vector<ll>& arr){\n \n for(ll i = 0; i < n;i++){\n arr[i] = 1;\n }\n \n for(ll i = 2; i < sqrt(n); i++){\n if(arr[i]){\n for(ll j = 0; i * (j + 2) < n; j++){\n arr[i *(j + 2)] = 0;\n }\n }\n }\n vector<ll> prime;\n for(int i = 2;i < arr.size();i++){\n if(arr[i]){\n prime.push_back(i);\n }\n }\n return prime;\n}\n\nint main(){\n\n\n vector<ll> prime(ARRAY_MAX,0);\n prime = Eratosthenes(1e6,prime);\n \n for(int i = 0;i < prime.size()-1;i++){\n prime[i+1] += prime[i];\n }\n ll n;\n while(cin >> n,n){\n\n cout << prime[n-1] << endl;\n }\n\n\n\n\n\n\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11468,
"score_of_the_acc": -0.1918,
"final_rank": 12
},
{
"submission_id": "aoj_0053_3208405",
"code_snippet": "#include<iostream>\n#include<cmath>\nusing namespace std;\n\nbool Judge_Prime_Number( int x )\n{\n for( int i = 2; i <= sqrt(x); i++ )\n {\n if( x % i == 0 )\n return false;\n }\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 i = 0;\n\n int sum = 0, p = 2;\n while( i != n )\n {\n if( Judge_Prime_Number(p) == true )\n {\n sum += p;\n i++;\n }\n p++;\n }\n cout << sum << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 3032,
"score_of_the_acc": -0.3883,
"final_rank": 18
},
{
"submission_id": "aoj_0053_3156666",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\n#define INPUT_FROM_FILE (0) \n#if INPUT_FROM_FILE\n#include <fstream>\n#endif\n\nclass PrimeTest{\nprivate:\n\tstd::vector<bool> is_prime_;\t\t\t\t\t//nが素数かどうかをis_prime[n]で判定\n\tstd::vector<unsigned int> prime_numbers_;\t\t//素数の集合\n\npublic:\n\tPrimeTest();\n\n\t~PrimeTest();\n\n\tconst std::vector<unsigned int>& get_prime_numbers() const;\n\n\tbool is_prime(unsigned int n);\n\n};\n\nPrimeTest::PrimeTest(){\n\tis_prime_.push_back(false);\t//0\n\tis_prime_.push_back(false);\t//1\n\tis_prime_.push_back(true);\t//2\n\tis_prime_.push_back(true);\t//3\n\n\tprime_numbers_.push_back(2);\n\tprime_numbers_.push_back(3);\n}\nPrimeTest::~PrimeTest(){}\n\nconst std::vector<unsigned int>& PrimeTest::get_prime_numbers() const{\n\treturn prime_numbers_;\n}\n\nbool PrimeTest::is_prime(unsigned int n){\n\tif(n >= is_prime_.size()){\n\t\tunsigned int i_s = is_prime_.size();\n\t\tis_prime_.resize(n + 1, false);\n\n\t\t//i_sからnまでの各数が素数かどうか判定\n\t\tfor(unsigned int i = i_s; i <= n; i++){\n\t\t\tunsigned int max_val = int(sqrt((double)i));\n\t\t\tbool b = true;\n\t\t\tfor(unsigned int j = 0; j < prime_numbers_.size(); j++){\n\t\t\t\tif(prime_numbers_[j] > max_val){ break;}\n\t\t\t\tif(i % prime_numbers_[j] == 0){\n\t\t\t\t\tb = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(b){\n\t\t\t\tprime_numbers_.push_back(i);\n\t\t\t\tis_prime_[i] = true;\n\t\t\t}\n\t\t}\n\n\t}\n\treturn is_prime_[n];\n}\n\nint main(){\n\tint n;\n\tint result = 0;\n\tPrimeTest prime_test;\n\n#if INPUT_FROM_FILE\n\tstd::ifstream ifs(\"test.txt\");\n#endif\n\n\tfor(;;){\n#if INPUT_FROM_FILE\n\t\tifs >> n;\n#else\n\t\tstd::cin >> n;\n#endif\n\t\tif(n == 0){ break; }\n\n\t\tresult = 2;\n\t\tn -= 1;\n\t\tfor(int i = 3; n > 0; i += 2){\n\t\t\tif(prime_test.is_prime(i)){\n\t\t\t\tresult += i;\n\t\t\t\tn--;\n\t\t\t}\n\t\t}\n\t\t\n\t\tstd::cout << result << std::endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3116,
"score_of_the_acc": -0.0066,
"final_rank": 1
},
{
"submission_id": "aoj_0053_3009274",
"code_snippet": "#include<iostream>\nusing namespace std;\nbool f(int a)\n{\n for(int i=2;i*i<=a;i++)if(a%i<1)return 0;\n return 1;\n}\nint n;\nmain()\n{\n while(cin>>n,n)\n {\n int ans=0;\n for(int i=2;n;i++)if(f(i))n--,ans+=i;\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 3044,
"score_of_the_acc": -0.3063,
"final_rank": 17
}
] |
aoj_0009_cpp
|
Prime Number
Write a program which reads an integer
n
and prints the number of prime numbers which are less than or equal to
n
. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.
Input
Input consists of several datasets. Each dataset has an integer
n
(1 ≤
n
≤ 999,999) in a line.
The number of datasets is less than or equal to 30.
Output
For each dataset, prints the number of prime numbers.
Sample Input
10
3
11
Output for the Sample Input
4
2
5
|
[
{
"submission_id": "aoj_0009_11022315",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main(){\n int N;\n while(cin>>N){\n vector<bool> P(1000001,true);\n P[0] = P[1] = false;\n for(int i=2;i<=1000000;i++)if(P[i]){\n for(int j=2*i;j<=1000000;j+=i) P[j] = false;\n }\n int ans = 0;\n for(int i=2;i<=N;i++) ans += P[i];\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3300,
"score_of_the_acc": -0.1045,
"final_rank": 14
},
{
"submission_id": "aoj_0009_10483368",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint CountPrime(int n) {\n if (n < 2) return 0;\n vector<bool> isPrime(n + 1, true);\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i * i <= n; i++) {\n if (isPrime[i]) {\n for (int j = i * i; j <= n; j += i) {\n isPrime[j] = false;\n }\n }\n }\n return count(isPrime.begin(), isPrime.end(), true);\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n while (cin >> n) {\n cout << CountPrime(n) << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3480,
"score_of_the_acc": -0.0258,
"final_rank": 5
},
{
"submission_id": "aoj_0009_10404549",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nbool isPrime(int num) {\n if (num <= 1) return false;\n if (num == 2) return true;\n if (num % 2 == 0) return false;\n for (int i = 3; i * i <= num; i += 2) {\n if (num % i == 0) return false;\n }\n return true;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n \n int n;\n while (cin >> n) {\n int counter = 0;\n for (int i = 2; i <= n; ++i) {\n if (isPrime(i)) {\n ++counter;\n }\n }\n cout << counter << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 880,
"memory_kb": 3452,
"score_of_the_acc": -1.0026,
"final_rank": 19
},
{
"submission_id": "aoj_0009_10219642",
"code_snippet": "#include<iostream>\nusing namespace std;\n#define MAX_N 1000000\n\nint prime[MAX_N];\nbool is_prime[MAX_N+1];\nint n;\n\nvoid solve()\n{\n\tint p=0;\n\tis_prime[0]=is_prime[1]=false;\n\tfor(int i=2;i<=n;++i)\n\t is_prime[i]=true;\n\tfor(int i=2;i<=n;++i)\n\t{\n\t if(is_prime[i])\n\t {\n\t prime[p++]=i;\n\t\t\t for(int j=2*i;j<=n;j+=i)\n\t\t\t is_prime[j]=false; \t\n\t\t}\n\t}\n\tprintf(\"%d\\n\",p);\n}\nint main()\n{\n\twhile(scanf(\"%d\",&n)!=EOF)\n\t{\n\t\tsolve();\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4592,
"score_of_the_acc": -0.0487,
"final_rank": 11
},
{
"submission_id": "aoj_0009_10121105",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing u32 = unsigned;\nusing pii = pair<int,int>;\nint sieve(int n){\n\tvector<bool> isCompoiste(n + 1,false);\n\tint ans = 0;\n\tfor (int i = 2; i <= n; ++i){\n\t\tif (!isCompoiste[i]){\n\t\t\tans++;\n\t\t\tfor (int j = 2 * i; j <= n; j += i){\n\t\t\t\tisCompoiste[j] = true;\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\t\t\nint main(){\n cin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tint n;\n\twhile(cin >> n){\n\t\tcout << sieve(n) << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3336,
"score_of_the_acc": -0.0359,
"final_rank": 10
},
{
"submission_id": "aoj_0009_9672102",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include<iostream>\n#include<algorithm>\n#include <vector>\n#include <string>\n#include <queue>\n#include <stdio.h>\n#include <map>\n#include<sstream>\n#include <set>\n#include <string.h>\n#include <math.h>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <iomanip>\n#include <climits>\nusing namespace std;\ntypedef pair<int, int> P;\ntypedef pair<double, double> Pd;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nint main() {\n\tvector<int> primes(10000000, 1);\n\tprimes[0] = 0;\n\tprimes[1] = 0;\n\tfor (int i = 2; i < 10000000; i++) {\n\t\tif (primes[i] == 1) {\n\t\t\tfor (int j = i * 2; j < 10000000; j += i) {\n\t\t\t\tprimes[j] = 0;\n\t\t\t}\n\t\t}\n\t}\n\tvector<int> sum(10000001);\n\trep(i, 10000000) {\n\t\tsum[i + 1] = sum[i] + primes[i];\n\t}\n\tint n;\n\twhile (cin >> n) {\n\t\tcout << sum[n + 1] << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 80764,
"score_of_the_acc": -0.9066,
"final_rank": 18
},
{
"submission_id": "aoj_0009_9654763",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n//\n\nusing uint = unsigned int;\nusing ll = long long;\nusing ull = unsigned long long;\n\nusing paii = pair<int, int>;\nusing pali = pair<ll, int>;\nusing pail = pair<int, ll>;\nusing pall = pair<ll, ll>;\n\n//\n\ntemplate <typename T>\ninline bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }\n\ntemplate <typename T>\ninline bool chmin(T &a, T b) { return a > b ? (a = b, true) : false; }\n\n//\n\nclass IO {\nprivate:\n istream& inStream_;\n ostream& outStream_;\n\npublic:\n IO(istream& inStream, ostream& outStream): inStream_(inStream), outStream_(outStream) {\n inStream_.tie(nullptr);\n ios::sync_with_stdio(false);\n }\n\n ~IO() { outStream_.flush(); }\n\n template <typename T>\n T read() {\n T value;\n inStream_ >> value;\n return value;\n }\n\n template <typename T>\n pair<T, T> read2() { return {read<T>(), read<T>()}; }\n\n template <typename T>\n tuple<T, T, T> read3() { return {read<T>(), read<T>(), read<T>()}; }\n\n template <typename T>\n vector<T> readVector(ll numElems) {\n vector<T> vec;\n vec.reserve(numElems);\n while (numElems-- > 0) {\n vec.push_back(read<T>());\n }\n return vec;\n }\n\n template <typename T>\n void writeLine(const T& value) { outStream_ << value << \"\\n\"; }\n\n void writeLine(double value) {\n ostringstream oss;\n oss << fixed << setprecision(15) << value;\n outStream_ << oss.str() << \"\\n\";\n }\n};\n\n///\n\nstruct Solver {\n IO& io;\n Solver(IO& io): io(io) {}\n\n void solve() {\n for (; ; ) {\n auto s = io.read<string>();\n if (s.empty()) {\n break;\n }\n int n = stoi(s);\n\n vector<bool> primemap = sieve(n);\n int ans = count(primemap.begin(), primemap.end(), true);\n io.writeLine(ans);\n }\n } // solve\n\n vector<bool> sieve(uint n) {\n vector<bool> primemap(n + 1, true);\n primemap[0] = false;\n if (n < 1) {\n return primemap;\n }\n // n >= 1\n primemap[1] = false;\n\n for (int i = 2, sqrtn = (int)sqrt(n); i <= sqrtn; i++) {\n // なぜ√nまででよいのか？\n // 合成数C(√n < C <= n)がふるい落とされることを示せればよい。\n // 合成数Cは√C以下の素数の倍数。√C <= √nであるため、√n以下のすべての素数について\n // ふるい落としを実行すれば、√n以下の素数を約数に持つ全ての合成数C(√n < C <= n)は\n // ふるい落とされる。\n if (primemap[i]) {\n // iの倍数をふるい落とす\n for (int j = i * i; j <= n; j += i) {\n // なぜi * iからでよいのか？\n // 合成数C(C < i * i)がすでにふるい落とされていることを示せばよい。\n // C < i * iより、\n // √C < √(i * i) = i\n // i未満の素数の倍数はすでにふるい落とされているが、√C < iなので√C以下の素数の\n // 倍数もすでにふるい落とされている。\n // よって、√C以下の素数を約数に持つ合成数Cもすでにふるい落とされている。\n primemap[j] = false;\n }\n }\n }\n return primemap;\n }\n};\n\nvoid runSolver(istream& inStream, ostream& outStream) {\n IO io(inStream, outStream);\n Solver solver(io);\n solver.solve();\n}\n\n#ifndef LOCAL\nint main() {\n runSolver(cin, cout);\n}\n#endif // LOCAL",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3500,
"score_of_the_acc": -0.0261,
"final_rank": 6
},
{
"submission_id": "aoj_0009_9653870",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n#define endl \"\\n\"\ntypedef long long ll;\nint f[1000000];\nbool check(int x) {\n for (int i = 2; i * i <= x; i++)\n if (x % i == 0) return false;\n\n return true;\n}\nvoid solved() {\n for (int i = 2; i <= 1000000; i++) {\n f[i] = f[i - 1];\n if (check(i)) f[i]++;\n }\n int n;\n while (scanf(\"%d\", &n) != EOF) {\n cout << f[n] << endl;\n }\n}\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n /*int t = 1;\n cin >> t;\n while (t--)*/\n solved();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 7068,
"score_of_the_acc": -0.2004,
"final_rank": 16
},
{
"submission_id": "aoj_0009_9595282",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n//\n\nusing uint = unsigned int;\nusing ll = long long;\nusing ull = unsigned long long;\n\n//\n\ntemplate <typename T>\ninline bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }\n\ntemplate <typename T>\ninline bool chmin(T &a, T b) { return a > b ? (a = b, true) : false; }\n\n//\n\nclass IO {\nprivate:\n istream& inStream_;\n ostream& outStream_;\n\npublic:\n IO(istream& inStream, ostream& outStream): inStream_(inStream), outStream_(outStream) {\n inStream_.tie(nullptr);\n ios::sync_with_stdio(false);\n }\n\n ~IO() { outStream_.flush(); }\n\n template <typename T>\n T read() {\n T value;\n inStream_ >> value;\n return value;\n }\n\n template <typename T>\n pair<T, T> read2() { return {read<T>(), read<T>()}; }\n\n template <typename T>\n tuple<T, T, T> read3() { return {read<T>(), read<T>(), read<T>()}; }\n\n template <typename T>\n vector<T> readVector(int numElems) {\n vector<T> vec;\n vec.reserve(numElems);\n while (numElems-- > 0) {\n vec.push_back(read<T>());\n }\n return vec;\n }\n\n template <typename T>\n void writeLine(const T& value) { outStream_ << value << \"\\n\"; }\n\n void writeLine(double value) {\n ostringstream oss;\n oss << fixed << setprecision(15) << value;\n outStream_ << oss.str() << \"\\n\";\n }\n};\n\n//\n\nstruct Solver {\n IO& io;\n Solver(IO& io): io(io) {}\n\n void solve() {\n for (;;) {\n auto s = io.read<string>();\n if (s.empty()) {\n break;\n }\n\n int n = stoi(s);\n vector<bool> primeMap = sieve(n);\n int cnt = count(primeMap.begin(), primeMap.end(), true);\n io.writeLine(cnt);\n }\n }\n\n vector<bool> sieve(int n) {\n vector<bool> primeMap(n + 1, true);\n primeMap[0] = false;\n if (n < 1) {\n return primeMap;\n }\n // n >= 1\n primeMap[1] = false;\n\n for (int i = 2, sqrt_n = (int)sqrt(n); i <= sqrt_n; i++) {\n // なぜ√nまでで良いのか？\n // 合成数C(√n < C <= n)がふるい落とされることを示せればよい。\n // 合成数Cは√C以下の素数の倍数。√C <= √nであるため、√n以下のすべての素数について\n // ふるい落としを実行すれば、√n以下の素数を約数に持つすべての合成数C(√n < C <= n)は\n // ふるい落とされる。\n if (primeMap[i]) {\n // iの倍数をふるい落とす\n for (int j = i * i; j <= n; j += i) {\n // なぜi * iからで良いのか？\n // 合成数C(C < i * i)がすでにふるい落とされていることを示せばよい。\n // C < i * iより、\n // √C < √(i * i) = i\n // i未満の素数の倍数はすでにふるい落とされているが、√C < iなので√C以下の素数の\n // 倍数もすでにふるい落とされている。\n // よって、√C以下の素数を約数にもつ合成数Cもすでにふるい落とされている。\n primeMap[j] = false;\n }\n }\n }\n return primeMap;\n }\n};\n\nvoid runSolver(istream& inStream, ostream& outStream) {\n IO io(inStream, outStream);\n Solver solver(io);\n solver.solve();\n}\n\n#ifndef LOCAL\nint main() {\n runSolver(cin, cout);\n}\n#endif // LOCAL",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3504,
"score_of_the_acc": -0.0261,
"final_rank": 7
},
{
"submission_id": "aoj_0009_9579791",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n while (cin >> n) {\n int ans = 0;\n vector<bool> is_prime(n + 1, true);\n is_prime[0] = false;\n is_prime[1] = false;\n for (int i = 2; i * i < (n + 1); i++) {\n if (is_prime[i]) {\n for (int j = i * 2; j < (n + 1); j += i) is_prime[j] = false;\n }\n }\n for (int i = 0; i < n + 1; i++) {\n if (is_prime[i]) ans++;\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3200,
"score_of_the_acc": -0.0345,
"final_rank": 9
},
{
"submission_id": "aoj_0009_9570488",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;++i)\n\nint main(){\n \n vector<int> ps;\n int M = 1e6;\n vector<bool> prime(M+1,true);\n for(int i=2;i<=M;i++){\n if(prime[i]) ps.push_back(i);\n for(int j=i*2;j<=M;j+=i) prime[j] = false;\n }\n int a;\n while(cin >> a){\n int x = upper_bound(ps.begin(),ps.end(),a) - ps.begin();\n cout << x << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3596,
"score_of_the_acc": -0.004,
"final_rank": 2
},
{
"submission_id": "aoj_0009_9472937",
"code_snippet": "#line 1 \"test/aoj/volume/0009.test.cpp\"\n#define PROBLEM \\\n\t\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0009&lang=jp\"\n#line 1 \"daylight/base.hpp\"\n/// @brief 基本テンプレート\n#line 3 \"daylight/base.hpp\"\n#include <bits/stdc++.h>\n\nusing namespace std;\n#define SZ(x) (int) (x).size()\n#define REP(i, n) for(int i = 0; i < (n); i++)\n#define FOR(i, a, b) for(auto i = (a); i < (b); i++)\n#define For(i, a, b, c) \\\n\tfor(auto i = (a); i != (b); i += (c))\n#define REPR(i, n) for(auto i = (n) - 1; i >= 0; i--)\n#define ALL(s) (s).begin(), (s).end()\n#define so(V) sort(ALL(V))\n#define rev(V) reverse(ALL(V))\n#define uni(v) v.erase(unique(ALL(v)), (v).end())\n#define eb emplace_back\n\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<bool> vb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> PI;\ntypedef pair<ll, ll> PL;\nconst double EPS = 1e-6;\nconst int MOD = 1e9 + 7;\nconst int INF = (1 << 30);\nconst ll LINF = 1e18;\nconst double math_PI = acos(-1);\n\ntemplate<typename T>\nvector<T> make_v(size_t a) {\n\treturn vector<T>(a);\n}\n\ntemplate<typename T, typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n\treturn vector<decltype(make_v<T>(ts...))>(\n\t\ta, make_v<T>(ts...));\n}\n\ntemplate<typename T, typename V>\ntypename enable_if<is_class<T>::value == 0>::type fill_v(\n\tT &t, const V &v) {\n\tt = v;\n}\n\ntemplate<typename T, typename V>\ntypename enable_if<is_class<T>::value != 0>::type fill_v(\n\tT &t, const V &v) {\n\tfor(auto &e: t) fill_v(e, v);\n}\n\ntemplate<class T>\nbool chmax(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<class T>\nbool 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 S, typename T>\nistream &operator>>(istream &is, pair<S, T> &p) {\n\tcin >> p.first >> p.second;\n\treturn is;\n}\n\ntemplate<typename T>\nistream &operator>>(istream &is, vector<T> &vec) {\n\tfor(T &x: vec) is >> x;\n\treturn is;\n}\n\ntemplate<typename T>\nstring join(vector<T> &vec, string splitter) {\n\tstringstream ss;\n\tREP(i, SZ(vec)) {\n\t\tif(i != 0) ss << splitter;\n\t\tss << vec[i];\n\t}\n\treturn ss.str();\n}\n\ntemplate<typename T>\nostream &operator<<(ostream &os, vector<T> &vec) {\n\tos << join(vec, \" \");\n\treturn os;\n}\n#line 2 \"daylight/math/eratos.hpp\"\nvoid eratos(int n, vb& isprime) {\n\tisprime = vb(n + 1, true);\n\tisprime[0] = false;\n\tisprime[1] = false;\n\tint last = ((int) sqrt(n)) + 1;\n\tFOR(i, 2, last) {\n\t\tif(isprime[i]) {\n\t\t\tint j = i + i;\n\t\t\twhile(j <= n) {\n\t\t\t\tisprime[j] = false;\n\t\t\t\tj += i;\n\t\t\t}\n\t\t}\n\t}\n}\n#line 5 \"test/aoj/volume/0009.test.cpp\"\nint main() {\n\tvb isPrime;\n\teratos(1000000, isPrime);\n\tint N;\n\twhile(cin >> N) {\n\t\tint ans = 0;\n\t\tREP(i, N + 1) {\n\t\t\tif(isPrime[i]) ans++;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3332,
"score_of_the_acc": -0.0013,
"final_rank": 1
},
{
"submission_id": "aoj_0009_9439841",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nbool isprime[100000005];\nint prime[100000005];\n\nint main()\n{\n\twhile(~scanf(\"%d\",&n))\n\t{\n\t\tint t=0;//用来记质数的个数\n\t\tmemset(isprime,true,sizeof(isprime));\n\t\tfor(int i=2;i<=n;i++)\n\t\t{\n\t\t\tif(isprime[i]) prime[++t]=i;\n\t\t\tfor(int j=1;j<=t&&i*prime[j]<=n;j++)\n\t\t\t{\n\t\t\t\tisprime[i*prime[j]]=false;\n\t\t\t\tif(i%prime[j]==0) break;\n\t\t\t}\n\t\t } \n\t\t cout<<t<<endl; \n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 101172,
"score_of_the_acc": -1.3333,
"final_rank": 20
},
{
"submission_id": "aoj_0009_9434863",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <iostream>\n#include <math.h>\n#include <algorithm>\n\n\nusing namespace std;\nbool isComp[100000005]; \nint main ()\n{\n\tint n;\n\t\n\twhile(~scanf(\"%d\",&n)){\n\t\tint ans=0;\n\tisComp[1]=1; \n\tfor(int i=2;i*i<=n;i++) \n\t{ \n\t if(isComp[i]==0) \n\t for(int j=i*i;j<=n;j+=i) \n\t \tisComp[j]=1; \n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(isComp[i]==0) \n\t\t\tans++;\n\t}\n\tcout<<ans<<endl; \n\t}\n\treturn 0; \n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4196,
"score_of_the_acc": -0.0332,
"final_rank": 8
},
{
"submission_id": "aoj_0009_9434706",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nbool vis[1000000];\nint isPrime[500000],cnt=0,ans;\nint main() {\n\tint x;\n\twhile(scanf(\"%d\",&x)!=EOF) {\n\t\tcnt=0;\n\t\tans=0;\n\t\tmemset(vis,false,sizeof(vis));\n\t\tmemset(isPrime,0,sizeof(isPrime));\n\t\tfor(int i=2;i<=x;i++) {\n\t\t\tif(vis[i]==false) {\n\t\t\t\tans++;\n\t\t\t\tisPrime[++cnt] = i;\n\t\t\t}\n\t\t\tfor(int j=1;j<=cnt&&i*isPrime[j]<=x;j++) {\n\t\t\t\tvis[i*isPrime[j]]=true;\n\t\t\t\tif(i%isPrime[j]==0) break;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 6044,
"score_of_the_acc": -0.0865,
"final_rank": 13
},
{
"submission_id": "aoj_0009_9433075",
"code_snippet": "#include <iostream>\n#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include<math.h>\n#include<stdlib.h>\n#include<algorithm>\n#include<stack>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include <string>\n#include<limits.h>\n#define ll long long \nusing namespace std;\nint n, ans[1000000];\nvoid isprime(int x)\n{\n\tfor(int i=3;i<=x;i++)\n\t{\n\t\tint flag = 0;\n\t\tfor (int j = 2; j <= sqrt(i); j++)\n\t\t{\n\t\t\tif (i % j == 0)\n\t\t\t{\n\t\t\t\tflag = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == 0)//如果为素数就等于之前求的素数和加1\n\t\t\tans[i] = ans[i - 1] + 1;\n\t\telse\n\t\t\tans[i] = ans[i - 1];//不是素数就等于之前求的素数和\n\t}\n}\nint main()\n{\n\tans[2] = 1;\n\tisprime(1000000);\n\twhile (cin >> n)\n\t{\n\t\tif (n == 1)//特判\n\t\t{\n\t\t\tcout << 0 << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tcout << ans[n] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 6916,
"score_of_the_acc": -0.2218,
"final_rank": 17
},
{
"submission_id": "aoj_0009_9392004",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n//\n\nusing uint = unsigned int;\nusing ll = long long;\n\n//\n\nclass IO {\nprivate:\n istream& inStream_;\n ostream& outStream_;\n\npublic:\n IO(istream& inStream, ostream& outStream): inStream_(inStream), outStream_(outStream) {\n inStream_.tie(nullptr);\n ios::sync_with_stdio(false);\n }\n\n ~IO() { outStream_.flush(); }\n\n template <typename T>\n T read() {\n T value;\n inStream_ >> value;\n return value;\n }\n\n template <typename T>\n pair<T, T> read2() { return {read<T>(), read<T>()}; }\n\n template <typename T>\n tuple<T, T, T> read3() { return {read<T>(), read<T>(), read<T>()}; }\n\n template <typename T>\n vector<T> readVector(int numElems) {\n vector<T> vec;\n vec.reserve(numElems);\n while (numElems-- > 0) {\n vec.push_back(read<T>());\n }\n return vec;\n }\n\n template <typename T>\n vector<T> readVector1Based(int numElems) {\n vector<T> vec;\n vec.reserve(numElems + 1);\n vec.push_back(0);\n while (numElems-- > 0) {\n vec.push_back(read<T>());\n }\n return vec;\n }\n\n template <typename T>\n void writeLine(const T& value) { outStream_ << value << \"\\n\"; }\n\n void writeLine(double value) {\n ostringstream oss;\n oss << fixed << setprecision(15) << value;\n outStream_ << oss.str() << \"\\n\";\n }\n};\n\n//\n\nstruct Solver {\n IO& io;\n Solver(IO& io): io(io) {}\n\n void solve() {\n for (;;) {\n auto s = io.read<string>();\n if (s.empty()) {\n break;\n }\n\n int n = stoi(s);\n vector<bool> primeMap = sieve(n);\n int primeCount = count(primeMap.begin(), primeMap.end(), true);\n io.writeLine(primeCount);\n }\n }\n\n vector<bool> sieve(int n) {\n vector<bool> primeMap(n + 1, true);\n primeMap[0] = false;\n if (n == 0) {\n return primeMap;\n }\n primeMap[1] = false;\n\n for (int i = 2, sqrtN = (int)sqrt(n); i <= sqrtN; i++) {\n // なぜ√nまでで良いのか？\n // 合成数C(√n < C <= n)がふるい落とされることを示せればよい。\n // 合成数Cは√C以下の素数の倍数。√C <= √nであるため、√n以下のすべての素数について\n // ふるい落としを実行すれば、n以下のすべての合成数Cはふるい落とされる。\n if (primeMap[i]) {\n // iの倍数をふるい落とす\n for (int j = i * i; j <= n; j += i) {\n // なぜi * iからで良いのか？\n // 現時点でi - 1以下の素数の倍数はすべてふるい落とされている。\n // 1 <= k < iとすると、\n // i - kが素数である場合、i * (i - k)は素数i - kの倍数なのですでにふるい落とされて\n // いる。\n // i - kが合成数である場合、i - kは√(i - k)以下の素数の倍数。i * (i - k)もその素数の\n // 倍数なのですでにふるい落とされている。\n primeMap[j] = false;\n }\n }\n }\n\n return primeMap;\n }\n};\n\nvoid runSolver(istream& inStream, ostream& outStream) {\n IO io(inStream, outStream);\n Solver solver(io);\n solver.solve();\n}\n\n#ifndef LOCAL\nint main() {\n runSolver(cin, cout);\n}\n#endif // LOCAL",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3332,
"score_of_the_acc": -0.0243,
"final_rank": 3
},
{
"submission_id": "aoj_0009_9327480",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int MAX_N = 1000000;\n\nint prime[MAX_N]; \nbool is_prime[MAX_N + 1]; \nint sieve(int);\nint n;\n\nint main() {\n while (cin >> n) {\n cout << sieve(n) << endl;\n }\n}\n\nint sieve(int n) {\n int p = 0;\n for (int i = 0; i <= n; i++)\n is_prime[i] = true;\n is_prime[0] = is_prime[1] = false;\n for (int i = 2; i <= n; i++) {\n if (is_prime[i]) {\n prime[p++] = i;\n for (int j = 2 * i; j <= n; j += i)\n is_prime[j] = false;\n }\n }\n return p; \n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 4332,
"score_of_the_acc": -0.0575,
"final_rank": 12
},
{
"submission_id": "aoj_0009_9310128",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n//\n\nusing ll = long long;\n\n//\n\nclass IO {\nprivate:\n istream& inStream;\n ostream& outStream;\n\npublic:\n IO(istream& inStream, ostream& outStream): inStream(inStream), outStream(outStream) {\n inStream.tie(nullptr);\n ios::sync_with_stdio(false);\n }\n\n ~IO() { outStream.flush(); }\n\n template <typename T>\n T read() {\n T value;\n inStream >> value;\n return value;\n }\n\n template <typename T>\n pair<T, T> read2() { return {read<T>(), read<T>()}; }\n\n template <typename T>\n tuple<T, T, T> read3() { return {read<T>(), read<T>(), read<T>()}; }\n\n template <typename T>\n vector<T> readVector(int numElems) {\n vector<T> vec;\n vec.reserve(numElems);\n while (numElems-- > 0) {\n vec.push_back(read<T>());\n }\n return vec;\n }\n\n template <typename T>\n vector<T> readVector1Based(int numElems) {\n vector<T> vec;\n vec.reserve(numElems + 1);\n vec.push_back(0);\n while (numElems-- > 0) {\n vec.push_back(read<T>());\n }\n return vec;\n }\n\n template <typename T>\n void writeLine(const T& value) { outStream << value << \"\\n\"; }\n\n void writeLine(double value) {\n ostringstream oss;\n oss << fixed << setprecision(15) << value;\n outStream << oss.str() << \"\\n\";\n }\n};\n\n//\n\nstruct Solver {\n IO& io;\n Solver(IO& io): io(io) {}\n\n void solve() {\n for (;;) {\n auto s = io.read<string>();\n if (s.empty()) {\n break;\n }\n int n = stoi(s);\n\n vector<bool> primeMap = sieve(n);\n int primeCount = count(primeMap.begin(), primeMap.end(), true);\n io.writeLine(primeCount);\n }\n }\n\n vector<bool> sieve(int n) {\n vector<bool> primeMap(n + 1, true);\n primeMap[0] = false;\n if (n == 0) {\n return primeMap;\n }\n\n primeMap[1] = false;\n for (int i = 2, sqrtN = (int)sqrt(n); i <= sqrtN; i++) {\n // なぜsqrt(n)まででよいのか？\n // √nまでのループによって、√n < C <= nであるような合成数Cが必ずふるい落とされることを\n // 示せればよい。\n // Cは合成数なので必ず√C以下の素数の約数をもつ。C <= nより√C <= √n。√nまでのループに\n // より√C以下の素数の倍数は必ずふるい落とされる。よって√C以下の素数の約数をもつCは\n // 必ずふるい落とされる。\n\n if (primeMap[i]) {\n // iの倍数をふるい落とす\n for (int j = i * i; j <= n; j += i) {\n // なぜi * iからでよいのか？\n // mを2 <= m <= i - 1であるような整数とするとき、i * mについて考える。\n // mが素数の場合、i * mは素数mの倍数であるためすでにふるい落とされている。\n // mが合成数の場合、mはq <= √mであるような素数qの倍数。よってi * mも素数qの\n // 倍数であるため、すでにふるい落とされている。\n primeMap[j] = false;\n }\n }\n }\n\n return primeMap;\n }\n};\n\nvoid runSolver(istream& inStream, ostream& outStream) {\n IO io(inStream, outStream);\n Solver solver(io);\n solver.solve();\n}\n\n#ifndef LOCAL\nint main() {\n runSolver(cin, cout);\n}\n#endif // LOCAL",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3340,
"score_of_the_acc": -0.0244,
"final_rank": 4
},
{
"submission_id": "aoj_0009_9304115",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <sstream>\n#include <vector>\nusing namespace std;\n\nint count_prime(int n);\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n while (!cin.eof()) {\n \n int d;\n string line;\n stringstream ss;\n while (getline(cin, line)) {\n ss.str(line);//set buffer\n ss >> d;\n if (!ss.str().empty()) {\n cout<<count_prime(d)<<endl;\n }\n ss.seekg(0);\n }\n }\n}\n\nint count_prime(int n) {\n int count = 0;\n vector<int> primes(n, 0);\n vector<int> flags(n, 0);\n int p = 0;\n for (auto i = 2; i <= n; i++) {\n if (!flags[i - 2]) {\n primes[p++] = i;\n count++;\n }\n for (auto j = 0; primes[j] * i <= n; j++) {\n flags[primes[j] * i - 2] = 1;\n if (i % primes[j] == 0)\n break;\n }\n }\n \n return count;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 11884,
"score_of_the_acc": -0.1461,
"final_rank": 15
}
] |
aoj_0070_cpp
|
Combination of Number Sequences
0 から 9 までの整数を使った
n
個の数の並び
k
1
,
k
2
, ...,
k
n
を考えます。正の整数
n
と
s
を読み込んで、
k
1
+ 2 × k
2
+ 3 × k
3
+
...
+ n × k
n
= s
となっているような
n
個の数の並びが何通りあるかを出力するプログラムを作成してください。ただし、1 つの「
n
個の数の並び」には同じ数が 2 回以上現われないものとします。
Input
入力は複数のデータセットからなります。各データセットとして、
n
(1 ≤
n
≤ 10) と
s
(0 ≤
s
≤ 10,000)が空白区切りで１行に与えられます。
データセットの数は 100 を超えません。
Output
データセットごとに、
n
個の整数の和が
s
になる組み合わせの個数を１行に出力します。
Sample Input
3 10
3 1
Output for the Sample Input
8
0
|
[
{
"submission_id": "aoj_0070_10760652",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n\nusing namespace std;\n\nint** table;\n\nvoid recursive(int sum,bool checkTable[10],int count){\n\tif(count == 10)return;\n\n\tbool new_table[10-count][10];\n\n\tfor(int i = 0; i < 10-count;i++){\n\t\tfor(int k = 0; k < 10; k++)new_table[i][k] = checkTable[k];\n\t}\n\n\tint index = 0;\n\tfor(int i = 0; i <= 9; i++){\n\t\tif(checkTable[i] == false){\n\t\t\tnew_table[index][i] = true;\n\t\t\ttable[count+1][sum+(count+1)*i]++;\n\t\t\trecursive(sum+(count+1)*i,new_table[index],count+1);\n\t\t\tindex++;\n\t\t}\n\t}\n}\n\nint main(){\n\n\ttable = new int*[11];\n\tfor(int i = 1; i <= 10; i++){\n\t\ttable[i] = new int[10001];\n\t\tfor(int k = 0; k <= 10000; k++)table[i][k] = 0;\n\t}\n\n\tbool checkTable[10];\n\tfor(int i = 0; i < 10; i++)checkTable[i] = false;\n\n\trecursive(0,checkTable,0);\n\n\tint n,s;\n\n\twhile(scanf(\"%d %d\",&n,&s) != EOF){\n\t\tprintf(\"%d\\n\",table[n][s]);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3108,
"score_of_the_acc": -0.1068,
"final_rank": 7
},
{
"submission_id": "aoj_0070_9629811",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n int n, s;\n while(cin >> n >> s){\n int ans=0;\n for(int i=0; i<(1<<10); i++){\n bitset<10> now(i);\n if(now.count()!=n) continue;\n vector<int> use(n);\n int cnt=0;\n for(int j=0; j<10; j++){\n if(now.test(j)){\n use[cnt]=j; cnt++;\n }\n }\n do{\n int kari=0;\n for(int k=0; k<n; k++) kari+=use[k]*(k+1);\n if(kari==s) ans++;\n }while(next_permutation(use.begin(), use.end()));\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 590,
"memory_kb": 3304,
"score_of_the_acc": -0.6199,
"final_rank": 15
},
{
"submission_id": "aoj_0070_9148103",
"code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to, cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, int cost) : to(to), cost(cost) {}\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nvector<string> split_str(string S, char c) {\n vector<string> ret;\n stringstream ss;\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == c) {\n ret.pb(ss.str());\n ss.str(\"\");\n ss.clear();\n } else {\n ss << S[i];\n }\n }\n ret.pb(ss.str());\n return ret;\n}\n\nsigned main() {\n int N = 10;\n int K, S;\n while (cin >> K >> S) {\n vector<int> P(N);\n for (int i = 0; i < N; i++) P[i] = i;\n\n int ans = 0;\n do {\n int sum = 0;\n for (int i = 0; i < K; i++) {\n sum += P[i] * (i + 1);\n }\n if (sum == S) ans++;\n reverse(P.begin() + K, P.end());\n } while (next_permutation(P.begin(), P.end()));\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 950,
"memory_kb": 3188,
"score_of_the_acc": -1.0014,
"final_rank": 18
},
{
"submission_id": "aoj_0070_7826313",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int m = 10;\n vector<vector<int>> dp(1<<m,vector<int>(10001));\n dp[0][0] = 1;\n for (int i = 0; i < (1<<m); ++i) {\n for (int j = 0; j < dp[0].size(); ++j) {\n if (!dp[i][j]) continue;\n for (int k = 0; k < m; ++k) {\n if ((1<<k)&i) continue;\n dp[i+(1<<k)][j + (__builtin_popcount(i) + 1) * k] += dp[i][j];\n }\n }\n }\n int n,s;\n while (cin >> n >> s) {\n int res = 0;\n for (int i = 0; i < (1<<m); ++i) {\n if (__builtin_popcount(i) == n) res += dp[i][s];\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 43088,
"score_of_the_acc": -0.5001,
"final_rank": 13
},
{
"submission_id": "aoj_0070_7527927",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\n#define rep(i,n) for(i=0; i<n; i++)\n\nint main() {\n\tint n, s, ans, i, c;\n\tvector<int> a(10, 0);\n\twhile (cin >> n) {\n\t\tcin >> s;\n\t\trep(i, 10) {\n\t\t\ta[i] = max(0, i + (n - 9));\n\t\t}\n\t\tans = 0;\n\t\tdo {\n\t\t\tc = 0;\n\t\t\trep(i, 10) {\n\t\t\t\tc += i * a[i];\n\t\t\t}\n\t\t\tans += (c == s);\n\t\t} while (next_permutation(a.begin(), a.end()));\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 3132,
"score_of_the_acc": -0.5858,
"final_rank": 14
},
{
"submission_id": "aoj_0070_7443374",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nvvll memo;\n\nvoid dfs(ll sum,ll depth,vll& history){\n\tif(depth==10){\n\t\treturn;\n\t}\n\n\tfor(ll i=0;i<10;i++){\n\t\tif(history[i]) continue;\n\t\thistory[i]=1;\n\t\tmemo[depth][sum+(depth+1)*i]++;\n\t\tdfs(sum+(depth+1)*i,depth+1,history);\n\t\thistory[i]=0;\n\t}\n\treturn;\n}\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tmemo.resize(10,vll(331,0));\n\tvll H(10,0);\n\tdfs(0,0,H);\n\n\tll N,S;\n\twhile(cin>>N>>S){\n\t\tif(S>330){\n\t\t\tout(0);\n\t\t}\n\t\telse out(memo[N-1][S]);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3296,
"score_of_the_acc": -0.0879,
"final_rank": 4
},
{
"submission_id": "aoj_0070_7102820",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n, s, memo[12][(1<<12)][312];\nint dp(int k, int bit, int sum){\n if(k == n+1){\n if(sum == s) return 1;\n else return 0;\n }\n if(memo[k][bit][sum] != -1) return memo[k][bit][sum];\n int res = 0;\n for(int i=0;i<10;i++){\n if((bit&(1<<i)) != 0) continue;\n res += dp(k+1, (bit|(1<<i)), sum+k*i);\n }\n return memo[k][bit][sum] = res;\n}\nint main(){\n while(cin >> n >> s){\n memset(memo, -1, sizeof(memo));\n cout << dp(1, 0, 0) << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 62996,
"score_of_the_acc": -1.0788,
"final_rank": 19
},
{
"submission_id": "aoj_0070_6945184",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cmath>\n\nusing namespace std;\nint n, s;\nint memo[1 << 11][10001];\n\nint dfs(int d, int sum, int used, int used_num) {\n if(sum > s) {\n return 0;\n }\n\n if(d >= 10 || used_num >= n) {\n return used_num == n && sum == s;\n }\n\n if(memo[used][sum] != -1){\n return memo[used][sum];\n }\n\n int res = 0;\n for(int i = 0; i < 10; i++) {\n if(used & (1 << i)) {\n continue;\n }\n res += dfs(d + 1, sum + (d + 1)*i, used^(1 << i), used_num + 1);\n }\n\n return memo[used][sum] = res;\n}\n\nint main() {\n\n while(cin >> n >> s) {\n for(int i = 0; i < 1 << 11; i++){\n for(int j = 0; j < 10001; j++){\n memo[i][j] = -1;\n }\n }\n cout << dfs(0, 0, 0, 0) << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 840,
"memory_kb": 83076,
"score_of_the_acc": -1.883,
"final_rank": 20
},
{
"submission_id": "aoj_0070_6930045",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n, s;\n vector<vector<int>> dp(11, vector<int>(10001));\n function<void(int,int,int)> dfs = [&](int i, int S, int sumv){\n dp[i - 1][sumv]++;\n if(i == 11)return;\n for(int j = 0; j < 10; j++){\n if(S >> j & 1)dfs(i + 1, S ^ (1 << j), sumv + j * i);\n }\n };\n dfs(1, (1 << 10) - 1, 0);\n while(cin >> n >> s){\n cout << dp[n][s] << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3336,
"score_of_the_acc": -0.0884,
"final_rank": 5
},
{
"submission_id": "aoj_0070_6752802",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n int N=-1,S;\n cin >> N >> S;\n if(N == -1) break;\n if(500 <= S) cout << 0 << endl;\n else{\n vector<vector<int>> dp(1024,vector<int>(S+1,0));\n dp[0][0] = 1;\n for(int i=0;i<1024;i++){\n int cnt = 0;\n vector<bool> used(10,false);\n for(int j=0;j<10;j++){\n if(i & (1<<j)){\n cnt++;\n used[j] = true;\n }\n }\n for(int j=0;j<10;j++){\n if(!(i & (1<<j))){\n int ni = i+(1<<j);\n for(int k=0;k<=S;k++){\n int nk = k+(cnt+1)*j;\n if(nk <= S) dp[ni][nk] += dp[i][k];\n }\n }\n }\n }\n int ans = 0;\n for(int i=0;i<1024;i++){\n int cnt = 0;\n for(int j=0;j<10;j++){\n if(i & (1<<j)){\n cnt++;\n }\n }\n if(cnt == N) ans += dp[i][S];\n }\n cout << ans << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4540,
"score_of_the_acc": -0.0396,
"final_rank": 1
},
{
"submission_id": "aoj_0070_5758286",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<sstream>\n#include<regex>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-10;\nint ary[11][10001];\nsigned main(){\n\tint tmp[10];\n\tiota(tmp,tmp+10,0);\n\tdo{\n\t\tint sum=0;\n\t\tfor(int i=0;i<10;i++){\n\t\t\tsum+=(i+1)*tmp[i];\n\t\t\tary[i+1][sum]++;\n\t\t}\n\t}while(next_permutation(tmp,tmp+10));\n\tfor(int i=1;i<10;i++)\n\t\tfor(int j=1;j<=10-i;j++)\n\t\t\tfor(int k=0;k<=10000;k++)\n\t\t\t\tary[i][k]/=j;\n\tint n,s;\n\twhile(cin>>n>>s)\n\t\tcout<<ary[n][s]<<endl;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4148,
"score_of_the_acc": -0.0453,
"final_rank": 2
},
{
"submission_id": "aoj_0070_5247284",
"code_snippet": "#include <bits/stdc++.h>\n#define NIL (-1)\n#define LL long long\nusing namespace std;\nconst int64_t MOD = 1e9 + 7;\nconst int INF = INT_MAX;\nconst double PI = acos(-1.0);\n\nint n, s, ans;\nvector<vector<int>> vec(10, vector<int>(10000, 0));\nvector<bool> used(10,0);\nbool num[10] = { 0 };\n\nvoid combinations(int c, int sum) {\n\t/*for (int i = 0; i < 10; i++) cout << num[i];\n\tcout << endl;*/\n\tif (c == 11) return;\n\tfor (int i = 0; i < 10; i++) {\n\t\tif (used[i]) continue;\n\t\tused[i] = 1;\n\t\t++vec[c][sum + i * (c + 1)];\n\t\tcombinations(c + 1, sum + i * (c + 1));\n\t\tused[i] = 0;\n\t}\n}\n\nint main() {\n\tint sum = 0;\n\tcombinations(0, 0);\n\n\twhile (cin >> n >> s) {\n\t\tcout << vec[n-1][s] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3196,
"score_of_the_acc": -0.1292,
"final_rank": 11
},
{
"submission_id": "aoj_0070_5247283",
"code_snippet": "#include <bits/stdc++.h>\n#define NIL (-1)\n#define LL long long\nusing namespace std;\nconst int64_t MOD = 1e9 + 7;\nconst int INF = INT_MAX;\nconst double PI = acos(-1.0);\n\nint n, s, ans;\nvector<vector<int>> vec(10, vector<int>(10000, 0));\nvector<bool> used(10,0);\nbool num[10] = { 0 };\n\nvoid combinations(int c, int sum) {\n\t/*for (int i = 0; i < 10; i++) cout << num[i];\n\tcout << endl;*/\n\tif (c == 11) return;\n\tfor (int i = 0; i < 10; i++) {\n\t\tif (num[i]) continue;\n\t\tnum[i] = 1;\n\t\t++vec[c][sum + i * (c + 1)];\n\t\tcombinations(c + 1, sum + i * (c + 1));\n\t\tnum[i] = 0;\n\t}\n}\n\nint main() {\n\tint sum = 0;\n\tcombinations(0, 0);\n\n\twhile (cin >> n >> s) {\n\t\tcout << vec[n-1][s] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3240,
"score_of_the_acc": -0.1191,
"final_rank": 9
},
{
"submission_id": "aoj_0070_5247277",
"code_snippet": "#include <bits/stdc++.h>\n#define NIL (-1)\n#define LL long long\nusing namespace std;\nconst int64_t MOD = 1e9 + 7;\nconst int INF = INT_MAX;\nconst double PI = acos(-1.0);\n\nint n, s, ans;\nvector<vector<int>> vec(10, vector<int>(10000, 0));\nvector<bool> used(10,0);\nbool num[10] = { 0 };\n\nvoid combinations(int c, int sum) {\n\tif (c == 11) return;\n\tfor (int i = 0; i < 10; i++) {\n\t\tif (num[i]) continue;\n\t\tnum[i] = 1;\n\t\t++vec[c][sum + i * (c + 1)];\n\t\tcombinations(c + 1, sum + i * (c + 1));\n\t\tnum[i] = 0;\n\t}\n}\n\nint main() {\n\tused.assign(10, 0);\n\tint sum = 0;\n\tcombinations(0, 0);\n\n\twhile (cin >> n >> s) {\n\t\tcout << vec[n-1][s] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3248,
"score_of_the_acc": -0.1192,
"final_rank": 10
},
{
"submission_id": "aoj_0070_5247275",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint n, s, res[10][330] = { 0 };\nbool num[10] = { 0 };\nvoid combinations(int c, int sum) {\n\tif (c == 11) return ;\n\tfor (int i = 0; i < 10; i++) {\n\t\tif (num[i]) continue;\n\t\tnum[i] = 1;\n\t\t++res[c + 1][sum + i * (c + 1)];\n\t\tcombinations(c + 1, sum + i * (c + 1));\n\t\tnum[i] = 0;\n\t}\n}\n\nint main() {\n\tcombinations(0, 0);\n\twhile (cin >> n) {\n\t\tcin >> s;\n\t\tif (s > 330) {\n\t\t\tn = 0;\n\t\t\ts = 0;\n\t\t}\n\t\tcout << res[n][s] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3092,
"score_of_the_acc": -0.0959,
"final_rank": 6
},
{
"submission_id": "aoj_0070_4903343",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\n#ifdef _DEBUG\n#define PRE_COMMAND \\\n std::cin.rdbuf(in.rdbuf()); \\\n std::cout << fixed << setprecision(15);\n#else\n#define PRE_COMMAND cout << fixed << setprecision(15);\n#endif\nconst double EPS = 1e-10, PI = acos(-1.0);\ntemplate <class T> auto MAX(T& seq) {\n return *max_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto MIN(T& seq) {\n return *min_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto SUM(T& seq) {\n T temp{0};\n auto& temp2 = temp[0];\n return accumulate(seq.begin(), seq.end(), temp2);\n}\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\n sort(seq.begin(), seq.end(), sort_order);\n}\ntemplate <class T> void SORTR(vector<T>& seq) {\n sort(seq.begin(), seq.end(), greater<T>());\n}\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\n while (k) {\n if (k & 1) now = (now * n) % mod;\n n = (n * n) % mod;\n k >>= 1;\n }\n return now;\n}\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\n for (T& x : vec) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n if (!v.size()) return os;\n typename vector<T>::const_iterator ii = v.begin();\n os << *ii++;\n for (; ii != v.end(); ++ii) os << \" \" << *ii;\n return os;\n}\n\nvector<int> permutations(vector<int> v, int size = -1) {\n int idx = 0, idx_pre, n = (int)v.size(), ret_size = 1, x = 0;\n if (size == -1) size = n;\n for (int i = n; i > n - size; i--) ret_size *= i;\n vector<int> perm(ret_size, 0);\n vector<int> step(size, 0), idx_pre_v(size--, 0);\n bool down = true;\n int q;\n while (x >= 0) {\n if (x == size) {\n idx -= x;\n for (int i = x; i < n; i++) perm[idx + i] += v[i] * (x + 1);\n idx += n, down = false, x--;\n } else {\n if (down) {\n swap(v[x], v[step[x]]);\n idx_pre_v[x++] = idx;\n idx_pre_v[x] = idx, step[x] = x;\n } else {\n q = v[x] * (x + 1);\n for (int j = idx_pre_v[x]; j < idx; j++) perm[j] += q;\n swap(v[x], v[step[x]++]);\n if (step[x] == n) {\n x--;\n } else {\n down = true;\n }\n }\n }\n }\n return perm;\n}\n\nint main() {\n PRE_COMMAND\n int n, s;\n vector<vector<int>> p(11);\n vector<int> v = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\n for (int i = 1; i < 11; i++) { p[i] = permutations(v, i); }\n while (cin >> n >> s) {\n int ans2 = 0;\n for (int a : p[n]) {\n if (a == s) ans2++;\n }\n cout << ans2 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 41388,
"score_of_the_acc": -0.6278,
"final_rank": 16
},
{
"submission_id": "aoj_0070_4809973",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\ntemplate <class BI>\nbool next_partial_permutation(BI first, BI middle, BI last){\n reverse(middle, last);\n return next_permutation(first, last);\n}\n\n\nint main(){\n int n,s;\n while(cin >> n >> s){\n vector<int> a(10);\n for(int i=0; i<10; i++){\n a[i] = i;\n }\n int ans = 0;\n do{\n int sub = 0;\n for(int i=0; i<n; i++){\n sub += (i+1)*a[i];\n }\n if(sub == s) ans++;\n }while(next_partial_permutation(a.begin(), a.begin()+n, a.end()));\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 790,
"memory_kb": 3076,
"score_of_the_acc": -0.8298,
"final_rank": 17
},
{
"submission_id": "aoj_0070_4469846",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define modulo K\n#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)\n#define Inf 10000000000000\n\nint main(){\n\t\n\tvector<vector<int>> X(10,vector<int>(100001,0));\n\tvector<int> t = {0,1,2,3,4,5,6,7,8,9};\n\t\n\tdo{\n\t\tint S=0;\n\t\tfor(int i=0;i<10;i++){\n\t\t\tS += (i+1) * t[i];\n\t\t\tX[i][S]++;\n\t\t}\n\t}\n\twhile(next_permutation(t.begin(),t.end()));\n\t\n\tint x = 1;\n\tfor(int i=9;i>=0;i--){\n\t\tfor(int j=0;j<X[i].size();j++)X[i][j]/=x;\n\t\tx *= 10-i;\n\t}\n\t\n\tint n,s;\n\twhile(cin>>n>>s){\n\t\tcout<<X[n-1][s]<<endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 6824,
"score_of_the_acc": -0.0788,
"final_rank": 3
},
{
"submission_id": "aoj_0070_4449646",
"code_snippet": "#pragma GCC optimize(\"O3\")\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\n\nusing ll = long long;\nusing P = pair<int, int>;\nusing T = tuple<int, int, int>;\n\ntemplate <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}\ntemplate <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}\n\nconstexpr int MOD = 1e9 + 7;\nconstexpr int inf = 1e9;\nconstexpr long long INF = 1e18;\n\n#define all(a) (a).begin(), (a).end()\n\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\n\nvector<vector<int>> ans(20, vector<int>(1000));\nbool used[20];\n\nvoid solve(int level, int sum){\n if(10 < level) return ;\n\n for(int i=0; i<=9; i++){\n if(used[i]) continue;\n used[i] = true;\n ans[level+1][sum+(level+1)*i]++;\n solve(level + 1, sum + (level + 1) * i);\n used[i] = false;\n }\n\n return ;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n solve(0, 0);\n \n int n, s;\n while(cin>>n>>s){\n if(330 < s) s = 0, n = 0;\n cout << ans[n][s] << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3232,
"score_of_the_acc": -0.2254,
"final_rank": 12
},
{
"submission_id": "aoj_0070_4249516",
"code_snippet": "#include<bits/stdc++.h>\n#define int long long\n#define for0(i, n) for(int i = 0; i < (n); i++)\nusing namespace std;\nint n, s;\nint sum = 0;\nbool b[20];\nint f(int k) {\n\tif (sum + 9 * k * (k + 1) / 2 < s)return 0;\n\tint r = 0;\n\tif (k == 0) return s == sum;\n\tfor0(i, 10) {\n\t\tif (sum + i * k > s)break;\n\t\tif (b[i])continue;\n\t\tb[i] = 1; sum += k * i;\n\t\tr += f(k - 1);\n\t\tb[i] = 0; sum -= k * i;\n\t}\n\treturn r;\n}\nsigned main() {\n\twhile (cin >> n >> s) printf(\"%d\\n\", f(n));\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3212,
"score_of_the_acc": -0.1081,
"final_rank": 8
}
] |
aoj_0090_cpp
|
シールの重なり
1 辺の長さが 10 の正方形の折り紙に半径 1 の円形のシールを
n
枚貼ります。シールは重ねて貼ることができます。シールを貼る位置の座標を読み込んで、折り紙上でもっとも多くシールが重なっている場所(シールが１枚だけでも"重なっている"とする)でのシールの枚数を出力するプログラムを作成してください。
折り紙の左下を原点とした
x, y
座標を与えます。この
x, y
を円の中心としてシールを貼ることとします。円の中心が折り紙の外に出ることはありません。また、同一座標に複数のシールが貼られることはありません。
Input
複数のデータセットが与えられます。各データセットは以下のような形式で与えられます。
n
x
1
,
y
1
x
2
,
y
2
:
x
n
,
y
n
１行目にシールの枚数
n
(0 ≤ 100) が与えられます。続く
n
行に、各シールの中心座標が与えられます。
x
i
,
y
i
は
i
枚目のシールの中心の
x
座標と
y
座標を表します。各値は小数点以下最大 6 桁までの数字を含む実数で与えられます。
n
が 0 のとき、入力の最後とします。データセットの数は 50 を超えません。
Output
各データセットに対し、折り紙上で最も多くシールが重なっている場所でのシールの枚数（整数）を出力して下さい。
Sample Input
15
3.14979,8.51743
2.39506,3.84915
2.68432,5.39095
5.61904,9.16332
7.85653,4.75593
2.84021,5.41511
1.79500,8.59211
7.55389,8.17604
4.70665,4.66125
1.63470,4.42538
7.34959,4.61981
5.09003,8.11122
5.24373,1.30066
0.13517,1.83659
7.57313,1.58150
0
Output for the Sample Input
4
Hint
入力例のようにシールを貼った図です。円はシール、数字は入力例の行数を表しています。
点(2.3,4.6)では、入力例の 2 行目、3 行目、6 行目、10 行目の 4 枚のシールが重なっています。
6 と 9 のおのおのの中心の距離は 2.01293 なので、シールは重なっていません。1 と 12 のおのおのの中心の距離は 1.98231 なので、シールは重なっています。
２つの円が接しているとき（おのおのの中心の距離が 2 のとき）は、重なっているものとします。
|
[
{
"submission_id": "aoj_0090_9258136",
"code_snippet": "#pragma region Macros\n \n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n \n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n \n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n \n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n \n#define next asdnext\n#define prev asdprev\n \nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n \nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n \nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n \n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n bool operator <(const Edge& e) { return this->cost < e.cost; }\n bool operator >(const Edge& e) { return this->cost > e.cost; }\n};\n \nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n \nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n \n \n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = x / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n \ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n \ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n \nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n \n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n \nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n \n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n \n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n \n int size() { return sz; }\n \n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n \nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n \ntemplate<typename T>\nstruct BIT {\n int N; \n vector<T> bit[2]; \n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<T> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n \ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n \n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n \nusing mint = Modint<MOD>;\n \nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n \nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n \nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n \n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n \nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n \n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n \n \n#pragma endregion\n\nstruct Point {\n\tdouble x, y;\n\n\tPoint() {}\n\tPoint(double x, double y) : x(x), y(y) {}\n\n\tPoint operator+(const Point& p) const { return Point(x + p.x, y + p.y); }\n\tPoint operator-(const Point& p) const { return Point(x - p.x, y - p.y); }\n\tPoint operator*(const double& k) const { return Point(x * k, y * k); }\n\tPoint operator/(const double& k) const { return Point(x / k, y / k); }\n\n\tfriend istream& operator>>(istream& is, Point& p) {\n\t\tis >> p.x >> p.y;\n\t\treturn is;\n\t}\n\tfriend ostream& operator<<(ostream& os, Point& p) {\n\t\tos << p.x << \" \" << p.y;\n\t\treturn os;\n\t}\n\n\tbool operator==(const Point& p) const { return (fabs(x - p.x) < EPS && fabs(y - p.y) < EPS); }\n\t// bool operator!=(const Point& p) const { return (fabs(x - p.x) > EPS or fabs(y - p.y) > EPS); }\n\tbool operator<(const Point& p) const { return (x != p.x ? x < p.x : y < p.y); }\n\t// (x, y) の辞書順比較\n\n\tdouble norm() { return x * x + y * y; }\n\tdouble abs() { return sqrt(norm()); }\n};\n\ntypedef Point Vector;\n\ndouble radToDeg(double radian) { return radian * 180.0 / PI; }\ndouble degToRad(double degree) { return degree * PI / 180.0; }\n\nint sign(double x) { return x < -EPS ? -1 : x > EPS; } // -1(負)/0/1(正)\n\ndouble norm(Vector a) { return a.x * a.x + a.y * a.y; }\ndouble abs(Vector a) { return sqrt(norm(a)); }\ndouble dist(Point a, Point b) { return sqrt(norm(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\nVector orth(Vector p) { return {-p.y, p.x}; }\n\ndouble arg(Vector p) { return atan2(p.y, p.x); } // 偏角\nPoint polar(double r, double a) { return Point(cos(a) * r, sin(a) * r); } // 極座標から直交座標への変換\n\nbool isParallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }\nbool isOrthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }\n// bool isSameLine(Vector a, Vector b) { return equals(); }\n\nstruct EndPoint { // 端点の構造体(マンハッタン幾何)\n\tPoint p;\n\tint seg, st; // 点のid, 点の種別\n\n\tEndPoint() {}\n\tEndPoint(Point p, int seg, int st) : p(p), seg(seg), st(st) {}\n\n\tbool operator<(const EndPoint& ep) const {\n\t\tif (p.y == ep.p.y) return st < ep.st;\n\t\treturn p.y < ep.p.y;\n\t}\n};\n\nstruct Segment {\n\tPoint p1, p2;\n\n\tSegment() {}\n\tSegment(Point p1, Point p2) : p1(p1), p2(p2) {}\n\n\tfriend istream& operator>>(istream& is, Segment& s) {\n\t\tis >> s.p1 >> s.p2;\n\t\treturn is;\n\t}\n\n\t// 未verify\n bool operator==(const Segment& s) const { return (abs(p1 - s.p1) < EPS && abs(p2 - s.p2) < EPS); }\n\tbool operator!=(const Segment& s) const { return (abs(p1 - s.p1) > EPS or abs(p2 - s.p2) > EPS); }\n};\n\nstruct Line {\n\tPoint p1, p2;\n\n\tLine() {}\n\tLine(Point p1, Point p2) : p1(p1), p2(p2) {}\n\t// Ax + By = C\n Line(double A, double B, double C) {\n if (equals(A, 0)) {\n p1 = Point(0, C / B), p2 = Point(1, C / B);\n } else if (equals(B, 0)) {\n p2 = Point(C / A, 0), p2 = Point(C / A, 1);\n } else {\n p1 = Point(0, C / B), p2 = Point(C / A, 0);\n }\n }\n\n\tfriend istream& operator>>(istream& is, Line& l) {\n\t\tis >> l.p1 >> l.p2;\n\t\treturn is;\n\t}\n\n\tbool operator==(const Line& l) const { \n if (abs(cross(p1 - l.p1, l.p2 - l.p1)) > EPS) return false;\n if (abs(cross(p2 - l.p1, l.p2 - l.p1)) > EPS) return false;\n return true;\n }\n\t// bool operator<(const Line& l) const { return (l.p2.y - l.p1.y) * (p2.x - p1.x) < (l.p2.x - l.p1.x) * (p2.y - p1.y); }\n};\n\n\nbool isParallel(Segment S1, Segment S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Line S1, Line S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Line S1, Segment S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Segment S1, Line S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\nbool isOrthogonal(Segment S1, Segment S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Line S1, Line S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Line S1, Segment S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Segment S1, Line S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\n// bool isSameLine(Segment S1, Segment S2) { return isSameLine(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isSameLine(Line L1, Line L2) { \n if (abs(cross(L1.p1 - L2.p1, L2.p2 - L2.p1)) > EPS) return false;\n if (abs(cross(L1.p2 - L2.p1, L2.p2 - L2.p1)) > EPS) return false;\n return true;\n}\n// bool isSameLine(Line L1, Segment S2) { return isSameLine(L1.p2 - L1.p1, S2.p2 - S2.p1); }\n// bool isSameLine(Segment S1, Line S2) { return isSameLine(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\nbool onSegment(Segment S, Point p) {\n\tif (sign(cross(S.p1-p, S.p2-p)) != 0) return false;\n \tif (sign( dot(S.p1-p, S.p2-p)) > 0) return false;\n\treturn true;\n}\nbool onLine(Line L, Point p) {\n\tif (sign(cross(L.p1-p, L.p2-p)) != 0) return false;\n\treturn true;\n}\n\nPoint project(Segment s, Point p) { // 点の射影\n\tVector base = s.p2 - s.p1;\n\tdouble r = dot(p - s.p1, base) / base.norm();\n\treturn s.p1 + base * r;\n}\n\nPoint reflect(Segment s, Point p) { // 点の反射\n\treturn p + (project(s, p) - p) * 2.0;\n}\n\nPoint projectL(Line s, Point p) { // 点の射影\n\tVector base = s.p2 - s.p1;\n\tdouble r = dot(p - s.p1, base) / base.norm();\n\treturn s.p1 + base * r;\n}\n\nPoint reflectL(Line l, Point p) { // 点の反射\n\treturn p + (project(Segment(l.p1, l.p2), p) - p) * 2.0;\n}\n\nstruct Circle {\n\tPoint c;\n\tdouble r;\n\n\tCircle() {}\n\tCircle(Point c, double r) : c(c), r(r) {}\n\n friend istream& operator>>(istream& is, Circle& C) {\n\t\tis >> C.c >> C.r;\n\t\treturn is;\n\t}\n};\n\ntypedef vector<Point> Polygon;\n\nvector<Point> getCrossPointCC(Circle c1, Circle c2) {\n\tdouble d = abs(c1.c - c2.c);\n\tdouble a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n\tdouble t = arg(c2.c - c1.c);\n\tvector<Point> ps;\n\tps.push_back(c1.c + polar(c1.r, t + a)); ps.push_back(c1.c + polar(c1.r, t - a));\n\treturn ps;\n}\n\nint contain(Circle C, Point p) {\n if (equals(abs(C.c - p), C.r)) return 1; // ON\n if (abs(C.c - p) <= C.r + EPS) return 2; // IN\n return 0; // OUT\n}\n\ndouble getDistanceLP(Line l, Point p) {\n\treturn abs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));\n}\n\ndouble getDistanceSP(Segment s, Point p) {\n\tif (dot(s.p2 - s.p1, p - s.p1) < 0.0) return abs(p - s.p1);\n\tif (dot(s.p1 - s.p2, p - s.p2) < 0.0) return abs(p - s.p2);\n\treturn getDistanceLP(Line{s.p1, s.p2}, p);\n}\n\nint intersectCS(Circle C, Segment S) {\n\t// SがCの外側\n\tif (norm(project(S, C.c) - C.c) - C.r * C.r > EPS) return 0;\n\n\tdouble d1 = abs(C.c - S.p1), d2 = abs(C.c - S.p2);\n\t// SがCに内包される\n\tif (d1 < C.r - EPS && d2 < C.r - EPS) return 0;\n\t// 線分のどちらかの端点が円の内部に、もう片方の端点が円の外部にある場合\n\tif ((d1 < C.r - EPS && d2 > C.r + EPS) or (d1 > C.r + EPS && d2 < C.r - EPS)) return 1;\n\t\n\tPoint h = project(S, C.c);\n\tif (dot(S.p1 - h, S.p2 - h) < -EPS) return 2; // 2回交差\n\treturn 0; // その他?\n}\n\nvector<Point> getCrossPointCL(Circle C, Line L) {\n\tvector<Point> ps;\n\tVector pr = projectL(L, C.c);\n\tVector e = (L.p2 - L.p1) / abs(L.p2 - L.p1);\n\tif (equals(getDistanceLP(L, C.c), C.r)) return vector<Point>{pr, pr};\n\tdouble base = sqrt(C.r * C.r - norm(pr - C.c));\n\tps.push_back(pr + e * base); ps.push_back(pr - e * base);\n\treturn ps;\n}\n\nvector<Point> getCrossPointCS(Circle C, Segment S) {\n\tLine L = {S.p1, S.p2};\n\tvector<Point> ps = getCrossPointCL(C, L);\n\tif (intersectCS(C, S) == 2) return ps;\n\tif (dot(L.p1 - ps[0], L.p2 - ps[0]) < 0) ps[1] = ps[0];\n\telse ps[0] = ps[1];\n\treturn ps;\n}\n\nsigned main() {\n int N;\n while (cin >> N, N) {\n vector<Circle> C(N);\n for (int i = 0; i < N; i++) {\n double x, y;\n char c;\n cin >> x >> c >> y;\n C[i] = Circle(Point(x, y), 1);\n }\n\n vector<Segment> S = {{Point(0, 0), Point(0, 10)},\n {Point(0, 10), Point(10, 10)},\n {Point(10, 10), Point(10, 0)},\n {Point(10, 0), Point(0, 0)}};\n\n vector<Point> P; // 交点の集合\n for (int i = 0; i < N; i++) {\n for (int j = i + 1; j < N; j++) {\n vector<Point> CP = getCrossPointCC(C[i], C[j]);\n for (int k = 0; k < CP.size(); k++) {\n // if (CP[k].x > 10. + EPS or CP[k].x < 0. - EPS) continue;\n // if (CP[k].y > 10. + EPS or CP[k].y < 0. - EPS) continue;\n P.pb(CP[k]);\n }\n }\n for (int j = 0; j < 4; j++) {\n vector<Point> CP = getCrossPointCS(C[i], S[j]);\n for (int k = 0; k < CP.size(); k++) {\n P.pb(CP[k]);\n }\n }\n }\n // sort(P.begin(), P.end());\n // P.erase(unique(P.begin(), P.end()), P.end());\n\n int ans = 0;\n for (int i = 0; i < P.size(); i++) {\n int cnt = 0;\n for (int j = 0; j < N; j++) {\n if (contain(C[j], P[i])) cnt++;\n }\n ans = max(ans, cnt);\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 4232,
"score_of_the_acc": -1.9267,
"final_rank": 19
},
{
"submission_id": "aoj_0090_9258080",
"code_snippet": "#pragma region Macros\n \n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n \n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n \n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n \n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n \n#define next asdnext\n#define prev asdprev\n \nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n \nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n \nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n \n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n bool operator <(const Edge& e) { return this->cost < e.cost; }\n bool operator >(const Edge& e) { return this->cost > e.cost; }\n};\n \nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n \nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n \n \n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = x / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n \ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n \ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n \nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n \n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n \nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n \n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n \n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n \n int size() { return sz; }\n \n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n \nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n \ntemplate<typename T>\nstruct BIT {\n int N; \n vector<T> bit[2]; \n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<T> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n \ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n \n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n \nusing mint = Modint<MOD>;\n \nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n \nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n \nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n \n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n \nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n \n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n \n \n#pragma endregion\n\nstruct Point {\n\tdouble x, y;\n\n\tPoint() {}\n\tPoint(double x, double y) : x(x), y(y) {}\n\n\tPoint operator+(const Point& p) const { return Point(x + p.x, y + p.y); }\n\tPoint operator-(const Point& p) const { return Point(x - p.x, y - p.y); }\n\tPoint operator*(const double& k) const { return Point(x * k, y * k); }\n\tPoint operator/(const double& k) const { return Point(x / k, y / k); }\n\n\tfriend istream& operator>>(istream& is, Point& p) {\n\t\tis >> p.x >> p.y;\n\t\treturn is;\n\t}\n\tfriend ostream& operator<<(ostream& os, Point& p) {\n\t\tos << p.x << \" \" << p.y;\n\t\treturn os;\n\t}\n\n\tbool operator==(const Point& p) const { return (fabs(x - p.x) < EPS && fabs(y - p.y) < EPS); }\n\t// bool operator!=(const Point& p) const { return (fabs(x - p.x) > EPS or fabs(y - p.y) > EPS); }\n\tbool operator<(const Point& p) const { return (x != p.x ? x < p.x : y < p.y); }\n\t// (x, y) の辞書順比較\n\n\tdouble norm() { return x * x + y * y; }\n\tdouble abs() { return sqrt(norm()); }\n};\n\ntypedef Point Vector;\n\ndouble radToDeg(double radian) { return radian * 180.0 / PI; }\ndouble degToRad(double degree) { return degree * PI / 180.0; }\n\nint sign(double x) { return x < -EPS ? -1 : x > EPS; } // -1(負)/0/1(正)\n\ndouble norm(Vector a) { return a.x * a.x + a.y * a.y; }\ndouble abs(Vector a) { return sqrt(norm(a)); }\ndouble dist(Point a, Point b) { return sqrt(norm(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\nVector orth(Vector p) { return {-p.y, p.x}; }\n\ndouble arg(Vector p) { return atan2(p.y, p.x); } // 偏角\nPoint polar(double r, double a) { return Point(cos(a) * r, sin(a) * r); } // 極座標から直交座標への変換\n\nbool isParallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }\nbool isOrthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }\n// bool isSameLine(Vector a, Vector b) { return equals(); }\n\nstruct EndPoint { // 端点の構造体(マンハッタン幾何)\n\tPoint p;\n\tint seg, st; // 点のid, 点の種別\n\n\tEndPoint() {}\n\tEndPoint(Point p, int seg, int st) : p(p), seg(seg), st(st) {}\n\n\tbool operator<(const EndPoint& ep) const {\n\t\tif (p.y == ep.p.y) return st < ep.st;\n\t\treturn p.y < ep.p.y;\n\t}\n};\n\nstruct Segment {\n\tPoint p1, p2;\n\n\tSegment() {}\n\tSegment(Point p1, Point p2) : p1(p1), p2(p2) {}\n\n\tfriend istream& operator>>(istream& is, Segment& s) {\n\t\tis >> s.p1 >> s.p2;\n\t\treturn is;\n\t}\n\n\t// 未verify\n bool operator==(const Segment& s) const { return (abs(p1 - s.p1) < EPS && abs(p2 - s.p2) < EPS); }\n\tbool operator!=(const Segment& s) const { return (abs(p1 - s.p1) > EPS or abs(p2 - s.p2) > EPS); }\n};\n\nstruct Line {\n\tPoint p1, p2;\n\n\tLine() {}\n\tLine(Point p1, Point p2) : p1(p1), p2(p2) {}\n\t// Ax + By = C\n Line(double A, double B, double C) {\n if (equals(A, 0)) {\n p1 = Point(0, C / B), p2 = Point(1, C / B);\n } else if (equals(B, 0)) {\n p2 = Point(C / A, 0), p2 = Point(C / A, 1);\n } else {\n p1 = Point(0, C / B), p2 = Point(C / A, 0);\n }\n }\n\n\tfriend istream& operator>>(istream& is, Line& l) {\n\t\tis >> l.p1 >> l.p2;\n\t\treturn is;\n\t}\n\n\tbool operator==(const Line& l) const { \n if (abs(cross(p1 - l.p1, l.p2 - l.p1)) > EPS) return false;\n if (abs(cross(p2 - l.p1, l.p2 - l.p1)) > EPS) return false;\n return true;\n }\n\t// bool operator<(const Line& l) const { return (l.p2.y - l.p1.y) * (p2.x - p1.x) < (l.p2.x - l.p1.x) * (p2.y - p1.y); }\n};\n\n\nbool isParallel(Segment S1, Segment S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Line S1, Line S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Line S1, Segment S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Segment S1, Line S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\nbool isOrthogonal(Segment S1, Segment S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Line S1, Line S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Line S1, Segment S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Segment S1, Line S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\n// bool isSameLine(Segment S1, Segment S2) { return isSameLine(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isSameLine(Line L1, Line L2) { \n if (abs(cross(L1.p1 - L2.p1, L2.p2 - L2.p1)) > EPS) return false;\n if (abs(cross(L1.p2 - L2.p1, L2.p2 - L2.p1)) > EPS) return false;\n return true;\n}\n// bool isSameLine(Line L1, Segment S2) { return isSameLine(L1.p2 - L1.p1, S2.p2 - S2.p1); }\n// bool isSameLine(Segment S1, Line S2) { return isSameLine(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\nbool onSegment(Segment S, Point p) {\n\tif (sign(cross(S.p1-p, S.p2-p)) != 0) return false;\n \tif (sign( dot(S.p1-p, S.p2-p)) > 0) return false;\n\treturn true;\n}\nbool onLine(Line L, Point p) {\n\tif (sign(cross(L.p1-p, L.p2-p)) != 0) return false;\n\treturn true;\n}\n\nPoint project(Segment s, Point p) { // 点の射影\n\tVector base = s.p2 - s.p1;\n\tdouble r = dot(p - s.p1, base) / base.norm();\n\treturn s.p1 + base * r;\n}\n\nPoint reflect(Segment s, Point p) { // 点の反射\n\treturn p + (project(s, p) - p) * 2.0;\n}\n\nPoint projectL(Line s, Point p) { // 点の射影\n\tVector base = s.p2 - s.p1;\n\tdouble r = dot(p - s.p1, base) / base.norm();\n\treturn s.p1 + base * r;\n}\n\nPoint reflectL(Line l, Point p) { // 点の反射\n\treturn p + (project(Segment(l.p1, l.p2), p) - p) * 2.0;\n}\n\nstruct Circle {\n\tPoint c;\n\tdouble r;\n\n\tCircle() {}\n\tCircle(Point c, double r) : c(c), r(r) {}\n\n friend istream& operator>>(istream& is, Circle& C) {\n\t\tis >> C.c >> C.r;\n\t\treturn is;\n\t}\n};\n\ntypedef vector<Point> Polygon;\n\nvector<Point> getCrossPointCC(Circle c1, Circle c2) {\n\tdouble d = abs(c1.c - c2.c);\n\tdouble a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n\tdouble t = arg(c2.c - c1.c);\n\tvector<Point> ps;\n\tps.push_back(c1.c + polar(c1.r, t + a)); ps.push_back(c1.c + polar(c1.r, t - a));\n\treturn ps;\n}\n\nint contain(Circle C, Point p) {\n if (equals(abs(C.c - p), C.r)) return 1; // ON\n if (abs(C.c - p) <= C.r + EPS) return 2; // IN\n return 0; // OUT\n}\n\ndouble getDistanceLP(Line l, Point p) {\n\treturn abs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));\n}\n\ndouble getDistanceSP(Segment s, Point p) {\n\tif (dot(s.p2 - s.p1, p - s.p1) < 0.0) return abs(p - s.p1);\n\tif (dot(s.p1 - s.p2, p - s.p2) < 0.0) return abs(p - s.p2);\n\treturn getDistanceLP(Line{s.p1, s.p2}, p);\n}\n\nint intersectCS(Circle C, Segment S) {\n\t// SがCの外側\n\tif (norm(project(S, C.c) - C.c) - C.r * C.r > EPS) return 0;\n\n\tdouble d1 = abs(C.c - S.p1), d2 = abs(C.c - S.p2);\n\t// SがCに内包される\n\tif (d1 < C.r - EPS && d2 < C.r - EPS) return 0;\n\t// 線分のどちらかの端点が円の内部に、もう片方の端点が円の外部にある場合\n\tif ((d1 < C.r - EPS && d2 > C.r + EPS) or (d1 > C.r + EPS && d2 < C.r - EPS)) return 1;\n\t\n\tPoint h = project(S, C.c);\n\tif (dot(S.p1 - h, S.p2 - h) < -EPS) return 2; // 2回交差\n\treturn 0; // その他?\n}\n\nvector<Point> getCrossPointCL(Circle C, Line L) {\n\tvector<Point> ps;\n\tVector pr = projectL(L, C.c);\n\tVector e = (L.p2 - L.p1) / abs(L.p2 - L.p1);\n\tif (equals(getDistanceLP(L, C.c), C.r)) return vector<Point>{pr, pr};\n\tdouble base = sqrt(C.r * C.r - norm(pr - C.c));\n\tps.push_back(pr + e * base); ps.push_back(pr - e * base);\n\treturn ps;\n}\n\nvector<Point> getCrossPointCS(Circle C, Segment S) {\n\tLine L = {S.p1, S.p2};\n\tvector<Point> ps = getCrossPointCL(C, L);\n\tif (intersectCS(C, S) == 2) return ps;\n\tif (dot(L.p1 - ps[0], L.p2 - ps[0]) < 0) ps[1] = ps[0];\n\telse ps[0] = ps[1];\n\treturn ps;\n}\n\nsigned main() {\n int N;\n while (cin >> N, N) {\n vector<Circle> C(N);\n for (int i = 0; i < N; i++) {\n double x, y;\n char c;\n cin >> x >> c >> y;\n C[i] = Circle(Point(x, y), 1);\n }\n\n vector<Segment> S = {{Point(0, 0), Point(0, 10)},\n {Point(0, 10), Point(10, 10)},\n {Point(10, 10), Point(10, 1)},\n {Point(10, 0), Point(0, 0)}};\n\n vector<Point> P; // 交点の集合\n for (int i = 0; i < N; i++) {\n for (int j = i + 1; j < N; j++) {\n vector<Point> CP = getCrossPointCC(C[i], C[j]);\n for (int k = 0; k < CP.size(); k++) {\n if (CP[k].x > 10. + EPS or CP[k].x < 0. - EPS) continue;\n if (CP[k].y > 10. + EPS or CP[k].y < 0. - EPS) continue;\n P.pb(CP[k]);\n }\n }\n for (int j = 0; j < 4; j++) {\n vector<Point> CP = getCrossPointCS(C[i], S[j]);\n for (int k = 0; k < CP.size(); k++) {\n P.pb(CP[k]);\n }\n }\n }\n int sz = P.size();\n // for (int i = 0; i < sz; i++) {\n // Point p1 = Point(P[i].x + EPS, P[i].y + EPS);\n // // Point p2 = Point(P[i].x + EPS, P[i].y - EPS);\n // // Point p3 = Point(P[i].x - EPS, P[i].y + EPS);\n // Point p4 = Point(P[i].x - EPS, P[i].y - EPS);\n // P.pb(p1);\n // // P.pb(p2);\n // // P.pb(p3);\n // P.pb(p4);\n // }\n // sort(P.begin(), P.end());\n // P.erase(unique(P.begin(), P.end()), P.end());\n\n\n int ans = 0;\n for (int i = 0; i < P.size(); i++) {\n int cnt = 0;\n for (int j = 0; j < N; j++) {\n if (contain(C[j], P[i])) cnt++;\n }\n ans = max(ans, cnt);\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 700,
"memory_kb": 4332,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0090_6934181",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<pair<double,double>> a(n);\n vector<pair<ll,ll>> b(n);\n for(int i = 0; i < n; i++){\n scanf(\"%lf,%lf\",&a[i].first,&a[i].second);\n b[i].first = a[i].first * 100000;\n b[i].second = a[i].second * 100000;\n }\n auto f = [&](ll x, ll y){\n int res = 0;\n for(int i = 0; i < n; i++){\n res += ((x - b[i].first) * (x - b[i].first) + (y - b[i].second) * (y - b[i].second) \n <= 10000000000);\n }\n return res;\n };\n int ans = 0;\n for(ll x = 0; x <= 1000000; x += 1000){\n for(ll y = 0; y <= 1000000; y += 1000){\n ans = max(ans, f(x, y));\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 3516,
"score_of_the_acc": -0.9548,
"final_rank": 13
},
{
"submission_id": "aoj_0090_4359068",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nusing real = double;\nstatic constexpr real EPS = 1e-10;\nstruct Point {\n real x, y;\n Point& operator+=(const Point a) { x += a.x; y += a.y; return *this; }\n Point& operator-=(const Point a) { x -= a.x; y -= a.y; return *this; }\n Point& operator*=(const real k) { x *= k; y *= k; return *this; }\n Point& operator/=(const real k) { x /= k; y /= k; return *this; }\n Point operator+(const Point a) const {return Point(*this) += a; }\n Point operator-(const Point a) const {return Point(*this) -= a; }\n Point operator*(const real k) const {return Point(*this) *= k; }\n Point operator/(const real k) const {return Point(*this) /= k; }\n bool operator<(const Point &a) const { return (x != a.x ? x < a.x : y < a.y); }\n explicit Point(real a = 0, real b = 0) : x(a), y(b) {};\n};\n\nbool sorty(Point a, Point b){\n return (a.y != b.y ? a.y < b.y : a.x < b.x);\n}\n\nistream& operator>> (istream& s, Point& P){\n s >> P.x >> P.y;\n return s;\n}\n\ninline real dot(Point a, Point b){ return a.x*b.x + a.y*b.y; }\ninline real cross(Point a, Point b){ return a.x*b.y - a.y*b.x; }\ninline real abs(Point a){ return sqrt(dot(a, a)); }\n\n\nreal angle(Point A, Point B){\n return acos(dot(A, B)/abs(A)/abs(B));\n}\n\n\n\nstatic constexpr int COUNTER_CLOCKWISE = 1;\nstatic constexpr int CLOCKWISE = -1;\nstatic constexpr int ONLINE_BACK = 2;\nstatic constexpr int ONLINE_FRONT = -2;\nstatic constexpr int ON_SEGMENT = 0;\n\nint ccw(Point a, Point b, Point c){\n b -= a; c -= a;\n if(cross(b, c) > EPS) return COUNTER_CLOCKWISE;\n if(cross(b, c) < -EPS) return CLOCKWISE;\n if(dot(b, c) < 0) return ONLINE_BACK;\n if(abs(b) < abs(c)) return ONLINE_FRONT;\n return ON_SEGMENT;\n}\nstruct Segment {\n Point a, b;\n Segment(Point x, Point y) : a(x), b(y) {};\n};\n\nstruct Line {\n Point a, b;\n Line(Point x, Point y) : a(x), b(y) {};\n};\n\nstruct Circle{\n Point c; real r;\n Circle(Point c, real r): c(c), r(r) {};\n};\n\nusing Polygon = vector<Point>;\n\nbool intersect(Segment s, 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\nbool intersect(Segment s, Line t){\n int a = ccw(t.a, t.b, s.a), b = ccw(t.a, t.b, s.b);\n return (!(a&1) || !(b&1) || a != b);\n}\n\nPoint polar(double r, double t){\n return Point(r*cos(t), r*sin(t));\n}\n\ndouble arg(Point p){\n return atan2(p.y, p.x);\n}\n\nstatic constexpr int CONTAIN = 0;\nstatic constexpr int INSCRIBE = 1;\nstatic constexpr int INTERSECT = 2;\nstatic constexpr int CIRCUMSCRIBED = 3;\nstatic constexpr int SEPARATE = 4;\n\nint intersect(Circle c1, Circle c2){\n if(c1.r < c2.r) swap(c1, c2);\n real d = abs(c1.c-c2.c);\n real r = c1.r + c2.r;\n if(fabs(d-r) < EPS) return CIRCUMSCRIBED;\n if(d > r) return SEPARATE;\n if(fabs(d+c2.r-c1.r) < EPS) return INSCRIBE;\n if(d+c2.r < c1.r) return CONTAIN;\n return INTERSECT;\n}\n\nreal distance(Line l, Point c){\n return abs(cross(l.b-l.a, c-l.a)/abs(l.b-l.a));\n}\n\n\nreal distance(Segment s, Point c){\n if(dot(s.b-s.a, c-s.a) < EPS) return abs(c-s.a);\n if(dot(s.a-s.b, c-s.b) < EPS) return abs(c-s.b);\n return abs(cross(s.b-s.a, c-s.a)) / abs(s.a-s.b);\n}\n\nreal distance(Segment s, Segment t){\n if(intersect(s, t)) return 0.0;\n return min({distance(s, t.a), distance(s, t.b),\n distance(t, s.a), distance(t, s.b)});\n}\n\n\nPoint project(Line l, Point p){\n Point Q = l.b-l.a;\n return l.a + Q*(dot(p-l.a, Q) / dot(Q, Q));\n}\n\n\nPoint project(Segment s, Point p){\n Point Q = s.b-s.a;\n return s.a + Q*(dot(p-s.a, Q) / dot(Q, Q));\n}\n\nPoint refrect(Segment s, Point p){\n Point Q = project(s, p);\n return Q*2-p;\n}\n\nbool isOrthogonal(Segment s, Segment t){\n return fabs(dot(s.b-s.a, t.b-t.a)) < EPS;\n}\n\nbool isparallel(Segment s, Segment t){\n return fabs(cross(s.b-s.a, t.b-t.a)) < EPS;\n}\n\n\nPoint crossPoint(Segment s, Segment t){\n real d1 = cross(s.b-s.a, t.b-t.a);\n real d2 = cross(s.b-s.a, s.b-t.a);\n if(fabs(d1) < EPS && fabs(d2) < EPS) return t.a;\n return t.a+(t.b-t.a)*d2/d1;\n}\n\nPoint crossPoint(Line s, Line t){\n real d1 = cross(s.b-s.a, t.b-t.a);\n real d2 = cross(s.b-s.a, s.b-t.a);\n if(fabs(d1) < EPS && fabs(d2) < EPS) return t.a;\n return t.a+(t.b-t.a)*d2/d1;\n}\n\nPolygon crossPoint(Circle c, Line l){\n Point p = project(l, c.c), q = (l.b-l.a)/abs(l.b-l.a);\n if(abs(distance(l, c.c)-c.r) < EPS){\n return {p};\n }\n double k = sqrt(c.r*c.r-dot(p-c.c, p-c.c));\n return {p-q*k, p+q*k};\n}\n\nPolygon crossPoint(Circle c, Segment s){\n auto tmp = crossPoint(c, Line(s.a, s.b));\n Polygon ret;\n for (auto &&i : tmp) {\n if(distance(s, i) < EPS) ret.emplace_back(i);\n }\n return ret;\n}\n\n\nPolygon crossPoint(Circle c1, Circle 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 {c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a)};\n}\n\nPolygon tangent(Circle c1, Point p){\n Circle c2 = Circle(p, sqrt(dot(c1.c-p, c1.c-p)-c1.r*c1.r));\n return crossPoint(c1, c2);\n}\nvector<Line> tangent(Circle c1, Circle c2){\n vector<Line> ret;\n if(c1.r < c2.r) swap(c1, c2);\n double k = dot(c1.c-c2.c, c1.c-c2.c);\n if(abs(k) < EPS) return {};\n Point u = (c2.c-c1.c)/sqrt(k);\n Point v(-u.y, u.x);\n for (auto &&i : {-1, 1}) {\n double h = (c1.r+i*c2.r)/sqrt(k);\n if(abs(h*h-1) < EPS){\n ret.emplace_back(c1.c+u*c1.r, c1.c+(u+v)*c1.r);\n }else if(h*h < 1){\n Point u2 = u*h, v2 = v*sqrt(1-h*h);\n ret.emplace_back(c1.c+(u2+v2)*c1.r, c2.c-(u2+v2)*c2.r*i);\n ret.emplace_back(c1.c+(u2-v2)*c1.r, c2.c-(u2-v2)*c2.r*i);\n }\n }\n return ret;\n}\n\nreal area(Polygon v){\n if(v.size() < 3) return 0.0;\n real ans = 0.0;\n for (int i = 0; i < v.size(); ++i) {\n ans += cross(v[i], v[(i+1)%v.size()]);\n }\n return ans/2;\n}\n\nreal area(Circle c, Polygon &v){\n int n = v.size();\n real ans = 0.0;\n Polygon u;\n for (int i = 0; i < n; ++i) {\n u.emplace_back(v[i]);\n auto q = crossPoint(c, Segment(v[i], v[(i+1)%n]));\n for (auto &&j : q) {\n u.emplace_back(j);\n }\n }\n for (int i = 0; i < u.size(); ++i) {\n Point A = u[i]-c.c, B = u[(i+1)%u.size()]-c.c;\n if(abs(A) >= c.r+EPS || abs(B) >= c.r+EPS){\n Point C = polar(1, arg(B)-arg(A));\n ans += c.r*c.r*arg(C)/2;\n }else {\n ans += cross(A, B)/2;\n }\n }\n return ans;\n}\n\nPolygon convex_hull(Polygon v){\n int n = v.size();\n sort(v.begin(),v.end(), sorty);\n int k = 0;\n Polygon ret(n*2);\n for (int i = 0; i < n; ++i) {\n while(k > 1 && cross(ret[k-1]-ret[k-2], v[i]-ret[k-1]) < 0) k--;\n ret[k++] = v[i];\n }\n for(int i = n-2, t=k; i >= 0; i--){\n while(k > t && cross(ret[k-1]-ret[k-2], v[i]-ret[k-1]) < 0) k--;\n ret[k++] = v[i];\n }\n ret.resize(k-1);\n return ret;\n}\n\nbool isconvex(Polygon v){\n int n = v.size();\n for (int i = 0; i < n; ++i) {\n if(ccw(v[(i+n-1)%n], v[i], v[(i+1)%n]) == CLOCKWISE) return false;\n }\n return true;\n}\n\nint contains(Polygon v, Point p){\n int n = v.size();\n bool x = false;\n static constexpr int IN = 2;\n static constexpr int ON = 1;\n static constexpr int OUT = 0;\n for (int i = 0; i < n; ++i) {\n Point a = v[i]-p, b = v[(i+1)%n]-p;\n if(fabs(cross(a, b)) < EPS && dot(a, b) < EPS) return ON;\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?IN:OUT);\n}\n\nreal diameter(Polygon v){\n int n = v.size();\n if(n == 2) return abs(v[0]-v[1]);\n int i = 0, j = 0;\n for (int k = 0; k < n; ++k) {\n if(v[i] < v[k]) i = k;\n if(!(v[j] < v[k])) j = k;\n }\n real ret = 0;\n int si = i, sj = j;\n while(i != sj || j != si){\n ret = max(ret, abs(v[i]-v[j]));\n if(cross(v[(i+1)%n]-v[i], v[(j+1)%n]-v[j]) < 0.0) i = (i+1)%n;\n else j = (j+1)%n;\n }\n return ret;\n}\n\nPolygon convexCut(Polygon v, Line l){\n Polygon q;\n int n = v.size();\n for (int i = 0; i < n; ++i) {\n Point a = v[i], b = v[(i+1)%n];\n if(ccw(l.a, l.b, a) != -1) q.push_back(a);\n if(ccw(l.a, l.b, a)*ccw(l.a, l.b, b) < 0){\n q.push_back(crossPoint(Line(a, b), l));\n }\n }\n return q;\n}\n\nreal closest_pair(Polygon &v, int l = 0, int r = -1){\n if(!(~r)){\n r = v.size();\n sort(v.begin(),v.end());\n }\n if(r - l < 2) {\n return abs(v.front()-v.back());\n }\n int mid = (l+r)/2;\n real p = v[mid].x;\n real d = min(closest_pair(v, l, mid), closest_pair(v, mid, r));\n inplace_merge(v.begin()+l, v.begin()+mid, v.begin()+r, sorty);\n Polygon u;\n for (int i = l; i < r; ++i) {\n if(fabs(v[i].x-p) >= d) continue;\n for (int j = 0; j < u.size(); ++j) {\n real dy = v[i].y-next(u.rbegin(), j)->y;\n if(dy >= d) break;\n d = min(d, abs(v[i]-*next(u.rbegin(), j)));\n }\n u.emplace_back(v[i]);\n }\n return d;\n}\n\nint main() {\n int n;\n while(cin >> n, n){\n vector<Point> ps(n);\n for (int i = 0; i < n; ++i) {\n scanf(\"%lg,%lg\", &ps[i].x, &ps[i].y);\n }\n vector<Circle> v;\n v.reserve(n);\n for (int i = 0; i < n; ++i) {\n v.emplace_back(ps[i], 1);\n }\n vector<Point> kouten;\n for (int i = 0; i < n; ++i) {\n for (int j = 1; j < n; ++j) {\n auto p = crossPoint(v[i], v[j]);\n for (auto &&l : p) {\n kouten.emplace_back(l);\n }\n }\n kouten.emplace_back(v[i].c);\n }\n int ans = 0;\n for (auto &&p : kouten) {\n int val = 0;\n for (int i = 0; i < n; ++i) {\n if(abs(v[i].c-p) <= v[i].r + EPS) val++;\n }\n ans = max(ans, val);\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4272,
"score_of_the_acc": -0.9792,
"final_rank": 16
},
{
"submission_id": "aoj_0090_4250597",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nconstexpr ll MOD = 1e9 + 7;\nconstexpr ll INF = 1e+18;\nconstexpr ld EPS = 1e-12L;\nconstexpr ld PI = 3.14159265358979323846L;\n\n// https://prefield.com/algorithm/geometry\n\n// point\nusing P = complex<ld>;\n\n// two points: line\nusing L = array<P, 2>;\n\n// points\nusing VP = vector<P>;\n\n// circle\nstruct C {\n P c;\n ld r;\n C(const P &c_, ld r_) : c(c_), r(r_) {}\n C(ld x_, ld y_, ld r_) : c({x_, y_}), r(r_) {}\n};\n\nusing VC = vector<C>;\n\n// input\nvoid Pin(P &a) {\n ld tmp;\n cin >> tmp;\n a.real(tmp);\n cin >> tmp;\n a.imag(tmp);\n}\n\n// output\nvoid Pout(const P &a) {\n cout << a.real() << \" \" << a.imag();\n}\n\nnamespace std {\n /*\n bool operator<(const P& a, const P& b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n /*/\n bool operator<(const P &a, const P &b) {\n return arg(a) < arg(b);\n }\n //*/\n} // namespace std\n\nld cross(const P &a, const P &b) {\n return imag(conj(a) * b);\n}\n\nld dot(const P &a, const P &b) {\n return real(conj(a) * b);\n}\n\n// a->b->cの進行方向\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0) return 1; // counterclockwise a--b\\\\c\n if (cross(b, c) < 0) return -1; // clockwise a--b//c\n if (dot(b, c) < 0) return 2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0; // a--c--b on line\n}\n\n// 直線-直線交差判定\nbool intersectLL(const L& l, const L& m) {\n return abs(cross(l[1] - l[0], m[1] - m[0])) > EPS // non-parallel\n || abs(cross(l[1] - l[0], m[1] - l[0])) < EPS; // same line\n}\n\n// 直線-線分交差判定\nbool intersectLS(const L& l, const L& s) {\n return cross(l[1] - l[0], s[0] - l[0]) * // s[0] is left of l\n cross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\n}\n\n// 線分-線分交差判定\nbool intersectSS(const L& s, const L& t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0\n && ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\n\n// 点∈直線の判定\nbool intersectLP(const L& l, const P& p) {\n return abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\n\n// 点∈線分の判定\nbool intersectSP(const L& s, const P& p) {\n // triangle inequality\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS;\n}\n\n// 点の直線への射影\nP projection(const L& l, const P& p) {\n ld t = dot(p - l[0], l[1] - l[0]) / norm(l[1] - l[0]);\n return l[0] + t * (l[1] - l[0]);\n}\n\n// 点の直線に対する鏡映\nP reflection(const L& l, const P& p) {\n return p + (projection(l, p) - p) * 2.L;\n}\n\n// 点-直線の距離\nld distanceLP(const L &l, const P &p) {\n return abs(p - projection(l, p));\n}\n\n// 直線-直線の距離 非平行か同一なら0\nld distanceLP(const L &l, const L &m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\n\n// 直線-線分の距離\nld distanceLS(const L& l, const L& s) {\n return intersectLS(l, s) ? 0 : min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\n\n// 点-線分の距離\nld distanceSP(const L& s, const P& p) {\n const P r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\n\n// 線分-線分の距離\nld distanceSS(const L& s, const L& t) {\n if (intersectSS(s, t)) return 0;\n return min({distanceSP(s, t[0]),\n distanceSP(s, t[1]),\n distanceSP(t, s[0]),\n distanceSP(t, s[1])});\n}\n\n// 2直線の交点 平行な場合は例外\nP crosspoint(const L &l, const L &m) {\n ld A = cross(l[1] - l[0], m[1] - m[0]);\n ld B = cross(l[1] - l[0], l[1] - m[0]);\n assert(abs(A) >= EPS);\n return m[0] + B / A * (m[1] - m[0]);\n}\n\n// 2円の交点 一致する場合は例外\nVP crosspoint(C a, C b) {\n ld dist = abs(a.c - b.c);\n ld rdist = abs(a.r - b.r);\n assert(dist >= EPS || rdist >= EPS);\n // 外接する\n if(abs(dist - (a.r + b.r)) < EPS){\n return {(b.r*a.c + a.r*b.c) / (a.r + b.r)};\n }\n // 内接する\n if(abs(dist - rdist) < EPS){\n return {(-b.r*a.c + a.r*b.c) / (a.r - b.r)};\n }\n // 離れている、内包する\n if(dist > a.r + b.r || dist < rdist){\n return {};\n }\n // 交わる 中心を0と1に規格化\n // 最後に足す\n P movp = a.c;\n a.c = {0.L, 0.L};\n b.c -= movp;\n // 最後に掛ける\n P movm = b.c;\n b.c = {1.L, 0.L};\n a.r /= abs(movm);\n b.r /= abs(movm);\n ld x = (a.r*a.r - b.r*b.r + 1)/2;\n ld y = sqrt(a.r*a.r - x*x);\n P cr1 = {x, y};\n P cr2 = {x, -y};\n cr1 = cr1 * movm + movp;\n cr2 = cr2 * movm + movp;\n // 元に戻す\n return {cr1, cr2};\n}\n\n// 円盤の最大の重なり O(n^3)\nll maxOverlap(const VC &vc){\n ll n = vc.size();\n if(!n) return 0;\n ll ret = 1;\n VP pts;\n for(auto&& e: vc){\n pts.emplace_back(e.c);\n }\n for(int i = 0; i < n; i++){\n for(int j = 0; j < i; j++){\n VP cp = crosspoint(vc[i], vc[j]);\n pts.insert(pts.end(), cp.begin(), cp.end());\n }\n }\n for(auto&& e: pts){\n ll tmp = 0;\n for(auto&& ee: vc){\n tmp += (abs(e - ee.c) < ee.r + EPS);\n }\n if(ret < tmp) ret = tmp;\n }\n return ret;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n ll n;\n while(cin >> n, n){\n VC vc;\n for(int i = 0; i < n; i++){\n ld x, y;\n char ch;\n cin >> x >> ch >> y;\n vc.emplace_back(x, y, 1.L);\n }\n cout << maxOverlap(vc) << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3364,
"score_of_the_acc": -0.4306,
"final_rank": 5
},
{
"submission_id": "aoj_0090_4173539",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nstruct point {\n double x, y;\n};\n\nint main() {\n int n;\n while (cin >> n, n) {\n vector<point> ps(n);\n for (int i = 0; i < n; ++i)\n scanf(\"%lf,%lf\", &ps[i].x, &ps[i].y);\n\n int cntmax = 0;\n for (int i = 0; i < 1000; ++i) {\n for (int j = 0; j < 1000; ++j) {\n double x = i * 0.01;\n double y = j * 0.01;\n int cnt = 0;\n auto f = [&](auto &v) { cnt += pow(v.x - x, 2) + pow(v.y - y, 2) <= 1; };\n for_each(ps.begin(), ps.end(), f);\n cntmax = (cntmax < cnt) ? cnt : cntmax;\n }\n }\n cout << cntmax << endl;\n }\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 3224,
"score_of_the_acc": -0.9279,
"final_rank": 10
},
{
"submission_id": "aoj_0090_4054583",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <cstdio>\n\nusing namespace std;\n\nstruct Point{\n\tdouble x,y;\n};\n\nint main(){\n\t\n\tint n, ans, count;\n\tPoint seal[100];\n\t\n\twhile(cin >> n){\n\t\tif(n == 0) break;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tscanf(\"%lf,%lf\",&seal[i].x,&seal[i].y);\n\t\t}\n\t\t\n\t\tans = -1;\n\t\tfor(double i = 0; i <= 10; i += 0.1){\n\t\t\tfor(double j = 0; j <= 10; j +=0.1){\n\t\t\t\tcount = 0;\n\t\t\t\tfor(int s = 0; s < n; s++){\n\t\t\t\t\tif(sqrt((i-seal[s].x)*(i-seal[s].x)+(j-seal[s].y)*(j-seal[s].y)) < 1 ||\n\t\t\t\t\t\t\tfabs(sqrt((i-seal[s].x)*(i-seal[s].x)+(j-seal[s].y)*(j-seal[s].y)) - 1) < 0.00000001){\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(ans < count) ans = count;\n\t\t\t}\n\t\t}\n\t\n\t\tcout << ans << endl;\n\t\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3156,
"score_of_the_acc": -0.3227,
"final_rank": 2
},
{
"submission_id": "aoj_0090_4054511",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n#include <math.h>\n#include <queue>\n\nusing namespace std;\n\nstruct Point{\n\tdouble x,y;\n};\n\nint main(){\n\n\tint n,max,count;\n\tPoint point[100];\n\n\twhile(true){\n\t\tscanf(\"%d\",&n);\n\t\tif(n == 0)break;\n\n\t\tmax = 0;\n\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tscanf(\"%lf,%lf\",&point[i].x,&point[i].y);\n\t\t}\n\n\t\tfor(double i = 0; i <= 10; i += 0.1){\n\t\t\tfor(double k = 0; k <= 10; k+=0.1){\n\t\t\t\tcount = 0;\n\t\t\t\tfor(int p = 0; p < n; p++){\n\t\t\t\t\tif(sqrt((i-point[p].x)*(i-point[p].x)+(k-point[p].y)*(k-point[p].y)) < 1 ||\n\t\t\t\t\t\t\tfabs(sqrt((i-point[p].x)*(i-point[p].x)+(k-point[p].y)*(k-point[p].y))-1) < 0.00000001){\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmax = (max >= count)?max:count;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",max);\n\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2632,
"score_of_the_acc": -0.0145,
"final_rank": 1
},
{
"submission_id": "aoj_0090_3995965",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint mapData[10][10];\n\nint main() {\n\tint n,tmp,sum;\n\tdouble x[100], y[100];\n\tchar c;\n\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\twhile (cin >> n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> x[i] >> c >> y[i];\n\t\t}\n\n\t\tsum = 0;\n\t\tfor (double a = 0; (a-10) < 0.0001; a += 0.01) {\n\t\t\tfor (double b = 0; (b-10) < 0.0001; b += 0.01) {\n\t\t\t\ttmp = 0;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif( pow((a - x[i]), 2) + pow((b - y[i]), 2) - 1 < 0.0001) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tsum = max(sum, tmp);\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 3168,
"score_of_the_acc": -1.1124,
"final_rank": 18
},
{
"submission_id": "aoj_0090_3995961",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint mapData[10][10];\n\nint main() {\n\tint n,tmp,sum;\n\tdouble x[100], y[100];\n\tchar c;\n\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\twhile (cin >> n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> x[i] >> c >> y[i];\n\t\t}\n\n\t\tsum = 0;\n\t\tfor (double a = 0.0; a < 10; a += 0.01) {\n\t\t\tfor (double b = 0.0; b < 10; b += 0.01) {\n\t\t\t\ttmp = 0;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif (pow((a - x[i]), 2) + pow((b - y[i]), 2) < 1.0001) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tsum = max(sum, tmp);\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 3180,
"score_of_the_acc": -0.989,
"final_rank": 17
},
{
"submission_id": "aoj_0090_3995957",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint mapData[10][10];\n\nint main() {\n\tint n,tmp,sum;\n\tdouble x[100], y[100];\n\tchar c;\n\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\twhile (cin >> n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> x[i] >> c >> y[i];\n\t\t}\n\n\t\tsum = 0;\n\t\tfor (double a = 0.0; a < 10; a += 0.01) {\n\t\t\tfor (double b = 0.0; b < 10; b += 0.01) {\n\t\t\t\ttmp = 0;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif (pow((a - x[i]), 2) + pow((b - y[i]), 2) < 1.01) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tsum = max(sum, tmp);\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 3088,
"score_of_the_acc": -0.9349,
"final_rank": 12
},
{
"submission_id": "aoj_0090_3857482",
"code_snippet": "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) REP(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define MSG(a) cout << #a << \" \" << a << endl;\n#define REP(i, x, n) for (int i = x; i < n; i++)\n#define OP(m) cout << m << endl\ntypedef long long ll;\ntypedef unsigned long long ull;\n\ntypedef struct circle\n{\n double x, y;\n} cir;\n\nint main()\n{\n int n;\n while (cin >> n, n)\n {\n cir c[n];\n char ch;\n rep(i, n) cin >> c[i].x >> ch >> c[i].y;\n\n int maxv = 0;\n\n for (double i = 0; i <= 10; i += 0.1)\n {\n for (double j = 0; j <= 10; j += 0.01)\n {\n int cnt = 0;\n rep(k, n)\n {\n if (sqrt(pow(i - c[k].x, 2) + (pow(j - c[k].y, 2)) <= 1.001))\n cnt++;\n }\n maxv = max(maxv, cnt);\n }\n }\n OP(maxv);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3056,
"score_of_the_acc": -0.3798,
"final_rank": 4
},
{
"submission_id": "aoj_0090_3857479",
"code_snippet": "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) REP(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define MSG(a) cout << #a << \" \" << a << endl;\n#define REP(i, x, n) for (int i = x; i < n; i++)\n#define OP(m) cout << m << endl\ntypedef long long ll;\ntypedef unsigned long long ull;\n\ntypedef struct circle\n{\n double x, y;\n} cir;\n\nint main()\n{\n int n;\n while (cin >> n, n)\n {\n cir c[n];\n char ch;\n rep(i, n) cin >> c[i].x >> ch >> c[i].y;\n\n int maxv = 0;\n\n for (double i = 0; i <= 10; i += 0.05)\n {\n for (double j = 0; j <= 10; j += 0.05)\n {\n int cnt = 0;\n rep(k, n)\n {\n if (sqrt(pow(i - c[k].x, 2) + (pow(j - c[k].y, 2)) <= 1.001))\n cnt++;\n }\n maxv = max(maxv, cnt);\n }\n }\n OP(maxv);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3184,
"score_of_the_acc": -0.3682,
"final_rank": 3
},
{
"submission_id": "aoj_0090_3857441",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <vector>\n#include <iostream>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef long long LL;\ndouble x[100],y[100];\nint main(){\n int n;\n while(1){\n scanf(\"%d\",&n);\n if(n==0) break;\n for(int i=0;i<n;i++)\n scanf(\"%lf,%lf\\n\",&x[i],&y[i]);\n int ans=0;\n for(double a=0;a<=10.1;a+=0.01)\n for(double b=0;b<=10.1;b+=0.01){\n int t=0;\n for(int i=0;i<n;i++)\n if((a-x[i])*(a-x[i])+(b-y[i])*(b-y[i])<=1.001)\n t++;\n ans=max(ans,t);\n }\n printf(\"%d\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 430,
"memory_kb": 3168,
"score_of_the_acc": -0.924,
"final_rank": 9
},
{
"submission_id": "aoj_0090_3763491",
"code_snippet": "#include<iostream>\nusing namespace std;\n#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#include<iomanip>\nconst double EPS=1e-10;\nbool eq(double a,double b){return abs(a-b)<EPS;}\nstruct Point{\n\tdouble x,y;\n\tPoint(double x_=0,double y_=0):x(x_),y(y_){}\n\tPoint operator-()const{return Point(-x,-y);}\n\tPoint operator+(const Point&p)const{return Point(x+p.x,y+p.y);}\n\tPoint operator-(const Point&p)const{return Point(x-p.x,y-p.y);}\n\tPoint operator*(const double k)const{return Point(x*k,y*k);}\n\tPoint operator/(const double k)const{return Point(x/k,y/k);}\n\tbool operator<(const Point&p)const{return eq(x,p.x)?y<p.y:x<p.x;}\n\tbool operator==(const Point&p)const{return eq(x,p.x)&&eq(y,p.y);}\n};\nistream&operator>>(istream&is,Point&p){return is>>p.x>>p.y;}\nostream&operator<<(ostream&os,const Point&p){return os<<fixed<<setprecision(9)<<p.x<<' '<<p.y;}\nstruct Line{\n\tPoint p1,p2;\n\tLine(Point p1_=Point(),Point p2_=Point()):p1(p1_),p2(p2_){}\n};\nstruct Segment:Line{\n\tSegment(Point p1_=Point(),Point p2_=Point()):Line(p1_,p2_){}\n};\nstruct Circle{\n\tPoint o;\n\tdouble r;\n\tCircle(Point o_=Point(),double r_=0):o(o_),r(r_){}\n};\nusing Polygon=vector<Point>;\n//function list begin\nPoint vec(const Line&);\ndouble norm(const Point&);\ndouble norm(const Line&);\ndouble abs(const Point&);\ndouble abs(const Line&);\ndouble arg(const Point&);\ndouble arg(const Line&);\ndouble arg(const Point&,const Point&,const Point&);//a->b->c\ndouble dot(const Point&,const Point&);\ndouble cross(const Point&,const Point&);\nPoint polar(const double,const double);\nPoint rotate(const Point&,const double);\nenum{ONLINE_FRONT=-2,CLOCKWISE=-1,ON_SEGMENT=0,COUNTER_CLOCKWISE=1,ONLINE_BACK=2};\nint ccw(const Point&,const Point&,const Point&);\nint ccw(const Line&,const Point&);\nbool orthogonal(const Point&,const Point&);\nbool orthogonal(const Line&,const Line&);\nbool parallel(const Point&,const Point&);\nbool parallel(const Line&,const Line&);\nbool intersect(const Line&,const Point&);\nbool intersect(const Line&,const Line&);\nbool intersect(const Segment&,const Point&);\nbool intersect(const Segment&,const Segment&);\nbool intersect(const Line&,const Segment&);\nbool intersect(const Segment&,const Line&);\nbool intersect(const Circle&,const Point&);\nint intersect(const Circle&,const Line&);//count contacts\nint intersect(const Circle&,const Segment&);\nint intersect(const Circle&,const Circle&);//count common tangents\ndouble distance(const Point&,const Point&);\ndouble distance(const Line&,const Point&);\ndouble distance(const Line&,const Line&);\ndouble distance(const Segment&,const Point&);\ndouble distance(const Segment&,const Segment&);\ndouble distance(const Line&,const Segment&);\ndouble distance(const Segment&,const Line&);\ndouble distance(const Circle&,const Point&);\ndouble distance(const Circle&,const Line&);\ndouble distance(const Circle&,const Segment&);\ndouble distance(const Circle&,const Circle&);\nPoint projection(const Line&,const Point&);\nPoint reflection(const Line&,const Point&);\nPoint crosspoint(const Line&,const Line&);\npair<Point,Point>crosspoint(const Circle&,const Line&);\npair<Point,Point>crosspoint(const Circle&,const Segment&);\npair<Point,Point>crosspoint(const Circle&,const Circle&);\npair<Point,Point>tangent(const Circle&,const Point&);\nvector<Line>tangent(const Circle&,const Circle&);\nbool is_convex(const Polygon&);\nPolygon convex_full(Polygon,bool=false);\nenum{OUT,ON,IN};\nint contain(const Polygon&,const Point&);\nint contain(const Circle&,const Point&);\nint contain(const Circle&,const Segment&);\nPolygon convex_cut(const Polygon&,const Line&);\ndouble diameter(Polygon);\ndouble area(const Polygon&);\ndouble area(const Polygon&,const Line&);\ndouble area(const Polygon&,const Circle&);\n//function list end\nPoint vec(const Line&s){return s.p2-s.p1;}\ndouble norm(const Point&p){return p.x*p.x+p.y*p.y;}\ndouble norm(const Line&s){return norm(vec(s));}\ndouble abs(const Point&p){return hypot(p.x,p.y);}\ndouble abs(const Line&s){return abs(vec(s));}\ndouble arg(const Point&p){return atan2(p.y,p.x);}\ndouble arg(const Line&s){return arg(vec(s));}\ndouble arg(const Point&a,const Point&b,const Point&c){\n\tdouble A=arg(b-a),B=arg(c-b);\n\tdouble theta=abs(A-B);\n\treturn min(theta,2*M_PI-theta);\n}\ndouble dot(const Point&a,const Point&b){return a.x*b.x+a.y*b.y;}\ndouble cross(const Point&a,const Point&b){return a.x*b.y-a.y*b.x;}\nPoint polar(const double r,const double theta){return Point(cos(theta),sin(theta))*r;}\nPoint rotate(const Point&p,const double theta){\n\treturn Point(p.x*cos(theta)-p.y*sin(theta),p.x*sin(theta)+p.y*cos(theta));\n}\nint ccw(const Point&a,const Point&b,const Point&c){\n\tPoint p=b-a,q=c-a;\n\treturn cross(p,q)>EPS?COUNTER_CLOCKWISE\n\t\t:cross(p,q)<-EPS?CLOCKWISE\n\t\t:dot(p,q)<0?ONLINE_BACK\n\t\t:norm(p)<norm(q)?ONLINE_FRONT\n\t\t:ON_SEGMENT;\n}\nint ccw(const Line&s,const Point&p){return ccw(s.p1,s.p2,p);}\nbool orthogonal(const Point&a,const Point&b){return eq(dot(a,b),0);}\nbool orthogonal(const Line&s,const Line&t){return orthogonal(vec(s),vec(t));}\nbool parallel(const Point&a,const Point&b){return eq(cross(a,b),0);}\nbool parallel(const Line&s,const Line&t){return parallel(vec(s),vec(t));}\nbool intersect(const Line&s,const Point&p){return eq(cross(vec(s),p-s.p1),0);}\nbool intersect(const Line&s,const Line&t){return !parallel(s,t)||intersect(s,t.p1);}\nbool intersect(const Segment&s,const Point&p){return ccw(s,p)==ON_SEGMENT;}\nbool intersect(const Segment&s,const Segment&t){\n\treturn ccw(s,t.p1)*ccw(s,t.p2)<=0&&ccw(t,s.p1)*ccw(t,s.p2)<=0;\n}\nbool intersect(const Line&s,const Segment&t){\n\treturn cross(vec(s),t.p1-s.p1)*cross(vec(s),t.p2-s.p1)<EPS;\n}\nbool intersect(const Segment&s,const Line&t){return intersect(t,s);}\nbool intersect(const Circle&c,const Point&p){return eq(distance(c.o,p),c.r);}\nint intersect(const Circle&c,const Line&s){\n\tdouble d=distance(s,c.o);\n\treturn eq(d,c.r)?1:d<c.r?2:0;\n}\nint intersect(const Circle&c,const Segment&s){\n\tPoint h=projection(s,c.o);\n\tdouble d1=distance(c.o,s.p1),d2=distance(c.o,s.p2);\n\treturn distance(c.o,h)>c.r+EPS?0\n\t\t:d1<c.r-EPS&&d2<c.r-EPS?0\n\t\t:d1<c.r-EPS&&d2>c.r-EPS||d1>c.r-EPS&&d2<c.r-EPS?1\n\t\t:intersect(s,h)?eq(distance(c.o,h),c.r)?1:2\n\t\t:0;\n}\nint intersect(const Circle&a,const Circle&b){\n\tdouble d=distance(a.o,b.o);\n\treturn eq(d,a.r+b.r)?3:d>a.r+b.r?4:eq(d,abs(a.r-b.r))?1:d>abs(a.r-b.r)?2:0;\n}\ndouble distance(const Point&a,const Point&b){return abs(a-b);}\ndouble distance(const Line&s,const Point&p){return distance(p,projection(s,p));}\ndouble distance(const Line&s,const Line&t){return intersect(s,t)?0:distance(s,t.p1);}\ndouble distance(const Segment&s,const Point&p){\n\treturn distance(p,\n\t\tdot(vec(s),p-s.p1)<0?s.p1\n\t\t:dot(-vec(s),p-s.p2)<0?s.p2\n\t\t:projection(s,p)\n\t);\n}\ndouble distance(const Segment&s,const Segment&t){\n\treturn intersect(s,t)?0:min({\n\t\tdistance(s,t.p1),distance(s,t.p2),\n\t\tdistance(t,s.p1),distance(t,s.p2)\n\t});\n}\ndouble distance(const Line&s,const Segment&t){\n\treturn intersect(s,t)?0:min(distance(s,t.p1),distance(s,t.p2));\n}\ndouble distance(const Segment&s,const Line&t){return distance(t,s);}\ndouble distance(const Circle&c,const Point&p){return abs(distance(c.o,p)-c.r);}\ndouble distance(const Circle&c,const Line&s){return max(distance(s,c.o)-c.r,0.);}\ndouble distance(const Circle&c,const Segment&s){\n\treturn intersect(c,s)?0\n\t\t:contain(c,s)?c.r-max(distance(c.o,s.p1),distance(c.o,s.p2))\n\t\t:distance(s,c.o)-c.r;\n}\ndouble distance(const Circle&a,const Circle&b){return max(distance(a.o,b.o)-a.r-b.r,0.);}\nPoint projection(const Line&s,const Point&p){\n\treturn s.p1+vec(s)*dot(p-s.p1,vec(s))/norm(s);\n}\nPoint reflection(const Line&s,const Point&p){return projection(s,p)*2-p;}\nPoint crosspoint(const Line&s,const Line&t){\n\tdouble d1=abs(cross(vec(s),t.p1-s.p1));\n\tdouble d2=abs(cross(vec(s),t.p2-s.p1));\n\treturn t.p1+vec(t)*(d1/(d1+d2));\n}\npair<Point,Point>crosspoint(const Circle&c,const Line&s){\n\tPoint h=projection(s,c.o);\n\tPoint e=vec(s)/abs(s)*sqrt(c.r*c.r-norm(h-c.o));\n\treturn minmax(h-e,h+e);\n}\npair<Point,Point>crosspoint(const Circle&c,const Segment&s){\n\tpair<Point,Point>p=crosspoint(c,Line(s));\n\treturn intersect(c,s)==2?p\n\t\t:intersect(s,p.first)?make_pair(p.first,p.first)\n\t\t:make_pair(p.second,p.second);\n}\npair<Point,Point>crosspoint(const Circle&a,const Circle&b){\n\tdouble d=distance(a.o,b.o);\n\tdouble alpha=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\n\tdouble theta=arg(b.o-a.o);\n\treturn minmax(a.o+polar(a.r,theta+alpha),a.o+polar(a.r,theta-alpha));\n}\npair<Point,Point>tangent(const Circle&c,const Point&p){\n\treturn crosspoint(c,Circle(p,sqrt(norm(c.o-p)-c.r*c.r)));\n}\nvector<Line>tangent(const Circle&a,const Circle&b){\n\tvector<Line>ret;\n\tdouble g=distance(a.o,b.o);\n\tif(eq(g,0))return ret;\n\tPoint u=(b.o-a.o)/g;\n\tPoint v=rotate(u,M_PI/2);\n\tfor(int s:{-1,1}){\n\t\tdouble h=(a.r+b.r*s)/g;\n\t\tif(eq(h*h,1))ret.emplace_back(a.o+(h>0?u:-u)*a.r,a.o+(h>0?u:-u)*a.r+v);\n\t\telse if(1-h*h>0){\n\t\t\tPoint U=u*h,V=v*sqrt(1-h*h);\n\t\t\tret.emplace_back(a.o+(U+V)*a.r,b.o-(U+V)*b.r*s);\n\t\t\tret.emplace_back(a.o+(U-V)*a.r,b.o-(U-V)*b.r*s);\n\t\t}\n\t}\n\treturn ret;\n}\nbool is_convex(const Polygon&P){\n\tfor(int i=0;i<P.size();i++)\n\t\tif(ccw(P[i],P[(i+1)%P.size()],P[(i+2)%P.size()])==CLOCKWISE)return false;\n\treturn true;\n}\nPolygon convex_full(Polygon P,bool ONSEG){\n\tif(P.size()<=2)return P;\n\tsort(P.begin(),P.end());\n\tPolygon ret(2*P.size());\n\tint k=0,t;\n\tif(ONSEG){\n\t\tfor(const Point&p:P){\n\t\t\twhile(k>=2&&ccw(ret[k-2],ret[k-1],p)==CLOCKWISE)k--;\n\t\t\tret[k++]=p;\n\t\t}\n\t\tt=k;\n\t\tfor(int i=P.size()-2;i>=0;i--){\n\t\t\twhile(k>=t+1&&ccw(ret[k-2],ret[k-1],P[i])==CLOCKWISE)k--;\n\t\t\tret[k++]=P[i];\n\t\t}\n\t}\n\telse{\n\t\tfor(const Point&p:P){\n\t\t\twhile(k>=2&&ccw(ret[k-2],ret[k-1],p)!=COUNTER_CLOCKWISE)k--;\n\t\t\tret[k++]=p;\n\t\t}\n\t\tt=k;\n\t\tfor(int i=P.size()-2;i>=0;i--){\n\t\t\twhile(k>=t+1&&ccw(ret[k-2],ret[k-1],P[i])!=COUNTER_CLOCKWISE)k--;\n\t\t\tret[k++]=P[i];\n\t\t}\n\t}\n\tret.resize(k-1);\n\tint mi=0;\n\tfor(int i=1;i<k-1;i++)\n\t\tif(eq(ret[mi].y,ret[i].y)?ret[mi].x>ret[i].x:ret[mi].y>ret[i].y)mi=i;\n\trotate(ret.begin(),ret.begin()+mi,ret.end());\n\treturn ret;\n}\nint contain(const Polygon&P,const Point&p){\n\tbool in=false;\n\tfor(int i=0;i<P.size();i++){\n\t\tSegment s(P[i],P[(i+1)%P.size()]);\n\t\tif(intersect(s,p))return ON;\n\t\telse{\n\t\t\tPoint a=s.p1-p,b=s.p2-p;\n\t\t\tif(a.y>b.y)swap(a,b);\n\t\t\tif(a.y<EPS&&EPS<b.y&&cross(a,b)>EPS)in=!in;\n\t\t}\n\t}\n\treturn in?IN:OUT;\n}\nint contain(const Circle&c,const Point&p){\n\tdouble d=distance(c.o,p);\n\treturn eq(d,c.r)?ON:d<c.r?IN:OUT;\n}\nint contain(const Circle&c,const Segment&s){\n\tdouble d1=distance(c.o,s.p1),d2=distance(c.o,s.p2);\n\treturn d1<c.r+EPS&&d2<c.r+EPS?eq(d1,c.r)||eq(d2,c.r)?ON:IN:OUT;\n}\nPolygon convex_cut(const Polygon&P,const Line&s){\n\tPolygon ret;\n\tfor(int i=0;i<P.size();i++){\n\t\tSegment t(P[i],P[(i+1)%P.size()]);\n\t\tif(ccw(s,t.p1)!=CLOCKWISE)ret.push_back(t.p1);\n\t\tif(!parallel(s,t)&&!intersect(s,t.p1)\n\t\t\t&&!intersect(s,t.p2)&&intersect(s,t))ret.push_back(crosspoint(s,t));\n\t}\n\treturn ret;\n}\ndouble diameter(Polygon P){\n\tif(!is_convex(P))P=convex_full(P);\n\tint mi=0,Mi=0;\n\tfor(int i=1;i<P.size();i++){\n\t\tif(P[i].x<P[mi].x)mi=i;\n\t\tif(P[i].x>P[Mi].x)Mi=i;\n\t}\n\tdouble ret=0;\n\tint sm=mi,sM=Mi;\n\twhile(mi!=sM||Mi!=sm){\n\t\tret=max(ret,norm(P[mi]-P[Mi]));\n\t\tif(cross(P[(mi+1)%P.size()]-P[mi],P[(Mi+1)%P.size()]-P[Mi])<0)mi=(mi+1)%P.size();\n\t\telse Mi=(Mi+1)%P.size();\n\t}\n\treturn sqrt(ret);\n}\ndouble area(const Polygon&P){\n\tdouble ret=0;\n\tfor(int i=0;i<P.size();i++)ret+=cross(P[i],P[(i+1)%P.size()]);\n\treturn ret/2;\n}\ndouble area(const Polygon&P,const Line&s){return area(convex_cut(P,s));}\ndouble area(const Polygon&P,const Circle&c){\n\tdouble ret=0;\n\tfor(int i=0;i<P.size();i++)\n\t{\n\t\tSegment s(P[i],P[(i+1)%P.size()]);\n\t\tif(contain(c,s))ret+=cross(s.p1-c.o,s.p2-c.o);\n\t\telse if(!intersect(c,s)){\n\t\t\tdouble a=arg(s.p2-c.o)-arg(s.p1-c.o);\n\t\t\tif(a>M_PI)a-=2*M_PI;\n\t\t\tif(a<-M_PI)a+=2*M_PI;\n\t\t\tret+=c.r*c.r*a;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpair<Point,Point>p=crosspoint(c,s);\n\t\t\tPoint tmp[4]={s.p1,p.first,p.second,s.p2};\n\t\t\tif(intersect(c,Segment(s.p1,p.first))==2)swap(tmp[1],tmp[2]);\n\t\t\tfor(int j=0;j<3;j++)\n\t\t\t{\n\t\t\t\tSegment t(tmp[j],tmp[j+1]);\n\t\t\t\tif(contain(c,t))ret+=cross(t.p1-c.o,t.p2-c.o);\n\t\t\t\telse{\n\t\t\t\t\tdouble a=arg(t.p2-c.o)-arg(t.p1-c.o);\n\t\t\t\t\tif(a>M_PI)a-=2*M_PI;\n\t\t\t\t\tif(a<-M_PI)a+=2*M_PI;\n\t\t\t\t\tret+=c.r*c.r*a;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn ret/2;\n}\nmain()\n{\n\tint N;\n\twhile(cin>>N,N)\n\t{\n\t\tCircle c[100];\n\t\tchar tmp;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tcin>>c[i].o.x>>tmp>>c[i].o.y;\n\t\t\tc[i].r=1;\n\t\t}\n\t\tvector<Point>A;\n\t\tfor(int i=0;i<N;i++)A.push_back(c[i].o);\n\t\tfor(int i=0;i<N;i++)for(int j=i+1;j<N;j++)\n\t\t{\n\t\t\tif(intersect(c[i],c[j]))\n\t\t\t{\n\t\t\t\tA.push_back(crosspoint(c[i],c[j]).first);\n\t\t\t\tA.push_back(crosspoint(c[i],c[j]).second);\n\t\t\t}\n\t\t}\n\t\tint ans=1;\n\t\tfor(Point p:A)\n\t\t{\n\t\t\tint now=0;\n\t\t\tfor(int i=0;i<N;i++)now+=contain(c[i],p)!=OUT;\n\t\t\tans=max(ans,now);\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4080,
"score_of_the_acc": -0.8663,
"final_rank": 7
},
{
"submission_id": "aoj_0090_2382331",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0;i<(n);i++)\ntypedef double Real;\ntypedef complex<Real> P;\n\nbool ishit_circle_segment(P o, Real r, P t, P s){\n // s to origin\n o -= s;\n t -= s;\n // t on x axis\n if(s==t)return false;\n o = (o / t) * abs(t);\n \n Real d = r*r - o.imag()*o.imag();\n if(d < 0.0)return false;\n Real x0 = o.real() + sqrt(d);\n Real x1 = o.real() - sqrt(d);\n Real tb = abs(t);\n if(0.0 <= x0 && x0 <= tb)return true;\n if(0.0 <= x1 && x1 <= tb)return true;\n return false;\n}\npair<P,P> hitpoint_circle_circle(P o1,Real r1,P o2,Real r2){\n if(o1==o2 && r1==r2){\n return make_pair(o1,o2);\n }\n // o1 to origin\n o2 -= o1;\n Real x1 = o2.real();\n Real y1 = o2.imag();\n Real a = (x1*x1 + y1*y1 + r1*r1 - r2*r2)/2.0;\n Real d = (x1*x1 + y1*y1)*r1*r1 - a*a;\n if(d < 0.0){\n return make_pair(o1,o2+o1);\n }\n if(x1*x1 + y1*y1 == 0.0){\n return make_pair(o1,o2+o1);\n }\n P hit1 = P((a*x1+y1*sqrt(d))/(x1*x1+y1*y1), (a*y1-x1*sqrt(d))/(x1*x1+y1*y1));\n P hit2 = P((a*x1-y1*sqrt(d))/(x1*x1+y1*y1), (a*y1+x1*sqrt(d))/(x1*x1+y1*y1));\n return make_pair(hit1+o1,hit2+o1);\n}\nbool inner_circle_point(P o,Real r,P p){\n return abs(p-o)<=r+1e-8;\n}\n\nint n;\nP ps[125];\n\nint main(void){\n // Here your code !\n while(true){\n scanf(\"%d\",&n);\n if(n==0)break;\n REP(i,n){\n Real x,y;\n scanf(\"%lf,%lf\",&x,&y);\n ps[i] = P(x,y);\n }\n vector<P> check;\n REP(i,n)REP(j,i){\n pair<P,P> t = hitpoint_circle_circle(ps[i],1.0,ps[j],1.0);\n check.push_back(t.first);\n check.push_back(t.second);\n }\n int ans = 1;\n REP(i,check.size()){\n P p = check[i];\n int tmp = 0;\n REP(j,n){\n if(inner_circle_point(ps[j],1.0,p)){\n tmp++;\n }\n }\n if(tmp > ans){\n // printf(\"%f %f -> %d\\n\",p.real(),p.imag(),tmp);\n ans = tmp;\n }\n }\n printf(\"%d\\n\",ans);\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3468,
"score_of_the_acc": -0.5063,
"final_rank": 6
},
{
"submission_id": "aoj_0090_2361820",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint n,ans,a;\ndouble x[101],y[101];\nint main(){\n while(cin>>n,n){\n ans=0;\n r(i,n)scanf(\"%lf,%lf\",&x[i],&y[i]);\n r(i,1000)r(j,1000){a=0;\n double q=(double)i/100,w=(double)j/100;\n r(k,n)if((x[k]-q)*(x[k]-q)+(y[k]-w)*(y[k]-w)<=1)a++;\n ans=max(a,ans);\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 430,
"memory_kb": 3160,
"score_of_the_acc": -0.9193,
"final_rank": 8
},
{
"submission_id": "aoj_0090_2361815",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint n,ans;\ndouble x[101],y[101],a[101][101];\nint main(){\n while(cin>>n,n){\n ans=0;\n r(i,n)scanf(\"%lf,%lf\",&x[i],&y[i]);\n r(i,1000)r(j,1000){\n int a=0;\n r(k,n)if((x[k]-(double)i/100)*(x[k]-(double)i/100)+(y[k]-(double)j/100)*(y[k]-(double)j/100)<=1)a++;\n ans=max(a,ans);\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 3080,
"score_of_the_acc": -0.9592,
"final_rank": 15
},
{
"submission_id": "aoj_0090_2361805",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint n,ans;\ndouble x[101],y[101],a[101][101];\nint main(){\n while(cin>>n,n){\n ans=0;\n r(i,n)scanf(\"%lf,%lf\",&x[i],&y[i]);\n r(i,1000)r(j,1000){\n int a=0;\n r(k,n)if((x[k]-(double)i/10)*(x[k]-(double)i/10)+(y[k]-(double)j/10)*(y[k]-(double)j/10)<=1)a++;\n ans=max(a,ans);\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 3076,
"score_of_the_acc": -0.9568,
"final_rank": 14
},
{
"submission_id": "aoj_0090_2145790",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\nusing namespace std;\n\n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define all(v) begin(v), end(v)\n#define pb(a) push_back(a)\n#define fr first\n#define sc second\n#define INF 2000000000\n#define int long long int\n\n#define X real()\n#define Y imag()\n#define EPS (1e-12)\n#define EQ(a,b) (abs((a) - (b)) < EPS)\n#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )\n#define LE(n, m) ((n) < (m) + EPS)\n#define LEQ(n, m) ((n) <= (m) + EPS)\n#define GE(n, m) ((n) + EPS > (m))\n#define GEQ(n, m) ((n) + EPS >= (m))\n\ntypedef vector<int> VI;\ntypedef vector<VI> MAT;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n\ntypedef complex<double> P;\ntypedef pair<P, P> L;\ntypedef pair<P, double> C;\n\nint dy[]={0, 0, 1, -1};\nint dx[]={1, -1, 0, 0};\nint const MOD = 1000000007;\n\nnamespace std {\n bool operator<(const P& a, const P& b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n}\n\ndouble calc(P x, P y) {\n double dx = (x.X - y.X) * (x.X - y.X);\n double dy = (x.Y - y.Y) * (x.Y - y.Y);\n return dx + dy;\n}\n\nsigned main() {\n int n;\n while(cin >> n, n) {\n vector<P> v(n);\n double x, y;\n int ma = 0;\n rep(i,0,n) {\n scanf(\"%lf,%lf\", &x, &y);\n v[i] = P(x, y);\n }\n for(double i = 0.0; i <= 10.01; i += 0.01) {\n for(double j = 0.0; j <= 10.01; j += 0.01) {\n int cnt = 0;\n rep(k,0,n) if(calc(P(i, j), v[k]) <= 1.0 + EPS) cnt++;\n ma = max(ma, cnt);\n }\n }\n cout << ma << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 430,
"memory_kb": 3184,
"score_of_the_acc": -0.9334,
"final_rank": 11
}
] |
aoj_0091_cpp
|
Blur
図 1 のような 10×10 のマス目の「布」があり、（1，2）のようにX座標・Y座標の値の対でマス目を示すことにします。座標値は 0 から始まる整数とします。例えば、図 1 の◎の座標は (1, 2) です。
この「布」に染料を少しずつたらして染物を作ります。たらす染料の滴には「大」「中」「小」の 3 サイズがあり、染料の滴の落ちたマス目を中心に図 1 のように周囲も色がつきます。図 1 で☆が中心、○が色のにじむ範囲です。
「布」は、最初は「まっしろ」つまり、どのマス目も色の濃さを示す値が 0 とします。染料の滴が落ちるごとに値が 1 ずつ増えていきます。「小」が（1, 2）、「中」が（3, 2）に落ちた場合、各マス目の値は図 2 の左のようになります。染料がもったいないので、図 2 の右に示すようなにじむ範囲が布の外にはみ出すような染料の落とし方はしないことになっています。また、同じ場所に複数の染料をたらすこともあります。
このような作業を何回か繰り返した結果、布にすばらしい模様が浮かび上がりましたが、残念なことに、うっかり作業経過を記録し忘れてしまいました。どうにもさっぱり思い出せませんが、かろうじて、落とした染料の滴数は覚えていました。あなたは、すばらしい染物を再現しなければなりません。すばらしい染物のデータを読みこんで、どこに、どのような染料をたらしたかを出力するプログラムを作成してください。なお、落とした染料の滴数は 12 以下とします。
入力
入力の形式は以下のとおりです：
最初の 1 行に落とした染料の滴数
n
が与えられます。次の行から 10 行に各座標の色の濃さが空白区切りで与えられます。
出力
出力は
n
行からなります。染料の滴の「大」を 3、「中」を 2、「小」を 1 で表し、落とした染料ごとに、そのX座標、Y座標、滴の大きさを空白で区切って1行に出力してください。
染料のたらし方はどのような順番で出力しても良いものとします。
入力例1
2
0 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0
0 0 1 1 1 0 0 0 0 0
0 0 0 1 0 0 0 1 1 1
0 0 0 0 0 0 0 1 1 1
0 0 0 0 0 0 0 1 1 1
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
出力例1
3 2 1
8 4 2
入力例2
6
0 0 1 0 0 0 0 0 0 0
0 1 1 1 0 0 0 0 0 0
1 1 1 1 1 1 1 1 0 0
0 1 1 1 1 1 1 1 0 0
0 0 1 1 1 3 1 1 0 0
0 0 1 1 3 1 1 1 0 0
0 0 1 1 1 1 1 1 1 0
0 0 1 1 1 1 1 1 1 1
0 0 0 0 0 0 1 1 1 0
0 0 0 0 0 0 0 1 0 0
出力例2
2 2 3
7 7 3
6 3 2
3 6 2
4 4 1
5 5 1
|
[
{
"submission_id": "aoj_0091_6954951",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cmath>\n\n#define N 10\n\nusing namespace std;\n\nstruct Tri {\n int a, b, c;\n bool operator< (const Tri& o) {\n // greater c -> b -> a\n if(c != o.c) return c > o.c;\n if(b != o.b) return b > o.b;\n return a > o.a;\n }\n};\n\nint stamp_size[] = {5, 9, 13};\nint dir_x[13] = {0, 0, 0, 1, -1, 1, -1, 1, -1, 0, 0, 2, -2};\nint dir_y[13] = {0, 1, -1, 0, 0, 1, -1, -1, 1, 2, -2, 0, 0};\n\nint sizeToDirLength(int size){\n return stamp_size[size];\n}\n\nint n;\nint nuno[N][N];\n\nbool range(int x, int y, int size) {\n int offset = size != 2 ? 1 : 2;\n\n if(x < offset || N - offset <= x || y < offset || N - offset <= y){\n return false;\n }\n return true;\n}\n\nbool check(int x, int y, int size) {\n if(!range(x, y, size)){\n return false;\n }\n\n int dirNum = sizeToDirLength(size);\n for(int i = 0; i < dirNum; i++) {\n int nx = x + dir_x[i];\n int ny = y + dir_y[i];\n\n if(nuno[ny][nx] <= 0) {\n return false;\n }\n }\n\n return true;\n}\n\nvoid simu(int x, int y, int size, int add) {\n int dirNum = sizeToDirLength(size);\n for(int i = 0; i < dirNum; i++) {\n int nx = x + dir_x[i];\n int ny = y + dir_y[i];\n nuno[ny][nx] += add;\n }\n}\n\nint patternToSize(int d, const Tri& pattern){\n if(d < pattern.c) {\n return 2;\n } else if(d < pattern.b + pattern.c) {\n return 1;\n }\n return 0;\n}\n\nvector<Tri> answer;\nvector<pair<int, int> > cand[3];\n\nbool dfs(int d, int remain, const Tri& pattern) {\n if(d >= n) {\n return remain == 0;\n }\n\n // int size = patternToSize(d, pattern);\n\n // for(int i = 0; i < cand[size].size(); i++) {\n // pair<int, int> p = cand[size][i];\n // int x = p.first, y = p.second;\n for(int size = 2; size >= 0; size--)\n for(int x = 0; x < N; x++)\n for(int y = 0; y < N; y++){\n if(!check(x, y, size)){\n continue;\n }\n simu(x, y, size, -1);\n if(dfs(d + 1, remain - stamp_size[size], pattern)){\n answer.push_back((Tri){x, y, size + 1});\n printf(\"%d %d %d\\n\", x, y, size + 1);\n\n return true;\n }\n simu(x, y, size, 1);\n }\n\n return false;\n}\n\nvector<Tri> calcStampNum(int n, int sum) {\n vector<Tri> res;\n int r1 = n - (sum - 5*n)/4;\n int r2 = (sum - 5*n)/4;\n\n for(int a = 0; a < n; a++) {\n for(int b = 0; b < n; b++){\n for(int c = 0; c < n; c++) {\n if(a - c != r1 || b + 2*c != r2){\n continue;\n }\n res.push_back((Tri){a, b, c});\n }\n }\n }\n\n return res;\n}\n\nint main() {\n cin >> n;\n\n int sum = 0;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n cin >> nuno[i][j];\n sum += nuno[i][j];\n }\n }\n\n for(int size = 0; size < 3; size++) {\n for(int x = 0; x < N; x++) {\n for(int y = 0; y < N; y++) {\n if(check(x, y, size)) {\n cand[size].push_back(make_pair(x, y));\n }\n }\n }\n }\n\n vector<Tri> stampNum = calcStampNum(n, sum);\n sort(stampNum.begin(), stampNum.end());\n\n for(int i = 0; i < stampNum.size(); i++) {\n if(dfs(0, sum, stampNum[i])) {\n break;\n }\n }\n\n sort(answer.begin(), answer.end());\n\n for(int i = 0; i < answer.size(); i++){\n Tri t = answer[i];\n // printf(\"%d %d %d\\n\", t.a, t.b, t.c);\n }\n\n return 0;\n}\n\n\n/*\na + b + c = n\na*5 + b*9 + c*13 = sum\n\n1 1 1 | n\n5 9 13 | sum\n\n1 1 1 | n\n0 4 8 | sum-5n\n\n1 1 1 | n\n0 1 2 | (sum-5n)/4\n\n1 0 -1 | n-(sum-5n)/4\n0 1 2 | (sum-5n)/4\n\na - c = n-(sum-5n)/4\nb + 2*c = (sum-5n)/4\n\n*/",
"accuracy": 0.1388888888888889,
"time_ms": 30,
"memory_kb": 3232,
"score_of_the_acc": -0.0184,
"final_rank": 17
},
{
"submission_id": "aoj_0091_6954916",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cmath>\n\n#define N 10\n\nusing namespace std;\n\nstruct Tri {\n int a, b, c;\n bool operator< (const Tri& o) {\n // greater c -> b -> a\n if(c != o.c) return c > o.c;\n if(b != o.b) return b > o.b;\n return a > o.a;\n }\n};\n\nint stamp_size[] = {5, 9, 13};\nint dir_x[13] = {0, 0, 0, 1, -1, 1, -1, 1, -1, 0, 0, 2, -2};\nint dir_y[13] = {0, 1, -1, 0, 0, 1, -1, -1, 1, 2, -2, 0, 0};\n\nint sizeToDirLength(int size){\n return stamp_size[size];\n}\n\nint n;\nint nuno[N][N];\n\nbool range(int x, int y, int size) {\n int offset = size != 2 ? 1 : 2;\n\n if(x < offset || N - offset <= x || y < offset || N - offset <= y){\n return false;\n }\n return true;\n}\n\nbool check(int x, int y, int size) {\n if(!range(x, y, size)){\n return false;\n }\n\n int dirNum = sizeToDirLength(size);\n for(int i = 0; i < dirNum; i++) {\n int nx = x + dir_x[i];\n int ny = y + dir_y[i];\n\n if(nuno[ny][nx] <= 0) {\n return false;\n }\n }\n\n return true;\n}\n\nvoid simu(int x, int y, int size, int add) {\n int dirNum = sizeToDirLength(size);\n for(int i = 0; i < dirNum; i++) {\n int nx = x + dir_x[i];\n int ny = y + dir_y[i];\n nuno[ny][nx] += add;\n }\n}\n\nint patternToSize(int d, const Tri& pattern){\n if(d < pattern.c) {\n return 2;\n } else if(d < pattern.b + pattern.c) {\n return 1;\n }\n return 0;\n}\n\nvector<Tri> answer;\nvector<pair<int, int> > cand[3];\n\nbool dfs(int d, int remain, const Tri& pattern) {\n if(d >= n) {\n return remain == 0;\n }\n\n // int size = patternToSize(d, pattern);\n\n // for(int i = 0; i < cand[size].size(); i++) {\n // pair<int, int> p = cand[size][i];\n // int x = p.first, y = p.second;\n for(int size = 2; size >= 0; size--)\n for(int x = 0; x < N; x++)\n for(int y = 0; y < N; y++){\n if(!check(x, y, size)){\n continue;\n }\n simu(x, y, size, -1);\n if(dfs(d + 1, remain - stamp_size[size], pattern)){\n answer.push_back((Tri){x, y, size + 1});\n return true;\n }\n simu(x, y, size, 1);\n }\n\n return false;\n}\n\nvector<Tri> calcStampNum(int n, int sum) {\n vector<Tri> res;\n int r1 = n - (sum - 5*n)/4;\n int r2 = (sum - 5*n)/4;\n\n for(int a = 0; a < n; a++) {\n for(int b = 0; b < n; b++){\n for(int c = 0; c < n; c++) {\n if(a - c != r1 || b + 2*c != r2){\n continue;\n }\n res.push_back((Tri){a, b, c});\n }\n }\n }\n\n return res;\n}\n\nint main() {\n cin >> n;\n\n int sum = 0;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n cin >> nuno[i][j];\n sum += nuno[i][j];\n }\n }\n\n for(int size = 0; size < 3; size++) {\n for(int x = 0; x < N; x++) {\n for(int y = 0; y < N; y++) {\n if(check(x, y, size)) {\n cand[size].push_back(make_pair(x, y));\n }\n }\n }\n }\n\n vector<Tri> stampNum = calcStampNum(n, sum);\n sort(stampNum.begin(), stampNum.end());\n\n for(int i = 0; i < stampNum.size(); i++) {\n if(dfs(0, sum, stampNum[i])) {\n break;\n }\n }\n\n sort(answer.begin(), answer.end());\n\n for(int i = 0; i < answer.size(); i++){\n Tri t = answer[i];\n printf(\"%d %d %d\\n\", t.a, t.b, t.c);\n }\n\n return 0;\n}\n\n\n/*\na + b + c = n\na*5 + b*9 + c*13 = sum\n\n1 1 1 | n\n5 9 13 | sum\n\n1 1 1 | n\n0 4 8 | sum-5n\n\n1 1 1 | n\n0 1 2 | (sum-5n)/4\n\n1 0 -1 | n-(sum-5n)/4\n0 1 2 | (sum-5n)/4\n\na - c = n-(sum-5n)/4\nb + 2*c = (sum-5n)/4\n\n*/",
"accuracy": 0.1388888888888889,
"time_ms": 30,
"memory_kb": 3260,
"score_of_the_acc": -0.0194,
"final_rank": 18
},
{
"submission_id": "aoj_0091_6954869",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cmath>\n\n#define N 10\n\nusing namespace std;\n\nstruct Tri {\n int a, b, c;\n bool operator< (const Tri& o) {\n // greater c -> b -> a\n if(c != o.c) return c > o.c;\n if(b != o.b) return b > o.b;\n return a > o.a;\n }\n};\n\nint stamp_size[] = {5, 9, 13};\nint dir_x[13] = {0, 0, 0, 1, -1, 1, -1, 1, -1, 0, 0, 2, -2};\nint dir_y[13] = {0, 1, -1, 0, 0, 1, -1, -1, 1, 2, -2, 0, 0};\n\nint sizeToDirLength(int size){\n return stamp_size[size];\n}\n\nint n;\nint nuno[N][N];\n\nbool range(int x, int y, int size) {\n int offset = size != 2 ? 1 : 2;\n\n if(x < offset || N - offset <= x || y < offset || N - offset <= y){\n return false;\n }\n return true;\n}\n\nbool check(int x, int y, int size) {\n if(!range(x, y, size)){\n return false;\n }\n int dirNum = sizeToDirLength(size);\n\n for(int i = 0; i < dirNum; i++) {\n int nx = x + dir_x[i];\n int ny = y + dir_y[i];\n\n if(nuno[ny][nx] <= 0) {\n return false;\n }\n }\n\n return true;\n}\n\nvoid simu(int x, int y, int size, int add) {\n int dirNum = sizeToDirLength(size);\n for(int i = 0; i < dirNum; i++) {\n int nx = x + dir_x[i];\n int ny = y + dir_y[i];\n nuno[ny][nx] += add;\n }\n}\n\nint patternToSize(int d, const Tri& pattern){\n if(d < pattern.c) {\n return 2;\n } else if(d < pattern.b + pattern.c) {\n return 1;\n }\n return 0;\n}\n\nvector<Tri> answer;\nvector<pair<int, int> > cand[3];\n\nbool dfs(int d, int remain, const Tri& pattern) {\n if(d >= n) {\n return remain == 0;\n }\n\n // int size = patternToSize(d, pattern);\n for(int size = 2; size >= 0; size--)\n for(int i = 0; i < cand[size].size(); i++){\n pair<int, int> p = cand[size][i];\n int x = p.first, y = p.second;\n if(!check(x, y, size)){\n continue;\n }\n simu(x, y, size, -1);\n if(dfs(d + 1, remain - stamp_size[size], pattern)){\n answer.push_back((Tri){x, y, size + 1});\n return true;\n }\n simu(x, y, size, 1);\n }\n\n return false;\n}\n\nvector<Tri> calcStampNum(int n, int sum) {\n vector<Tri> res;\n int r1 = n - (sum - 5*n)/4;\n int r2 = (sum - 5*n)/4;\n\n for(int a = 0; a < n; a++) {\n for(int b = 0; b < n; b++){\n for(int c = 0; c < n; c++) {\n if(a - c != r1 || b + 2*c != r2){\n continue;\n }\n res.push_back((Tri){a, b, c});\n }\n }\n }\n\n return res;\n}\n\nint main() {\n cin >> n;\n\n int sum = 0;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n cin >> nuno[i][j];\n sum += nuno[i][j];\n }\n }\n\n for(int size = 0; size < 3; size++) {\n for(int x = 0; x < N; x++) {\n for(int y = 0; y < N; y++) {\n if(check(x, y, size)) {\n cand[size].push_back(make_pair(x, y));\n }\n }\n }\n }\n\n vector<Tri> stampNum = calcStampNum(n, sum);\n sort(stampNum.begin(), stampNum.end());\n\n for(int i = 0; i < stampNum.size(); i++) {\n if(dfs(0, sum, stampNum[i])) {\n break;\n }\n }\n\n sort(answer.begin(), answer.end());\n\n for(int i = 0; i < answer.size(); i++){\n Tri t = answer[i];\n printf(\"%d %d %d\\n\", t.a, t.b, t.c);\n }\n\n return 0;\n}\n\n\n/*\na + b + c = n\na*5 + b*9 + c*13 = sum\n\n1 1 1 | n\n5 9 13 | sum\n\n1 1 1 | n\n0 4 8 | sum-5n\n\n1 1 1 | n\n0 1 2 | (sum-5n)/4\n\n1 0 -1 | n-(sum-5n)/4\n0 1 2 | (sum-5n)/4\n\na - c = n-(sum-5n)/4\nb + 2*c = (sum-5n)/4\n\n*/",
"accuracy": 0.1388888888888889,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.0144,
"final_rank": 16
},
{
"submission_id": "aoj_0091_4996623",
"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 1e18\n#define modulo 1000000007\n#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)\n\nvector dx(3,vector<int>()),dy(3,vector<int>());\n\n\nvector<int> x,y,type;\nvector<int> ans;\nbool dfs(vector<vector<int>> g,vector<int> t,int last = 0){\n\tif(t[0]==0&&t[1]==0&&t[2]==0){\n\t\treturn true;\n\t}\n\tfor(int i=last;i<x.size();i++){\n\t\tfor(int j=2;j>type[i];j--){\n\t\t\tif(t[j]>0)return false;\n\t\t}\n\t\tbool f = true;\n\t\tvector<vector<int>> ng = g;\n\n\t\trep(j,type[i]+1){\n\t\t\trep(xx,dx[j].size()){\n\t\t\t\t\n\t\t\t\tint X = x[i]+dx[j][xx], Y = y[i]+dy[j][xx];\n\t\t\t\tif(ng[Y][X]==0){\n\t\t\t\t\tf=false;\n\t\t\t\t\tgoto Label;\n\t\t\t\t}\n\t\t\t\tng[Y][X]--;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tLabel:\n\t\tif(!f)continue;\n\t\tt[type[i]]--;\n\t\tf = dfs(ng,t,i);\n\t\tt[type[i]]++;\n\t\tif(f){\n\t\t\tans.push_back(i);\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main(){\n\t\n\tdx[0] = {0,0,0,1,-1};\n\tdy[0] = {0,1,-1,0,0};\n\n\tdx[1] = {1,1,-1,-1};\n\tdy[1] = {1,-1,1,-1};\n\n\tdx[2] = {0,0,2,-2};\n\tdy[2] = {2,-2,0,0};\n\t\n\tint n;\n\tcin>>n;\n\n\tint s = 0;\n\tvector g(10,vector<int>(10));\n\trep(i,10){\n\t\trep(j,10){\n\t\t\tcin>>g[i][j];\n\t\t\ts += g[i][j];\n\t\t}\n\t}\n\t\n\tvector<vector<int>> t;\n\t\n\trep(i,n+1){\n\t\trep(j,n+1){\n\t\t\trep(k,1+n){\n\t\t\t\tif(i+j+k==n&&i*5+j*9+k*13==s){\n\t\t\t\t\tt.push_back({i,j,k});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\t\n\trep(_,3){\n\t\tfor(int i=1;i<9;i++){\n\t\t\tfor(int j=1;j<9;j++){\n\t\t\t\tif(_==2){\n\t\t\t\t\tif(i==1||i==8||j==1||j==8)continue;\n\t\t\t\t}\n\t\t\t\tx.push_back(i);\n\t\t\t\ty.push_back(j);\n\t\t\t\ttype.push_back(_);\n\t\t\t}\n\t\t}\n\t}\n\treverse(x.begin(),x.end());\n\treverse(y.begin(),y.end());\n\treverse(type.begin(),type.end());\n\trep(i,t.size()){\n\t\tif(dfs(g,t[i]))break;\n\t}\n\t\n\trep(i,ans.size()){\n\t\tcout<<x[ans[i]]<<' '<<y[ans[i]]<<' '<<type[ans[i]]+1<<endl;\n\t}\n\t\n return 0;\n}",
"accuracy": 1,
"time_ms": 1810,
"memory_kb": 3472,
"score_of_the_acc": -0.2557,
"final_rank": 7
},
{
"submission_id": "aoj_0091_4359850",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int x;\n cin >> x;\n array<int, 100> v{};\n for (auto &&i : v) scanf(\"%d\", &i);\n int A[] = {0, 9, 10, 11, 20};\n int B[] = {0, 1, 2, 10, 11, 12, 20, 21, 22};\n int C[] = {0, 9, 10, 11, 18, 19, 20, 21, 22, 29, 30, 31, 40};\n auto dfs = [&](int cur, int cnt, auto &&f) -> bool {\n if(cnt == 0){\n int ok = !*max_element(v.begin(),v.end());\n if(ok) return 1;\n }\n for (int i = cur; i < 100; ++i) {\n int y = i/10, x = i%10;\n if(y <= 5 && 2 <= x && x <= 7) {\n int ok = 1;\n for (auto &&p : C) if(!v[i+p]) ok = 0;\n if(ok){\n for (auto &&p : C) v[i+p]--;\n if(f(i,cnt-1, f)){\n printf(\"%d %d 3\\n\", x, y+2);\n return 1;\n }\n for (auto &&p : C) v[i+p]++;\n }\n }\n if(y <= 7 && x <= 7) {\n int ok = 1;\n for (auto &&p : B) if(!v[i+p]) ok = 0;\n if(ok){\n for (auto &&p : B) v[i+p]--;\n if(f(i,cnt-1, f)){\n printf(\"%d %d 2\\n\", x+1, y+1);\n return 1;\n }\n for (auto &&p : B) v[i+p]++;\n }\n }\n if(y <= 7 && 1 <= x && x <= 8) {\n int ok = 1;\n for (auto &&p : A) if(!v[i+p]) ok = 0;\n if(ok){\n for (auto &&p : A) v[i+p]--;\n if(f(i,cnt-1, f)){\n printf(\"%d %d 1\\n\", x, y+1);\n return 1;\n }\n for (auto &&p : A) v[i+p]++;\n }\n }\n\n\n }\n return 0;\n };\n dfs(0, x, dfs);\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 5590,
"memory_kb": 3228,
"score_of_the_acc": -0.7339,
"final_rank": 9
},
{
"submission_id": "aoj_0091_4255434",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<set>\n#include<map>\n//#include<bits/stdc++.h>\n#define for0(i, n) for(int i = 0; i < (n); i++)\n#define for1(i, n) for(int i = 1; i <= (n);i++)\n#define all(x) x.begin(),x.end()\nusing namespace std;\nint mp[15][15], sum, n;\nbool b1(int x, int y) {\n\tif (mp[x][y] < 1)return 0;\n\tif (mp[x - 1][y] < 1)return 0;\n\tif (mp[x + 1][y] < 1)return 0;\n\tif (mp[x][y - 1] < 1)return 0;\n\tif (mp[x][y + 1] < 1)return 0;\n\treturn 1;\n}\nbool b2(int x, int y) {\n\tif (!b1(x, y))return 0;\n\tif (mp[x - 1][y - 1] < 1)return 0;\n\tif (mp[x - 1][y + 1] < 1)return 0;\n\tif (mp[x + 1][y - 1] < 1)return 0;\n\tif (mp[x + 1][y + 1] < 1)return 0;\n\treturn 1;\n}\nbool b3(int x, int y) {\n\tif (!b2(x, y))return 0;\n\tif (x < 2 || x > 7 || y < 2 || y > 7)return 0;\n\tif (mp[x - 2][y] < 1)return 0;\n\tif (mp[x + 2][y] < 1)return 0;\n\tif (mp[x][y - 2] < 1)return 0;\n\tif (mp[x][y + 2] < 1)return 0;\n}\nvoid f1(int x, int y) {\n\tmp[x][y]--;\n\tmp[x - 1][y]--;\n\tmp[x + 1][y]--;\n\tmp[x][y - 1]--;\n\tmp[x][y + 1]--;\n\tsum -= 5;\n}\nvoid f1_(int x, int y) {\n\tmp[x][y]++;\n\tmp[x - 1][y]++;\n\tmp[x + 1][y]++;\n\tmp[x][y - 1]++;\n\tmp[x][y + 1]++;\n\tsum += 5;\n}\nvoid f2(int x, int y) {\n\tf1(x, y);\n\tmp[x - 1][y - 1]--;\n\tmp[x - 1][y + 1]--;\n\tmp[x + 1][y - 1]--;\n\tmp[x + 1][y + 1]--;\n\tsum -= 4;\n}\nvoid f2_(int x, int y) {\n\tf1_(x, y);\n\tmp[x - 1][y - 1]++;\n\tmp[x - 1][y + 1]++;\n\tmp[x + 1][y - 1]++;\n\tmp[x + 1][y + 1]++;\n\tsum += 4;\n}\nvoid f3(int x, int y) {\n\tf2(x, y);\n\tmp[x - 2][y]--;\n\tmp[x + 2][y]--;\n\tmp[x][y - 2]--;\n\tmp[x][y + 2]--;\n\tsum -= 4;\n}\nvoid f3_(int x, int y) {\n\tf2_(x, y);\n\tmp[x - 2][y]++;\n\tmp[x + 2][y]++;\n\tmp[x][y - 2]++;\n\tmp[x][y + 2]++;\n\tsum += 4;\n}\nbool f(int i, int j) {\n\tif (n == 0 && sum > 0)return 0;\n\tif (n > 0 && sum == 0)return 0;\n\tif (n == 0 && sum == 0)return 1;\n\t//cout << i << ' ' << j << ' ' << sum << endl;\n\tif (i >= 9)return 0;\n\tint in = i, jn = j + 1;\n\tif (jn == 9) { in++; jn = 1; }\n\tif (b3(i, j)) {\n\t\tf3(i, j); n--;\n\t\tif ((sum == 0 && n == 0) || f(i, j)) {\n\t\t\tcout << j << ' ' << i << ' ' << 3 << endl;\n\t\t\treturn 1;\n\t\t}\n\t\tf3_(i, j); n++;\n\t}\n\tif (b2(i, j)) {\n\t\tf2(i, j); n--;\n\t\tif ((sum == 0 && n == 0) || f(i, j)) {\n\t\t\tcout << j << ' ' << i << ' ' << 2 << endl;\n\t\t\treturn 1;\n\t\t}\n\t\tf2_(i, j); n++;\n\t}\n\tif (b1(i, j)) {\n\t\tif (b3(i, j + 1)) {\n\t\t\tf3(i, j + 1); n--;\n\t\t\tif ((sum == 0 && n == 0) || f(i, j)) {\n\t\t\t\tcout << j + 1 << ' ' << i << ' ' << 3 << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tf3_(i, j + 1); n++;\n\t\t}\n\t\tif (b3(i + 1, j)) {\n\t\t\tf3(i + 1, j); n--;\n\t\t\tif ((sum == 0 && n == 0) || f(i, j)) {\n\t\t\t\tcout << j << ' ' << i + 1 << ' ' << 3 << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tf3_(i + 1, j); n++;\n\t\t}\n\t\tf1(i, j); n--;\n\t\tif ((sum == 0 && n == 0) || f(i, j)) {\n\t\t\tcout << j << ' ' << i << ' ' << 1 << endl;\n\t\t\treturn 1;\n\t\t}\n\t\tf1_(i, j); n++;\n\t}\n\tif (f(in, jn))return 1;\n\treturn 0;\n}\nsigned main() {\n\tcin >> n;\n\tfor0(i, 10)for0(j, 10) { cin >> mp[i][j]; sum += mp[i][j]; }\n\tf(1, 1);\n}",
"accuracy": 1,
"time_ms": 6860,
"memory_kb": 3112,
"score_of_the_acc": -0.8934,
"final_rank": 10
},
{
"submission_id": "aoj_0091_3763638",
"code_snippet": "#include<iostream>\nusing namespace std;\nint N;\nint S[10][10];\nint A[5][2]={{1,0},{0,1},{-1,0},{0,-1},{0,0}};\nint B[9][2]={{1,0},{0,1},{-1,0},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1},{0,0}};\nint C[13][2]={{2,0},{0,-2},{-2,0},{0,2},{1,0},{0,1},{-1,0},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1},{0,0}};\nint cnt;\nbool dfs(int x,int y,int id,int t)\n{\n\tif(id==N)\n\t{\n\t\treturn cnt==0;\n\t}\n\tif(t==0)\n\t{\n\t\tint k;\n\t\tfor(k=0;k<5;k++)\n\t\t{\n\t\t\tint tx=x+A[k][0],ty=y+A[k][1];\n\t\t\tif(0<=tx&&tx<10&&0<=ty&&ty<10)\n\t\t\t{\n\t\t\t\tif(S[tx][ty]==0)break;\n\t\t\t\tS[tx][ty]--;\n\t\t\t\tcnt--;\n\t\t\t}\n\t\t}\n\t\tif(k==5)\n\t\t{\n\t\t\tif(dfs(x,y,id+1,t))\n\t\t\t{\n\t\t\t\tcout<<y<<\" \"<<x<<\" \"<<1<<endl;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tfor(;k--;)\n\t\t{\n\t\t\tint tx=x+A[k][0],ty=y+A[k][1];\n\t\t\tif(0<=tx&&tx<10&&0<=ty&&ty<10)S[tx][ty]++,cnt++;\n\t\t}\n\t\treturn dfs(x,y,id,t+1);\n\t}\n\telse if(t==1)\n\t{\n\t\tint k;\n\t\tfor(k=0;k<9;k++)\n\t\t{\n\t\t\tint tx=x+B[k][0],ty=y+B[k][1];\n\t\t\tif(0<=tx&&tx<10&&0<=ty&&ty<10)\n\t\t\t{\n\t\t\t\tif(S[tx][ty]==0)break;\n\t\t\t\tS[tx][ty]--;\n\t\t\t\tcnt--;\n\t\t\t}\n\t\t}\n\t\tif(k==9)\n\t\t{\n\t\t\tif(dfs(x,y,id+1,t))\n\t\t\t{\n\t\t\t\tcout<<y<<\" \"<<x<<\" \"<<2<<endl;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tfor(;k--;)\n\t\t{\n\t\t\tint tx=x+B[k][0],ty=y+B[k][1];\n\t\t\tif(0<=tx&&tx<10&&0<=ty&&ty<10)S[tx][ty]++,cnt++;\n\t\t}\n\t\treturn dfs(x,y,id,t+1);\n\t}\n\telse if(t==2)\n\t{\n\t\tint k;\n\t\tfor(k=0;k<13;k++)\n\t\t{\n\t\t\tint tx=x+C[k][0],ty=y+C[k][1];\n\t\t\tif(0<=tx&&tx<10&&0<=ty&&ty<10)\n\t\t\t{\n\t\t\t\tif(S[tx][ty]==0)break;\n\t\t\t\tS[tx][ty]--;\n\t\t\t\tcnt--;\n\t\t\t}\n\t\t}\n\t\tif(k==13)\n\t\t{\n\t\t\tif(dfs(x,y,id+1,t))\n\t\t\t{\n\t\t\t\tcout<<y<<\" \"<<x<<\" \"<<3<<endl;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tfor(;k--;)\n\t\t{\n\t\t\tint tx=x+C[k][0],ty=y+C[k][1];\n\t\t\tif(0<=tx&&tx<10&&0<=ty&&ty<10)S[tx][ty]++,cnt++;\n\t\t}\n\t\tif(x>=2)\n\t\t{\n\t\t\tif(S[x-2][y]>0)return false;\n\t\t}\n\t\treturn dfs(y==9?x+1:x,y==9?0:y+1,id,0);\n\t}\n}\nmain()\n{\n\tcin>>N;\n\tfor(int i=0;i<10;i++)for(int j=0;j<10;j++)\n\t{\n\t\tcin>>S[i][j];\n\t\tcnt+=S[i][j];\n\t}\n\tdfs(0,0,0,0);\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3116,
"score_of_the_acc": -0.0171,
"final_rank": 1
},
{
"submission_id": "aoj_0091_3424862",
"code_snippet": "#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <cmath>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e9 + 7;\n\nint n, F[100], A[100];\nint px[15], py[15];\n\nbool func(int pos, int cnt, int num){\n\tif(cnt > n){\n\t\treturn false;\n\t}\n\tif(pos == 100){\n\t\treturn cnt == n;\n\t}\n\tif(A[pos] < 0){\n\t\treturn false;\n\t}\n\tif(A[pos] == 0){\n\t\treturn func(pos + 1, cnt, num);\n\t}\n\tint x = pos % 10, y = pos / 10;\n\tif(num % 3 == 0){\n\t\tif(x == 0 || x == 9 || y >= 8){\n\t\t\treturn false;\n\t\t}\n\t\tA[y * 10 + x] -= 1;\n\t\tA[(y + 1) * 10 + x - 1] -= 1;\n\t\tA[(y + 1) * 10 + x] -= 1;\n\t\tA[(y + 1) * 10 + x + 1] -= 1;\n\t\tA[(y + 2) * 10 + x] -= 1;\n\t\tpx[cnt] = x;\n\t\tpy[cnt] = y + 1;\n\t}else if(num % 3 == 1){\n\t\tif(x >= 8 || y >= 8){\n\t\t\treturn false;\n\t\t}\n\t\tA[y * 10 + x] -= 1;\n\t\tA[y * 10 + x + 1] -= 1;\n\t\tA[y * 10 + x + 2] -= 1;\n\t\tA[(y + 1) * 10 + x] -= 1;\n\t\tA[(y + 1) * 10 + x + 1] -= 1;\n\t\tA[(y + 1) * 10 + x + 2] -= 1;\n\t\tA[(y + 2) * 10 + x] -= 1;\n\t\tA[(y + 2) * 10 + x + 1] -= 1;\n\t\tA[(y + 2) * 10 + x + 2] -= 1;\n\t\tpx[cnt] = x + 1;\n\t\tpy[cnt] = y + 1;\n\t}else{\n\t\tif(x <= 1 || x >= 8 || y >= 6){\n\t\t\treturn false;\n\t\t}\n\t\tA[y * 10 + x] -= 1;\n\t\tA[(y + 1) * 10 + x - 1] -= 1;\n\t\tA[(y + 1) * 10 + x] -= 1;\n\t\tA[(y + 1) * 10 + x + 1] -= 1;\n\t\tA[(y + 2) * 10 + x - 2] -= 1;\n\t\tA[(y + 2) * 10 + x - 1] -= 1;\n\t\tA[(y + 2) * 10 + x] -= 1;\n\t\tA[(y + 2) * 10 + x + 1] -= 1;\n\t\tA[(y + 2) * 10 + x + 2] -= 1;\n\t\tA[(y + 3) * 10 + x - 1] -= 1;\n\t\tA[(y + 3) * 10 + x] -= 1;\n\t\tA[(y + 3) * 10 + x + 1] -= 1;\n\t\tA[(y + 4) * 10 + x] -= 1;\n\t\tpx[cnt] = x;\n\t\tpy[cnt] = y + 2;\n\t}\n\treturn func(pos, cnt + 1, num / 3);\n}\n\nint main(){\n\tcin >> n;\n\tfor(int i = 0; i < 100; i++){\n\t\tcin >> F[i];\n\t}\n\tint lim = 1;\n\tfor(int i = 0; i < n; i++){\n\t\tlim *= 3;\n\t}\n\tint ans = 0;\n\tfor(int i = 0; i < lim; i++){\n\t\tcopy(F, F + 100, A);\n\t\tif(func(0, 0, i)){\n\t\t\tans = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(int i = 0; i < n; i++){\n\t\tcout << px[i] << \" \" << py[i] << \" \" << ans % 3 + 1 << endl;\n\t\tans /= 3;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3108,
"score_of_the_acc": -0.0181,
"final_rank": 2
},
{
"submission_id": "aoj_0091_2918079",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\nusing namespace std;\n\nstruct aa{\n\tint x;\n\tint y;\n\tint t;\n\taa(int a,int b,int c){\n\t\tx=a;\n\t\ty=b;\n\t\tt=c;\n\t}\n};\n\nint inks[3][5][5]={\n\t{\n\t\t{0,0,0,0,0},\n\t\t{0,0,1,0,0},\n\t\t{0,1,1,1,0},\n\t\t{0,0,1,0,0},\n\t\t{0,0,0,0,0},\n\t},\n\t{\n\t\t{0,0,0,0,0},\n\t\t{0,1,1,1,0},\n\t\t{0,1,1,1,0},\n\t\t{0,1,1,1,0},\n\t\t{0,0,0,0,0},\n\t},\n\t{\n\t\t{0,0,1,0,0},\n\t\t{0,1,1,1,0},\n\t\t{1,1,1,1,1},\n\t\t{0,1,1,1,0},\n\t\t{0,0,1,0,0},\n\t},\n};\n\nbool ok(const vector<vector<int>>&v,int ink_x,int ink_y,int ink_id){\n\tfor(int dy=0;dy<5;++dy){\n\t\tfor(int dx=0;dx<5;++dx){\n\t\t\tif(inks[ink_id][dy][dx]){\n\t\t\t\tint ax=ink_x-2+dx;\n\t\t\t\tint ay=ink_y-2+dy;\n\n\t\t\t\tif(ax<0||ax>=10||ay<0||ay>=10)return false;\n\t\t\t\tif(v[ay][ax]<=0)return false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nvector<aa>solve(int now_x,int now_y,int rest,vector<vector<int>>&v){\n\tif(rest==0){\n\t\tbool ok=true;\n\t\tfor(int i=0;i<10;++i){\n\t\t\tfor(int j=0;j<10;++j){\n\t\t\t\tif(v[i][j])ok=false;\n\t\t\t}\n\t\t}\n\t\taa k=aa(-1,-1,-1);\n\t\tif(ok)return vector<aa>();\n\t\telse return vector<aa>(1,aa(-1,-1,-1));\n\t}\n\tif(now_y==10){\n\t\treturn vector<aa>(1,aa(-1,-1,-1));\n\t}\n\tif(now_y>=3&&now_x==0){\n\t\tfor(int y=0;y<now_y-2;++y){\n\t\t\tfor(int x=0;x<10;++x){\n\t\t\t\tif(v[y][x])return vector<aa>(1,aa(-1,-1,-1));\n\t\t\t}\n\t\t}\n\t}\n\t\n\tfor(int ink_id=0;ink_id<=2;++ink_id){\n\t\tif(ok(v,now_x,now_y,ink_id)){\n\t\t\tfor(int dy=0;dy<5;++dy){\n\t\t\t\tfor(int dx=0;dx<5;++dx){\n\t\t\t\t\tif(inks[ink_id][dy][dx]){\n\t\t\t\t\t\tint ax=now_x-2+dx;\n\t\t\t\t\t\tint ay=now_y-2+dy;\n\n\t\t\t\t\t\tif(ax<0||ax>=10||ay<0||ay>=10)assert(false);\n\t\t\t\t\t\tif(v[ay][ax]<=0)assert(false);\n\n\t\t\t\t\t\tv[ay][ax]--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tvector<aa>aas=solve(now_x,now_y,rest-1,v);\n\t\t\tfor(int dy=0;dy<5;++dy){\n\t\t\t\tfor(int dx=0;dx<5;++dx){\n\t\t\t\t\tif(inks[ink_id][dy][dx]){\n\t\t\t\t\t\tint ax=now_x-2+dx;\n\t\t\t\t\t\tint ay=now_y-2+dy;\n\t\t\t\t\t\tv[ay][ax]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(aas.size()==1&&aas[0].x==-1)continue;\n\t\t\telse{\n\t\t\t\taas.push_back(aa(now_x,now_y,ink_id));\n\t\t\t\treturn aas;\n\t\t\t}\n\t\t}\n\t}\n\tint next_x=now_x+1;\n\tint next_y=now_y;\n\tif(next_x==10){\n\t\tnext_x=0;\n\t\tnext_y=next_y+1;\n\t}\n\treturn solve(next_x,next_y,rest,v);\n}\n\nint main() { \n\tint N;cin>>N;\n\tvector<vector<int>>v(10,vector<int>(10));\n\tfor(int i=0;i<10;++i){\n\t\tfor(int j=0;j<10;++j){\n\t\t\tcin>>v[i][j];\n\t\t}\n\t}\n\tauto p=solve(0,0,N,v);\n\tfor(int i=0;i<p.size();++i){\n\t\tcout<<p[i].x<<\" \"<<p[i].y<<\" \"<<p[i].t+1<<endl;\n\t}\n\t//cout<<\"0\"<<endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 1770,
"memory_kb": 3148,
"score_of_the_acc": -0.2395,
"final_rank": 6
},
{
"submission_id": "aoj_0091_2719918",
"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\nint N,ans[10][10];\nint diff_row_1[5] = {-1,0,0,0,1},diff_col_1[5] = {0,-1,0,1,0};\nint diff_row_2[9] = {-1,-1,-1,0,0,0,1,1,1},diff_col_2[9] = {-1,0,1,-1,0,1,-1,0,1};\nint diff_row_3[13] = {-2,-1,-1,-1,0,0,0,0,0,1,1,1,2},diff_col_3[13] = {0,-1,0,1,-2,-1,0,1,2,-1,0,1,0};\nbool Found = false;\n\nstruct Info{\n\tvoid set(int arg_x,int arg_y,int arg_size){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tsize = arg_size;\n\t}\n\tint x,y,size;\n};\n\nstruct Data{\n\tint table[10][10];\n\tInfo info[13];\n\tint count;\n};\n\nInfo result[13];\n\nvoid recursive(int base_row,int base_col,Data data){\n\n\tif(Found == true)return;\n\n\tbool FLG;\n\n\tif(data.count == N){\n\n\t\tFLG = true;\n\n\t\tfor(int row = 0; row < 10; row++){\n\t\t\tfor(int col = 0; col < 10; col++){\n\t\t\t\tif(data.table[row][col] != ans[row][col]){\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)break;\n\t\t}\n\n\t\tif(FLG){\n\n\t\t\tfor(int i = 0; i < N; i++){\n\t\t\t\tresult[i].set(data.info[i].x,data.info[i].y,data.info[i].size);\n\t\t\t}\n\t\t\tFound = true;\n\t\t}\n\t\treturn;\n\t}\n\n\tfor(int row = 0; row <= base_row-3; row++){\n\t\tfor(int col = 0; col < 10; col++){\n\t\t\tif(data.table[row][col] != ans[row][col])return;\n\t\t}\n\t}\n\n\tif(base_row >= 2){\n\t\tfor(int col = 0; col < base_col; col++){\n\t\t\tif(data.table[base_row-2][col] != ans[base_row-2][col])return;\n\t\t}\n\t}\n\n\n\tbool size_1 = true,size_2 = true,size_3 = true;\n\n\t//size_1\n\tfor(int i = 0; i < 5; i++){\n\t\tif(data.table[base_row+diff_row_1[i]][base_col+diff_col_1[i]] >= ans[base_row+diff_row_1[i]][base_col+diff_col_1[i]]){\n\t\t\tsize_1 = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t//size_2\n\tfor(int i = 0; i < 9; i++){\n\t\tif(data.table[base_row+diff_row_2[i]][base_col+diff_col_2[i]] >= ans[base_row+diff_row_2[i]][base_col+diff_col_2[i]]){\n\t\t\tsize_2 = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t//size_3\n\tfor(int i = 0; i < 13; i++){\n\t\tif(data.table[base_row+diff_row_3[i]][base_col+diff_col_3[i]] >= ans[base_row+diff_row_3[i]][base_col+diff_col_3[i]]){\n\t\t\tsize_3 = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif(base_col == 9){\n\n\t\tif(base_row == 9)return;\n\t\trecursive(base_row+1,0,data);\n\t}else{\n\t\trecursive(base_row,base_col+1,data);\n\t}\n\n\tif(size_1){\n\n\t\tData next;\n\t\tfor(int i = 0; i < 10; i++){\n\t\t\tfor(int k = 0; k < 10; k++)next.table[i][k] = data.table[i][k];\n\t\t}\n\t\t//垂らす\n\t\tfor(int i = 0; i < 5; i++){\n\t\t\tnext.table[base_row+diff_row_1[i]][base_col+diff_col_1[i]]++;\n\t\t}\n\n\t\tfor(int i = 0; i < data.count;i++){\n\t\t\tnext.info[i].set(data.info[i].x,data.info[i].y,data.info[i].size);\n\t\t}\n\t\tnext.info[data.count].set(base_col,base_row,1);\n\t\tnext.count = data.count+1;\n\n\t\trecursive(base_row,base_col,next);\n\t}\n\n\tif(size_2){\n\n\t\tData next;\n\t\tfor(int i = 0; i < 10; i++){\n\t\t\tfor(int k = 0; k < 10; k++)next.table[i][k] = data.table[i][k];\n\t\t}\n\t\t//垂らす\n\t\tfor(int i = 0; i < 9; i++){\n\t\t\tnext.table[base_row+diff_row_2[i]][base_col+diff_col_2[i]]++;\n\t\t}\n\n\t\tfor(int i = 0; i < data.count;i++){\n\t\t\tnext.info[i].set(data.info[i].x,data.info[i].y,data.info[i].size);\n\t\t}\n\t\tnext.info[data.count].set(base_col,base_row,2);\n\t\tnext.count = data.count+1;\n\n\t\trecursive(base_row,base_col,next);\n\t}\n\n\tif(size_3){\n\t\tData next;\n\t\tfor(int i = 0; i < 10; i++){\n\t\t\tfor(int k = 0; k < 10; k++)next.table[i][k] = data.table[i][k];\n\t\t}\n\t\t//垂らす\n\t\tfor(int i = 0; i < 13; i++){\n\t\t\tnext.table[base_row+diff_row_3[i]][base_col+diff_col_3[i]]++;\n\t\t}\n\n\t\tfor(int i = 0; i < data.count;i++){\n\t\t\tnext.info[i].set(data.info[i].x,data.info[i].y,data.info[i].size);\n\t\t}\n\t\tnext.info[data.count].set(base_col,base_row,3);\n\t\tnext.count = data.count+1;\n\n\t\trecursive(base_row,base_col,next);\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tData first;\n\tfirst.count = 0;\n\n\tfor(int i = 0; i < 10; i++){\n\t\tfor(int k = 0; k < 10; k++){\n\t\t\tscanf(\"%d\",&ans[i][k]);\n\t\t\tfirst.table[i][k] = 0;\n\t\t}\n\t}\n\n\trecursive(1,1,first);\n\n\tfor(int i = 0; i < N; i++){\n\t\tprintf(\"%d %d %d\\n\",result[i].x,result[i].y,result[i].size);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3320,
"score_of_the_acc": -0.0214,
"final_rank": 4
},
{
"submission_id": "aoj_0091_2542624",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1e9+1)\n\nvector<pii> ansa, ansb, ansc;\n\nint cc = 0;\n\nvoid dfs(int y, int x, vector<vector<int>> &v, vector<pii> &a, vector<pii> &b, vector<pii> &c, int less ){\n cc++;\n// if( ansa.size() || ansb.size() || ansc.size() )return ;\n if(less <= 0){\n for(int i=y;i<10;i++){\n rep(j,10){\n if(v[i][j]==1)return ;\n }\n }\n ansa = a;\n ansb = b;\n ansc = c;\n \n return ;\n }\n rep(i,10){\n rep(j,10){\n if( v[i][j]==1 ){\n if( i+2 >= 10 )continue;\n if( j==0 || v[i+1][j-1]==0 ){\n if(j+2 >= 10 )continue;\n bool ng = false;\n rep(k,3){\n rep(l,3){\n v[i+k][j+l] --;\n if( v[i+k][j+l]<0 )ng = true;\n }\n }\n a.push_back(pii(i+1,j+1));\n if( !ng ) dfs(i, j, v, a, b, c, less-1);\n a.pop_back();\n rep(k,3){\n rep(l,3){\n v[i+k][j+l] ++;\n }\n }\n }\n else{\n if( i+2 >= 10 || j+1 >= 10 )continue;\n \n int dx1[] = {0, 0, 0, -1, 1};\n int dy1[] = {0, 1, 2, 1, 1};\n \n bool ng = false;\n rep(k,5){\n int ddy = i+dy1[k];\n int ddx = j+dx1[k];\n v[ddy][ddx]--;\n if( v[ddy][ddx] < 0 )ng = true;\n }\n b.push_back(pii(i+1,j));\n if( !ng ) dfs(i, j, v, a, b, c, less-1);\n b.pop_back();\n rep(k,5){\n int ddy = i+dy1[k];\n int ddx = j+dx1[k];\n v[ddy][ddx]++;\n }\n \n if(j+2>=10 || i+4 >= 10)continue;\n \n int dx2[] = {0, 0, -2, 2};\n int dy2[] = {0, 4, 2, 2};\n ng = false;\n rep(k,4){\n int ddy = i+dy2[k];\n int ddx = j+dx2[k];\n v[ddy][ddx]--;\n if( v[ddy][ddx] < 0 )ng = true;\n }\n rep(k,3){\n rep(l,3){\n v[i+k+1][j+l-1]--;\n if( v[i+k+1][j+l-1]<0 )ng = true;\n }\n }\n c.push_back(pii(i+2,j));\n if( !ng ) dfs(i, j, v, a, b, c, less-1);\n c.pop_back();\n rep(k,4){\n int ddy = i+dy2[k];\n int ddx = j+dx2[k];\n v[ddy][ddx]++;\n }\n rep(k,3){\n rep(l,3){\n v[i+k+1][j+l-1]++;\n }\n }\n }\n goto end;\n }\n }\n end:;\n }\n}\n\nint main(){\n int n;\n cin>>n;\n vector<vector<int>> v(10,vector<int>(10));\n \n rep(i,10)rep(j,10)cin>>v[i][j];\n \n vector<pii> a, b, c; //3*3, +, ++\n \n dfs(0, 0, v, a, b, c, n);\n \n rep(i,ansa.size()){\n cout<<ansa[i].second<<\" \"<<ansa[i].first<<\" \"<<2<<endl;\n }\n rep(i,ansb.size()){\n cout<<ansb[i].second<<\" \"<<ansb[i].first<<\" \"<<1<<endl;\n }\n rep(i,ansc.size()){\n cout<<ansc[i].second<<\" \"<<ansc[i].first<<\" \"<<3<<endl;\n }\n}",
"accuracy": 0.1111111111111111,
"time_ms": 300,
"memory_kb": 3104,
"score_of_the_acc": -0.0488,
"final_rank": 19
},
{
"submission_id": "aoj_0091_2329609",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <random>\n#include <cstdlib>\n#include <cmath>\n#include <sstream>\nusing namespace std;\n\nint small[][5]{\n\t0,0,1,0,0,\n\t0,1,1,1,0,\n\t0,0,1,0,0,\n\t0,0,0,0,0,\n\t0,0,0,0,0\n};\npair<int, int> smallCenter = { 0,1 };\n\nint middle[][5]{\n\t0,0,1,1,1,\n\t0,0,1,1,1,\n\t0,0,1,1,1,\n\t0,0,0,0,0,\n\t0,0,0,0,0\n};\npair<int, int> middleCenter = { 1,1 };\n\nint big[][5]{\n\t0,0,1,0,0,\n\t0,1,1,1,0,\n\t1,1,1,1,1,\n\t0,1,1,1,0,\n\t0,0,1,0,0\n};\npair<int, int> bigCenter = { 0,2 };\n\npair<pair<int, int>, int> point[12];\nint table[10][10];\n\nbool clearCheck() {\n\tfor (int i = 0; i < 10; i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tif (table[i][j] != 0) return false;\n\t\t}\n\t}\n\treturn true;\n}\nbool removeCheck(int y, int x, int drop[][5]) {\n\tfor (int i = 0; i < 5; i++) {\n\t\tfor (int j = 0; j < 5; j++) {\n\t\t\tif (!drop[i][j]) continue;\n\t\t\tif (x + j - 2 < 0 || x + j - 2 >= 10) return false;\n\t\t\tif (y + i < 0 || y + i >= 10) return false;\n\t\t\tif (!table[y + i][x + j - 2]) return false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid remove(int y, int x, int drop[][5]) {\n\tfor (int i = 0; i < 5; i++) {\n\t\tfor (int j = 0; j < 5; j++) {\n\t\t\ttable[y + i][x + j - 2] -= drop[i][j];\n\t\t}\n\t}\n}\n\nvoid add(int y, int x, int drop[][5]) {\n\tfor (int i = 0; i < 5; i++) {\n\t\tfor (int j = 0; j < 5; j++) {\n\t\t\ttable[y + i][x + j - 2] += drop[i][j];\n\t\t}\n\t}\n}\n\nbool rec(int i, int j, int c) {\n\tif (c < 0) return clearCheck();\n\twhile (1) {\n\t\tj++;\n\t\ti += j / 10;\n\t\tj = j % 10;\n\t\tif (i == 10) break;\n\n\t\tif (table[i][j]) {\n\t\t\tif (removeCheck(i, j, small)) {\n\t\t\t\tpoint[c] = make_pair(make_pair(i + smallCenter.second, j + smallCenter.first), 1);\n\t\t\t\tremove(i, j, small);\n\t\t\t\tif (rec(i, j, c - 1)) return true;\n\t\t\t\tadd(i, j, small);\n\t\t\t}\n\n\t\t\tif (removeCheck(i, j, middle)) {\n\t\t\t\tpoint[c] = make_pair(make_pair(i + middleCenter.second, j + middleCenter.first), 2);\n\t\t\t\tremove(i, j, middle);\n\t\t\t\tif (rec(i, j, c - 1)) return true;\n\t\t\t\tadd(i, j, middle);\n\t\t\t}\n\n\t\t\tif (removeCheck(i, j, big)) {\n\t\t\t\tpoint[c] = make_pair(make_pair(i + bigCenter.second, j + bigCenter.first), 3);\n\t\t\t\tremove(i, j, big);\n\t\t\t\tif (rec(i, j, c - 1)) return true;\n\t\t\t\tadd(i, j, big);\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nvoid q91() {\n\tint n;\n\tfor (; cin >> n;) {\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tfor (int j = 0; j < 10; j++) {\n\t\t\t\tcin >> table[i][j];\n\t\t\t}\n\t\t}\n\t\trec(0, 0, n - 1);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout << point[i].first.second << \" \" << point[i].first.first << \" \" << point[i].second << endl;\n\t\t}\n\t}\n}\n\nint main() {\n\tq91();\n\treturn 0;\n}",
"accuracy": 0.1111111111111111,
"time_ms": 3590,
"memory_kb": 3088,
"score_of_the_acc": -0.4717,
"final_rank": 20
},
{
"submission_id": "aoj_0091_2138199",
"code_snippet": "#include <bits/stdc++.h>\n\n\n#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)\nusing namespace std;\n\n\nint main()\n{\n\tint t;\n\tcin >>t;\n\tarray<array<int,10>, 10> ba;\n\trep(i,10) rep(j,10) cin >>ba[i][j];\n\t\n\tvector<vector<array<int, 2>>> mdl={\n\t\t{{0,0},{1,0}, {1,-1}, {1,1},{2,0}},\n\t\t{{0,0},{1,1},{0,1},{0,2},{1,0},{1,2},{2,0},{2,1},{2,2}},\n\t\t{{0,0},{2,0},{1,-1},{1,0},{1,1},{2,-2},{2,-1},{2,1},{2,2},\n\t\t {3,-1},{3,0},{3,1},{4,0}}\n\t};\n\t\n\tint gk=0;\n\trep(i,10) rep(j,10) gk+=ba[i][j];\n\t\n\tvector<int> cnd;\n\trep(a,t+1) rep(b,t+1) rep(c,t+1){\n\t\tif(a+b+c==t && 5*a + 9*b + 13*c == gk){\n\t\t\n\t\t\tstring s = string(a, '0') + string(b, '1') + string(c, '2');\n\t\t\tdo {\n\t\t\t\tauto wa = ba;\n\t\t\t\tvector<int> ans;\n\t\t\t\tbool ok=1; \n\t\t\t\trep(i,t){\n\t\t\t\t\tif(!ok) break;\n\t\t\t\t\tint my,mx;\n\t\t\t\t\trep(y,10) rep(x,10) if(wa[y][x]>0){my=y; mx=x; y=100; break;}\n\t\t\t\t\tans.push_back(my*100+mx);\n\t\t\t\t\tint cr=s[i]-'0';\n\t\t\t\t\t\n\t\t\t\t\tfor(auto r: mdl[cr]) if(ok){\n\t\t\t\t\t\tint ny=r[0]+my, nx=r[1]+mx;\n\t\t\t\t\t\tif(ny<0 || ny>=10 || nx<0 || nx>=10){ ok=0; break;}\n\t\t\t\t\t\tif(wa[ny][nx] >0 ) wa[ny][nx]--;\n\t\t\t\t\t\telse if(wa[ny][nx] <1 ){ ok=0; break;}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbool ng=0;\n\t\t\t\trep(y,10) rep(x,10) if(wa[y][x] !=0) ng=1;\n\t\t\t\t//rep(y,10) rep(x,10) printf(\"%d%s\",wa[y][x],(x==9? \"\\n\":\" \"));\n\t\t\t\tif(!ng){\n\t\t\t\t\trep(i,t){\n\t\t\t\t\t\tprintf(\"%d %d %d\\n\", \n\t\t\t\t\t\t\tans[i]%100 + mdl[s[i]-'0'][1][1],\n\t\t\t\t\t\t\tans[i]/100 + mdl[s[i]-'0'][1][0],\n\t\t\t\t\t\t\ts[i]-'0'+1);\n\t\t\t\t\t}\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t} while ( next_permutation(s.begin(), s.end()) );\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3304,
"score_of_the_acc": -0.0183,
"final_rank": 3
},
{
"submission_id": "aoj_0091_2138192",
"code_snippet": "#include <bits/stdc++.h>\n\n\n#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)\nusing namespace std;\n\n\nint main()\n{\n\tint t;\n\tcin >>t;\n\tarray<array<int,10>, 10> ba;\n\trep(i,10) rep(j,10) cin >>ba[i][j];\n\t\n\tvector<vector<array<int, 2>>> mdl={\n\t\t{{0,0},{1,0}, {1,-1}, {1,1},{2,0}},\n\t\t{{0,0},{1,1},{0,1},{0,2},{1,0},{1,2},{2,0},{2,1},{2,2}},\n\t\t{{0,0},{2,0},{1,-1},{1,0},{1,1},{2,-2},{2,-1},{2,1},{2,2},\n\t\t {3,-1},{3,0},{3,1},{4,0}}\n\t};\n\t\n\tint gk=0;\n\trep(i,10) rep(j,10) gk+=ba[i][j];\n\t\n\tvector<int> cnd;\n\trep(a,t+1) rep(b,t+1) rep(c,t+1){\n\t\tif(a+b+c==t && 5*a + 9*b + 13*c == gk){\n\t\t\n\t\t\tstring s = string(a, '0') + string(b, '1') + string(c, '2');\n\t\t\tdo {\n\t\t\t\tauto wa = ba;\n\t\t\t\tvector<int> ans;\n\t\t\t\trep(i,t){\n\t\t\t\t\tint my,mx;\n\t\t\t\t\trep(y,10) rep(x,10) if(wa[y][x]>0){my=y; mx=x; y=100; break;}\n\t\t\t\t\tans.push_back(my*100+mx);\n\t\t\t\t\tbool ok=1; \n\t\t\t\t\tint cr=s[i]-'0';\n\t\t\t\t\t\n\t\t\t\t\tfor(auto r: mdl[cr]) if(ok){\n\t\t\t\t\t\tint ny=r[0]+my, nx=r[1]+mx;\n\t\t\t\t\t\tif(ny<0 || ny>=10 || nx<0 || nx>=10){ ok=0; break;}\n\t\t\t\t\t\tif(wa[ny][nx] >0 ) wa[ny][nx]--;\n\t\t\t\t\t\telse if(wa[ny][nx] <1 ){ ok=0; break;}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbool ng=0;\n\t\t\t\trep(y,10) rep(x,10) if(wa[y][x] !=0) ng=1;\n\t\t\t\t//rep(y,10) rep(x,10) printf(\"%d%s\",wa[y][x],(x==9? \"\\n\":\" \"));\n\t\t\t\tif(!ng){\n\t\t\t\t\trep(i,t){\n\t\t\t\t\t\tprintf(\"%d %d %d\\n\", \n\t\t\t\t\t\t\tans[i]%100 + mdl[s[i]-'0'][1][1],\n\t\t\t\t\t\t\tans[i]/100 + mdl[s[i]-'0'][1][0],\n\t\t\t\t\t\t\ts[i]-'0'+1);\n\t\t\t\t\t}\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t} while ( next_permutation(s.begin(), s.end()) );\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3368,
"score_of_the_acc": -0.023,
"final_rank": 5
},
{
"submission_id": "aoj_0091_2094335",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <stack>\n#include <utility>\nusing namespace std;\n\ntypedef pair<int, int> Pair;\ntypedef pair<int, Pair> Data;\n\nint n;\nint total;\nint field[10][10];\nstack<Data> ans;\n\nint ex[] = {9, 0, 0, 9};\nint ey[] = {0, 9, 0, 9};\nint fx[] = {8, 1, 1, 8};\nint fy[] = {1, 8, 1, 8};\nint dx1[] = {-1, 0, 0, 0, 1};\nint dy1[] = {0, -1, 0, 1, 0};\nint dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};\nint dy2[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};\nint dx3[] = {-2, -1, -1, -1, 0, 0, 0, 0, 0, 1, 1, 1, 2};\nint dy3[] = {0, -1, 0, 1, -2, -1, 0, 1, 2, -1, 0, 1, 0};\nint used[10][10];\n\nbool CheckPlace(int y, int x, int type) {\n if (type == 1) {\n for (int i=0; i<5; i++) {\n int newy = y + dy1[i];\n int newx = x + dx1[i];\n if (field[newy][newx] == 0) return false;\n }\n } else if (type == 2) {\n for (int i=0; i<9; i++) {\n int newy = y + dy2[i];\n int newx = x + dx2[i];\n if (field[newy][newx] == 0) return false;\n }\n } else if (type == 3) {\n for (int i=0; i<13; i++) {\n int newy = y + dy3[i];\n int newx = x + dx3[i];\n if (field[newy][newx] == 0) return false;\n }\n }\n\n return true;\n}\n\nvoid AddPlace(int (&field)[10][10], int y, int x, int type, int t) {\n if (type == 1) {\n for (int i=0; i<5; i++) {\n int newy = y + dy1[i];\n int newx = x + dx1[i];\n field[newy][newx] += t;\n }\n } else if (type == 2) {\n for (int i=0; i<9; i++) {\n int newy = y + dy2[i];\n int newx = x + dx2[i];\n field[newy][newx] += t;\n }\n } else if (type == 3) {\n for (int i=0; i<13; i++) {\n int newy = y + dy3[i];\n int newx = x + dx3[i];\n field[newy][newx] += t;\n }\n }\n}\n\nbool CheckImpossible() {\n for (int i=0; i<10; i++) {\n for (int j=0; j<10; j++) {\n used[i][j] = false;\n }\n }\n\n for (int i=1; i<9; i++) {\n for (int j=1; j<9; j++) {\n if (i > 1 && i < 8 && j < 8 && j > 1 && CheckPlace(i, j, 3)) {\n AddPlace(used, i, j, 3, 1);\n } else if (CheckPlace(i, j, 2)) {\n AddPlace(used, i, j, 2, 1);\n } else if (CheckPlace(i, j, 1)) {\n AddPlace(used, i, j, 1, 1);\n }\n }\n }\n\n for (int i=0; i<10; i++) {\n for (int j=0; j<10; j++) {\n if (field[i][j] && !used[i][j]) return true;\n }\n }\n\n return false;\n}\nvoid check(int x, int y, int z) {\n if (CheckImpossible()) return;\n\n if (y > 0) {\n for (int i=1; i<9; i++) {\n for (int j=1; j<9; j++) {\n if (CheckPlace(i, j, 2)) {\n AddPlace(field, i, j, 2, -1);\n ans.push(Data(2, Pair(i, j)));\n check(x, y-1, z);\n ans.pop();\n AddPlace(field, i, j, 2, 1);\n }\n }\n }\n\n return;\n }\n\n if (z > 0) {\n for (int i=2; i<8; i++) {\n for (int j=2; j<8; j++) {\n if (CheckPlace(i, j, 3)) {\n AddPlace(field, i, j, 3, -1);\n ans.push(Data(3, Pair(i, j)));\n check(x, y, z-1);\n ans.pop();\n AddPlace(field, i, j, 3, 1);\n }\n }\n }\n\n return;\n }\n\n if (x > 0) {\n for (int i=1; i<9; i++) {\n for (int j=1; j<9; j++) {\n if (CheckPlace(i, j, 1)) {\n AddPlace(field, i, j, 1, -1);\n ans.push(Data(1, Pair(i, j)));\n check(x-1, y, z);\n ans.pop();\n AddPlace(field, i, j, 1, 1);\n }\n }\n }\n\n return;\n }\n\n while (!ans.empty()) {\n Data d = ans.top(); ans.pop();\n int level = d.first;\n Pair p = d.second;\n printf(\"%d %d %d\\n\", p.second, p.first, level);\n }\n\n exit(0);\n}\n\nint main() {\n scanf(\"%d\", &n);\n for (int i=0; i<10; i++) {\n for (int j=0; j<10; j++) {\n scanf(\"%d\", &field[i][j]);\n total += field[i][j];\n }\n }\n\n for (int i=0; i<4; i++) {\n int y = ey[i];\n int x = ex[i];\n\n if (field[y][x]) {\n total -= field[y][x]*9;\n n -= field[y][x];\n for (int j=0; j<field[y][x]; j++) {\n ans.push(Data(2, Pair(fy[i], fx[i])));\n }\n AddPlace(field, fy[i], fx[i], 2, -field[y][x]);\n }\n }\n\n int x = 0;\n int y = (13*n-total)/4;\n while (y >= 0) {\n int z = n-(x+y);\n if (z < 0) {\n y -= 2;\n x += 1;\n continue;\n }\n\n check(x, y, z);\n y -= 2;\n x += 1;\n }\n\n while (!ans.empty()) {\n Data d = ans.top(); ans.pop();\n int level = d.first;\n Pair p = d.second;\n printf(\"%d %d %d\\n\", p.second, p.first, level);\n }\n}",
"accuracy": 1,
"time_ms": 4860,
"memory_kb": 2764,
"score_of_the_acc": -0.6242,
"final_rank": 8
},
{
"submission_id": "aoj_0091_1993911",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<tuple>\n#include<cstdlib>\n#include<ctime>\n#include<algorithm>\nusing namespace std;\nvector<vector<char>>S; int n;\nbool dp[13][160]; int LIM2 = 0; int _size = 0; int CC = 0;\nvector<vector<char>> solve(vector<vector<char>>p, int x, int y, int r) {\n\tif (r == 1) { p[x][y]--; p[x + 1][y]--; p[x - 1][y]--; p[x][y - 1]--; p[x][y + 1]--; }\n\tif (r == 2) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; }\n\tif (r == 3) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; p[x + 2][y]--; p[x][y + 2]--; p[x - 2][y]--; p[x][y - 2]--; }\n\treturn p;\n}\nbool isgood(int p) {\n\tif (p % 4 == 1 && p >= 5)return true;\n\tif (p % 4 == 2 && p >= 10)return true;\n\tif (p % 4 == 3 && p >= 15)return true;\n\tif (p % 4 == 0 && p >= 20)return true;\n\treturn false;\n}\nbool hantei(vector<vector<char>>p) {\n\tfor (int i = 0; i < 10; i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tif (p[i][j] < 0)return false;\n\t\t}\n\t}\n\tbool OKs[10][10]; for (int i = 0; i < 100; i++)OKs[i / 10][i % 10] = false;\n\tfor (int i = 1; i < 9; i++) {\n\t\tfor (int j = 1; j < 9; j++) {\n\t\t\tif (p[i][j] == 0)continue; bool OK6 = false;\n\t\t\tif (p[i - 1][j] >= 1 && p[i + 1][j] >= 1 && p[i][j - 1] >= 1 && p[i][j + 1] >= 1) {\n\t\t\t\tOK6 = true; OKs[i][j] = true; OKs[i - 1][j] = true; OKs[i][j - 1] = true; OKs[i][j + 1] = true; OKs[i + 1][j] = true;\n\t\t\t}\n\t\t\tif (OK6 == false)continue;\n\t\t\tbool OK4 = true;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)if (p[i + k][j + l] == 0)OK4 = false;\n\t\t\tif (OK4 == false)continue;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)OKs[i + k][j + l] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i <= 9; i++) {\n\t\tfor (int j = 0; j <= 9; j++) {\n\t\t\tif (OKs[i][j] == false && p[i][j] >= 1)return false;\n\t\t}\n\t}\n\tqueue<pair<int, int>>Q3; bool OK5[10][10]; for (int i = 0; i < 100; i++)OK5[i / 10][i % 10] = false;\n\tif (rand() % 9 <= 1 && n == 12 && _size >= 1000)return false;\n\treturn true;\n}\nvector<tuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>>Vec;\nvoid zen_shori() {\n\tint JJ = 165; if (LIM2 == 2)JJ = 27061;\n\tfor (int i = 0; i < JJ; i++) {\n\t\ttuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>ZZ;\n\t\tVec.push_back(ZZ);\n\t}\n\tvector<vector<char>>ZERO; int LL = 0, RR = 0;\n\tvector<tuple<char, char, char>>ZERO3;\n\tfor (int i = 0; i < 10; i++) { vector<char>ZERO5(10, 0); ZERO.push_back(ZERO5); }\n\tVec[0] = make_tuple(ZERO, 0, ZERO3); RR++;\n\twhile (LL < RR && RR < JJ) {\n\t\tvector<vector<char>>a1 = get<0>(Vec[LL]); int a2 = get<1>(Vec[LL]);\n\t\tvector<tuple<char, char, char>>a3 = get<2>(Vec[LL]);\n\t\tLL++; if (a2 == LIM2)continue;\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tvector<vector<char>>a4 = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>a5 = a3; a5.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (RR < JJ) { Vec[RR] = make_tuple(a4, a2 + 1, a5); RR++; }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < Vec.size(); i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tfor (int k = 0; k < 10; k++) {\n\t\t\t\tget<0>(Vec[i])[j][k] *= -1;\n\t\t\t}\n\t\t}\n\t}\n\tsort(Vec.begin(), Vec.end());\n}\nint main() {\n\tsrand((unsigned)time(NULL));\n\tcin >> n; dp[0][0] = true;\n\tLIM2 = 2;\n\tfor (int i = 0; i < 12; i++) {\n\t\tfor (int j = 0; j < 160; j++) {\n\t\t\tif (dp[i][j] == false)continue;\n\t\t\tdp[i + 1][j + 5] = true; dp[i + 1][j + 9] = true; dp[i + 1][j + 13] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i < 10; i++) { vector<char>V(10, 0); S.push_back(V); }\n\tvector<vector<char>>START = S; int SUM = 0;\n\tfor (int i = 0; i < 10; i++)for (int j = 0; j < 10; j++) { int SS; cin >> SS; S[i][j] = SS; SUM += S[i][j]; }\n\tqueue<tuple<int, vector<tuple<char, char, char>>, int>> Q;\n\tvector<tuple<char, char, char>>ZERO;\n\tQ.push(make_tuple(0, ZERO, SUM));\n\tzen_shori(); CC = SUM;\n\n\twhile (!Q.empty()) {\n\t\tvector<vector<char>>a1 = S; int a2 = get<0>(Q.front());\n\t\tvector<tuple<char, char, char>>a3 = get<1>(Q.front()); int a4 = get<2>(Q.front()); Q.pop(); _size = Q.size();\n\t\tfor (int i = 0; i < a3.size(); i++) {\n\t\t\ta1 = solve(a1, get<0>(a3[i]), get<1>(a3[i]), get<2>(a3[i]));\n\t\t}\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tint rem1 = a4 - P[i], rem2 = n - (a2 + 1); bool OK = true;\n\t\t\tif (dp[rem2][rem1] == false)OK = false;\n\t\t\tif (OK == false)continue;\n\t\t\tint LIM = 0; if (a3.size() >= 1) LIM = get<0>(a3[a3.size() - 1]) * 100 + get<1>(a3[a3.size() - 1]) * 10 + get<2>(a3[a3.size() - 1]);\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tint DD = j * 100 + k * 10 + i;\n\t\t\t\t\tif (DD < LIM) continue;\n\t\t\t\t\tvector<vector<char>>G = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>H = a3;\n\t\t\t\t\tif (hantei(G) == false)continue;\n\t\t\t\t\tH.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (G == START && a2 + 1 == n) {\n\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoto E;\n\t\t\t\t\t}\n\t\t\t\t\tif (a2 + 1 >= n - LIM2) {\n\t\t\t\t\t\tint P = lower_bound(Vec.begin(), Vec.end(), make_tuple(G, 0, ZERO)) - Vec.begin();\n\t\t\t\t\t\tif (P < Vec.size() && get<0>(Vec[P]) == G) {\n\t\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tvector<tuple<char, char, char>>J = get<2>(Vec[P]);\n\t\t\t\t\t\t\tfor (int j = 0; j < J.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(J[j]) << ' ' << (int)get<0>(J[j]) << ' ' << (int)get<2>(J[j]) << endl;\n\t\t\t\t\t\t\t}\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\tQ.push(make_tuple(a2 + 1, H, a4 - P[i]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\nE:;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 7780,
"memory_kb": 32276,
"score_of_the_acc": -2,
"final_rank": 11
},
{
"submission_id": "aoj_0091_1993903",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<tuple>\n#include<cstdlib>\n#include<ctime>\n#include<algorithm>\nusing namespace std;\nvector<vector<char>>S; int n;\nbool dp[13][160]; int LIM2 = 0; int _size = 0; int CC = 0;\nvector<vector<char>> solve(vector<vector<char>>p, int x, int y, int r) {\n\tif (r == 1) { p[x][y]--; p[x + 1][y]--; p[x - 1][y]--; p[x][y - 1]--; p[x][y + 1]--; }\n\tif (r == 2) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; }\n\tif (r == 3) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; p[x + 2][y]--; p[x][y + 2]--; p[x - 2][y]--; p[x][y - 2]--; }\n\treturn p;\n}\nbool isgood(int p) {\n\tif (p % 4 == 1 && p >= 5)return true;\n\tif (p % 4 == 2 && p >= 10)return true;\n\tif (p % 4 == 3 && p >= 15)return true;\n\tif (p % 4 == 0 && p >= 20)return true;\n\treturn false;\n}\nbool hantei(vector<vector<char>>p) {\n\tfor (int i = 0; i < 10; i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tif (p[i][j] < 0)return false;\n\t\t}\n\t}\n\tbool OKs[10][10]; for (int i = 0; i < 100; i++)OKs[i / 10][i % 10] = false;\n\tfor (int i = 1; i < 9; i++) {\n\t\tfor (int j = 1; j < 9; j++) {\n\t\t\tif (p[i][j] == 0)continue; bool OK6 = false;\n\t\t\tif (p[i - 1][j] >= 1 && p[i + 1][j] >= 1 && p[i][j - 1] >= 1 && p[i][j + 1] >= 1) {\n\t\t\t\tOK6 = true; OKs[i][j] = true; OKs[i - 1][j] = true; OKs[i][j - 1] = true; OKs[i][j + 1] = true; OKs[i + 1][j] = true;\n\t\t\t}\n\t\t\tif (OK6 == false)continue;\n\t\t\tbool OK4 = true;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)if (p[i + k][j + l] == 0)OK4 = false;\n\t\t\tif (OK4 == false)continue;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)OKs[i + k][j + l] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i <= 9; i++) {\n\t\tfor (int j = 0; j <= 9; j++) {\n\t\t\tif (OKs[i][j] == false && p[i][j] >= 1)return false;\n\t\t}\n\t}\n\tqueue<pair<int, int>>Q3; bool OK5[10][10]; for (int i = 0; i < 100; i++)OK5[i / 10][i % 10] = false;\n\tif (rand() % 37 <= 7 && n == 12 && _size >= 1000)return false;\n\treturn true;\n}\nvector<tuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>>Vec;\nvoid zen_shori() {\n\tint JJ = 165; if (LIM2 == 2)JJ = 27061;\n\tfor (int i = 0; i < JJ; i++) {\n\t\ttuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>ZZ;\n\t\tVec.push_back(ZZ);\n\t}\n\tvector<vector<char>>ZERO; int LL = 0, RR = 0;\n\tvector<tuple<char, char, char>>ZERO3;\n\tfor (int i = 0; i < 10; i++) { vector<char>ZERO5(10, 0); ZERO.push_back(ZERO5); }\n\tVec[0] = make_tuple(ZERO, 0, ZERO3); RR++;\n\twhile (LL < RR && RR < JJ) {\n\t\tvector<vector<char>>a1 = get<0>(Vec[LL]); int a2 = get<1>(Vec[LL]);\n\t\tvector<tuple<char, char, char>>a3 = get<2>(Vec[LL]);\n\t\tLL++; if (a2 == LIM2)continue;\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tvector<vector<char>>a4 = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>a5 = a3; a5.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (RR < JJ) { Vec[RR] = make_tuple(a4, a2 + 1, a5); RR++; }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < Vec.size(); i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tfor (int k = 0; k < 10; k++) {\n\t\t\t\tget<0>(Vec[i])[j][k] *= -1;\n\t\t\t}\n\t\t}\n\t}\n\tsort(Vec.begin(), Vec.end());\n}\nint main() {\n\tsrand((unsigned)time(NULL));\n\tcin >> n; dp[0][0] = true;\n\tLIM2 = 2;\n\tfor (int i = 0; i < 12; i++) {\n\t\tfor (int j = 0; j < 160; j++) {\n\t\t\tif (dp[i][j] == false)continue;\n\t\t\tdp[i + 1][j + 5] = true; dp[i + 1][j + 9] = true; dp[i + 1][j + 13] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i < 10; i++) { vector<char>V(10, 0); S.push_back(V); }\n\tvector<vector<char>>START = S; int SUM = 0;\n\tfor (int i = 0; i < 10; i++)for (int j = 0; j < 10; j++) { int SS; cin >> SS; S[i][j] = SS; SUM += S[i][j]; }\n\tqueue<tuple<int, vector<tuple<char, char, char>>, int>> Q;\n\tvector<tuple<char, char, char>>ZERO;\n\tQ.push(make_tuple(0, ZERO, SUM));\n\tzen_shori(); CC = SUM;\n\n\twhile (!Q.empty()) {\n\t\tvector<vector<char>>a1 = S; int a2 = get<0>(Q.front());\n\t\tvector<tuple<char, char, char>>a3 = get<1>(Q.front()); int a4 = get<2>(Q.front()); Q.pop(); _size = Q.size();\n\t\tfor (int i = 0; i < a3.size(); i++) {\n\t\t\ta1 = solve(a1, get<0>(a3[i]), get<1>(a3[i]), get<2>(a3[i]));\n\t\t}\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tint rem1 = a4 - P[i], rem2 = n - (a2 + 1); bool OK = true;\n\t\t\tif (dp[rem2][rem1] == false)OK = false;\n\t\t\tif (OK == false)continue;\n\t\t\tint LIM = 0; if (a3.size() >= 1) LIM = get<0>(a3[a3.size() - 1]) * 100 + get<1>(a3[a3.size() - 1]) * 10 + get<2>(a3[a3.size() - 1]);\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tint DD = j * 100 + k * 10 + i;\n\t\t\t\t\tif (DD < LIM) continue;\n\t\t\t\t\tvector<vector<char>>G = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>H = a3;\n\t\t\t\t\tif (hantei(G) == false)continue;\n\t\t\t\t\tH.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (G == START && a2 + 1 == n) {\n\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoto E;\n\t\t\t\t\t}\n\t\t\t\t\tif (a2 + 1 >= n - LIM2) {\n\t\t\t\t\t\tint P = lower_bound(Vec.begin(), Vec.end(), make_tuple(G, 0, ZERO)) - Vec.begin();\n\t\t\t\t\t\tif (P < Vec.size() && get<0>(Vec[P]) == G) {\n\t\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tvector<tuple<char, char, char>>J = get<2>(Vec[P]);\n\t\t\t\t\t\t\tfor (int j = 0; j < J.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(J[j]) << ' ' << (int)get<0>(J[j]) << ' ' << (int)get<2>(J[j]) << endl;\n\t\t\t\t\t\t\t}\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\tQ.push(make_tuple(a2 + 1, H, a4 - P[i]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\nE:;\n\treturn 0;\n}",
"accuracy": 0.5,
"time_ms": 4310,
"memory_kb": 26252,
"score_of_the_acc": -1.3493,
"final_rank": 13
},
{
"submission_id": "aoj_0091_1993897",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<tuple>\n#include<cstdlib>\n#include<ctime>\n#include<algorithm>\nusing namespace std;\nvector<vector<char>>S; int n;\nbool dp[13][160]; int LIM2 = 0; int _size = 0; int CC = 0;\nvector<vector<char>> solve(vector<vector<char>>p, int x, int y, int r) {\n\tif (r == 1) { p[x][y]--; p[x + 1][y]--; p[x - 1][y]--; p[x][y - 1]--; p[x][y + 1]--; }\n\tif (r == 2) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; }\n\tif (r == 3) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; p[x + 2][y]--; p[x][y + 2]--; p[x - 2][y]--; p[x][y - 2]--; }\n\treturn p;\n}\nbool isgood(int p) {\n\tif (p % 4 == 1 && p >= 5)return true;\n\tif (p % 4 == 2 && p >= 10)return true;\n\tif (p % 4 == 3 && p >= 15)return true;\n\tif (p % 4 == 0 && p >= 20)return true;\n\treturn false;\n}\nbool hantei(vector<vector<char>>p) {\n\tfor (int i = 0; i < 10; i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tif (p[i][j] < 0)return false;\n\t\t}\n\t}\n\tbool OKs[10][10]; for (int i = 0; i < 100; i++)OKs[i / 10][i % 10] = false;\n\tfor (int i = 1; i < 9; i++) {\n\t\tfor (int j = 1; j < 9; j++) {\n\t\t\tif (p[i][j] == 0)continue; bool OK6 = false;\n\t\t\tif (p[i - 1][j] >= 1 && p[i + 1][j] >= 1 && p[i][j - 1] >= 1 && p[i][j + 1] >= 1) {\n\t\t\t\tOK6 = true; OKs[i][j] = true; OKs[i - 1][j] = true; OKs[i][j - 1] = true; OKs[i][j + 1] = true; OKs[i + 1][j] = true;\n\t\t\t}\n\t\t\tif (OK6 == false)continue;\n\t\t\tbool OK4 = true;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)if (p[i + k][j + l] == 0)OK4 = false;\n\t\t\tif (OK4 == false)continue;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)OKs[i + k][j + l] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i <= 9; i++) {\n\t\tfor (int j = 0; j <= 9; j++) {\n\t\t\tif (OKs[i][j] == false && p[i][j] >= 1)return false;\n\t\t}\n\t}\n\tqueue<pair<int, int>>Q3; bool OK5[10][10]; for (int i = 0; i < 100; i++)OK5[i / 10][i % 10] = false;\n\tif (rand() % 19 <= 3 && n == 12 && _size >= 1000)return false;\n\treturn true;\n}\nvector<tuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>>Vec;\nvoid zen_shori() {\n\tint JJ = 165; if (LIM2 == 2)JJ = 27061;\n\tfor (int i = 0; i < JJ; i++) {\n\t\ttuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>ZZ;\n\t\tVec.push_back(ZZ);\n\t}\n\tvector<vector<char>>ZERO; int LL = 0, RR = 0;\n\tvector<tuple<char, char, char>>ZERO3;\n\tfor (int i = 0; i < 10; i++) { vector<char>ZERO5(10, 0); ZERO.push_back(ZERO5); }\n\tVec[0] = make_tuple(ZERO, 0, ZERO3); RR++;\n\twhile (LL < RR && RR < JJ) {\n\t\tvector<vector<char>>a1 = get<0>(Vec[LL]); int a2 = get<1>(Vec[LL]);\n\t\tvector<tuple<char, char, char>>a3 = get<2>(Vec[LL]);\n\t\tLL++; if (a2 == LIM2)continue;\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tvector<vector<char>>a4 = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>a5 = a3; a5.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (RR < JJ) { Vec[RR] = make_tuple(a4, a2 + 1, a5); RR++; }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < Vec.size(); i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tfor (int k = 0; k < 10; k++) {\n\t\t\t\tget<0>(Vec[i])[j][k] *= -1;\n\t\t\t}\n\t\t}\n\t}\n\tsort(Vec.begin(), Vec.end());\n}\nint main() {\n\tsrand((unsigned)time(NULL));\n\tcin >> n; dp[0][0] = true;\n\tLIM2 = 2;\n\tfor (int i = 0; i < 12; i++) {\n\t\tfor (int j = 0; j < 160; j++) {\n\t\t\tif (dp[i][j] == false)continue;\n\t\t\tdp[i + 1][j + 5] = true; dp[i + 1][j + 9] = true; dp[i + 1][j + 13] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i < 10; i++) { vector<char>V(10, 0); S.push_back(V); }\n\tvector<vector<char>>START = S; int SUM = 0;\n\tfor (int i = 0; i < 10; i++)for (int j = 0; j < 10; j++) { int SS; cin >> SS; S[i][j] = SS; SUM += S[i][j]; }\n\tqueue<tuple<int, vector<tuple<char, char, char>>, int>> Q;\n\tvector<tuple<char, char, char>>ZERO;\n\tQ.push(make_tuple(0, ZERO, SUM));\n\tzen_shori(); CC = SUM;\n\n\twhile (!Q.empty()) {\n\t\tvector<vector<char>>a1 = S; int a2 = get<0>(Q.front());\n\t\tvector<tuple<char, char, char>>a3 = get<1>(Q.front()); int a4 = get<2>(Q.front()); Q.pop(); _size = Q.size();\n\t\tfor (int i = 0; i < a3.size(); i++) {\n\t\t\ta1 = solve(a1, get<0>(a3[i]), get<1>(a3[i]), get<2>(a3[i]));\n\t\t}\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tint rem1 = a4 - P[i], rem2 = n - (a2 + 1); bool OK = true;\n\t\t\tif (dp[rem2][rem1] == false)OK = false;\n\t\t\tif (OK == false)continue;\n\t\t\tint LIM = 0; if (a3.size() >= 1) LIM = get<0>(a3[a3.size() - 1]) * 100 + get<1>(a3[a3.size() - 1]) * 10 + get<2>(a3[a3.size() - 1]);\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tint DD = j * 100 + k * 10 + i;\n\t\t\t\t\tif (DD < LIM) continue;\n\t\t\t\t\tvector<vector<char>>G = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>H = a3;\n\t\t\t\t\tif (hantei(G) == false)continue;\n\t\t\t\t\tH.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (G == START && a2 + 1 == n) {\n\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoto E;\n\t\t\t\t\t}\n\t\t\t\t\tif (a2 + 1 >= n - LIM2) {\n\t\t\t\t\t\tint P = lower_bound(Vec.begin(), Vec.end(), make_tuple(G, 0, ZERO)) - Vec.begin();\n\t\t\t\t\t\tif (P < Vec.size() && get<0>(Vec[P]) == G) {\n\t\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tvector<tuple<char, char, char>>J = get<2>(Vec[P]);\n\t\t\t\t\t\t\tfor (int j = 0; j < J.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(J[j]) << ' ' << (int)get<0>(J[j]) << ' ' << (int)get<2>(J[j]) << endl;\n\t\t\t\t\t\t\t}\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\tQ.push(make_tuple(a2 + 1, H, a4 - P[i]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\nE:;\n\treturn 0;\n}",
"accuracy": 0.5,
"time_ms": 4630,
"memory_kb": 26204,
"score_of_the_acc": -1.3888,
"final_rank": 14
},
{
"submission_id": "aoj_0091_1993888",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<tuple>\n#include<cstdlib>\n#include<ctime>\n#include<algorithm>\nusing namespace std;\nvector<vector<char>>S; int n;\nbool dp[13][160]; int LIM2 = 0; int _size = 0; int CC = 0;\nvector<vector<char>> solve(vector<vector<char>>p, int x, int y, int r) {\n\tif (r == 1) { p[x][y]--; p[x + 1][y]--; p[x - 1][y]--; p[x][y - 1]--; p[x][y + 1]--; }\n\tif (r == 2) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; }\n\tif (r == 3) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; p[x + 2][y]--; p[x][y + 2]--; p[x - 2][y]--; p[x][y - 2]--; }\n\treturn p;\n}\nbool isgood(int p) {\n\tif (p % 4 == 1 && p >= 5)return true;\n\tif (p % 4 == 2 && p >= 10)return true;\n\tif (p % 4 == 3 && p >= 15)return true;\n\tif (p % 4 == 0 && p >= 20)return true;\n\treturn false;\n}\nbool hantei(vector<vector<char>>p) {\n\tfor (int i = 0; i < 10; i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tif (p[i][j] < 0)return false;\n\t\t}\n\t}\n\tbool OKs[10][10]; for (int i = 0; i < 100; i++)OKs[i / 10][i % 10] = false;\n\tfor (int i = 1; i < 9; i++) {\n\t\tfor (int j = 1; j < 9; j++) {\n\t\t\tif (p[i][j] == 0)continue; bool OK6 = false;\n\t\t\tif (p[i - 1][j] >= 1 && p[i + 1][j] >= 1 && p[i][j - 1] >= 1 && p[i][j + 1] >= 1) {\n\t\t\t\tOK6 = true; OKs[i][j] = true; OKs[i - 1][j] = true; OKs[i][j - 1] = true; OKs[i][j + 1] = true; OKs[i + 1][j] = true;\n\t\t\t}\n\t\t\tif (OK6 == false)continue;\n\t\t\tbool OK4 = true;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)if (p[i + k][j + l] == 0)OK4 = false;\n\t\t\tif (OK4 == false)continue;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)OKs[i + k][j + l] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i <= 9; i++) {\n\t\tfor (int j = 0; j <= 9; j++) {\n\t\t\tif (OKs[i][j] == false && p[i][j] >= 1)return false;\n\t\t}\n\t}\n\tqueue<pair<int, int>>Q3; bool OK5[10][10]; for (int i = 0; i < 100; i++)OK5[i / 10][i % 10] = false;\n\tif (rand() % 6 == 0 && n == 12 && _size >= 1000)return false;\n\treturn true;\n}\nvector<tuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>>Vec;\nvoid zen_shori() {\n\tint JJ = 165; if (LIM2 == 2)JJ = 27061;\n\tfor (int i = 0; i < JJ; i++) {\n\t\ttuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>ZZ;\n\t\tVec.push_back(ZZ);\n\t}\n\tvector<vector<char>>ZERO; int LL = 0, RR = 0;\n\tvector<tuple<char, char, char>>ZERO3;\n\tfor (int i = 0; i < 10; i++) { vector<char>ZERO5(10, 0); ZERO.push_back(ZERO5); }\n\tVec[0] = make_tuple(ZERO, 0, ZERO3); RR++;\n\twhile (LL < RR && RR < JJ) {\n\t\tvector<vector<char>>a1 = get<0>(Vec[LL]); int a2 = get<1>(Vec[LL]);\n\t\tvector<tuple<char, char, char>>a3 = get<2>(Vec[LL]);\n\t\tLL++; if (a2 == LIM2)continue;\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tvector<vector<char>>a4 = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>a5 = a3; a5.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (RR < JJ) { Vec[RR] = make_tuple(a4, a2 + 1, a5); RR++; }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < Vec.size(); i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tfor (int k = 0; k < 10; k++) {\n\t\t\t\tget<0>(Vec[i])[j][k] *= -1;\n\t\t\t}\n\t\t}\n\t}\n\tsort(Vec.begin(), Vec.end());\n}\nint main() {\n\tsrand((unsigned)time(NULL));\n\tcin >> n; dp[0][0] = true;\n\tLIM2 = 2;\n\tfor (int i = 0; i < 12; i++) {\n\t\tfor (int j = 0; j < 160; j++) {\n\t\t\tif (dp[i][j] == false)continue;\n\t\t\tdp[i + 1][j + 5] = true; dp[i + 1][j + 9] = true; dp[i + 1][j + 13] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i < 10; i++) { vector<char>V(10, 0); S.push_back(V); }\n\tvector<vector<char>>START = S; int SUM = 0;\n\tfor (int i = 0; i < 10; i++)for (int j = 0; j < 10; j++) { int SS; cin >> SS; S[i][j] = SS; SUM += S[i][j]; }\n\tqueue<tuple<int, vector<tuple<char, char, char>>, int>> Q;\n\tvector<tuple<char, char, char>>ZERO;\n\tQ.push(make_tuple(0, ZERO, SUM));\n\tzen_shori(); CC = SUM;\n\n\twhile (!Q.empty()) {\n\t\tvector<vector<char>>a1 = S; int a2 = get<0>(Q.front());\n\t\tvector<tuple<char, char, char>>a3 = get<1>(Q.front()); int a4 = get<2>(Q.front()); Q.pop(); _size = Q.size();\n\t\tfor (int i = 0; i < a3.size(); i++) {\n\t\t\ta1 = solve(a1, get<0>(a3[i]), get<1>(a3[i]), get<2>(a3[i]));\n\t\t}\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tint rem1 = a4 - P[i], rem2 = n - (a2 + 1); bool OK = true;\n\t\t\tif (dp[rem2][rem1] == false)OK = false;\n\t\t\tif (OK == false)continue;\n\t\t\tint LIM = 0; if (a3.size() >= 1) LIM = get<0>(a3[a3.size() - 1]) * 100 + get<1>(a3[a3.size() - 1]) * 10 + get<2>(a3[a3.size() - 1]);\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tint DD = j * 100 + k * 10 + i;\n\t\t\t\t\tif (DD < LIM) continue;\n\t\t\t\t\tvector<vector<char>>G = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>H = a3;\n\t\t\t\t\tif (hantei(G) == false)continue;\n\t\t\t\t\tH.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (G == START && a2 + 1 == n) {\n\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoto E;\n\t\t\t\t\t}\n\t\t\t\t\tif (a2 + 1 >= n - LIM2) {\n\t\t\t\t\t\tint P = lower_bound(Vec.begin(), Vec.end(), make_tuple(G, 0, ZERO)) - Vec.begin();\n\t\t\t\t\t\tif (P < Vec.size() && get<0>(Vec[P]) == G) {\n\t\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tvector<tuple<char, char, char>>J = get<2>(Vec[P]);\n\t\t\t\t\t\t\tfor (int j = 0; j < J.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(J[j]) << ' ' << (int)get<0>(J[j]) << ' ' << (int)get<2>(J[j]) << endl;\n\t\t\t\t\t\t\t}\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\tQ.push(make_tuple(a2 + 1, H, a4 - P[i]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\nE:;\n\treturn 0;\n}",
"accuracy": 0.5833333333333334,
"time_ms": 4890,
"memory_kb": 27016,
"score_of_the_acc": -1.4498,
"final_rank": 12
},
{
"submission_id": "aoj_0091_1993856",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<tuple>\n#include<cstdlib>\n#include<ctime>\n#include<algorithm>\nusing namespace std;\nvector<vector<char>>S; int n;\nbool dp[13][160]; int LIM2 = 0; int _size = 0; int CC = 0;\nvector<vector<char>> solve(vector<vector<char>>p, int x, int y, int r) {\n\tif (r == 1) { p[x][y]--; p[x + 1][y]--; p[x - 1][y]--; p[x][y - 1]--; p[x][y + 1]--; }\n\tif (r == 2) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; }\n\tif (r == 3) { for (int i = -1; i <= 1; i++)for (int j = -1; j <= 1; j++)p[x + i][y + j]--; p[x + 2][y]--; p[x][y + 2]--; p[x - 2][y]--; p[x][y - 2]--; }\n\treturn p;\n}\nbool isgood(int p) {\n\tif (p % 4 == 1 && p >= 5)return true;\n\tif (p % 4 == 2 && p >= 10)return true;\n\tif (p % 4 == 3 && p >= 15)return true;\n\tif (p % 4 == 0 && p >= 20)return true;\n\treturn false;\n}\nbool hantei(vector<vector<char>>p) {\n\tfor (int i = 0; i < 10; i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tif (p[i][j] < 0)return false;\n\t\t}\n\t}\n\tbool OKs[10][10]; for (int i = 0; i < 100; i++)OKs[i / 10][i % 10] = false;\n\tfor (int i = 1; i < 9; i++) {\n\t\tfor (int j = 1; j < 9; j++) {\n\t\t\tif (p[i][j] == 0)continue;\n\t\t\tif (p[i - 1][j] >= 1 && p[i + 1][j] >= 1 && p[i][j - 1] >= 1 && p[i][j + 1] >= 1) {\n\t\t\t\tOKs[i][j] = true; OKs[i - 1][j] = true; OKs[i][j - 1] = true; OKs[i][j + 1] = true; OKs[i + 1][j] = true;\n\t\t\t}\n\t\t\tbool OK4 = true;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)if (p[i + k][j + l] == 0)OK4 = false;\n\t\t\tif (OK4 == false)continue;\n\t\t\tfor (int k = -1; k <= 1; k++)for (int l = -1; l <= 1; l++)OKs[i + k][j + l] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i <= 9; i++) {\n\t\tfor (int j = 0; j <= 9; j++) {\n\t\t\tif (OKs[i][j] == false && p[i][j] >= 1)return false;\n\t\t}\n\t}\n\tqueue<pair<int, int>>Q3; bool OK5[10][10]; for (int i = 0; i < 100; i++)OK5[i / 10][i % 10] = false;\n\tfor (int i = 0; i < 10; i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tif (p[i][j] == 0 || OK5[i][j] == false)continue;\n\t\t\tvector<int>sc; Q3.push(make_pair(i, j)); OK5[i][j] = true; sc.push_back(p[i][j]);\n\t\t\tint dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };\n\t\t\twhile (!Q3.empty()) {\n\t\t\t\tint a11 = Q3.front().first, a12 = Q3.front().second; Q3.pop();\n\t\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\t\tint cx = a11 + dx[k], cy = a12 + dy[k];\n\t\t\t\t\tif (cx < 0 || cx >= 10 || cy < 0 || cy >= 10)continue;\n\t\t\t\t\tif (p[cx][cy] == 0 || OK5[cx][cy] == true)continue;\n\t\t\t\t\tQ3.push(make_pair(cx, cy)); sc.push_back(p[cx][cy]); OK5[cx][cy] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint sums = 0; for (int i = 0; i < sc.size(); i++)sums += sc[i];\n\t\t\tif (isgood(sums) == false)return false;\n\t\t}\n\t}\n\tif (rand() % 3 == 0 && n == 12 && _size >= 1000)return false;\n\treturn true;\n}\nvector<tuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>>Vec;\nvoid zen_shori() {\n\tint JJ = 165; if (LIM2 == 2)JJ = 25000;\n\tfor (int i = 0; i < JJ; i++) {\n\t\ttuple<vector<vector<char>>, int, vector<tuple<char, char, char>>>ZZ;\n\t\tVec.push_back(ZZ);\n\t}\n\tvector<vector<char>>ZERO; int LL = 0, RR = 0;\n\tvector<tuple<char, char, char>>ZERO3;\n\tfor (int i = 0; i < 10; i++) { vector<char>ZERO5(10, 0); ZERO.push_back(ZERO5); }\n\tVec[0] = make_tuple(ZERO, 0, ZERO3); RR++;\n\twhile (LL < RR && RR < JJ) {\n\t\tvector<vector<char>>a1 = get<0>(Vec[LL]); int a2 = get<1>(Vec[LL]);\n\t\tvector<tuple<char, char, char>>a3 = get<2>(Vec[LL]);\n\t\tLL++; if (a2 == LIM2)continue;\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tvector<vector<char>>a4 = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>a5 = a3; a5.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (RR < JJ) { Vec[RR] = make_tuple(a4, a2 + 1, a5); RR++; }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < Vec.size(); i++) {\n\t\tfor (int j = 0; j < 10; j++) {\n\t\t\tfor (int k = 0; k < 10; k++) {\n\t\t\t\tget<0>(Vec[i])[j][k] *= -1;\n\t\t\t}\n\t\t}\n\t}\n\tsort(Vec.begin(), Vec.end());\n}\nint main() {\n\tsrand((unsigned)time(NULL));\n\tcin >> n; dp[0][0] = true;\n\tLIM2 = 2;\n\tfor (int i = 0; i < 12; i++) {\n\t\tfor (int j = 0; j < 160; j++) {\n\t\t\tif (dp[i][j] == false)continue;\n\t\t\tdp[i + 1][j + 5] = true; dp[i + 1][j + 9] = true; dp[i + 1][j + 13] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i < 10; i++) { vector<char>V(10, 0); S.push_back(V); }\n\tvector<vector<char>>START = S; int SUM = 0;\n\tfor (int i = 0; i < 10; i++)for (int j = 0; j < 10; j++) { int SS; cin >> SS; S[i][j] = SS; SUM += S[i][j]; }\n\tqueue<tuple<int, vector<tuple<char, char, char>>, int>> Q;\n\tvector<tuple<char, char, char>>ZERO;\n\tQ.push(make_tuple(0, ZERO, SUM));\n\tzen_shori(); CC = SUM;\n\n\twhile (!Q.empty()) {\n\t\tvector<vector<char>>a1 = S; int a2 = get<0>(Q.front());\n\t\tvector<tuple<char, char, char>>a3 = get<1>(Q.front()); int a4 = get<2>(Q.front()); Q.pop(); _size = Q.size();\n\t\tfor (int i = 0; i < a3.size(); i++) {\n\t\t\ta1 = solve(a1, get<0>(a3[i]), get<1>(a3[i]), get<2>(a3[i]));\n\t\t}\n\t\tint L[4] = { 0,1,1,2 }, R[4] = { 9,8,8,7 }, P[4] = { 0,5,9,13 };\n\t\tfor (int i = 1; i <= 3; i++) {\n\t\t\tint rem1 = a4 - P[i], rem2 = n - (a2 + 1); bool OK = true;\n\t\t\tif (dp[rem2][rem1] == false)OK = false;\n\t\t\tif (OK == false)continue;\n\t\t\tint LIM = 0; if (a3.size() >= 1) LIM = get<0>(a3[a3.size() - 1]) * 100 + get<1>(a3[a3.size() - 1]) * 10 + get<2>(a3[a3.size() - 1]);\n\t\t\tfor (int j = L[i]; j <= R[i]; j++) {\n\t\t\t\tfor (int k = L[i]; k <= R[i]; k++) {\n\t\t\t\t\tint DD = j * 100 + k * 10 + i;\n\t\t\t\t\tif (DD < LIM) continue;\n\t\t\t\t\tvector<vector<char>>G = solve(a1, j, k, i);\n\t\t\t\t\tvector<tuple<char, char, char>>H = a3;\n\t\t\t\t\tif (hantei(G) == false)continue;\n\t\t\t\t\tH.push_back(make_tuple(j, k, i));\n\t\t\t\t\tif (G == START && a2 + 1 == n) {\n\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoto E;\n\t\t\t\t\t}\n\t\t\t\t\tif (a2 + 1 >= n - LIM2) {\n\t\t\t\t\t\tint P = lower_bound(Vec.begin(), Vec.end(), make_tuple(G, 0, ZERO)) - Vec.begin();\n\t\t\t\t\t\tif (P < Vec.size() && get<0>(Vec[P]) == G) {\n\t\t\t\t\t\t\tfor (int j = 0; j < H.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(H[j]) << ' ' << (int)get<0>(H[j]) << ' ' << (int)get<2>(H[j]) << endl;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tvector<tuple<char, char, char>>J = get<2>(Vec[P]);\n\t\t\t\t\t\t\tfor (int j = 0; j < J.size(); j++) {\n\t\t\t\t\t\t\t\tcout << (int)get<1>(J[j]) << ' ' << (int)get<0>(J[j]) << ' ' << (int)get<2>(J[j]) << endl;\n\t\t\t\t\t\t\t}\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\tQ.push(make_tuple(a2 + 1, H, a4 - P[i]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\nE:;\n\treturn 0;\n}",
"accuracy": 0.16666666666666666,
"time_ms": 840,
"memory_kb": 20644,
"score_of_the_acc": -0.7127,
"final_rank": 15
}
] |
aoj_0092_cpp
|
正方形探索
縦に
n
行、横に
n
列並べられた、合計
n × n
のマス目があります。いくつかのマス目には印がついています。各マス目の印の状態を読み込み、印のついていないマス目だけからなる最大の正方形の辺の長さを出力として表示するプログラムを作成してください。
たとえば各データセットで以下のようなデータが与えられます。
10
...*....**
..........
**....**..
........*.
..*.......
..........
.*........
..........
....*..***
.*....*...
入力データの一行が、一行のマス目を表現します。入力データの文字列のうち、.（ピリオド）は印のついていないマス目、*（アスタリスク）は印のついているマス目を示しています。
上記の例では、下図の 0 で示される正方形が最大となります。
...*....**
..........
**....**..
...00000*.
..*00000..
...00000..
.*.00000..
...00000..
....*..***
.*....*...
よって、5 と出力すれば正解になります。
なお、すべてのマス目に印がついている場合には、0 を出力してください。
Input
上記形式で複数のデータセットが与えられます。
n
が 0 のとき入力の最後とします。
n
は 1000 以下とします。入力データの文字列には、ピリオド、アスタリスク、改行以外の文字は含まれません。データセットの数は 50 を超えません。
Output
各データセットに対し、最大の正方形の辺の長さ（整数）を１行に出力して下さい。
Sample Input
10
...*....**
..........
**....**..
........*.
..*.......
..........
.*........
..........
....*..***
.*....*...
10
****.*****
*..*.*....
****.*....
*....*....
*....*****
..........
****.*****
*..*...*..
****...*..
*..*...*..
0
Output for the Sample Input
5
3
|
[
{
"submission_id": "aoj_0092_9907983",
"code_snippet": "#include <bits/stdc++.h>\n\n#define ll long long\nusing namespace std;\n\nint main() {\n ll n;\n while (cin>>n) {\n if(n==0){\n return 0;\n }\n char a;\n vector<vector<ll>> A(n);\n for (ll i = 0; i < n; ++i) {\n A[i].resize(n);\n for (ll j = 0; j < n; ++j) {\n cin >> a;\n A[i][j] = (a == '.');\n }\n }\n vector<vector<ll>> Left(n);\n vector<vector<ll>> Up(n);\n for (ll i = 0; i < n; ++i) {\n Left[i].resize(n);\n Left[i][0] = A[i][0];\n for (ll j = 1; j < n; ++j) {\n if (A[i][j] == 0) {\n Left[i][j] = 0;\n } else {\n Left[i][j] = 1 + Left[i][j - 1];\n }\n }\n }\n for(ll i=0;i<n;++i){\n Up[i].resize(n);\n }\n for (ll i = 0; i < n; ++i) {\n Up[0][i] = A[0][i];\n for (ll j = 1; j < n; ++j) {\n if (A[j][i] == 0) {\n Up[j][i] = 0;\n } else {\n Up[j][i] = 1 + Up[j - 1][i];\n }\n }\n }\n vector<vector<ll>> Dp(n);\n for (ll i=0;i<n;++i) {\n Dp[i].resize(n);\n }\n for (ll i = 0; i < n; ++i) {\n Dp[0][i] = A[0][i];\n Dp[i][0] = A[i][0];\n }\n for (ll i = 1; i < n; ++i) {\n for (ll j = 1; j < n; ++j) {\n if (Dp[i - 1][j - 1] < Left[i][j] and Dp[i - 1][j - 1] < Up[i][j]) {\n Dp[i][j] = 1 + Dp[i - 1][j - 1];\n } else {\n Dp[i][j] = min(Left[i][j], Up[i][j]);\n }\n }\n }\n ll ans = 0;\n for (ll i = 0; i < n; ++i) {\n for (ll j = 0; j < n; ++j) {\n ans = max(ans, Dp[i][j]);\n }\n }\n cout << ans << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 34744,
"score_of_the_acc": -0.5265,
"final_rank": 19
},
{
"submission_id": "aoj_0092_9152464",
"code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to, cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, int cost) : to(to), cost(cost) {}\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nvector<string> split_str(string S, char c) {\n vector<string> ret;\n stringstream ss;\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == c) {\n ret.pb(ss.str());\n ss.str(\"\");\n ss.clear();\n } else {\n ss << S[i];\n }\n }\n ret.pb(ss.str());\n return ret;\n}\n\nusing T = ld;\nT calc_revpo(vector<string> &S) {\n int N = S.size();\n vector<T> st;\n for (int i = 0; i < N; i++) {\n if (S[i] == \"+\") {\n T b = st.back();\n st.pop_back();\n T a = st.back();\n st.pop_back();\n st.pb(a + b);\n } else if (S[i] == \"-\") {\n T b = st.back();\n st.pop_back();\n T a = st.back();\n st.pop_back();\n st.pb(a - b);\n } else if (S[i] == \"*\") {\n T b = st.back();\n st.pop_back();\n T a = st.back();\n st.pop_back();\n st.pb(a * b);\n } else if (S[i] == \"/\") {\n T b = st.back();\n st.pop_back();\n T a = st.back();\n st.pop_back();\n if (b == 0) return -1; // ゼロ除算\n st.pb(a / b);\n } else st.pb(stoll(S[i]));\n }\n return st.back();\n}\n\nsigned main() {\n\tint N;\n\twhile (cin >> N, N) {\n int H = N, W = N;\n vector<vector<int>> S(H, vector<int>(W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n char c;\n cin >> c;\n if (c == '*') {\n S[i][j] = 1;\n }\n }\n }\n\n // 左上(0, 0), 右下(i, j)の長方形領域にある最大正方形の大きさ\n // dp[i][j]は ← ↖ ↑ の最小値+1, ただし壁マスがひとつでもあるなら1\n vector<vector<int>> dp(H, vector<int>(W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n if (S[i][j] == 1) continue;\n int m = INFL;\n if (i == 0 or j == 0) m = 0;\n if (i - 1 >= 0 && j - 1 >= 0) m = min(m, dp[i - 1][j - 1]);\n if (i - 1 >= 0) m = min(m, dp[i - 1][j]);\n if (j - 1 >= 0) m = min(m, dp[i][j - 1]);\n dp[i][j] = m + 1;\n }\n }\n\n int ans = 0;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n ans = max(ans, dp[i][j]);\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 18976,
"score_of_the_acc": -0.2096,
"final_rank": 17
},
{
"submission_id": "aoj_0092_8229390",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n while(1){\n int n;cin>>n;\n if(n==0){\n return(0);\n }\n string s[n];\n for(int i=0;i<n;i++){\n cin>>s[i];\n }\n vector<vector<int>>t(n,vector<int>(n,0));\n int k=0;\n for(int i=0;i<n;i++){\n if(s[0][i]=='.'){\n t[0][i]=1;\n k=1;\n }\n if(s[i][0]=='.'){\n t[i][0]=1;\n }\n }\n for(int i=1;i<n;i++){\n for(int j=1;j<n;j++){\n if(s[i][j]=='.'){\n t[i][j]=min({t[i-1][j],t[i][j-1],t[i-1][j-1]});\n t[i][j]++;\n k=max(k,t[i][j]);\n }\n }\n }\n cout<<k<<\"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 9072,
"score_of_the_acc": -0.0803,
"final_rank": 5
},
{
"submission_id": "aoj_0092_8218642",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n while(1){\n int n;cin>>n;\n if(n==0){\n return(0);\n }\n string s[n];\n for(int i=0;i<n;i++){\n cin>>s[i];\n }\n vector<vector<int>>a(n,vector<int>(n,0));\n for(int i=0;i<n;i++){\n if(s[0][i]=='.'){\n a[0][i]=1;\n }\n if(s[i][0]=='.'){\n a[i][0]=1;\n }\n }\n int h=0;\n for(int i=1;i<n;i++){\n for(int j=1;j<n;j++){\n if(s[i][j]=='.'){\n a[i][j]=min({a[i-1][j-1],a[i][j-1],a[i-1][j]});\n a[i][j]++;\n h=max(h,a[i][j]);\n }\n }\n }\n cout<<h<<\"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 9144,
"score_of_the_acc": -0.0813,
"final_rank": 6
},
{
"submission_id": "aoj_0092_7630881",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(true) {\n int n;\n cin >> n;\n if(n == 0) return 0;\n vector<string>s(n);\n for(int i = 0; i < n; i++) {\n cin >> s[i];\n }\n vector<vector<int>>sum(n+1,vector<int>(n+1));\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n sum[i+1][j+1] = (s[i][j] == '*');\n }\n }\n for(int i = 0; i <= n; i++) {\n for(int j = 0; j < n; j++) {\n sum[i][j+1] += sum[i][j];\n }\n }\n for(int i = 0; i <= n; i++) {\n for(int j = 0; j < n; j++) {\n sum[j+1][i] += sum[j][i];\n }\n }\n int l = 0,r = n+1;\n while(l+1 < r) {\n int mid = (l+r)/2;\n bool f = false;\n for(int i = 0; i+mid <= n; i++) {\n for(int j = 0; j+mid <= n; j++) {\n int tmp = sum[i+mid][j+mid]+sum[i][j]-sum[i][j+mid]-sum[i+mid][j];\n if(tmp == 0) {\n f = true;\n break;\n }\n }\n if(f) break;\n }\n if(f) {\n l = mid;\n }\n else {\n r = mid;\n }\n }\n cout << l << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 8040,
"score_of_the_acc": -0.0175,
"final_rank": 3
},
{
"submission_id": "aoj_0092_6959604",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cmath>\n\n#define N 1001\n\nusing namespace std;\n\nint n;\n// 0:hol, 1:ver\nint memo[N][N][2];\nint diagonal[N][N];\n\nint dp[N][N];\n\nint main() {\n while(cin >> n, n != 0){\n\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n char c;\n cin >> c;\n\n if(c == '.') {\n memo[i][j][0] = j > 0 ? memo[i][j - 1][0] + 1 : 1;\n memo[i][j][1] = i > 0 ? memo[i - 1][j][1] + 1 : 1;\n } else {\n memo[i][j][0] = 0;\n memo[i][j][1] = 0;\n }\n\n diagonal[i][j] = min(memo[i][j][0], memo[i][j][1]);\n\n dp[i][j] = 0;\n }\n }\n\n int ans = 0;\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n if(i > 0 && j > 0) {\n dp[i][j] = min(dp[i - 1][j - 1] + 1, diagonal[i][j]);\n } else {\n dp[i][j] = diagonal[i][j];\n }\n ans = max(dp[i][j], ans);\n }\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 18728,
"score_of_the_acc": -0.3298,
"final_rank": 18
},
{
"submission_id": "aoj_0092_6937280",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<string> A(n);\n for(auto &&s:A)cin >> s;\n vector<vector<int>> dp(n, vector<int>(n));\n int ans = 0;\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n if(A[i][j] == '*')continue;\n if(i == 0 || j == 0)dp[i][j] = 1;\n else dp[i][j] = min(dp[i - 1][j - 1], min(dp[i][j - 1], dp[i - 1][j])) + 1;\n ans = max(ans, dp[i][j]);\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 9152,
"score_of_the_acc": -0.0814,
"final_rank": 7
},
{
"submission_id": "aoj_0092_6476876",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n while(cin >> n,n){\n vector<string> s(n);\n vector<vector<int>> dp(n,vector<int>(n));\n int res = 0;\n for(int i=0;i<n;i++){\n cin >> s[i];\n for(int j=0;j<n;j++){\n if(s[i][j] == '.')dp[i][j] = 1, res = 1;\n }\n }\n for(int i=1;i<n;i++){\n for(int j=1;j<n;j++){\n if(s[i][j] == '.'){\n dp[i][j] = min({dp[i-1][j-1], dp[i-1][j], dp[i][j-1]}) + 1;\n res = max(res, dp[i][j]);\n }\n }\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 8308,
"score_of_the_acc": -0.021,
"final_rank": 4
},
{
"submission_id": "aoj_0092_6268037",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\n\n\nchar g_data[1001][1001];\nint g_dp[1001][1001];\n#define self_min(x,y) (x) > (y) ? (y):(x)\n\nvoid slove(int n)\n{\n\tint v1;\n\tint mv = 0;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tfor (int j = 1; j <= n; j++)\n\t\t{\n\t\t\tif (g_data[i - 1][j - 1] == '*')\n\t\t\t{\n\t\t\t\tg_dp[i][j] = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tv1 = self_min(g_dp[i - 1][j - 1], g_dp[i][j - 1]);\n\t\t\t\tv1 = self_min(v1, g_dp[i - 1][j]);\n\t\t\t\tg_dp[i][j] = v1 + 1;\n\t\t\t\tif (mv < g_dp[i][j])\n\t\t\t\t\tmv = g_dp[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\", mv);\n}\n\nint main()\n{\n\tint n;\n\twhile (1)\n\t{\n\t\tscanf(\"%d\", &n);\n\t\tif (n == 0)\n\t\t\tbreak;\n\t\tmemset(g_data, 0, sizeof(g_data));\n\t\tmemset(g_dp, 0, sizeof(g_dp));\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tscanf(\"%s\", g_data[i]);\n\t\t}\n\t\tslove(n);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7624,
"score_of_the_acc": -0.0121,
"final_rank": 1
},
{
"submission_id": "aoj_0092_5753184",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<sstream>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nint dp[1000][1000];\nsigned main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tstring str[1000];\n\t\tfor(int i=0;i<n;i++)\n\t\t\tcin>>str[i];\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\tif(str[i][j]=='*'){\n\t\t\t\t\tdp[i][j]=0;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tdp[i][j]=min(i,j);\n\t\t\t\tif(i!=0)\n\t\t\t\t\tdp[i][j]=min(dp[i][j],dp[i-1][j]);\n\t\t\t\tif(j!=0)\n\t\t\t\t\tdp[i][j]=min(dp[i][j],dp[i][j-1]);\n\t\t\t\tif(i!=0&&j!=0)\n\t\t\t\t\tdp[i][j]=min(dp[i][j],dp[i-1][j-1]);\n\t\t\t\tdp[i][j]++;\n\t\t\t\tans=max(ans,dp[i][j]);\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 13104,
"score_of_the_acc": -0.133,
"final_rank": 15
},
{
"submission_id": "aoj_0092_5316543",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint n,dp[1010][1010],ans;\nstring s[1010];\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n while(cin >> n, n){\n rep(i,n) cin >> s[i];\n ans = 0;\n rep(i,n)rep(j,n) dp[i][j] = 0;\n rep(i,n)rep(j,n){\n if(s[i][j] == '*') continue;\n dp[i + 1][j + 1] = min({dp[i][j], dp[i][j + 1], dp[i + 1][j]}) + 1;\n ans = max(ans, dp[i + 1][j + 1]);\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 8032,
"score_of_the_acc": -0.0174,
"final_rank": 2
},
{
"submission_id": "aoj_0092_5058875",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\ninline int ri() { int n; cin >> n; return n;}\nvoid solve();\n\nint main()\n{\n\twhile(true)solve();\n}\n\nvoid solve()\n{\n\tint n; cin >> n;\n\tif(!n) exit(0);\n\n\tvector<string> g(n);\n\tvector dp(n + 1, vector(n + 1, 0));\n\tfor(int i = 0; i < n; i++)cin >> g[i];\n\n\tfor(int i = 0; i < n; i++) {\n\t\tfor(int j = 0; j < n; j++) {\n\n\t\t\tif(g[i][j] == '*')continue;\n\t\t\tdp[i + 1][j + 1] = min({dp[i + 1][j], dp[i][j + 1], dp[i][j]}) + 1;\n\n\t\t}\n\t}\n\n\tint nax = 0;\n\tfor(auto &i: dp)for(auto j: i)nax= max(nax, j);\n\tcout << nax << endl;\n\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 9172,
"score_of_the_acc": -0.0816,
"final_rank": 8
},
{
"submission_id": "aoj_0092_4996673",
"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 1e18\n#define modulo 1000000007\n#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)\n\nint main(){\n\t\n\tint n;\n\twhile(true){\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tvector<string> S(n);\n\t\trep(i,n)cin>>S[i];\n\t\t\n\t\tvector dp(n,vector<int>(n,0));\n\t\t\n\t\trep(i,n){\n\t\t\trep(j,n){\n\t\t\t\tif(S[i][j]=='*')continue;\n\t\t\t\tdp[i][j] = 1;\n\t\t\t\tif(i==0||j==0)continue;\n\t\t\t\tdp[i][j] = max(dp[i][j],1+min({dp[i-1][j],dp[i][j-1],dp[i-1][j-1]}));\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\trep(i,n){\n\t\t\trep(j,n)ans = max(ans,dp[i][j]);\n\t\t}\n\t\t\n\t\tcout<<ans<<endl;\n\t\t\n\t}\n\t\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 9248,
"score_of_the_acc": -0.0826,
"final_rank": 9
},
{
"submission_id": "aoj_0092_4824197",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tstring s[n];\n\t\tfor(int i=0;i<n;i++) cin>>s[i];\n\t\tint a[n+1][n+1]={};\n\t\tfor(int i=1;i<=n;i++)\n\t\t\tfor(int j=1;j<=n;j++){\n\t\t\t\tif(s[i-1][j-1]=='.') a[i][j]=min(a[i-1][j-1],min(a[i-1][j],a[i][j-1]))+1;\n\t\t\t\telse a[i][j]=0;\n\t\t\t}\n\t\tint p=0;\n\t\tfor(int i=0;i<n;i++)\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\tp=max(p,a[i+1][j+1]);\n\t\tcout<<p<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 8060,
"score_of_the_acc": -0.1165,
"final_rank": 14
},
{
"submission_id": "aoj_0092_4809602",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nconst int inf = 1e9;\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n \n vector<vector<char>> g(n, vector<char>(n));\n vector<vector<int>> dp(n, vector<int>(n));\n for(int i=0; i<n; i++){\n for(int j=0; j<n; j++){\n cin >> g[i][j];\n if(g[i][j] == '*') dp[i][j] = 0;\n else dp[i][j] = 1;\n }\n }\n int ans = 0;\n for(int i=1; i<n; i++){\n for(int j=1; j<n; j++){\n if(g[i][j] == '*') continue;\n dp[i][j] = min({dp[i-1][j-1], dp[i-1][j], dp[i][j-1]}) +1;\n ans = max(ans, dp[i][j]);\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 7828,
"score_of_the_acc": -0.1876,
"final_rank": 16
},
{
"submission_id": "aoj_0092_4455354",
"code_snippet": "#include <iostream>\n\nint min3(int x, int y, int z)\n{\n\tif (x>y) return y>z ? z : y;\n\telse return x>z ? z : x;\n}\n\nint main()\n{\n\twhile (true) {\n\t\tint size;\n\t\tstd::cin >> size;\n\t\t\n\t\tif (size==0) break;\n\t\t\n\t\tstd::string* board = new std::string[size];\n\t\tfor (int i=0; i<size; i++) {\n\t\t\tstd::cin >> board[i];\n\t\t}\n\t\t\n\t\tint** max_square_size = new int*[size]; \n\t\tfor (int i=0; i<size; i++) {\n\t\t\tmax_square_size[i] = new int[size];\n\t\t}\n\t\t\n\t\tint max_size = 0;\n\t\tfor (int i=size-1; i>=0; i--) {\n\t\t\tfor (int j=size-1; j>=0; j--) {\n\t\t\t\tif (board[i][j] == '*') max_square_size[i][j] = 0;\n\t\t\t\telse if (i==size-1 || j==size-1) max_square_size[i][j] = 1;\n\t\t\t\telse if (board[i+1][j] == '*' || board[i][j+1] == '*' || board[i+1][j+1] == '*') max_square_size[i][j] = 1;\n\t\t\t\telse {\n\t\t\t\t\tmax_square_size[i][j] = min3(max_square_size[i+1][j], \n\t\t\t\t\t\tmax_square_size[i][j+1], max_square_size[i+1][j+1]) + 1;\n\t\t\t\t}\n\t\t\t\tif (max_square_size[i][j] > max_size) {\n\t\t\t\t\tmax_size = max_square_size[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i=0; i<size; i++) delete[] max_square_size[i];\n\t\tdelete[] max_square_size;\n\t\tdelete[] board;\n\t\t\n\t\tstd::cout << max_size << std::endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 7968,
"score_of_the_acc": -0.1153,
"final_rank": 13
},
{
"submission_id": "aoj_0092_4359901",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<vector<int>> v(n, vector<int>(n));\n for (int i = 0; i < n; ++i) {\n string s;\n cin >> s;\n for (int j = 0; j < n; ++j) {\n v[i][j] = (s[j] == '.' ? min(i+1, j+1) : 0);\n if(!v[i][j]) continue;\n if(i) v[i][j] = min(v[i][j], v[i-1][j]+1);\n if(j) v[i][j] = min(v[i][j], v[i][j-1]+1);\n if(i && j) v[i][j] = min(v[i][j], v[i-1][j-1]+1);\n }\n }\n int ans = 0;\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n ans = max(ans, v[i][j]);\n }\n }\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 6700,
"score_of_the_acc": -0.0988,
"final_rank": 10
},
{
"submission_id": "aoj_0092_4285013",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint n;\nstring s;\nint dp[1000][1000];\n\nint main() {\n\n while (cin >> n) {\n if (n == 0) break;\n\n for (int i = 0; i < n; i++) {\n cin >> s;\n for (int j = 0; j < n; j++) {\n dp[i][j] = s[j] == '.' ? 1 : 0;\n }\n }\n\n int ans = 0;\n\n for (int i = 1; i < n; i++) {\n for (int j = 1; j < n; j++) {\n if (dp[i][j]) {\n dp[i][j] = min(dp[i - 1][j], min(dp[i][j - 1], dp[i - 1][j - 1])) + 1;\n ans = max(ans, dp[i][j]);\n }\n }\n }\n\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 7000,
"score_of_the_acc": -0.1027,
"final_rank": 11
},
{
"submission_id": "aoj_0092_4285011",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint main() {\n int n;\n string s;\n\n while (cin >> n) {\n if (n == 0) break;\n\n int dp[n][n];\n\n for (int i = 0; i < n; i++) {\n cin >> s;\n for (int j = 0; j < n; j++) {\n dp[i][j] = s[j] == '.' ? 1 : 0;\n }\n }\n\n int ans = 0;\n\n for (int i = 1; i < n; i++) {\n for (int j = 1; j < n; j++) {\n if (dp[i][j]) {\n dp[i][j] = min(dp[i - 1][j], min(dp[i][j - 1], dp[i - 1][j - 1])) + 1;\n ans = max(ans, dp[i][j]);\n }\n }\n }\n\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 7124,
"score_of_the_acc": -0.1043,
"final_rank": 12
},
{
"submission_id": "aoj_0092_4247583",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cstdio>\nusing namespace std;\n\nint squareSearching(int** table,int W,int H);\n\nstruct rect{\n int w;\n int h;\n bool operator<(const rect &another) const{\n return w*10000+h<another.w*10000+another.h;//w,h<1000\n };\n bool operator==(const rect &another) const{\n return w==another.w and h==another.h;\n };\n};\n\n\nint main(void){\n int n;\n char s[1020];\n while(1){\n cin>>n;\n if(n==0)break;\n int** table;\n table=(int **)malloc(sizeof(int*)*(n+2));\n for(int i=0;i<n+2;i++){\n table[i]=(int*)malloc(sizeof(int)*(n+2));\n }\n for(int i=0;i<n+2;i++){\n table[i][0]=0;\n table[i][n+1]=0;\n }\n for(int j=0;j<n+2;j++){\n table[0][j]=0;\n table[n-1][j]=0;\n }\n\n for(int i=0;i<n;i++){\n scanf(\"%s\",s);\n for(int j=0;j<n;j++){\n if(s[j]=='*'){\n table[i+1][j+1]=0;\n }\n else{\n table[i+1][j+1]=1;\n }\n }\n }\n cout<<squareSearching(table,n,n)<<endl;\n\n }\n return 0;\n}\n\nint squareSearching(int** table,int W,int H){\n vector<rect> dp[H][W];\n int retval=0;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n if(table[i+1][j+1]==0){\n continue;\n }\n\n if(table[i+1][j]==0 and table[i][j+1]==0){\n rect r;\n r.h=1;\n r.w=1;\n dp[i][j].push_back(r);\n }\n else if(table[i+1][j]==0 and table[i][j+1]==1){\n int height=0;\n vector<rect> v;\n v=dp[i-1][j];\n rect tmp;\n for(int k=0;k<v.size();k++){\n tmp=v[k];\n height=max(height,tmp.h);\n }\n if(v.empty()==false){\n height++;\n }\n rect r;\n r.h=height;\n r.w=1;\n dp[i][j].push_back(r);\n }\n else if(table[i+1][j]==1 and table[i][j+1]==0){\n int width=0;\n vector<rect> v;\n v=dp[i][j-1];\n rect tmp;\n for(int k=0;k<v.size();k++){\n tmp=v[k];\n width=max(width,tmp.w);\n }\n if(v.empty()==false){\n width++;\n }\n\n\n rect r;\n r.h=1;\n r.w=width;\n dp[i][j].push_back(r);\n }\n else{\n int width=0;\n vector<rect> v;\n rect tmp2;\n v=dp[i][j-1];\n for(int k=0;k<v.size();k++){\n tmp2=v[k];\n width=max(width,tmp2.w);\n }\n if(v.empty()==false){\n width++;\n }\n\n int height=0;\n v=dp[i-1][j];\n for(int k=0;k<v.size();k++){\n tmp2=v[k];\n height=max(height,tmp2.h);\n }\n if(v.empty()==false){\n height++;\n }\n\n vector<rect> tmp;\n for(int k=0;k<dp[i][j-1].size();k++){\n rect r;\n int h=min(dp[i][j-1][k].h,height);\n int w=dp[i][j-1][k].w+1;\n r.h=h;\n r.w=w;\n tmp.push_back(r);\n }\n for(int k=0;k<dp[i-1][j].size();k++){\n rect r;\n int h=dp[i-1][j][k].h+1;\n int w=min(dp[i-1][j][k].w,width);\n r.h=h;\n r.w=w;\n tmp.push_back(r);\n }\n sort(tmp.begin(),tmp.end());\n tmp.erase(unique(tmp.begin(),tmp.end()),tmp.end());\n\n dp[i][j]=tmp;\n }\n vector<rect> v=dp[i][j];\n for(int k=0;k<v.size();k++){\n retval=max(min((int)v[k].h,(int)v[k].w),retval);\n }\n\n }\n }\n\n return retval;\n}",
"accuracy": 1,
"time_ms": 820,
"memory_kb": 83332,
"score_of_the_acc": -2,
"final_rank": 20
}
] |
aoj_0085_cpp
|
ヨセフのおイモ
昔、ヨセフのおイモというゲームがありました。
n
人が参加しているとしましょう。参加者は中心を向いて円陣を組み、1 から順番に番号が振られます。アツアツのおイモがひとつ、参加者
n
(左の図内側の大きい数字の 30 )に渡されます。おイモを渡された参加者は右隣の参加者にそのおイモを渡します。
m
回目に渡された人は右隣の人に渡して円陣から抜けます(左の図では
m
= 9 の場合を表しています) 。 回渡す毎に一人ずつぬけ、最後に残った人が勝者となり、おイモをいただきます。
n
,
m
が決まってから、実際におイモを渡し始める前にどこにいたら勝てるかわかるといいですよね。上の図は 30 人の参加者で 9 人ごとに抜けるというルールでこのゲームをした場合を書き表しています。内側の大きい数字が参加者に振られた番号、外側の小さい数字が抜ける順番です。それによると、9,18,27,6,16,26 という順番で円陣から抜け出し、最後には 21 が残ることになります。すなわち 21 が勝者となります(小さい数字が 30 になっています)。
ゲーム参加者数
n
と円陣から抜け出す参加者の間隔
m
を入力し、勝者の番号を出力するプログラムを作成してください。ただし、
m
,
n
< 1000 とします。
入力
複数のデータセットが与えられます。各データセットは以下の形式で与えられます。
n
m
ゲーム参加者数
n
（整数）と円陣から抜け出す参加者の間隔
m
（整数）が空白区切りで１行に与えられます。
入力は２つの 0 で終わります。データセットの数は 50 を超えません。
出力
各データセットに対して、勝者となりおイモをいただく人の番号（整数）を１行に出力してください。
Sample Input
41 3
30 9
0 0
Output for the Sample Input
31
21
|
[
{
"submission_id": "aoj_0085_7586202",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <string.h>\n\nusing namespace std;\n\nint main(void)\n{\n\tchar done[1000];\n\tint m, n;\n\n\twhile (cin >> n >> m) {\n\t\tif ((m + n) == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tint tmpNum = 0;\n\t\tint totalNow = 0;\n\n\t\tmemset(done, 0, sizeof(done));\n\n\t\twhile (n != totalNow) {\n\t\t\tfor (int i = 0; ; tmpNum = (tmpNum + 1) % n) {\n\t\t\t\tif (done[tmpNum] == 1) continue;\n\t\t\t\tif (++i >= m) break;\n\t\t\t}\n\n\t\t\t//printf(\"Now=%d, Num=%d\\n\", totalNow, tmpNum);\n\t\t\tdone[tmpNum] = 1;\n\t\t\ttotalNow++;\n\t\t}\n\n\t\tprintf(\"%d\\n\", tmpNum + 1);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3208,
"score_of_the_acc": -1.6667,
"final_rank": 19
},
{
"submission_id": "aoj_0085_7085989",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n, m;\n while(cin >> n >> m, n!=0){\n bool nuke[1010]={false};\n int id = 0;\n for(int i=0;i<n-1;i++){\n int sum = 0;\n while(sum < m){\n if(!nuke[id]) sum++;\n if(sum < m) id = (id+1)%n;\n }\n nuke[id] = true;\n }\n for(int i=0;i<n;i++){\n if(!nuke[i]) cout << i+1 << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3072,
"score_of_the_acc": -1.2669,
"final_rank": 11
},
{
"submission_id": "aoj_0085_5864370",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<set>\n#include<bitset>\n#include<vector>\n#include<string>\n#include <iomanip>\n#include <deque>\n#include<list>\n#include<cmath>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\nusing ll=long long;\nusing P=pair<int,int>;\nusing P_S=pair<int,string>;\nusing P_D=pair<double,int>;\nusing T=tuple<int,int,char,ll,string>;\n\nint main()\n{\n int n,m;\n while(1)\n {\n cin>>n>>m;\n if(n==0) break;\n vector<bool> potato(n,true);\n int now=n-1;\n rep(i,n){\n rep(j,m){\n now=(now+1)%n;\n if(potato[now]==false) j--;\n }\n potato[now]=false;\n }\n cout<<now+1<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3036,
"score_of_the_acc": -1.5827,
"final_rank": 16
},
{
"submission_id": "aoj_0085_4976278",
"code_snippet": "#include<iostream>\nusing namespace std;\nint n,m,d[1000];\nmain(){\n\twhile(cin>>n>>m,n){\n\t\tfor(int i=0;i<n;i++)d[i]=0;\n\t\tint cnt=0,pos=0;\n\t\twhile(cnt<n){\n\t\t\tint now=0;\n\t\t\twhile(now<m){\n\t\t\t\tif(!d[pos%n])now++;\n\t\t\t\tpos++;\n\t\t\t}d[(pos-1)%n]=1;cnt++;\n\t\t}cout<<(pos-1)%n+1<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3088,
"score_of_the_acc": -0.9414,
"final_rank": 7
},
{
"submission_id": "aoj_0085_4175902",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint main(void){\n int n,m;\n while(1){\n cin>>n>>m;\n if(n==0 && m==0)break;\n\n int people[n];\n for(int i=0;i<n;i++){\n people[i]=1;\n }\n int count=0;\n int ind=n-1;\n int rest=n;\n while(rest>1){\n ind=(ind+1)%n;\n if(people[ind]==1){\n count+=1;\n if(count==m){\n rest-=1;\n count=0;\n people[ind]=0;\n }\n }\n }\n for(int i=0;i<n;i++){\n if(people[i]==1){\n cout<<i+1<<endl;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2992,
"score_of_the_acc": -1.2279,
"final_rank": 10
},
{
"submission_id": "aoj_0085_3700595",
"code_snippet": "#define _USE_MATH_DEFINES\n#define _CRT_SECURE_NO_WARNINGS\n\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <iomanip>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <list>\n#include <set>\n#include <map>\n#include <bitset>\n#include <utility>\n#include <numeric>\n\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\n\nconst ll inf = (ll)1e9;\nconst ll mod = (ll)1e9 + 7;\n\nint main()\n{\n\tint n, m;\n\twhile (cin >> n >> m)\n\t{\n\t\tif (n == 0 && m == 0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tset<int> p;\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tp.insert(i);\n\t\t}\n\n\t\tint s = -1;\n\t\twhile (p.size() > 1)\n\t\t{\n\t\t\tfor (int j = 0; j < m;)\n\t\t\t{\n\t\t\t\ts = (s + 1) % n;\n\t\t\t\tif (p.count(s))\n\t\t\t\t{\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tp.erase(s);\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tif (p.count(i))\n\t\t\t{\n\t\t\t\tcout << i + 1 << endl;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3120,
"score_of_the_acc": -1.957,
"final_rank": 20
},
{
"submission_id": "aoj_0085_3434532",
"code_snippet": "#include <bits/stdc++.h>\n#define int long long\n#define ll long long\n#define rep(i,n) for(int i=0;i<n;i++)\n#define INF LLONG_MAX/3\n#define eps LDBL_EPSILON\n#define moder (1000000007)\n#define pie acos(-1)\n#define P std::pair<int,int>\n#define prique priority_queue\n#define ggr getchar();getchar();return 0;\nusing namespace std;\nint n,m;\nsigned main(){\n while(cin>>n>>m){\n if(!n&&!m)break;\n set<int> st;\n for(int i=1;i<=n;i++)st.insert(i);\n int cnt=0;\n for(int i=1;st.size()>1;i++){\n if(st.find(i)!=st.end()){\n cnt++;\n if(cnt%m==0)st.erase(i);\n }\n if(i==n)i=0;\n }\n cout<<*st.begin()<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3124,
"score_of_the_acc": -1.6257,
"final_rank": 17
},
{
"submission_id": "aoj_0085_3418924",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <list>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <stack>\n#include <iomanip>\n#include <numeric>\n#include <queue>\n#include <climits>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <cstring>\n#include <map>\nusing namespace std;\nusing ll = long long;\n#define MOD 1000000007\n#define INF 1LL << 59\nusing ld = long double;\n\nbool operator<(const pair<int, int> &a, const pair<int, int> &b)\n{\n if (a.first == b.first)\n {\n return b.second > a.second;\n }\n return a.first < b.first;\n}\n\nll arr[1000010];\nint main()\n{\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n //cout << fixed << setprecision(6);\n\n int n, m;\n while (cin >> n >> m)\n {\n if (n == 0 && m == 0)\n break;\n\n int arr[1010] = {0};\n\n vector<int> v;\n int cnt = 0;\n int idx = 0;\n while ((int)v.size() != n)\n {\n if (arr[idx] == 0)\n {\n cnt++;\n }\n if (cnt == m)\n {\n arr[idx] = 1;\n v.push_back(idx);\n cnt = 0;\n }\n idx++;\n idx %= n;\n }\n cout << v[v.size() - 1] + 1 << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3112,
"score_of_the_acc": -1.2865,
"final_rank": 12
},
{
"submission_id": "aoj_0085_3009462",
"code_snippet": "#include<iostream>\nusing namespace std;\nint n,m;\nint d[1000];\nmain()\n{\n\twhile(cin>>n>>m,n)\n\t{\n\t\tfor(int i=0;i<n;i++)d[i]=0;\n\t\tint cnt=0,pos=0;\n\t\twhile(cnt<n)\n\t\t{\n\t\t\tint now=0;\n\t\t\twhile(now<m)\n\t\t\t{\n\t\t\t\tif(!d[pos%n])now++;\n\t\t\t\tpos++;\n\t\t\t}\n\t\t\td[(pos-1)%n]=1;\n\t\t\tcnt++;\n\t\t}\n\t\tcout<<(pos-1)%n+1<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2996,
"score_of_the_acc": -0.8965,
"final_rank": 4
},
{
"submission_id": "aoj_0085_2863747",
"code_snippet": "#include<iostream>\n#include<math.h>\n#include<vector>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\n \nint main(){\n \n int n,m,count,tmp;\n \n while(true){\n scanf(\"%d %d\",&n,&m);\n if(n == 0 && m == 0)break;\n \n count = n;\n int array[n];\n for(int i=0; i < n; i++)array[i] = 1;\n \n tmp = 0;\n for(int i=0;count > 1;){\n if(array[i] == 1){\n tmp++;\n if(tmp == m){\n array[i] = 0;\n count--;\n tmp = 0;\n i = (i+1)%n;\n }else{\n i = (i+1)%n;\n }\n }else{\n i = (i+1)%n;\n }\n }\n \n for(int i=0; i < n; i++){\n if(array[i] == 1)printf(\"%d\\n\",i+1);\n }\n \n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3188,
"score_of_the_acc": -1.6569,
"final_rank": 18
},
{
"submission_id": "aoj_0085_2565111",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n, m;\n while (cin >> n >> m, n) {\n bool used[1010] = {};\n int cnt = 0;\n vector<int> ans;\n for (int i = 0; ans.size() < n; ++i) {\n i %= n;\n if (used[i]) continue;\n cnt++;\n\n if (cnt == m) {\n used[i] = true;\n cnt = 0;\n ans.push_back(i + 1);\n }\n }\n\n cout << ans.back() << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3024,
"score_of_the_acc": -1.5768,
"final_rank": 14
},
{
"submission_id": "aoj_0085_2395623",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cstdlib>\n#include<vector>\n#include<string>\n#include<sstream>\n#include<cmath>\n#include<numeric>\n#include<map>\n#include<stack>\n#include<queue>\n#include<cassert>\nusing namespace std;\nint inf = 1000000000;\n\n\nint main(void) {\n\n int n, m;\n while(cin >> n >> m){\n if( n == 0||m==0 ) break;\n\n int cnt = 0;\n vector<bool> b(n, true);\n int a = n;\n int pos = 0;\n while(true){\n pos %= n;\n pos++;\n if( !b[pos] ) continue;\n cnt++;\n if( cnt == m ){\n b[pos] = false;\n a--;\n // cerr << pos << endl;\n if( a == 0 ){\n cout << pos << endl;\n break;\n }\n cnt = 0;\n }\n }\n\n }\n\n\n return 0;\n}\n\n\n// EOF",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3028,
"score_of_the_acc": -1.5788,
"final_rank": 15
},
{
"submission_id": "aoj_0085_2328455",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint n, m;\n\tbool* participant;\n\t\n\twhile (true) {\n\t\tcin >> n >> m;\n\t\tif (n==0 && m==0) break;\n\t\t\n\t\tparticipant = new bool[n];\n\t\tfor (int i=0; i<n; i++) participant[i] = true;\n\t\t\n\t\tint index = 0;\n\t\tfor (int cnt = n; cnt > 0; cnt--) {\n\t\t\tfor (int step = m-1; ; index = (index + 1) % n) {\n\t\t\t\tif (participant[index]) {\n\t\t\t\t\tif (step==0) break;\n\t\t\t\t\telse step--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tparticipant[index] = false;\n\t\t\t// cout << index+1 << \" \";\n\t\t}\n\t\t\n\t\tcout << index+1 << endl;\n\t\t\n\t\tdelete[] participant;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3016,
"score_of_the_acc": -1.5729,
"final_rank": 13
},
{
"submission_id": "aoj_0085_2197800",
"code_snippet": "#include<iostream>\n #include<stdio.h>\n #include<string>\n #include<math.h>\n #include<iomanip>\n #include<algorithm>\n #include<string.h>\n #include<cctype>\n #include<map>\n #include<set>\n #include<vector>\n #include<sstream>\n #include<stack>\n #include<queue>\n #include<deque>\n #include<functional>\n #include<utility>\n #include<list>\n \n using namespace std;\n \n int main()\n {\n int n,m;\n while(cin>>n>>m&&(n||m))\n {\n list<int> mm;\n list<int>::iterator iter;\n list<int>::iterator iter2;\n for(int i=1;i<=n;i++) mm.push_back(i);\n while(mm.size()>1)\n {\n for(int i=1;i<=m-1;i++)\n {\n mm.push_back(mm.front());\n mm.pop_front();\n } \n mm.pop_front(); \n //cout<<mm.front()<<endl; \n }\n iter=mm.begin();\n cout<<(*iter)<<endl; \n }\n //while(1);\n return 0; \n }",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3032,
"score_of_the_acc": -0.9141,
"final_rank": 6
},
{
"submission_id": "aoj_0085_2128683",
"code_snippet": "#include<iostream>\n#include<cstdio>\nusing namespace std;\n\nint main()\n{\n\tint a, b;\n\twhile (cin >> a >> b, a | b) {\n\t\tint c = a;\n\t\tbool flag[1000]{};\n\t\tint now = 0;\n\t\tfor (; a != 1;a--) {\n\t\t\tint k = 0;\n\t\t\tfor(;;now++) {\n\t\t\t\tif (!flag[now%c]) {\n\t\t\t\t\tk++; \n\t\t\t\t\tif (k == b) {\n\t\t\t\t\t\tflag[now%c] = true;\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 < c; i++) {\n\t\t\tif (!flag[i]) {\n\t\t\t\tcout << i + 1 << endl;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2976,
"score_of_the_acc": -0.8867,
"final_rank": 3
},
{
"submission_id": "aoj_0085_2057364",
"code_snippet": "#include <stdio.h>\n#include<math.h>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\n\tint n,m,count,tmp_count;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&n,&m);\n\t\tif(n == 0 && m == 0)break;\n\n\t\tcount = n;\n\t\tint array[n];\n\t\tfor(int i=0; i < n; i++)array[i] = 1;\n\n\t\ttmp_count = 0;\n\t\tfor(int i=0;count > 1;){\n\t\t\tif(array[i] == 1){\n\t\t\t\ttmp_count++;\n\t\t\t\tif(tmp_count == m){\n\t\t\t\t\tarray[i] = 0;\n\t\t\t\t\tcount--;\n\t\t\t\t\ttmp_count = 0;\n\t\t\t\t\ti = (i+1)%n;\n\t\t\t\t}else{\n\t\t\t\t\ti = (i+1)%n;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\ti = (i+1)%n;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i=0; i < n; i++){\n\t\t\tif(array[i] == 1)printf(\"%d\\n\",i+1);\n\t\t}\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2620,
"score_of_the_acc": -1.0462,
"final_rank": 9
},
{
"submission_id": "aoj_0085_2044500",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<cmath>\n#include<list>\n#include<stack>\n#include<queue>\n#include<cctype>\n#include<iomanip>\n#include<functional>\n#include<numeric>\n#include<map>\n#include<set>\n#include<complex>\n#define EPS 1e-10\nusing namespace std;\ntypedef long long llong;\nint main() {\n\tint n, m;\n\twhile (cin >> n >> m&&n&&m) {\n\t\tvector<int>v(n);\n\t\t//for (int i = 1; i <= n; i++)printf(\"%3d\", i); cout << endl;\n\t\tfor (int i = 0; i < n; i++)v[i] = 0;\n\t\tint cnt = 1;\n\t\tint tom = 0;\n\t\tint index;\n\t\tfor (int i = 0; cnt != n + 1; i++) {\n\t\t\tif (v[i%n] == 0) {\n\t\t\t\ttom++;\n\t\t\t}\n\n\t\t\tif (tom == m) {\n\t\t\t\tv[i%n] = cnt++;\n\t\t\t\tindex = i%n + 1;\n\t\t\t\ttom = 0;\n\t\t\t}\n\t\t\t//for (int j = 0; j < n; j++)printf(\"%3d\", v[j]);\n\t\t\t//cout << \"index is \" << index << endl;\n\t\t}\n\t\tcout << index << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3024,
"score_of_the_acc": -0.9102,
"final_rank": 5
},
{
"submission_id": "aoj_0085_1976177",
"code_snippet": "#include<iostream>\n#include<string.h>\n#include<cstdio>\n#include<algorithm>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<cmath>\n#include<utility>\n#define ll long long int\n#define ld long double\n#define INF 1000000000\n#define EPS 0.0000000001\n#define rep(i,n) for(i=0;i<n;i++)\nusing namespace std;\ntypedef pair<int, int> P;\n\nstring str;\n\nint main()\n{\n while(1){\n int n,m;\n\n cin>>n>>m;\n if(n==0 &&m==0)break;\n int order[1000]={};\n int i;\n int cnt=1;\n int num=1;\n while(num>0){\n rep(i,n){\n\tif(order[i])continue;\n\tif(cnt==m){\n\t order[i]=num;\n\t cnt=0;\n\t if(num==n){\n\t num=-1;\n\t break;\n\t }\n\t num++;\n\t}\n\tcnt++;\n }\n }\n rep(i,n)\n if(order[i]==n){\n\tcout<<i+1<<endl;\n\tbreak;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0085_1967086",
"code_snippet": "#define scanf_s scanf\n//#define gets_s gets\n#include <stdio.h>\n#include <string>\n#include <iostream>\n#include <math.h>\nusing namespace std;\n#define MAX 1000\n#define MIN 2\nint main(void)\n{\n\tint n, m;\n\twhile (scanf_s(\"%d %d\",&n,&m) != EOF) {\n\t\tif (n == 0 && m == 0) break;\n\t\tint h[MAX + 1] = { 0 },ans = 0, cou = 0, k = 0;\n\t\twhile(cou < n) {\n\t\t\tfor (int i = ans + 1; k <= m; ++i) {\n\t\t\t\tif (i > n) { i = i - n; }\n\t\t\t\tif (h[i] == false) { ++k; }\n\t\t\t\tif (k >= m) {\n\t\t\t\t\tk = 0; ++cou;\n\t\t\t\t\th[i] = true;\n\t\t\t\t\tans = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0137,
"final_rank": 2
},
{
"submission_id": "aoj_0085_1956718",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <ctime>\nusing namespace std;\n \n#define rep(i,a,n) for(int i=a; i<n; i++)\n#define repr(i,a,n) for(int i=a; i>=n; i--)\n#define pb(a) push_back(a)\n#define fr first\n#define sc second\n#define INF 999999999\n \n#define X real()\n#define Y imag()\n#define EPS (1e-10)\n#define EQ(a,b) (abs((a) - (b)) < EPS)\n#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )\n#define LE(n, m) ((n) < (m) + EPS)\n#define GE(n, m) ((n) + EPS > (m))\n \ntypedef vector<int> VI;\ntypedef vector<VI> MAT;\ntypedef pair<int, int> pii;\ntypedef long long int ll;\n \ntypedef complex<double> P;\ntypedef pair<P, P> L;\ntypedef pair<P, double> C;\n \nint dy[]={0, 0, 1, -1};\nint dx[]={1, -1, 0, 0};\nint const MOD = 1000000007;\n \nnamespace std {\n bool operator<(const P a, const P b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n}\n \nint main() {\n int n, m;\n while(cin >> n >> m) {\n int a[1010];\n memset(a, 0, sizeof(a));\n if(n == 0 && m == 0) break;\n int p = 0, i = 0, cnt = 0;\n while(i < n) {\n //printf(\"%d %d %d\\n\",i, cnt, p);\n if(a[p] == 0) {\n cnt++;\n if(cnt % m == 0) {\n // cout << p + 1 << endl;\n a[p] = 1;\n i++;\n p = (p + 1) % n;\n }\n else {p = (p + 1) % n;}\n }\n else p = (p + 1) % n;\n }\n cout << (p == 0 ? n : p) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1164,
"score_of_the_acc": -1.002,
"final_rank": 8
}
] |
aoj_0097_cpp
|
整数の和 II
0 から 100 の数字から異なる
n
個の数を取り出して合計が
s
となる組み合わせの数を出力するプログラムを作成してください。
n
個の数はおのおの 0 から 100 までとし、１つの組み合わせに同じ数字は使えません。たとえば、
n
が 3 で
s
が6 のとき、3 個の数字の合計が 6 になる組み合わせは、
1 + 2 + 3 = 6
0 + 1 + 5 = 6
0 + 2 + 4 = 6
の 3 通りとなります。
Input
複数のデータセットが与えられます。各データセットに
n
( 1 ≤
n
≤ 9 ) と
s
( 0 ≤
s
≤ 1000 ) が１つのスペースで区切られて１行に与えられます。
n
と
s
が共に 0 のとき入力の最後とします。
データセットの数は 50 を超えません。
Output
各データセットに対して、
n
個の整数の和が
s
になる組み合わせの数を１行に出力して下さい。
組み合わせの数が 10
10
を超える入力は与えられません。
Sample Input
3 6
3 1
0 0
Output for the Sample Input
3
0
|
[
{
"submission_id": "aoj_0097_9152665",
"code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to, cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, int cost) : to(to), cost(cost) {}\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nvector<string> split_str(string S, char c) {\n vector<string> ret;\n stringstream ss;\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == c) {\n ret.pb(ss.str());\n ss.str(\"\");\n ss.clear();\n } else {\n ss << S[i];\n }\n }\n ret.pb(ss.str());\n return ret;\n}\n\nsigned main() {\n int N, M;\n vector<int> P(101);\n for (int i = 0; i <= 100; i++) P[i] = i;\n while (cin >> N >> M, N) {\n vector<vector<vector<int>>> dp(102, vector<vector<int>>(N + 1, vector<int>(M + 1)));\n dp[0][0][0] = 1;\n for (int i = 0; i <= 100; i++) {\n for (int j = 0; j <= N; j++) {\n for (int k = 0; k <= M; k++) {\n dp[i + 1][j][k] += dp[i][j][k];\n if (j + 1 <= N && k + P[i] <= M) dp[i + 1][j + 1][k + P[i]] += dp[i][j][k];\n }\n }\n }\n\n int fac = 1;\n cout << dp[101][N][M] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 10624,
"score_of_the_acc": -0.1495,
"final_rank": 7
},
{
"submission_id": "aoj_0097_8090140",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll dp[101][10][1001];\nint main() {\n while (1) {\n ll n, s;\n cin >> n >> s;\n if (!n) break;\n memset(dp, 0, sizeof(dp));\n dp[0][0][0] = 1;\n dp[0][1][0] = 1;\n for (int i = 1; i <= 100; i++) {\n for (int j = 0; j <= n; j++) {\n for (int k = 0; k <= s; k++) {\n dp[i][j][k] = dp[i - 1][j][k];\n if (j && k >= i) dp[i][j][k] += dp[i - 1][j - 1][k - i];\n }\n }\n }\n cout << dp[100][n][s] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11264,
"score_of_the_acc": -0.1339,
"final_rank": 3
},
{
"submission_id": "aoj_0097_7442800",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\twhile(true){\n\t\tauto N=in(),S=in();\n\t\tif(!N && !S) break;\n\n\t\tvvll C(1001,vll(10,0));\n\t\tvector<set<ll>> H(10);\n\t\tH[0].insert(0);\n\t\tC[0][0]=1;\n\t\tREP(i,101){\n\t\t\tfor(ll j=min(i+1ll,8ll);j>=0;j--){\n\t\t\t\tset<ll> I;\n\t\t\t\tfor(auto& x:H[j]){\n\t\t\t\t\tll K=x+i;\n\t\t\t\t\tif(K>=0 && K<=S){\n\t\t\t\t\t\tC[K][j+1] += C[x][j];\n\t\t\t\t\t\tI.insert(K);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tH[j+1].insert(I.begin(),I.end());\n\t\t\t}\n\t\t}\n\t\tout(C[S][N]);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 3740,
"score_of_the_acc": -1,
"final_rank": 12
},
{
"submission_id": "aoj_0097_6268174",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\n\n\nlong long g_dp[101][11][1001];\n#define self_min(x,y) (x) > (y) ? (y):(x)\n\nlong long slove(int idx, int num, int sum)\n{\n\tif (sum == 0 && num == 0)\n\t\treturn 1;\n\telse if (sum < 0)\n\t\treturn 0;\n\telse if (num < 0)\n\t\treturn 0;\n\n\tif (idx > 100)\n\t\treturn 0;\n\n\tif (g_dp[idx][num][sum] != -1)\n\t\treturn g_dp[idx][num][sum];\n\n\tlong long cnt = 0;\n\tlong long v1 = slove(idx + 1, num - 1, sum - idx);\n\tlong long v2 = slove(idx + 1, num, sum);\n\tcnt = v1 + v2;\n\tg_dp[idx][num][sum] = cnt;\n\treturn cnt;\n}\n\nint main()\n{\n\tint s, n;\n\twhile (1)\n\t{\n\t\tscanf(\"%d%d\", &n, &s);\n\t\tif (n == 0 && s == 0)\n\t\t\tbreak;\n\t\tmemset(g_dp, -1, sizeof(g_dp));\n\t\tlong long cnt = slove(0, n, s);\n\t\tprintf(\"%lld\\n\", cnt);\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 11348,
"score_of_the_acc": -0.1894,
"final_rank": 9
},
{
"submission_id": "aoj_0097_6268164",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\n\n\nint g_dp[101][11][1001];\n#define self_min(x,y) (x) > (y) ? (y):(x)\n\nint slove(int idx, int num, int sum)\n{\n\tif (sum == 0 && num == 0)\n\t\treturn 1;\n\telse if (sum < 0)\n\t\treturn 0;\n\telse if (num < 0)\n\t\treturn 0;\n\n\tif (idx > 100)\n\t\treturn 0;\n\n\tif (g_dp[idx][num][sum] != -1)\n\t\treturn g_dp[idx][num][sum];\n\n\tint cnt = 0;\n\tint v1 = slove(idx + 1, num - 1, sum - idx);\n\tint v2 = slove(idx + 1, num, sum);\n\tcnt = v1 + v2;\n\tg_dp[idx][num][sum] = cnt;\n\treturn cnt;\n}\n\nint main()\n{\n\tint s, n;\n\twhile (1)\n\t{\n\t\tscanf(\"%d%d\", &n, &s);\n\t\tif (n == 0 && s == 0)\n\t\t\tbreak;\n\t\tmemset(g_dp, -1, sizeof(g_dp));\n\t\tint cnt = slove(0, n, s);\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 0.5,
"time_ms": 20,
"memory_kb": 7052,
"score_of_the_acc": -0.086,
"final_rank": 16
},
{
"submission_id": "aoj_0097_6268111",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\n\n\nint g_dp[101][11][1001];\n#define self_min(x,y) (x) > (y) ? (y):(x)\n\nint slove(int idx, int num, int sum)\n{\n\tif (sum == 0 && num == 0)\n\t\treturn 1;\n\telse if (sum == 0 || num == 0)\n\t\treturn 0;\n\n\tif (idx > 100)\n\t\treturn 0;\n\n\tif (g_dp[idx][num][sum] != -1)\n\t\treturn g_dp[idx][num][sum];\n\n\tint cnt = 0;\n\tint v1 = slove(idx + 1, num - 1, sum - idx);\n\tint v2 = slove(idx + 1, num, sum);\n\tcnt = v1 + v2;\n\tg_dp[idx][num][sum] = cnt;\n\treturn cnt;\n}\n\nint main()\n{\n\tint s, n;\n\twhile (1)\n\t{\n\t\tscanf(\"%d%d\", &n, &s);\n\t\tif (n == 0 && s == 0)\n\t\t\tbreak;\n\t\tmemset(g_dp, -1, sizeof(g_dp));\n\t\tint cnt = slove(0, n, s);\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 0.25,
"time_ms": 10,
"memory_kb": 7008,
"score_of_the_acc": -0.0582,
"final_rank": 19
},
{
"submission_id": "aoj_0097_6084693",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long dp[102][11][1001];\n\nint main() {\n while(true) {\n int n,s;\n cin >> n >> s;\n if(n == 0 && s == 0) {\n return 0;\n }\n memset(dp,0,sizeof(dp));\n dp[0][0][0] = 1;\n for(int i = 0; i <= 100; i++) {\n for(int j = 0; j <= n; j++) {\n for(int k = 0; k <= s; k++) {\n dp[i+1][j][k] += dp[i][j][k];\n if(k+i <= s) {\n dp[i+1][j+1][k+i] += dp[i][j][k];\n }\n }\n }\n }\n cout << dp[101][n][s] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 12052,
"score_of_the_acc": -0.1479,
"final_rank": 6
},
{
"submission_id": "aoj_0097_5839108",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n int n,s;\n cin >> n >> s;\n if(n == 0 && s == 0) break;\n vector<vector<vector<long long int> > > dp(n,vector<vector<long long int> >(s+1,vector<long long int>(101,0)));\n for(int i=0;i<=min(s,100);i++) dp[0][i][i] = 1;\n for(int i=1;i<n;i++) for(int j=0;j<=s;j++) for(int k=0;k<=100;k++) for(int l=k+1;l<=100;l++) if(j-l >= 0) dp[i][j][l] += dp[i-1][j-l][k];\n long long int ans = 0;\n for(int i=0;i<=100;i++) ans += dp[n-1][s][i];\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 10228,
"score_of_the_acc": -1.1155,
"final_rank": 13
},
{
"submission_id": "aoj_0097_5740927",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<sstream>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nint dp[10][1001][101];\nsigned main(){\n\tfor(int i=0;i<=100;i++)\n\t\tfor(int j=i;j<=100;j++)\n\t\t\tdp[1][i][j]+=1;\n\tfor(int i=2;i<=9;i++)\n\t\tfor(int j=0;j<=1000;j++)\n\t\t\tfor(int k=i-1;k<=100;k++)\n\t\t\t\tfor(int l=i-1;l<=min(j,k);l++)\n\t\t\t\t\tdp[i][j][k]+=dp[i-1][j-l][l-1];\n\tint n,s;\n\twhile(cin>>n>>s,n)\n\t\tcout<<dp[n][s][100]<<endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 9840,
"score_of_the_acc": -0.1086,
"final_rank": 1
},
{
"submission_id": "aoj_0097_5058576",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nvoid solve();\nconst int M = 101;\n\n\nint main()\n{\n\twhile(true)solve();\n}\n\nvoid solve()\n{\n\tint n, s; cin >> n >> s;\n\tif(!n && !s) exit(0);\n\tvector<int> A(M);\n\tiota(A.begin(), A.end(), 0);\n\n\tvector dp(M + 1, vector(n + 1, vector(s + 1, 0LL)));\n\tdp[0][0][0] = 1;\n\n\tfor(int i = 0; i < M; i++) { //考慮する数\n\t\tfor(int j = 0; j <= n; j++) { //すでに選んだ数\n\t\t\tfor(int k = 0; k <= s; k++) { //総和\n\n\t\t\t\tdp[i + 1][j][k] += dp[i][j][k];\n\n\t\t\t\tif(A[i] + k <= s && j != n) {\n\t\t\t\t\tdp[i + 1][j + 1][k + A[i]] += dp[i][j][k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << dp[M][n][s] << endl;\n\t\n\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 10592,
"score_of_the_acc": -0.176,
"final_rank": 8
},
{
"submission_id": "aoj_0097_4992710",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\n#ifdef _DEBUG\n#define PRE_COMMAND \\\n std::cin.rdbuf(in.rdbuf()); \\\n std::cout << fixed << setprecision(15);\n#else\n#define PRE_COMMAND cout << fixed << setprecision(15);\n#endif\nconst double EPS = 1e-10, PI = acos(-1.0);\ntemplate <class T> auto MAX(T& seq) {\n return *max_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto MIN(T& seq) {\n return *min_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto SUM(T& seq) {\n T temp{0};\n auto& temp2 = temp[0];\n return accumulate(seq.begin(), seq.end(), temp2);\n}\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\n sort(seq.begin(), seq.end(), sort_order);\n}\ntemplate <class T> void SORTR(vector<T>& seq) {\n sort(seq.begin(), seq.end(), greater<T>());\n}\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\n while (k) {\n if (k & 1) now = (now * n) % mod;\n n = (n * n) % mod;\n k >>= 1;\n }\n return now;\n}\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\n for (T& x : vec) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n if (!v.size()) return os;\n typename vector<T>::const_iterator ii = v.begin();\n os << *ii++;\n for (; ii != v.end(); ++ii) os << \" \" << *ii;\n return os;\n}\n\nint main() {\n PRE_COMMAND\n // 何個目か、合計値、どこまで見たか\n vector<vector<vector<ll>>> dp(9,\n vector<vector<ll>>(1001, vector<ll>(101, 0)));\n for (int j = 0; j < 101; j++) { dp[0][j][j] = 1; }\n for (int i = 0; i < 8; i++) {\n int lim = (i + 2) * 100;\n for (int j = 0; j <= lim; j++) {\n for (int k = 0; k < 101; k++) {\n ll pre = dp[i][j][k];\n if (pre <= 10000000000) {\n for (int x = k + 1; x < 101; x++) {\n dp[i + 1][j + x][x] += pre;\n }\n }\n }\n }\n }\n while (true) {\n int x, y;\n cin >> x >> y;\n if (x == 0) break;\n cout << SUM(dp[x - 1][y]) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11064,
"score_of_the_acc": -0.1303,
"final_rank": 2
},
{
"submission_id": "aoj_0097_4933162",
"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;\nconst int mod = 1000000007;\nconst int inf = (1<<30);\nll tebl[10][1001][101]={};\nll dp[10][1001]={};\nint main(){\n\tint n,s;\n\trep(i,101){\n\t\tdp[0][i]=1;\n\t\ttebl[0][i][i]=1;\n\t}\n\t//cout<<dp[0][0]<<endl;\n\tfor(int i=1; i<=9; i++){\n\t\tfor(int j=0; j<=1000; j++){\n\t\t\tfor(int k=0; k<=100 && j-k>k; k++){\n\t\t\t\tll a=0;\n\t\t\t\tfor(int l=0; l<=k; l++){//0~kを含む式を数える\n\t\t\t\t\ta+=tebl[i-1][j-k][l];\n\t\t\t\t}\n\t\t\t\ttebl[i][j][k]=dp[i-1][j-k]-a;//ｋを含む式の数\n\t\t\t\tdp[i][j]+=tebl[i][j][k];\n\t\t\t}\n\t\t\t/*if(dp[0][0]==0){\n\t\t\t\tcout<<i<<\" \"<<j<<endl;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n\t/*for(int j=0; j<=6; j++){\n\t\tfor(int i=0; i<=3; i++){\n\t\t\tcout<<dp[i][j]<<\" \";\n\t\t}\n\t\tcout<<endl;\n\t}\n\tcout<<dp[0][0]<<endl;\n\tfor(int i=0; i<=3; i++){\n\t\tfor(int j=0; j<=6; j++){\n\t\t\tcout<<i<<\" \"<<j<<endl;\n\t\t\tfor(int k=0; k<=3 && j-k>k; k++){\n\t\t\t\tcout<<k<<\"が \"<<tebl[i][j][k]<<\" \";\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\t\n\t\n\tfor(int i=1; i<n; i++){\n\t\tfor(int j=0; j<=s; j++){\n\t\t\t\n\t\t\tfor(int k=0; k<t; k++,t--){\n\t\t\t\tdp[i][j]+=dp[i-1][k]*dp[i-1][t];\n\t\t\t}\n\t\t}\n\t}\n\t*/\n\t\n\twhile(true){\n\t\tcin>>n>>s;\n\t\tif(n==0 && s==0) break;\n\t\tcout<<dp[n-1][s]<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 10348,
"score_of_the_acc": -0.1446,
"final_rank": 5
},
{
"submission_id": "aoj_0097_4933155",
"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;\nconst int mod = 1000000007;\nconst int inf = (1<<30);\nint tebl[10][1001][101]={};\nint dp[10][1001]={};\nint main(){\n\tint n,s;\n\trep(i,101){\n\t\tdp[0][i]=1;\n\t\ttebl[0][i][i]=1;\n\t}\n\t//cout<<dp[0][0]<<endl;\n\tfor(int i=1; i<=9; i++){\n\t\tfor(int j=0; j<=1000; j++){\n\t\t\tfor(int k=0; k<=100 && j-k>k; k++){\n\t\t\t\tint a=0;\n\t\t\t\tfor(int l=0; l<=k; l++){//0~kを含む式を数える\n\t\t\t\t\ta+=tebl[i-1][j-k][l];\n\t\t\t\t}\n\t\t\t\ttebl[i][j][k]=dp[i-1][j-k]-a;//ｋを含む式の数\n\t\t\t\tdp[i][j]+=tebl[i][j][k];\n\t\t\t}\n\t\t\t/*if(dp[0][0]==0){\n\t\t\t\tcout<<i<<\" \"<<j<<endl;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n\t/*for(int j=0; j<=6; j++){\n\t\tfor(int i=0; i<=3; i++){\n\t\t\tcout<<dp[i][j]<<\" \";\n\t\t}\n\t\tcout<<endl;\n\t}\n\tcout<<dp[0][0]<<endl;\n\tfor(int i=0; i<=3; i++){\n\t\tfor(int j=0; j<=6; j++){\n\t\t\tcout<<i<<\" \"<<j<<endl;\n\t\t\tfor(int k=0; k<=3 && j-k>k; k++){\n\t\t\t\tcout<<k<<\"が \"<<tebl[i][j][k]<<\" \";\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\t\n\t\n\tfor(int i=1; i<n; i++){\n\t\tfor(int j=0; j<=s; j++){\n\t\t\t\n\t\t\tfor(int k=0; k<t; k++,t--){\n\t\t\t\tdp[i][j]+=dp[i-1][k]*dp[i-1][t];\n\t\t\t}\n\t\t}\n\t}\n\t*/\n\t\n\twhile(true){\n\t\tcin>>n>>s;\n\t\tif(n==0 && s==0) break;\n\t\tcout<<dp[n-1][s]<<endl;\n\t}\n}",
"accuracy": 0.5,
"time_ms": 20,
"memory_kb": 6724,
"score_of_the_acc": -0.0801,
"final_rank": 15
},
{
"submission_id": "aoj_0097_4807641",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define each(i, a) for(auto &i : a)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#define line cout << \"-----------------------------\\n\" \n#define ENDL(i,n) ((i) == (n) - 1 ? \"\\n\" : \" \")\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\n\nint main() {\n init();\n\n for (int n, s; cin >> n >> s && n;) {\n auto dp = vec<ll>(102, n + 1, s + 1);\n dp[0][0][0] = 1;\n eFOR(i, 0, 100)eFOR(j, 0, n)eFOR(k, 0, s) {\n dp[i + 1][j][k] += dp[i][j][k];\n if (j < n && k + i <= s)\n dp[i + 1][j + 1][k + i] += dp[i][j][k];\n }\n print(dp[101][n][s]);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 10184,
"score_of_the_acc": -0.1417,
"final_rank": 4
},
{
"submission_id": "aoj_0097_4562328",
"code_snippet": "#include <iostream>\n\n#define MAX_SUM 900\n\nint main()\n{\n\tunsigned long long*** DP = new unsigned long long**[9];\n\tfor (int i=0; i<9; i++) {\n\t\tDP[i] = new unsigned long long*[901];\n\t\tfor (int j=0; j<MAX_SUM+1; j++) DP[i][j] = new unsigned long long[901];\n\t}\n\t\n\tfor (int j=0; j<MAX_SUM+1; j++) {\n\t\tfor (int k=0; k<MAX_SUM+1; k++) DP[0][j][k] = (j<=k && k<=100) ? 1 : 0;\n\t}\n\t\n\tfor (int i=1; i<9; i++) {\n\t\tfor (int j=0; j<MAX_SUM+1; j++) {\n\t\t\tfor (int k=0; k<MAX_SUM+1; k++) {\n\t\t\t\tunsigned long long sum = 0;\n\t\t\t\tfor (int m=j; m<MAX_SUM+1 && m<=(k-1)/2; m++) sum += DP[i-1][m+1][k-m];\n\t\t\t\tDP[i][j][k] = sum;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint n, s;\n\twhile (std::cin >> n >> s) {\n\t\t//std::cout << n << \" \" << s << std::endl;\n\t\tif (n == 0 && s == 0) break;\n\t\tif (s>MAX_SUM) std::cout << 0 << std::endl;\n\t\telse std::cout << DP[n-1][0][s] << std::endl;\n\t}\n\t\n\tfor (int i=0; i<9; i++) {\n\t\tfor (int j=0; j<MAX_SUM+1; j++) delete[] DP[i][j];\n\t\tdelete[] DP[i];\n\t\t\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 59932,
"score_of_the_acc": -1.5676,
"final_rank": 14
},
{
"submission_id": "aoj_0097_4293477",
"code_snippet": "#include <iostream>\n#include <stdlib.h>\nusing namespace std;\n\nint main(void){\n //long table[11][101][1001];\n long **table[11];\n for(int i=0;i<=10;i++){\n table[i]=(long **)malloc(101*(sizeof(long *)));\n for(int j=0;j<=100;j++){\n table[i][j]=(long *)malloc(1001*sizeof(long));\n }\n }\n for(int i=0;i<=10;i++){\n for(int j=0;j<=100;j++){\n for(int s=0;s<=1000;s++){\n table[i][j][s]=0;\n }\n }\n }\n\n for(int j=0;j<=100;j++){\n table[1][j][j]=1;\n }\n\n for(int i=2;i<=10;i++){\n for(int j=0;j<=100;j++){\n for(int s=0;s<=1000;s++){\n if(s>=j){\n for(int k=0;k<j;k++){\n table[i][j][s]+=table[i-1][k][s-j];\n }\n }\n }\n }\n }\n\n int n,s;\n while(true){\n cin>>n>>s;\n if(n==0 and s==0){break;}\n long retval=0;\n for(int j=0;j<=100;j++){\n retval+=table[n][j][s];\n }\n cout<<retval<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 11796,
"score_of_the_acc": -0.1974,
"final_rank": 10
},
{
"submission_id": "aoj_0097_4293475",
"code_snippet": "#include <iostream>\n#include <stdlib.h>\nusing namespace std;\n\nint main(void){\n //long table[11][101][1001];\n long **table[11];\n for(int i=0;i<=10;i++){\n table[i]=(long**)malloc(101*(sizeof(long*)));\n for(int j=0;j<=100;j++){\n table[i][j]=(long*)malloc(1001*sizeof(long));\n }\n }\n for(int i=0;i<=10;i++){\n for(int j=0;j<=100;j++){\n for(int s=0;s<=1000;s++){\n table[i][j][s]=0;\n }\n }\n }\n\n for(int j=0;j<=100;j++){\n table[1][j][j]=1;\n }\n\n for(int i=2;i<=10;i++){\n for(int j=0;j<=100;j++){\n for(int s=0;s<=1000;s++){\n if(s>=j){\n for(int k=0;k<j;k++){\n table[i][j][s]+=table[i-1][k][s-j];\n }\n }\n }\n }\n }\n\n int n,s;\n while(true){\n cin>>n>>s;\n if(n==0 and s==0){break;}\n int retval=0;\n for(int j=0;j<=100;j++){\n retval+=table[n][j][s];\n }\n cout<<retval<<endl;\n }\n return 0;\n}",
"accuracy": 0.5,
"time_ms": 30,
"memory_kb": 11784,
"score_of_the_acc": -0.1972,
"final_rank": 17
},
{
"submission_id": "aoj_0097_4232920",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nlong long memo[20][1010][110];\nlong long dp(int num,int sum,int cnt){\n if(num == n){\n if(sum == s) return 1;\n return 0;\n }\n if(memo[num][sum][cnt] != -1) return memo[num][sum][cnt];\n long long ret = 0;\n for(int i=cnt;i<=100;i++){\n if(sum+i > s) continue;\n ret += dp(num+1,sum+i,i+1);\n }\n return memo[num][sum][cnt] = ret;\n}\nint main(){\n \n while(cin >> n >> s,n!=0||s!=0){\n fill_n(**memo,20*1010*110,-1);\n cout << dp(0,0,0) << endl;\n }\n \n return(0);\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 20456,
"score_of_the_acc": -0.9461,
"final_rank": 11
},
{
"submission_id": "aoj_0097_4232900",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nint memo[20][1010][110];\nint dp(int num,int sum,int cnt){\n if(num == n){\n if(sum == s) return 1;\n return 0;\n }\n if(memo[num][sum][cnt] != -1) return memo[num][sum][cnt];\n int ret = 0;\n for(int i=cnt;i<=100;i++){\n if(sum+i > s) continue;\n ret += dp(num+1,sum+i,i+1);\n }\n return memo[num][sum][cnt] = ret;\n}\nint main(){\n \n while(cin >> n >> s,n!=0||s!=0){\n fill_n(**memo,20*1010*110,-1);\n cout << dp(0,0,0) << endl;\n }\n \n return(0);\n}",
"accuracy": 0.5,
"time_ms": 110,
"memory_kb": 11776,
"score_of_the_acc": -0.4133,
"final_rank": 18
},
{
"submission_id": "aoj_0097_4232838",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nint memo[20][1010][110];\nint dp(int num,int sum,int cnt){\n if(num == n && sum == s) return 1;\n if(memo[num][sum][cnt] != -1) return memo[num][sum][cnt];\n int ret = 0;\n for(int i=cnt;i<=100;i++){\n if(sum+i > s) continue;\n ret += dp(num+1,sum+i,i+1);\n }\n return memo[num][sum][cnt] = ret;\n}\nint main(){\n \n while(cin >> n >> s,n!=0&&s!=0){\n for(int i=0;i<=n;i++){\n for(int j=0;j<=s;j++){\n for(int k=0;k<=100;k++){\n memo[i][j][k] = -1;\n }\n }\n }\n cout << dp(0,0,0) << endl;\n }\n \n return(0);\n}",
"accuracy": 0.25,
"time_ms": 60,
"memory_kb": 4164,
"score_of_the_acc": -0.1427,
"final_rank": 20
}
] |
aoj_0098_cpp
|
Maximum Sum Sequence II
与えられた整数の行列
a
1,1
a
1,2
...
a
1,n
a
2,1
a
2,2
...
a
2,n
:
a
n,1
a
n,2
...
a
n, n
で、縦・横方向に１つ以上連続した項（部分行列）の和の最大値を出力して終了するプログラムを作成して下さい。
Input
入力データは以下の形式で与えられます。
n
a
1,1
a
1,2
...
a
1,n
a
2,1
a
2,2
...
a
2,n
:
a
n,1
a
n,2
...
a
n, n
n
は 1 以上 100 以下、
a
i,j
は -10000 以上 10000 以下です。
Output
最大値を 1 行に出力して下さい。
Sample Input 1
3
1 -2 3
-4 5 6
7 8 -9
Output for the Sample Input 1
16
この入力の場合、以下の部分行列の項の和が最大となります。
-4 5
7 8
Sample Input 2
4
1 3 -9 2
2 7 -1 5
-8 3 2 -1
5 0 -3 1
Output for the Sample Input 2
15
この入力の場合、以下の部分行列の項の和が最大となります。
7 -1 5
3 2 -1
|
[
{
"submission_id": "aoj_0098_9252043",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {break;}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n vv(ll, a, n+1, n+1, 0);\n rep(i, 1, n+1) rep(j, 1, n+1) cin >> a[i][j];\n rep(i, 1, n+1) rep(j, 2, n+1) a[i][j] += a[i][j-1];\n rep(i, 2, n+1) rep(j, 1, n+1) a[i][j] += a[i-1][j];\n ll ans = -inf;\n rep(sy, 1, n+1) rep(sx, 1, n+1) {\n rep(ey, sy, n+1) rep(ex, sx, n+1) {\n chmax(ans, a[ey][ex] - a[sy-1][ex] - a[ey][sx-1] + a[sy-1][sx-1]);\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3520,
"score_of_the_acc": -0.7236,
"final_rank": 14
},
{
"submission_id": "aoj_0098_8130818",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nint main() {\n ll N;\n cin>>N;\n vvll A(N+1,vll(N+1,0));\n rep(i,N)rep(j,N)cin>>A[i+1][j+1];\n rep(i,N)rep(j,N+1)A[i+1][j]+=A[i][j];\n rep(i,N+1)rep(j,N)A[i][j+1]+=A[i][j];\n ll an=-1e18;\n rep(i,N+1)rep(j,i){\n rep(p,N+1)rep(q,p){\n ll d=A[i][p]+A[j][q]-A[i][q]-A[j][p];\n an=max(an,d);\n }\n }\n cout<<an<<endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3520,
"score_of_the_acc": -0.7236,
"final_rank": 14
},
{
"submission_id": "aoj_0098_7441809",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tauto N=in();\n\tvvll M(N,vll(N)),S(N+1,vll(N+1,0));\n\tREP(i,N){\n\t\tREP(j,N){\n\t\t\tM[i][j]=in();\n\t\t}\n\t}\n\tREP(i,N){\n\t\tREP(j,N){\n\t\t\tS[i+1][j+1] = S[i+1][j]+M[i][j];\n\t\t}\n\t}\n\tREP(j,N+1){\n\t\tREP(i,N){\n\t\t\tS[i+1][j] += S[i][j];\n\t\t}\n\t}\n\n\tll A=-(1ll<<50);\n\tfor(ll h=1;h<=N;h++){\n\t\tfor(ll w=1;w<=N;w++){\n\t\t\tfor(ll v=0;v<=N-h;v++){\n\t\t\t\tfor(ll u=0;u<=N-w;u++){\n\t\t\t\t\tchmax(A,S[v+h][u+w]+S[v][u]-S[v+h][u]-S[v][u+w]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tout(A);\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3560,
"score_of_the_acc": -0.8049,
"final_rank": 16
},
{
"submission_id": "aoj_0098_6971231",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntemplate<class t> using vc = vector<t>;\ntemplate<class t> using vvc = vc<vc<t>>;\nusing pi = pair<int,int>;\nusing pl = pair<ll,ll>;\nusing vi = vc<int>;\nusing vvi = vvc<int>;\nusing vl = vc<ll>;\nusing vvl = vvc<ll>;\n\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\n#define irep(i,a,b) for (int i = (a); i > (b); i--)\n#define all(a) a.begin(),a.end()\n#define print(n) cout << n << '\\n'\n#define pritn(n) print(n)\n#define printv(n,a) {copy(all(n),ostream_iterator<a>(cout,\" \")); cout<<\"\\n\";}\n#define printvv(n,a) {for(auto itr:n) printv(itr,a);}\n#define rup(a,b) (a+b-1)/b\n#define input(A,N) rep(i,0,N) cin>>A[i]\n#define chmax(a,b) a = max(a,b)\n#define chmin(a,b) a = min(a,b)\n\n\nint main(){\n cout << fixed << setprecision(15);\n \n int n;\n cin>>n;\n vvi a(n,vi(n));\n rep(i,0,n){\n rep(j,0,n){\n cin>>a[i][j];\n }\n }\n vvi sum(n+1,vi(n+1,0));\n int now = 0;\n rep(i,0,n)rep(j,0,n)sum[i+1][j+1]=a[i][j];\n rep(i,0,n)rep(j,0,n+1)sum[i+1][j]+=sum[i][j];\n rep(i,0,n+1)rep(j,0,n)sum[i][j+1]+=sum[i][j];\n //printvv(sum,int);\n\n int ans = -(int)1e9;\n \n for(int i = 1;i<n+1;i++){\n for(int j = 1;j<n+1;j++){\n for(int k = 0;k<i;k++){\n for(int l = 0;l<j;l++){\n chmax (ans,sum[i][j]-sum[i][l]-sum[k][j]+sum[k][l]);\n }\n }\n }\n }\n print(ans);\n \n //system(\"pause\");\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3512,
"score_of_the_acc": -0.7073,
"final_rank": 13
},
{
"submission_id": "aoj_0098_6960249",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cmath>\n\n#define N 100\n\nusing namespace std;\n\nint memo[N][N];\n\nint main() {\n int n, in[N][N];\n cin >> n;\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n cin >> in[i][j];\n }\n }\n\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n if(i == 0 && j == 0) {\n memo[i][j] = in[i][j];\n } else if(i == 0) {\n memo[i][j] = memo[i][j - 1] + in[i][j];\n } else if(j == 0) {\n memo[i][j] = memo[i - 1][j] + in[i][j];\n } else {\n memo[i][j] = memo[i - 1][j] + memo[i][j - 1] - memo[i - 1][j - 1] + in[i][j];\n }\n }\n }\n\n int ans = -10000;\n for(int si = 0; si < n; si++) {\n for(int sj = 0; sj < n; sj++) {\n for(int i = si; i < n; i++) {\n for(int j = sj; j < n; j++) {\n int n = memo[i][j];\n if(si > 0) {\n n -= memo[si - 1][j];\n }\n\n if(sj > 0) {\n n -= memo[i][sj - 1];\n }\n if(si > 0 && sj > 0){\n n += memo[si - 1][sj - 1];\n }\n\n ans = max(ans, n);\n }\n }\n }\n }\n\n cout << ans << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3164,
"score_of_the_acc": -0.2857,
"final_rank": 3
},
{
"submission_id": "aoj_0098_6854399",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define REP(i, a, b) for (int i = a; i < b; i++)\n\nint main(){\n int n; cin >> n;\n vector<vector<int> > A(n,vector<int>(n));\n rep(i,n)\n rep(j,n) cin >> A[i][j];\n\n vector<vector<long long> > accumA(n+1,vector<long long>(n+1,0));\n \n rep(i,n)\n rep(j,n)\n accumA[i+1][j+1] = accumA[i+1][j] + accumA[i][j+1] - accumA[i][j] + A[i][j];\n\n\n long long ans = -1000000;\n rep(i,n+1)\n rep(j,n+1)\n rep(k,i)\n rep(l,j)\n ans = max(ans, accumA[i][j] - accumA[i][l] - accumA[k][j] + accumA[k][l]);\n\n cout << ans << endl;\n\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3252,
"score_of_the_acc": -0.3217,
"final_rank": 4
},
{
"submission_id": "aoj_0098_6380655",
"code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcountll(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\nint msb(ll v){return 63-__builtin_clzll(v);}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\n//2次元累積和\ntemplate< class T > struct CumulativeSum2D{\n vector<vector<T>> data;\n CumulativeSum2D(int H, int W) : data(H + 1, vector<T>(W + 1, 0)) {}\n void add(int y, int x, int z){\n y++, x++;\n if(y>=data.size()||x>=data[0].size())return;\n data[y][x]+=z;\n }\n void build(){\n for(int i=1;i<data.size();i++) {\n for(int j=1;j<data[i].size();j++) {\n data[i][j]+=data[i][j-1]+data[i-1][j]-data[i-1][j-1];\n }\n }\n }\n T query(int sy,int sx,int gy, int gx){\n return (data[gy][gx]-data[sy][gx]-data[gy][sx]+data[sy][sx]);\n }\n};\n\nint main(){\n INT(n);\n CumulativeSum2D<ll> S(n,n);\n int v;\n rep(y,n){\n rep(x,n){\n in(v);\n S.add(y,x,v);\n }\n }\n S.build();\n ll ans=-INF2;\n for(int lx=0;lx<n;lx++){\n for(int rx=lx+1;rx<=n;rx++){\n for(int ly=0;ly<n;ly++){\n for(int ry=ly+1;ry<=n;ry++){\n chmax(ans,S.query(ly,lx,ry,rx));\n }\n }\n }\n }\n out(ans);\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3656,
"score_of_the_acc": -1.1429,
"final_rank": 19
},
{
"submission_id": "aoj_0098_6241815",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n;\n cin >> n;\n\n vector<vector<int>> a(n + 1, vector<int>(n + 1, 0));\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n cin >> a.at(i).at(j);\n }\n }\n\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n a.at(i).at(j) += a.at(i).at(j - 1);\n }\n }\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n a.at(i).at(j) += a.at(i - 1).at(j);\n }\n }\n\n int ans = -2e9;\n for (int i1 = 1; i1 <= n; i1++) {\n for (int j1 = 1; j1 <= n; j1++) {\n for (int i2 = 0; i2 < i1; i2++) {\n for (int j2 = 0; j2 < j1; j2++) {\n ans = max(ans, a[i1][j1] - a[i1][j2] - a[i2][j1] + a[i2][j2]);\n }\n }\n }\n }\n\n cout << ans << '\\n';\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3468,
"score_of_the_acc": -0.6179,
"final_rank": 12
},
{
"submission_id": "aoj_0098_5725821",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint n,a[100][100],sum[101][101]={};\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tcin>>a[i][j];\n\t\t\tsum[i+1][j+1]=sum[i+1][j]+sum[i][j+1]-sum[i][j]+a[i][j];\n\t\t}\n\t}\n\tint ans=-inf;\n\tfor(int i=0;i<n;i++)\n\t\tfor(int j=0;j<n;j++)\n\t\t\tfor(int k=i+1;k<=n;k++)\n\t\t\t\tfor(int l=j+1;l<=n;l++)\n\t\t\t\t\tans=max(ans,sum[k][l]-sum[k][j]-sum[i][l]+sum[i][j]);\n\tcout<<ans<<endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3596,
"score_of_the_acc": -0.878,
"final_rank": 17
},
{
"submission_id": "aoj_0098_5316528",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n; cin >> n;\n ll ans = -1e18;\n vector<vector<ll>> a(n, vector<ll> (n));\n rep(i,n)rep(j,n) cin >> a[i][j];\n vector<vector<ll>> s(n + 1, vector<ll>(n + 1, 0));\n rep(i,n)rep(j,n) s[i + 1][j + 1] = s[i][j + 1] + s[i + 1][j] - s[i][j] + a[i][j];\n rep(i,n+1)rep(j,n+1)rep(k,n+1)rep(l,n+1)if(i <= k && j <= l && i && j){\n ans = max(ans, s[k][l] - s[i-1][l] - s[k][j-1] + s[i-1][j-1]);\n }\n cout << ans << endl;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3256,
"score_of_the_acc": -1.187,
"final_rank": 20
},
{
"submission_id": "aoj_0098_5058003",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing pint = pair<int,int>;\n\ntemplate<class T> class CumulativeSum2D { private:\n\tint H, W;\n\tvector<vector<T>> G;\npublic:\n\tCumulativeSum2D(){};\n\tCumulativeSum2D(const vector<vector<T>>& g) {\n\t\tH = g.size();\n\t\tW = g[0].size();\n\t\tG.resize(H + 1, vector<T>(W + 1));\n\t\tfor(int i = 0; i < H; i++) {\n\t\t\tfor(int j = 0; j < W; j++) {\n\t\t\t\tG[i + 1][j + 1] = G[i + 1][j] + G[i][j + 1] - G[i][j] + g[i][j];\n\t\t\t}\n\t\t}\n\t}\n\n\t//[(y1, x1) ~ (y2, x2))\n\tT get(int y1, int x1, int y2, int x2) {\n\t\treturn G[y2][x2] - G[y1][x2] - G[y2][x1] + G[y1][x1];\n\t}\n};\n\nint main()\n{\n\tint N; cin >> N;\n\tvector<vector<int>> g(N, vector<int>(N));\n\tfor(int i = 0; i < N; i++) for(int j = 0; j < N; j++) cin >> g[i][j];\n\tCumulativeSum2D<int> cum(g);\n\n\tint ans = cum.get(0, 0, N, N);\n\tfor(int i = 0; i <= N; i++) {\n\t\tfor(int j = i + 1; j <= N; j++) {\n\t\t\tfor(int k = 0; k <= N; k++) {\n\t\t\t\tfor(int l = k + 1; l <= N; l++) {\n\t\t\t\t\tans = max(ans, cum.get(i, k, j, l));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << ans << endl;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3456,
"score_of_the_acc": -0.5935,
"final_rank": 11
},
{
"submission_id": "aoj_0098_4946185",
"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;\nconst int mod = 1000000007;\nconst int inf = (1<<30);\nint main(){\n\tint n;\n\tcin>>n;\n\tint a[n][n]={};\n\trep(i,n){\n\t\trep(j,n){\n\t\t\tcin>>a[i][j];\n\t\t}\n\t}\n\tint dp[n+1][n+1]={};\n\tfor(int i=1; i<=n; i++) dp[1][i]=dp[1][i-1]+a[0][i-1];\n\t\n\tfor(int i=1; i<=n; i++) dp[i][1]=dp[i-1][1]+a[i-1][0];\n\t\n\tfor(int i=2; i<=n; i++){\n\t\tfor(int j=2; j<=n; j++){\n\t\t\tdp[i][j]=dp[i-1][j]+dp[i][j-1]+a[i-1][j-1]-dp[i-1][j-1];\n\t\t}\n\t}\n\t/*\n\trep(i,n+1){\n\t\trep(j,n+1){\n\t\t\tcout<<dp[i][j]<<\" \";\n\t\t}\n\t\tcout<<endl;\n\t}\n\t*/\n\tint t=0;\n\tint ans=-inf;\n\tfor(int h=1; h<=n; h++){\n\t\tfor(int i=1; i<=n; i++){\n\t\t\tfor(int j=0; j<=h-1; j++){\n\t\t\t\tfor(int k=0; k<=i-1; k++){\n\t\t\t\t\tt=dp[h][i]+dp[j][k]-dp[j][i]-dp[h][k];\n\t\t\t\t\tans=max(ans,t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3176,
"score_of_the_acc": -0.1672,
"final_rank": 1
},
{
"submission_id": "aoj_0098_4890789",
"code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\nusing ll = long long;\nusing Graph = vector<vector<int>>;\n\n#define rep(i,m,n) for(int (i)=(m);(i)<(n);++(i))\n#define rrep(i,m,n) for(int (i)=(n)-1;(i)>=(m);--(i))\n#define all(x) (x).begin(),(x).end()\n#define out(y,x,h,w) (y)<0||(x)<0||(y)>=(h)||(x)>=(w)\n\nconstexpr ll INF = (ll)1e10;\nconstexpr ll mod = (ll)1e9 + 7;\nconstexpr double PI = 3.1415926535897932;\n\ntemplate<class T>inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T>inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ninline void init() {\n cin.tie(nullptr); cout.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n}\n\n\n\n//二次元累積和\nstruct AccSum2D {\n vector<vector<ll>>v;\n int H, W;\n AccSum2D(vector<vector<ll>>& vec) {\n H = vec.size();\n W = vec[0].size();\n v.resize(H + 1, vector<ll>(W + 1));\n rep(i, 0, H) {\n rep(j, 0, W) {\n v[i + 1][j + 1] = vec[i][j];\n }\n }\n\n //横に累積和\n rep(i, 0, H)rep(j, 0, W)v[i + 1][j + 1] += v[i + 1][j];\n //縦に累積和\n rep(i, 0, H)rep(j, 0, W)v[j + 1][i + 1] += v[j][i + 1];\n\n }\n //0-indexed\n ll sum(ll y1, ll x1, ll y2, ll x2) {\n ++y1; ++x1; ++y2; ++x2;\n return v[y2][x2] - v[y1 - 1][x2] - v[y2][x1 - 1] + v[y1 - 1][x1 - 1];\n }\n \n};\n\nint main() {\n init();\n\n int n; cin >> n;\n vector<vector<ll>>vec(n, vector<ll>(n));\n rep(i, 0, n)rep(j, 0, n)cin >> vec[i][j];\n AccSum2D Ac(vec);\n ll ans = -INF;\n rep(y1, 0, n)rep(x1, 0, n)rep(y2, y1, n)rep(x2, x1, n)chmax(ans, Ac.sum(y1, x1, y2, x2));\n\n cout << ans << \"\\n\";\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3624,
"score_of_the_acc": -0.935,
"final_rank": 18
},
{
"submission_id": "aoj_0098_4879915",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\n#ifdef _DEBUG\n#define PRE_COMMAND \\\n std::cin.rdbuf(in.rdbuf()); \\\n std::cout << fixed << setprecision(15);\n#else\n#define PRE_COMMAND cout << fixed << setprecision(15);\n#endif\nconst double EPS = 1e-10, PI = acos(-1.0);\ntemplate <class T> auto MAX(T& seq) {\n return *max_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto MIN(T& seq) {\n return *min_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto SUM(T& seq) {\n T temp{0};\n auto& temp2 = temp[0];\n return accumulate(seq.begin(), seq.end(), temp2);\n}\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\n sort(seq.begin(), seq.end(), sort_order);\n}\ntemplate <class T> void SORTR(vector<T>& seq) {\n sort(seq.begin(), seq.end(), greater<T>());\n}\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\n while (k) {\n if (k & 1) now = (now * n) % mod;\n n = (n * n) % mod;\n k >>= 1;\n }\n return now;\n}\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\n for (T& x : vec) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n if (!v.size()) return os;\n typename vector<T>::const_iterator ii = v.begin();\n os << *ii++;\n for (; ii != v.end(); ++ii) os << \" \" << *ii;\n return os;\n}\n// 累積和を求める関数\n// 入力は配列と、最初に0を入れるか\ntemplate <class T> vector<T> accumulate(vector<T>& v, bool zero_start = true) {\n int n = (int)v.size();\n T sum = 0;\n vector<T> ret(n + zero_start, 0);\n for (int i = 0; i < n; i++) {\n sum += v[i];\n ret[i + zero_start] = sum;\n }\n return ret;\n}\ntemplate <class T>\nvector<vector<T>> accumulate(vector<vector<T>>& v, bool zero_start = true) {\n int h = (int)v.size(), w = (int)v[0].size();\n T sum = 0;\n vector<vector<T>> ret(h + zero_start, vector<T>(w + zero_start, 0));\n for (int i = 0; i < h; i++) {\n T sum = 0;\n for (int j = 0; j < w; j++) {\n sum += v[i][j];\n ret[i + zero_start][j + zero_start] = sum;\n }\n }\n for (int j = zero_start; j < w + zero_start; j++) {\n T sum = 0;\n for (int i = +zero_start; i < h + zero_start; i++) {\n sum += ret[i][j];\n ret[i][j] = sum;\n }\n }\n return ret;\n}\n// [a, b)x[c, d)を求める\ntemplate <class T> T calc(vector<vector<T>>& v, int a, int b, int c, int d) {\n return v[a][b] + v[c][d] - v[a][d] - v[c][b];\n}\n\nint main() {\n PRE_COMMAND\n int n;\n cin >> n;\n vector<vector<int>> a(n, vector<int>(n));\n cin >> a;\n vector<vector<int>> b(n + 1, vector<int>(n + 1));\n b = accumulate(a);\n int ans = -100000000;\n REP(i, n) {\n REP(j, n) {\n FOR(k, i + 1, n + 1) {\n FOR(l, j + 1, n + 1) ans = max(ans, calc(b, i, j, k, l));\n }\n }\n }\n cout << ans << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3292,
"score_of_the_acc": -0.403,
"final_rank": 8
},
{
"submission_id": "aoj_0098_4863554",
"code_snippet": "#include <iostream> \n#include<vector>\n#include<algorithm>\n#include<map>\n#include<string>\n#include<iomanip>\n#include<set>\n#include<queue>\n#include<deque>\n#include<sstream>\n#include<cmath>\n#include<bitset>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define req(i,n) for(int i = 1;i <= n; i++)\n#define rrep(i,n) for(int i = n-1;i >= 0;i--)\n#define ALL(obj) begin(obj), end(obj)\n#define RALL(a) rbegin(a),rend(a)\ntypedef long long int ll;\ntypedef long double ld;\ntemplate<typename A, size_t N, typename T>\nvoid Fill(A(&array)[N], const T& val) {\n std::fill((T*)array, (T*)(array + N), val);\n}\nconst int inf = 1 << 31 - 1;\nconst ll MOD = 1000000007;\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; }\nint main(void) {\n int n; cin >> n; vector<vector<int>> v(n+1,vector<int>(n+1,0));\n req(i, n) req(j,n){\n cin >> v[i][j];\n }rep(i, n+1) rep(j, n) v[i][j + 1] += v[i][j];\n rep(i, n) rep(j, n + 1) v[i + 1][j] += v[i][j];\n int sum = -inf;\n req(i, n) req(j, n) rep(k, i) rep(l, j) {\n chmax(sum, v[i][j] - v[i][l] - v[k][j] + v[k][l]);\n }cout << sum << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3216,
"score_of_the_acc": -0.2485,
"final_rank": 2
},
{
"submission_id": "aoj_0098_4809013",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i=0; i<n; i++)\n#define pb push_back\n#define int long long\n\nint n;\nint acc[110][110];\n \nsigned main() {\n cin.tie(0); ios::sync_with_stdio(false);\n cin >> n;\n rep(i, n) rep(j, n) {\n int a; cin >> a;\n acc[i+1][j+1] = acc[i+1][j]+acc[i][j+1]-acc[i][j]+a;\n }\n int ans = -1000000;\n rep(i, n) rep(j, n) for (int k=i; k<n; k++) for (int l=j; l<n; l++) {\n ans = max(ans, acc[k+1][l+1]-acc[k+1][j]-acc[i][l+1]+acc[i][j]);\n }\n cout << ans << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3308,
"score_of_the_acc": -0.4355,
"final_rank": 9
},
{
"submission_id": "aoj_0098_4570183",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst int inf = 1001001001;\nint main(){\n int n,i,j,k,l,ans = -inf;scanf(\"%d\",&n);\n int rp[n+1][n+1];\n for(i=0;i<=n;i++) rp[0][i] = rp[i][0] = 0;\n for(i=1;i<=n;i++){\n for(j=1;j<=n;j++) scanf(\"%d\",&rp[i][j]);\n }\n for(i=1;i<=n;i++){\n for(j=2;j<=n;j++) rp[i][j] += rp[i][j-1];\n }\n for(i=1;i<=n;i++){\n for(j=2;j<=n;j++) rp[j][i] += rp[j-1][i];\n }\n for(i=1;i<=n;i++){\n for(j=i;j<=n;j++){\n for(k=1;k<=n;k++){\n for(l=k;l<=n;l++) ans = max(ans,rp[j][l]-rp[j][k-1]-rp[i-1][l]+rp[i-1][k-1]);\n }\n }\n }\n printf(\"%d\\n\",ans);\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3256,
"score_of_the_acc": -0.3298,
"final_rank": 5
},
{
"submission_id": "aoj_0098_4488508",
"code_snippet": "#define _USE_MATH_DEFINES\n#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\t\tusing ld = long double;\nusing VB = vector<bool>;\tusing VVB = vector<VB>;\nusing VI = vector<int>;\t\tusing VVI = vector<VI>;\nusing VL = vector<ll>;\t\tusing VVL = vector<VL>;\nusing VS = vector<string>;\tusing VD = vector<ld>;\nusing PII = pair<int, int>;\tusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\tusing VPL = vector<PLL>;\ntemplate<class T>using PQ = priority_queue<T>;\ntemplate<class T>using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = (int)1e9;\nconstexpr ll inf_ll = (ll)1e18, MOD = 1000000007;\nconstexpr ld PI = M_PI, EPS = 1e-12;\n\n// --- input --- //\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Input {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\ttemplate<class T>static void i(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void i(char& v) {\n\t\twhile (isspace(v = gc()));\n\t}\n\tstatic void i(bool& v) {\n\t\tv = in<char>() != '0';\n\t}\n\tstatic void i(string& v) {\n\t\tv.clear(); char c; for (i(c); !isspace(c); c = gc())v += c;\n\t}\n\tstatic void i(int& v) {\n\t\tbool neg = false; v = 0; char c; i(c);\n\t\tif (c == '-') { neg = true; c = gc(); }\n\t\tfor (; isdigit(c); c = gc())v = v * 10 + (c - '0');\n\t\tif (neg)v = -v;\n\t}\n\tstatic void i(long long& v) {\n\t\tbool neg = false; v = 0; char c; i(c);\n\t\tif (c == '-') { neg = true; c = gc(); }\n\t\tfor (; isdigit(c); c = gc())v = v * 10 + (c - '0');\n\t\tif (neg)v = -v;\n\t}\n\tstatic void i(double& v) {\n\t\tdouble dp = 1; bool neg = false, adp = false; v = 0; char c; i(c);\n\t\tif (c == '-') { neg = true; c = gc(); }\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.')adp = true;\n\t\t\telse if (adp)v += (c - '0') * (dp *= 0.1);\n\t\t\telse v = v * 10 + (c - '0');\n\t\t}\n\t\tif (neg)v = -v;\n\t}\n\tstatic void i(long double& v) {\n\t\tlong double dp = 1; bool neg = false, adp = false; v = 0; char c; i(c);\n\t\tif (c == '-') { neg = true; c = gc(); }\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.')adp = true;\n\t\t\telse if (adp)v += (c - '0') * (dp *= 0.1);\n\t\t\telse v = v * 10 + (c - '0');\n\t\t}\n\t\tif (neg)v = -v;\n\t}\n\ttemplate<class T, class U>static void i(pair<T, U>& v) {\n\t\ti(v.first); i(v.second);\n\t}\n\ttemplate<class T>static void i(vector<T>& v) {\n\t\tfor (auto& e : v)i(e);\n\t}\n\tstruct InputV {\n\t\tint n, m;\n\t\tInputV(int _n) :n(_n), m(0) {}\n\t\tInputV(const pair<int, int>& nm) :n(nm.first), m(nm.second) {}\n\t\ttemplate<class T>operator vector<T>() {\n\t\t\tvector<T> v(n); i(v); return v;\n\t\t}\n\t\ttemplate<class T>operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m)); i(v); return v;\n\t\t}\n\t};\npublic:\n\tstatic string get_line() {\n\t\tstring v; char c;\n\t\tfor (i(c); c != '\\n' && c != '\\0'; c = gc())v += c;\n\t\treturn v;\n\t}\n\ttemplate<class T>static T in() {\n\t\tT v; i(v); return v;\n\t}\n\ttemplate<class T>operator T()const {\n\t\treturn in<T>();\n\t}\n\tint operator--(int)const {\n\t\treturn in<int>() - 1;\n\t}\n\tInputV operator[](int n)const {\n\t\treturn InputV(n);\n\t}\n\tInputV operator[](const pair<int, int>& n)const {\n\t\treturn InputV(n);\n\t}\n\tvoid operator()()const {}\n\ttemplate<class H, class...T>void operator()(H&& h, T&& ...t)const {\n\t\ti(h); operator()(forward<T>(t)...);\n\t}\n}in;\n#define input(T) Input::in<T>()\n#define INT input(int)\n#define LL input(ll)\n#define STR input(string)\n#define inputs(T, ...) T __VA_ARGS__; in(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(ll, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n\n// --- output --- //\nstruct BoolStr {\n\tconst char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {}\n}Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {}\n}spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"), no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{ Yes }; DivStr D{ spc };\n\tvoid p(int v)const {\n\t\tif (v < 0)putchar_unlocked('-'), v = -v;\n\t\tchar b[10]; int i = 0;\n\t\twhile (v)b[i++] = '0' + v % 10, v /= 10;\n\t\tif (!i)b[i++] = '0';\n\t\twhile (i--)putchar_unlocked(b[i]);\n\t}\n\tvoid p(ll v)const {\n\t\tif (v < 0)putchar_unlocked('-'), v = -v;\n\t\tchar b[20]; int i = 0;\n\t\twhile (v)b[i++] = '0' + v % 10, v /= 10;\n\t\tif (!i)b[i++] = '0';\n\t\twhile (i--)putchar_unlocked(b[i]);\n\t}\n\tvoid p(bool v)const {\n\t\tp(v ? B.t : B.f);\n\t}\n\tvoid p(char v)const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid p(const char* v)const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid p(double v)const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid p(ld v)const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate<class T> void p(const T& v)const {\n\t\tcout << v;\n\t}\n\ttemplate<class T, class U>void p(const pair<T, U>& v)const {\n\t\tp(v.first); p(D.d); p(v.second);\n\t}\n\ttemplate<class T>void p(const vector<T>& v)const {\n\t\trep(i, sz(v)) { if (i)p(D.d); p(v[i]); }\n\t}\n\ttemplate<class T>void p(const vector<vector<T>>& v)const {\n\t\trep(i, sz(v)) { if (i)p(D.l); p(v[i]); }\n\t}\npublic:\n\tOutput& operator()() {\n\t\tp(D.l); return *this;\n\t}\n\ttemplate<class H>Output& operator()(H&& h) {\n\t\tp(h); p(D.l); return *this;\n\t}\n\ttemplate<class H, class...T>Output& operator()(H&& h, T&& ...t) {\n\t\tp(h); p(D.d); return operator()(forward<T>(t)...);\n\t}\n\ttemplate<class It>Output& range(const It& l, const It& r) {\n\t\tfor (It i = l; i != r; i++) { if (i != l)p(D.d); p(*i); } p(D.l); return *this;\n\t}\n\ttemplate<class T>Output& range(const T& a) {\n\t\trange(a.begin(), a.end()); return *this;\n\t}\n\ttemplate<class...T>void exit(T&& ...t) {\n\t\toperator()(forward<T>(t)...); std::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout); return *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b; return *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d; return *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f); return *this;\n\t}\n}out;\n\n// --- step --- //\ntemplate<class T>struct Step {\n\tclass It {\n\t\tT a, b, c;\n\tpublic:\n\t\tconstexpr It() : a(T()), b(T()), c(T()) {}\n\t\tconstexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}\n\t\tconstexpr It& operator++() {\n\t\t\t--b; a += c; return *this;\n\t\t}\n\t\tconstexpr It operator++(int) {\n\t\t\tIt tmp = *this; --b; a += c; return tmp;\n\t\t}\n\t\tconstexpr const T& operator*()const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const T* operator->()const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const It& i)const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const It& i)const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr T start()const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr T count()const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr T step()const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(T b, T c, T s) : be(b, c, s) {}\n\tconstexpr It begin()const {\n\t\treturn be;\n\t}\n\tconstexpr It end()const {\n\t\treturn en;\n\t}\n\tconstexpr T start()const {\n\t\treturn be.start();\n\t}\n\tconstexpr T count()const {\n\t\treturn be.count();\n\t}\n\tconstexpr T step()const {\n\t\treturn be.step();\n\t}\n\tconstexpr T sum()const {\n\t\treturn start() * count() + step() * (count() * (count() - 1) / 2);\n\t}\n\toperator vector<T>()const {\n\t\treturn as_vector();\n\t}\n\ttemplate<class F>void each(const F& f)const {\n\t\tfor (T i : *this)f(i);\n\t}\n\tauto as_vector()const {\n\t\tvector<T> res; res.reserve(count()); each([&](T i) {res.push_back(i); }); return res;\n\t}\n\ttemplate<class F, class U = decay_t<result_of_t<F(T)>>>auto map(const F& f)const {\n\t\tvector<U> res; res.reserve(count()); each([&](T i) {res.push_back(f(i)); }); return res;\n\t}\n\ttemplate<class F>auto select(const F& f)const {\n\t\tvector<T> res; each([&](T i) {if (f(i))res.push_back(i); }); return res;\n\t}\n\ttemplate<class F>int count_if(const F& f)const {\n\t\tint res = 0; each([&](T i) {if (f(i))++res; }); return res;\n\t}\n\ttemplate<class F>T find_if(const F& f)const {\n\t\tfor (T i : *this)if (f(i))return i; return 0;\n\t}\n\ttemplate<class F>auto max_by(const F& f)const {\n\t\tauto v = map(f); return *max_element(v.begin(), v.end());\n\t}\n\ttemplate<class F>auto min_by(const F& f)const {\n\t\tauto v = map(f); return *min_element(v.begin(), v.end());\n\t}\n\ttemplate<class F>bool all_of(const F& f)const {\n\t\tfor (T i : *this)if (!f(i))return false; return true;\n\t}\n\ttemplate<class F>bool any_of(const F& f)const {\n\t\tfor (T i : *this)if (f(i))return true; return false;\n\t}\n\ttemplate<class F, class U = decay_t<result_of_t<F(T)>>>auto sum(const F& f)const {\n\t\tU res = 0; each([&](T i) {res += static_cast<U>(f(i)); }); return res;\n\t}\n\tusing value_type = T;\n\tusing iterator = It;\nprivate:\n\tIt be, en;\n};\ntemplate<class T>inline constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate<class T>inline constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate<class T>inline constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n\n// --- functions --- //\ninline namespace {\n\ttemplate<class T>inline void Sort(T& a) {\n\t\tsort(all(a));\n\t}\n\ttemplate<class T>inline void RSort(T& a) {\n\t\tsort(rall(a));\n\t}\n\ttemplate<class T, class F>inline void Sort(T& a, const F& f) {\n\t\tsort(all(a), f);\n\t}\n\ttemplate<class T, class F>inline void RSort(T& a, const F& f) {\n\t\tsort(rall(a), f);\n\t}\n\ttemplate<class T>inline T Sorted(T a) {\n\t\tSort(a); return a;\n\t}\n\ttemplate<class T>inline T RSorted(T a) {\n\t\tRSort(a); return a;\n\t}\n\ttemplate<class T, class F>inline T Sorted(T& a, const F& f) {\n\t\tSort(a, f); return a;\n\t}\n\ttemplate<class T, class F>inline T RSorted(T& a, const F& f) {\n\t\tRSort(a, f); return a;\n\t}\n\ttemplate<class T, class F>inline void SortBy(T& a, const F& f) {\n\t\tsort(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });\n\t}\n\ttemplate<class T, class F>inline void RSortBy(T& a, const F& f) {\n\t\tsort(rall(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });\n\t}\n\ttemplate<class T>inline void Reverse(T& a) {\n\t\treverse(all(a));\n\t}\n\ttemplate<class T>inline void Unique(T& a) {\n\t\ta.erase(unique(all(a)), a.end());\n\t}\n\ttemplate<class T>inline void Uniq(T& a) {\n\t\tSort(a); Unique(a);\n\t}\n\ttemplate<class T>inline void Rotate(T& a, int left) {\n\t\trotate(a.begin(), a.begin() + left, a.end());\n\t}\n\ttemplate<class T>inline T Reversed(T a) {\n\t\tReverse(a); return a;\n\t}\n\ttemplate<class T>inline T Uniqued(T a) {\n\t\tUnique(a); return a;\n\t}\n\ttemplate<class T>inline T Uniqed(T a) {\n\t\tUniq(a); return a;\n\t}\n\ttemplate<class T>inline T Rotated(T a, int left) {\n\t\tRotate(a, left); return a;\n\t}\n\ttemplate<class T>inline auto Max(const T& a) {\n\t\treturn *max_element(all(a));\n\t}\n\ttemplate<class T>inline auto Min(const T& a) {\n\t\treturn *min_element(all(a));\n\t}\n\ttemplate<class T>inline int MaxPos(const T& a) {\n\t\treturn max_element(all(a)) - a.begin();\n\t}\n\ttemplate<class T>inline int MinPos(const T& a) {\n\t\treturn min_element(all(a)) - a.begin();\n\t}\n\ttemplate<class T, class F>inline auto MaxBy(const T& a, const F& f) {\n\t\treturn *max_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });\n\t}\n\ttemplate<class T, class F>inline auto MinBy(const T& a, const F& f) {\n\t\treturn *min_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });\n\t}\n\ttemplate<class T, class U>inline int Count(const T& a, const U& v) {\n\t\treturn count(all(a), v);\n\t}\n\ttemplate<class T, class F>inline int CountIf(const T& a, const F& f) {\n\t\treturn count_if(all(a), f);\n\t}\n\ttemplate<class T, class U>inline int Find(const T& a, const U& v) {\n\t\treturn find(all(a), v) - a.begin();\n\t}\n\ttemplate<class T, class F>inline int FindIf(const T& a, const F& f) {\n\t\treturn find_if(all(a), f) - a.begin();\n\t}\n\ttemplate<class T, class U = typename T::value_type>inline U Sum(const T& a) {\n\t\treturn accumulate(all(a), U());\n\t}\n\ttemplate<class T, class U>inline bool Includes(const T& a, const U& v) {\n\t\treturn find(all(a), v) != a.end();\n\t}\n\ttemplate<class T, class F>inline auto Sum(const T& v, const F& f) {\n\t\treturn accumulate(next(v.begin()), v.end(), f(*v.begin()), [&](auto a, auto b) {return a + f(b); });\n\t}\n\ttemplate<class T, class U>inline int Lower(const T& a, const U& v) {\n\t\treturn lower_bound(all(a), v) - a.begin();\n\t}\n\ttemplate<class T, class U>inline int Upper(const T& a, const U& v) {\n\t\treturn upper_bound(all(a), v) - a.begin();\n\t}\n\ttemplate<class T, class F>inline void RemoveIf(T& a, const F& f) {\n\t\ta.erase(remove_if(all(a), f), a.end());\n\t}\n\ttemplate<class F>inline auto Vector(size_t size, const F& f) {\n\t\tvector<decay_t<result_of_t<F(size_t)>>> res(size);\n\t\tfor (size_t i = 0; i < size; ++i)res[i] = f(i);\n\t\treturn res;\n\t}\n\ttemplate<class T>inline auto Grid(size_t h, size_t w, const T& v = T()) {\n\t\treturn vector<vector<T>>(h, vector<T>(w, v));\n\t}\n\ttemplate<class T>inline auto Slice(const T& v, size_t i, size_t len) {\n\t\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n\t}\n\ttemplate<class T, class F>inline auto Each(const T& v, F&& f) {\n\t\tfor (auto& i : v)f(i);\n\t}\n\ttemplate<class T, class F>inline auto Select(const T& v, const F& f) {\n\t\tT res;\n\t\tfor (const auto& e : v)if (f(e))res.push_back(e);\n\t\treturn res;\n\t}\n\ttemplate<class T, class F>inline auto Map(const T& v, F&& f) {\n\t\tvector<decay_t<result_of_t<F(typename T::value_type)>>> res(v.size());\n\t\tsize_t i = 0; for (const auto& e : v)res[i++] = f(e);\n\t\treturn res;\n\t}\n\ttemplate<class T, class F>inline auto MapIndex(const T& v, const F& f) {\n\t\tvector<decay_t<result_of_t<F(size_t, typename T::value_type)>>> res(v.size());\n\t\tsize_t i = 0; for (auto it = v.begin(); it != v.end(); ++it, ++i)res[i] = f(i, *it);\n\t\treturn res;\n\t}\n\ttemplate<class T, class F>inline auto TrueIndex(const T& v, const F& f) {\n\t\tvector<size_t> res;\n\t\tfor (size_t i = 0; i < v.size(); ++i)if (f(v[i]))res.push_back(i);\n\t\treturn res;\n\t}\n\ttemplate<class T, class U = typename T::value_type>inline auto Indexed(const T& v) {\n\t\tvector<pair<U, int>> res(v.size());\n\t\tfor (int i = 0; i < (int)v.size(); ++i)res[i] = make_pair(static_cast<U>(v[i]), i);\n\t\treturn res;\n\t}\n\tinline auto operator*(string s, size_t n) {\n\t\tstring res;\n\t\tfor (size_t i = 0; i < n; ++i)res += s;\n\t\treturn res;\n\t}\n\ttemplate<class T>inline auto& operator<<(vector<T>& v, const vector<T>& v2) {\n\t\tv.insert(v.end(), all(v2)); return v;\n\t}\n\ttemplate<class T>inline T Ceil(T n, T m) {\n\t\treturn (n + m - 1) / m;\n\t}\n\ttemplate<class T>inline T Ceil2(T n, T m) {\n\t\treturn Ceil(n, m) * m;\n\t}\n\ttemplate<class T>inline T Tri(T n) {\n\t\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n\t}\n\ttemplate<class T>inline T nC2(T n) {\n\t\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n\t}\n\ttemplate<class T>inline T Mid(const T& l, const T& r) {\n\t\treturn l + (r - l) / 2;\n\t}\n\tinline int pop_count(int n) {\n\t\treturn bitset<32>(n).count();\n\t}\n\tinline int pop_count(ll n) {\n\t\treturn bitset<64>(n).count();\n\t}\n\ttemplate<class T>inline bool chmax(T& a, const T& b) {\n\t\tif (a < b) { a = b; return true; } return false;\n\t}\n\ttemplate<class T>inline bool chmin(T& a, const T& b) {\n\t\tif (a > b) { a = b; return true; } return false;\n\t}\n\ttemplate<class T>inline bool inRange(const T& v, const T& min, const T& max) {\n\t\treturn min <= v && v < max;\n\t}\n\ttemplate<class T>inline bool isSquere(T n) {\n\t\tT s = sqrt(n); return s * s == n || (s + 1) * (s + 1) == n;\n\t}\n\ttemplate<class T = ll>inline T BIT(int b) {\n\t\treturn T(1) << b;\n\t}\n\ttemplate<class T>inline T Gcd(T n, T m) {\n\t\treturn m ? Gcd(m, n % m) : n;\n\t}\n\ttemplate<class T>inline T Lcm(T n, T m) {\n\t\treturn n / Gcd(n, m) * m;\n\t}\n\ttemplate<class T, class U = typename T::value_type>inline U Gcdv(const T& v) {\n\t\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd<U>);\n\t}\n\ttemplate<class T, class U = typename T::value_type>inline U Lcmv(const T& v) {\n\t\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm<U>);\n\t}\n\ttemplate<class T>inline T Pow(T a, T n) {\n\t\tT r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; } return r;\n\t}\n\ttemplate<class T>inline T Powmod(T a, T n, T m = MOD) {\n\t\tT r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r;\n\t}\n}\n\n// --- dump --- //\n#if __has_include(\"dump.hpp\")\n#include \"dump.hpp\"\n#else\n#define dump(...) ((void)0)\n#endif\n\n// ---------------------------------------------------------------- //\n\ntemplate<class T>class CulSum2D {\n\tint h, w; vector<vector<T>> s;\npublic:\n\tCulSum2D(const vector<vector<T>>& a) :h(a.size()), w(a.front().size()), s(h + 1, vector<T>(w + 1)) {\n\t\tfor (int i = 0; i < h; ++i)for (int j = 0; j < w; ++j)\n\t\t\ts[i + 1][j + 1] = s[i][j + 1] + s[i + 1][j] - s[i][j] + a[i][j];\n\t}\n\ttemplate<class U, class F>\n\tCulSum2D(const U& a, F f) : h(a.size()), w(a.front().size()), s(h + 1, vector<T>(w + 1)) {\n\t\tfor (int i = 0; i < h; ++i)for (int j = 0; j < w; ++j)\n\t\t\ts[i + 1][j + 1] = s[i][j + 1] + s[i + 1][j] - s[i][j] + static_cast<T>(f(a[i][j]));\n\t}\n\t// [y1, y2) * [x1, x2)\n\tT operator()(int y1, int y2, int x1, int x2) {\n\t\tx1 = min(max(x1, 0), w); x2 = min(max(x2, 0), w);\n\t\ty1 = min(max(y1, 0), h); y2 = min(max(y2, 0), h);\n\t\treturn (x1 > x2 || y1 > y2) ? 0 : s[y2][x2] - s[y1][x2] - s[y2][x1] + s[y1][x1];\n\t}\n\t// [0, y) * [0, x)\n\tT operator()(int y, int x) {\n\t\tx = min(max(x, 0), w); y = min(max(y, 0), h);\n\t\treturn s[y][x];\n\t}\n\tconst vector<vector<T>>& get_s() { return s; }\n};\n\nint main() {\n\tint n = in;\n\tVVI a = in[{n, n}];\n\tCulSum2D<int> sum(a);\n\tint ans = -inf;\n\trep(y1, n)FOR(y2, y1, n)rep(x1, n)FOR(x2, x1, n) {\n\t\tchmax(ans, sum(y1, y2 + 1, x1, x2 + 1));\n\t}\n\tout(ans);\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3252,
"score_of_the_acc": -0.4646,
"final_rank": 10
},
{
"submission_id": "aoj_0098_4354358",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n;\n cin >> n;\n vector<vector<int>> v(n+1, vector<int>(n+1, 0));\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n scanf(\"%d\", &v[i+1][j+1]);\n }\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j <= n; ++j) {\n v[i+1][j] += v[i][j];\n }\n }\n for (int i = 0; i <= n; ++i) {\n for (int j = 0; j < n; ++j) {\n v[i][j+1] += v[i][j];\n }\n }\n int ans = -INF<int>;\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n for (int k = i+1; k <= n; ++k) {\n for (int l = j+1; l <= n; ++l) {\n ans = max(ans, v[k][l]-v[k][j]-v[i][l]+v[i][j]);\n }\n }\n }\n }\n cout << ans << \"\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3276,
"score_of_the_acc": -0.3705,
"final_rank": 7
},
{
"submission_id": "aoj_0098_4311323",
"code_snippet": "#include <bits/stdc++.h>\n//typedef\n//-------------------------#include <bits/stdc++.h>\n\nconst double pi = 3.141592653589793238462643383279;\n\nusing namespace std;\n\n//conversion\n//------------------------------------------\ninline int toInt(string s)\n{\n int v;\n istringstream sin(s);\n sin >> v;\n return v;\n}\ntemplate <class T>\ninline string toString(T x)\n{\n ostringstream sout;\n sout << x;\n return sout.str();\n}\ninline int readInt()\n{\n int x;\n scanf(\"%d\", &x);\n return x;\n}\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\nconst double EPS = 1E-8;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\n\nclass UnionFind\n{\npublic:\n vector<int> par;\n vector<int> siz;\n\n UnionFind(int sz_) : par(sz_), siz(sz_, 1)\n {\n for (ll i = 0; i < sz_; ++i)\n par[i] = i;\n }\n void init(int sz_)\n {\n par.resize(sz_);\n siz.assign(sz_, 1LL);\n for (ll i = 0; i < sz_; ++i)\n par[i] = i;\n }\n\n int root(int x)\n {\n while (par[x] != x)\n {\n x = par[x] = par[par[x]];\n }\n return x;\n }\n\n bool merge(int x, int y)\n {\n x = root(x);\n y = root(y);\n if (x == y)\n return false;\n if (siz[x] < siz[y])\n swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y)\n {\n return root(x) == root(y);\n }\n\n int size(int x)\n {\n return siz[root(x)];\n }\n};\n\nll modPow(ll x, ll n, ll mod = MOD)\n{\n ll res = 1;\n while (n)\n {\n if (n & 1)\n res = (res * x) % mod;\n\n res %= mod;\n x = x * x % mod;\n n >>= 1;\n }\n return res;\n}\n\n#define SIEVE_SIZE 5000000 + 10\nbool sieve[SIEVE_SIZE];\nvoid makeSieve()\n{\n for (int i = 0; i < SIEVE_SIZE; ++i)\n sieve[i] = true;\n sieve[0] = sieve[1] = false;\n for (int i = 2; i * i < SIEVE_SIZE; ++i)\n if (sieve[i])\n for (int j = 2; i * j < SIEVE_SIZE; ++j)\n sieve[i * j] = false;\n}\n\nbool isprime(ll n)\n{\n if (n == 0 || n == 1)\n return false;\n for (ll i = 2; i * i <= n; ++i)\n if (n % i == 0)\n return false;\n return true;\n}\n\nconst int MAX = 2000010;\nlong long fac[MAX], finv[MAX], inv[MAX];\n\n// テーブルを作る前処理\nvoid COMinit()\n{\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++)\n {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\n// 二項係数計算\nlong long COM(int n, int k)\n{\n if (n < k)\n return 0;\n if (n < 0 || k < 0)\n return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nlong long extGCD(long long a, long long b, long long &x, long long &y)\n{\n if (b == 0)\n {\n x = 1;\n y = 0;\n return a;\n }\n long long d = extGCD(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\n// 負の数にも対応した mod (a = -11 とかでも OK)\ninline long long mod(long long a, long long m)\n{\n return (a % m + m) % m;\n}\n\n// 逆元計算 (ここでは a と m が互いに素であることが必要)\nlong long modinv(long long a, long long m)\n{\n long long x, y;\n extGCD(a, m, x, y);\n return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので\n}\nll GCD(ll a, ll b)\n{\n\n if (b == 0)\n return a;\n return GCD(b, a % b);\n}\n\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nmat mul(mat &A, mat &B)\n{\n mat C(A.size(), vec((int)B[0].size()));\n for (int i = 0; i < A.size(); ++i)\n {\n for (int k = 0; k < B.size(); ++k)\n {\n for (int j = 0; j < B[0].size(); ++j)\n {\n C[i][j] = (C[i][j] + A[i][k] % MOD * B[k][j] % MOD) % MOD;\n }\n }\n }\n return C;\n}\nmat matPow(mat A, ll n)\n{\n mat B(A.size(), vec((int)A.size()));\n\n for (int i = 0; i < A.size(); ++i)\n {\n B[i][i] = 1;\n }\n\n while (n > 0)\n {\n if (n & 1)\n B = mul(B, A);\n A = mul(A, A);\n n >>= 1;\n }\n return B;\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n\n int n;\n cin >> n;\n vector<vector<ll>> a(n + 2, vector<ll>(n + 2));\n REP(i, n)\n {\n REP(j, n)\n {\n cin >> a[i + 1][j + 1];\n }\n }\n\n REP(i, n + 1)\n {\n REP(j, n + 1)\n {\n a[i][j + 1] += a[i][j];\n }\n }\n REP(j, n + 1)\n {\n REP(i, n + 1)\n {\n a[i + 1][j] += a[i][j];\n }\n }\n // REP(i, n + 1)\n // {\n // REP(j, n + 1)\n // {\n // cout << a[i][j] << \" \";\n // }\n // cout << endl;\n // }\n ll mx = -(1LL << 60);\n for (int i = 0; i <= n; i++)\n {\n for (int j = 0; j <= n; j++)\n {\n for (int k = i + 1; k <= n; k++)\n {\n for (int l = j + 1; l <= n; l++)\n {\n mx = max(mx, a[k][l] - a[k][j] - a[i][l] + a[i][j]);\n }\n }\n }\n }\n cout << mx << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3272,
"score_of_the_acc": -0.3624,
"final_rank": 6
}
] |
aoj_0096_cpp
|
４つの整数の和 II
4,000 以下の正の整数
n
を入力し、0 〜 1000 の範囲の整数
a, b, c, d
の組で
a + b + c + d = n
を満たすものの組み合わせ数を出力するプログラムを作成して下さい。
Input
複数のデータセットが与えられます。各データセットに
n
が１行に与えられます。入力の最後まで処理して下さい。
データセットの数は 50 を超えません。
Output
各データセットごとに、
a, b, c, d
の組み合わせの個数を１行に出力して下さい。
Sample Input
2
3
35
Output for the Sample Input
10
20
8436
|
[
{
"submission_id": "aoj_0096_8861375",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n unsigned long long dp[4001][5];\n for (int i = 0; i < 5; i++)\n for (int j = 0; j < 4001; j++)\n dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;\n for (int i = 2; i <= 4; i++)\n for (int j = 0; j <= 4000; j++)\n for (int k = 0; k <= j; k++)\n dp[j][i] += dp[j - k][i - 1];\n int n;\n while (cin >> n)\n cout << dp[n][4] << endl;\n return 0;\n}",
"accuracy": 0.18181818181818182,
"time_ms": 10,
"memory_kb": 3248,
"score_of_the_acc": -0.0169,
"final_rank": 18
},
{
"submission_id": "aoj_0096_8810077",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n unsigned int dp[4001][5];\n for (unsigned int i = 0; i < 5; i++)\n for (unsigned int j = 0; j < 4001; j++)\n dp[j][i] = (i == 1 && j <= 1000) ? 1 : 0;\n for (unsigned int i = 2; i <= 4; i++)\n for (unsigned int j = 0; j <= 4000; j++)\n for (unsigned int k = 0; k <= j; k++)\n dp[j][i] += dp[j - k][i - 1];\n unsigned int n;\n while (cin >> n)\n cout << dp[n][4] << endl;\n return 0;\n}",
"accuracy": 0.18181818181818182,
"time_ms": 10,
"memory_kb": 3160,
"score_of_the_acc": -0.006,
"final_rank": 13
},
{
"submission_id": "aoj_0096_8720750",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REP1(i,x) for(int i=1;i<=(int)(x);i++)\n#define REP2(i,s,e) for(int i=(int)(s);i<=(int)(e);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREP1(i,x) for(int i=((int)(x));i>=1;i--)\n#define RREP2(i,s,e) for(int i=((int)(e));i>=(int)(s);i--)\n#define ALL(x) (x).begin(),(x).end()\n#define INF32 (1000001000)\n#define INF (4000000000000001000LL)\ntemplate<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }\n#define endl '\\n'\n\nint main() {\n const ll m = 1000;\n ll n;\n map<ll,ll> c;\n REP(a, m+1) {\n REP(b, m+1) {\n c[a+b]++;\n }\n }\n while (cin >> n) {\n ll ans = 0;\n for (auto [ab,count]: c) {\n if (c.find(n-ab) != c.end()) {\n ans += count*c[n-ab];\n }\n }\n cout << ans << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3564,
"score_of_the_acc": -0.0774,
"final_rank": 7
},
{
"submission_id": "aoj_0096_8214402",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int mod = 1e9 + 7;\nconst int maxn = 4001;\nconst int maxk = 5;\nunsigned long long dp[maxn][maxk];\n\nvoid precompute() {\n for (int i = 0; i < maxk; i++)\n for (int j = 0; j < maxn; j++)\n dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;\n for (int i = 2; i < maxk; i++)\n for (int j = 0; j < maxn; j++)\n for (int k = 0; k <= j && k <= 1000; k++)\n dp[j][i] = (dp[j][i] + dp[j - k][i - 1]) % mod;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n precompute();\n int n;\n while (cin >> n)\n cout << dp[n][4] << '\\n';\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3348,
"score_of_the_acc": -0.0399,
"final_rank": 4
},
{
"submission_id": "aoj_0096_8207112",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n unsigned long long dp[4001][5];\n for (int i = 0; i < 5; i++)\n for (int j = 0; j < 4001; j++)\n dp[j][i] = i == 1 && j <= 10001 ? 1 : 0;\n for (int i = 2; i <= 4; i++)\n for (int j = 0; j <= 4000; j++)\n for (int k = 0; k <= j && k <= 10002; k++)\n dp[j][i] += dp[j - k][i - 1];\n int n;\n while (cin >> n)\n cout << dp[n][4] << endl;\n return 0;\n}",
"accuracy": 0.18181818181818182,
"time_ms": 10,
"memory_kb": 3240,
"score_of_the_acc": -0.0159,
"final_rank": 16
},
{
"submission_id": "aoj_0096_8207107",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n unsigned long long dp[4001][5];\n for (int i = 0; i < 5; i++)\n for (int j = 0; j < 4001; j++)\n dp[j][i] = i == 1 && j <= 10001 ? 1 : 0;\n for (int i = 2; i <= 4; i++)\n for (int j = 0; j <= 4000; j++)\n for (int k = 0; k <= j && k <= 10001; k++)\n dp[j][i] += dp[j - k][i - 1];\n int n;\n while (cin >> n)\n cout << dp[n][4] << endl;\n return 0;\n}",
"accuracy": 0.18181818181818182,
"time_ms": 10,
"memory_kb": 3220,
"score_of_the_acc": -0.0135,
"final_rank": 15
},
{
"submission_id": "aoj_0096_8112306",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n unsigned long long dp[4001][5];\n for (int i = 0; i < 5; i++)\n for (int j = 0; j < 4001; j++)\n dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;\n for (int i = 2; i <= 4; i++)\n for (int j = 0; j <= 4000; j++)\n for (int k = 0; k <= j && k <= 2000; k++)\n dp[j][i] += dp[j - k][i - 1];\n int n;\n while (cin >> n)\n cout << dp[n][4] << endl;\n return 0;\n}",
"accuracy": 0.18181818181818182,
"time_ms": 10,
"memory_kb": 3244,
"score_of_the_acc": -0.0164,
"final_rank": 17
},
{
"submission_id": "aoj_0096_8112302",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n unsigned long long dp[4001][5];\n for (int i = 0; i < 5; i++)\n for (int j = 0; j < 4001; j++)\n dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;\n for (int i = 2; i <= 4; i++)\n for (int j = 0; j <= 4000; j++)\n for (int k = 0; k <= j; k++)\n dp[j][i] += dp[j - k][i - 1];\n int n;\n while (cin >> n)\n cout << dp[n][4] << endl;\n return 0;\n}",
"accuracy": 0.18181818181818182,
"time_ms": 10,
"memory_kb": 3208,
"score_of_the_acc": -0.012,
"final_rank": 14
},
{
"submission_id": "aoj_0096_8050221",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n vector<vector<unsigned long long>> dp(4001, vector<unsigned long long>(5, 0));\n for (int i = 0; i < 5; i++)\n for (int j = 0; j < 4001; j++)\n dp[j][i] = i == 1 && j <= 1000 ? 1 : 0;\n for (int i = 2; i <= 4; i++)\n for (int j = 0; j <= 4000; j++)\n for (int k = 0; k <= j && k <= 1000; k++)\n dp[j][i] += dp[j - k][i - 1];\n int n;\n while (cin >> n)\n cout << dp[n][4] << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3728,
"score_of_the_acc": -0.0767,
"final_rank": 6
},
{
"submission_id": "aoj_0096_7441708",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tll N;\n\twhile(cin>>N){\n\t\tvll X(2001,0);\n\t\tREP(i,1001){\n\t\t\tREP(j,1001){\n\t\t\t\tX[i+j]++;\n\t\t\t}\n\t\t}\n\t\tll S=0;\n\t\tREP(i,1001){\n\t\t\tREP(j,1001){\n\t\t\t\tll r=N-(i+j);\n\t\t\t\tif(r<0 || r>2000) continue;\n\t\t\t\tS += X[r];\n\t\t\t}\n\t\t}\n\t\tout(S);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3480,
"score_of_the_acc": -0.0774,
"final_rank": 8
},
{
"submission_id": "aoj_0096_6971216",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntemplate<class t> using vc = vector<t>;\ntemplate<class t> using vvc = vc<vc<t>>;\nusing pi = pair<int,int>;\nusing pl = pair<ll,ll>;\nusing vi = vc<int>;\nusing vvi = vvc<int>;\nusing vl = vc<ll>;\nusing vvl = vvc<ll>;\n\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\n#define irep(i,a,b) for (int i = (a); i > (b); i--)\n#define all(a) a.begin(),a.end()\n#define print(n) cout << n << '\\n'\n#define pritn(n) print(n)\n#define printv(n,a) {copy(all(n),ostream_iterator<a>(cout,\" \")); cout<<\"\\n\";}\n#define printvv(n,a) {for(auto itr:n) printv(itr,a);}\n#define rup(a,b) (a+b-1)/b\n#define input(A,N) rep(i,0,N) cin>>A[i]\n#define chmax(a,b) a = max(a,b)\n#define chmin(a,b) a = min(a,b)\n\n\nint main(){\n cout << fixed << setprecision(15);\n int n;\n while(cin>>n){\n int ans = 0;\n rep(i,0,1001){\n if(n<i) break;\n rep(j,0,1001){\n int m = n - i - j;\n if(m<0) break;\n if(m>2000) continue; \n ans += min(m,1000) - max(0,m-1000) + 1;\n }\n }\n print(ans);\n }\n \n //system(\"pause\");\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3368,
"score_of_the_acc": -0.0424,
"final_rank": 5
},
{
"submission_id": "aoj_0096_6380646",
"code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcountll(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\nint msb(ll v){return 63-__builtin_clzll(v);}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint main(){\n int n;\n while(cin>>n){\n vector<ll> dp(n+1,0);\n dp[0]=1;\n for(int i=0;i<4;i++){\n for(int j=n;j>=0;j--){\n for(int k=1;k<=1000&&j+k<=n;k++){\n dp[j+k]+=dp[j];\n }\n }\n }\n out(dp[n]);\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3628,
"score_of_the_acc": -0.2011,
"final_rank": 9
},
{
"submission_id": "aoj_0096_5079616",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n;\n while(cin >> n){\n vector<int> v;\n for(int i = 0; i <= min(1000, n); i++){\n for(int j = 0; j <= min(1000, n); j++){\n v.emplace_back(i + j);\n }\n }\n sort(v.begin(), v.end());\n\n ll ans = 0;\n rep(i,v.size()){\n if(v[i] > n) break;\n if(n - v[i] > v.back()) break;\n ans += upper_bound(v.begin(), v.end(), n - v[i]) - lower_bound(v.begin(), v.end(), n - v[i]);\n }\n cout << ans << endl;\n }\n}",
"accuracy": 0.18181818181818182,
"time_ms": 90,
"memory_kb": 11140,
"score_of_the_acc": -1.0842,
"final_rank": 20
},
{
"submission_id": "aoj_0096_5058594",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nvoid solve();\n\nint N;\n\nint main()\n{\n\twhile(cin>>N)solve();\n}\n\nvoid solve()\n{\n\tvector<vector<ll>> dp(5, vector<ll>(N + 1));\n\tdp[0][0] = 1;\n\n\tfor(int t = 0; t < 4; t++) {\n\t\tfor(int i = 0; i <= N; i++) {\n\t\t\tfor(int j = 0; j <= 1000; j++) {\n\t\t\t\tif(i + j > N)continue;\n\t\t\t\tdp[t + 1][i + j] += dp[t][i];\n\t\t\t}\n\t\t}\n\t}\n\tcout << dp[4][N] << endl;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3596,
"score_of_the_acc": -0.2813,
"final_rank": 11
},
{
"submission_id": "aoj_0096_4937611",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; ++i)\ntypedef long long ll;\nusing namespace std;\n\nint main() {\n int n;\n while (cin >> n) {\n ll ans = 0;\n rep(i, 1001) {\n rep(j, 1001) {\n rep(k, 1001) {\n int l = n - i - j - k;\n if (l < 0)\n break;\n\n ans++;\n }\n }\n }\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 0.18181818181818182,
"time_ms": 960,
"memory_kb": 3376,
"score_of_the_acc": -1.0329,
"final_rank": 19
},
{
"submission_id": "aoj_0096_4602387",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main()\n{\n\tint a[4001]={};\n\tfor(int i=0;i<=1000;i++) {\n\t\tfor(int j=0;j<=1000;j++) {\n\t\t\ta[i+j]++;\n\t\t}\n\t}\n\tint n;\n\twhile(cin>>n){\n\tlong long int all=0;\n\tfor(int i=0;i<=1000;i++) {\n\t\tfor(int j=0;j<=1000&&j<=n-i;j++) {\n\t\t\tall+=a[n-i-j];\n\t\t}\n\t}\n\tcout<<all<<endl;}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3112,
"score_of_the_acc": -0.0105,
"final_rank": 2
},
{
"submission_id": "aoj_0096_4488528",
"code_snippet": "#define _USE_MATH_DEFINES\n#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\t\tusing ld = long double;\nusing VB = vector<bool>;\tusing VVB = vector<VB>;\nusing VI = vector<int>;\t\tusing VVI = vector<VI>;\nusing VL = vector<ll>;\t\tusing VVL = vector<VL>;\nusing VS = vector<string>;\tusing VD = vector<ld>;\nusing PII = pair<int, int>;\tusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\tusing VPL = vector<PLL>;\ntemplate<class T>using PQ = priority_queue<T>;\ntemplate<class T>using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = (int)1e9;\nconstexpr ll inf_ll = (ll)1e18, MOD = 1000000007;\nconstexpr ld PI = M_PI, EPS = 1e-12;\n\n// --- input --- //\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Input {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\ttemplate<class T>static void i(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void i(char& v) {\n\t\twhile (isspace(v = gc()));\n\t}\n\tstatic void i(bool& v) {\n\t\tv = in<char>() != '0';\n\t}\n\tstatic void i(string& v) {\n\t\tv.clear(); char c; for (i(c); !isspace(c); c = gc())v += c;\n\t}\n\tstatic void i(int& v) {\n\t\tbool neg = false; v = 0; char c; i(c);\n\t\tif (c == '-') { neg = true; c = gc(); }\n\t\tfor (; isdigit(c); c = gc())v = v * 10 + (c - '0');\n\t\tif (neg)v = -v;\n\t}\n\tstatic void i(long long& v) {\n\t\tbool neg = false; v = 0; char c; i(c);\n\t\tif (c == '-') { neg = true; c = gc(); }\n\t\tfor (; isdigit(c); c = gc())v = v * 10 + (c - '0');\n\t\tif (neg)v = -v;\n\t}\n\tstatic void i(double& v) {\n\t\tdouble dp = 1; bool neg = false, adp = false; v = 0; char c; i(c);\n\t\tif (c == '-') { neg = true; c = gc(); }\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.')adp = true;\n\t\t\telse if (adp)v += (c - '0') * (dp *= 0.1);\n\t\t\telse v = v * 10 + (c - '0');\n\t\t}\n\t\tif (neg)v = -v;\n\t}\n\tstatic void i(long double& v) {\n\t\tlong double dp = 1; bool neg = false, adp = false; v = 0; char c; i(c);\n\t\tif (c == '-') { neg = true; c = gc(); }\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.')adp = true;\n\t\t\telse if (adp)v += (c - '0') * (dp *= 0.1);\n\t\t\telse v = v * 10 + (c - '0');\n\t\t}\n\t\tif (neg)v = -v;\n\t}\n\ttemplate<class T, class U>static void i(pair<T, U>& v) {\n\t\ti(v.first); i(v.second);\n\t}\n\ttemplate<class T>static void i(vector<T>& v) {\n\t\tfor (auto& e : v)i(e);\n\t}\n\tstruct InputV {\n\t\tint n, m;\n\t\tInputV(int _n) :n(_n), m(0) {}\n\t\tInputV(const pair<int, int>& nm) :n(nm.first), m(nm.second) {}\n\t\ttemplate<class T>operator vector<T>() {\n\t\t\tvector<T> v(n); i(v); return v;\n\t\t}\n\t\ttemplate<class T>operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m)); i(v); return v;\n\t\t}\n\t};\npublic:\n\tstatic string get_line() {\n\t\tstring v; char c;\n\t\tfor (i(c); c != '\\n' && c != '\\0'; c = gc())v += c;\n\t\treturn v;\n\t}\n\ttemplate<class T>static T in() {\n\t\tT v; i(v); return v;\n\t}\n\ttemplate<class T>operator T()const {\n\t\treturn in<T>();\n\t}\n\tint operator--(int)const {\n\t\treturn in<int>() - 1;\n\t}\n\tInputV operator[](int n)const {\n\t\treturn InputV(n);\n\t}\n\tInputV operator[](const pair<int, int>& n)const {\n\t\treturn InputV(n);\n\t}\n\tvoid operator()()const {}\n\ttemplate<class H, class...T>void operator()(H&& h, T&& ...t)const {\n\t\ti(h); operator()(forward<T>(t)...);\n\t}\n}in;\n#define input(T) Input::in<T>()\n#define INT input(int)\n#define LL input(ll)\n#define STR input(string)\n#define inputs(T, ...) T __VA_ARGS__; in(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(ll, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n\n// --- output --- //\nstruct BoolStr {\n\tconst char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {}\n}Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {}\n}spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"), no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{ Yes }; DivStr D{ spc };\n\tvoid p(int v)const {\n\t\tif (v < 0)putchar_unlocked('-'), v = -v;\n\t\tchar b[10]; int i = 0;\n\t\twhile (v)b[i++] = '0' + v % 10, v /= 10;\n\t\tif (!i)b[i++] = '0';\n\t\twhile (i--)putchar_unlocked(b[i]);\n\t}\n\tvoid p(ll v)const {\n\t\tif (v < 0)putchar_unlocked('-'), v = -v;\n\t\tchar b[20]; int i = 0;\n\t\twhile (v)b[i++] = '0' + v % 10, v /= 10;\n\t\tif (!i)b[i++] = '0';\n\t\twhile (i--)putchar_unlocked(b[i]);\n\t}\n\tvoid p(bool v)const {\n\t\tp(v ? B.t : B.f);\n\t}\n\tvoid p(char v)const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid p(const char* v)const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid p(double v)const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid p(ld v)const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate<class T> void p(const T& v)const {\n\t\tcout << v;\n\t}\n\ttemplate<class T, class U>void p(const pair<T, U>& v)const {\n\t\tp(v.first); p(D.d); p(v.second);\n\t}\n\ttemplate<class T>void p(const vector<T>& v)const {\n\t\trep(i, sz(v)) { if (i)p(D.d); p(v[i]); }\n\t}\n\ttemplate<class T>void p(const vector<vector<T>>& v)const {\n\t\trep(i, sz(v)) { if (i)p(D.l); p(v[i]); }\n\t}\npublic:\n\tOutput& operator()() {\n\t\tp(D.l); return *this;\n\t}\n\ttemplate<class H>Output& operator()(H&& h) {\n\t\tp(h); p(D.l); return *this;\n\t}\n\ttemplate<class H, class...T>Output& operator()(H&& h, T&& ...t) {\n\t\tp(h); p(D.d); return operator()(forward<T>(t)...);\n\t}\n\ttemplate<class It>Output& range(const It& l, const It& r) {\n\t\tfor (It i = l; i != r; i++) { if (i != l)p(D.d); p(*i); } p(D.l); return *this;\n\t}\n\ttemplate<class T>Output& range(const T& a) {\n\t\trange(a.begin(), a.end()); return *this;\n\t}\n\ttemplate<class...T>void exit(T&& ...t) {\n\t\toperator()(forward<T>(t)...); std::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout); return *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b; return *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d; return *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f); return *this;\n\t}\n}out;\n\n// --- step --- //\ntemplate<class T>struct Step {\n\tclass It {\n\t\tT a, b, c;\n\tpublic:\n\t\tconstexpr It() : a(T()), b(T()), c(T()) {}\n\t\tconstexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}\n\t\tconstexpr It& operator++() {\n\t\t\t--b; a += c; return *this;\n\t\t}\n\t\tconstexpr It operator++(int) {\n\t\t\tIt tmp = *this; --b; a += c; return tmp;\n\t\t}\n\t\tconstexpr const T& operator*()const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const T* operator->()const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const It& i)const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const It& i)const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr T start()const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr T count()const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr T step()const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(T b, T c, T s) : be(b, c, s) {}\n\tconstexpr It begin()const {\n\t\treturn be;\n\t}\n\tconstexpr It end()const {\n\t\treturn en;\n\t}\n\tconstexpr T start()const {\n\t\treturn be.start();\n\t}\n\tconstexpr T count()const {\n\t\treturn be.count();\n\t}\n\tconstexpr T step()const {\n\t\treturn be.step();\n\t}\n\tconstexpr T sum()const {\n\t\treturn start() * count() + step() * (count() * (count() - 1) / 2);\n\t}\n\toperator vector<T>()const {\n\t\treturn as_vector();\n\t}\n\ttemplate<class F>void each(const F& f)const {\n\t\tfor (T i : *this)f(i);\n\t}\n\tauto as_vector()const {\n\t\tvector<T> res; res.reserve(count()); each([&](T i) {res.push_back(i); }); return res;\n\t}\n\ttemplate<class F, class U = decay_t<result_of_t<F(T)>>>auto map(const F& f)const {\n\t\tvector<U> res; res.reserve(count()); each([&](T i) {res.push_back(f(i)); }); return res;\n\t}\n\ttemplate<class F>auto select(const F& f)const {\n\t\tvector<T> res; each([&](T i) {if (f(i))res.push_back(i); }); return res;\n\t}\n\ttemplate<class F>int count_if(const F& f)const {\n\t\tint res = 0; each([&](T i) {if (f(i))++res; }); return res;\n\t}\n\ttemplate<class F>T find_if(const F& f)const {\n\t\tfor (T i : *this)if (f(i))return i; return 0;\n\t}\n\ttemplate<class F>auto max_by(const F& f)const {\n\t\tauto v = map(f); return *max_element(v.begin(), v.end());\n\t}\n\ttemplate<class F>auto min_by(const F& f)const {\n\t\tauto v = map(f); return *min_element(v.begin(), v.end());\n\t}\n\ttemplate<class F>bool all_of(const F& f)const {\n\t\tfor (T i : *this)if (!f(i))return false; return true;\n\t}\n\ttemplate<class F>bool any_of(const F& f)const {\n\t\tfor (T i : *this)if (f(i))return true; return false;\n\t}\n\ttemplate<class F, class U = decay_t<result_of_t<F(T)>>>auto sum(const F& f)const {\n\t\tU res = 0; each([&](T i) {res += static_cast<U>(f(i)); }); return res;\n\t}\n\tusing value_type = T;\n\tusing iterator = It;\nprivate:\n\tIt be, en;\n};\ntemplate<class T>inline constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate<class T>inline constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate<class T>inline constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n\n// --- functions --- //\ninline namespace {\n\ttemplate<class T>inline void Sort(T& a) {\n\t\tsort(all(a));\n\t}\n\ttemplate<class T>inline void RSort(T& a) {\n\t\tsort(rall(a));\n\t}\n\ttemplate<class T, class F>inline void Sort(T& a, const F& f) {\n\t\tsort(all(a), f);\n\t}\n\ttemplate<class T, class F>inline void RSort(T& a, const F& f) {\n\t\tsort(rall(a), f);\n\t}\n\ttemplate<class T>inline T Sorted(T a) {\n\t\tSort(a); return a;\n\t}\n\ttemplate<class T>inline T RSorted(T a) {\n\t\tRSort(a); return a;\n\t}\n\ttemplate<class T, class F>inline T Sorted(T& a, const F& f) {\n\t\tSort(a, f); return a;\n\t}\n\ttemplate<class T, class F>inline T RSorted(T& a, const F& f) {\n\t\tRSort(a, f); return a;\n\t}\n\ttemplate<class T, class F>inline void SortBy(T& a, const F& f) {\n\t\tsort(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });\n\t}\n\ttemplate<class T, class F>inline void RSortBy(T& a, const F& f) {\n\t\tsort(rall(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });\n\t}\n\ttemplate<class T>inline void Reverse(T& a) {\n\t\treverse(all(a));\n\t}\n\ttemplate<class T>inline void Unique(T& a) {\n\t\ta.erase(unique(all(a)), a.end());\n\t}\n\ttemplate<class T>inline void Uniq(T& a) {\n\t\tSort(a); Unique(a);\n\t}\n\ttemplate<class T>inline void Rotate(T& a, int left) {\n\t\trotate(a.begin(), a.begin() + left, a.end());\n\t}\n\ttemplate<class T>inline T Reversed(T a) {\n\t\tReverse(a); return a;\n\t}\n\ttemplate<class T>inline T Uniqued(T a) {\n\t\tUnique(a); return a;\n\t}\n\ttemplate<class T>inline T Uniqed(T a) {\n\t\tUniq(a); return a;\n\t}\n\ttemplate<class T>inline T Rotated(T a, int left) {\n\t\tRotate(a, left); return a;\n\t}\n\ttemplate<class T>inline auto Max(const T& a) {\n\t\treturn *max_element(all(a));\n\t}\n\ttemplate<class T>inline auto Min(const T& a) {\n\t\treturn *min_element(all(a));\n\t}\n\ttemplate<class T>inline int MaxPos(const T& a) {\n\t\treturn max_element(all(a)) - a.begin();\n\t}\n\ttemplate<class T>inline int MinPos(const T& a) {\n\t\treturn min_element(all(a)) - a.begin();\n\t}\n\ttemplate<class T, class F>inline auto MaxBy(const T& a, const F& f) {\n\t\treturn *max_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });\n\t}\n\ttemplate<class T, class F>inline auto MinBy(const T& a, const F& f) {\n\t\treturn *min_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });\n\t}\n\ttemplate<class T, class U>inline int Count(const T& a, const U& v) {\n\t\treturn count(all(a), v);\n\t}\n\ttemplate<class T, class F>inline int CountIf(const T& a, const F& f) {\n\t\treturn count_if(all(a), f);\n\t}\n\ttemplate<class T, class U>inline int Find(const T& a, const U& v) {\n\t\treturn find(all(a), v) - a.begin();\n\t}\n\ttemplate<class T, class F>inline int FindIf(const T& a, const F& f) {\n\t\treturn find_if(all(a), f) - a.begin();\n\t}\n\ttemplate<class T, class U = typename T::value_type>inline U Sum(const T& a) {\n\t\treturn accumulate(all(a), U());\n\t}\n\ttemplate<class T, class U>inline bool Includes(const T& a, const U& v) {\n\t\treturn find(all(a), v) != a.end();\n\t}\n\ttemplate<class T, class F>inline auto Sum(const T& v, const F& f) {\n\t\treturn accumulate(next(v.begin()), v.end(), f(*v.begin()), [&](auto a, auto b) {return a + f(b); });\n\t}\n\ttemplate<class T, class U>inline int Lower(const T& a, const U& v) {\n\t\treturn lower_bound(all(a), v) - a.begin();\n\t}\n\ttemplate<class T, class U>inline int Upper(const T& a, const U& v) {\n\t\treturn upper_bound(all(a), v) - a.begin();\n\t}\n\ttemplate<class T, class F>inline void RemoveIf(T& a, const F& f) {\n\t\ta.erase(remove_if(all(a), f), a.end());\n\t}\n\ttemplate<class F>inline auto Vector(size_t size, const F& f) {\n\t\tvector<decay_t<result_of_t<F(size_t)>>> res(size);\n\t\tfor (size_t i = 0; i < size; ++i)res[i] = f(i);\n\t\treturn res;\n\t}\n\ttemplate<class T>inline auto Grid(size_t h, size_t w, const T& v = T()) {\n\t\treturn vector<vector<T>>(h, vector<T>(w, v));\n\t}\n\ttemplate<class T>inline auto Slice(const T& v, size_t i, size_t len) {\n\t\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n\t}\n\ttemplate<class T, class F>inline auto Each(const T& v, F&& f) {\n\t\tfor (auto& i : v)f(i);\n\t}\n\ttemplate<class T, class F>inline auto Select(const T& v, const F& f) {\n\t\tT res;\n\t\tfor (const auto& e : v)if (f(e))res.push_back(e);\n\t\treturn res;\n\t}\n\ttemplate<class T, class F>inline auto Map(const T& v, F&& f) {\n\t\tvector<decay_t<result_of_t<F(typename T::value_type)>>> res(v.size());\n\t\tsize_t i = 0; for (const auto& e : v)res[i++] = f(e);\n\t\treturn res;\n\t}\n\ttemplate<class T, class F>inline auto MapIndex(const T& v, const F& f) {\n\t\tvector<decay_t<result_of_t<F(size_t, typename T::value_type)>>> res(v.size());\n\t\tsize_t i = 0; for (auto it = v.begin(); it != v.end(); ++it, ++i)res[i] = f(i, *it);\n\t\treturn res;\n\t}\n\ttemplate<class T, class F>inline auto TrueIndex(const T& v, const F& f) {\n\t\tvector<size_t> res;\n\t\tfor (size_t i = 0; i < v.size(); ++i)if (f(v[i]))res.push_back(i);\n\t\treturn res;\n\t}\n\ttemplate<class T, class U = typename T::value_type>inline auto Indexed(const T& v) {\n\t\tvector<pair<U, int>> res(v.size());\n\t\tfor (int i = 0; i < (int)v.size(); ++i)res[i] = make_pair(static_cast<U>(v[i]), i);\n\t\treturn res;\n\t}\n\tinline auto operator*(string s, size_t n) {\n\t\tstring res;\n\t\tfor (size_t i = 0; i < n; ++i)res += s;\n\t\treturn res;\n\t}\n\ttemplate<class T>inline auto& operator<<(vector<T>& v, const vector<T>& v2) {\n\t\tv.insert(v.end(), all(v2)); return v;\n\t}\n\ttemplate<class T>inline T Ceil(T n, T m) {\n\t\treturn (n + m - 1) / m;\n\t}\n\ttemplate<class T>inline T Ceil2(T n, T m) {\n\t\treturn Ceil(n, m) * m;\n\t}\n\ttemplate<class T>inline T Tri(T n) {\n\t\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n\t}\n\ttemplate<class T>inline T nC2(T n) {\n\t\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n\t}\n\ttemplate<class T>inline T Mid(const T& l, const T& r) {\n\t\treturn l + (r - l) / 2;\n\t}\n\tinline int pop_count(int n) {\n\t\treturn bitset<32>(n).count();\n\t}\n\tinline int pop_count(ll n) {\n\t\treturn bitset<64>(n).count();\n\t}\n\ttemplate<class T>inline bool chmax(T& a, const T& b) {\n\t\tif (a < b) { a = b; return true; } return false;\n\t}\n\ttemplate<class T>inline bool chmin(T& a, const T& b) {\n\t\tif (a > b) { a = b; return true; } return false;\n\t}\n\ttemplate<class T>inline bool inRange(const T& v, const T& min, const T& max) {\n\t\treturn min <= v && v < max;\n\t}\n\ttemplate<class T>inline bool isSquere(T n) {\n\t\tT s = sqrt(n); return s * s == n || (s + 1) * (s + 1) == n;\n\t}\n\ttemplate<class T = ll>inline T BIT(int b) {\n\t\treturn T(1) << b;\n\t}\n\ttemplate<class T>inline T Gcd(T n, T m) {\n\t\treturn m ? Gcd(m, n % m) : n;\n\t}\n\ttemplate<class T>inline T Lcm(T n, T m) {\n\t\treturn n / Gcd(n, m) * m;\n\t}\n\ttemplate<class T, class U = typename T::value_type>inline U Gcdv(const T& v) {\n\t\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd<U>);\n\t}\n\ttemplate<class T, class U = typename T::value_type>inline U Lcmv(const T& v) {\n\t\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm<U>);\n\t}\n\ttemplate<class T>inline T Pow(T a, T n) {\n\t\tT r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; } return r;\n\t}\n\ttemplate<class T>inline T Powmod(T a, T n, T m = MOD) {\n\t\tT r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r;\n\t}\n}\n\n// --- dump --- //\n#if __has_include(\"dump.hpp\")\n#include \"dump.hpp\"\n#else\n#define dump(...) ((void)0)\n#endif\n\n// ---------------------------------------------------------------- //\n\nint main() {\n\tmap<int, ll> cnt;\n\trep(i, 1001)rep(j, 1001) {\n\t\tcnt[i + j]++;\n\t}\n\tfor (int n; cin >> n;) {\n\t\tll ans = 0;\n\t\tfor (auto p : cnt) {\n\t\t\tif (cnt.count(n - p.first))\n\t\t\t\tans += p.second * cnt[n - p.first];\n\t\t}\n\t\tout(ans);\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3232,
"score_of_the_acc": -0.036,
"final_rank": 3
},
{
"submission_id": "aoj_0096_4283377",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint n;\nint dp[5][4001];\n\nint main() {\n fill(dp[0], dp[5], 0);\n dp[0][0] = 1;\n for (int i = 1; i <= 4; i++) {\n for (int j = 0; j <= 4000; j++) {\n for (int k = 0; k <= 1000; k++) {\n if (j + k <= 4000)\n dp[i][j + k] += dp[i - 1][j];\n }\n }\n }\n while (cin >> n) {\n cout << dp[4][n] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3168,
"score_of_the_acc": -0.007,
"final_rank": 1
},
{
"submission_id": "aoj_0096_4283372",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint n;\nint dp[5][4001];\n\nint main() {\n while (cin >> n) {\n fill(dp[0], dp[4], 0);\n dp[0][0] = 1;\n for (int i = 1; i <= 4; i++) {\n for (int j = 0; j <= n; j++) {\n for (int k = 0; k <= 1000; k++) {\n if (j + k <= n)\n dp[i][j + k] += dp[i - 1][j];\n }\n }\n }\n cout << dp[4][n] << endl;\n }\n}",
"accuracy": 0.2727272727272727,
"time_ms": 170,
"memory_kb": 3168,
"score_of_the_acc": -0.1754,
"final_rank": 12
},
{
"submission_id": "aoj_0096_4283369",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint n;\nint dp[5][4001];\n\nint main() {\n while (cin >> n) {\n fill(dp[0], dp[5], 0);\n dp[0][0] = 1;\n for (int i = 1; i <= 4; i++) {\n for (int j = 0; j <= n; j++) {\n for (int k = 0; k <= 1000; k++) {\n if (j + k <= n)\n dp[i][j + k] += dp[i - 1][j];\n }\n }\n }\n cout << dp[4][n] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 3184,
"score_of_the_acc": -0.2616,
"final_rank": 10
}
] |
aoj_0099_cpp
|
ワカサギ釣り大会 2
桧原湖でワカサギ釣り大会が行われました。今回はキャッチ＆リリースが推奨されているようです。
参加者番号と釣った匹数またはリリースした匹数を１つのイベントとして順番に読み込み、各イベントの直後に最も多くのワカサギを手元に獲得している参加者番号と匹数を出力するプログラムを作成してください。最も多く獲得している参加者が複数いる場合（あるいは全ての参加者が 0 匹の場合）は、その中で参加者番号が最も小さい一人を出力してください。
入力
入力は以下の形式で与えられる。
n
q
a
1
v
1
a
2
v
2
:
a
q
v
q
n
(1 ≤
n
≤ 1000000) は参加者の数、
q
(1 ≤
q
≤ 100000)はイベントの数を表す。
a
i
(1 ≤
a
i
≤
n
)
v
i
( -100 ≤
v
i
≤ 100) は、
i
番目のイベントで参加者
a
i
が
v
i
匹獲得あるいはリリースしたことを示す。
v
i
は正の値が獲得、負の値がリリースを示し、0 が与えられることはない。
出力
各イベントごとに、最も多くのワカサギを手元に獲得している参加者の参加者番号と匹数を１つの空白区切りで１行に出力する。
入力例1
3 5
1 4
2 5
1 3
3 6
2 7
出力例1
1 4
2 5
1 7
1 7
2 12
入力例2
3 5
1 4
2 5
2 -3
3 4
1 -1
出力例2
1 4
2 5
1 4
1 4
3 4
|
[
{
"submission_id": "aoj_0099_11058683",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(void){\n // N : humans\n // Q : events\n int N, Q;\n cin >> N >> Q;\n vector<vector<int>> fishes(Q+4, vector<int>(N+4));\n\n for(int event = 1; event <= Q; event++){\n int number, getFish;\n cin >> number >> getFish;\n fishes[event][number] += getFish;\n }\n\n\n // 列方向累積和\n for(int humanNum = 1; humanNum <= N; humanNum++){\n for(int event = 1; event <= Q; event++){\n fishes[event][humanNum] += fishes[event-1][humanNum];\n }\n }\n\n // index 最大値取得\n vector<vector<int>> answer(Q+4, vector<int>(4));\n /*\n event : humanIndex sumFishes\n */\n for(int event = 1; event <= Q; event++){\n for(int humanIndex = 1; humanIndex <= N; humanIndex++){\n if(fishes[event][humanIndex] > answer[event][1]){\n answer[event][0] = humanIndex;\n answer[event][1] = fishes[event][humanIndex];\n }\n }\n }\n\n for(int event = 1; event <= Q; event++){\n cout << answer[event][0] << \" \" << answer[event][1] << endl;\n }\n}",
"accuracy": 0.6818181818181818,
"time_ms": 30,
"memory_kb": 42740,
"score_of_the_acc": -0.5659,
"final_rank": 20
},
{
"submission_id": "aoj_0099_10946299",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing P = pair<int, int>;\n\ntemplate <typename T>\nclass SegmentTree {\n\tusing func_t = function<T(T, T)>;\n\tconst int n;\n\tconst T id;\n\tfunc_t merge;\n\tvector<T> data;\n\tint size(int n) {\n\t\tint res;\n\t\tfor (res = 1; res < n; res <<= 1);\n\t\treturn res;\n\t}\n\tT sub(int l, int r, int node, int lb, int ub) {\n\t\tif (ub <= l || r <= lb) return id;\n\t\tif (l <= lb && ub <= r) return data[node];\n\t\treturn merge(sub(l, r, node * 2, lb, (lb + ub) / 2), sub(l, r, node * 2 + 1, (lb + ub) / 2, ub));\n\t}\npublic:\n\tSegmentTree(int n_, T id_, func_t merge_) :\n\t\tn(size(n_)), id(id_), merge(merge_), data(size(n_) * 2, id_) {}\n\tSegmentTree(const vector<T>& data_, T id_, func_t merge_) :\n\t\tn(size(data_.size())), id(id_), merge(merge_), data(size(data_.size()) * 2, id_) {\n\t\tfor (int i = 0; i < data_.size(); i++)\n\t\t\tdata[i + n] = data_[i];\n\t\tfor (int i = n - 1; i >= 0; i--)\n\t\t\tdata[i] = merge(data[i * 2], data[i * 2 + 1]);\n\t}\n\tvoid Update(int p, T val) {\n\t\tp += n;\n\t\tdata[p] = val;\n\t\twhile (p >>= 1) data[p] = merge(data[p * 2], data[p * 2 + 1]);\n\t}\n\tvoid Add(int p, int val) {\n\t\tp += n;\n\t\tdata[p].first += val;\n\t\twhile (p >>= 1) data[p] = merge(data[p * 2], data[p * 2 + 1]);\n\t}\n\tT Find(int l, int r) {\n\t\treturn sub(l, r + 1, 1, 0, n);\n\t}\n};\n\nint main()\n{\n\tint n, q;\n\tcin >> n >> q;\n\tvector<P> cnt(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tcnt[i].second = i + 1;\n\t}\n\tSegmentTree<P> seg(cnt, P(), [](P a, P b) {\n\t\treturn a.first >= b.first ? a : b;\n\t});\n\n\tint a, v;\n\twhile (q--) {\n\t\tcin >> a >> v;\n\t\tseg.Add(a - 1, v);\n\t\tauto res = seg.Find(0, n - 1);\n\t\tcout << res.second << ' ' << res.first << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 27300,
"score_of_the_acc": -0.6921,
"final_rank": 16
},
{
"submission_id": "aoj_0099_9746352",
"code_snippet": "#pragma region Macros\n \n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,mmx,abm,bmi,bmi2,popcnt,lzcnt\")\n// #pragma GCC target(\"avx2\") // CF, CodeChef, HOJ ではコメントアウト\n \n#include <bits/extc++.h>\n#include <atcoder/all>\nusing namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n \n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n// #define int ll\n#define endl '\\n'\n \n// #define sqrt __builtin_sqrtl\n// #define cbrt __builtin_cbrtl\n// #define hypot __builtin_hypotl\n \nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n \nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n \n#define EC double\nstruct Edge {\n int from, to;\n EC cost;\n Edge() {}\n // Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge &e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge &e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n bool operator <(const Edge &e) { return this->cost < e.cost; }\n bool operator >(const Edge &e) { return this->cost > e.cost; }\n};\n \nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n \nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int() {\n return dist_x(rng);\n }\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nnamespace bit_function {\n using i64 = ll;\n // using i64 = uint64_t;\n // bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\n i64 lrmask(int l, int r) { return (1LL << r) - (1LL << l); }\n i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\n i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n \n i64 popcount(i64 x) { return __builtin_popcountll(x); }\n i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); }\n i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみ\n i64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうる\n bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\n bool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n //bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); }\n \n int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\n int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n int next_bit(i64 x, int k) { // upper_bound\n x >>= (k + 1);\n int pos = k + 1;\n while (x > 0) {\n if (x & 1) return pos;\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int prev_bit(i64 x, int k) {\n // k = min(k, bit_width(x)); ?\n int pos = 0;\n while (x > 0 && pos < k) {\n if (x & 1) {\n if (pos < k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int kth_bit(i64 x, int k) { // kは1-indexed\n int pos = 0, cnt = 0;\n while (x > 0) {\n if (x & 1) {\n cnt++;\n if (cnt == k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\n i64 lsb(i64 x) { return (x & -x); } // mask\n \n int countl_zero(i64 x) { return __builtin_clzll(x); }\n int countl_one(i64 x) { // countl_oneと定義が異なるので注意\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n }\n int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64\n int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n // int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x));\n\n i64 l_one(i64 x) { // 最上位で連なってる1のmask\n if (x == 0) return 0;\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; }\n return ret;\n }\n \n int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bit\n int ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); }\n i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msb\n i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n \n i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\n i64 rotr(i64 x, int k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\n i64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n }\n // i64 bit_reverse(i64 x, int l, int r) {}\n \n bool is_palindrome(i64 x) { return x == bit_reverse(x); }\n bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\n i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\n i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカット\n \n i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\n i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\n i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\n i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\n i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n \n i64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n }\n} using namespace bit_function;\n\nnamespace util_function {\n namespace Std = std;\n __int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n // assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n // assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n }\n int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n }\n int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n return x - y * per(x, y);\n } // https://yukicoder.me/problems/no/2781\n int floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n }\n int ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n }\n int round(int x, int y) { // (ld)(x/y)を小数点第1位について四捨五入\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n }\n int round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0 && k >= 0);\n if (k == 0) return (x * 2 + y) / (y * 2);\n x /= y * POW(10, k - 1);\n if (x % 10 >= 5) return (x + 10 - x % 10) * POW(10, k - 1);\n return x * POW(10, k - 1);\n }\n int round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = x / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n }\n ld round(ld x, int k) { // xを10^kの位に関して四捨五入.\n // x += EPS;\n ld d = pow(10, -k);\n return Std::round(x * d) / d;\n }\n ld floor(ld x, int k) { // xを10^kの位に関してflooring\n // x += EPS;\n ld d = pow(10, -k);\n return Std::floor(x * d) / d; // 未verify\n }\n ld ceil(ld x, int k) { // xを10^kの位に関してceiling\n // x -= EPS;\n ld d = pow(10, -k);\n return Std::ceil(x * d) / d; // 未verify\n }\n // int kth(int x, int y, int k) { // x / yの10^kの位の桁\n // }\n int floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return Std::floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n }\n int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return Std::ceil(x / y);\n // ceil(x) = floor(x + 1)\n }\n int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return Std::floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -Std::floor(x / fabs(y));\n if (x < 0 && y < 0) return Std::floor(x / y) + (x - Std::floor(x/y)*y < -EPS);\n return Std::floor(x / y) - (x - Std::floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n }\n ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n }\n int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\n int modf(ld x) {\n if (x < 0) return ceill(x);\n else return floorl(x);\n }\n // 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\n int seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n }\n int seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n }\n\n int floor_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now <= x) {\n now *= base;\n if (now <= x) ret++;\n }\n return ret;\n }\n int ceil_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now < x) {\n now *= base;\n ret++;\n }\n return ret;\n }\n\n template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n }\n template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n }\n \n template <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n }\n template <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n }\n template <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - Std::max({a, b, c}) - Std::min({a, b, c});\n }\n template <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) if (a > b) swap(a, b);\n else if (b > a) swap(b, a);\n }\n template <typename T, typename... Args>\n void Sort(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.begin(), vec.end());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n template <typename T, typename... Args>\n void Sortr(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.rbegin(), vec.rend());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n\n istream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n }\n ostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n }\n \n __int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n }\n __int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n __int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n }\n \n string to_string(double x, int k) { // 小数第k+1を四捨五入して小数第k位までを出力\n // 切り捨てがほしい場合は to_string(x, k+1) として pop_back() すればよい?\n ostringstream os;\n os << fixed << setprecision(k) << x;\n return os.str();\n }\n string to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n }\n string to_string(char c) { string s = \"\"; s += c; return s; }\n} using namespace util_function;\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n \n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\ntemplate<typename T>\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<T, int, custom_hash> Z;\n // gp_hash_table<int, T, custom_hash> UZ;\n unordered_map<T, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, T> UZ; // 圧縮した値 -> 元の値\n \n Compress() {}\n Compress(const vector<T> &V, T base = 0) {\n this->sz = base;\n set<T> s(V.begin(), V.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, T base = 0) {\n this->sz = base;\n vector<T> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<T> s(V3.begin(), V3.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, T base = 0) {\n this->sz = base;\n vector<T> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<T> s(V4.begin(), V4.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2,\n const vector<T> &V3, const vector<T> &V4, T base = 0) {\n this->sz = base;\n vector<T> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<T> s(V5.begin(), V5.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n vector<int> zip(const vector<T> &V) {\n vector<int> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[V[i]];\n }\n return ret;\n }\n \n vector<T> unzip(const vector<int> &V) {\n vector<T> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[V[i]];\n }\n return ret;\n }\n \n int size() { return sz; }\n \n int encode(T x) { return Z[x]; }\n T decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n \nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n \ntemplate<typename T> struct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<T> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n \ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n \n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n\n friend istream &operator >>(istream &is, Modint& x) {\n int t; is >> t; x = t; return (is);\n }\n friend ostream &operator <<(ostream &os, const Modint& x) {\n return os << x.val;\n }\n};\nusing mint = Modint<MOD>;\n \nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n// int modinv(__int128_t x, int mod) { // \n// assert(mod > 0);\n// // assert(x > 0);\n// if (x == 1 or x == 0) return 1;\n// return mod - modinv(mod % x, mod) * (mod / x) % mod;\n// }\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n \nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint FACinv(int N) {\n if (N < 0) return 0; return _finv[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint COMinv(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _finv[N] * _fac[K] * _fac[N - K];\n}\nmint MCOM(const vector<int> &V) {\n int N = 0;\n for (int i = 0; i < V.size(); i++) N += V[i];\n mint ret = _fac[N];\n for (int i = 0; i < V.size(); i++) ret *= _finv[V[i]];\n return ret;\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n \n#pragma endregion\n\nusing S = pair<int, int>;\nS op(S x, S y) { return max(x, y); }\nS e() { return {-INF, INF}; }\nsigned main() {\n int N, Q;\n cin >> N >> Q;\n\n vector<S> A(N);\n for (int i = 0; i < N; i++) A[i] = {0, -i};\n segtree<S, op, e> seg(A);\n\n for (int q = 0; q < Q; q++) {\n int i, x;\n cin >> i >> x;\n i--;\n seg.set(i, {seg.get(i).first + x, -i});\n\n auto p = seg.all_prod();\n cout << -p.second + 1 << \" \" << p.first << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 27644,
"score_of_the_acc": -0.3044,
"final_rank": 14
},
{
"submission_id": "aoj_0099_9581580",
"code_snippet": "#include <iostream>\n#include <cstdint>\n#include <vector>\n\nusing namespace std;\n\ntemplate<typename T> class SegmentTree\n{\nprotected:\n\tvector<vector<T>> containers;\n\tconst T default_value;\n\tT(*pick_up)(T, T);\n\npublic:\n\tSegmentTree(T(*pick_up)(T, T), const vector<T>& initializer, const T default_value) : default_value(default_value), pick_up(pick_up)\n\t{\n\t\tcontainers.clear();\n\n\t\tif (initializer.size() == 0) return;\n\n\t\tsize_t L;\n\t\tfor (L = 1; L < initializer.size(); L <<= 1);\n\t\tcontainers.emplace_back(L);\n\n\t\tsize_t i;\n\t\tfor (i = 0; i != initializer.size(); ++i)\n\t\t\tcontainers[0][i] = initializer[i];\n\t\tfor (; i != L; ++i)\n\t\t\tcontainers[0][i] = default_value;\n\n\t\tfor (L >>= 1; L != 0; L >>= 1)\n\t\t{\n\t\t\tcontainers.emplace_back(L);\n\t\t\tfor (i = 0; i != L; ++i)\n\t\t\t\tcontainers[containers.size() - 1][i] = pick_up(containers[containers.size() - 2][i << 1], containers[containers.size() - 2][(i << 1) | 1]);\n\t\t}\n\t}\n\n\tT operator[](size_t index) { return containers[0][index]; }\n\n\tsize_t size() { return containers[0].size(); }\n\tsize_t layer() { return containers.size(); }\n\n\tvirtual T update(size_t index, const T value)\n\t{\n\t\tcontainers[0][index] = value;\n\n\t\tindex >>= 1;\n\t\tfor (size_t i = 1; i != containers.size(); ++i, index >>= 1)\n\t\t\tcontainers[i][index] = pick_up(containers[i - 1][index << 1], containers[i - 1][(index << 1) | 1]);\n\n\t\treturn value;\n\t}\n\n\tvirtual T range_pick_up(size_t first_index, size_t end_index, size_t cur_layer = 0)\n\t{\n\t\tif (first_index >= end_index || end_index > containers[cur_layer].size()) return default_value;\n\t\tif (first_index + 1 == end_index) return containers[cur_layer][first_index];\n\n\t\tif (first_index & 1)\n\t\t{\n\t\t\tif (end_index & 1)\n\t\t\t{\n\t\t\t\tif (first_index + 2 != end_index)\n\t\t\t\t\treturn pick_up(pick_up(containers[cur_layer][first_index], containers[cur_layer][end_index - 1]), range_pick_up((first_index + 1) >> 1, end_index >> 1, cur_layer + 1));\n\t\t\t\telse\n\t\t\t\t\treturn pick_up(containers[cur_layer][first_index], containers[cur_layer][end_index - 1]);\n\t\t\t}\n\t\t\telse\n\t\t\t\treturn pick_up(containers[cur_layer][first_index], range_pick_up((first_index + 1) >> 1, end_index >> 1, cur_layer + 1));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (end_index & 1)\n\t\t\t\treturn pick_up(containers[cur_layer][end_index - 1], range_pick_up(first_index >> 1, end_index >> 1, cur_layer + 1));\n\t\t\telse\n\t\t\t\treturn range_pick_up(first_index >> 1, end_index >> 1, cur_layer + 1);\n\t\t}\n\t}\n};\n\nconstexpr pair<int32_t, uint32_t> pick_up(const pair<int32_t, uint32_t> a, const pair<int32_t, uint32_t> b)\n{\n\treturn a.first == b.first ? (a.second <= b.second ? a : b) : (a.first > b.first ? a : b);\n}\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tuint32_t n, q, i;\n\tcin >> n >> q;\n\tvector<pair<uint32_t, int16_t>> events(q);\n\tfor (i = 0; i != q; ++i) cin >> events[i].first >> events[i].second;\n\n\tSegmentTree<pair<int32_t, uint32_t>> st(pick_up, vector<pair<int32_t, uint32_t>>(n, { 0, 0 }), { INT32_MIN, UINT32_MAX });\n\tfor (i = 0; i != n; ++i) st.update(i, { st[i].first, i + 1 });\n\n\tfor (i = 0; i != q; ++i)\n\t{\n\t\t--events[i].first;\n\t\tst.update(events[i].first, { st[events[i].first].first + events[i].second, st[events[i].first].second });\n\t\tconst auto predator = st.range_pick_up(0, n);\n\t\tcout << predator.second << ' ' << predator.first << '\\n';\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 28188,
"score_of_the_acc": -0.7054,
"final_rank": 17
},
{
"submission_id": "aoj_0099_9331048",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? 縺ｯ -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"/opt/library/ds/segtree/segtree.hpp\"\n\ntemplate <class Monoid>\nstruct SegTree {\n using MX = Monoid;\n using X = typename MX::value_type;\n using value_type = X;\n vc<X> dat;\n ll n, log, size;\n\n SegTree() {}\n SegTree(ll n) { build(n); }\n template <typename F>\n SegTree(ll n, F f) {\n build(n, f);\n }\n SegTree(const vc<X>& v) { build(v); }\n\n void build(ll m) {\n build(m, [](ll i) -> X { return MX::unit(); });\n }\n void build(const vc<X>& v) {\n build(len(v), [&](ll i) -> X { return v[i]; });\n }\n template <typename F>\n void build(ll m, F f) {\n n = m, log = 1;\n while ((1 << log) < n) ++log;\n size = 1 << log;\n dat.assign(size << 1, MX::unit());\n rep(i, n) dat[size + i] = f(i);\n rrep(i, 1, size) update(i);\n }\n\n X get(ll i) { return dat[size + i]; }\n vc<X> get_all() { return {dat.begin() + size, dat.begin() + size + n}; }\n\n void update(ll i) { dat[i] = Monoid::op(dat[2 * i], dat[2 * i + 1]); }\n void set(ll i, const X& x) {\n assert(i < n);\n dat[i += size] = x;\n while (i >>= 1) update(i);\n }\n\n void multiply(ll i, const X& x) {\n assert(i < n);\n i += size;\n dat[i] = Monoid::op(dat[i], x);\n while (i >>= 1) update(i);\n }\n\n X prod(ll L, ll R) {\n assert(0 <= L && L <= R && R <= n);\n X vl = Monoid::unit(), vr = Monoid::unit();\n L += size, R += size;\n while (L < R) {\n if (L & 1) vl = Monoid::op(vl, dat[L++]);\n if (R & 1) vr = Monoid::op(dat[--R], vr);\n L >>= 1, R >>= 1;\n }\n return Monoid::op(vl, vr);\n }\n\n X prod_all() { return dat[1]; }\n\n template <class F>\n ll max_right(F check, ll L) {\n assert(0 <= L && L <= n && check(Monoid::unit()));\n if (L == n) return n;\n L += size;\n X sm = Monoid::unit();\n do {\n while (L % 2 == 0) L >>= 1;\n if (!check(Monoid::op(sm, dat[L]))) {\n while (L < size) {\n L = 2 * L;\n if (check(Monoid::op(sm, dat[L]))) { sm = Monoid::op(sm, dat[L++]); }\n }\n return L - size;\n }\n sm = Monoid::op(sm, dat[L++]);\n } while ((L & -L) != L);\n return n;\n }\n\n template <class F>\n ll min_left(F check, ll R) {\n assert(0 <= R && R <= n && check(Monoid::unit()));\n if (R == 0) return 0;\n R += size;\n X sm = Monoid::unit();\n do {\n --R;\n while (R > 1 && (R % 2)) R >>= 1;\n if (!check(Monoid::op(dat[R], sm))) {\n while (R < size) {\n R = 2 * R + 1;\n if (check(Monoid::op(dat[R], sm))) { sm = Monoid::op(dat[R--], sm); }\n }\n return R + 1 - size;\n }\n sm = Monoid::op(dat[R], sm);\n } while ((R & -R) != R);\n return 0;\n }\n\n // prod_{l<=i<r} A[i xor x]\n X xor_prod(ll l, ll r, ll xor_val) {\n static_assert(Monoid::commute);\n X x = Monoid::unit();\n rep(k, log+1) {\n if (l >= r) break;\n if (l & 1) { x = Monoid::op(x, dat[(size >> k) + ((l++) ^ xor_val)]); }\n if (r & 1) { x = Monoid::op(x, dat[(size >> k) + ((--r) ^ xor_val)]); }\n l /= 2, r /= 2, xor_val /= 2;\n }\n return x;\n }\n};\n#line 2 \"/opt/library/alg/monoid/max.hpp\"\n\ntemplate <typename E>\nstruct Monoid_Max {\n using X = E;\n using value_type = X;\n static constexpr X op(const X &x, const X &y) noexcept { return max(x, y); }\n static constexpr X unit() { return -infty<E>; }\n static constexpr bool commute = true;\n};\n#line 4 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {break;}\n return 0;\n}\n\nint solve() {\n ll n, q, a, v;\n cin >> n >> q;\n SegTree<Monoid_Max<ll>> seg(n);\n vi p(n, 0);\n unordered_map<ll, set<ll>> idx;\n rep(i, n) idx[0].emplace(i);\n rep(q) {\n cin >> a >> v;\n a--;\n idx[p[a]].erase(a);\n p[a] += v;\n idx[p[a]].emplace(a);\n seg.set(a, p[a]);\n ll pmax = seg.prod(0, n);\n print(*idx[pmax].begin()+1, pmax);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 74164,
"score_of_the_acc": -2,
"final_rank": 19
},
{
"submission_id": "aoj_0099_8861173",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nconst int MAX = 1000001;\nint S[MAX];\n\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\n\nint main() {\n int n, m;\n scanf(\"%d %d\", &n, &m);\n \n // Use vector to implement max heap\n vector<data> Q;\n Q.push_back(data(0, 0));\n make_heap(Q.begin(), Q.end());\n \n data temp; // Reusable temp data object\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n \n temp.num = a;\n temp.score = S[a];\n Q.push_back(temp);\n push_heap(Q.begin(), Q.end());\n \n while (1) {\n temp = Q.front(); // Get the top element\n if (temp.score == S[temp.num]) {\n cout << temp.num << \" \" << temp.score << endl;\n break;\n }\n pop_heap(Q.begin(), Q.end()); // Only pop if condition is not satisfied\n Q.pop_back();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 7820,
"score_of_the_acc": -0.2937,
"final_rank": 12
},
{
"submission_id": "aoj_0099_8818729",
"code_snippet": "#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(NULL);\n int n, m;\n cin >> n >> m;\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n cin >> a >> b;\n S[a] += b;\n Q.push(data(a, S[a]));\n data now = Q.top();\n while (1) {\n if (now.score == S[now.num]) {\n cout << now.num << \" \" << now.score << \"\\n\";\n break;\n }\n Q.pop();\n now = Q.top();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7700,
"score_of_the_acc": -0.0062,
"final_rank": 3
},
{
"submission_id": "aoj_0099_8818728",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n const data &now = Q.top();\n if (now.score == S[now.num]) {\n cout << now.num << \" \" << now.score << '\\n';\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 7880,
"score_of_the_acc": -0.0446,
"final_rank": 11
},
{
"submission_id": "aoj_0099_8818725",
"code_snippet": "#include <cstdio>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n const data &now = Q.top();\n if (now.score == S[now.num]) {\n printf(\"%d %d\\n\", now.num, now.score);\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7344,
"score_of_the_acc": -0.0009,
"final_rank": 2
},
{
"submission_id": "aoj_0099_8818724",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n std::ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n const data &now = Q.top();\n if (now.score == S[now.num]) {\n cout << now.num << \" \" << now.score << '\\n';\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7884,
"score_of_the_acc": -0.009,
"final_rank": 8
},
{
"submission_id": "aoj_0099_8818721",
"code_snippet": "#include <cstdio>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n data now = Q.top();\n while (now.score != S[now.num]) {\n Q.pop();\n now = Q.top();\n }\n printf(\"%d %d\\n\", now.num, now.score);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7284,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0099_8809861",
"code_snippet": "#include <cstdio>\n#include <queue>\n#include <iostream>\n\nconst int MAX = 1000001;\nint S[MAX];\n\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n};\n\nstruct Compare {\n bool operator()(const data& d1, const data& d2) {\n if (d1.score != d2.score)\n return d1.score < d2.score;\n return d1.num > d2.num;\n }\n};\n\nint main() {\n int n, m;\n scanf(\"%d %d\", &n, &m);\n std::priority_queue<data, std::vector<data>, Compare> Q;\n Q.push(data(0, 0));\n\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (!Q.empty()) {\n data now = Q.top();\n if (now.score == S[now.num]) {\n std::cout << now.num << \" \" << now.score << std::endl;\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 7820,
"score_of_the_acc": -0.2937,
"final_rank": 12
},
{
"submission_id": "aoj_0099_8786077",
"code_snippet": "#include <iostream>\n#include <map>\nusing namespace std;\n\nint n, q, a, v;\nmap<int,int> fish;\nmap<int,map<int,bool>,greater<int>> p;\n\nint main() {\n \n cin >> n >> q;\n for(int i = 1; i <= q; i++) {\n cin >> a >> v;\n\n if(p[fish[a]][a]) {\n p[fish[a]].erase(a);\n if(p[fish[a]].size() == 0) p.erase(fish[a]);\n }\n fish[a] += v;\n p[fish[a]][a] = 1;\n \n cout << p.begin() -> second.begin() -> first << \" \" << p.begin() -> first << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 16756,
"score_of_the_acc": -0.7131,
"final_rank": 18
},
{
"submission_id": "aoj_0099_8214412",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n data now = Q.top();\n if (now.score == S[now.num]) {\n printf(\"%d %d\\n\", now.num, now.score);\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7744,
"score_of_the_acc": -0.0069,
"final_rank": 4
},
{
"submission_id": "aoj_0099_8214409",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n data now = Q.top();\n if (now.score == S[now.num]) {\n cout << now.num << \" \" << now.score << endl;\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 7832,
"score_of_the_acc": -0.3296,
"final_rank": 15
},
{
"submission_id": "aoj_0099_8207122",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n data now = Q.top();\n if (now.score == S[now.num]) {\n cout << now.num << \" \" << now.score << \"\\n\";\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 7784,
"score_of_the_acc": -0.0432,
"final_rank": 10
},
{
"submission_id": "aoj_0099_8114821",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n data now = Q.top();\n if (now.score == S[now.num]) {\n printf(\"%d %d\\n\", now.num, now.score);\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7840,
"score_of_the_acc": -0.0083,
"final_rank": 7
},
{
"submission_id": "aoj_0099_8114820",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n data now = Q.top();\n if (now.score == S[now.num]) {\n printf(\"%d %d\\n\", now.num, now.score);\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 7764,
"score_of_the_acc": -0.0429,
"final_rank": 9
},
{
"submission_id": "aoj_0099_8114818",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\n#include <cstring>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n data now = Q.top();\n if (now.score == S[now.num]) {\n printf(\"%d %d\\n\", now.num, now.score);\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7808,
"score_of_the_acc": -0.0078,
"final_rank": 6
},
{
"submission_id": "aoj_0099_8114816",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\nusing namespace std;\nconst int MAX = 1000001;\nint S[MAX];\nstruct data {\n int num, score;\n data() {}\n data(int n, int s) : num(n), score(s) {}\n bool operator<(const data &d) const {\n if (score != d.score)\n return score < d.score;\n return num > d.num;\n }\n};\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, m;\n scanf(\"%d %d\", &n, &m);\n priority_queue<data> Q;\n Q.push(data(0, 0));\n while (m--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n S[a] += b;\n Q.push(data(a, S[a]));\n while (1) {\n data now = Q.top();\n if (now.score == S[now.num]) {\n printf(\"%d %d\\n\", now.num, now.score);\n break;\n }\n Q.pop();\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7776,
"score_of_the_acc": -0.0074,
"final_rank": 5
}
] |
aoj_0115_cpp
|
宇宙船 UAZ アドバンス号
恒星歴 2005.11.5。あなたは宇宙船 UAZ アドバンス号の艦長として敵の宇宙船と交戦しようとしています。 幸い敵の宇宙船はまだこちらに気付かずに静止しています。また、すでに敵の宇宙座標は判明しており強力な直線のビームを放つ「フェザー砲」は発射準備を完了しています。あとは、発射命令を出すばかりです。
ところが、宇宙空間には、敵の設置したエネルギーバリアが存在しています。バリアは三角形をしており「フェザー砲」のビームをはね返してしまいます。また、ビームがバリアに当たれば敵に気付かれて逃げられてしまいます。事前に命中すると判定できなければ、発射命令は出せません。
そこで、UAZ アドバンス号、敵、バリアの位置の宇宙座標(3次元座標
x
,
y
,
z
) を入力して、ビームがバリアをさけて敵に命中する場合は "HIT"、バリアに当たってしまう場合"MISS"と出力するプログラムを作成してください。
ただし、バリアはアドバンス号から 3 角形に見えるものだけが対象であり、線分につぶれて見えるものはないものとします。また、バリアは 3 角形の頂点を含む境界でも有効であり、ビームをはね返すものとします。また、敵がバリア内にいる場合は"MISS"と出力して下さい。
Input
入力データの形式は以下のとおりです：
1 行目は、UAZ アドバンス号の座標 (
x
,
y
,
z
) (整数、半角空白区切り)
2 行目は、敵の座標 (
x
,
y
,
z
) (整数、半角空白区切り)
3 行目は、バリアの頂点 1 の座標 (
x
,
y
,
z
) (整数、半角空白区切り)
4 行目は、バリアの頂点 2 の座標 (
x
,
y
,
z
) (整数、半角空白区切り)
5 行目は、バリアの頂点 3 の座標 (
x
,
y
,
z
) (整数、半角空白区切り)
Output
HIT または MISS と１行に出力してください。
Constraints
-100 ≤
x
,
y
,
z
≤ 100
UAZ アドバンス号と敵が同じ位置にいることはない。
Sample Input 1
-10 0 0
10 0 0
0 10 0
0 10 10
0 0 10
Output for the Sample Input 1
HIT
Sample Input 2
-10 6 6
10 6 6
0 10 0
0 10 10
0 0 10
Output for the Sample Input 2
MISS
|
[
{
"submission_id": "aoj_0115_4449194",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <deque>\n#include <queue>\n#include <algorithm>\n#include <iomanip>\n#include <set>\n#include <map>\n#include <bitset>\n#include <cmath>\n#include <complex>\n#include <array>\n#include <functional>\n\nusing namespace std;\n\n#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)\n#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define FI first\n#define SE second\n#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << endl;}\n#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}cerr << endl;}\n#define ALL(v) v.begin(),v.end()\n#define Decimal fixed<<setprecision(20)\n#define INF 1000000000\n#define LLINF 1000000000000000000LL\n#define MOD 998244353\n\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n//--------geometry original ------------------\n#define curr(PP, i) PP[i]\n#define next(PP, i) PP[(i+1)%PP.size()]\n#define diff(PP, i) (next(PP, i) - curr(PP, i))\n#define eq(n,m) (abs((n)-(m)) < EPS)\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\nconst double EPS = 1e-8;\nconst double EPS_GIG = 1e-3;\nconst double PI = acos(-1.0);\nstruct point {\n\tdouble x, y;\n\tpoint(double x_, double y_):x(x_), y(y_){};\n\tpoint(const point &p):x(p.x), y(p.y){}\n\tpoint():x(0), y(0){}\n\tpoint& operator+=(point a){x += a.x;y += a.y;return *this;}\n\tpoint& operator-=(point a){x -= a.x;y -= a.y;return *this;}\n\tpoint& operator*=(point a){\n\t\tdouble xx = x * a.x - y * a.y;\n\t\tdouble yy = x * a.y + y * a.x;\n\t\tx = xx;y = yy;return *this;\n\t}\n\tpoint& operator*=(double a){x *= a;y *= a;return *this;}\n\tpoint& operator/=(double a){x /= a;y /= a;return *this;}\n\tpoint operator+(point a) const{return point(x, y)+=a;}\n\tpoint operator-(point a) const{return point(x, y)-=a;}\n\tpoint operator*(point a) const{return point(x, y)*=a;}\n\tpoint operator*(double a) const{return point(x, y)*=a;}\n\tpoint operator/(double a) const{return point(x, y)/=a;}\n\tbool operator<(point a) const{return (x != a.x ? x < a.x : y < a.y);}\n\tbool operator==(point a) const{return (abs(x - a.x) < EPS && abs(y - a.y) < EPS);}\n\tbool operator!=(point a) const{return !(abs(x - a.x) >= EPS || abs(y - a.y) >= EPS);}\n\tdouble real() {return x;}\n\tdouble imag() {return y;}\n};\n\ntemplate <class T>\npoint operator*(const T a, const point p){return point(p.x * a, p.y * a);}\n\npoint conj(point p) {return point(p.x, -p.y);}\ndouble arg(point p) {return arg(complex<double>(p.x, p.y));}\ndouble abs(point p) {return abs(complex<double>(p.x, p.y));}\ndouble norm(point p) {return norm(complex<double>(p.x, p.y));}\ndouble real(point p) {return p.x;}\ndouble imag(point p) {return p.y;}\n\nnamespace std {\n\tistream& operator>>(std::istream& is, point& p){\n\t\tis >> p.x >> p.y;\n return is;\n}\n\tostream& operator<<(ostream& os, const point& p){\n\t\tos << p.x << \" \" << p.y;\n\t\treturn os;\n\t}\n}\nstruct circle {\n\tpoint p; double r;\n\tcircle(){}\n\tcircle(const point &p, double r) : p(p), r(r) { }\n};\n\n// 扇型、中心と半径、二つの端点\n// 現在中心角が180未満の前提\nstruct sector {\n\tpoint o;\n\tpoint a, b;\n\tdouble r;\n\tsector(){}\n\tsector(point O, point A, point B, double _r) :o(O), a(A), b(B), r(_r) {}\n};\n\nstruct segment : public array<point, 2> {\n\tsegment(const point &a, const point &b) {\n\t\tat(0) = a;\n\t\tat(1) = b;\n\t}\n};\n\ndouble cross(const point& a, const point& b) {\n\treturn (conj(a)*b).y;\n}\n\ndouble dot(const point& a, const point& b) {\n\treturn (conj(a)*b).x;\n}\n\n//角度足し算\ndouble add_rad(double a,double b){\n\tdouble ret = a + b;\n\tif(ret > 2 * PI)ret -= 2 * PI;\n\treturn ret;\n}\n\n//なす角(vector)\ndouble angle(const point &a,const point &b) {\n\tauto tmp = abs(arg(a) - arg(b));\n\treturn min(tmp, 2 * PI - tmp);\n}\n\ndouble angle(const segment &s1,const segment &s2) {\n\treturn angle(s1[1] - s1[0], s2[1] - s2[0]);\n}\n\n//点の回転\npoint rotate(const point &p, double rad) {\n\tdouble x = p.x * cos(rad) - p.y * sin(rad);\n\tdouble y = p.y * cos(rad) + p.x * sin(rad);\n\treturn point(x, y);\n}\n\n//並行\nbool isParallel(const point &a, const point &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const segment &a, const segment &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n//直行\nbool isOrthogonal(const point &a,const point &b){\n\treturn abs(angle(a,b) - PI / 2) < EPS;\n}\nbool isOrthogonal(const segment &a,const segment &b){\n\treturn isOrthogonal(a[1]-a[0],b[1]-b[0]);\n}\n\n/*\na → b で時計方向に折れて b → c\na → b で半時計方向に折れて b → c\na → b で逆を向いて a を通り越して b → c\na → b でそのまま b → c\na → b で逆を向いて b → c ( または b == c )\n*/\n\nint ccw(point a, point b, point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > EPS) return +1; // counter clockwise\n\tif (cross(b, c) + EPS < 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 segment &l, const segment &m) {\n\treturn abs(cross(l[1] - l[0], m[1] - m[0])) > EPS || // non-parallel\n\t\tabs(cross(l[1] - l[0], m[0] - l[0])) < EPS; // same line\n}\nbool intersectLS(const segment &l, const segment &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 segment &l, const point &p) {\n\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\nbool intersectSP(const segment &s, const point &p) {\n\tauto a = s[0] - p;\n\tauto b = s[1] - p;\n\treturn (abs(cross(a, b)) < EPS && dot(a, b) <= EPS); // triangle inequality\n}\n//端点の交差も考える\nbool intersectSS(const segment &s, const segment &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}\n//端点の交差hは考えない\nbool strictIntersectSS(const segment &s, const segment &t) {\n\treturn ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) == -1 &&\n\t\tccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) == -1;\n}\n\npoint projection(const segment &l, const point &p) {\n\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\treturn l[0] + t*(l[0] - l[1]);\n}\npoint reflection(const segment &l, const point &p) {\n\treturn p + 2. * (projection(l, p) - p);\n}\ndouble distanceLP(const segment &l, const point &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const segment &l, const segment &m) {\n\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const segment &l, const segment &s) {\n\tif (intersectLS(l, s)) return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const segment &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 segment &s, const segment &t) {\n\tif (intersectSS(s, t)) return 0;\n\treturn min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n\t\tmin(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\ndouble distancePP(const point &a,const point &b){\n\treturn abs(a-b);\n}\n\n/*多角形内包判定\nhalf-line crossing method\nOUT:0\nON:1\nIN:2\n*/\nint contains(const vector<point>& Poly, const point& p) {\n\tbool in = false;\n\tfor (int i = 0; i < Poly.size(); ++i) {\n\t\tpoint a = curr(Poly, i) - p, b = next(Poly, i) - p;\n\t\tif (a.y > b.y) swap(a, b);\n\t\tif (a.y < EPS && EPS < b.y && cross(a, b) > EPS)in = !in;\n\t\tif (abs(cross(a, b)) < EPS && dot(a, b) < EPS) return 1;\n\t}\n\treturn in ? 2 : 0;\n}\n\n/*\nOUT:0\nON:1\nIN:2\n*/\nint contain_sector(const sector &sec, point &p){\n\tif(eq(abs(p - sec.o), sec.r))return 1;\n\tif(intersectSP(segment(sec.o, sec.a), p))return 1;\n\tif(intersectSP(segment(sec.o, sec.b), p))return 1;\n\tif(abs(p - sec.o) + EPS > sec.r)return 0;\n\tpoint vec = p - sec.o;\n\tpoint vecA = sec.a - sec.o;\n\tpoint vecB = sec.b - sec.o;\n\tif(angle(vec, vecA) + EPS < angle(vecA, vecB) && angle(vec, vecB) + EPS < angle(vecA, vecB))return 2;\n\treturn 0;\n}\n\n//交点\npoint crosspointSS(const segment &l, const segment &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) return point(INF,INF); // !!!PRECONDITION NOT SATISFIED!!!\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\n\nvector<point> crosspointCL(const circle &c, const segment &l) {\n\tauto ret = vector<point>(2, point(INF, INF));\n\tauto pro_p = projection(l, c.p);\n\tauto dist = distanceLP(l, c.p);\n\tif(abs(dist - c.r) < EPS){\n\t\tret[0] = pro_p;\n\t\treturn ret;\n\t}\n\tif(c.r < dist){\n\t\treturn ret;\n\t}\n\tpoint vec = (l[1] - l[0]) * sqrt(c.r * c.r - dist * dist) / abs(l[1] - l[0]);\n\tret[0] = pro_p + vec;\n\tret[1] = pro_p - vec;\n\treturn ret;\n}\n\nvector<point> crosspointCC(const circle c1, const circle c2) {\n\tauto ret = vector<point>(2, point(INF, INF));\n\tauto dist = abs(c2.p - c1.p);\n\tif(eq(dist, c1.r + c2.r) || eq(dist, abs(c2.r - c1.r))){\n\t\tauto tmp = c2.p - c1.p;\n\t\tret[0] = c1.p + tmp * (c1.r / dist);\n\t\treturn ret;\n\t}\n\tif(c1.r + c2.r < dist || dist < abs(c1.r - c2.r)){\n\t\treturn ret;\n\t}\n\tauto alpha = acos((c1.r * c1.r + dist * dist - c2.r * c2.r) / (2 * c1.r * dist));\n\tauto theta = atan2(c2.p.y - c1.p.y, c2.p.x - c1.p.x);\n\tret[0] = c1.p + point(cos(theta + alpha) * c1.r, sin(theta + alpha) * c1.r);\n\tret[1] = c1.p + point(cos(theta - alpha) * c1.r, sin(theta - alpha) * c1.r);\n\treturn ret;\n}\n\nbool isOnSector(const sector sec, const point p) {\n\tpoint vec = p - sec.o;\n\tpoint vecA = sec.a - sec.o;\n\tpoint vecB = sec.b - sec.o;\n\tif(eq(angle(vec, vecA) + angle(vec, vecB), angle(vecA, vecB)))return true;\n\treturn false;\n}\n\nvector<point> crosspointSecS(const sector sec, const segment s) {\n\tcircle c = circle(sec.o, sec.r);\n\tauto ret = crosspointCL(c, s);\n\tpoint inf = point(INF, INF);\n\tREP(i, 2){\n\t\tif(eq(ret[i], inf))continue;\n\t\tif(!isOnSector(sec, ret[i])){\n\t\t\tret[i] = inf;\n\t\t\tcontinue;\n\t\t}\n\t\tif(!intersectSP(s, ret[i])){\n\t\t\tret[i] = inf;\n\t\t}\n\t}\n\treturn ret;\n}\nvector<point> crosspointSecSec(const sector sec1, const sector sec2) {\n\tcircle c1 = circle(sec1.o, sec1.r);\n\tcircle c2 = circle(sec2.o, sec2.r);\n\tauto ret = crosspointCC(c1, c2);\n\tpoint inf = point(INF, INF);\n\tREP(i, 2){\n\t\tif(!isOnSector(sec1, ret[i])){\n\t\t\tret[i] = inf;\n\t\t\tcontinue;\n\t\t}\n\t\tif(!isOnSector(sec2, ret[i])){\n\t\t\tret[i] = inf;\n\t\t}\n\t}\n\treturn ret;\n}\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]) == -1) --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]) == -1) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n//見えるか(可視グラフ用)\nbool block_off(const point &a, const point &b, const vector<point> &obj) {\n point m = (a + b) * 0.5;\n bool on = false, in = false;\n for (int j = 0; j < obj.size(); ++j) {\n point c = curr(obj,j), d = next(obj,j);\n if (d.y < c.y) swap(c, d);\n if (cross(a-c,b-c) * cross(a-d,b-d) < 0 && // strictly intersect.\n cross(c-a,d-a) * cross(c-b,d-b) < 0) return true;\n if (cross(a-c,b-c) == 0 && dot(a-c,b-c) < 0) return true;\n if (c.y <= m.y && m.y < d.y) // strictly contain.\n if (cross(c-m,d-m) < 0) in = !in;\n if (cross(c-m,d-m) == 0 && dot(c-m,d-m) <= EPS) on = true;\n }\n return !on && in;\n}\n\n//面積\ndouble area(const vector<point>& p) {\n\tdouble A = 0;\n\tfor (int i = 0; i < p.size(); ++i)\n\t\tA += cross(curr(p, i), next(p, i));\n\treturn A / 2.;\n}\n\n//凸包判定\nbool isConvex(vector<point> poly){\n\tint sz = poly.size();\n\tREP(i,sz){\n\t\tif(ccw(poly[i],poly[(i+1)%sz],poly[(i+2)%sz]) == -1)return false;\n\t}\n\treturn true;\n}\n\ndouble convex_diameter(const vector<point> &pt) {\n const int n = pt.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (pt[i].y > pt[is].y) is = i;\n if (pt[i].y < pt[js].y) js = i;\n }\n double maxd = norm(pt[is]-pt[js]);\n\n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\n else i = (i+1) % n;\n if (norm(pt[i]-pt[j]) > maxd) {\n maxd = norm(pt[i]-pt[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}\n\nvector<point> convex_cut(const vector<point> P, const segment& l) {\n vector<point> Q;\n for (int i = 0; i < P.size(); ++i) {\n point A = curr(P, i), B = next(P, i);\n if (ccw(l[0], l[1], A) != -1) Q.push_back(A);\n if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\n Q.push_back(crosspointSS(segment(A, B), l));\n }\n return Q;\n}\n\npoint max_circle_size_in_polygon_check(double mid, vector<point> &v){\n\tll n = v.size();\n\tvector<point> now(v);\n\tREP(i, n){\n\t\tauto a = v[i];\n\t\tauto b = v[(i+1)%n];\n\t\tauto vec = b - a;\n\t\tvec /= abs(vec);\n\t\tvec *= mid;\n\t\tvec = vec * point(0, 1);\n\t\tsegment seg = segment(a + vec, b + vec);\n\t\tnow = convex_cut(now, seg);\n\t}\n\treturn (now.empty() ? point(INF, INF): now[0]);\n}\n\n// 凸多角形に入る最大の円\ncircle max_circle_size_in_polygon(vector<point> &v){\n\tdouble l = 0;\n\tdouble r = convex_diameter(v);\n\tpoint ret;\n\tREP(_, 1000){\n\t\tif(abs(l - r) < EPS)break;\n\t\tdouble mid = (l + r) / 2;\n\t\tret = max_circle_size_in_polygon_check(mid, v);\n\t\tif(ret != point(INF, INF))l = mid;\n\t\telse r = mid;\n\t}\n\treturn circle(ret, l);\n}\n\n// 三角形の外接円\ncircle circumscribed_circle(vector<point> p) {\n\tsegment seg_a = segment((p[1] + p[0]) * 0.5,\n\t(p[1] + p[0]) * 0.5 + (p[1] - p[0]) * point(0, 1));\n\tsegment seg_b = segment((p[2] + p[1]) * 0.5,\n\t(p[2] + p[1]) * 0.5 + (p[2] - p[1]) * point(0, 1));\n\tcircle ret;\n\tret.p = crosspointSS(seg_a, seg_b);\n\tret.r = distancePP(p[0], ret.p);\n\treturn ret;\n}\n\n// ################################### 3D ####################################\n\nstruct point3d {\n\tdouble x, y, z;\n\tpoint3d():x(0), y(0), z(0){}\n\tpoint3d(const point3d &p):x(p.x), y(p.y), z(p.z){}\n\tpoint3d(double x_, double y_, double z_):x(x_), y(y_), z(z_){}\n\n\tpoint3d& operator+=(point3d a){x += a.x;y += a.y;z += a.z;return *this;}\n\tpoint3d& operator-=(point3d a){x -= a.x;y -= a.y;z -= a.z;return *this;}\n\tpoint3d& operator*=(double a){x *= a;y *= a;z *= a;return *this;}\n\tpoint3d& operator/=(double a){x /= a;y /= a;z /= a;return *this;}\n\tpoint3d operator+(point3d a) const{return point3d(x, y, z)+=a;}\n\tpoint3d operator-(point3d a) const{return point3d(x, y, z)-=a;}\n\tpoint3d operator*(double a) const{return point3d(x, y, z)*=a;}\n\tpoint3d operator/(double a) const{return point3d(x, y, z)/=a;}\n\tbool operator<(point3d a) const{\n\t\treturn (x != a.x ? x < a.x : (y != a.y ? y < a.y : z < a.z));}\n\tbool operator==(point3d a) const{\n\t\treturn (abs(x - a.x) < EPS && abs(y - a.y) < EPS && abs(z - a.z) < EPS);\n\t}\n\tbool operator!=(point3d a) const{return !(*this == a);}\n};\n\nstruct segment3d: public array<point3d, 2> {\n\tsegment3d(const point3d &a, const point3d &b) {\n\t\tat(0) = a;\n\t\tat(1) = b;\n\t}\n};\n\ndouble abs(point3d p) {\n\treturn sqrt(p.x * p.x + p.y * p.y + p.z * p.z);\n}\n\ndouble dot(point3d a, point3d b){\n\treturn a.x * b.x + a.y * b.y + a.z * b.z;\n}\n\npoint3d cross(point3d a, point3d b){\n\treturn point3d(a.y * b.z - a.z * b.y,\n\t\t\t\t\t\t\t\t a.z * b.x - a.x * b.z,\n\t\t\t\t\t\t\t a.x * b.y - a.y * b.x);\n}\n\ndouble angle(point3d a, point3d b){\n\treturn acos(dot(a, b) / (abs(a) * abs(b)));\n}\n\nstruct plane {\n\tdouble a, b, c, d;\n\tplane():a(0), b(0), c(0), d(0){}\n\tplane(double a_, double b_, double c_, double d_):a(a_), b(b_), c(c_), d(d_){}\n\tplane(point3d p1, point3d p2, point3d p3){\n\t\tpoint3d A = p2 - p1;\n\t\tpoint3d B = p3 - p1;\n\t\tpoint3d p = cross(A, B);\n\t\ta = p.x;b = p.y;c = p.z;\n\t\td = -(a * p1.x + b * p1.y + c * p1.z);\n\t}\n\tdouble assignment(point3d p){\n\t\treturn a * p.x + b * p.y + c * p.z + d;\n\t}\n};\n\ndouble distance(point3d p, plane pl){\n\tdouble a = abs(p.x * pl.a + p.y * pl.b + p.z * pl.c + pl.d);\n\tdouble b = sqrt(pl.a * pl.a + pl.b * pl.b + pl.c * pl.c);\n\treturn a / b;\n}\n\ndouble distance(plane p, point3d pl){\n\treturn distance(pl, p);\n}\n\npoint3d projection(point3d p, plane pl){\n\tdouble d = distance(p, pl);\n\tpoint3d a = point3d(pl.a, pl.b, pl.c);a /= abs(a);\n\tpoint3d ret = p + a * d;\n\tif(distance(ret, pl) < EPS)return ret;\n\treturn p - a * d;\n}\n\npoint3d crossPoint3d(segment3d s, plane p){\n\tdouble bunsi = p.a * s[0].x + p.b * s[0].y + p.c * s[0].z + p.d;\n\tdouble bunbo = p.a * (s[0].x - s[1].x) +\n\t\t\t\t\t\t\t\t p.b * (s[0].y - s[1].y) +\n\t\t\t\t\t\t\t\t p.c * (s[0].z - s[1].z);\n\tif(abs(bunbo) < EPS)return point3d(INF, INF, INF);\n\tdouble t = bunsi / bunbo;\n\treturn s[0] + (s[1] - s[0]) * t;\n}\n\nnamespace std {\n\tistream& operator>>(std::istream& is, point3d& p){\n\t\tis >> p.x >> p.y >> p.z;\n\t\treturn is;\n\t}\n\n\tostream& operator<<(ostream& os, const point3d& p){\n\t\tos << p.x << \" \" << p.y << \" \" << p.z;\n\t\treturn os;\n\t}\n\n\tostream& operator<<(ostream& os, const plane& p){\n\t\tos << p.a << \"x + \" << p.b << \"y + \" << p.c << \"z + \" << p.d;\n\t\treturn os;\n\t}\n}\n\n// ################################### 3D ####################################\n\nint main(){\n\tcin.tie(0);cout.tie(0);ios::sync_with_stdio(false);\n\n\tpoint3d uaz;\n\tpoint3d enemy;\n\tpoint3d a, b, c;\n\tcin >> uaz >> enemy >> a >> b >> c;\n\tplane pl = plane(a, b, c);\n\n\tif(pl.assignment(uaz) * pl.assignment(enemy) > 0){\n\t\tcout << \"HIT\" << endl;\n\t}\n\n\tpoint3d pa = projection(uaz, pl);\n\tpoint3d pb = projection(enemy, pl);\n\tREP(i, 1000000 + 1){\n\t\tpoint3d p = pa + (pb - pa) * (i / 1000000);\n\t\tif(eq(angle(a - p, b - p) + angle(c - p, b - p) + angle(a - p, c - p), 2 * PI)){\n\t\t\tcout << \"MISS\" << endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tcout << \"HIT\" << endl;\n\n\treturn 0;\n}",
"accuracy": 0.02631578947368421,
"time_ms": 90,
"memory_kb": 3388,
"score_of_the_acc": -1,
"final_rank": 2
},
{
"submission_id": "aoj_0115_4449129",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <deque>\n#include <queue>\n#include <algorithm>\n#include <iomanip>\n#include <set>\n#include <map>\n#include <bitset>\n#include <cmath>\n#include <complex>\n#include <array>\n#include <functional>\n\nusing namespace std;\n\n#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)\n#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define FI first\n#define SE second\n#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << endl;}\n#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}cerr << endl;}\n#define ALL(v) v.begin(),v.end()\n#define Decimal fixed<<setprecision(20)\n#define INF 1000000000\n#define LLINF 1000000000000000000LL\n#define MOD 998244353\n\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n//--------geometry original ------------------\n#define curr(PP, i) PP[i]\n#define next(PP, i) PP[(i+1)%PP.size()]\n#define diff(PP, i) (next(PP, i) - curr(PP, i))\n#define eq(n,m) (abs((n)-(m)) < EPS)\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\nconst double EPS = 1e-8;\nconst double EPS_GIG = 1e-3;\nconst double PI = acos(-1.0);\nstruct point {\n\tdouble x, y;\n\tpoint(double x_, double y_):x(x_), y(y_){};\n\tpoint(const point &p):x(p.x), y(p.y){}\n\tpoint():x(0), y(0){}\n\tpoint& operator+=(point a){x += a.x;y += a.y;return *this;}\n\tpoint& operator-=(point a){x -= a.x;y -= a.y;return *this;}\n\tpoint& operator*=(point a){\n\t\tdouble xx = x * a.x - y * a.y;\n\t\tdouble yy = x * a.y + y * a.x;\n\t\tx = xx;y = yy;return *this;\n\t}\n\tpoint& operator*=(double a){x *= a;y *= a;return *this;}\n\tpoint& operator/=(double a){x /= a;y /= a;return *this;}\n\tpoint operator+(point a) const{return point(x, y)+=a;}\n\tpoint operator-(point a) const{return point(x, y)-=a;}\n\tpoint operator*(point a) const{return point(x, y)*=a;}\n\tpoint operator*(double a) const{return point(x, y)*=a;}\n\tpoint operator/(double a) const{return point(x, y)/=a;}\n\tbool operator<(point a) const{return (x != a.x ? x < a.x : y < a.y);}\n\tbool operator==(point a) const{return (abs(x - a.x) < EPS && abs(y - a.y) < EPS);}\n\tbool operator!=(point a) const{return !(abs(x - a.x) >= EPS || abs(y - a.y) >= EPS);}\n\tdouble real() {return x;}\n\tdouble imag() {return y;}\n};\n\ntemplate <class T>\npoint operator*(const T a, const point p){return point(p.x * a, p.y * a);}\n\npoint conj(point p) {return point(p.x, -p.y);}\ndouble arg(point p) {return arg(complex<double>(p.x, p.y));}\ndouble abs(point p) {return abs(complex<double>(p.x, p.y));}\ndouble norm(point p) {return norm(complex<double>(p.x, p.y));}\ndouble real(point p) {return p.x;}\ndouble imag(point p) {return p.y;}\n\nnamespace std {\n\tistream& operator>>(std::istream& is, point& p){\n\t\tis >> p.x >> p.y;\n return is;\n}\n\tostream& operator<<(ostream& os, const point& p){\n\t\tos << p.x << \" \" << p.y;\n\t\treturn os;\n\t}\n}\nstruct circle {\n\tpoint p; double r;\n\tcircle(){}\n\tcircle(const point &p, double r) : p(p), r(r) { }\n};\n\n// 扇型、中心と半径、二つの端点\n// 現在中心角が180未満の前提\nstruct sector {\n\tpoint o;\n\tpoint a, b;\n\tdouble r;\n\tsector(){}\n\tsector(point O, point A, point B, double _r) :o(O), a(A), b(B), r(_r) {}\n};\n\nstruct segment : public array<point, 2> {\n\tsegment(const point &a, const point &b) {\n\t\tat(0) = a;\n\t\tat(1) = b;\n\t}\n};\n\ndouble cross(const point& a, const point& b) {\n\treturn (conj(a)*b).y;\n}\n\ndouble dot(const point& a, const point& b) {\n\treturn (conj(a)*b).x;\n}\n\n//角度足し算\ndouble add_rad(double a,double b){\n\tdouble ret = a + b;\n\tif(ret > 2 * PI)ret -= 2 * PI;\n\treturn ret;\n}\n\n//なす角(vector)\ndouble angle(const point &a,const point &b) {\n\tauto tmp = abs(arg(a) - arg(b));\n\treturn min(tmp, 2 * PI - tmp);\n}\n\ndouble angle(const segment &s1,const segment &s2) {\n\treturn angle(s1[1] - s1[0], s2[1] - s2[0]);\n}\n\n//点の回転\npoint rotate(const point &p, double rad) {\n\tdouble x = p.x * cos(rad) - p.y * sin(rad);\n\tdouble y = p.y * cos(rad) + p.x * sin(rad);\n\treturn point(x, y);\n}\n\n//並行\nbool isParallel(const point &a, const point &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const segment &a, const segment &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n//直行\nbool isOrthogonal(const point &a,const point &b){\n\treturn abs(angle(a,b) - PI / 2) < EPS;\n}\nbool isOrthogonal(const segment &a,const segment &b){\n\treturn isOrthogonal(a[1]-a[0],b[1]-b[0]);\n}\n\n/*\na → b で時計方向に折れて b → c\na → b で半時計方向に折れて b → c\na → b で逆を向いて a を通り越して b → c\na → b でそのまま b → c\na → b で逆を向いて b → c ( または b == c )\n*/\n\nint ccw(point a, point b, point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > EPS) return +1; // counter clockwise\n\tif (cross(b, c) + EPS < 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 segment &l, const segment &m) {\n\treturn abs(cross(l[1] - l[0], m[1] - m[0])) > EPS || // non-parallel\n\t\tabs(cross(l[1] - l[0], m[0] - l[0])) < EPS; // same line\n}\nbool intersectLS(const segment &l, const segment &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 segment &l, const point &p) {\n\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\nbool intersectSP(const segment &s, const point &p) {\n\tauto a = s[0] - p;\n\tauto b = s[1] - p;\n\treturn (abs(cross(a, b)) < EPS && dot(a, b) <= EPS); // triangle inequality\n}\n//端点の交差も考える\nbool intersectSS(const segment &s, const segment &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}\n//端点の交差hは考えない\nbool strictIntersectSS(const segment &s, const segment &t) {\n\treturn ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) == -1 &&\n\t\tccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) == -1;\n}\n\npoint projection(const segment &l, const point &p) {\n\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\treturn l[0] + t*(l[0] - l[1]);\n}\npoint reflection(const segment &l, const point &p) {\n\treturn p + 2. * (projection(l, p) - p);\n}\ndouble distanceLP(const segment &l, const point &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const segment &l, const segment &m) {\n\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const segment &l, const segment &s) {\n\tif (intersectLS(l, s)) return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const segment &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 segment &s, const segment &t) {\n\tif (intersectSS(s, t)) return 0;\n\treturn min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n\t\tmin(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\ndouble distancePP(const point &a,const point &b){\n\treturn abs(a-b);\n}\n\n/*多角形内包判定\nhalf-line crossing method\nOUT:0\nON:1\nIN:2\n*/\nint contains(const vector<point>& Poly, const point& p) {\n\tbool in = false;\n\tfor (int i = 0; i < Poly.size(); ++i) {\n\t\tpoint a = curr(Poly, i) - p, b = next(Poly, i) - p;\n\t\tif (a.y > b.y) swap(a, b);\n\t\tif (a.y < EPS && EPS < b.y && cross(a, b) > EPS)in = !in;\n\t\tif (abs(cross(a, b)) < EPS && dot(a, b) < EPS) return 1;\n\t}\n\treturn in ? 2 : 0;\n}\n\n/*\nOUT:0\nON:1\nIN:2\n*/\nint contain_sector(const sector &sec, point &p){\n\tif(eq(abs(p - sec.o), sec.r))return 1;\n\tif(intersectSP(segment(sec.o, sec.a), p))return 1;\n\tif(intersectSP(segment(sec.o, sec.b), p))return 1;\n\tif(abs(p - sec.o) + EPS > sec.r)return 0;\n\tpoint vec = p - sec.o;\n\tpoint vecA = sec.a - sec.o;\n\tpoint vecB = sec.b - sec.o;\n\tif(angle(vec, vecA) + EPS < angle(vecA, vecB) && angle(vec, vecB) + EPS < angle(vecA, vecB))return 2;\n\treturn 0;\n}\n\n//交点\npoint crosspointSS(const segment &l, const segment &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) return point(INF,INF); // !!!PRECONDITION NOT SATISFIED!!!\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\n\nvector<point> crosspointCL(const circle &c, const segment &l) {\n\tauto ret = vector<point>(2, point(INF, INF));\n\tauto pro_p = projection(l, c.p);\n\tauto dist = distanceLP(l, c.p);\n\tif(abs(dist - c.r) < EPS){\n\t\tret[0] = pro_p;\n\t\treturn ret;\n\t}\n\tif(c.r < dist){\n\t\treturn ret;\n\t}\n\tpoint vec = (l[1] - l[0]) * sqrt(c.r * c.r - dist * dist) / abs(l[1] - l[0]);\n\tret[0] = pro_p + vec;\n\tret[1] = pro_p - vec;\n\treturn ret;\n}\n\nvector<point> crosspointCC(const circle c1, const circle c2) {\n\tauto ret = vector<point>(2, point(INF, INF));\n\tauto dist = abs(c2.p - c1.p);\n\tif(eq(dist, c1.r + c2.r) || eq(dist, abs(c2.r - c1.r))){\n\t\tauto tmp = c2.p - c1.p;\n\t\tret[0] = c1.p + tmp * (c1.r / dist);\n\t\treturn ret;\n\t}\n\tif(c1.r + c2.r < dist || dist < abs(c1.r - c2.r)){\n\t\treturn ret;\n\t}\n\tauto alpha = acos((c1.r * c1.r + dist * dist - c2.r * c2.r) / (2 * c1.r * dist));\n\tauto theta = atan2(c2.p.y - c1.p.y, c2.p.x - c1.p.x);\n\tret[0] = c1.p + point(cos(theta + alpha) * c1.r, sin(theta + alpha) * c1.r);\n\tret[1] = c1.p + point(cos(theta - alpha) * c1.r, sin(theta - alpha) * c1.r);\n\treturn ret;\n}\n\nbool isOnSector(const sector sec, const point p) {\n\tpoint vec = p - sec.o;\n\tpoint vecA = sec.a - sec.o;\n\tpoint vecB = sec.b - sec.o;\n\tif(eq(angle(vec, vecA) + angle(vec, vecB), angle(vecA, vecB)))return true;\n\treturn false;\n}\n\nvector<point> crosspointSecS(const sector sec, const segment s) {\n\tcircle c = circle(sec.o, sec.r);\n\tauto ret = crosspointCL(c, s);\n\tpoint inf = point(INF, INF);\n\tREP(i, 2){\n\t\tif(eq(ret[i], inf))continue;\n\t\tif(!isOnSector(sec, ret[i])){\n\t\t\tret[i] = inf;\n\t\t\tcontinue;\n\t\t}\n\t\tif(!intersectSP(s, ret[i])){\n\t\t\tret[i] = inf;\n\t\t}\n\t}\n\treturn ret;\n}\nvector<point> crosspointSecSec(const sector sec1, const sector sec2) {\n\tcircle c1 = circle(sec1.o, sec1.r);\n\tcircle c2 = circle(sec2.o, sec2.r);\n\tauto ret = crosspointCC(c1, c2);\n\tpoint inf = point(INF, INF);\n\tREP(i, 2){\n\t\tif(!isOnSector(sec1, ret[i])){\n\t\t\tret[i] = inf;\n\t\t\tcontinue;\n\t\t}\n\t\tif(!isOnSector(sec2, ret[i])){\n\t\t\tret[i] = inf;\n\t\t}\n\t}\n\treturn ret;\n}\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]) == -1) --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]) == -1) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n//見えるか(可視グラフ用)\nbool block_off(const point &a, const point &b, const vector<point> &obj) {\n point m = (a + b) * 0.5;\n bool on = false, in = false;\n for (int j = 0; j < obj.size(); ++j) {\n point c = curr(obj,j), d = next(obj,j);\n if (d.y < c.y) swap(c, d);\n if (cross(a-c,b-c) * cross(a-d,b-d) < 0 && // strictly intersect.\n cross(c-a,d-a) * cross(c-b,d-b) < 0) return true;\n if (cross(a-c,b-c) == 0 && dot(a-c,b-c) < 0) return true;\n if (c.y <= m.y && m.y < d.y) // strictly contain.\n if (cross(c-m,d-m) < 0) in = !in;\n if (cross(c-m,d-m) == 0 && dot(c-m,d-m) <= EPS) on = true;\n }\n return !on && in;\n}\n\n//面積\ndouble area(const vector<point>& p) {\n\tdouble A = 0;\n\tfor (int i = 0; i < p.size(); ++i)\n\t\tA += cross(curr(p, i), next(p, i));\n\treturn A / 2.;\n}\n\n//凸包判定\nbool isConvex(vector<point> poly){\n\tint sz = poly.size();\n\tREP(i,sz){\n\t\tif(ccw(poly[i],poly[(i+1)%sz],poly[(i+2)%sz]) == -1)return false;\n\t}\n\treturn true;\n}\n\ndouble convex_diameter(const vector<point> &pt) {\n const int n = pt.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (pt[i].y > pt[is].y) is = i;\n if (pt[i].y < pt[js].y) js = i;\n }\n double maxd = norm(pt[is]-pt[js]);\n\n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\n else i = (i+1) % n;\n if (norm(pt[i]-pt[j]) > maxd) {\n maxd = norm(pt[i]-pt[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}\n\nvector<point> convex_cut(const vector<point> P, const segment& l) {\n vector<point> Q;\n for (int i = 0; i < P.size(); ++i) {\n point A = curr(P, i), B = next(P, i);\n if (ccw(l[0], l[1], A) != -1) Q.push_back(A);\n if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\n Q.push_back(crosspointSS(segment(A, B), l));\n }\n return Q;\n}\n\npoint max_circle_size_in_polygon_check(double mid, vector<point> &v){\n\tll n = v.size();\n\tvector<point> now(v);\n\tREP(i, n){\n\t\tauto a = v[i];\n\t\tauto b = v[(i+1)%n];\n\t\tauto vec = b - a;\n\t\tvec /= abs(vec);\n\t\tvec *= mid;\n\t\tvec = vec * point(0, 1);\n\t\tsegment seg = segment(a + vec, b + vec);\n\t\tnow = convex_cut(now, seg);\n\t}\n\treturn (now.empty() ? point(INF, INF): now[0]);\n}\n\n// 凸多角形に入る最大の円\ncircle max_circle_size_in_polygon(vector<point> &v){\n\tdouble l = 0;\n\tdouble r = convex_diameter(v);\n\tpoint ret;\n\tREP(_, 1000){\n\t\tif(abs(l - r) < EPS)break;\n\t\tdouble mid = (l + r) / 2;\n\t\tret = max_circle_size_in_polygon_check(mid, v);\n\t\tif(ret != point(INF, INF))l = mid;\n\t\telse r = mid;\n\t}\n\treturn circle(ret, l);\n}\n\n// 三角形の外接円\ncircle circumscribed_circle(vector<point> p) {\n\tsegment seg_a = segment((p[1] + p[0]) * 0.5,\n\t(p[1] + p[0]) * 0.5 + (p[1] - p[0]) * point(0, 1));\n\tsegment seg_b = segment((p[2] + p[1]) * 0.5,\n\t(p[2] + p[1]) * 0.5 + (p[2] - p[1]) * point(0, 1));\n\tcircle ret;\n\tret.p = crosspointSS(seg_a, seg_b);\n\tret.r = distancePP(p[0], ret.p);\n\treturn ret;\n}\n\n// ################################### 3D ####################################\n\nstruct point3d {\n\tdouble x, y, z;\n\tpoint3d():x(0), y(0), z(0){}\n\tpoint3d(const point3d &p):x(p.x), y(p.y), z(p.z){}\n\tpoint3d(double x_, double y_, double z_):x(x_), y(y_), z(z_){}\n\n\tpoint3d& operator+=(point3d a){x += a.x;y += a.y;z += a.z;return *this;}\n\tpoint3d& operator-=(point3d a){x -= a.x;y -= a.y;z -= a.z;return *this;}\n\tpoint3d& operator*=(double a){x *= a;y *= a;z *= a;return *this;}\n\tpoint3d& operator/=(double a){x /= a;y /= a;z /= a;return *this;}\n\tpoint3d operator+(point3d a) const{return point3d(x, y, z)+=a;}\n\tpoint3d operator-(point3d a) const{return point3d(x, y, z)-=a;}\n\tpoint3d operator*(double a) const{return point3d(x, y, z)*=a;}\n\tpoint3d operator/(double a) const{return point3d(x, y, z)/=a;}\n\tbool operator<(point3d a) const{\n\t\treturn (x != a.x ? x < a.x : (y != a.y ? y < a.y : z < a.z));}\n\tbool operator==(point3d a) const{\n\t\treturn (abs(x - a.x) < EPS && abs(y - a.y) < EPS && abs(z - a.z) < EPS);\n\t}\n\tbool operator!=(point3d a) const{return !(*this == a);}\n};\n\nstruct segment3d: public array<point3d, 2> {\n\tsegment3d(const point3d &a, const point3d &b) {\n\t\tat(0) = a;\n\t\tat(1) = b;\n\t}\n};\n\ndouble abs(point3d p) {\n\treturn sqrt(p.x * p.x + p.y * p.y + p.z * p.z);\n}\n\ndouble dot(point3d a, point3d b){\n\treturn a.x * b.x + a.y * b.y + a.z * b.z;\n}\n\npoint3d cross(point3d a, point3d b){\n\treturn point3d(a.y * b.z - a.z * b.y,\n\t\t\t\t\t\t\t\t a.z * b.x - a.x * b.z,\n\t\t\t\t\t\t\t a.x * b.y - a.y * b.x);\n}\n\ndouble angle(point3d a, point3d b){\n\treturn acos(dot(a, b) / (abs(a) * abs(b)));\n}\n\nstruct plane {\n\tdouble a, b, c, d;\n\tplane():a(0), b(0), c(0), d(0){}\n\tplane(double a_, double b_, double c_, double d_):a(a_), b(b_), c(c_), d(d_){}\n\tplane(point3d p1, point3d p2, point3d p3){\n\t\tpoint3d A = p2 - p1;\n\t\tpoint3d B = p3 - p1;\n\t\tpoint3d p = cross(A, B);\n\t\ta = p.x;b = p.y;c = p.z;\n\t\td = -(a * p1.x + b * p1.y + c * p1.z);\n\t}\n\tdouble assignment(point3d p){\n\t\treturn a * p.x + b * p.y + c * p.z + d;\n\t}\n};\n\ndouble distance(point3d p, plane pl){\n\tdouble a = abs(p.x * pl.a + p.y * pl.b + p.z * pl.c + pl.d);\n\tdouble b = sqrt(pl.a * pl.a + pl.b * pl.b + pl.c * pl.c);\n\treturn a / b;\n}\n\ndouble distance(plane p, point3d pl){\n\treturn distance(pl, p);\n}\n\npoint3d projection(point3d p, plane pl){\n\tdouble d = distance(p, pl);\n\tpoint3d a = point3d(pl.a, pl.b, pl.c);a /= abs(a);\n\tpoint3d ret = p + a * d;\n\tif(distance(ret, pl) < EPS)return ret;\n\treturn p - a * d;\n}\n\npoint3d crossPoint3d(segment3d s, plane p){\n\tdouble bunsi = p.a * s[0].x + p.b * s[0].y + p.c * s[0].z + p.d;\n\tdouble bunbo = p.a * (s[0].x - s[1].x) +\n\t\t\t\t\t\t\t\t p.b * (s[0].y - s[1].y) +\n\t\t\t\t\t\t\t\t p.c * (s[0].z - s[1].z);\n\tif(abs(bunbo) < EPS)return point3d(INF, INF, INF);\n\tdouble t = bunsi / bunbo;\n\treturn s[0] + (s[1] - s[0]) * t;\n}\n\nnamespace std {\n\tistream& operator>>(std::istream& is, point3d& p){\n\t\tis >> p.x >> p.y >> p.z;\n\t\treturn is;\n\t}\n\n\tostream& operator<<(ostream& os, const point3d& p){\n\t\tos << p.x << \" \" << p.y << \" \" << p.z;\n\t\treturn os;\n\t}\n\n\tostream& operator<<(ostream& os, const plane& p){\n\t\tos << p.a << \"x + \" << p.b << \"y + \" << p.c << \"z + \" << p.d;\n\t\treturn os;\n\t}\n}\n\n// ################################### 3D ####################################\n\nint main(){\n\tcin.tie(0);cout.tie(0);ios::sync_with_stdio(false);\n\n\tpoint3d uaz;\n\tpoint3d enemy;\n\tpoint3d a, b, c;\n\tcin >> uaz >> enemy >> a >> b >> c;\n\tplane pl = plane(a, b, c);\n\n \tif(pl.assignment(uaz) * pl.assignment(enemy) > EPS){\n\t\tcout << \"HIT\" << endl;\n\t\treturn 0;\n\t}\n\n\tREP(i, 1000000 + 1){\n\t\tauto p = uaz + (enemy - uaz) * (i / 1000000);\n\t\tif(eq(angle(a - p, b - p) + angle(c - p, b - p) + angle(a - p, c - p), 2 * PI)){\n\t\t\tcout << \"MISS\" << endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tcout << \"HIT\" << endl;\n\n\treturn 0;\n}",
"accuracy": 0.013157894736842105,
"time_ms": 90,
"memory_kb": 3388,
"score_of_the_acc": -1,
"final_rank": 3
},
{
"submission_id": "aoj_0115_4449122",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <deque>\n#include <queue>\n#include <algorithm>\n#include <iomanip>\n#include <set>\n#include <map>\n#include <bitset>\n#include <cmath>\n#include <complex>\n#include <array>\n#include <functional>\n\nusing namespace std;\n\n#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)\n#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define FI first\n#define SE second\n#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << endl;}\n#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}cerr << endl;}\n#define ALL(v) v.begin(),v.end()\n#define Decimal fixed<<setprecision(20)\n#define INF 1000000000\n#define LLINF 1000000000000000000LL\n#define MOD 998244353\n\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n//--------geometry original ------------------\n#define curr(PP, i) PP[i]\n#define next(PP, i) PP[(i+1)%PP.size()]\n#define diff(PP, i) (next(PP, i) - curr(PP, i))\n#define eq(n,m) (abs((n)-(m)) < EPS)\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\nconst double EPS = 1e-8;\nconst double EPS_GIG = 1e-3;\nconst double PI = acos(-1.0);\nstruct point {\n\tdouble x, y;\n\tpoint(double x_, double y_):x(x_), y(y_){};\n\tpoint(const point &p):x(p.x), y(p.y){}\n\tpoint():x(0), y(0){}\n\tpoint& operator+=(point a){x += a.x;y += a.y;return *this;}\n\tpoint& operator-=(point a){x -= a.x;y -= a.y;return *this;}\n\tpoint& operator*=(point a){\n\t\tdouble xx = x * a.x - y * a.y;\n\t\tdouble yy = x * a.y + y * a.x;\n\t\tx = xx;y = yy;return *this;\n\t}\n\tpoint& operator*=(double a){x *= a;y *= a;return *this;}\n\tpoint& operator/=(double a){x /= a;y /= a;return *this;}\n\tpoint operator+(point a) const{return point(x, y)+=a;}\n\tpoint operator-(point a) const{return point(x, y)-=a;}\n\tpoint operator*(point a) const{return point(x, y)*=a;}\n\tpoint operator*(double a) const{return point(x, y)*=a;}\n\tpoint operator/(double a) const{return point(x, y)/=a;}\n\tbool operator<(point a) const{return (x != a.x ? x < a.x : y < a.y);}\n\tbool operator==(point a) const{return (abs(x - a.x) < EPS && abs(y - a.y) < EPS);}\n\tbool operator!=(point a) const{return !(abs(x - a.x) >= EPS || abs(y - a.y) >= EPS);}\n\tdouble real() {return x;}\n\tdouble imag() {return y;}\n};\n\ntemplate <class T>\npoint operator*(const T a, const point p){return point(p.x * a, p.y * a);}\n\npoint conj(point p) {return point(p.x, -p.y);}\ndouble arg(point p) {return arg(complex<double>(p.x, p.y));}\ndouble abs(point p) {return abs(complex<double>(p.x, p.y));}\ndouble norm(point p) {return norm(complex<double>(p.x, p.y));}\ndouble real(point p) {return p.x;}\ndouble imag(point p) {return p.y;}\n\nnamespace std {\n\tistream& operator>>(std::istream& is, point& p){\n\t\tis >> p.x >> p.y;\n return is;\n}\n\tostream& operator<<(ostream& os, const point& p){\n\t\tos << p.x << \" \" << p.y;\n\t\treturn os;\n\t}\n}\nstruct circle {\n\tpoint p; double r;\n\tcircle(){}\n\tcircle(const point &p, double r) : p(p), r(r) { }\n};\n\n// 扇型、中心と半径、二つの端点\n// 現在中心角が180未満の前提\nstruct sector {\n\tpoint o;\n\tpoint a, b;\n\tdouble r;\n\tsector(){}\n\tsector(point O, point A, point B, double _r) :o(O), a(A), b(B), r(_r) {}\n};\n\nstruct segment : public array<point, 2> {\n\tsegment(const point &a, const point &b) {\n\t\tat(0) = a;\n\t\tat(1) = b;\n\t}\n};\n\ndouble cross(const point& a, const point& b) {\n\treturn (conj(a)*b).y;\n}\n\ndouble dot(const point& a, const point& b) {\n\treturn (conj(a)*b).x;\n}\n\n//角度足し算\ndouble add_rad(double a,double b){\n\tdouble ret = a + b;\n\tif(ret > 2 * PI)ret -= 2 * PI;\n\treturn ret;\n}\n\n//なす角(vector)\ndouble angle(const point &a,const point &b) {\n\tauto tmp = abs(arg(a) - arg(b));\n\treturn min(tmp, 2 * PI - tmp);\n}\n\ndouble angle(const segment &s1,const segment &s2) {\n\treturn angle(s1[1] - s1[0], s2[1] - s2[0]);\n}\n\n//点の回転\npoint rotate(const point &p, double rad) {\n\tdouble x = p.x * cos(rad) - p.y * sin(rad);\n\tdouble y = p.y * cos(rad) + p.x * sin(rad);\n\treturn point(x, y);\n}\n\n//並行\nbool isParallel(const point &a, const point &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const segment &a, const segment &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n//直行\nbool isOrthogonal(const point &a,const point &b){\n\treturn abs(angle(a,b) - PI / 2) < EPS;\n}\nbool isOrthogonal(const segment &a,const segment &b){\n\treturn isOrthogonal(a[1]-a[0],b[1]-b[0]);\n}\n\n/*\na → b で時計方向に折れて b → c\na → b で半時計方向に折れて b → c\na → b で逆を向いて a を通り越して b → c\na → b でそのまま b → c\na → b で逆を向いて b → c ( または b == c )\n*/\n\nint ccw(point a, point b, point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > EPS) return +1; // counter clockwise\n\tif (cross(b, c) + EPS < 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 segment &l, const segment &m) {\n\treturn abs(cross(l[1] - l[0], m[1] - m[0])) > EPS || // non-parallel\n\t\tabs(cross(l[1] - l[0], m[0] - l[0])) < EPS; // same line\n}\nbool intersectLS(const segment &l, const segment &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 segment &l, const point &p) {\n\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\nbool intersectSP(const segment &s, const point &p) {\n\tauto a = s[0] - p;\n\tauto b = s[1] - p;\n\treturn (abs(cross(a, b)) < EPS && dot(a, b) <= EPS); // triangle inequality\n}\n//端点の交差も考える\nbool intersectSS(const segment &s, const segment &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}\n//端点の交差hは考えない\nbool strictIntersectSS(const segment &s, const segment &t) {\n\treturn ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) == -1 &&\n\t\tccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) == -1;\n}\n\npoint projection(const segment &l, const point &p) {\n\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\treturn l[0] + t*(l[0] - l[1]);\n}\npoint reflection(const segment &l, const point &p) {\n\treturn p + 2. * (projection(l, p) - p);\n}\ndouble distanceLP(const segment &l, const point &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const segment &l, const segment &m) {\n\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const segment &l, const segment &s) {\n\tif (intersectLS(l, s)) return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const segment &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 segment &s, const segment &t) {\n\tif (intersectSS(s, t)) return 0;\n\treturn min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n\t\tmin(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\ndouble distancePP(const point &a,const point &b){\n\treturn abs(a-b);\n}\n\n/*多角形内包判定\nhalf-line crossing method\nOUT:0\nON:1\nIN:2\n*/\nint contains(const vector<point>& Poly, const point& p) {\n\tbool in = false;\n\tfor (int i = 0; i < Poly.size(); ++i) {\n\t\tpoint a = curr(Poly, i) - p, b = next(Poly, i) - p;\n\t\tif (a.y > b.y) swap(a, b);\n\t\tif (a.y < EPS && EPS < b.y && cross(a, b) > EPS)in = !in;\n\t\tif (abs(cross(a, b)) < EPS && dot(a, b) < EPS) return 1;\n\t}\n\treturn in ? 2 : 0;\n}\n\n/*\nOUT:0\nON:1\nIN:2\n*/\nint contain_sector(const sector &sec, point &p){\n\tif(eq(abs(p - sec.o), sec.r))return 1;\n\tif(intersectSP(segment(sec.o, sec.a), p))return 1;\n\tif(intersectSP(segment(sec.o, sec.b), p))return 1;\n\tif(abs(p - sec.o) + EPS > sec.r)return 0;\n\tpoint vec = p - sec.o;\n\tpoint vecA = sec.a - sec.o;\n\tpoint vecB = sec.b - sec.o;\n\tif(angle(vec, vecA) + EPS < angle(vecA, vecB) && angle(vec, vecB) + EPS < angle(vecA, vecB))return 2;\n\treturn 0;\n}\n\n//交点\npoint crosspointSS(const segment &l, const segment &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) return point(INF,INF); // !!!PRECONDITION NOT SATISFIED!!!\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\n\nvector<point> crosspointCL(const circle &c, const segment &l) {\n\tauto ret = vector<point>(2, point(INF, INF));\n\tauto pro_p = projection(l, c.p);\n\tauto dist = distanceLP(l, c.p);\n\tif(abs(dist - c.r) < EPS){\n\t\tret[0] = pro_p;\n\t\treturn ret;\n\t}\n\tif(c.r < dist){\n\t\treturn ret;\n\t}\n\tpoint vec = (l[1] - l[0]) * sqrt(c.r * c.r - dist * dist) / abs(l[1] - l[0]);\n\tret[0] = pro_p + vec;\n\tret[1] = pro_p - vec;\n\treturn ret;\n}\n\nvector<point> crosspointCC(const circle c1, const circle c2) {\n\tauto ret = vector<point>(2, point(INF, INF));\n\tauto dist = abs(c2.p - c1.p);\n\tif(eq(dist, c1.r + c2.r) || eq(dist, abs(c2.r - c1.r))){\n\t\tauto tmp = c2.p - c1.p;\n\t\tret[0] = c1.p + tmp * (c1.r / dist);\n\t\treturn ret;\n\t}\n\tif(c1.r + c2.r < dist || dist < abs(c1.r - c2.r)){\n\t\treturn ret;\n\t}\n\tauto alpha = acos((c1.r * c1.r + dist * dist - c2.r * c2.r) / (2 * c1.r * dist));\n\tauto theta = atan2(c2.p.y - c1.p.y, c2.p.x - c1.p.x);\n\tret[0] = c1.p + point(cos(theta + alpha) * c1.r, sin(theta + alpha) * c1.r);\n\tret[1] = c1.p + point(cos(theta - alpha) * c1.r, sin(theta - alpha) * c1.r);\n\treturn ret;\n}\n\nbool isOnSector(const sector sec, const point p) {\n\tpoint vec = p - sec.o;\n\tpoint vecA = sec.a - sec.o;\n\tpoint vecB = sec.b - sec.o;\n\tif(eq(angle(vec, vecA) + angle(vec, vecB), angle(vecA, vecB)))return true;\n\treturn false;\n}\n\nvector<point> crosspointSecS(const sector sec, const segment s) {\n\tcircle c = circle(sec.o, sec.r);\n\tauto ret = crosspointCL(c, s);\n\tpoint inf = point(INF, INF);\n\tREP(i, 2){\n\t\tif(eq(ret[i], inf))continue;\n\t\tif(!isOnSector(sec, ret[i])){\n\t\t\tret[i] = inf;\n\t\t\tcontinue;\n\t\t}\n\t\tif(!intersectSP(s, ret[i])){\n\t\t\tret[i] = inf;\n\t\t}\n\t}\n\treturn ret;\n}\nvector<point> crosspointSecSec(const sector sec1, const sector sec2) {\n\tcircle c1 = circle(sec1.o, sec1.r);\n\tcircle c2 = circle(sec2.o, sec2.r);\n\tauto ret = crosspointCC(c1, c2);\n\tpoint inf = point(INF, INF);\n\tREP(i, 2){\n\t\tif(!isOnSector(sec1, ret[i])){\n\t\t\tret[i] = inf;\n\t\t\tcontinue;\n\t\t}\n\t\tif(!isOnSector(sec2, ret[i])){\n\t\t\tret[i] = inf;\n\t\t}\n\t}\n\treturn ret;\n}\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]) == -1) --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]) == -1) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n//見えるか(可視グラフ用)\nbool block_off(const point &a, const point &b, const vector<point> &obj) {\n point m = (a + b) * 0.5;\n bool on = false, in = false;\n for (int j = 0; j < obj.size(); ++j) {\n point c = curr(obj,j), d = next(obj,j);\n if (d.y < c.y) swap(c, d);\n if (cross(a-c,b-c) * cross(a-d,b-d) < 0 && // strictly intersect.\n cross(c-a,d-a) * cross(c-b,d-b) < 0) return true;\n if (cross(a-c,b-c) == 0 && dot(a-c,b-c) < 0) return true;\n if (c.y <= m.y && m.y < d.y) // strictly contain.\n if (cross(c-m,d-m) < 0) in = !in;\n if (cross(c-m,d-m) == 0 && dot(c-m,d-m) <= EPS) on = true;\n }\n return !on && in;\n}\n\n//面積\ndouble area(const vector<point>& p) {\n\tdouble A = 0;\n\tfor (int i = 0; i < p.size(); ++i)\n\t\tA += cross(curr(p, i), next(p, i));\n\treturn A / 2.;\n}\n\n//凸包判定\nbool isConvex(vector<point> poly){\n\tint sz = poly.size();\n\tREP(i,sz){\n\t\tif(ccw(poly[i],poly[(i+1)%sz],poly[(i+2)%sz]) == -1)return false;\n\t}\n\treturn true;\n}\n\ndouble convex_diameter(const vector<point> &pt) {\n const int n = pt.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (pt[i].y > pt[is].y) is = i;\n if (pt[i].y < pt[js].y) js = i;\n }\n double maxd = norm(pt[is]-pt[js]);\n\n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\n else i = (i+1) % n;\n if (norm(pt[i]-pt[j]) > maxd) {\n maxd = norm(pt[i]-pt[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}\n\nvector<point> convex_cut(const vector<point> P, const segment& l) {\n vector<point> Q;\n for (int i = 0; i < P.size(); ++i) {\n point A = curr(P, i), B = next(P, i);\n if (ccw(l[0], l[1], A) != -1) Q.push_back(A);\n if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\n Q.push_back(crosspointSS(segment(A, B), l));\n }\n return Q;\n}\n\npoint max_circle_size_in_polygon_check(double mid, vector<point> &v){\n\tll n = v.size();\n\tvector<point> now(v);\n\tREP(i, n){\n\t\tauto a = v[i];\n\t\tauto b = v[(i+1)%n];\n\t\tauto vec = b - a;\n\t\tvec /= abs(vec);\n\t\tvec *= mid;\n\t\tvec = vec * point(0, 1);\n\t\tsegment seg = segment(a + vec, b + vec);\n\t\tnow = convex_cut(now, seg);\n\t}\n\treturn (now.empty() ? point(INF, INF): now[0]);\n}\n\n// 凸多角形に入る最大の円\ncircle max_circle_size_in_polygon(vector<point> &v){\n\tdouble l = 0;\n\tdouble r = convex_diameter(v);\n\tpoint ret;\n\tREP(_, 1000){\n\t\tif(abs(l - r) < EPS)break;\n\t\tdouble mid = (l + r) / 2;\n\t\tret = max_circle_size_in_polygon_check(mid, v);\n\t\tif(ret != point(INF, INF))l = mid;\n\t\telse r = mid;\n\t}\n\treturn circle(ret, l);\n}\n\n// 三角形の外接円\ncircle circumscribed_circle(vector<point> p) {\n\tsegment seg_a = segment((p[1] + p[0]) * 0.5,\n\t(p[1] + p[0]) * 0.5 + (p[1] - p[0]) * point(0, 1));\n\tsegment seg_b = segment((p[2] + p[1]) * 0.5,\n\t(p[2] + p[1]) * 0.5 + (p[2] - p[1]) * point(0, 1));\n\tcircle ret;\n\tret.p = crosspointSS(seg_a, seg_b);\n\tret.r = distancePP(p[0], ret.p);\n\treturn ret;\n}\n\n// ################################### 3D ####################################\n\nstruct point3d {\n\tdouble x, y, z;\n\tpoint3d():x(0), y(0), z(0){}\n\tpoint3d(const point3d &p):x(p.x), y(p.y), z(p.z){}\n\tpoint3d(double x_, double y_, double z_):x(x_), y(y_), z(z_){}\n\n\tpoint3d& operator+=(point3d a){x += a.x;y += a.y;z += a.z;return *this;}\n\tpoint3d& operator-=(point3d a){x -= a.x;y -= a.y;z -= a.z;return *this;}\n\tpoint3d& operator*=(double a){x *= a;y *= a;z *= a;return *this;}\n\tpoint3d& operator/=(double a){x /= a;y /= a;z /= a;return *this;}\n\tpoint3d operator+(point3d a) const{return point3d(x, y, z)+=a;}\n\tpoint3d operator-(point3d a) const{return point3d(x, y, z)-=a;}\n\tpoint3d operator*(double a) const{return point3d(x, y, z)*=a;}\n\tpoint3d operator/(double a) const{return point3d(x, y, z)/=a;}\n\tbool operator<(point3d a) const{\n\t\treturn (x != a.x ? x < a.x : (y != a.y ? y < a.y : z < a.z));}\n\tbool operator==(point3d a) const{\n\t\treturn (abs(x - a.x) < EPS && abs(y - a.y) < EPS && abs(z - a.z) < EPS);\n\t}\n\tbool operator!=(point3d a) const{return !(*this == a);}\n};\n\nstruct segment3d: public array<point3d, 2> {\n\tsegment3d(const point3d &a, const point3d &b) {\n\t\tat(0) = a;\n\t\tat(1) = b;\n\t}\n};\n\ndouble abs(point3d p) {\n\treturn sqrt(p.x * p.x + p.y * p.y + p.z * p.z);\n}\n\ndouble dot(point3d a, point3d b){\n\treturn a.x * b.x + a.y * b.y + a.z * b.z;\n}\n\npoint3d cross(point3d a, point3d b){\n\treturn point3d(a.y * b.z - a.z * b.y,\n\t\t\t\t\t\t\t\t a.z * b.x - a.x * b.z,\n\t\t\t\t\t\t\t a.x * b.y - a.y * b.x);\n}\n\ndouble angle(point3d a, point3d b){\n\treturn acos(dot(a, b) / (abs(a) * abs(b)));\n}\n\nstruct plane {\n\tdouble a, b, c, d;\n\tplane():a(0), b(0), c(0), d(0){}\n\tplane(double a_, double b_, double c_, double d_):a(a_), b(b_), c(c_), d(d_){}\n\tplane(point3d p1, point3d p2, point3d p3){\n\t\tpoint3d A = p2 - p1;\n\t\tpoint3d B = p3 - p1;\n\t\tpoint3d p = cross(A, B);\n\t\ta = p.x;b = p.y;c = p.z;\n\t\td = -(a * p1.x + b * p1.y + c * p1.z);\n\t}\n\tdouble assignment(point3d p){\n\t\treturn a * p.x + b * p.y + c * p.z + d;\n\t}\n};\n\ndouble distance(point3d p, plane pl){\n\tdouble a = abs(p.x * pl.a + p.y * pl.b + p.z * pl.c + pl.d);\n\tdouble b = sqrt(pl.a * pl.a + pl.b * pl.b + pl.c * pl.c);\n\treturn a / b;\n}\n\ndouble distance(plane p, point3d pl){\n\treturn distance(pl, p);\n}\n\npoint3d projection(point3d p, plane pl){\n\tdouble d = distance(p, pl);\n\tpoint3d a = point3d(pl.a, pl.b, pl.c);a /= abs(a);\n\tpoint3d ret = p + a * d;\n\tif(distance(ret, pl) < EPS)return ret;\n\treturn p - a * d;\n}\n\npoint3d crossPoint3d(segment3d s, plane p){\n\tdouble bunsi = p.a * s[0].x + p.b * s[0].y + p.c * s[0].z + p.d;\n\tdouble bunbo = p.a * (s[0].x - s[1].x) +\n\t\t\t\t\t\t\t\t p.b * (s[0].y - s[1].y) +\n\t\t\t\t\t\t\t\t p.c * (s[0].z - s[1].z);\n\tif(abs(bunbo) < EPS)return point3d(INF, INF, INF);\n\tdouble t = bunsi / bunbo;\n\treturn s[0] + (s[1] - s[0]) * t;\n}\n\nnamespace std {\n\tistream& operator>>(std::istream& is, point3d& p){\n\t\tis >> p.x >> p.y >> p.z;\n\t\treturn is;\n\t}\n\n\tostream& operator<<(ostream& os, const point3d& p){\n\t\tos << p.x << \" \" << p.y << \" \" << p.z;\n\t\treturn os;\n\t}\n\n\tostream& operator<<(ostream& os, const plane& p){\n\t\tos << p.a << \"x + \" << p.b << \"y + \" << p.c << \"z + \" << p.d;\n\t\treturn os;\n\t}\n}\n\n// ################################### 3D ####################################\n\nint main(){\n\tcin.tie(0);cout.tie(0);ios::sync_with_stdio(false);\n\n\tpoint3d uaz;\n\tpoint3d enemy;\n\tpoint3d a, b, c;\n\tcin >> uaz >> enemy >> a >> b >> c;\n\tplane pl = plane(a, b, c);\n\n \tif(pl.assignment(uaz) * pl.assignment(enemy) > EPS){\n\t\tcout << \"HIT\" << endl;\n\t\treturn 0;\n\t}\n\n\tauto pa = projection(uaz, pl);\n\tauto pb = projection(enemy, pl);\n\n\tREP(i, 1000000 + 1){\n\t\tauto p = pa + (pb - pa) * (i / 1000000);\n\t\tif(eq(angle(a - p, b - p) + angle(c - p, b - p) + angle(a - p, c - p), 2 * PI)){\n\t\t\tcout << \"MISS\" << endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tcout << \"HIT\" << endl;\n\n\treturn 0;\n}",
"accuracy": 0.07894736842105263,
"time_ms": 90,
"memory_kb": 3276,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_0106_cpp
|
Discounts of Buckwheat
Aizu is famous for its buckwheat. There are many people who make buckwheat noodles by themselves.
One day, you went shopping to buy buckwheat flour. You can visit three shops, A, B and C. The amount in a bag and its unit price for each shop is determined by the follows table. Note that it is discounted when you buy buckwheat flour in several bags.
Shop A
Shop B
Shop C
Amount in a bag
200g
300g
500g
Unit price for a bag (nominal cost)
380 yen
550 yen
850 yen
Discounted units
per 5 bags
per 4 bags
per 3 bags
Discount rate
reduced by 20 %
reduced by 15 %
reduced by 12 %
For example, when you buy 12 bags of flour at shop A, the price is reduced by 20 % for 10 bags, but not for other 2 bags. So, the total amount shall be (380 × 10) × 0.8 + 380 × 2 = 3,800 yen.
Write a program which reads the amount of flour, and prints the lowest cost to buy them. Note that you should buy the flour of exactly the same amount as the given input.
Input
The input consists of multiple datasets. For each dataset, an integer
a
(500 ≤
a
≤ 5000,
a
is divisible by 100) which represents the amount of flour is given in a line.
The input ends with a line including a zero. Your program should not process for the terminal symbol. The number of datasets does not exceed 50.
Output
For each dataset, print an integer which represents the lowest cost.
Sample Input
500
2200
0
Output for the Sample Input
850
3390
|
[
{
"submission_id": "aoj_0106_4572417",
"code_snippet": "#include <iostream>\n#include <climits>\n\nvoid init_nums(int nums[])\n{\n\tnums[0] = nums[1] = nums[2] = 0;\n}\n\nint cost(int nums[])\n{\n\tint A = nums[0];\n\tint B = nums[1];\n\tint C = nums[2];\n\t\n\tint qA = A / 5;\n\tint rA = A % 5;\n\tint qB = B / 4;\n\tint rB = B % 4;\n\tint qC = C / 3;\n\tint rC = C % 3;\n\t\n\treturn 1520 * qA + 380 * rA + 1870 * qB + 550 * rB + 2244 * qC + 850 * rC;\n}\n\nint minCost(int a, int nums[])\n{\n\tif (a==0) return cost(nums);\n\t\n\tint res = INT_MAX;\n\t\n\tif (a>=500) {\n\t\tnums[2]++; \n\t\tres = std::min(res, minCost(a-500, nums));\n\t\tnums[2]--;\n\t}\n\tif (a>=300) {\n\t\tnums[1]++;\n\t\tres = std::min(res, minCost(a-300, nums));\n\t\tnums[1]--;\n\t}\n\tif (a>=200) {\n\t\tnums[0]++;\n\t\tres = std::min(res, minCost(a-200, nums));\n\t\tnums[0]--;\n\t}\n\t\n\treturn res;\n}\n\nint main()\n{\n\tint a;\n\tint nums[3];\n\twhile (true) {\n\t\tstd::cin >> a;\n\t\tif (a == 0) break;\n\t\tinit_nums(nums);\n\t\tstd::cout << minCost(a, nums) << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 590,
"memory_kb": 3100,
"score_of_the_acc": -0.843,
"final_rank": 10
},
{
"submission_id": "aoj_0106_3834547",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#define INF (1<<26)\nusing namespace std;\n \nint n,ans;\nint checkA(int);\nint checkB(int);\nint checkC(int);\n \nint main(){\n while(cin>>n){\n if(n==0)break;\n \n ans=INF;\n \n for(int i=0;i<100;i++){\n for(int j=0;j<100;j++){\n for(int k=0;k<100;k++){\n //if(i==5&&j==0&&k==0)cout<<checkA(i)<<' '<<checkB(j)<<' '<<checkC(k)<<endl;\n if( i*200+j*300+k*500 == n){\n ans=min(ans,checkA(i)+checkB(j)+checkC(k));\n }\n \n }\n }\n } \n cout<<ans<<endl;\n }\n return 0;\n}\nint checkA(int cnt){\n \n int x = cnt - (cnt % 5), y = cnt % 5;\n return x*304 + y*380;\n}\n \nint checkB(int cnt){\n \n int x = cnt - (cnt % 4), y = cnt % 4;\n x/=4;\n return x*1870 + y*550;\n}\n \nint checkC(int cnt){\n \n int x = cnt - (cnt % 3), y = cnt % 3;\n return x*748 + y*850;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3056,
"score_of_the_acc": -0.2557,
"final_rank": 8
},
{
"submission_id": "aoj_0106_3420935",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <list>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <stack>\n#include <iomanip>\n#include <numeric>\n#include <queue>\n#include <climits>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <cstring>\n#include <map>\nusing namespace std;\nusing ll = long long;\n#define MOD 1000000007\n#define INF 1LL << 59\nusing ld = long double;\n\nbool operator<(const pair<int, int> &a, const pair<int, int> &b)\n{\n if (a.first == b.first)\n {\n return b.second > a.second;\n }\n return a.first < b.first;\n}\n\nint arr[200010];\nint a[200010], b[200010];\n\nint GCD(int a, int b)\n{\n if (a < b)\n swap(a, b);\n if (b == 0)\n return a;\n return GCD(b, a % b);\n}\n\nint dp[55][30][30][30];\n\nint rec(int sum, int cost, int a, int b, int c)\n{\n if (sum == 0)\n {\n return cost;\n }\n if (sum < 0)\n {\n return INT_MAX;\n }\n if (dp[sum][a][b][c] != INT_MAX)\n return dp[sum][a][b][c];\n\n int res = INT_MAX;\n\n if ((a + 1) % 5 == 0)\n {\n res = min(res, rec(sum - 2, cost - 380 * 4 + 380 * 5 * 0.80, a + 1, b, c));\n }\n else\n {\n res = min(res, rec(sum - 2, cost + 380, a + 1, b, c));\n }\n\n if ((b + 1) % 4 == 0)\n {\n res = min(res, rec(sum - 3, cost - 550 * 3 + 550 * 4 * 0.85, a, b + 1, c));\n }\n else\n {\n res = min(res, rec(sum - 3, cost + 550, a, b + 1, c));\n }\n\n if ((c + 1) % 3 == 0)\n {\n res = min(res, rec(sum - 5, cost - 850 * 2 + 850 * 3 * 0.88, a, b, c + 1));\n }\n else\n {\n res = min(res, rec(sum - 5, cost + 850, a, b, c + 1));\n }\n\n return dp[sum][a][b][c] = min(dp[sum][a][b][c], res);\n}\nint main()\n{\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n //cout << fixed << setprecision(5);\n\n int n;\n while (cin >> n)\n {\n if (n == 0)\n {\n break;\n }\n\n for (int i = 0; i < 55; ++i)\n {\n for (int j = 0; j < 30; ++j)\n {\n for (int k = 0; k < 30; ++k)\n {\n for (int l = 0; l < 30; ++l)\n {\n dp[i][j][k][l] = INT_MAX;\n }\n }\n }\n }\n n /= 100;\n cout << rec(n, 0, 0, 0, 0) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 8896,
"score_of_the_acc": -1.0204,
"final_rank": 12
},
{
"submission_id": "aoj_0106_3269170",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include\"bits/stdc++.h\"\n#ifdef _DEBUG\n#define DBG(n) n\n#else\n#define DBG(n)\n#endif\n#define INF 1e9\n#define INFLL 1e18\n#define EPS 1e-9\n#define REP(i,n) for(ll i=0,i##_len=(n);i<i##_len;++i)\n#define REP1(i,n) for(ll i=1,i##_len=(n);i<=i##_len;++i)\n#define REPR(i,n) for(ll i=(n)-1;i>=0;--i)\n#define REPR1(i,n) for(ll i=(n);i>0;--i)\n#define REPC(i,obj) for(auto i:obj)\n#define ALL(obj) (obj).begin(),(obj).end()\n#define SETP(n) cout<<fixed<<setprecision(n)\nusing namespace std;\nusing ll = long long;\ntemplate<typename T = ll>inline T in() { T ret; cin >> ret; return ret; }\n\nll n, ans;\nvoid dfs(ll a, ll b, ll c)\n{\n\tll g = a * 200 + b * 300 + c * 500;\n\tif (g == n) {\n\t\tll y = (a - a % 5) * 304 + a % 5 * 380 + (b - b % 4) / 4 * 1870 + b % 4 * 550 + (c - c % 3) * 748 + c % 3 * 850;\n\t\tans = min(ans, y);\n\t} else if (g < n) {\n\t\tdfs(a + 1, b, c);\n\t\tdfs(a, b + 1, c);\n\t\tdfs(a, b, c + 1);\n\t}\n}\nsigned main()\n{\n\twhile ((n = in()) != 0) {\n\t\tans = INFLL;\n\t\tdfs(0, 0, 0);\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 990,
"memory_kb": 2988,
"score_of_the_acc": -1.2367,
"final_rank": 15
},
{
"submission_id": "aoj_0106_2647092",
"code_snippet": "#include <iostream>\nusing namespace\tstd;\nint main(){\n for(int n;cin>>n&&n;){\n int r=1e9;\n for(int c0=0;c0<=25;c0++)\n for(int c1=0;c1<=16;c1++)\n for(int c2=0;c2<=10;c2++)\n for(int c3=0;c3<=5;c3++)\n for(int c4=0;c4<=4;c4++)\n for(int c5=0;c5<=3;c5++)\n if(n==c0*200+c1*300+c2*500+c3*1000+c4*1200+c5*1500) r=min(r,c0*380+c1*550+c2*850+c3*1520+c4*1870+c5*2244);\n cout<<r<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3100,
"score_of_the_acc": -0.2512,
"final_rank": 7
},
{
"submission_id": "aoj_0106_2400756",
"code_snippet": "#include <stdio.h>\n\nint main() {\n int stack[50], sp = 0, n, i, sum;\n while (scanf(\"%d\", &stack[sp++]) != EOF)\n ;\n for (i = 0; i < sp; i++) {\n int ans = 1000000;\n n = stack[i];\n if (n == 0)\n break;\n for (int a = 0; a <= 50; a++) {\n for (int b = 0; b <= 50; b++) {\n for (int c = 0; c <= 50; c++) {\n sum = (380 * (5 * (a / 5))) * 0.8 + (a % 5) * 380;\n sum += (550 * (4 * (b / 4))) * 0.85 + (b % 4) * 550;\n sum += (850 * (3 * (c / 3))) * 0.88 + (c % 3) * 850;\n if (a * 200 + b * 300 + c * 500 == n) {\n if (sum < ans)\n ans = sum;\n }\n }\n }\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2564,
"score_of_the_acc": -0.1819,
"final_rank": 5
},
{
"submission_id": "aoj_0106_2195669",
"code_snippet": "#include <iostream>\n#include <climits>\n#include <algorithm>\n\nusing namespace std;\n\nint dfs(int a, int b, int c, int n);\nint calcAmount(int a, int b, int c);\nint calcValue(int a, int b, int c);\n\nint main() {\n int a, b, c;\n\n int n;\n\n while (cin >> n) {\n if(n == 0) break;\n a = 0; b = 0; c = 0;\n \n cout << dfs(a, b, c, n) << endl;\n }\n\n return 0;\n}\n\nint dfs(int a, int b, int c, int n) {\n int amount = calcAmount(a, b, c);\n\n if(amount == n) {\n return calcValue(a, b, c);\n } else if(amount > n) {\n return INT_MAX;\n } else {\n return min(min(dfs(a+1, b, c, n), dfs(a, b+1, c, n)), dfs(a, b, c+1, n));\n }\n}\n\nint calcAmount(int a, int b, int c) {\n return a*200 + b*300 + c*500;\n}\n\nint calcValue(int a, int b, int c) {\n a = 380*(a/5)*4 + 380*(a%5);\n b = 550*(b/4)*17/5 + 550*(b%4);\n c = 850*(c/3)*264/100 + 850*(c%3);\n\n return a+b+c;\n}",
"accuracy": 1,
"time_ms": 900,
"memory_kb": 2972,
"score_of_the_acc": -1.1428,
"final_rank": 13
},
{
"submission_id": "aoj_0106_2090636",
"code_snippet": "#include <iostream>\n#define MAX_P 1000000\nusing namespace std;\nint g;\nint minx=0;\nvoid price(int a,int b,int c){\n\tif(a/5*1520+a%5*380+b/4*1870+b%4*550+c/3*2244+c%3*850<minx)\n\t\tminx=a/5*1520+a%5*380+b/4*1870+b%4*550+c/3*2244+c%3*850;\n\treturn; \n}\n\nvoid shop(int g,int a,int b,int c){\n\tif(g==0){\n\t\tprice(a,b,c);\n\t\treturn;\n\t}else if(g<0){\n\t\treturn;\n\t}\n\tshop(g-200,a+1,b,c);\n\tshop(g-300,a,b+1,c);\n\tshop(g-500,a,b,c+1);\n\treturn;\n}\n\nint main(){\n\twhile(1){\n\t\tcin >> g;\n\t\tif(g==0)break;\n\t\tminx=MAX_P;\t\n\t\tshop(g,0,0,0);\n\t\tcout << minx << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 930,
"memory_kb": 3084,
"score_of_the_acc": -1.1879,
"final_rank": 14
},
{
"submission_id": "aoj_0106_1662855",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\n\n#define MAX_N 10000\n\nint dp[4][10000], cnt, cnt2;\nint v[3] = { 2,3,5 }, w[3] = { 380,550,850 }, x[3] = { 5,4,3 }, y[3] = { 20,15,12 };\n\nint main() {\n\tmemset(dp, 127, sizeof(dp));\n\tdp[0][0] = 0;\n\tfor (int i = 0; i < 3; i++) {\n\t\tfor (int j = 0; j < MAX_N; j++) {\n\t\t\tcnt = 0; cnt2 = 0;\n\t\t\tfor (int k = j; k < MAX_N; k += v[i]) {\n\t\t\t\tdp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + cnt);\n\t\t\t\tcnt += w[i];\n\t\t\t\tcnt2++;\n\t\t\t\tif (cnt2%x[i] == 0) {\n\t\t\t\t\tcnt -= (w[i] * x[i])*y[i] / 100;\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) { break; }\n\t\tcout << dp[3][n / 100] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 1324,
"score_of_the_acc": -0.2156,
"final_rank": 6
},
{
"submission_id": "aoj_0106_1362705",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint soba[][2] = {\n\t{200, 380},\n\t{300, 550},\n\t{500, 850}\n};\n\nint main() {\n\tint n, m = 5000 * 500;\n\tcin >> n;\n\tif (n == 0){\n\t\treturn 0;\n\t}\n\tfor (int i = n / soba[2][0] + 100; i >= 0; i--) {\n\t\tfor (int j = n / soba[1][0] + 100; j >= 0; j--) {\n\t\t\tfor (int k = n / soba[0][0] + 100; k >= 0; k--) {\n\t\t\t\tint w = i * soba[2][0] + j * soba[1][0] + k * soba[0][0];\n\t\t\t\tif (w == n) {\n\t\t\t\t\tint p = (i / 3 * 3 * soba[2][1] * 0.88) + (i % 3 * soba[2][1]) + (j / 4 * 4 * soba[1][1] * 0.85) + (j % 4 * soba[1][1]) + (k / 5 * 5 * soba[0][1] * 0.8) + (k % 5 * soba[0][1]);\n\t\t\t\t\tif (p < m) {\n\t\t\t\t\t\tm = p;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << m << endl;\n\treturn main();\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1164,
"score_of_the_acc": -0.0316,
"final_rank": 3
},
{
"submission_id": "aoj_0106_1292559",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint kona, minm;\n\nvoid search(int k, int a, int b, int c){\n if(k <= 0){\n int am = (a / 5) * 5 * 380 * 0.8 + (a % 5) * 380;\n int bm = (b / 4) * 4 * 550 * 0.85 + (b % 4) * 550;\n int cm = (c / 3) * 3 * 850 * 0.88 + (c % 3) * 850;\n int all = am + bm + cm;\n if(all < minm) minm = all;\n return;\n }\n\n if(k >= 200) search(k - 200, a + 1, b, c);\n if(k >= 300) search(k - 300, a, b + 1, c);\n if(k >= 500) search(k - 500, a, b, c + 1);\n}\n\nint main(void){\n while(cin >> kona && kona != 0){\n minm = 100000000;\n search(kona, 0, 0, 0);\n cout << minm << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 970,
"memory_kb": 1160,
"score_of_the_acc": -0.9801,
"final_rank": 11
},
{
"submission_id": "aoj_0106_1231745",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\n\n/*\n200 380\n300 550\n500 850\n1000 1520\n1200 1870\n1500 2244\n*/\n\nint main() {\n\tint n;\n\twhile (cin >> n) {\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector< vector<int> > dp(5000+1, vector<int>(6+1, 1000000));\n\t\tint w[6] = {200, 300, 500, 1000, 1200, 1500};\n\t\tint v[6] = {380, 550, 850, 1520, 1870, 2244};\n\t\tdp[0][0] = 0;\n\t\tdp[200][1] = 380;\n\t\tdp[300][2] = 550;\n\t\tdp[500][3] = 850;\n\t\tdp[1000][4] = 1520;\n\t\tdp[1200][5] = 1870;\n\t\tdp[1500][6] = 2244;\n\t\tfor (int i = 0; i < 6; i++) {\n\t\t\tfor (int j = 0; j <= n; j+=100) {\n\t\t\t\tif (j < w[i]) {\n\t\t\t\t\tdp[j][i+1] = dp[j][i];\n\t\t\t\t} else {\n\t\t\t\t\tdp[j][i+1] = min(dp[j][i], dp[j-w[i]][i+1]+v[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n][6] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1528,
"score_of_the_acc": -0.0481,
"final_rank": 4
},
{
"submission_id": "aoj_0106_1185462",
"code_snippet": "#include<iostream>\n#include<map>\nusing namespace std;\n\nint main(){\n\n\tint w, val[50], cnt[6], v;\n\n\tmap<char, int> fix, dsc, weight;\n\t\n\tweight.insert(make_pair('A', 200));\n\tweight.insert(make_pair('B', 300));\n\tweight.insert(make_pair('C', 500));\n\t\n\tfix.insert(make_pair('A', 380));\n\tfix.insert(make_pair('B', 550));\n\tfix.insert(make_pair('C', 850));\n\t\n\tdsc.insert(make_pair('A', 1520));\n\tdsc.insert(make_pair('B', 1870));\n\tdsc.insert(make_pair('C', 2244));\n\t\n\tfill(val, val+50, 9500);\n\tfill(cnt, cnt+6, 0);\n\n\tfor(int cnt_fA=0; cnt_fA<=25; cnt_fA++){\n\t\tfor(int cnt_fB=0; cnt_fB<=16; cnt_fB++){\n\t\t\tfor(int cnt_fC=0; cnt_fC<=10; cnt_fC++){\n\t\t\t\tfor(int cnt_dA=0; cnt_dA<=5; cnt_dA++){\n\t\t\t\t\tfor(int cnt_dB=0; cnt_dB<=4; cnt_dB++){\n\t\t\t\t\t\tfor(int cnt_dC=0; cnt_dC<=3; cnt_dC++){\n\t\t\t\t\t\t\tw = weight['A']*(cnt_fA + 5*cnt_dA) + weight['B']*(cnt_fB + 4*cnt_dB) + weight['C']*(cnt_fC + 3*cnt_dC);\n\t\t\t\t\t\t\tif(w <= 5000){\n\t\t\t\t\t\t\t\tv = fix['A']*cnt_fA + fix['B']*cnt_fB + fix['C']*cnt_fC + dsc['A']*cnt_dA + dsc['B']*cnt_dB + dsc['C']*cnt_dC;\n\t\t\t\t\t\t\t\tval[w/100] = min(val[w/100], v);\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\t\t}\n\t}\n\t\n\twhile(cin >> w){\n\t\tif(w == 0) break;\n\t\tcout << val[w / 100] << endl;\n\t}\n\n\treturn 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0052,
"final_rank": 1
},
{
"submission_id": "aoj_0106_896393",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#define INF (1<<26)\nusing namespace std;\n\nint n,ans;\nint checkA(int);\nint checkB(int);\nint checkC(int);\n\nint main(){\n while(cin>>n){\n if(n==0)break;\n\n ans=INF;\n\n for(int i=0;i<100;i++){\n for(int j=0;j<100;j++){\n\tfor(int k=0;k<100;k++){\n\t //if(i==5&&j==0&&k==0)cout<<checkA(i)<<' '<<checkB(j)<<' '<<checkC(k)<<endl;\n\t if( i*200+j*300+k*500 == n){\n\t ans=min(ans,checkA(i)+checkB(j)+checkC(k));\n\t }\n\n\t}\n }\n } \n cout<<ans<<endl;\n }\n return 0;\n}\nint checkA(int cnt){\n\n int x = cnt - (cnt % 5), y = cnt % 5;\n return x*304 + y*380;\n}\n\nint checkB(int cnt){\n\n int x = cnt - (cnt % 4), y = cnt % 4;\n x/=4;\n return x*1870 + y*550;\n}\n\nint checkC(int cnt){\n\n int x = cnt - (cnt % 3), y = cnt % 3;\n return x*748 + y*850;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1160,
"score_of_the_acc": -0.0311,
"final_rank": 2
},
{
"submission_id": "aoj_0106_840420",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint minP = 999999999;\nvoid DFS(int w, int p, int a, int b, int c)\n{\n\tif(w == 0)\n\t{\n\t\tif(minP > p)\n\t\t{\n\t\t\tminP = p;\n\t\t}\n\t}\n\tif(w - 200 >= 0)\n\t{\n\t\tif(a + 1 < 5)\n\t\t{\n\t\t\tDFS(w - 200, p + 380, a + 1, b, c);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tDFS(w - 200, p, 0, b, c);\n\t\t}\n\t}\n\tif(w - 300 >= 0)\n\t{\n\t\tif(b + 1 < 4)\n\t\t{\n\t\t\tDFS(w - 300, p + 550, a, b + 1, c);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tDFS(w - 300, p + 220, a, 0, c);\n\t\t}\n\t}\n\tif(w - 500 >= 0)\n\t{\n\t\tif(c + 1 < 3)\n\t\t{\n\t\t\tDFS(w - 500, p + 850, a, b, c + 1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tDFS(w - 500, p + 544, a, b, 0);\n\t\t}\n\t}\n\treturn;\n}\n\nvoid solve()\n{\n\tint w;\n\twhile(cin >> w, w)\n\t{\n\t\tminP = 999999999;\n\t\tDFS(w, 0, 0, 0, 0);\n\t\tcout << minP << endl;\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 1156,
"score_of_the_acc": -0.6939,
"final_rank": 9
}
] |
aoj_0112_cpp
|
ミルクショップ
鈴木さんは会津地域に新しく搾りたてミルクの移動販売のお店を開きました。その日買い求めに来るお客さんは全員持ち帰るためのボトルを持って既にお店に並んでいて、それ以上増えないものとします。お客さんはそれぞれ1回だけしか注文しません。タンクの蛇口が一つしかないので、一人ずつ順番に販売しなければなりません。そこで、鈴木さんはなるべく並んでいるお客さんの待ち時間を少なくしたいと考えています。
お客さんの人数とお客さんが牛乳を注ぎきるのに要する時間が入力として与えられます。あなたはお客さんの「一人一人の待ち時間の合計」(以下「待ち時間の合計」とする)を最小にするための注文の順序を鈴木さんに代わって調べ、そのときの「待ち時間の合計」を出力して終了するプログラムを作成してください。ただし、お客さんは 10,000 人以下で 1 人あたりに要する時間は 60 分以下とします。
例えば、お客さんの人数が 5 人で、各お客さんが要する時間が順に 2,6,4,3,9 分の場合、そのままの順序だと「待ち時間の合計」は 37 分になります。次の例では、最初の列の順の 2 人目と 3 人目を入れ替えています。この場合、「待ち時間の合計」は 35 分になります。最適な順序だと 31 分で済みます。
待ち時間
1 人目 2 分
0 分
2 人目 6 分
2 分
3 人目 4 分
8 分
4 人目 3 分
12 分
5 人目 9 分
15 分
37 分
← 「待ち時間の合計」
2 人目と 3 人目を入れ替えた例
待ち時間
1 人目 2 分
0 分
2 人目 4 分
2 分
3 人目 6 分
6 分
4 人目 3 分
12 分
5 人目 9 分
15 分
35 分
← 「待ち時間の合計」
Input
複数のデータセットが与えられます。各データセットは以下の形式で与えられます。
n
t
1
t
2
:
t
n
1 行目にお客さんの人数
n
(
n
≤ 10,000) が与えられます。続く
n
行に
i
人目のお客さんが要する時間を表す整数
t
i
(0 ≤
t
i
≤ 60) がそれぞれ１行に与えられます。
入力は１つの 0 を含む行で終わります。データセットの数は 50 を超えません。
Output
各データセットごとに、待ち時間の合計(整数)を１行に出力してください。
Sample Input
5
2
6
4
3
9
0
Output for the Sample Input
31
|
[
{
"submission_id": "aoj_0112_3332513",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nvoid bubbleSort( int* a, int n )\n{\n for( int i = 0; i < n; i++ )\n for( int j = 0; j < n - 1; j++ )\n {\n if( a[j] > a[j+1] )\n {\n int temp = a[j];\n a[j] = a[j+1];\n a[j+1] = temp;\n }\n }\n}\n\nint waitingMinute( int* a, int* b, int x )\n{\n if( x == 0 )\n return b[0] = a[0];\n \n if( b[x] != 0 )\n return b[x];\n else\n return b[x] = a[x] + waitingMinute( a, b, x - 1 );\n}\n\nint main()\n{\n int n, a[10000], sum[10000] = {0};\n\n while( cin >> n )\n {\n if( n == 0 )\n break;\n\n for( int i = 0; i < n; i++ )\n {\n cin >> a[i];\n sum[i] = 0;\n }\n\n bubbleSort( a, n );\n waitingMinute( a, sum, n - 1 );\n\n unsigned int s = 0;\n for( int i = 0; i < n - 1; i++ )\n s += sum[i];\n\n cout << s << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 3388,
"score_of_the_acc": -1.88,
"final_rank": 9
},
{
"submission_id": "aoj_0112_2136321",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\tint n;\n\twhile(cin >> n){\n\t\tif (n == 0) { break; }\n\t\tint a[20000] = {};\n\t\tlong long int ans = 0;\n\t\tfor (int i = 0; i < n;i++) {\n\t\t\tcin >> a[i];\n\t\t}\n\t\tsort(a, a+n);\n\t\tfor(int i = 0;i<n;i++){\n\t\t\tfor(int j=0;j<i;j++){\n\t\t\t\tans += a[j];\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3140,
"score_of_the_acc": -1.0062,
"final_rank": 6
},
{
"submission_id": "aoj_0112_2091750",
"code_snippet": "#include <iostream>\n\nusing namespace std;\nint n,m,temp;\nint t[10005];\nlong long int sum;\nint main(){\n\twhile(1){\n\t\tcin >> n;\n\t\tif(n==0)break;\n\t\tm=n;\n\t\twhile(m--){\n\t\t\tcin >> t[m];\n\t\t}\n\t\tfor(int i=0;i<n-1;i++){\n\t\t\tfor(int j=0;j<n-1-i;j++){\n\t\t\t\tif(t[j]>t[j+1]){\n\t\t\t\t\ttemp=t[j];\n\t\t\t\t\tt[j]=t[j+1];\n\t\t\t\t\tt[j+1]=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsum=0;\n\t\tfor(int i=0;i<n-1;i++){\n\t\t\tsum+=(i+1)*t[n-2-i];\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3080,
"score_of_the_acc": -1.5787,
"final_rank": 8
},
{
"submission_id": "aoj_0112_2035824",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main() {\n\tlong long a[10000], x, y, n, c;\n\tc = 0;\n\twhile (1) {\n\t\tcin >> n;\n\t\tif (n == 0) { break; }\n\t\tfor (int k = 0; k < n; k++) {\n\t\t\tcin >> a[k];\n\t\t}\n\t\t//sort(a,a+n);\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tfor (int i = 0; i < n -1; i++) {\n\t\t\t\tif (a[i] > a[i + 1]) {\n\t\t\t\t\tx = a[i];\n\t\t\t\t\ty = a[i + 1];\n\t\t\t\t\ta[i] = y;\n\t\t\t\t\ta[i + 1] = x;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int k = 0; k < n; k++) {\n\t\t\tc = c + a[k] * (n - (k + 1));\n\t\t}\n\t\t//cout << a[0] << a[1] << a[2] << a[3] << a[4] << endl;\n\t\tcout << c << endl;\n\t\tc = 0;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 3144,
"score_of_the_acc": -1.8881,
"final_rank": 10
},
{
"submission_id": "aoj_0112_2035791",
"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\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 1000000007\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\n\nll n, a;\nV vi;\n\nint main(){\n\twhile (cin >> n&&n){\n\t\tREP(i, n){\n\t\t\tcin >> a;\n\t\t\tvi.push_back(a);\n\t\t}\n\t\tsort(ALL(vi));\n\t\tll sum = 0;\n\t\tREP(i, n){\n\t\t\tREP(j, i){\n\t\t\t\tsum += vi[j];\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t\tvi.clear();\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3236,
"score_of_the_acc": -1.0503,
"final_rank": 7
},
{
"submission_id": "aoj_0112_1982891",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <list>\n#include <algorithm>\n#include <cmath>\n#include <stack>\n#include <map>\n#include <numeric>\n#include <sstream>\n#include <queue>\n#include <iomanip>\nusing namespace std;\n\n#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)\n#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)\n#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}\n#define ALL(v) v.begin(), v.end()\n#define print(s) cout << (s) << endl\n\nvoid solve112(int n) {\n vector<int> v;\n PUSH(n,v);\n sort(ALL(v));\n long s = 0;\n REP(i,n) {\n s += (n-i-1) * v[i];\n }\n cout << s << endl;\n}\n\nint main() {\n int n;\n while (cin >> n, n) {\n solve112(n);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1324,
"score_of_the_acc": -0.0532,
"final_rank": 4
},
{
"submission_id": "aoj_0112_1782189",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\nint main()\n{\n\tlong long int n,sum,S,temp;\n\tpriority_queue<int, vector<int>,greater<int> > que;\n\twhile(cin >> n, n){\n\t\tS = 0;\n\t\tsum = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tcin >> temp;\n\t\t\tque.push(temp);\n\t\t}\n\t\twhile(!que.empty()){\n\t\t\tsum += S;\n\t\t\tS += que.top();\n\t\t\tque.pop();\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1320,
"score_of_the_acc": -0.0514,
"final_rank": 3
},
{
"submission_id": "aoj_0112_1757796",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n=0;\n while(cin>>n,n){\n int people[10000];\n for(int i=0;i<n;i++)cin>>people[i];\n sort(people,people+n);\n long long int ans=0,now=0;\n for(int i=0;i<n;i++){\n ans+=now;\n now+=people[i];\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0112_1719523",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nlong long n,s[10001],count;\nint main(){\n\twhile(true){\n\tcin>>n;\n\tif(n==0)\n\t\tbreak;\n\tcount=0;\n\tfor(int i=0;i<n;i++)\n\t\tcin>>s[i];\n\tfor(int i=0;i<n-1;i++){\n\t\tfor(int j=n-1;j>i;j--){\n\t\t\tif(s[j]<s[j-1]){\n\t\t\t\tint tmp=s[j];\n\t\t\t\ts[j]=s[j-1];\n\t\t\t\ts[j-1]=tmp;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<n;i++)\n\t\tcount+=s[i]*(n-1-i);\n\tcout<<count<<endl;\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 1232,
"score_of_the_acc": -0.971,
"final_rank": 5
},
{
"submission_id": "aoj_0112_1644886",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\n int n;\n long long total;\n\n while(cin >> n, n){\n\n int time[n], sum[n];\n\n for(int i = 0; i < n; ++i){\n cin >> time[i];\n }\n\n sort(time, time + n);\n\n sum[0] = 0;\n for(int i = 1; i < n; ++i){\n sum[i] = sum[i - 1] + time[i - 1];\n }\n\n total = 0;\n for(int i = 0; i < n; ++i){\n total += sum[i];\n }\n\n cout << total << endl;\n\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1252,
"score_of_the_acc": -0.0202,
"final_rank": 2
}
] |
aoj_0114_cpp
|
電子蝿
ある計算機学者が電子空間に棲息する電子蝿という奇妙な生命体を見つけました。電子蝿の行動を観察しているうちに、この空間の (
x
,
y
,
z
) 地点にいる電子蝿は、次に以下の規則で示される (
x'
,
y'
,
z'
)に移動することが分かりました。
ただし、
a
1
,
m
1
,
a
2
,
m
2
,
a
3
,
m
3
は電子蝿の個体ごとに定まる正の整数です。
A
mod
B
は正の整数
A
を正の整数
B
で割ったときの余りです。
さらに観察をすると、ある種の電子蝿は (1,1,1) に置いてからしばらくすると、必ず (1,1,1) に戻ってくることがわかりました。このような蝿を戻り蝿と名付けました
(1)
。
戻り蝿のデータを入力とし、(1,1,1) に戻ってくる最小の移動回数 (>0) を出力するプログラムを作成してください。なお 1<
a
1
,
m
1
,
a
2
,
m
2
,
a
3
,
m
3
< 2
15
とします。
(1)
a
1
と
m
1
,
a
2
と
m
2
,
a
3
と
m
3
がそれぞれ互いに素 (公約数が 1) である時に戻ります。
Input
複数のデータセットが与えられます。各データセットは以下の形式で与えられます。
a
1
m
1
a
2
m
2
a
3
m
3
入力は６つの 0 を含む行で終わります。データセットの数は 50 を超えません。
Output
各データセットごとに、(1,1,1) に戻ってくる最小の移動回数(整数)を１行に出力してください。
Sample Input
2 5 3 7 6 13
517 1024 746 6561 4303 3125
0 0 0 0 0 0
Output for the Sample Input
12
116640000
|
[
{
"submission_id": "aoj_0114_10851571",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nll gcd(ll a, ll b) {\n if(b == 0) {\n return a;\n }\n return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b) {\n int g = gcd(a, b);\n a /= g;\n b /= g;\n return a * b * g;\n}\n\nint main() {\n vector<ll> a(3), m(3);\n while(true) {\n for(int i=0; i<3; ++i) {\n cin >> a[i] >> m[i];\n }\n if(m[0] == 0) {\n break;\n }\n vector<ll> cnt(3, 1);\n for(int i=0; i<3; ++i) {\n ll now = (a[i] % m[i]);\n while(now != 1) {\n cnt[i]++;\n (now *= a[i]) %= m[i];\n }\n }\n ll res = lcm(cnt[0], cnt[1]);\n res = lcm(res, cnt[2]);\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3324,
"score_of_the_acc": -0.8587,
"final_rank": 16
},
{
"submission_id": "aoj_0114_9746925",
"code_snippet": "#pragma region Macros\n \n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,mmx,abm,bmi,bmi2,popcnt,lzcnt\")\n// #pragma GCC target(\"avx2\") // CF, CodeChef, HOJ ではコメントアウト\n \n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n \n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n \n// #define sqrt __builtin_sqrtl\n// #define cbrt __builtin_cbrtl\n// #define hypot __builtin_hypotl\n \nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n \nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n \n#define EC double\nstruct Edge {\n int from, to;\n EC cost;\n Edge() {}\n // Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge &e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge &e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n bool operator <(const Edge &e) { return this->cost < e.cost; }\n bool operator >(const Edge &e) { return this->cost > e.cost; }\n};\n \nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n \nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int() {\n return dist_x(rng);\n }\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nnamespace bit_function {\n using i64 = ll;\n // using i64 = uint64_t;\n // bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\n i64 lrmask(int l, int r) { return (1LL << r) - (1LL << l); }\n i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\n i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n \n i64 popcount(i64 x) { return __builtin_popcountll(x); }\n i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); }\n i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみ\n i64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうる\n bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\n bool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n //bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); }\n \n int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\n int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n int next_bit(i64 x, int k) { // upper_bound\n x >>= (k + 1);\n int pos = k + 1;\n while (x > 0) {\n if (x & 1) return pos;\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int prev_bit(i64 x, int k) {\n // k = min(k, bit_width(x)); ?\n int pos = 0;\n while (x > 0 && pos < k) {\n if (x & 1) {\n if (pos < k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int kth_bit(i64 x, int k) { // kは1-indexed\n int pos = 0, cnt = 0;\n while (x > 0) {\n if (x & 1) {\n cnt++;\n if (cnt == k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\n i64 lsb(i64 x) { return (x & -x); } // mask\n \n int countl_zero(i64 x) { return __builtin_clzll(x); }\n int countl_one(i64 x) { // countl_oneと定義が異なるので注意\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n }\n int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64\n int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n // int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x));\n\n i64 l_one(i64 x) { // 最上位で連なってる1のmask\n if (x == 0) return 0;\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; }\n return ret;\n }\n \n int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bit\n int ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); }\n i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msb\n i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n \n i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\n i64 rotr(i64 x, int k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\n i64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n }\n // i64 bit_reverse(i64 x, int l, int r) {}\n \n bool is_palindrome(i64 x) { return x == bit_reverse(x); }\n bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\n i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\n i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカット\n \n i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\n i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\n i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\n i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\n i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n \n i64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n }\n} using namespace bit_function;\n\nnamespace util_function {\n namespace Std = std;\n __int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n // assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n // assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n }\n int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n }\n int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n return x - y * per(x, y);\n } // https://yukicoder.me/problems/no/2781\n int floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n }\n int ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n }\n int round(int x, int y) { // (ld)(x/y)を小数点第1位について四捨五入\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n }\n int round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0 && k >= 0);\n if (k == 0) return (x * 2 + y) / (y * 2);\n x /= y * POW(10, k - 1);\n if (x % 10 >= 5) return (x + 10 - x % 10) * POW(10, k - 1);\n return x * POW(10, k - 1);\n }\n int round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = x / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n }\n ld round(ld x, int k) { // xを10^kの位に関して四捨五入.\n // x += EPS;\n ld d = pow(10, -k);\n return Std::round(x * d) / d;\n }\n ld floor(ld x, int k) { // xを10^kの位に関してflooring\n // x += EPS;\n ld d = pow(10, -k);\n return Std::floor(x * d) / d; // 未verify\n }\n ld ceil(ld x, int k) { // xを10^kの位に関してceiling\n // x -= EPS;\n ld d = pow(10, -k);\n return Std::ceil(x * d) / d; // 未verify\n }\n // int kth(int x, int y, int k) { // x / yの10^kの位の桁\n // }\n int floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return Std::floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n }\n int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return Std::ceil(x / y);\n // ceil(x) = floor(x + 1)\n }\n int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return Std::floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -Std::floor(x / fabs(y));\n if (x < 0 && y < 0) return Std::floor(x / y) + (x - Std::floor(x/y)*y < -EPS);\n return Std::floor(x / y) - (x - Std::floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n }\n ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n }\n int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\n int modf(ld x) {\n if (x < 0) return ceill(x);\n else return floorl(x);\n }\n // 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\n int seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n }\n int seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n }\n\n int floor_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now <= x) {\n now *= base;\n if (now <= x) ret++;\n }\n return ret;\n }\n int ceil_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now < x) {\n now *= base;\n ret++;\n }\n return ret;\n }\n\n template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n }\n template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n }\n \n template <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n }\n template <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n }\n template <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - Std::max({a, b, c}) - Std::min({a, b, c});\n }\n template <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) if (a > b) swap(a, b);\n else if (b > a) swap(b, a);\n }\n template <typename T, typename... Args>\n void Sort(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.begin(), vec.end());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n template <typename T, typename... Args>\n void Sortr(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.rbegin(), vec.rend());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n\n istream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n }\n ostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n }\n \n __int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n }\n __int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n __int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n }\n \n string to_string(double x, int k) { // 小数第k+1を四捨五入して小数第k位までを出力\n // 切り捨てがほしい場合は to_string(x, k+1) として pop_back() すればよい?\n ostringstream os;\n os << fixed << setprecision(k) << x;\n return os.str();\n }\n string to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n }\n string to_string(char c) { string s = \"\"; s += c; return s; }\n} using namespace util_function;\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n \n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\ntemplate<typename T>\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<T, int, custom_hash> Z;\n // gp_hash_table<int, T, custom_hash> UZ;\n unordered_map<T, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, T> UZ; // 圧縮した値 -> 元の値\n \n Compress() {}\n Compress(const vector<T> &V, T base = 0) {\n this->sz = base;\n set<T> s(V.begin(), V.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, T base = 0) {\n this->sz = base;\n vector<T> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<T> s(V3.begin(), V3.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, T base = 0) {\n this->sz = base;\n vector<T> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<T> s(V4.begin(), V4.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2,\n const vector<T> &V3, const vector<T> &V4, T base = 0) {\n this->sz = base;\n vector<T> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<T> s(V5.begin(), V5.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n vector<int> zip(const vector<T> &V) {\n vector<int> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[V[i]];\n }\n return ret;\n }\n \n vector<T> unzip(const vector<int> &V) {\n vector<T> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[V[i]];\n }\n return ret;\n }\n \n int size() { return sz; }\n \n int encode(T x) { return Z[x]; }\n T decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n \nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n \ntemplate<typename T> struct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<T> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n \ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n \n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n\n friend istream &operator >>(istream &is, Modint& x) {\n int t; is >> t; x = t; return (is);\n }\n friend ostream &operator <<(ostream &os, const Modint& x) {\n return os << x.val;\n }\n};\nusing mint = Modint<MOD>;\n \nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n// int modinv(__int128_t x, int mod) { // \n// assert(mod > 0);\n// // assert(x > 0);\n// if (x == 1 or x == 0) return 1;\n// return mod - modinv(mod % x, mod) * (mod / x) % mod;\n// }\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n \nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint FACinv(int N) {\n if (N < 0) return 0; return _finv[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint COMinv(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _finv[N] * _fac[K] * _fac[N - K];\n}\nmint MCOM(const vector<int> &V) {\n int N = 0;\n for (int i = 0; i < V.size(); i++) N += V[i];\n mint ret = _fac[N];\n for (int i = 0; i < V.size(); i++) ret *= _finv[V[i]];\n return ret;\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n \n#pragma endregion\n\nsigned main() {\n int a, m1, b, m2, c, m3;\n while (cin >> a >> m1 >> b >> m2 >> c >> m3, a) {\n int x = (1 * a) % m1, y = (1 * b) % m2, z = (1 * c) % m3;\n\n int cnt1 = 1;\n while (x != 1) {\n x = (x * a) % m1;\n cnt1++;\n }\n int cnt2 = 1;\n while (y != 1) {\n y = (y * b) % m2;\n cnt2++;\n }\n int cnt3 = 1;\n while (z != 1) {\n z = (z * c) % m3;\n cnt3++;\n }\n cout << lcm(lcm(cnt1, cnt2), cnt3) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3244,
"score_of_the_acc": -0.7844,
"final_rank": 14
},
{
"submission_id": "aoj_0114_7164306",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint euler[100010];\nlong long lcm(long long a, long long b){\n return a*b/__gcd(a, b);\n}\nvoid ep(){\n for(int i=0;i<100010;i++) euler[i] = i;\n for(int i=2;i<100010;i++){\n if(euler[i] == i){\n for(int j=i;j<100010;j+=i) euler[j] = euler[j]/i*(i-1);\n }\n }\n}\nint main(){\n int a1, a2, a3, x, y, z, xc, yc, zc;\n long long m1, m2, m3;\n ep();\n while(cin >> a1 >> m1 >> a2 >> m2 >> a3 >> m3, a1!=0){\n x = a1%m1;\n xc = 1;\n y = a2%m2;\n yc = 1;\n z = a3%m3;\n zc = 1;\n while(x!=1){\n x = a1*x%m1;\n xc++;\n }\n while(y!=1){\n y = a2*y%m2;\n yc++;\n }\n while(z!=1){\n z = a3*z%m3;\n zc++;\n }\n cout << lcm(xc, lcm(yc, zc)) << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3476,
"score_of_the_acc": -1,
"final_rank": 20
},
{
"submission_id": "aoj_0114_6963876",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cmath>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll calc_gcd(ll l, ll h) {\n if(h < l) {\n swap(l, h);\n }\n\n ll mod = h%l;\n while(mod > 0) {\n h = l;\n l = mod;\n\n mod = h%l;\n }\n\n return l;\n}\n\nll calc_lcm(ll l, ll h) {\n return l/calc_gcd(l, h)*h;\n}\n\nll calc_loop(int a, int m) {\n if(a == 0 || m == 0){\n return 0;\n }\n ll x = 1, count = 0;\n while(true) {\n x = a*x%m;\n count++;\n if(x == 1) {\n return count;\n }\n }\n}\n\nint main() {\n while(true){\n int sum = 0;\n ll l[3];\n for(int i = 0; i < 3; i++) {\n int a, m;\n cin >> a >> m;\n l[i] = calc_loop(a, m);\n sum += a + m;\n }\n if(sum == 0) {\n break;\n }\n\n cout << calc_lcm(calc_lcm(l[0], l[1]), l[2]) << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2996,
"score_of_the_acc": -0.5539,
"final_rank": 6
},
{
"submission_id": "aoj_0114_6937393",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n vector<ll> a(3), m(3);\n while(cin >> a[0] >> m[0] >> a[1] >> m[1] >> a[2] >> m[2], a[0]){\n ll ans = 1;\n for(int i = 0; i < 3; i++){\n ll v = 1, cnt = 0;\n do{\n (v *= a[i]) %= m[i];\n cnt++;\n }while(v != 1);\n ans = ans / __gcd(ans, cnt) * cnt;\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3324,
"score_of_the_acc": -0.8587,
"final_rank": 16
},
{
"submission_id": "aoj_0114_6937391",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct Baby_Step_Giant_Step{\n long long sq, sqinv, m;\n map<long long, int> mp;\n Baby_Step_Giant_Step(long long _m): m(_m){\n sq = sqrt(m) + 1;\n };\n void init(long long a){\n a %= m;\n if(a < 0) a += m;\n sqinv = internal_modinv(internal_modpow(a, sq));\n long long v = 1;\n for(int i = 0; i <= sq; i++){\n if(mp.find(v) != mp.end())break;\n mp[v] = i;\n (v *= a) %= m;\n }\n }\n long long internal_modpow(long long a, long long b){\n long long ans = 1;\n while(b){ \n if(b & 1) (ans *= a) %= m;\n (a *= a) %= m; \n b /= 2; \n } \n return ans;\n }\n long long internal_modinv(long long a) {\n long long b = m, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b; \n swap(a, b);\n u -= t * v; \n swap(u, v);\n }\n u %= m;\n if (u < 0) u += m;\n return u;\n }\n long long query(long long b){\n for(int i = 0; i <= sq + 1; i++, (b *= sqinv) %= m){\n if(mp.find(b) != mp.end())return mp[b] + sq * i;\n }\n return -1;\n }\n};\n\n\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u;\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\nlong long inv_mod(long long x, long long m) {\n assert(1 <= m);\n auto z = inv_gcd(x, m);\n assert(z.first == 1);\n return z.second;\n}\n\nstd::pair<long long, long long> crt(const std::vector<long long>& r,\n const std::vector<long long>& m) {\n assert(r.size() == m.size());\n int n = int(r.size());\n long long r0 = 0, m0 = 1;\n for (int i = 0; i < n; i++) {\n assert(1 <= m[i]);\n long long r1 = safe_mod(r[i], m[i]), m1 = m[i];\n if (m0 < m1) {\n std::swap(r0, r1);\n std::swap(m0, m1);\n }\n if (m0 % m1 == 0) {\n if (r0 % m1 != r1) return {0, 0};\n continue;\n }\n long long g, im;\n std::tie(g, im) = inv_gcd(m0, m1);\n long long u1 = (m1 / g);\n if ((r1 - r0) % g) return {0, 0};\n long long x = (r1 - r0) / g % u1 * im % u1;\n r0 += x * m0;\n m0 *= u1;\n if (r0 < 0) r0 += m0;\n }\n return {r0, m0};\n}\n\nint main(){\n vector<ll> a(3), m(3);\n while(cin >> a[0] >> m[0] >> a[1] >> m[1] >> a[2] >> m[2], a[0]){\n ll ans = 1;\n for(int i = 0; i < 3; i++){\n ll v = 1, cnt = 0;\n do{\n (v *= a[i]) %= m[i];\n cnt++;\n }while(v != 1);\n ans = ans / __gcd(ans, cnt) * cnt;\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3180,
"score_of_the_acc": -0.7249,
"final_rank": 13
},
{
"submission_id": "aoj_0114_6857175",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nll a1,a2,a3,m1,m2,m3,a,b,c,x,y,z;\nint main(void){\n while(cin>>a1>>m1>>a2>>m2>>a3>>m3,a1){\n a=b=c=0;\n x=y=z=1;\n while(!(a && x==1)){\n x=(a1*x)%m1;\n a++;\n }\n while(!(b && y==1)){\n y=(a2*y)%m2;\n b++;\n }\n while(!(c && z==1)){\n z=(a3*z)%m3;\n c++;\n }\n cout<<lcm(a,lcm(b,c))<<\"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3056,
"score_of_the_acc": -0.6097,
"final_rank": 9
},
{
"submission_id": "aoj_0114_6477354",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int a,b,c,x,y,z;\n while(cin >> a >> x >> b >> y >> c >> z,a){\n auto get=[&](int a,int m)->ll{\n int c = 0;\n int x = 1;\n do{\n x = x*a%m;\n c++;\n }while(x != 1);\n return c;\n };\n cout << lcm(get(a,x),lcm(get(b,y),get(c,z))) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3312,
"score_of_the_acc": -0.8476,
"final_rank": 15
},
{
"submission_id": "aoj_0114_5802355",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<sstream>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint a1,m1,a2,m2,a3,m3;\n\twhile(cin>>a1>>m1>>a2>>m2>>a3>>m3,a1){\n\t\tint x=1,ans1=0,y=1,ans2=0,z=1,ans3=0;\n\t\tdo{\n\t\t\t(x*=a1)%=m1;\n\t\t\tans1++;\n\t\t}while(x!=1);\n\t\tdo{\n\t\t\t(y*=a2)%=m2;\n\t\t\tans2++;\n\t\t}while(y!=1);\n\t\tdo{\n\t\t\t(z*=a3)%=m3;\n\t\t\tans3++;\n\t\t}while(z!=1);\n\t\tcout<<lcm(lcm(ans1,ans2),ans3)<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3368,
"score_of_the_acc": -0.8996,
"final_rank": 19
},
{
"submission_id": "aoj_0114_5134939",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nusing lli = long long int;\n\nlli gcd(lli a, lli b){\n if(a%b==0) return b;\n return gcd(b,a%b);\n}\nlli lcm(lli a, lli b){\n return a /gcd(a,b) *b;\n}\n\nint main(){\n while(1){\n vector<int> a(3),m(3);\n for(int i=0; i<3; i++){\n cin >> a[i] >> m[i];\n }\n if(a[0] == 0) break;\n\n vector<int> v(3, 0);\n for(int i=0; i<3; i++){\n int curr = 1;\n do{\n curr = curr*a[i] %m[i];\n v[i]++;\n }while(curr != 1);\n }\n cout << lcm(lcm(v[0], v[1]), v[2]) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3128,
"score_of_the_acc": -0.6766,
"final_rank": 12
},
{
"submission_id": "aoj_0114_4997151",
"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\nint main(){\n\n\twhile(true){\n\t\tvector<long long> a(3),m(3);\n\t\trep(i,3)cin>>a[i]>>m[i];\n\t\t\n\t\tif(a[0]==0)break;\n\t\t\n\t\tlong long L = 1LL;\n\t\t\n\t\trep(i,3){\n\t\t\tlong long now = 1;\n\t\t\trep(j,10000000){\n\t\t\t\tnow *= a[i];\n\t\t\t\tnow %= m[i];\n\t\t\t\t\n\t\t\t\tif(now==1){\n\t\t\t\t\tL = lcm(L,j+1);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout<<L<<endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3324,
"score_of_the_acc": -0.8587,
"final_rank": 16
},
{
"submission_id": "aoj_0114_4572781",
"code_snippet": "#include <iostream>\n#include <vector>\n\n/*\nunsigned long long order(unsigned long long n)\n{\n\tstd::vector<int> primes;\n\tint p = 2;\n\twhile (n>1) {\n\t\tif (n % p == 0) {\n\t\t\tprimes.push_back(p);\n\t\t\tdo { n /= p; } while (n % p == 0);\n\t\t}\n\t\tp++;\n\t}\n\t\n\tunsigned long long res = 1;\n\t\n\tfor (int i=0; i<primes.size(); i++) {\n\t\tres *= primes[i] - 1;\n\t}\n\treturn res;\n}\n*/\n\nunsigned long long order(unsigned long long a, unsigned long long m)\n{\n\tunsigned long long x = 1;\n\tunsigned long long count = 0;\n\tdo {\n\t\tx *= a;\n\t\tx %= m;\n\t\tcount++;\n\t} while (x > 1);\n\treturn count;\n}\n\t\nunsigned long long gcd(unsigned long long x, unsigned long long y) {\n\tif (x==0) return y;\n\tif (y==0) return x;\n\tif (x>y) return gcd(y, x%y);\n\telse return gcd(x, y%x);\n}\n\nunsigned long long lcm(unsigned long long x, unsigned long long y)\n{\n\treturn (x*y) / gcd(x, y);\n}\n\nunsigned long long lcm3(unsigned long long x, unsigned long long y, unsigned long long z)\n{\n\treturn lcm(x, lcm(y, z));\n}\n\nint main()\n{\n\tunsigned long long a1, m1, a2, m2, a3, m3;\n\twhile (true) {\n\t\tstd::cin >> a1 >> m1 >> a2 >> m2 >> a3 >> m3;\n\t\tif (a1==0) break;\n\t\t//std::cout << lcm3(order(m1), order(m2), order(m3)) << std::endl;\n\t\tstd::cout << lcm3(order(a1, m1), order(a2, m2), order(a3, m3)) << std::endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3080,
"score_of_the_acc": -0.632,
"final_rank": 11
},
{
"submission_id": "aoj_0114_4430258",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\n\nint main() {\n auto lcm = [&](ll x, ll y){ return x/__gcd(x, y)*y; };\n auto g = [&](ll x, ll y){\n ll a = 1;\n for (int i = 1; i <= y; ++i) {\n (a *= x) %= y;\n if(a == 1) return i;\n }\n return 0;\n };\n ll a, b, c, d, e, f;\n while(cin >> a >> b >> c >> d >> e >> f, a){\n cout << lcm(g(a, b), lcm(g(c, d), g(e, f))) << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3064,
"score_of_the_acc": -0.6171,
"final_rank": 10
},
{
"submission_id": "aoj_0114_4272086",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n\nusing namespace std;\n\nint Func(int x, int y)\n{\n\tif (y == 0)\n\t\treturn x;\n\treturn Func(y, x % y);\n}\n\nint main()\n{\n\tint a1, m1, a2, m2, a3, m3;\n\twhile (true)\n\t{\n\t\tcin >> a1 >> m1 >> a2 >> m2 >> a3 >> m3;\n\t\tif (a1 == 0 && m1 == 0 && a2 == 0 && m2 == 0 && a3 == 0 && m3 == 0)\n\t\t\tbreak;\n\t\tint x = 1;\n\t\tint y = 1;\n\t\tint z = 1;\n\t\tlong long cycle1 = 0;\n\t\tlong long cycle2 = 0;\n\t\tlong long cycle3 = 0;\n\t\tint aa1 = a1 % m1;\n\t\tint aa2 = a2 % m2;\n\t\tint aa3 = a3 % m3;\n\t\tdo\n\t\t{\n\t\t\tcycle1++;\n\t\t\tx = (aa1 * (x % m1)) % m1;\n\t\t} \n\t\twhile (x != 1);\n\t\tdo\n\t\t{\n\t\t\tcycle2++;\n\t\t\ty = (aa2 * (y % m2)) % m2;\n\t\t} \n\t\twhile (y != 1);\n\t\tdo\n\t\t{\n\t\t\tcycle3++;\n\t\t\tz = (aa3 * (z % m3)) % m3;\n\t\t} \n\t\twhile (z != 1);\n\t\tlong long count = cycle1 / Func(cycle1, cycle2) * cycle2;\n\t\tcount = count / Func(count, cycle3) * cycle3;\n\t\tcout << count << endl;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2984,
"score_of_the_acc": -0.5428,
"final_rank": 5
},
{
"submission_id": "aoj_0114_4129972",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint A[3], M[3];\nlong long int Count[3];\n\nvoid calculation() {\n\tlong long int ans;\n\n\tfor (int index = 0; index < 3; index++) {\n\t\tans = A[index] % M[index];\n\t\twhile (ans != 1) {\n\t\t\tCount[index]++;\n\t\t\tans = (A[index] * ans) % M[index];\n\t\t}\n\t}\n\n}\n\nlong long int findLeastCommonMultiple(long long int a, long long int b) {\n\tlong long int c, a1, b1;\n\n\ta1 = a;\n\tb1 = b;\n\tc = a % b;\n\twhile (c != 0) {\n\t\ta = b;\n\t\tb = c;\n\t\tc = a % b;\n\t}\n\treturn (b1 / b) *a1;\n}\n\n\nint main() {\n\n\twhile (1) {\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tcin >> A[i] >> M[i];\n\t\t\tCount[i] = 1;\n\t\t}\n\t\tif (A[0] == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcalculation();\n\t\tcout << findLeastCommonMultiple(findLeastCommonMultiple(Count[0],Count[1]),Count[2]) << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3004,
"score_of_the_acc": -0.5613,
"final_rank": 7
},
{
"submission_id": "aoj_0114_3879121",
"code_snippet": "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) REP(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define MSG(a) cout << #a << \" \" << a << endl;\n#define REP(i, x, n) for (int i = x; i < n; i++)\n#define OP(m) cout << m << endl\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nll gcd(ll a, ll b)\n{\n ll r = a % b;\n if (r == 0)\n {\n return b;\n }\n return gcd(b, r);\n}\n\nll lcm(ll a, ll b)\n{\n return a * b / gcd(a, b);\n}\n\nint main()\n{\n ll a1, m1, a2, m2, a3, m3;\n while (cin >> a1 >> m1 >> a2 >> m2 >> a3 >> m3, a1)\n {\n ll c1, c2, c3;\n ll sum = 1;\n for (int i = 1; i < m1; i++)\n {\n sum = (sum * a1) % m1;\n if (sum == 1)\n {\n c1 = i;\n break;\n }\n }\n sum = 1;\n for (int i = 1; i < m2; i++)\n {\n sum = (sum * a2) % m2;\n if (sum == 1)\n {\n c2 = i;\n break;\n }\n }\n sum = 1;\n for (int i = 1; i < m3; i++)\n {\n sum = (sum * a3) % m3;\n if (sum == 1)\n {\n c3 = i;\n break;\n }\n }\n OP(lcm(lcm(c1, c2), c3));\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3004,
"score_of_the_acc": -0.5613,
"final_rank": 7
},
{
"submission_id": "aoj_0114_3770238",
"code_snippet": "#include <cstdio>\n#include <cctype>\n#include <utility>\n#include <array>\n#include <algorithm>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n_T _DEF(T,in,int c){T n=0;int m=1;while(isspace(c)){c=gcu();}if(c=='-')m=-1,c=gcu();\n\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n_DEF(int,in,){return in<int>(gcu());}\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n_T _SCAN(T &n){int c=gcu();return c==EOF?n=0,false:(n=in<T>(c),true);}\n_SCAN(char &c){c=gcu();gcu();return c!=EOF;}\n#ifdef _GLIBCXX_STRING\n_SCAN(string &s){int c;s=\"\";\n\tfor(;;){c=gcu();if(c=='\\n'||c==' ')return true;else if(c==EOF)return false;s+=(char)c;}}\n#endif\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);} _OUT(const char *s){while(*s)pcu(*s++);} _OUT(char c){pcu(c);}\n#ifdef _GLIBCXX_STRING\n_OUT(string s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n_T _OUT(vector<T> v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n_HT _OUT(H&& h, T&&... t){out(h);out(move(t)...);}\ntemplate <typename... T> _OUTL(T&&... t){out(move(t)...);outl();}\nstruct range{\n\tint e,b=0,s=1; range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\tstruct it { int v, s; it (int _v, int _s) : v(_v), s(_s) {} operator int()const{return v;} operator int&(){return v;} int operator*()const{return v;}\n\t\tit& operator++(){v+=s;return *this;} }; it begin() {return {b, s};} it end() {return {e, s};}};\n\n\nlong lcm(long a, long b) {\n\treturn a * b / __gcd(a, b);\n}\n\nint main() {\n\tarray<int, 3> s;\n\tfor (;;) {\n\t\tfor (auto &i: s) {\n\t\t\tint a {in()}, m {in()};\n\t\t\tif (!a)\n\t\t\t\treturn 0;\n\t\t\ti = 1;\n\t\t\tfor (int t = a % m; t != 1; t = t * a % m)\n\t\t\t\ti++;\n\t\t}\n\t\toutl(lcm(lcm(s[0], s[1]), s[2]));\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2400,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0114_3770232",
"code_snippet": "#include <cstdio>\n#include <cctype>\n#include <utility>\n#include <array>\n#include <algorithm>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n_T _DEF(T,in,int c){T n=0;int m=1;while(isspace(c)){c=gcu();}if(c=='-')m=-1,c=gcu();\n\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n_DEF(int,in,){return in<int>(gcu());}\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n_T _SCAN(T &n){int c=gcu();return c==EOF?n=0,false:(n=in<T>(c),true);}\n_SCAN(char &c){c=gcu();gcu();return c!=EOF;}\n#ifdef _GLIBCXX_STRING\n_SCAN(string &s){int c;s=\"\";\n\tfor(;;){c=gcu();if(c=='\\n'||c==' ')return true;else if(c==EOF)return false;s+=(char)c;}}\n#endif\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);} _OUT(const char *s){while(*s)pcu(*s++);} _OUT(char c){pcu(c);}\n#ifdef _GLIBCXX_STRING\n_OUT(string s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n_T _OUT(vector<T> v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n_HT _OUT(H&& h, T&&... t){out(h);out(move(t)...);}\ntemplate <typename... T> _OUTL(T&&... t){out(move(t)...);outl();}\nstruct range{\n\tint e,b=0,s=1; range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\tstruct it { int v, s; it (int _v, int _s) : v(_v), s(_s) {} operator int()const{return v;} operator int&(){return v;} int operator*()const{return v;}\n\t\tit& operator++(){v+=s;return *this;} }; it begin() {return {b, s};} it end() {return {e, s};}};\n\n\nlong lcm(long a, long b) {\n\treturn a * b / __gcd(a, b);\n}\n\nint main() {\n\tfor (;;) {\n\t\tarray<int, 3> s {};\n\t\tfor (auto &i: s) {\n\t\t\tint a {in()}, m {in()};\n\t\t\tif (!a)\n\t\t\t\treturn 0;\n\t\t\tint t {1};\n\t\t\tdo {\n\t\t\t\ti++;\n\t\t\t\tt = a * t % m;\n\t\t\t} while (t != 1);\n\t\t}\n\t\toutl(lcm(lcm(s[0], s[1]), s[2]));\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2452,
"score_of_the_acc": -0.0483,
"final_rank": 3
},
{
"submission_id": "aoj_0114_3770159",
"code_snippet": "#include <cstdio>\n#include <cctype>\n#include <utility>\n#include <array>\n#include <algorithm>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n_T _DEF(T,in,int c){T n=0;int m=1;while(isspace(c)){c=gcu();}if(c=='-')m=-1,c=gcu();\n\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n_DEF(int,in,){return in<int>(gcu());}\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n_T _SCAN(T &n){int c=gcu();return c==EOF?n=0,false:(n=in<T>(c),true);}\n_SCAN(char &c){c=gcu();gcu();return c!=EOF;}\n#ifdef _GLIBCXX_STRING\n_SCAN(string &s){int c;s=\"\";\n\tfor(;;){c=gcu();if(c=='\\n'||c==' ')return true;else if(c==EOF)return false;s+=(char)c;}}\n#endif\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);} _OUT(const char *s){while(*s)pcu(*s++);} _OUT(char c){pcu(c);}\n#ifdef _GLIBCXX_STRING\n_OUT(string s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n_T _OUT(vector<T> v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n_HT _OUT(H&& h, T&&... t){out(h);out(move(t)...);}\ntemplate <typename... T> _OUTL(T&&... t){out(move(t)...);outl();}\nstruct range{\n\tint e,b=0,s=1; range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\tstruct it { int v, s; it (int _v, int _s) : v(_v), s(_s) {} operator int()const{return v;} operator int&(){return v;} int operator*()const{return v;}\n\t\tit& operator++(){v+=s;return *this;} }; it begin() {return {b, s};} it end() {return {e, s};}};\n\n\nlong lcm(long a, long b) {\n\treturn a * b / __gcd(a, b);\n}\n\nint main() {\n\tarray<int, 3> s;\n\tfor (;;) {\n\t\tfor (auto &i: s) {\n\t\t\tint a {in()}, m {in()};\n\t\t\tif (!a)\n\t\t\t\treturn 0;\n\t\t\ti = 1;\n\t\t\tfor (int t = a; t != 1; t = t * a % m)\n\t\t\t\ti++;\n\t\t}\n\t\toutl(lcm(lcm(s[0], s[1]), s[2]));\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2400,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0114_3770158",
"code_snippet": "#include <cstdio>\n#include <cctype>\n#include <utility>\n#include <array>\n#include <algorithm>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n_T _DEF(T,in,int c){T n=0;int m=1;while(isspace(c)){c=gcu();}if(c=='-')m=-1,c=gcu();\n\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n_DEF(int,in,){return in<int>(gcu());}\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n_T _SCAN(T &n){int c=gcu();return c==EOF?n=0,false:(n=in<T>(c),true);}\n_SCAN(char &c){c=gcu();gcu();return c!=EOF;}\n#ifdef _GLIBCXX_STRING\n_SCAN(string &s){int c;s=\"\";\n\tfor(;;){c=gcu();if(c=='\\n'||c==' ')return true;else if(c==EOF)return false;s+=(char)c;}}\n#endif\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);} _OUT(const char *s){while(*s)pcu(*s++);} _OUT(char c){pcu(c);}\n#ifdef _GLIBCXX_STRING\n_OUT(string s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n_T _OUT(vector<T> v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n_HT _OUT(H&& h, T&&... t){out(h);out(move(t)...);}\ntemplate <typename... T> _OUTL(T&&... t){out(move(t)...);outl();}\nstruct range{\n\tint e,b=0,s=1; range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\tstruct it { int v, s; it (int _v, int _s) : v(_v), s(_s) {} operator int()const{return v;} operator int&(){return v;} int operator*()const{return v;}\n\t\tit& operator++(){v+=s;return *this;} }; it begin() {return {b, s};} it end() {return {e, s};}};\n\n\nlong lcm(long a, long b) {\n\treturn a * b / __gcd(a, b);\n}\n\nint main() {\n\tarray<long, 3> s;\n\tfor (;;) {\n\t\tfor (auto &i: s) {\n\t\t\tint a {in()}, m {in()};\n\t\t\tif (!a)\n\t\t\t\treturn 0;\n\t\t\ti = 1;\n\t\t\tfor (int t = a; t != 1; t = t * a % m)\n\t\t\t\ti++;\n\t\t}\n\t\toutl(lcm(lcm(s[0], s[1]), s[2]));\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2536,
"score_of_the_acc": -0.1264,
"final_rank": 4
}
] |
aoj_0113_cpp
|
循環小数
2 つの正の整数
p
,
q
を入力し、
p
/
q
を小数として正確に表現することを考えます。(ただし、0 <
p
<
q
< 10
6
とします。)
このとき、結果は
有限の桁で正確に表現できる。
ある桁の範囲を繰り返す循環小数となる。
のいずれかとなります。筆算と同じ手順で1桁ずつ小数部を求めていくと、
割り切れた(余りが 0 になった)なら、そこまでの桁で正確に表現できた。
1度出てきた余りが、再び現れたなら、循環した。
と区別できます。
2 つの整数
p
,
q
を入力すると、
p
/
q
を小数で表した時の、小数部を出力するプログラムを作成してください。 ただし、
結果が有限の桁で正確に表現できる時は、数値だけを 1 行に出力してください。
結果が循環小数になる時は次のように 2 行に出力してください。
最初の行に、循環する部分までの数字を出力してください。
次の行には、循環しない部分の下には空白を出力し、循環する部分の下には「^」を出力してください。
いずれの場合も数字列は 80 文字を超えることはないものとします。
Input
入力は複数のデータセットからなります。各データセットとして、
p
,
q
が空白区切りで１行に与えられます。データセットの数は 250 を超えません。
Output
データセットごとに、循環しない小数の場合は数値の小数部分を(この場合 1 行)、循環小数の場合は循環するまでの数字と循環する部分を示す記号「^」(この場合 2 行) を出力してください。
Sample Input
1 12
10000 32768
1 11100
1 459550
Output for the Sample Input
083
^
30517578125
00009
^^^
00000217604178
^^^^^^^^^^^^
|
[
{
"submission_id": "aoj_0113_7200432",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint jun[10000010];\nint main(){\n int p, q, cnt;\n while(cin >> p >> q){\n p = p%q*10;\n cnt = 0;\n memset(jun, -1, sizeof(jun));\n while(p != 0 && jun[p] == -1){\n cout << p/q;\n jun[p] = cnt;\n cnt++;\n p = p%q*10;\n }\n cout << endl;\n if(p != 0){\n for(int i=0;i<cnt;i++){\n if(i < jun[p]) cout << ' ';\n else cout << '^';\n }\n cout << endl;\n }\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 42040,
"score_of_the_acc": -1.9669,
"final_rank": 20
},
{
"submission_id": "aoj_0113_7096496",
"code_snippet": "#line 1 \"library/my_template.hpp\"\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\n\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n// https://trap.jp/post/1224/\n#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)\n#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)\n#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)\n#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))\n#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)\n#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\n#define FOR_R(...) \\\n overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\n\n#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))\n#define all(x) x.begin(), x.end()\n#define len(x) ll(x.size())\n#define elif else if\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n\ntemplate <typename T, typename U>\nT SUM(const vector<U> &A) {\n T sum = 0;\n for (auto &&a: A) sum += a;\n return sum;\n}\n\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)))\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n\nint popcnt(int x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(ll x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT pick(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\n\ntemplate <typename T>\nT pick(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(pqg<T> &que) {\n assert(que.size());\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(vc<T> &que) {\n assert(que.size());\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename T, typename U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <typename T, typename U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <typename T, typename U>\npair<T, T> divmod(T x, U y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng) {\n assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return ok;\n}\n\ntemplate <typename F>\ndouble binary_search_real(F check, double ok, double ng, int iter = 100) {\n FOR(iter) {\n double x = (ok + ng) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return (ok + ng) / 2;\n}\n\ntemplate <class T, class S>\ninline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\ntemplate <class T, class S>\ninline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n FOR(i, S.size()) { A[i] = S[i] - first_char; }\n return A;\n}\n\ntemplate <typename T, typename U>\nvector<T> cumsum(vector<U> &A, int off = 1) {\n int N = A.size();\n vector<T> B(N + 1);\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\ntemplate <typename CNT, typename T>\nvc<CNT> bincount(const vc<T> &A, int size) {\n vc<CNT> C(size);\n for (auto &&x: A) { ++C[x]; }\n return C;\n}\n\n// stable\ntemplate <typename T>\nvector<int> argsort(const vector<T> &A) {\n vector<int> ids(A.size());\n iota(all(ids), 0);\n sort(all(ids),\n [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\n int n = len(I);\n vc<T> B(n);\n FOR(i, n) B[i] = A[I[i]];\n return B;\n}\n#line 1 \"library/other/io2.hpp\"\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 long double __VA_ARGS__; \\\n IN(__VA_ARGS__)\n\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n read(name)\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n read(name)\n\nvoid read(int &a) { cin >> a; }\nvoid read(long long &a) { cin >> a; }\nvoid read(char &a) { cin >> a; }\nvoid read(double &a) { cin >> a; }\nvoid read(long double &a) { cin >> a; }\nvoid read(string &a) { cin >> a; }\ntemplate <class T, class S> void read(pair<T, S> &p) { read(p.first), read(p.second); }\ntemplate <class T> void read(vector<T> &a) {for(auto &i : a) read(i);}\ntemplate <class T> void read(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\n read(head);\n IN(tail...);\n}\n\ntemplate <typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& A) {\n os << A.fi << \" \" << A.se;\n return os;\n}\n\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& A) {\n for (size_t i = 0; i < A.size(); i++) {\n if(i) os << \" \";\n os << A[i];\n }\n return os;\n}\n\nvoid print() {\n cout << \"\\n\";\n cout.flush();\n}\n\ntemplate <class Head, class... Tail>\nvoid print(Head&& head, Tail&&... tail) {\n cout << head;\n if (sizeof...(Tail)) cout << \" \";\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\n#line 3 \"main.cpp\"\n\nvoid solve() {\n ll p, q;\n while (cin >> p >> q) {\n vi pos(q, -1);\n string ANS;\n while (p) {\n if (pos[p] != -1) break;\n pos[p] = len(ANS);\n p *= 10;\n ANS += '0' + (p / q);\n p %= q;\n }\n int a = pos[p], b = len(ANS);\n print(ANS);\n if (p == 0) continue;\n for (auto&& x: ANS) x = ' ';\n FOR(i, a, b) ANS[i] = '^';\n print(ANS);\n }\n}\n\nsigned main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << setprecision(15);\n\n solve();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11292,
"score_of_the_acc": -0.2681,
"final_rank": 14
},
{
"submission_id": "aoj_0113_4813409",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int p,q;\n while(cin >> p >> q){\n vector<int> rm(q, -1);\n string sr = \"\";\n int i = 0;\n while(rm[p]==-1 and p>0){\n rm[p] = i++;\n p *= 10;\n sr += '0'+p/q;\n p %= q;\n }\n cout << sr << endl;\n if(rm[p] != -1){\n cout << string(rm[p], ' ') +string((int)sr.length()-rm[p], '^') << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7112,
"score_of_the_acc": -0.1689,
"final_rank": 9
},
{
"submission_id": "aoj_0113_2595903",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<string>\n#define lol(i,n) for(int i=0;i<n;i++)\n#define mod 1000000007\ntypedef long long ll;\nusing namespace std;\nint vist[1000010];\nint main(){\n int a,b;\n while(cin>>a>>b){\n a%=b;\n for(int i=0;i<1000010;i++)vist[i]=-1;\n int len=0;\n while(a){\n if(vist[a]==-1)vist[a]=len;\n else break;\n //cout<<\"#\"<<a<<\" \";\n a*=10;\n int tmp=a/b;\n a%=b;\n //cout<<a<<\" \"<<vist[a]<<\" \"<<tmp<<endl;\n len++;\n cout<<tmp;\n }\n cout<<endl;\n if(vist[a]==-1)continue;\n for(int i=0;i<len;i++){\n if(i<vist[a])cout<<\" \";\n else cout<<\"^\";\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 6984,
"score_of_the_acc": -0.2596,
"final_rank": 13
},
{
"submission_id": "aoj_0113_2057438",
"code_snippet": "#include <stdio.h>\n#include<math.h>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\n\tint p,q,start,end;\n\tint* table = new int[1000000];\n\tbool FLG;\n\n\twhile(scanf(\"%d %d\",&p,&q)!=EOF){\n\t\tfor(int i=0; i < q;i++)table[i] = -1;\n\n\t\tFLG = false;\n\n\t\ttable[p] = 0;\n\n\t\tfor(int i=1;i<=80;i++){\n\t\t\tp = 10*p;\n\t\t\tprintf(\"%d\",p/q);\n\t\t\tp = p%q;\n\t\t\tif(p == 0)break;\n\t\t\tif(table[p] == -1){\n\t\t\t\ttable[p] = i;\n\t\t\t}else{\n\t\t\t\tFLG = true;\n\t\t\t\tstart = table[p];\n\t\t\t\tend = i-1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"\\n\");\n\t\tif(FLG){\n\t\t\tfor(int i=0; i < start; i++)printf(\" \");\n\t\t\tfor(int i=start; i <= end; i++)printf(\"^\");\n\t\t\tprintf(\"\\n\");\n\t\t}\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6468,
"score_of_the_acc": -0.1536,
"final_rank": 6
},
{
"submission_id": "aoj_0113_1874401",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int p, q;\n while(cin >> p >> q){\n static int used[1000010];\n memset(used, -1, sizeof(used));\n string ans = \"\";\n string hat = \"\";\n int prevr = -1;\n for(int i = 0; ; i++){\n int r = p / q;\n int l = p % q;\n if(l == 0){\n\tans += to_string(r);\n\tbreak;\n }\n /*\n else if(prevr == r && used[l] != -1) {\n\tfor(int j = 0; j < i; j++){\n\t if(j < used[l]) hat += \" \";\n\t else hat += \"^\";\n\t}\n\tbreak;\n }\n */\n else if(used[l] != -1){\n\tans += to_string(r);\n\tfor(int j = 0; j <= i; j++){\n\t if(j <= used[l]) hat += \" \";\n\t else hat += \"^\";\n\t}\n\tbreak;\n } else {\n\tans += to_string(r);\n\tp = l;\n\tprevr = r;\n\tused[l] = i;\n }\n p *= 10;\n }\n cout << ans.substr(1) << endl;\n if(hat.size()) cout << hat.substr(1) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7156,
"score_of_the_acc": -0.1855,
"final_rank": 10
},
{
"submission_id": "aoj_0113_1874135",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int p,q,used[1000005];\n while(cin>>p>>q){\n for(int i=0;i<q;i++)used[i]=-1;\n vector<int>ans;\n int i=0,idx=-1;\n while(p){\n if(used[p]!=-1){idx=used[p];break;}\n used[p]=i;\n p*=10;\n ans.push_back(p/q);\n p%=q;\n i++;\n }\n for(int j=0;j<ans.size();j++)\n cout<<ans[j];\n cout<<endl;\n if(idx!=-1){\n for(int j=0;j<ans.size();j++){\n\tif(j<idx)cout<<\" \";\n\telse cout<<\"^\";\n }\n cout<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5124,
"score_of_the_acc": -0.1529,
"final_rank": 5
},
{
"submission_id": "aoj_0113_1847342",
"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\"\nint main() {\n\tstring st;\n\twhile (getline(cin,st)) {\n\t\tlong long int p = stoi(st.substr(0, st.find(\" \")));\n\t\tlong long int q = stoi(st.substr(st.find(\" \") + 1));\n\t\tvector<int>vs;\n\t\tfor (int i = 0; i < 10000; ++i) {\n\t\t\tp *= 10;\n\t\t\tvs.push_back(p / q);\n\t\t\tp %= q;\n\t\t\tif (!p)break;\n\t\t}\n\t\tif (vs.size() != 10000) {\n\t\t\tfor (auto v : vs) {\n\t\t\t\tcout << v;\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\telse {\n\t\t\tint roop = 1;\n\t\t\tfor (; roop <=80; ++roop) {\n\t\t\t\tbool flag = true;\n\t\t\t\tfor (int i = 2000; i < 8000; ++i) {\n\t\t\t\t\tif (vs[i] == vs[i + roop]) {\n\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (flag)break;\n\t\t\t}\n\t\t\tint start = 100;\n\t\t\tfor (; start >= 0; --start) {\n\t\t\t\tif (vs[start] == vs[start + roop]) {\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstart;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i <= start+roop; ++i) {\n\t\t\t\tcout << vs[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t\tfor (int i = 0; i <= start + roop; ++i) {\n\t\t\t\tif (i <=start)cout << \" \";\n\t\t\t\telse cout << \"^\";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3300,
"score_of_the_acc": -0.1096,
"final_rank": 4
},
{
"submission_id": "aoj_0113_1772448",
"code_snippet": "#include <iostream>\nusing namespace std;\nint p, q, visit[1000000];\nint main() {\n\twhile (cin >> p >> q) {\n\t\tfor (int i = 0; i < q; i++) visit[i] = -1; visit[p] = 0;\n\t\tfor (int i = 0; ; i++) {\n\t\t\tp *= 10, cout << p / q, p %= q;\n\t\t\tif (p == 0) {\n\t\t\t\tcout << endl; break;\n\t\t\t}\n\t\t\tif (visit[p] != -1) {\n\t\t\t\tcout << endl;\n\t\t\t\tfor (int j = 0; j < visit[p]; j++) cout << ' ';\n\t\t\t\tfor (int j = visit[p]; j <= i; j++) cout << '^';\n\t\t\t\tcout << endl; break;\n\t\t\t}\n\t\t\tvisit[p] = i + 1;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6900,
"score_of_the_acc": -0.1638,
"final_rank": 7
},
{
"submission_id": "aoj_0113_1772441",
"code_snippet": "#include <string>\n#include <iostream>\nusing namespace std;\nint p, q, visit[1000000];\nint main() {\n\twhile (cin >> p >> q) {\n\t\tstring s;\n\t\tfor (int i = 0; i < q; i++) visit[i] = -1; visit[p] = 0;\n\t\tfor (int i = 0; ; i++) {\n\t\t\tp *= 10, s += p / q + 48, p %= q;\n\t\t\tif (p == 0) {\n\t\t\t\tcout << s << endl; s = \"-1\"; break;\n\t\t\t}\n\t\t\tif (visit[p] != -1) {\n\t\t\t\tcout << s << endl;\n\t\t\t\tfor (int j = 0; j < visit[p]; j++) cout << ' ';\n\t\t\t\tfor (int j = visit[p]; j <= i; j++) cout << '^';\n\t\t\t\tcout << endl; break;\n\t\t\t}\n\t\t\tvisit[p] = i + 1;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7012,
"score_of_the_acc": -0.1665,
"final_rank": 8
},
{
"submission_id": "aoj_0113_1662933",
"code_snippet": "#include<iostream>\n#include<cstring>\nusing namespace std;\n\nlong long p, a, cnt;\nlong long x[100000];\n\nint main() {\n\twhile (cin >> p >> a) {\n\t\tcnt = 0;\n\t\tmemset(x, 0, sizeof(x));\n\t\twhile (true) {\n\t\t\tif (cnt >= 1) { cout << p / a; }\n\t\t\tif (p%a == 0) { break; }\n\t\t\tp *= 10;\n\t\t\tp %= (a * 10);\n\t\t\tx[cnt] = p;\n\t\t\tcnt++;\n\t\t\tfor (int i = 0; i < cnt - 1; i++) {\n\t\t\t\tif (p == x[i]) {\n\t\t\t\t\tcout << endl;\n\t\t\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\t\t\tcout << ' ';\n\t\t\t\t\t}\n\t\t\t\t\tfor (int j = i + 1; j < cnt; j++) {\n\t\t\t\t\t\tcout << '^';\n\t\t\t\t\t}\n\t\t\t\t\tgoto E;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tE:;\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1944,
"score_of_the_acc": -0.0462,
"final_rank": 2
},
{
"submission_id": "aoj_0113_1587829",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n int p, q;\n while (cin >> p >> q) {\n int prev[1000010];\n int hist[1000010];\n int ind = 0;\n\n fill(prev, prev + 1000010, -1);\n fill(hist, hist + 1000010, -1);\n\n while (true) {\n prev[p] = ind;\n hist[ind++] = 10 * p / q;\n p = 10 * p % q;\n if (p == 0 || prev[p] >= 0) {\n break;\n }\n }\n\n for (int j = 0; j < ind; ++j) {\n cout << hist[j];\n }\n cout << endl;\n if (p != 0) {\n for (int j = 0; j < prev[p]; ++j) {\n cout << ' ';\n }\n for (int j = prev[p]; j < ind; ++j) {\n cout << '^';\n }\n cout << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 8968,
"score_of_the_acc": -0.4317,
"final_rank": 16
},
{
"submission_id": "aoj_0113_1543573",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF 999999999\n\n\nint fin(vector<pii> vec,int x){\n rep(i,vec.size()){\n if(vec[i].first==x)return vec[i].second;\n }\n return -1;\n}\n\nint main(){\n int a,b;\n while(cin>>a>>b){\n static vector<pii> used[1000001];\n rep(i,1000001)used[i].clear();\n string ans=\"\";\n int c=0;\n a*=10;\n while(1){\n int x=a/b;\n int y=a%b;\n// cout<<x<<\" \"<<y<<endl;\n if(y==0){ans+='0'+x;cout<<ans<<endl;break;}\n int res=-1;\n if( used[y].size() && (res = fin(used[y],x))!=-1 ){\n cout<<ans<<endl;\n rep(i,res)cout<<\" \";\n rep(i,ans.size()-res)cout<<'^';\n cout<<endl;\n break;\n }\n ans+='0'+x;\n used[y].pb(pii(x,c));\n a-=b*x;\n c++;\n a*=10;\n }\n }\n \n}",
"accuracy": 1,
"time_ms": 650,
"memory_kb": 24656,
"score_of_the_acc": -1.5854,
"final_rank": 18
},
{
"submission_id": "aoj_0113_1313319",
"code_snippet": "#include<cstdio>\n#include<cstring>\n\nint p,q;\nint data[85];\nint encount[10000000];\nint prev[90];\nint main(void){\n\twhile(~scanf(\"%d%d\",&p,&q)){\n\t\tmemset(encount,0,sizeof(encount));\n\t\tmemset(data,0,sizeof(data));\n\t\tfor(int i=1;i<=80;i++){\n\t\t\tp*=10;\n\t\t\tif(encount[p]==0)encount[p]=i,prev[i]=p;\n\t\t\telse if(encount[p]!=0){\n\t\t\t\tprev[i]=p;\n\t\t\t\tfor(int j=1;j<i;j++)printf(\"%d\",data[j]);\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\tfor(int j=1;j<i;j++)printf(\"%c\",(encount[p]<=j && j<i)?'^':' ');\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdata[i]=p/q;\n\t\t\tp=p%q;\n\t\t\tif(p==0){\n\t\t\t\tfor(int j=1;j<=i;j++)printf(\"%d\",data[j]);\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 40096,
"score_of_the_acc": -1.6864,
"final_rank": 19
},
{
"submission_id": "aoj_0113_1113280",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <numeric>\n#include <utility>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef vector<long long> vll;\ntypedef pair<int,int> pint;\ntypedef pair<long long, long long> pll;\n\n#define MP make_pair\n#define PB push_back\n#define ALL(s) (s).begin(),(s).end()\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P) \n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s; }\n\n\n\nconst int DEFAULT_SIZE = 125;\nstruct Bigint : vector<long long> {\n static const long long BASE = 100000000;\n static const int BASE_DIGIT = 8;\n int sign;\n \n Bigint() : vector<long long>(1, 0) { sign = 1; }\n Bigint(long long num) : vector<long long>(DEFAULT_SIZE, 0) {\n sign = 1; if (num < 0) sign = -1;\n (*this)[0] = abs(num); \n (*this).normalize();\n }\n Bigint(int SIZE, long long num) : vector<long long>(SIZE, 0) {\n sign = 1; if (num < 0) sign = -1;\n (*this)[0] = abs(num); \n (*this).normalize();\n }\n \n Bigint& normalize() {\n long long c = 0;\n for (int i = 0;; ++i) {\n if (i >= (*this).size()) (*this).push_back(0);\n if ((*this)[i] < 0 && i+1 >= (*this).size()) (*this).push_back(0);\n while ((*this)[i] < 0) { (*this)[i+1] -= 1; (*this)[i] += BASE; }\n long long a = (*this)[i] + c;\n (*this)[i] = a % BASE;\n c = a / BASE;\n if (c == 0 && i == (*this).size()-1) break;\n }\n return (*this);\n }\n \n inline Bigint operator - () { \n Bigint res = (*this); \n bool allzero = true; for (int i = 0; i < res.size(); ++i) if (res[i] != 0) { allzero = false; break; }\n if (!allzero) res.sign *= -1; \n return res; \n }\n inline const Bigint& operator += (const Bigint &x);\n inline const Bigint& operator -= (const Bigint &x);\n inline const Bigint& operator *= (long long x);\n inline const Bigint& operator *= (const Bigint &x);\n inline const Bigint& operator /= (long long x);\n inline const Bigint& operator /= (const Bigint &x);\n inline const Bigint& operator %= (long long x);\n inline const Bigint& operator %= (const Bigint &x);\n};\n\ninline Bigint abs(const Bigint &x) {\n Bigint z = x;\n if (z.sign == -1) z.sign = 1;\n return z;\n}\ninline Bigint conv(string s) {\n Bigint res = 0;\n for (int i = 0; i < s.size(); ++i) {\n res += (long long)(s[i] - '0');\n if (i != s.size()-1) res *= 10;\n }\n return res;\n}\nostream &operator << (ostream &os, Bigint x) {\n if (x.sign == -1) os << '-';\n int d = x.size()-1; \n for (d = x.size()-1; d >= 0; --d) if (x[d] > 0) break;\n if (d == -1) os << 0;\n else os << x[d];\n for (int i = d-1; i >= 0; --i) { os.width(Bigint::BASE_DIGIT); os.fill('0'); os << x[i]; }\n return os;\n}\nistream &operator >> (istream &is, Bigint &x) {\n string s; is >> s;\n x = conv(s);\n return is;\n}\ninline bool operator > (Bigint x, Bigint y) {\n x.normalize(); y.normalize();\n if (x.sign > y.sign) return true;\n else if (x.sign < y.sign) return false;\n else if (x.sign == 1) {\n for (int i = x.size()-1; i >= 0; --i) if (x[i] != y[i]) return x[i] > y[i];\n return false;\n }\n else {\n for (int i = x.size()-1; i >= 0; --i) if (x[i] != y[i]) return x[i] < y[i];\n return false;\n }\n}\ninline bool operator < (Bigint x, Bigint y) { return y > x; }\ninline bool operator <= (Bigint x, Bigint y) { return !(y < x); }\ninline bool operator >= (Bigint x, Bigint y) { return !(x < y); }\ninline bool operator != (Bigint x, Bigint y) { return x < y || y < x; }\ninline bool operator == (Bigint x, Bigint y) { return !(x < y) && !(y < x); }\n\ninline Bigint operator + (Bigint x, Bigint y) {\n while (x.size() < y.size()) x.push_back(0);\n while (x.size() > y.size()) y.push_back(0);\n Bigint z((int)x.size(), 0);\n if (x.sign == y.sign) {\n z.sign = x.sign;\n for (int i = 0; i < x.size(); ++i) z[i] = x[i] + y[i];\n }\n else {\n if (x.sign == -1) swap(x, y);\n if (x >= -y) { z.sign = 1; for (int i = 0; i < x.size(); ++i) z[i] = x[i] - y[i]; }\n else { z.sign = -1; for (int i = 0; i < x.size(); ++i) z[i] = y[i] - x[i]; }\n }\n return z.normalize();\n} \ninline Bigint operator - (Bigint x, Bigint y) {\n y = -y;\n return x + y;\n}\ninline Bigint operator * (Bigint x, long long a) {\n Bigint z((int)x.size(), 0);\n if ( (x.sign == 1 && a >= 0) || (x.sign == -1 && a < 0) ) z.sign = 1;\n else z.sign = -1;\n a = abs(a);\n for (int i = 0; i < x.size(); ++i) z[i] = x[i] * a;\n return z.normalize();\n}\ninline Bigint operator * (Bigint x, Bigint y) {\n int tx = x.size()-1, ty = y.size()-1; \n for (tx = x.size()-1; tx >= 0; --tx) if (x[tx] > 0) break;\n for (ty = y.size()-1; ty >= 0; --ty) if (y[ty] > 0) break;\n Bigint z(tx+ty+5, 0);\n if (x.sign == y.sign) z.sign = 1;\n else z.sign = -1;\n for (int i = 0; i <= tx; ++i) {\n for (int j = 0; j <= ty && i+j < z.size()-1; ++j) {\n long long val = x[i] * y[j] + z[i+j];\n z[i+j+1] += val / Bigint::BASE;\n z[i+j] = val % Bigint::BASE;\n }\n }\n return z.normalize();\n}\npair<Bigint, long long> divmod(Bigint x, long long a) {\n long long c = 0, t = 0;\n for (int i = x.size()-1; i >= 0; --i) {\n t = Bigint::BASE * c + x[i];\n x[i] = t / a;\n c = t % a;\n }\n x.normalize();\n return pair<Bigint, long long>(x, c);\n}\nBigint operator / (Bigint x, long long a) {\n return divmod(x, a).first;\n}\nlong long operator % (Bigint x, long long a) {\n return divmod(x, a).second;\n}\npair<Bigint, Bigint> divmod(Bigint x, Bigint y) {\n Bigint zero = 0;\n if (abs(x) < abs(y)) return pair<Bigint, Bigint>(zero, x);\n Bigint ay = abs(y), q((int)x.size(), 0), r((int)y.size(), 0);\n int tx = x.size()-1; \n for (tx = x.size()-1; tx >= 0; --tx) if (x[tx] > 0) break;\n for (int i = tx; i >= 0; --i) {\n r = r * Bigint::BASE + x[i];\n long long lo = 0, hi = Bigint::BASE;\n if (r >= ay) {\n while (hi - lo > 1) {\n int mid = (hi + lo) / 2;\n if (ay * mid > r) hi = mid;\n else lo = mid;\n }\n r = r - ay * lo;\n }\n q[i] = lo;\n }\n if (x.sign == -1 || y.sign == -1) q.sign = -1, r.sign = -1;\n return make_pair(q.normalize(), r.normalize());\n}\nBigint operator / (Bigint x, Bigint y) {\n return divmod(x, y).first;\n}\nBigint operator % (Bigint x, Bigint y) {\n return divmod(x, y).second;\n}\ninline Bigint pow(Bigint a, long long n) {\n Bigint res = 1;\n while (n > 0) { if (n & 1) { res = res * a; } a = a * a; n >>= 1; }\n return res;\n}\ninline const Bigint& Bigint::operator += (const Bigint &x) {*this = *this + x; return *this;}\ninline const Bigint& Bigint::operator -= (const Bigint &x) {*this = *this - x; return *this;}\ninline const Bigint& Bigint::operator *= (long long x) {*this = *this * x; return *this;}\ninline const Bigint& Bigint::operator *= (const Bigint &x) {*this = *this * x; return *this;}\ninline const Bigint& Bigint::operator /= (long long x) {*this = *this / x; return *this;}\ninline const Bigint& Bigint::operator /= (const Bigint &x) {*this = *this / x; return *this;}\ninline const Bigint& Bigint::operator %= (long long x) {*this = *this % x; return *this;}\ninline const Bigint& Bigint::operator %= (const Bigint &x) {*this = *this % x; return *this;}\n\nlong long gcd(long long a, long long b) {\n if (b == 0) return a;\n else return gcd(b, a % b);\n}\n\nlong long ta, b;\n\nint main() {\n while (cin >> ta >> b) {\n long long d = gcd(ta, b);\n ta /= d;\n b /= d;\n \n Bigint a = ta;\n string res = \"\";\n a *= 10;\n while (a < b) {\n res += \"0\";\n a *= 10;\n }\n int zero2 = 0, zero5 = 0;\n int b2 = b;\n while (b2 % 2 == 0) { b2 /= 2; ++zero2; }\n while (b2 % 5 == 0) { b2 /= 5; ++zero5; }\n int zero = max(zero2, zero5);\n \n if (b2 == 1) {\n for (int i = 0; i < 1000; ++i) a *= 10;\n Bigint q = a / b;\n stringstream sout; sout << q;\n res += sout.str();\n while (res[res.size()-1] == '0') res = res.substr(0, res.size()-1);\n cout << res << endl;\n }\n else {\n int con = 0;\n long long tot = 1;\n for (int i = 0; i < 1000; ++i) {\n tot *= 10;\n tot %= b2;\n ++con;\n if (tot == 1) break;\n }\n \n for (int i = 0; i < 1000; ++i) a *= 10;\n Bigint q = a / b;\n \n stringstream sout; sout << q;\n res += sout.str();\n \n res = res.substr(0, zero + con);\n string res2 = \"\";\n for (int i = 0; i < zero; ++i) res2 += ' ';\n for (int i = 0; i < con; ++i) res2 += '^';\n \n cout << res << endl;\n cout << res2 << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 1280,
"score_of_the_acc": -0.421,
"final_rank": 15
},
{
"submission_id": "aoj_0113_897251",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,m,a,b,c,d;\nint ans[10000000];\nint flg[10000000];\nint main(){\n for(int i=0;i<=10000000;i++)flg[i]=-1;\n while(cin>>n>>m){\n for(int i=0;i<=d;i++)flg[i]=-1;\n \n n=n%m;\n d=c=-1;\n for(int i=0;i<=10000000;i++){\n n*=10;\n if(flg[n]!=-1){\n\tc=i;break;\n }\n flg[n]=i;d=max(d,n);\n ans[i]=n/m;\n cout<<ans[i];\n n=n%m;\n if(n==0)break;\n }\n cout<<endl;\n if(c!=-1){\n for(int i=1;i<=c;i++){\n\tif(i<=flg[n]){\n\t cout<<' ';\n\t}else{\n\t cout<<'^';\n\t}\n }\n cout<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 42116,
"score_of_the_acc": -1.1094,
"final_rank": 17
},
{
"submission_id": "aoj_0113_897003",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n int p, q;\n while(cin >> p >> q) {\n bool num[1000000] = {}; num[p] = 1;\n int pos[1000000] = {}; pos[p] = -1;\n bool loop = 0;\n int cnt = 0;\n string t;\n while(1) {\n p *= 10;\n t += (char)(p/q + '0');\n p %= q;\n if(num[p] == 1) {\n\tloop = 1;\n\tbreak;\n }\n num[p] = 1;\n if(p == 0) break;\n pos[p] = cnt++;\n }\n \n cout << t << endl;\n \n if(loop) {\n int I;\n for(I=0; I<=pos[p]; I++) {\n\tcout << ' ';\n }\n for(I; I<t.size(); I++) {\n\tcout << '^';\n }\n cout << endl;\n }\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 6088,
"score_of_the_acc": -0.2227,
"final_rank": 12
},
{
"submission_id": "aoj_0113_884698",
"code_snippet": "#include <stdio.h>\n#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <fstream>\n#include <sstream>\n#include <math.h>\n#include <queue>\n#include <stack>\n\nusing namespace std;\n\n\nint main(){\n int p,q;\n while(cin>>p>>q){\n \n \n bool amari[1000000]={0};\n \n string s;\n\n bool flag = false;\n \n queue<int> qu;\n while(1){\n p=p%q*10;\n if(p==0)break;\n //cout<<p<<endl;\n if(amari[p/10]){\n flag=true;\n break;\n }\n amari[p/10]=true;\n qu.push(p/10);\n \n s+=p/q+'0';\n }\n cout<<s<<endl;\n if(flag){\n flag=true;\n while(!qu.empty()){\n if(qu.front()==p/10)flag=false;\n if(flag)cout<<\" \";\n else cout<<\"^\";\n qu.pop();\n }\n cout<<endl;\n }\n }\n \n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2184,
"score_of_the_acc": -0.0519,
"final_rank": 3
},
{
"submission_id": "aoj_0113_576467",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\nint md[1111111];\nint main(void){\n int p,q;\n while(cin >> p >> q){\n memset(md,-1,sizeof(md));\n int n,m=-1;\n for(n = 0; p%q; n++){\n if(md[p%q]!=-1){\n\tm = md[p%q];\n\tbreak;\n }\n else md[p%q] = n;\n p = (p%q) * 10;\n cout << p/q;\n }\n cout << endl;\n if(m != -1){\n for(int i = 0; i < n; i++){\n\tcout << (i<m?' ':'^');\n }\n cout << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 5508,
"score_of_the_acc": -0.2089,
"final_rank": 11
},
{
"submission_id": "aoj_0113_370575",
"code_snippet": "#include<stdio.h>\nint last[1000000];\nint main(){\n\tint a,b;\n\twhile(~scanf(\"%d%d\",&a,&b)){\n\t\tfor(int i=0;i<b;i++)last[i]=-1;\n\t\tint now=a;\n\t\tlast[now]=0;\n\t\tint at=0;\n\t\twhile(1){\n\t\t\tnow*=10;\n\t\t\tprintf(\"%d\",now/b);\n\t\t\tif(~last[now%b]){\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\tfor(int i=0;i<last[now%b];i++)printf(\" \");\n\t\t\t\tfor(int i=last[now%b];i<=at;i++)printf(\"^\");\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnow%=b;\n\t\t\tlast[now]=++at;\n\t\t\tif(now==0){\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -0.0156,
"final_rank": 1
}
] |
aoj_0111_cpp
|
博士の暗号
博 士 : ?D-C'KOPUA
ピーター : どうしたんですか、デビッド博士? わけのわからないことを叫ぶのにはもう慣れましたが、
今日は文章にすらなっていませんよ。
博 士 : ほれ。
ピーター : なんですか? この表は......ああ、予選の問題にこんなのがありました。表を使って文字を置き換え
ると文字数が減るんですよね。まさか予選と本選で同じ問題を出して手を抜こうって気じゃないでし
ょうね。
博 士 : 逆じゃよ。
ピーター : 逆? なるほど、今度は短くした文字列を元に戻そうって問題ですか。ということは「?D-C'KOPUA」の
文字を、この表を使って「文字」から「符号」に置きかえるんですね......できましたよ。
11111 00011 11101 00010 11110 01010 01110 01111 10100 00000
博 士 : うむ。次はこれじゃ。
ピーター : そうそう、こんな表もありましたね。これを逆に使うんだから「符号」から「文字」に置き換えればいい
んですね。でも、最初は「11111」ですが表にありませんよ?
博 士 : そういうときは、もっと短くするか、後ろとつなげるかしてみるのだよ。
ピ ー タ ー : じゃあ短くして......あ、 「111」ならあります。じゃあ最初は「P」ですね。そうすると残りは「11」ですが、
これはぴったり合うのがないから次の「00011」から 1 文字借りて「110」にすればいいんですね。
博 士 : そうそう。つまり「E」だね。
ピ ー タ ー : それで残るのが「0011」なので、これも次から借りて「00111」にして「T」と......。全部できました。最
後の「0000」は捨てちゃえばいいんですよね?
博 士 : そうじゃ、よろしい。次はこれじゃ。
?D-C'?-C'-LMGZN?FNJKN- WEYN?P'QMRWLPZLKKTPOVRGDI
博 士 : さらにこれじゃ。
?P'QNPY?IXX?IXXK.BI -G?R'RPP'RPOVWDMW?SWUVG'-LCMGQ
博 士 : 仕上げにこうじゃ。
?P'QMDUEQ GADKOQ ?SWUVG'-LCMG?X?IGX,PUL.?UL.VNQQI
ピ ー タ ー : しっかし面倒だなあ。博士、今度は自分でプログラムを作って下さいよ。
ということで、博士のかわりに、上の文章を置き換えるプログラムを作成してください。
Input
複数のデータセットが与えられます。各データセットとして、１つの文字列（表に含まれる文字からなる 200 文字以下の文字列）が１行に与えられます。入力の終わりまで処理してください。データセットの数は 200 を超えません。
Output
各データセットごとに、変換後の文字列を１行に出力してください。
Sample Input
?D-C'KOPUA
Output for the Sample Input
PETER POTTER
|
[
{
"submission_id": "aoj_0111_6873452",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(void){\n for(string s;getline(cin,s);){\n string st;\n for(ll i=0;i<s.size();i++){\n string str=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?\";\n ll num=str.find(s[i]);\n for(ll j=4;j>=0;j--){\n st+=!!(num&1<<j)+'0';\n }\n }\n string t;\n for(ll i=0;i<st.size();i++){\n t+=st[i];\n string v[]={\"101\",\"000000\",\"000011\",\"10010001\",\"010001\",\"000001\",\"100101\",\"10011010\",\"0101\",\"0001\",\"110\",\"01001\",\"10011011\",\"010000\",\"0111\",\"10011000\",\"0110\",\"00100\",\"10011001\",\"10011110\",\"00101\",\"111\",\"10011111\",\"1000\",\"00110\",\"00111\",\"10011100\",\"10011101\",\"000010\",\"10010010\",\"10010011\",\"10010000\"};\n const char *c=\" ',-.?ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n ll num=find(v,v+32,t)-v;\n if(num!=32){\n cout<<c[num];\n t.clear();\n }\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3128,
"score_of_the_acc": -0.966,
"final_rank": 17
},
{
"submission_id": "aoj_0111_4429897",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n map<char, string> m;\n map<string, char> minv;\n m[' '] = \"101\";\n m['\\''] = \"000000\";\n m[','] = \"000011\";\n m['-'] = \"10010001\";\n m['.'] = \"010001\";\n m['?'] = \"000001\";\n m['A'] = \"100101\";\n m['B'] = \"10011010\";\n m['C'] = \"0101\";\n m['D'] = \"0001\";\n m['E'] = \"110\";\n m['F'] = \"01001\";\n m['G'] = \"10011011\";\n m['H'] = \"010000\";\n m['I'] = \"0111\";\n m['J'] = \"10011000\";\n m['K'] = \"0110\";\n m['L'] = \"00100\";\n m['M'] = \"10011001\";\n m['N'] = \"10011110\";\n m['O'] = \"00101\";\n m['P'] = \"111\";\n m['Q'] = \"10011111\";\n m['R'] = \"1000\";\n m['S'] = \"00110\";\n m['T'] = \"00111\";\n m['U'] = \"10011100\";\n m['V'] = \"10011101\";\n m['W'] = \"000010\";\n m['X'] = \"10010010\";\n m['Y'] = \"10010011\";\n m['Z'] = \"10010000\";\n minv[\"00000\"] = 'A';\n minv[\"00001\"] = 'B';\n minv[\"00010\"] = 'C';\n minv[\"00011\"] = 'D';\n minv[\"00100\"] = 'E';\n minv[\"00101\"] = 'F';\n minv[\"00110\"] = 'G';\n minv[\"00111\"] = 'H';\n minv[\"01000\"] = 'I';\n minv[\"01001\"] = 'J';\n minv[\"01010\"] = 'K';\n minv[\"01011\"] = 'L';\n minv[\"01100\"] = 'M';\n minv[\"01101\"] = 'N';\n minv[\"01110\"] = 'O';\n minv[\"01111\"] = 'P';\n minv[\"10000\"] = 'Q';\n minv[\"10001\"] = 'R';\n minv[\"10010\"] = 'S';\n minv[\"10011\"] = 'T';\n minv[\"10100\"] = 'U';\n minv[\"10101\"] = 'V';\n minv[\"10110\"] = 'W';\n minv[\"10111\"] = 'X';\n minv[\"11000\"] = 'Y';\n minv[\"11001\"] = 'Z';\n minv[\"11010\"] = ' ';\n minv[\"11011\"] = '.';\n minv[\"11100\"] = ',';\n minv[\"11101\"] = '-';\n minv[\"11110\"] = '\\'';\n minv[\"11111\"] = '?';\n string s;\n while(getline(cin, s)){\n string t;\n for (auto &&i : s) {\n for (auto &&j : minv) {\n if(j.second == i) t += j.first;\n }\n }\n string ans; int cur = 0;\n while(true){\n int ok = 0;\n for (auto &&i : m) {\n if(t.substr(cur, i.second.size()) == i.second){\n ans += i.first;\n ok = 1;\n cur += i.second.size();\n break;\n }\n }\n if(!ok) break;\n }\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3196,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_0111_2541989",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for( int i = 0; i < n; i++ )\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define INF 2000000000\n#define mod 1000000007\n#define INF2 1000000000000000000\n\nstringstream ans;\nstringstream tmp;\nint len;\nint i;\nvoid search_code (string S, char a) {\n if (tmp.str() == S) {\n ans << a;\n len = 0;\n tmp.str(\"\");\n tmp.clear(stringstream::goodbit);\n }\n}\n\nvoid input_code (char a) {\n //dump(i);\n tmp << a;\n i++;\n len++;\n}\n\nint main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n string S;\n while(getline(cin, S)){\n tmp.str(\"\");\n tmp.clear(stringstream::goodbit);\n ans.str(\"\");\n ans.clear(stringstream::goodbit);\n i = 0;\n len = 0;\n\n // ??\\???????????????????????°??????\n stringstream str;\n string Cstr;\n while (S[i] != '\\0') {\n int tmp;\n if (S[i] >= 'A' && S[i] <= 'Z') tmp = S[i] - 'A';\n else if (S[i] == ' ') tmp = 26;\n else if (S[i] == '.') tmp = 27;\n else if (S[i] == ',') tmp = 28;\n else if (S[i] == '-') tmp = 29;\n else if (S[i] == '\\'') tmp = 30;\n else if (S[i] == '?') tmp = 31;\n str << static_cast<bitset<5> >(tmp);\n i++;\n }\n Cstr = str.str();\n //dump(Cstr);\n\n i = 0;\n while (i < Cstr.length()) {\n //dump(ans.str());\n //dump(tmp.str());\n while (len < 3) {\n input_code(Cstr[i]);\n }\n //dump(tmp.str());\n //len == 3;\n search_code(\"101\", ' ');\n search_code(\"110\", 'E');\n search_code(\"111\", 'P');\n if ((tmp.str()).length() != 0) input_code(Cstr[i]);\n else continue;\n\n //dump(tmp.str());\n //len == 4;\n search_code(\"0101\", 'C');\n search_code(\"0001\", 'D');\n search_code(\"0111\", 'I');\n search_code(\"0110\", 'K');\n search_code(\"1000\", 'R');\n\n if ((tmp.str()).length() != 0) input_code(Cstr[i]);\n else continue;\n\n //dump(tmp.str());\n //len == 5;\n search_code(\"01001\", 'F');\n search_code(\"00100\", 'L');\n search_code(\"00101\", 'O');\n search_code(\"00110\", 'S');\n search_code(\"00111\", 'T');\n\n if ((tmp.str()).length() != 0) input_code(Cstr[i]);\n else continue;\n\n //dump(tmp.str());\n //len == 6;\n search_code(\"000000\", '\\'');\n search_code(\"000011\", ',');\n search_code(\"010001\", '.');\n search_code(\"000001\", '?');\n search_code(\"010000\", 'H');\n search_code(\"000010\", 'W');\n search_code(\"100101\", 'A');\n\n if ((tmp.str()).length() != 0) {\n input_code(Cstr[i]);\n input_code(Cstr[i]);\n }\n else continue;\n\n //dump(tmp.str());\n //len == 8;\n search_code(\"10010001\", '-');\n search_code(\"10011010\", 'B');\n search_code(\"10011011\", 'G');\n search_code(\"10011000\", 'J');\n search_code(\"10011001\", 'M');\n search_code(\"10011110\", 'N');\n search_code(\"10011111\", 'Q');\n search_code(\"10011100\", 'U');\n search_code(\"10011101\", 'V');\n search_code(\"10010010\", 'X');\n search_code(\"10010011\", 'Y');\n search_code(\"10010000\", 'Z');\n\n if ((tmp.str()).length() != 0) input_code(Cstr[i]);\n else continue;\n }\n\n //cout << tmp.str() << endl;\n cout << ans.str() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3104,
"score_of_the_acc": -0.954,
"final_rank": 16
},
{
"submission_id": "aoj_0111_2102045",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\nstring e = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?\";\nvector<string> s1 = {\n\t\"100101\", \"10011010\", \"0101\", \"0001\", \"110\",\n\t\"01001\", \"10011011\", \"010000\", \"0111\", \"10011000\",\n\t\"0110\", \"00100\", \"10011001\", \"10011110\", \"00101\",\n\t\"111\", \"10011111\", \"1000\", \"00110\", \"00111\",\n\t\"10011100\", \"10011101\", \"000010\", \"10010010\", \"10010011\",\n\t\"10010000\", \"101\", \"010001\", \"000011\", \"10010001\",\n\t\"000000\", \"000001\"\n};\nvector<string> s2 = {\n\t\"00000\", \"00001\", \"00010\", \"00011\", \"00100\", \"00101\", \"00110\", \"00111\", \"01000\", \"01001\",\n\t\"01010\", \"01011\", \"01100\", \"01101\", \"01110\", \"01111\", \"10000\", \"10001\", \"10010\", \"10011\",\n\t\"10100\", \"10101\", \"10110\", \"10111\", \"11000\", \"11001\", \"11010\", \"11011\", \"11100\", \"11101\",\n\t\"11110\", \"11111\"\n};\nstring s;\nint main() {\n\twhile (s = \"\", getline(cin, s)) {\n\t\tstring t;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tfor (int j = 0; j < e.size(); j++) {\n\t\t\t\tif (s[i] == e[j]) t += s2[j];\n\t\t\t}\n\t\t}\n\t\tstring ret = \"\";\n\t\tfor (int i = 0; i < t.size();) {\n\t\t\tbool flag = false;\n\t\t\tfor (int j = 0; j < e.size(); j++) {\n\t\t\t\tif (t.substr(i, s1[j].size()) == s1[j]) {\n\t\t\t\t\tret += e[j]; i += s1[j].size(); flag = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!flag) break;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3136,
"score_of_the_acc": -0.97,
"final_rank": 18
},
{
"submission_id": "aoj_0111_1982881",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <list>\n#include <algorithm>\n#include <cmath>\n#include <stack>\n#include <map>\n#include <numeric>\n#include <sstream>\n#include <queue>\n#include <iomanip>\nusing namespace std;\n\n#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)\n#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)\n#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}\n#define ALL(v) v.begin(), v.end()\n#define print(s) cout << (s) << endl\n\n#define eadd(a,b) encode[(b)] = (a)\n#define dadd(a,b) decode[(b)] = (a)\n\nmap<string, char> encode;\nmap<char, string> decode;\n\nvoid solve111(string s) {\n string t = \"\";\n REP(i,s.size()) {\n t += decode[s[i]];\n }\n string ans = \"\";\n while (t.size()) {\n string c = \"\";\n c += t[0];\n c += t[1];\n c += t[2];\n int i = 3;\n while (encode.find(c) == encode.end()) {\n if (i >= t.size()) {\n c = \"end\";\n t = \"\";\n break;\n }\n c += t[i++];\n }\n if (c != \"end\") {\n ans += encode[c];\n REP(j,i) {\n t.erase(t.begin());\n }\n }\n }\n cout << ans << endl;\n}\n\nint main() {\n eadd(' ',\"101\");\n eadd('\\'',\"000000\");\n eadd(',',\"000011\");\n eadd('-',\"10010001\");\n eadd('.',\"010001\");\n eadd('?',\"000001\");\n eadd('A',\"100101\");\n eadd('B',\"10011010\");\n eadd('C',\"0101\");\n eadd('D',\"0001\");\n eadd('E',\"110\");\n eadd('F',\"01001\");\n eadd('G',\"10011011\");\n eadd('H',\"010000\");\n eadd('I',\"0111\");\n eadd('J',\"10011000\");\n eadd('K',\"0110\");\n eadd('L',\"00100\");\n eadd('M',\"10011001\");\n eadd('N',\"10011110\");\n eadd('O',\"00101\");\n eadd('P',\"111\");\n eadd('Q',\"10011111\");\n eadd('R',\"1000\");\n eadd('S',\"00110\");\n eadd('T',\"00111\");\n eadd('U',\"10011100\");\n eadd('V',\"10011101\");\n eadd('W',\"000010\");\n eadd('X',\"10010010\");\n eadd('Y',\"10010011\");\n eadd('Z',\"10010000\");\n \n dadd(\"00000\",'A');\n dadd(\"00001\",'B');\n dadd(\"00010\",'C');\n dadd(\"00011\",'D');\n dadd(\"00100\",'E');\n dadd(\"00101\",'F');\n dadd(\"00110\",'G');\n dadd(\"00111\",'H');\n dadd(\"01000\",'I');\n dadd(\"01001\",'J');\n dadd(\"01010\",'K');\n dadd(\"01011\",'L');\n dadd(\"01100\",'M');\n dadd(\"01101\",'N');\n dadd(\"01110\",'O');\n dadd(\"01111\",'P');\n dadd(\"10000\",'Q');\n dadd(\"10001\",'R');\n dadd(\"10010\",'S');\n dadd(\"10011\",'T');\n dadd(\"10100\",'U');\n dadd(\"10101\",'V');\n dadd(\"10110\",'W');\n dadd(\"10111\",'X');\n dadd(\"11000\",'Y');\n dadd(\"11001\",'Z');\n dadd(\"11010\",' ');\n dadd(\"11011\",'.');\n dadd(\"11100\",',');\n dadd(\"11101\",'-');\n dadd(\"11110\",'\\'');\n dadd(\"11111\",'?');\n \n string s;\n while (getline(cin,s)) {\n solve111(s);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -0.012,
"final_rank": 8
},
{
"submission_id": "aoj_0111_1975170",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cassert>\n#include <vector>\n#include <string>\n#include <cmath>\n#include <map> \n#include <sstream>\n#include <cstdio>\n#include <complex>\n#include <cstring>\nusing namespace std;\n \nconst int MAX= 10000100;\n\n#define loop(i,a,b) for(int i = a ; i < b ; i ++)\n#define rep(i,a) loop(i,0,a)\n#define all(a) (a).begin(),(a).end()\n#define ll long long int\n#define gcd(a,b) __gcd(a,b)\n#define pb(a) push_back(a)\nint GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}\nint lcm(int a, int b) {return a*b / gcd(a, b);}\n\nmap<char,string> cs;\nmap<string,char> sc;\n\nvoid add(){\n \n cs[' '] = \"11010\";\n cs['\\''] = \"11110\";\n cs[','] = \"11100\";\n cs['-'] = \"11101\";\n cs['.'] = \"11011\";\n cs['?'] = \"11111\";\n cs['A'] = \"00000\";\n cs['B'] = \"00001\";\n cs['C'] = \"00010\";\n cs['D'] = \"00011\";\n cs['E'] = \"00100\";\n cs['F'] = \"00101\";\n cs['G'] = \"00110\";\n cs['H'] = \"00111\";\n cs['I'] = \"01000\";\n cs['J'] = \"01001\";\n cs['K'] = \"01010\";\n cs['L'] = \"01011\";\n cs['M'] = \"01100\";\n cs['N'] = \"01101\";\n cs['O'] = \"01110\";\n cs['P'] = \"01111\";\n cs['Q'] = \"10000\";\n cs['R'] = \"10001\";\n cs['S'] = \"10010\";\n cs['T'] = \"10011\";\n cs['U'] = \"10100\";\n cs['V'] = \"10101\";\n cs['W'] = \"10110\";\n cs['X'] = \"10111\";\n cs['Y'] = \"11000\";\n cs['Z'] = \"11001\";\n \n sc[\"100101\"] = 'A';\n sc[\"10011010\"] = 'B';\n sc[\"0101\"] = 'C';\n sc[\"0001\"] = 'D';\n sc[\"110\"] = 'E';\n sc[\"01001\"] = 'F';\n sc[\"10011011\"] = 'G';\n sc[\"010000\"] = 'H';\n sc[\"0111\"] = 'I';\n sc[\"10011000\"] = 'J';\n sc[\"0110\"] = 'K';\n sc[\"00100\"] = 'L';\n sc[\"10011001\"] = 'M';\n sc[\"10011110\"] = 'N';\n sc[\"00101\"] = 'O';\n sc[\"111\"] = 'P';\n sc[\"10011111\"] = 'Q';\n sc[\"1000\"] = 'R';\n sc[\"00110\"] = 'S';\n sc[\"00111\"] = 'T';\n sc[\"10011100\"] = 'U';\n sc[\"10011101\"] = 'V';\n sc[\"000010\"] = 'W';\n sc[\"10010010\"] = 'X';\n sc[\"10010011\"] = 'Y';\n sc[\"10010000\"] = 'Z';\n sc[\"101\"] = ' ';\n sc[\"010001\"] = '.';\n sc[\"000011\"] = ',';\n sc[\"10010001\"] = '-';\n sc[\"000000\"] = '\\'';\n sc[\"000001\"] = '?';\n}\n\nint main(void){\n add();\n string s;\n while(getline(cin,s)){\n string bit;\n rep(i,s.size()){\n bit += cs[s[i]];\n }\n //cout<<bit<<endl;\n\n int st = 0;\n string ret = \"\";\n rep(i,bit.size()){\n //cout<<ret<<endl;\n if(sc[bit.substr(st,i-st+1)]){\n\tret += sc[bit.substr(st,i-st+1)];\n\tst = i + 1;\n }\n }\n cout<<ret<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -0.01,
"final_rank": 7
},
{
"submission_id": "aoj_0111_1949351",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n\nmap<char, int> m1;\nstring parse;\n\nstring make2(char c) {\n\tstring res;\n\tint x = m1[c];\n\n\tREP(i, 5) {\n\t\tres.push_back((x & 1) + '0');\n\t\tx >>= 1;\n\t}\n\treverse(res.begin(), res.end());\n\treturn res;\n}\n\nint main() {\n\tparse = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-\\'?\";\n\tREP(i, parse.size()) m1[parse[i]] = i;\n\t\n\tstring sec[32] = {\n\t\t\"100101\",\"10011010\",\"0101\",\"0001\",\"110\",\"01001\",\"10011011\",\"010000\",\n\t\t\"0111\",\"10011000\",\"0110\",\"00100\",\"10011001\",\"10011110\",\"00101\",\"111\",\n\t\t\"10011111\",\"1000\",\"00110\",\"00111\",\"10011100\",\"10011101\",\"000010\",\"10010010\",\n\t\t\"10010011\",\"10010000\",\"101\",\"010001\",\"000011\",\"10010001\",\"000000\",\"000001\"\t\n\t};\n\tmap<string, int> m2;\n\tREP(i, 32) m2[sec[i]] = i;\n\t\n\tstring str;\n\twhile (getline(cin, str)) {\n\t\tstring tmp;\n\t\tREP(i, str.size()) tmp += make2(str[i]);\n\t\t\n\t\tstring ans;\n\t\tint pos = 0;\n\t\tREP(i, tmp.size()) {\n\t\t\tstring s;\n\t\t\tFOR(j, i, tmp.size()) {\n\t\t\t\ts += tmp[j];\n\t\t\t\ti = j;\n\t\t\t\tif (m2.find(s) != m2.end()) {\n\t\t\t\t\tans.push_back(parse[m2[s]]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tpos += i;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0111_1892186",
"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\nmap<char, string> enc;\nmap<string, char> word;\n\nvoid inputData(){\n enc['A'] = \"00000\";\n enc['B'] = \"00001\";\n enc['C'] = \"00010\";\n enc['D'] = \"00011\";\n enc['E'] = \"00100\";\n enc['F'] = \"00101\";\n enc['G'] = \"00110\";\n enc['H'] = \"00111\";\n enc['I'] = \"01000\";\n enc['J'] = \"01001\";\n enc['K'] = \"01010\";\n enc['L'] = \"01011\";\n enc['M'] = \"01100\";\n enc['N'] = \"01101\";\n enc['O'] = \"01110\";\n enc['P'] = \"01111\";\n enc['Q'] = \"10000\";\n enc['R'] = \"10001\";\n enc['S'] = \"10010\";\n enc['T'] = \"10011\";\n enc['U'] = \"10100\";\n enc['V'] = \"10101\";\n enc['W'] = \"10110\";\n enc['X'] = \"10111\";\n enc['Y'] = \"11000\";\n enc['Z'] = \"11001\";\n enc[' '] = \"11010\";\n enc['.'] = \"11011\";\n enc[','] = \"11100\";\n enc['-'] = \"11101\";\n enc['\\''] = \"11110\";\n enc['?'] = \"11111\";\n word[\"101\"] = ' ';\n word[\"000000\"] = '\\'';\n word[\"000011\"] = ',';\n word[\"10010001\"] = '-';\n word[\"010001\"] = '.';\n word[\"000001\"] = '?';\n word[\"100101\"] = 'A';\n word[\"10011010\"] = 'B';\n word[\"0101\"] = 'C';\n word[\"0001\"] = 'D';\n word[\"110\"] = 'E';\n word[\"01001\"] = 'F';\n word[\"10011011\"] = 'G';\n word[\"010000\"] = 'H';\n word[\"0111\"] = 'I';\n word[\"10011000\"] = 'J';\n word[\"0110\"] = 'K';\n word[\"00100\"] = 'L';\n word[\"10011001\"] = 'M';\n word[\"10011110\"] = 'N';\n word[\"00101\"] = 'O';\n word[\"111\"] = 'P';\n word[\"10011111\"] = 'Q';\n word[\"1000\"] = 'R';\n word[\"00110\"] = 'S';\n word[\"00111\"] = 'T';\n word[\"10011100\"] = 'U';\n word[\"10011101\"] = 'V';\n word[\"000010\"] = 'W';\n word[\"10010010\"] = 'X';\n word[\"10010011\"] = 'Y';\n word[\"10010000\"] = 'Z';\n}\n\nstring changeWord(string s){\n string sentence,a;\n rep(i,s.size()){\n a+=s[i];\n if((word[a] >= 'A'&& word[a] <= 'Z') || word[a] == ' ' || word[a] == '\\'' || word[a] == ',' || word[a] == '-' || word[a] == '.' || word[a] == '?'){\n sentence+=word[a];\n a = \"\";\n }\n }\n return sentence;\n}\n\nstring changeCode(string s){\n string code;\n rep(i,s.size()){\n code+=enc[s[i]];\n }\n return code;\n}\n\nint main(){\n inputData();\n string s;\n while(getline(cin,s)){\n cout << changeWord(changeCode(s)) << endl;;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1220,
"score_of_the_acc": -0.6787,
"final_rank": 15
},
{
"submission_id": "aoj_0111_1814723",
"code_snippet": "# define _CRT_SECURE_NO_WARNINGS 1\n# include <iostream>\n# include <string>\n# include <bitset>\n# include <vector>\n# include <algorithm>\n# include <cstdlib>\n# include <cstdio>\n# include <cstring>\n# include <cstdlib>\n# include <iomanip>\n# include <queue>\n# include <sstream>\n# include <climits>\n# include <cmath>\n# include <list>\n# include <functional>\n# include <string>\n# include <set>\n# include <map>\n# include <stack>\nusing namespace std;\n# define M_PI 3.141592\n# define FOR(i,n) for(int i=0;i<(int)n;i++)\n# define FORI(i,k,n) for(int i=k;i<(int)n;i++)\n# define toRad 2.0*M_PI/360.0\n# define inin(x) int x;cin>>x;\n# define all(x) x.begin(),x.end()\n# define debug(x) cout<<#x<<\" :\"<<x<<endl;\n# define rep(i,n) for(int i=0;i<(int)n;i++)\n# define EPS 1e-12\n# define pri_max 60000\n# define CHECK(i,a) FOR(i,a.size())cout<<#a<<\"[\"<<i<<\"] : \"<<a[i]<<endl; \ntypedef pair<int, int> pii;\ntypedef pair<double, double> pdd;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\n\n\nint main()\n{\n\tmap<char, string> enc;\n\tmap<string, char> dec;\n\tfor (char i = 'A'; i <= 'Z'; i++)\n\t{\n\t\tstringstream ss;\n\t\tbitset < 5 > b(i-'A');\n\t\tss << b;\n\t\tenc.insert(make_pair(i, ss.str()));\n\t}\n\tenc[' '] = \"11010\";\n\tenc['.'] = \"11011\";\n\tenc[','] = \"11100\";\n\tenc['-'] = \"11101\";\n\tenc['\\''] = \"11110\";\n\tenc['?'] = \"11111\";\n\n\tdec[\"101\"] = ' ';\n\tdec[\"000000\"] = '\\'';\n\tdec[\"000011\"] = ',';\n\tdec[\"10010001\"] = '-';\n\tdec[\"010001\"] = '.';\n\tdec[\"000001\"] = '?';\n\tdec[\"100101\"] = 'A';\n\tdec[\"10011010\"] = 'B';\n\tdec[\"0101\"] = 'C';\n\tdec[\"0001\"] = 'D';\n\tdec[\"110\"] = 'E';\n\tdec[\"01001\"] = 'F';\n\tdec[\"10011011\"] = 'G';\n\tdec[\"010000\"] = 'H';\n\tdec[\"0111\"] = 'I';\n\tdec[\"10011000\"] = 'J';\n\tdec[\"0110\"] = 'K';\n\tdec[\"00100\"] = 'L';\n\tdec[\"10011001\"] = 'M';\n\tdec[\"10011110\"] = 'N';\n\tdec[\"00101\"] = 'O';\n\tdec[\"111\"] = 'P';\n\tdec[\"10011111\"] = 'Q';\n\tdec[\"1000\"] = 'R';\n\tdec[\"00110\"] = 'S';\n\tdec[\"00111\"] = 'T';\n\tdec[\"10011100\"] = 'U';\n\tdec[\"10011101\"] = 'V';\n\tdec[\"000010\"] = 'W';\n\tdec[\"10010010\"] = 'X';\n\tdec[\"10010011\"] = 'Y';\n\tdec[\"10010000\"] = 'Z';\n\n\tstring s;\n\twhile (getline(cin,s))\n\t{\n\t\tstring x, y, z;\n\t\tfor (int i = 0; i < s.size(); i++)x += enc[s[i]];\n\n\t\tfor (int i = 0; i < x.size(); i++)\n\t\t{\n\t\t\ty += x[i];\n\t\t\tif (dec.count(y))\n\t\t\t{\n\t\t\t\tz += dec[y];\n\t\t\t\ty = \"\";\n\t\t\t}\n\t\t}\n\t\tcout << z << endl;\n\n\t}\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1224,
"score_of_the_acc": -0.014,
"final_rank": 11
},
{
"submission_id": "aoj_0111_1781649",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\n\nmap<string,string> board;\nmap<string,string> word;\n\nvoid config(){\n string w = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?\";\n string s = \"00000\";\n string h[] = {\"100101\",\"10011010\",\"0101\",\"0001\",\"110\",\"01001\",\"10011011\",\n\t\t\"010000\",\"0111\",\"10011000\",\"0110\",\"00100\",\"10011001\",\n\t\t\"10011110\",\"00101\",\"111\",\"10011111\",\"1000\",\n\t\t\"00110\",\"00111\",\"10011100\",\"10011101\",\n\t\t\"000010\",\"10010010\",\"10010011\",\"10010000\",\n\t\t\"101\",\"010001\",\"000011\",\"10010001\",\"000000\",\"000001\"};\n for(int i=0;i<w.size();i++){\n string tmp = \"\";\n tmp += w[i];\n board[tmp] = s;\n word[h[i]] = w[i];\n /*\n cout << tmp << \" \" << s << endl;\n cout << h[i] << \" \" << w[i] << endl << endl;\n */\n if(s[4] == '0') s[4] = '1';\n else {\n for(int j=4;j>=0;j--){\n\tif(s[j] == '0'){\n\t s[j] = '1';\n\t break;\n\t}\n\telse s[j] = '0';\n }\n }\n }\n}\n\nint main(){\n config();\n string str;\n while(getline(cin,str)){\n string next = \"\";\n for(int i=0;i<str.size();i++){\n string tmp = \"\";\n tmp += str[i];\n next += board[tmp];\n }\n string ans = \"\";\n string now = \"\";\n for(int i=0;i<next.size();i++){\n now += next[i];\n if(word[now] != word[\"AA\"]){\n\tans += word[now];\n\tnow = \"\";\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.006,
"final_rank": 3
},
{
"submission_id": "aoj_0111_1662923",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\n\nchar A1[33] = \" ',-.?ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nchar B1[33] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?\";\n\nstring A2[32] = {\n\t\"101\",\n\t\"000000\",\n\t\"000011\",\n\t\"10010001\",\n\t\"010001\",\n\t\"000001\",\n\t\"100101\",\n\t\"10011010\",\n\t\"0101\",\n\t\"0001\",\n\t\"110\",\n\t\"01001\",\n\t\"10011011\",\n\t\"010000\",\n\t\"0111\",\n\t\"10011000\",\n\t\"0110\",\n\t\"00100\",\n\t\"10011001\",\n\t\"10011110\",\n\t\"00101\",\n\t\"111\",\n\t\"10011111\",\n\t\"1000\",\n\t\"00110\",\n\t\"00111\",\n\t\"10011100\",\n\t\"10011101\",\n\t\"000010\",\n\t\"10010010\",\n\t\"10010011\",\n\t\"10010000\"\n};\n\nstring B2[32] = {\n\t\"00000\",\n\t\"00001\",\n\t\"00010\",\n\t\"00011\",\n\t\"00100\",\n\t\"00101\",\n\t\"00110\",\n\t\"00111\",\n\t\"01000\",\n\t\"01001\",\n\t\"01010\",\n\t\"01011\",\n\t\"01100\",\n\t\"01101\",\n\t\"01110\",\n\t\"01111\",\n\t\"10000\",\n\t\"10001\",\n\t\"10010\",\n\t\"10011\",\n\t\"10100\",\n\t\"10101\",\n\t\"10110\",\n\t\"10111\",\n\t\"11000\",\n\t\"11001\",\n\t\"11010\",\n\t\"11011\",\n\t\"11100\",\n\t\"11101\",\n\t\"11110\",\n\t\"11111\"\n};\n\nstring U;\nstring V;\n\nint main() {\n\twhile (getline(cin, U)) {\n\t\tV = \"\";\n\t\tfor (int i = 0; i < U.size(); i++) {\n\t\t\tfor (int j = 0; j < 32; j++) {\n\t\t\t\tif (B1[j] == U[i]) {\n\t\t\t\t\tV += B2[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tU = \"\";\n\t\tint pass = 0;\n\t\twhile (pass < V.size()) {\n\t\t\tfor (int j = 0; j < 32; j++) {\n\t\t\t\tif (pass + A2[j].size() <= V.size()) {\n\t\t\t\t\tif (A2[j] == V.substr(pass, A2[j].size())) {\n\t\t\t\t\t\tU += A1[j];\n\t\t\t\t\t\tpass += A2[j].size();\n\t\t\t\t\t\tgoto I;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tI:;\n\t\t}\n\t\tcout << U << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1196,
"score_of_the_acc": -0.3333,
"final_rank": 13
},
{
"submission_id": "aoj_0111_1545755",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define repc(i,s,e) for(int i=(s); i<(e); i++)\n#define pb(n) push_back((n))\n#define mp(n,m) make_pair((n),(m))\n#define all(r) r.begin(),r.end()\n#define fi first\n#define se second\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vii;\ntypedef vector<ll> vl;\ntypedef vector<vl> vll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\n\n\n\nconst int INF = 1000000;\nconst int mod = 1e9 + 7;\n\n\nstring calc(int n){\n\tstring ret = \"\";\n\tfor(int i=0; i<5; i++){\n\t\tret += (char)('0' + n % 2);\n\t\tn /= 2;\n\t}\n\treverse(all(ret));\n\treturn ret;\n}\n\nint main(){\n\tmap<char,string> m;\n\trep(i,26) m[(char)('A' + i)] =calc(i);\n\tm[' '] = calc(26);\n\tm['.'] = calc(27);\n\tm[','] = calc(28);\n\tm['-'] = calc(29);\n\tm['\\''] = calc(30);\n\tm['?'] = calc(31);\n\tmap<string,char> mm;\n\tmm[\"101\"] = ' ';\n\tmm[\"000000\"] = '\\'';\n\tmm[\"000011\"] = ',';\n\tmm[\"10010001\"] = '-';\n\tmm[\"010001\"] = '.';\n\tmm[\"000001\"] = '?';\n\tmm[\"100101\"] = 'A';\n\tmm[\"10011010\"] = 'B';\n\tmm[\"0101\"] = 'C';\n\tmm[\"0001\"] = 'D';\n\tmm[\"110\"] = 'E';\n\tmm[\"01001\"] ='F';\n\tmm[\"10011011\"] = 'G';\n\tmm[\"010000\"] = 'H';\n\tmm[\"0111\"] = 'I';\n\tmm[\"10011000\"] = 'J';\n\tmm[\"0110\"] = 'K';\n\tmm[\"00100\"] = 'L';\n\tmm[\"10011001\"] = 'M';\n\tmm[\"10011110\"] = 'N';\n\tmm[\"00101\"] = 'O';\n\tmm[\"111\"] = 'P';\n\tmm[\"10011111\"] = 'Q';\n\tmm[\"1000\"] = 'R';\n\tmm[\"00110\"] = 'S';\n\tmm[\"00111\"] = 'T';\n\tmm[\"10011100\"] = 'U';\n\tmm[\"10011101\"] = 'V';\n\tmm[\"000010\"] = 'W';\n\tmm[\"10010010\"] = 'X';\n\tmm[\"10010011\"] = 'Y';\n\tmm[\"10010000\"] = 'Z';\n\tstring s;\n\twhile(getline(cin,s)){\n\t\tstring t =\"\";\n\t\tfor(int i=0; i<s.size(); i++){\n\t\t\tt+=m[s[i]];\n\t\t}\n\t\tstring ans = \"\";\n\t\tfor(int i=0; i<t.size(); i++){\n\t\t\tint j=i;\n\t\t\tstring str =\"\";\n\t\t\twhile(mm[str] == (char)0 && j<t.size()) str += t[j++];\n\t\t\t//cout<<mm[str]<<endl;\n\t\t\tif(mm[str] != 0) ans += mm[str];\n\t\t\ti=j-1;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.006,
"final_rank": 3
},
{
"submission_id": "aoj_0111_1543828",
"code_snippet": "#include <bits/stdc++.h>\n#define PB push_back\n#define MP make_pair\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define ALL(a) (a).begin(),(a).end()\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\nconst int INF=1e9;\nconst int MOD=100000;\nstring rec1(string in){\n\tstring res=\"\";\n\tmap<char,string> s;\n\ts['A']=\"00000\";\n\ts['B']=\"00001\";\n\ts['C']=\"00010\";\n\ts['D']=\"00011\";\n\ts['E']=\"00100\";\n\ts['F']=\"00101\";\n\ts['G']=\"00110\";\n\ts['H']=\"00111\";\n\ts['I']=\"01000\";\n\ts['J']=\"01001\";\n\ts['K']=\"01010\";\n\ts['L']=\"01011\";\n\ts['M']=\"01100\";\n\ts['N']=\"01101\";\n\ts['O']=\"01110\";\n\ts['P']=\"01111\";\n\ts['Q']=\"10000\";\n\ts['R']=\"10001\";\n\ts['S']=\"10010\";\n\ts['T']=\"10011\";\n\ts['U']=\"10100\";\n\ts['V']=\"10101\";\n\ts['W']=\"10110\";\n\ts['X']=\"10111\";\n\ts['Y']=\"11000\";\n\ts['Z']=\"11001\";\n\ts[' ']=\"11010\";\n\ts['.']=\"11011\";\n\ts[',']=\"11100\";\n\ts['-']=\"11101\";\n\ts['\\'']=\"11110\";\n\ts['?']=\"11111\";\n\tREP(i,in.size())res+=s[in[i]];\n\treturn res;\n}\nstring rec2(string in){\n\tstring res=\"\",t=\"\";\n\tmap<string,char>s;\n\ts[\"101\"]=' ';\n\ts[\"000000\"]='\\'';\n\ts[\"000011\"]=',';\n\ts[\"10010001\"]='-';\n\ts[\"010001\"]='.';\n\ts[\"000001\"]='?';\n\ts[\"100101\"]='A';\n\ts[\"10011010\"]='B';\n\ts[\"0101\"]='C';\n\ts[\"0001\"]='D';\n\ts[\"110\"]='E';\n\ts[\"01001\"]='F';\n\ts[\"10011011\"]='G';\n\ts[\"010000\"]='H';\n\ts[\"0111\"]='I';\n\ts[\"10011000\"]='J';\n\ts[\"0110\"]='K';\n\ts[\"00100\"]='L';\n\ts[\"10011001\"]='M';\n\ts[\"10011110\"]='N';\n\ts[\"00101\"]='O';\n\ts[\"111\"]='P';\n\ts[\"10011111\"]='Q';\n\ts[\"1000\"]='R';\n\ts[\"00110\"]='S';\n\ts[\"00111\"]='T';\n\ts[\"10011100\"]='U';\n\ts[\"10011101\"]='V';\n\ts[\"000010\"]='W';\n\ts[\"10010010\"]='X';\n\ts[\"10010011\"]='Y';\n\ts[\"10010000\"]='Z';\n\tREP(i,in.size()){\n\t\tt+=in[i];\n\t\tif(s.find(t)!=s.end()){\n\t\t\tres+=s[t];\n\t\t\tt=\"\";\n\t\t}\n\t}\n\treturn res;\n}\nint main(){\n\tstring in;\n\twhile(getline(cin,in)){\n\t\tin=rec1(in);\n\t\tcout<<rec2(in)<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -0.012,
"final_rank": 8
},
{
"submission_id": "aoj_0111_1465851",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cstring>\n#include<cmath>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\nusing namespace std;\n\nstring table1[32]={\"101\",\"000000\",\"000011\",\"10010001\",\"010001\",\"000001\",\"100101\",\"10011010\",\"0101\",\"0001\",\"110\",\"01001\",\"10011011\",\"010000\",\"0111\",\"10011000\",\"0110\",\"00100\",\"10011001\",\"10011110\",\"00101\",\"111\",\"10011111\",\"1000\",\"00110\",\"00111\",\"10011100\",\"10011101\",\"000010\",\"10010010\",\"10010011\",\"10010000\"};\nchar table2[6]={' ','\\'',',','-','.','?'};\n\nstring binary(int num){\n\tstring ans=\"\";\n\tfor(int i=4;i>=0;i--){\n\t\tans+=(char)(num/(int)pow(2,i)+'0');\n\t\tnum-=(num/(int)pow(2,i))*(int)pow(2,i);\n\t}\n\treturn ans;\n}\n\nstring change(char c){\n\tstring ans;\n\tif(isalpha(c)){\n\t\tint num=c-'A';\n\t\tans=binary(num);\n\t}else{\n\t\tif(c==' ')ans=binary(26);\n\t\telse if(c=='.')ans=binary(27);\n\t\telse if(c==',')ans=binary(28);\n\t\telse if(c=='-')ans=binary(29);\n\t\telse if(c=='\\'')ans=binary(30);\n\t\telse if(c=='?')ans=binary(31);\n\t}\n\tif(ans.size()<5)ans='0'+ans;\n\treturn ans;\n}\n\nstring rechange(string str){\n\tint size=str.size();\n\tstring pack=\"\",ans=\"\";\n\tint counta=0;\n\twhile(counta<size){\n\t\tpack+=str[counta];\n\t\tfor(int i=0;i<32;i++){\n\t\t\tif(pack==table1[i]){\n\t\t\t\tif(i<6){\n\t\t\t\t\tans+=table2[i];\n\t\t\t\t}else{\n\t\t\t\t\tans+=(char)(i-6+'A');\n\t\t\t\t}\n\t\t\t\tpack=\"\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcounta++;\n\t}\n\treturn ans;\n}\n\nint main(){\n\tstring s;\n\twhile(getline(cin,s)){\n\t\tint size=s.size();\n\t\tstring alt=\"\";\n\t\trep(i,size){\n\t\t\talt+=change(s[i]);\n\t\t}\n\t\tcout<<rechange(alt)<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1248,
"score_of_the_acc": -0.026,
"final_rank": 12
},
{
"submission_id": "aoj_0111_1423955",
"code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<vector>\n#include<cmath>\n#include<cstdio>\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 it ::iterator\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double ESP=1e-10;\nusing namespace std;\nint main(){\n map<char,string>in;\n in['A']=\"00000\";\n in['B']=\"00001\";\n in['C']=\"00010\";\n in['D']=\"00011\";\n in['E']=\"00100\";\n in['F']=\"00101\";\n in['G']=\"00110\";\n in['H']=\"00111\";\n in['I']=\"01000\";\n in['J']=\"01001\";\n in['K']=\"01010\";\n in['L']=\"01011\";\n in['M']=\"01100\";\n in['N']=\"01101\";\n in['O']=\"01110\";\n in['P']=\"01111\";\n in['Q']=\"10000\";\n in['R']=\"10001\";\n in['S']=\"10010\";\n in['T']=\"10011\";\n in['U']=\"10100\";\n in['V']=\"10101\";\n in['W']=\"10110\";\n in['X']=\"10111\";\n in['Y']=\"11000\";\n in['Z']=\"11001\";\n in[' ']=\"11010\";\n in['.']=\"11011\";\n in[',']=\"11100\";\n in['-']=\"11101\";\n in['\\'']=\"11110\";\n in['?']=\"11111\";\n map<string,char>out;\n out[\"101\"]=' ';\n out[\"000000\"]='\\'';\n out[\"000011\"]=',';\n out[\"10010001\"]='-';\n out[\"010001\"]='.';\n out[\"000001\"]='?';\n out[\"100101\"]='A';\n out[\"10011010\"]='B';\n out[\"0101\"]='C';\n out[\"0001\"]='D';\n out[\"110\"]='E';\n out[\"01001\"]='F';\n out[\"10011011\"]='G';\n out[\"010000\"]='H';\n out[\"0111\"]='I';\n out[\"10011000\"]='J';\n out[\"0110\"]='K';\n out[\"00100\"]='L';\n out[\"10011001\"]='M';\n out[\"10011110\"]='N';\n out[\"00101\"]='O';\n out[\"111\"]='P';\n out[\"10011111\"]='Q';\n out[\"1000\"]='R';\n out[\"00110\"]='S';\n out[\"00111\"]='T';\n out[\"10011100\"]='U';\n out[\"10011101\"]='V';\n out[\"000010\"]='W';\n out[\"10010010\"]='X';\n out[\"10010011\"]='Y';\n out[\"10010000\"]='Z';\n\n string s;\n while(getline(cin,s)){\n string a=\"\";\n rep(i,s.size())a+=in[s[i]];\n int to=0;\n string tmp=\"\";\n while(to<a.size()){\n tmp+=a[to];\n to++;\n if(out[tmp]){\n\tcout<<out[tmp];\n\ttmp=\"\";\n }\n }\n cout<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1204,
"score_of_the_acc": -0.004,
"final_rank": 2
},
{
"submission_id": "aoj_0111_1317119",
"code_snippet": "//Doctor's Memorable Codes\n#include<bits/stdc++.h>\nusing namespace std;\n\nstring into(string s){\n string ret=\"\";\n for(int i=0; i<s.length(); i++){\n if(s[i]=='A')ret+=\"00000\";\n if(s[i]=='B')ret+=\"00001\";\n if(s[i]=='C')ret+=\"00010\";\n if(s[i]=='D')ret+=\"00011\";\n if(s[i]=='E')ret+=\"00100\";\n if(s[i]=='F')ret+=\"00101\";\n if(s[i]=='G')ret+=\"00110\";\n if(s[i]=='H')ret+=\"00111\";\n if(s[i]=='I')ret+=\"01000\";\n if(s[i]=='J')ret+=\"01001\";\n if(s[i]=='K')ret+=\"01010\";\n if(s[i]=='L')ret+=\"01011\";\n if(s[i]=='M')ret+=\"01100\";\n if(s[i]=='N')ret+=\"01101\";\n if(s[i]=='O')ret+=\"01110\";\n if(s[i]=='P')ret+=\"01111\";\n if(s[i]=='Q')ret+=\"10000\";\n if(s[i]=='R')ret+=\"10001\";\n if(s[i]=='S')ret+=\"10010\";\n if(s[i]=='T')ret+=\"10011\";\n if(s[i]=='U')ret+=\"10100\";\n if(s[i]=='V')ret+=\"10101\";\n if(s[i]=='W')ret+=\"10110\";\n if(s[i]=='X')ret+=\"10111\";\n if(s[i]=='Y')ret+=\"11000\";\n if(s[i]=='Z')ret+=\"11001\";\n if(s[i]==' ')ret+=\"11010\";\n if(s[i]=='.')ret+=\"11011\";\n if(s[i]==',')ret+=\"11100\";\n if(s[i]=='-')ret+=\"11101\";\n if(s[i]=='\\'')ret+=\"11110\";\n if(s[i]=='?')ret+=\"11111\";\n }\n return ret;\n}\n\nstring solve(string t){\n string s=into(t);\n string ret=\"\";\n int l=0, r=0;\n for( ; r!=s.length(); r++){\n string tmp=s.substr(l, r-l+1);//文字列の切り出し\n if(tmp==\"101\"){ret+=\" \"; l=r+1;}\n if(tmp==\"000000\"){ret+=\"\\'\"; l=r+1;}\n if(tmp==\"000011\"){ret+=\",\"; l=r+1;}\n if(tmp==\"10010001\"){ret+=\"-\"; l=r+1;}\n if(tmp==\"010001\"){ret+=\".\"; l=r+1;}\n if(tmp==\"000001\"){ret+=\"?\"; l=r+1;}\n if(tmp==\"100101\"){ret+=\"A\"; l=r+1;}\n if(tmp==\"10011010\"){ret+=\"B\"; l=r+1;}\n if(tmp==\"0101\"){ret+=\"C\"; l=r+1;}\n if(tmp==\"0001\"){ret+=\"D\"; l=r+1;}\n if(tmp==\"110\"){ret+=\"E\"; l=r+1;}\n if(tmp==\"01001\"){ret+=\"F\"; l=r+1;}\n if(tmp==\"10011011\"){ret+=\"G\"; l=r+1;}\n if(tmp==\"010000\"){ret+=\"H\"; l=r+1;}\n if(tmp==\"0111\"){ret+=\"I\"; l=r+1;}\n if(tmp==\"10011000\"){ret+=\"J\"; l=r+1;}\n if(tmp==\"0110\"){ret+=\"K\"; l=r+1;}\n if(tmp==\"00100\"){ret+=\"L\"; l=r+1;}\n if(tmp==\"10011001\"){ret+=\"M\"; l=r+1;}\n if(tmp==\"10011110\"){ret+=\"N\"; l=r+1;}\n if(tmp==\"00101\"){ret+=\"O\"; l=r+1;}\n if(tmp==\"111\"){ret+=\"P\"; l=r+1;}\n if(tmp==\"10011111\"){ret+=\"Q\"; l=r+1;}\n if(tmp==\"1000\"){ret+=\"R\"; l=r+1;}\n if(tmp==\"00110\"){ret+=\"S\"; l=r+1;}\n if(tmp==\"00111\"){ret+=\"T\"; l=r+1;}\n if(tmp==\"10011100\"){ret+=\"U\"; l=r+1;}\n if(tmp==\"10011101\"){ret+=\"V\"; l=r+1;}\n if(tmp==\"000010\"){ret+=\"W\"; l=r+1;}\n if(tmp==\"10010010\"){ret+=\"X\"; l=r+1;}\n if(tmp==\"10010011\"){ret+=\"Y\"; l=r+1;}\n if(tmp==\"10010000\"){ret+=\"Z\"; l=r+1;}\n }\n return ret;\n}\n\nint main(){\n string s;\n while(getline(cin, s))cout<<solve(s)<<endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1196,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_0111_1295482",
"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\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n\nmap<char,string> b;\n\nstring ch1(string s){\n string ret=\"\";\n rep(i,s.size()){\n ret+=b[s[i]];\n }\n return ret;\n}\n\n\n\nstring solve(string s){\n string ret;\n\n int bef=-1;\n for(int i=0;i<s.size();){\n if(bef==i)break;\n bef=i;\n if( s.size() - i>=3 ){\n if( s.substr(i,3)==\"101\" )ret+=' ',i+=3;\n if( s.substr(i,3)==\"110\" )ret+='E',i+=3;\n if( s.substr(i,3)==\"111\" )ret+='P',i+=3;\n }\n if( s.size() - i>=4 ){\n if( s.substr(i,4)==\"0101\" )ret+='C',i+=4;\n if( s.substr(i,4)==\"0001\" )ret+='D',i+=4;\n if( s.substr(i,4)==\"0111\" )ret+='I',i+=4;\n if( s.substr(i,4)==\"0110\" )ret+='K',i+=4;\n if( s.substr(i,4)==\"1000\" )ret+='R',i+=4;\n }\n if( s.size() - i>=5 ){\n if( s.substr(i,5)==\"01001\" )ret+='F',i+=5;\n if( s.substr(i,5)==\"00100\" )ret+='L',i+=5;\n if( s.substr(i,5)==\"00101\" )ret+='O',i+=5;\n if( s.substr(i,5)==\"00110\" )ret+='S',i+=5;\n if( s.substr(i,5)==\"00111\" )ret+='T',i+=5;\n }\n if( s.size() - i>=6 ){\n if( s.substr(i,6)==\"000000\" )ret+='\\'',i+=6;\n if( s.substr(i,6)==\"000011\" )ret+=',',i+=6;\n if( s.substr(i,6)==\"010001\" )ret+='.',i+=6;\n if( s.substr(i,6)==\"000001\" )ret+='?',i+=6;\n if( s.substr(i,6)==\"100101\" )ret+='A',i+=6;\n if( s.substr(i,6)==\"010000\" )ret+='H',i+=6;\n if( s.substr(i,6)==\"000010\" )ret+='W',i+=6;\n\n }\n if( s.size() - i>=8 ){\n if( s.substr(i,8)==\"10010001\" )ret+='-',i+=8;\n if( s.substr(i,8)==\"10011010\" )ret+='B',i+=8;\n if( s.substr(i,8)==\"10011011\" )ret+='G',i+=8;\n if( s.substr(i,8)==\"10011000\" )ret+='J',i+=8;\n if( s.substr(i,8)==\"10011001\" )ret+='M',i+=8;\n if( s.substr(i,8)==\"10011110\" )ret+='N',i+=8;\n if( s.substr(i,8)==\"10011111\" )ret+='Q',i+=8;\n if( s.substr(i,8)==\"10011100\" )ret+='U',i+=8;\n if( s.substr(i,8)==\"10011101\" )ret+='V',i+=8;\n if( s.substr(i,8)==\"10010010\" )ret+='X',i+=8;\n if( s.substr(i,8)==\"10010011\" )ret+='Y',i+=8;\n if( s.substr(i,8)==\"10010000\" )ret+='Z',i+=8;\n }\n }\n \n return ret;\n}\n\n\nint main() {\n\n \n b['A'] =\"00000\";\n b['B'] =\"00001\";\n b['C'] =\"00010\";\n b['D'] =\"00011\";\n b['E'] =\"00100\";\n b['F'] =\"00101\";\n b['G'] =\"00110\";\n b['H'] =\"00111\";\n b['I'] =\"01000\";\n b['J'] =\"01001\";\n b['K'] =\"01010\";\n b['L'] =\"01011\";\n b['M'] =\"01100\";\n b['N'] =\"01101\";\n b['O'] =\"01110\";\n b['P'] =\"01111\";\n b['Q'] =\"10000\";\n b['R'] =\"10001\";\n b['S'] =\"10010\";\n b['T'] =\"10011\";\n b['U'] =\"10100\";\n b['V'] =\"10101\";\n b['W'] =\"10110\";\n b['X'] =\"10111\";\n b['Y'] =\"11000\";\n b['Z'] =\"11001\";\n b[' '] =\"11010\";\n b['.'] =\"11011\";\n b[','] =\"11100\";\n b['-'] =\"11101\";\n b['\\'']=\"11110\";\n b['?'] =\"11111\";\n\n string s;\n while(getline(cin,s)){\n string ans=ch1(s);\n cout<<solve(ans)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1208,
"score_of_the_acc": -0.3393,
"final_rank": 14
},
{
"submission_id": "aoj_0111_1292077",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<map>\n#include<string>\nusing namespace std;\n\nmap<char,string>a;\nmap<string,char>b;\n\nvoid init(){\n a['A']=\"00000\";\n a['B']=\"00001\";\n a['C']=\"00010\";\n a['D']=\"00011\";\n a['E']=\"00100\";\n a['F']=\"00101\";\n a['G']=\"00110\";\n a['H']=\"00111\";\n a['I']=\"01000\";\n a['J']=\"01001\";\n a['K']=\"01010\";\n a['L']=\"01011\";\n a['M']=\"01100\";\n a['N']=\"01101\";\n a['O']=\"01110\";\n a['P']=\"01111\";\n a['Q']=\"10000\";\n a['R']=\"10001\";\n a['S']=\"10010\";\n a['T']=\"10011\";\n a['U']=\"10100\";\n a['V']=\"10101\";\n a['W']=\"10110\";\n a['X']=\"10111\";\n a['Y']=\"11000\";\n a['Z']=\"11001\";\n a[' ']=\"11010\";\n a['.']=\"11011\";\n a[',']=\"11100\";\n a['-']=\"11101\";\n a['\\'']=\"11110\";\n a['?']=\"11111\";\n\n b[\"101\"]=' ';\n b[\"000000\"]='\\'';\n b[\"000011\"]=',';\n b[\"10010001\"]='-';\n b[\"010001\"]='.';\n b[\"000001\"]='?';\n b[\"100101\"]='A';\n b[\"10011010\"]='B';\n b[\"0101\"]='C';\n b[\"0001\"]='D';\n b[\"110\"]='E';\n b[\"01001\"]='F';\n b[\"10011011\"]='G';\n b[\"010000\"]='H';\n b[\"0111\"]='I';\n b[\"10011000\"]='J';\n b[\"0110\"]='K';\n b[\"00100\"]='L';\n b[\"10011001\"]='M';\n b[\"10011110\"]='N';\n b[\"00101\"]='O';\n b[\"111\"]='P';\n b[\"10011111\"]='Q';\n b[\"1000\"]='R';\n b[\"00110\"]='S';\n b[\"00111\"]='T';\n b[\"10011100\"]='U';\n b[\"10011101\"]='V';\n b[\"000010\"]='W';\n b[\"10010010\"]='X';\n b[\"10010011\"]='Y';\n b[\"10010000\"]='Z';\n}\n\n\nint main(){\n init();\n string in;\n while(getline(cin,in)){\n string s,index,ans;\n for(int i=0;i<in.size();i++) s += a[in[i]];\n while(s.size()%5) s += '0';\n for(int i=0;i<s.size();i++){\n index += s[i];\n if(b.find(index)!=b.end()){\n ans += b[index]; index.clear();\n }\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1212,
"score_of_the_acc": -0.008,
"final_rank": 6
},
{
"submission_id": "aoj_0111_1267825",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<string>\n#include<iostream>\n#include<cmath>\n#include<map>\n#include<set>\nusing namespace std;\ntypedef vector<string>vs;\ntypedef vector<int>vi;\ntypedef vector<vi>vvi;\ntypedef vector<double>vd;\ntypedef pair<int,int>pii;\ntypedef long long ll;\ntypedef pair<ll,ll>pll;\ntypedef vector<ll>vl;\n#define rrep(i,x,n) for(int i=(x);i<(n);++i)\n#define rep(i,x) rrep(i,0,(x))\n#define fi first\n#define se second\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)\n#define all(c) (c).begin(),(c).end()\n#define rall(c) (c).rbegin(),(c).rend()\n#define pb push_back\n#define maxs(a,b) (a)=max(a,b)\n#define mins(a,b) (a)=min(a,b)\n\nmap<char,string>a;\nmap<string,char>b;\n\nvoid init(){\n a['A']=\"00000\";\n a['B']=\"00001\";\n a['C']=\"00010\";\n a['D']=\"00011\";\n a['E']=\"00100\";\n a['F']=\"00101\";\n a['G']=\"00110\";\n a['H']=\"00111\";\n a['I']=\"01000\";\n a['J']=\"01001\";\n a['K']=\"01010\";\n a['L']=\"01011\";\n a['M']=\"01100\";\n a['N']=\"01101\";\n a['O']=\"01110\";\n a['P']=\"01111\";\n a['Q']=\"10000\";\n a['R']=\"10001\";\n a['S']=\"10010\";\n a['T']=\"10011\";\n a['U']=\"10100\";\n a['V']=\"10101\";\n a['W']=\"10110\";\n a['X']=\"10111\";\n a['Y']=\"11000\";\n a['Z']=\"11001\";\n a[' ']=\"11010\";\n a['.']=\"11011\";\n a[',']=\"11100\";\n a['-']=\"11101\";\n a['\\'']=\"11110\";\n a['?']=\"11111\";\n\n b[\"101\"]=' ';\n b[\"000000\"]='\\'';\n b[\"000011\"]=',';\n b[\"10010001\"]='-';\n b[\"010001\"]='.';\n b[\"000001\"]='?';\n b[\"100101\"]='A';\n b[\"10011010\"]='B';\n b[\"0101\"]='C';\n b[\"0001\"]='D';\n b[\"110\"]='E';\n b[\"01001\"]='F';\n b[\"10011011\"]='G';\n b[\"010000\"]='H';\n b[\"0111\"]='I';\n b[\"10011000\"]='J';\n b[\"0110\"]='K';\n b[\"00100\"]='L';\n b[\"10011001\"]='M';\n b[\"10011110\"]='N';\n b[\"00101\"]='O';\n b[\"111\"]='P';\n b[\"10011111\"]='Q';\n b[\"1000\"]='R';\n b[\"00110\"]='S';\n b[\"00111\"]='T';\n b[\"10011100\"]='U';\n b[\"10011101\"]='V';\n b[\"000010\"]='W';\n b[\"10010010\"]='X';\n b[\"10010011\"]='Y';\n b[\"10010000\"]='Z';\n}\n\n\nint main(){\n init();\n string str;\n while(getline(cin,str)){\n string s;\n rep(i,str.size())s+=a[str[i]];\n int cur=0;\n while(true){\n bool used=false;\n for(int i=1;cur+i<=s.size();i++){\n\n if(b.find(s.substr(cur,i))==b.end())continue;\n used=true;\n cout<<b[s.substr(cur,i)];\n cur+=i;\n break;\n }\n if(cur==s.size()||used==false)break;\n }\n cout<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.006,
"final_rank": 3
},
{
"submission_id": "aoj_0111_1229791",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <sstream>\n#include <algorithm>\n#include <math.h>\n#include <map>\n#include <functional>\n#include <iomanip>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <set>\n#include <typeinfo>\n#define PI 3.14159265359\n#define INF 99999999\n#define rep(i, n) for(int i=0; i<n; i++)\n#define REP(n) rep(i, n)\n#define EPS 1e-10\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\nusing namespace std;\ntypedef pair<int, int> P;\n\nbool isLeap(int y);\nll gcd(ll a, ll b);\nll lcm(ll a, ll b);\ndouble distanceAB(double xa, double ya, double xb, double yb);\nvoid trace(int A[], int N);\n\n/*\nclass Target\n{\npublic:\n\tvector <string> draw(int n)\n\t{\n\n\t}\n};\n*/\n\n\nstring getConversion1(string inp)\n{\n\tstring ret = \"\";\n\tmap<char, string> tbl;\n\t\n\ttbl['A'] = \"00000\";\n\ttbl['B'] = \"00001\";\n\ttbl['C'] = \"00010\";\n\ttbl['D'] = \"00011\";\n\ttbl['E'] = \"00100\";\n\ttbl['F'] = \"00101\";\n\ttbl['G'] = \"00110\";\n\ttbl['H'] = \"00111\";\n\ttbl['I'] = \"01000\";\n\ttbl['J'] = \"01001\";\n\ttbl['K'] = \"01010\";\n\ttbl['L'] = \"01011\";\n\ttbl['M'] = \"01100\";\n\ttbl['N'] = \"01101\";\n\ttbl['O'] = \"01110\";\n\ttbl['P'] = \"01111\";\n\ttbl['Q'] = \"10000\";\n\ttbl['R'] = \"10001\";\n\ttbl['S'] = \"10010\";\n\ttbl['T'] = \"10011\";\n\ttbl['U'] = \"10100\";\n\ttbl['V'] = \"10101\";\n\ttbl['W'] = \"10110\";\n\ttbl['X'] = \"10111\";\n\ttbl['Y'] = \"11000\";\n\ttbl['Z'] = \"11001\";\n\ttbl[' '] = \"11010\";\n\ttbl['.'] = \"11011\";\n\ttbl[','] = \"11100\";\n\ttbl['-'] = \"11101\";\n\ttbl['\\''] = \"11110\";\n\ttbl['?'] = \"11111\";\n\t\n\trep(i, inp.length())\n\t{\n\t\tret += tbl[inp[i]];\n\t}\n\t\n\treturn ret;\n}\n\nstring getConversion2(string inp)\n{\n\tstring ret = \"\", key = \"\";\n\tmap<string, char> tbl;\n\t\n\ttbl[\"101\"] = ' ';\n\ttbl[\"000000\"] = '\\'';\n\ttbl[\"000011\"] = ',';\n\ttbl[\"10010001\"] = '-';\n\ttbl[\"010001\"] = '.';\n\ttbl[\"000001\"] = '?';\n\ttbl[\"100101\"] = 'A';\n\ttbl[\"10011010\"] = 'B';\n\ttbl[\"0101\"] = 'C';\n\ttbl[\"0001\"] = 'D';\n\ttbl[\"110\"] = 'E';\n\ttbl[\"01001\"] = 'F';\n\ttbl[\"10011011\"] = 'G';\n\ttbl[\"010000\"] = 'H';\n\ttbl[\"0111\"] = 'I';\n\ttbl[\"10011000\"] = 'J';\n\ttbl[\"0110\"] = 'K';\n\ttbl[\"00100\"] = 'L';\n\ttbl[\"10011001\"] = 'M';\n\ttbl[\"10011110\"] = 'N';\n\ttbl[\"00101\"] = 'O';\n\ttbl[\"111\"] = 'P';\n\ttbl[\"10011111\"] = 'Q';\n\ttbl[\"1000\"] = 'R';\n\ttbl[\"00110\"] = 'S';\n\ttbl[\"00111\"] = 'T';\n\ttbl[\"10011100\"] = 'U';\n\ttbl[\"10011101\"] = 'V';\n\ttbl[\"000010\"] = 'W';\n\ttbl[\"10010010\"] = 'X';\n\ttbl[\"10010011\"] = 'Y';\n\ttbl[\"10010000\"] = 'Z';\n\t\n\trep(i, inp.length())\n\t{\n\t\tkey += inp[i];\n\t\tif (tbl.find(key) != tbl.end())\n\t\t{\n\t\t\tret += tbl[key];\n\t\t\tkey = \"\";\n\t\t}\n\t}\n\t\n\treturn ret;\n}\n\n\nint main()\n{\n\tstring inp, conv, ans;\n\t\n\twhile (getline(cin, inp))\n\t{\n\t\tconv = getConversion1(inp);\n\t\t\n\t\t//cout << conv << endl;\n\t\t\n\t\tans = getConversion2(conv);\n\t\t\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}\n\n\nbool isLeap(int y)\n{\n\treturn y % 400 == 0\n\t\t\t\t\t\t? true : y % 100 == 0\n\t\t\t\t\t\t? false : y % 4 == 0\n\t\t\t\t\t\t? true : false;\n}\n\nll gcd(ll a, ll b)\n{\n\treturn (b > 0) ? gcd(b, a % b) : a;\n}\n\nll lcm(ll a, ll b)\n{\n\treturn a / gcd(a, b) * b;\n}\n\nvoid trace(int A[], int N)\n{\n\tREP(N)\n\t{\n\t\tif (i > 0) cout << \" \";\n\t\tcout << A[i];\n\t}\n\tcout << endl;\n}\n\ndouble distanceAB(double xa, double ya, double xb, double yb)\n{\n\treturn sqrt((xb-xa)*(xb-xa) + (yb-ya)*(yb-ya));\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -0.012,
"final_rank": 8
}
] |
aoj_0125_cpp
|
日数
2 つの日付を入力とし、その 2 つの日付けの間の日数を出力するプログラムを作成してください。
日付 1 (
y
1
, m
1
, d
1
) は日付 2 (
y
2
, m
2
, d
2
) と同じか、あるいはそれ以前の日付とします。日付 1 は日数に含め、日付 2 は含めません。また、うるう年を考慮にいれて計算してください。うるう年の条件は次のとおりとします。
西暦年が 4 で割り切れる年であること。
ただし、100 で割り切れる年はうるう年としない。
しかし、400 で割り切れる年はうるう年である。
Input
複数のデータセットが与えられます。各データセットの形式は以下のとおりです：
y
1
m
1
d
1
y
2
m
2
d
2
y
1
,
m
1
,
d
1
,
y
2
,
m
2
,
d
2
のいずれかが負の数のとき入力の終わりとします。
データセットの数は 50 を超えません。
Output
データセットごとに、日数を１行に出力してください。
Sample Input
2006 9 2 2006 9 3
2006 9 2 2006 11 11
2004 1 1 2005 1 1
2000 1 1 2006 1 1
2000 1 1 2101 1 1
-1 -1 -1 -1 -1 -1
Output for the Sample Input
1
70
366
2192
36890
|
[
{
"submission_id": "aoj_0125_6979004",
"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 Inf32 1000000001\n#define Inf64 2000000000000000001\n\nint is_uruu(int y){\n\tif(y%400==0)return 1;\n\tif(y%100==0)return 0;\n\tif(y%4==0)return 1;\n\treturn 0;\n}\n\nint get(int y,int m){\n\tvector<int> ms = {0,31,28,31,30,31,30,31,31,30,31,30,31};\n\tif(m!=2)return ms[m];\n\treturn ms[2] + is_uruu(y);\n}\n\nvoid nxt(int &y,int &m,int &d){\n\td++;\n\tif(get(y,m)<d){\n\t\td = 1;\n\t\tm++;\n\t\tif(m==13){\n\t\t\tm = 1;\n\t\t\ty++;\n\t\t}\n\t}\n}\n\nint main(){\n\t\n\twhile(true){\n\t\tvector<int> y(2),m(2),d(2);\n\t\trep(i,2)cin>>y[i]>>m[i]>>d[i];\n\t\tbool f = true;\n\t\trep(i,2){\n\t\t\tif(y[i]<0||m[i]<0||d[i]<0)f = false;\n\t\t}\n\t\tif(!f)break;\n\t\tint ans = 0;\n\t\twhile(true){\n\t\t\tif(y[0]==y[1]&&m[0]==m[1]&&d[0]==d[1])break;\n\t\t\tans++;\n\t\t\tnxt(y[0],m[0],d[0]);\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\t\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3188,
"score_of_the_acc": -0.31,
"final_rank": 11
},
{
"submission_id": "aoj_0125_4812780",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define each(i, a) for(auto &i : a)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#define line cout << \"-----------------------------\\n\" \n#define ENDL(i,n) ((i) == (n) - 1 ? \"\\n\" : \" \")\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\n\nll ctod(ll y, ll m, ll d) {\n // 1・2月 → 前年の13・14月\n if (m <= 2) {\n --y;\n m += 12;\n }\n ll dy = 365 * (y - 1); // 経過年数×365日\n ll c = y / 100;\n ll dl = (y >> 2) - c + (c >> 2); // うるう年分\n ll dm = (m * 979 - 1033) >> 5; // 1月1日から m 月1日までの日数\n return dy + dl + dm + d - 1;\n}\nbool uru(ll y) {\n if (y % 400 == 0)return true;\n if (y % 100 == 0)return false;\n if (y % 4 == 0)return true;\n return false;\n}\nll month[2][13] = {\n {0,31,28,31,30,31,30,31,31,30,31,30,31}\n ,{0,31,29,31,30,31,30,31,31,30,31,30,31}\n};\nvoid nextday(ll& y, ll& m, ll& d) {\n if (d == month[uru(y)][m]) {\n m++;\n d = 1;\n }\n else d++;\n if (m == 13) {\n y++;\n m = 1;\n }\n}\n\nint main() {\n init();\n\n for (ll a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z && 0 <= a;) {\n int ans = 0;\n for (; a != x || b != y || c != z; ++ans)\n nextday(a, b, c);\n print(ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3152,
"score_of_the_acc": -0.1082,
"final_rank": 10
},
{
"submission_id": "aoj_0125_1860529",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define vi vector<int>\n#define pb push_back\n#define INF 999999999\n//#define INF (1LL<<59)\n\n//verified\nclass date{\npublic:\n int y,m,d;\n \n date(int _y=0, int _m=0, int _d=0):y(_y),m(_m),d(_d){};\n \n bool isLeap(){ return y%400==0||(y%4==0&&y%100); }\n \n date operator + (const int day)const{\n int days_of_month[]={0,31,28,31,30,31,30,31,31,30,31,30,31};\n date t = *this;\n t.d+=day;\n if( days_of_month[t.m]+(t.isLeap()&&t.m==2) >= t.d )return date(t.y,t.m,t.d);\n int dom;\n while( (dom = days_of_month[t.m]+(t.isLeap()&&t.m==2)) < t.d ){\n t.d -= dom;\n if(t.m==12) t.y++,t.m=1;\n else t.m++;\n }\n return t;\n }\n \n bool operator > (const date &date)const{\n int ymd1[] = {y,m,d};\n int ymd2[] = {date.y,date.m,date.m};\n rep(i,3){\n if(ymd1[i]>ymd2[i])return true;\n if(ymd1[i]<ymd2[i])return false;\n }\n return false;\n }\n \n bool operator == (const date &date)const{ return (y==date.y && m==date.m && d==date.d); }\n bool operator != (const date &date)const{ return !(*this==date); }\n bool operator < (const date &date)const{ return ( !(*this>date) && !(*this==date) ); }\n};\n\n\n\nint main(){\n while(1){\n date ymd[2];\n rep(i,2)cin>>ymd[i].y>>ymd[i].m>>ymd[i].d;\n if(ymd[0].y==-1)break;\n if(ymd[0]>ymd[1])swap(ymd[0],ymd[1]);\n \n int c=0;\n while(ymd[0]!=ymd[1]){\n c++;\n ymd[0] = ymd[0]+1;\n }\n cout<<c<<endl;\n }\n \n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3016,
"score_of_the_acc": -0.1013,
"final_rank": 9
},
{
"submission_id": "aoj_0125_1626297",
"code_snippet": "#include<iostream>\nusing namespace std;\nint x[5000000], day[13][32], day2[13][32], cnt, a, b, c, d, e, f, daya1, daya2;\nint days[13] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };\nint days2[13] = { 0,31,29,31,30,31,30,31,31,30,31,30,31 };\nint main() {\n\tfor (int i = 1; i < 5000000; i++) {\n\t\tif ((i % 4 == 0 && i % 100>0) || i % 400 == 0) {\n\t\t\tx[i] = x[i - 1] + 366;\n\t\t}\n\t\telse {\n\t\t\tx[i] = x[i - 1] + 365;\n\t\t}\n\t}\n\tfor (int i = 1; i <= 12; i++) {\n\t\tfor (int j = 1; j <= days[i]; j++) {\n\t\t\tday[i][j] = cnt;\n\t\t\tcnt++;\n\t\t}\n\t}\n\tcnt = 0;\n\tfor (int i = 1; i <= 12; i++) {\n\t\tfor (int j = 1; j <= days2[i]; j++) {\n\t\t\tday2[i][j] = cnt;\n\t\t\tcnt++;\n\t\t}\n\t}\n\twhile (true) {\n\t\tcin >> a >> b >> c >> d >> e >> f;\n\t\tif (a < 0) { break; }\n\t\tif (b < 0) { break; }\n\t\tif (c < 0) { break; }\n\t\tif (d < 0) { break; }\n\t\tif (e < 0) { break; }\n\t\tif (f < 0) { break; }\n\t\tdaya1 = 0; daya2 = 0;\n\t\tdaya1 += x[a - 1];\n\t\tdaya2 += x[d - 1];\n\t\tif ((a % 4 == 0 && a % 100>0) || a % 400 == 0) {\n\t\t\tdaya1 += day2[b][c];\n\t\t}\n\t\telse {\n\t\t\tdaya1 += day[b][c];\n\t\t}\n\t\tif ((d % 4 == 0 && d % 100>0) || d % 400 == 0) {\n\t\t\tdaya2 += day2[e][f];\n\t\t}\n\t\telse {\n\t\t\tdaya2 += day[e][f];\n\t\t}\n\t\tcout << daya2 - daya1 << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 20692,
"score_of_the_acc": -1,
"final_rank": 13
},
{
"submission_id": "aoj_0125_1541892",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n int y1,m1,d1,y2,m2,d2,cnt,u,r;\n int d[13]={0,32,29,32,31,32,31,32,32,31,32,31,32};\n while(1){\n cin >> y1 >> m1 >> d1 >> y2 >> m2 >> d2;\n if(y1<0||m1<0||d1<0||y2<0||m2<0||d2<0) break;\n cnt=0;\n while(1){\n if(y1==y2&&m1==m2&&d1==d2) break;\n u=0;\n if(y1%400==0) u=1;\n else if(y1%100==0) u=0;\n else if(y1%4==0) u=1;\n if(u==1&&m1==2){\n\tif(d1==d[m1]+1){\n\t m1++;\n\t d1=1;\n\t}else{\n\t cnt++;\n\t d1++;\n\t}\n }else{\n\tif(d1==d[m1]){\n\t if(m1==12) m1=1,y1++;\n\t else m1++;\n\t d1=1;\n\t}else{\n\t cnt++;\n\t d1++;\n\t}\n }\n }\n cout << cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0069,
"final_rank": 3
},
{
"submission_id": "aoj_0125_1161015",
"code_snippet": "#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 <deque>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n//#include <cctype>\n#include <cstring>\n//#include <ctime>\n#include <iterator>\n#include <bitset>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <tuple>\n#include <initializer_list>\n#include <unordered_set>\n#include <unordered_map>\n#include <forward_list>\n\n#define cauto const auto&\n#else\n\n#endif\n\nusing namespace std;\n\n\nnamespace{\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\nint mo[12]={31,28,31,30,31,30,31,31,30,31,30,31};\nbool is_leap(int a){\n\tif(a%400==0) return true;\n\tif(a%100==0) return false;\n\tif(a%4==0) return true;\n\treturn false;\n}\nint foo2(int y1,int m1,int d1,int y2,int m2,int d2){\n\tint ret=0;\n\twhile(!(y1==y2&&m1==m2&&d1==d2)){\n\t\tret++;\n\t\t// int t;\n\t\t// cin>>t;\n\t\t// cout<<y1<<\" \"<<m1<<\" \"<<d1<<endl;\n\t\tif(m1==12&&d1==31){\n\t\t\ty1++;\n\t\t\tm1=1;\n\t\t\td1=1;\n\t\t}\n\t\telse if(is_leap(y1)&&m1==2){\n\t\t\tif(d1==29){\n\t\t\t\tm1++;\n\t\t\t\td1=1;\n\t\t\t}\n\t\t\telse{\n\t\t\t\td1++;\n\t\t\t}\n\t\t}\n\t\telse if(mo[m1-1]>d1){\n\t\t\td1++;\n\t\t}\n\t\telse{\n\t\t\tm1++;\n\t\t\td1=1;\n\t\t}\n\t}\n\treturn ret;\n}\nint foo(int y,int m,int d){\n\tbool f=is_leap(y);\n\tint ret=0;\n\twhile(m<=12){\n\t\tif(m==2&&f){\n\t\t\tret+=mo[m-1]-d+2;\n\t\t}\n\t\telse{\n\t\t\tret+=mo[m-1]-d+1;\n\t\t}\n\t\tm++;\n\t\td=1;\n\t}\n\t// cout<<\"ret \"<<ret<<endl;\n\treturn ret;\n}\n\n\nvoid mainmain(){\n\tvint a(6);\n\twhile(1){\n\t\trep(i,6){\n\t\t\tcin>>a[i];\n\t\t\tif(a[i]==-1) return;\n\t\t}\n\t\tcout<<foo2(a[0],a[1],a[2],a[3],a[4],a[5])<<endl;\n\t\tcontinue;\n\t\tint ans=0;\n\t\tif(a[0]==a[3]){\n\t\t\tcout<<-foo(a[3],a[4],a[5])+foo(a[0],a[1],a[2])<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\trep(i,2) ans+=foo(a[0+i*3],a[1+i*3],a[2+i*3]);\n\t\tans-=365;\n\t\tif(is_leap(a[3])&&(a[4]==1||a[4]==2)) ans--;\n\t\ta[0]++;\n\t\twhile(a[0]!=a[3]){\n\t\t\t if(is_leap(a[0])) ans++;\n\t\t\t ans+=365;\n\t\t\t a[0]++;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}\n\n\n\n}\nmain() try{\n mainmain();\n}\ncatch(...){\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1192,
"score_of_the_acc": -0.0085,
"final_rank": 8
},
{
"submission_id": "aoj_0125_936964",
"code_snippet": "#include <stdio.h>\n\nint main(void)\n{\n\tint y, m, d, y2, m2, d2;\n\tint i, j;\n\tint ans;\n\tchar month[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n\t\n\twhile (1){\n\t\tscanf(\"%d %d %d %d %d %d\", &y, &m, &d, &y2, &m2, &d2);\n\t\t\n\t\tif (y < 0 || m < 0 || d < 0 || y2 < 0 || m2 < 0 || d2 < 0){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tans = 0;\n\t\t\n\t\twhile (1){\n\t\t\t\n\t\t\tif (y == y2 && d == d2 && m == m2){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tans++;\n\t\t\td++;\n\t\t\t\n\t\t\tif (d > month[m - 1]){\n\t\t\t\td = 1;\n\t\t\t\tm++;\n\t\t\t}\n\t\t\tif (m > 12){\n\t\t\t\tm = 1;\n\t\t\t\ty++;\n\t\t\t}\n\t\t\t\n\t\t\tif ( (y % 4 == 0 && y % 100 != 0) || y % 400 == 0){\n\t\t\t\tmonth[1] = 29;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmonth[1] = 28;\n\t\t\t}\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\t\n\treturn (0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1024,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0125_828942",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nconst int n_day[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n \nstruct Date {\n // year, month[1,12], day(1 origin), a day of the week[0,6]\n int y, m, d, e;\n Date() {}\n Date(int y, int m, int d, int e = -1) : y(y), m(m), d(d), e(e) {}\n \n bool operator < (const Date &o) const {\n if(y != o.y) return y < o.y;\n if(m != o.m) return m < o.m;\n return d < o.d;\n }\n \n bool isLeapYear() {\n if(y % 400 == 0) return true;\n if(y % 100 == 0) return false;\n if(y % 4 == 0) return true;\n return false;\n }\n\n int getDays() {\n int nd = n_day[m];\n if(m == 2) nd += isLeapYear();\n return nd;\n }\n\n void next() {\n e = (e+1)%7;\n if(d == getDays()) {\n d = 1;\n if(m == 12) {\n m = 1;\n ++y;\n } else {\n ++m;\n }\n } else {\n ++d;\n }\n }\n \n void back() {\n e = (e+6)%7;\n if(d == 1) {\n if(m == 1) {\n m = 12;\n --y;\n } else {\n --m;\n }\n d = getDays();\n } else {\n --d;\n }\n }\n};\n\n// AOJ 0125\nint main() {\n int y1, m1, d1, y2, m2, d2;\n while(cin >> y1 >> m1 >> d1 >> y2 >> m2 >> d2) {\n if(y1 < 0 || m1 < 0 || d1 < 0 || y2 < 0 || m2 < 0 || d2 < 0)\n break;\n Date d(y1,m1,d1), end(y2,m2,d2);\n int res = 0;\n while(d < end) {\n ++res;\n d.next();\n }\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0069,
"final_rank": 3
},
{
"submission_id": "aoj_0125_820627",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint p[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};\nint y2,m2,d2;\n\nint leap(int y){\n if( !(y%400) ) return 1;\n if( !(y%100) ) return 0;\n if( !(y%4) ) return 1;\n return 0;\n}\n\nint solve(int y, int m, int d){\n\n if(y == y2 && m == m2 && d == d2) return 0;\n\n if(leap(y) && m == 2 && d == 28) return solve(y,3,1)+2;\n else if(m == 12 && d == 31) return solve(y+1,1,1)+1;\n else if(p[m] == d) return solve(y,m+1,1)+1;\n else return solve(y,m,d+1)+1;\n\n}\n\nint main(){\n\n int y,m,d;\n\n while(true){\n cin >> y >> m >> d >> y2 >> m2 >> d2;\n if(y < 0 || m < 0 || d < 0 || y2 < 0 || m2 < 0 || d2 < 0) break;\n\n cout << solve(y, m, d) << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0069,
"final_rank": 3
},
{
"submission_id": "aoj_0125_820623",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint p[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};\nint y2,m2,d2;\n\nbool leap(int y){\n\n if(y%400 == 0) return true;\n if(y%100 == 0) return false;\n if(y%4 == 0) return true;\n return false;\n\n}\n\nint solve(int y, int m, int d){\n\n if(y == y2 && m == m2 && d == d2) return 0;\n\n if(leap(y) && m == 2 && d == 28) return solve(y,3,1)+2;\n else if(m == 12 && d == 31) return solve(y+1,1,1)+1;\n else if(p[m] == d) return solve(y,m+1,1)+1;\n else return solve(y,m,d+1)+1;\n\n}\n\nint main(){\n\n int y,m,d;\n\n while(true){\n cin >> y >> m >> d >> y2 >> m2 >> d2;\n if(y < 0 || m < 0 || d < 0 || y2 < 0 || m2 < 0 || d2 < 0) break;\n\n cout << solve(y, m, d) << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0069,
"final_rank": 3
},
{
"submission_id": "aoj_0125_820614",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint p[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};\n\nbool leap(int y){\n\n if(y%400 == 0) return true;\n if(y%100 == 0) return false;\n if(y%4 == 0) return true;\n return false;\n}\n\nint solve(int y1, int m1, int d1, int y2, int m2, int d2){\n\n if(y1 == y2 && m1 == m2 && d1 == d2) return 0;\n\n if(leap(y1) && m1 == 2 && d1 == 28) return solve(y1,3,1,y2,m2,d2)+2;\n else if(m1 == 12 && d1 == 31) return solve(y1+1,1,1,y2,m2,d2)+1;\n else if(p[m1] == d1) return solve(y1,m1+1,1,y2,m2,d2)+1;\n else return solve(y1,m1,d1+1,y2,m2,d2)+1;\n\n}\n\nint main(){\n\n int y1,m1,d1,y2,m2,d2;\n\n while(true){\n cin >> y1 >> m1 >> d1 >> y2 >> m2 >> d2;\n if(y1 < 0 || m1 < 0 || d1 < 0) break;\n if(y2 < 0 || m2 < 0 || d2 < 0) break;\n\n cout << solve(y1, m1, d1, y2, m2, d2) << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0069,
"final_rank": 3
},
{
"submission_id": "aoj_0125_694602",
"code_snippet": "#include<iostream>\nusing namespace std;\ntypedef long long ll;\n\nconst int MNUM[] = {12,12};\nconst int ML[][12] = { {31,28,31,30,31,30,31,31,30,31,30,31}, //day/month in usual year\n\t\t {31,29,31,30,31,30,31,31,30,31,30,31} }; //day/month in leap year\nconst string DAY[] = {\"Sunday\",\"Monday\",\"Tuesday\",\"Wednesday\",\"Thursday\",\"Friday\",\"Saturday\"};\n\nstruct date{\n int y,m,d;\n\n date(void):y(0),m(1),d(1){}\n date(int a,int b,int c):y(a),m(b),d(c){}\n\n int Leap(void){\n if(y%400==0)return 1;\n if(y%100==0)return 0;\n if(y%4==0)return 1;\n return 0;\n }\n\n date next(void){\n int l = Leap();\n if(ML[l][m-1]<++d){ d=1; m++; }\n if(MNUM[l]<m){ m=1; y++; }\n return *this;\n }\n\n ll dayCount(void)const{\n date tmp;\n for(ll res=0;;res++){\n if(tmp==*this)return res;\n tmp.next();\n }\n }\n\n //calculate days from Julian Day(-4713/01/01) using Fliegel's formula.\n ll Fliegel(void){\n int a = (14-m)/12, Y = y+4800-a, M = m+12*a-3;\n return (ll)d + (153*M+2)/5 + 365*Y + Y/4 - Y/100 + Y/400 - 32045;\n }\n\n //calculate day of week using Zeller congruence.\n int Zeller(void){\n int Y = y, M = m;\n if(M<3){Y--; M+=12;}\n return (Y + Y/4 - Y/100 + Y/400 + (13*M+8)/5 + d)%7;\n }\n\n bool operator==(const date x)const{return (y==x.y && m==x.m && d==x.d);}\n \n bool operator<(const date x)const{\n if(y!=x.y)return y<x.y;\n if(m!=x.m)return m<x.m;\n return d<x.d;\n }\n \n bool operator<=(const date x)const{return (*this<x || *this==x); }\n bool operator>(const date x)const{return !(*this<=x);}\n bool operator>=(const date x)const{return !(*this<x);}\n \n ll operator-(const date x)const{\n return dayCount() - x.dayCount();\n }\n};\n\nint main(){\n int y1,m1,d1,y2,m2,d2;\n while(cin >> y1 >> m1 >> d1 >> y2 >> m2 >> d2,y1>=0){\n cout << date(y2,m2,d2)-date(y1,m1,d1) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1200,
"score_of_the_acc": -1.0089,
"final_rank": 14
},
{
"submission_id": "aoj_0125_694590",
"code_snippet": "#include<iostream>\n#include<cmath>\n#include<vector>\nusing namespace std;\ntypedef long long ll;\n\nconst int MNUM = 12, leapMNUM = 12;\nconst int ML[] = {31,28,31,30,31,30,31,31,30,31,30,31}; //day/month in usual year\nconst int leapML[] = {31,29,31,30,31,30,31,31,30,31,30,31}; //day/month in leap year\nconst string days[] = {\"Sunday\",\"Monday\",\"Tuesday\",\"Wednesday\",\"Thursday\",\"Friday\",\"Saturday\"};\n\nstruct date{\n int y,m,d;\n\n date(void):y(0),m(1),d(1){}\n date(int a,int b,int c):y(a),m(b),d(c){}\n \n bool isLeap(void){\n if(y%400==0)return true;\n if(y%100==0)return false;\n if(y%4==0)return true;\n return false;\n }\n\n date next(void){\n d++;\n if(isLeap()){\n if(leapML[m-1]<d){ d=1; m++; }\n if(leapMNUM<m){ m=1; y++; }\n }else{\n if(ML[m-1]<d){ d=1; m++; }\n if(MNUM<m){ m=1; y++; }\n }\n return *this;\n }\n\n bool operator==(const date x)const{return (y==x.y && m==x.m && d==x.d);}\n\n bool operator<(const date x)const{\n if(y!=x.y)return y<x.y;\n if(m!=x.m)return m<x.m;\n return d<x.d;\n }\n\n bool operator<=(const date x)const{return (*this==x || *this<x); }\n bool operator>(const date x)const{return !(*this<=x);}\n bool operator>=(const date x)const{return !(*this<x);}\n\n ll dayCount(void)const{\n date tmp;\n for(ll res=0;;res++){\n if(tmp==*this)return res;\n tmp.next();\n }\n return 0;\n }\n\n ll operator-(const date x)const{\n return dayCount() - x.dayCount();\n }\n\n //calculate days from Julian Day(-4713/01/01) using Fliegel's formula.\n ll Fliegel(void){\n int a = (14-m)/12, Y = y+4800-a, M = m+12*a-3;\n return (ll)d + (153*M+2)/5 + 365*Y + Y/4 - Y/100 + Y/400 - 32045;\n }\n\n //calculate day of week using Zeller congruence.\n int Zeller(void){\n int Y = y, M = m;\n if(M<3){ Y--; M+=12; }\n return (Y + Y/4 - Y/100 + Y/400 + (13*M+8)/5 + d)%7;\n }\n};\n\nint main(){\n int y1,m1,d1,y2,m2,d2;\n while(cin >> y1 >> m1 >> d1 >> y2 >> m2 >> d2,y1>=0)\n cout << date(y2,m2,d2)-date(y1,m1,d1) << endl;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 1200,
"score_of_the_acc": -0.9089,
"final_rank": 12
},
{
"submission_id": "aoj_0125_601394",
"code_snippet": "#include <cstdio>\n\nusing namespace std;\n\nint main(void) {\n while (1) {\n int y1, m1, d1, y2, m2, d2;\n scanf(\"%d%d%d%d%d%d\", &y1, &m1, &d1, &y2, &m2, &d2);\n if (y1 < 0 || m1 < 0 || d1 < 0 || y2 < 0 || m2 < 0 || d2 < 0) {\n break;\n }\n int d = 0;\n while (y1 != y2 || m1 != m2 || d1 != d2) {\n d++;\n d1++;\n /* 2 4 6 9 11 */\n /* 1 3 5 7 8 10 12 */\n // printf(\"%4d %2d %2d\\n\", y1, m1, d1);\n if (((m1 == 4 || m1 == 6 || m1 == 9 || m1 == 11) && d1 > 30) ||\n ((m1 == 1 || m1 == 3 || m1 == 5 ||m1 == 7 || m1 == 8 || m1 == 10 || m1 == 12) && d1 > 31)) {\n d1 = 1;\n m1++;\n } else if (m1 == 2) {\n if (y1 % 4 == 0 && y1 % 100 != 0 || y1 % 400 == 0) {\n if (d1 > 29) {\n d1 = 1;\n m1++;\n }\n } else if (d1 > 28) {\n d1 = 1;\n m1++;\n }\n }\n if (m1 > 12) {\n m1 = 1;\n y1++;\n }\n }\n printf(\"%d\\n\", d);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1024,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_0116_cpp
|
長方形探索
縦に
H
行、横に
W
列並べられた、合計
W × H
のマス目があります。いくつかのマス目には印がついています。各マス目の印の状態を読み込み、印のついていないマス目だけからなる最大の長方形の面積を出力するプログラムを作成してください。
入力データは 1 行
W
文字から構成され、
H
行が与えられます。たとえば以下のようなデータが与えられます。
..*....**.
..........
**....***.
....*.....
..*.......
...**.....
.*.*......
..........
..**......
.*..*.....
入力データの一行が、一行のマス目を表現します。入力データの文字列のうち、. (ピリオド) は印のついていないマス目、* (アスタリスク) は印のついているマス目を示しています。入力データの文字列には、ピリオド、アスタリスク、改行以外の文字は含まれません。
上記の例では、下図の 0 で示される長方形が最大となります。
..*....**.
..........
**....***.
....*00000
..*..00000
...**00000
.*.*.00000
.....00000
..**.00000
.*..*00000
よって、35 と出力すれば正解になります。なお、すべてのマス目に印がついている場合には、0 を出力してください。
Input
複数のデータセットが与えられます。各データセットはスペースで区切られた
H
と
W
からなる行から始まり、つづいて
H × W
の長方形が与えられます。
H, W
はともに 500 以下とします。
入力は２つの 0 を含む行で終わります。データセットの数は 20 を超えません。
Output
各データセットごとに、最大の長方形の面積を１行に出力してください。
Sample Input
10 10
...*....**
..........
**....**..
........*.
..*.......
**........
.*........
..........
....*..***
.*....*...
10 10
..*....*..
.*.*...*..
*****..*..
*...*..*..
*...*..*..
..........
****.*...*
..*..*...*
.*...*...*
****..***.
2 3
...
...
0 0
Output for the Sample Input
28
12
6
|
[
{
"submission_id": "aoj_0116_9152775",
"code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to, cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, int cost) : to(to), cost(cost) {}\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nvector<string> split_str(string S, char c) {\n vector<string> ret;\n stringstream ss;\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == c) {\n ret.pb(ss.str());\n ss.str(\"\");\n ss.clear();\n } else {\n ss << S[i];\n }\n }\n ret.pb(ss.str());\n return ret;\n}\n\nsigned main() {\n int H, W;\n while (cin >> H >> W, H) {\n vector<vector<int>> A(H, vector<int>(W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n char c;\n cin >> c;\n if (c == '.') A[i][j] = 1;\n }\n }\n\n // A[i][j] := マス(i, j)を含め、そこから上に何マスの白マスが続いているか\n for (int j = 0; j < W; j++) {\n for (int i = 0; i + 1 < H; i++) {\n if (A[i + 1][j] == 1) A[i + 1][j] += A[i][j];\n }\n }\n\n int Ans = 0;\n for (int i = 0; i < H; i++) {\n vector<pair<int,int>> st; // stackに(A[i][j], i)を積む\n st.pb(0, -1); // 番兵\n vector<int> left(W); // 左方向に伸ばせる限界の位置\n for (int j = 0; j < W; j++) {\n while (st.size() && st.back().first >= A[i][j]) {\n st.pop_back();\n }\n if (st.size()) left[j] = st.back().second;\n st.pb(A[i][j], j);\n }\n\n vector<pair<int,int>> st2;\n st2.pb(0, W);\n vector<int> right(W); // 右方向に伸ばせる限界の位置\n for (int j = W - 1; j >= 0; j--) {\n while (st2.size() && st2.back().first >= A[i][j]) {\n st2.pop_back();\n }\n if (st2.size()) right[j] = st2.back().second;\n st2.pb(A[i][j], j);\n }\n\n int ans = 0;\n for (int j = 0; j < W; j++) {\n ans = max(ans, A[i][j] * (right[j] - left[j] - 1));\n }\n\n Ans = max(Ans, ans);\n }\n cout << Ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5200,
"score_of_the_acc": -0.2676,
"final_rank": 11
},
{
"submission_id": "aoj_0116_9058325",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\ntemplate<typename T> T largest_rectangle_in_histogram(const vector<T> &a) {\n int n = a.size();\n using P = pair<T, int>;\n vector<int> l(n, 0), r(n, 0);\n vector<P> st_l, st_r;\n st_l.push_back({-1, -1});\n for (int i = 0; i < n; ++i) {\n while (a[i] <= st_l.back().first) {\n st_l.pop_back();\n }\n l[i] = st_l.back().second;\n st_l.push_back({a[i], i});\n }\n st_r.push_back({-1, n});\n for (int i = n - 1; i >= 0; --i) {\n while (a[i] <= st_r.back().first) {\n st_r.pop_back();\n }\n r[i] = st_r.back().second;\n st_r.push_back({a[i], i});\n }\n T res = 0;\n for (int i = 0; i < n; ++i) {\n res = max(res, a[i] * (r[i] - l[i] - 1));\n }\n return res;\n}\n\ntemplate<typename T> T largest_square_in_histogram(const vector<T> &a) {\n int n = a.size();\n using P = pair<T, int>;\n vector<int> l(n, 0), r(n, 0);\n vector<P> st_l, st_r;\n st_l.push_back({-1, -1});\n for (int i = 0; i < n; ++i) {\n while (a[i] <= st_l.back().first) {\n st_l.pop_back();\n }\n l[i] = st_l.back().second;\n st_l.push_back({a[i], i});\n }\n st_r.push_back({-1, n});\n for (int i = n - 1; i >= 0; --i) {\n while (a[i] <= st_r.back().first) {\n st_r.pop_back();\n }\n r[i] = st_r.back().second;\n st_r.push_back({a[i], i});\n }\n T res = 0;\n for (int i = 0; i < n; ++i) {\n T len = min(a[i], T(r[i] - l[i] - 1));\n res = max(res, len * len);\n }\n return res;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int h,w;\n while (cin >> h >> w, h+w) {\n vector<vector<char>> c(h, vector<char>(w));\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n cin >> c[i][j];\n }\n }\n int res = 0;\n vector<int> a(w);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if (a[j] == 0) {\n int ii = i;\n while (ii < h and c[ii][j] == '.') {\n ii += 1, a[j] += 1;\n }\n } else {\n a[j] -= 1;\n }\n }\n res = max(res, largest_rectangle_in_histogram(a));\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3464,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0116_8343229",
"code_snippet": "#line 1 \"test/aoj_0116.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0116\"\n\n#ifndef call_include\n#define call_include\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n\n#line 2 \"dp/largest_histogram_rectangle.cpp\"\n\n#ifndef call_include\n#define call_include\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n\ntemplate<typename T> long long largest_histogram_rectangle(vector<T> &v) {\n\tv.emplace_back(0);\n\tint n = v.size();\n\tlong long mxrec = 0;\n\tstack<pair<T, int>> s;\n\tfor(int i = 0; i < n; i++) {\n\t\tint ni = i;\n\t\twhile(s.size() > 0 and s.top().first > v[i]) {\n\t\t\tlong long h = s.top().first, w = i - s.top().second;\n\t\t\tlong long rec = h * w;\n\t\t\tif(mxrec < rec) mxrec = rec;\n\t\t\tni = s.top().second;\n\t\t\ts.pop();\n\t\t}\n\t\ts.emplace(v[i], ni);\n\t}\n\treturn mxrec;\n}\n#line 2 \"structure/2d_array.cpp\"\n\n#ifndef call_include\n#define call_include\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n\ntemplate<typename T> struct v2d {\nprivate:\n\tvector<vector<T>> m;\n\npublic:\n\tv2d() {}\n\tv2d(int h, int w) : m(h, vector<T>(w)) {}\n\tv2d(int h, int w, const T &init) : m(h, vector<T>(w, init)) {}\n\tv2d(const initializer_list<initializer_list<T>> m_init) : m(m_init.begin(), m_init.end()) {}\n\n\tvoid assign(int h, int w) {\n\t\tm.assign(h, vector<T>(w));\n\t}\n\tvoid assign(int h, int w, const T init) {\n\t\tm.assign(h, vector<T>(w, init));\n\t}\n\n\tinline int size() const {\n\t\treturn m.size();\n\t}\n\n\tvoid in() {\n\t\tfor(vector<T> &v : m)\n\t\t\tfor(T &val : v) cin >> val;\n\t}\n\tvoid in(int h, int w) {\n\t\tm.resize(h, vector<T>(w));\n\t\tin();\n\t}\n\n\tvoid out() {\n\t\tint h = m.size();\n\t\tfor(vector<T> &v : m) {\n\t\t\tint sz = v.size();\n\t\t\tfor(int j = 0; j < sz; j++) {\n\t\t\t\tcout << v[j] << (j == sz - 1 ? '\\n' : ' ');\n\t\t\t}\n\t\t}\n\t\tcout << flush;\n\t}\n\n\tinline vector<T> &operator[](int idx) {\n\t\tassert(0 <= idx && idx < m.size());\n\t\treturn m[idx];\n\t}\n\n\tbool rangeout(int x, int y) {\n\t\tif(x < 0 || y < 0 || x >= size() || y >= m[x].size()) return true;\n\t\treturn false;\n\t}\n};\n#line 11 \"test/aoj_0116.test.cpp\"\n\nint main() {\n\twhile(1) {\n\t\tint H, W;\n\t\tcin >> H >> W;\n\t\tif(H == 0 and W == 0) return 0;\n\n\t\tv2d<char> m;\n\t\tm.in(H, W);\n\t\tv2d<int> hist(H, W);\n\n\t\tfor(int j = 0; j < W; j++) {\n\t\t\thist[0][j] = (m[0][j] == '*' ? 0 : 1);\n\t\t}\n\t\tfor(int i = 1; i < H; i++) {\n\t\t\tfor(int j = 0; j < W; j++) {\n\t\t\t\thist[i][j] = (m[i][j] == '*' ? 0 : hist[i - 1][j] + 1);\n\t\t\t}\n\t\t}\n\n\t\tint ans = 0;\n\t\tfor(int i = 0; i < H; i++) ans = max(ans, (int)largest_histogram_rectangle(hist[i]));\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5440,
"score_of_the_acc": -0.3046,
"final_rank": 12
},
{
"submission_id": "aoj_0116_7381968",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int h, w, sum, piri[550][550], l[550], r[550];\n string masu;\n while(cin >> h >> w, h!=0){\n memset(piri, 0, sizeof(piri));\n sum = 0;\n for(int i=0;i<h;i++){\n cin >> masu;\n piri[i][0] = 0;\n piri[i][w+1] = 0;\n for(int j=0;j<w;j++){\n if(masu[j]=='.'){\n piri[i][j+1] = 1;\n if(i > 0) piri[i][j+1] += piri[i-1][j+1];\n }\n }\n stack<int> st;\n for(int j=0;j<=w;j++){\n while(!st.empty() && piri[i][st.top()]>=piri[i][j]) st.pop();\n if(st.empty()) l[j] = j;\n else l[j] = st.top()+1;\n st.push(j);\n }\n st = stack<int>();\n for(int j=w+1;j>0;j--){\n while(!st.empty() && piri[i][st.top()]>=piri[i][j]) st.pop();\n if(st.empty()) r[j] = j;\n else r[j] = st.top()-1;\n st.push(j);\n sum = max(sum, piri[i][j]*(r[j]-l[j]+1));\n }\n }\n cout << sum << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4260,
"score_of_the_acc": -0.1431,
"final_rank": 5
},
{
"submission_id": "aoj_0116_6976724",
"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\n\nint main(){\n\tint h,w;\n\twhile(cin>>h>>w){\n\t\tif(h==0)break;\n\t\t\n\t\tvector<string> s(h);\n\t\trep(i,h)cin>>s[i];\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tvector<int> v(w,0);\n\t\trep(i,h){\n\t\t\trep(j,w){\n\t\t\t\tif(s[i][j]=='*')v[j]=0;\n\t\t\t\telse v[j]++;\n\t\t\t}\n\t\t\tstack<pair<int,int>> S;\n\t\t\tS.emplace(0,-1);\n\t\t\trep(j,w+1){\n\t\t\t\tint x;\n\t\t\t\tif(j<w)x =v[j];\n\t\t\t\telse x = 0;\n\t\t\t\tif(S.top().first < x){\n\t\t\t\t\tS.emplace(x,j);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tint last;\n\t\t\t\t\twhile(S.size()>0 && S.top().first>=x){\n\t\t\t\t\t\tans = max(ans,S.top().first * (j-S.top().second));\n\t\t\t\t\t\tlast = S.top().second;\n\t\t\t\t\t\tS.pop();\n\t\t\t\t\t}\n\t\t\t\t\tS.emplace(x,last);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout<<ans<<endl;\t\t\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3464,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0116_6939693",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int h, w;\n while(cin >> h >> w, h){\n vector<string> A(h);\n vector<vector<int>> dp(h, vector<int>(w));\n int ans = 0;\n stack<pair<int,int>> ST;\n ST.emplace(-1, -1);\n for(int y = 0; y < h; y++){\n cin >> A[y];\n for(int x = 0; x < w; x++){\n if(A[y][x] == '.')dp[y][x] = (y == 0 ? 0 : dp[y - 1][x]) + 1;\n int p = x;\n while(ST.top().first > dp[y][x]){\n ans = max(ans, ST.top().first * (x - ST.top().second));\n p = ST.top().second;\n ST.pop();\n }\n ST.emplace(dp[y][x], p);\n }\n while(ST.size() > 1){\n ans = max(ans, ST.top().first * (w - ST.top().second));\n ST.pop();\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4528,
"score_of_the_acc": -0.164,
"final_rank": 8
},
{
"submission_id": "aoj_0116_5831023",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nstring s[500];\nint dp[500][500],l[500],r[500];\nsigned main(){\n\tint h,w;\n\twhile(cin>>h>>w,h){\n\t\tfor(int i=0;i<h;i++)\n\t\t\tcin>>s[i];\n\t\tfor(int i=0;i<h;i++){\n\t\t\tfor(int j=0;j<w;j++){\n\t\t\t\tdp[i][j]=0;\n\t\t\t\tif(s[i][j]=='*')\n\t\t\t\t\tcontinue;\n\t\t\t\tif(i!=0)\n\t\t\t\t\tdp[i][j]=dp[i-1][j];\n\t\t\t\tdp[i][j]++;\n\t\t\t}\n\t\t}\n\t\tint ans=0;\n\t\tfor(int i=0;i<h;i++){\n\t\t\tstack<int>st;\n\t\t\tfor(int j=0;j<w;j++){\n\t\t\t\twhile(!st.empty()&&dp[i][st.top()]>=dp[i][j])\n\t\t\t\t\tst.pop();\n\t\t\t\tl[j]=st.empty()?0:st.top()+1;\n\t\t\t\tst.push(j);\n\t\t\t}\n\t\t\tst={};\n\t\t\tfor(int j=w-1;j>=0;j--){\n\t\t\t\twhile(!st.empty()&&dp[i][st.top()]>=dp[i][j])\n\t\t\t\t\tst.pop();\n\t\t\t\tr[j]=st.empty()?w:st.top();\n\t\t\t\tst.push(j);\n\t\t\t}\n\t\t\tfor(int j=0;j<w;j++)\n\t\t\t\tans=max(ans,dp[i][j]*(r[j]-l[j]));\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5660,
"score_of_the_acc": -0.3385,
"final_rank": 13
},
{
"submission_id": "aoj_0116_4990874",
"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;\nconst int mod = 1000000007;\nconst int inf = (1<<30);\nint w,h;\nstruct p{\n\tint hei;\n\tint wid;\n};\n\nint dp(int tebl[]){\n\t// rep(i,w+1) cout<<tebl[i]<<\" \";\n\tint ans=0; \n\tstack<p> s;\n\tp k;\n\tk.hei=tebl[0];\n\tk.wid=0;\n\ts.push(k);\n\t//cout<<s.top().hei<<\" \"<<s.top().wid<<\" \"<<s.size()<<endl;\n\tfor(int i=1; i<w+1; i++){\n\t\tif(s.top().hei < tebl[i]){\n\t\t\t//cout<<i<<\" s.top().hei < tebl[i]\"<<endl;\n\t\t\tk.hei=tebl[i]; k.wid=i;\n\t\t\ts.push(k);\n\t\t}else if(s.top().hei>tebl[i]){\n\t\t\tint g=i;\n\t\t\twhile(s.size() && s.top().hei>tebl[i] ){\n\t\t\t\tp r=s.top();\n\t\t\t\ts.pop();\n\t\t\t\tans=max(ans,(r.hei*(i-r.wid)));\n\t\t\t\tg=min(g,r.wid);\n\t\t\t}\n\t\t\tk.hei=tebl[i]; k.wid=g;\n\t\t\ts.push(k);\n\t\t}\n\t\t//cout<<s.top().hei<<\" \"<<s.top().wid<<\" \"<<s.size()<<endl;\n\t}\n\treturn ans;\n}\n\t\t\t\n\n\nint main(){\n\twhile(true){\n\t\tcin>>h>>w;\n\t\tif(h==0 && w==0) break;\n\t\tint tebl[h][w+1]={};\n\t\trep(i,h){\n\t\t\trep(j,w){\n\t\t\t\tchar k; cin>>k;\n\t\t\t\tif(k=='.'){\n\t\t\t\t\ttebl[i][j]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trep(j,w){\n\t\t\tint a=0;\n\t\t\trep(i,h){\n\t\t\t\tif(tebl[i][j]==1){\n\t\t\t\t\ttebl[i][j]=++a;\n\t\t\t\t}else{\n\t\t\t\t\ta=0;\n\t\t\t\t\ttebl[i][j]=a;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t/*rep(i,h){\n\t\t\trep(j,w){\n\t\t\t\tcout<<tebl[i][j]<<\" \";\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}*/\n\t\tint ans=0;\n\t\trep(i,h){\n\t\t\tans=max(ans,dp(tebl[i]));\n\t\t\t//cout<<ans<<endl;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4072,
"score_of_the_acc": -0.1141,
"final_rank": 3
},
{
"submission_id": "aoj_0116_4813455",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\nusing namespace std;\n\nint solve_sub(vector<int> &a){\n int n = a.size();\n vector<pair<int,int>> wait;\n int res = 0;\n for(int i=0; i<n; i++){\n int lm = -1;\n while(!wait.empty() and a[i]<wait.back().second){\n res = max(res, (i-wait.back().first)*wait.back().second);\n lm = wait.back().first;\n wait.pop_back();\n }\n if(lm != -1){\n wait.emplace_back(lm, a[i]);\n }\n if(wait.empty() or a[i]>wait.back().second){\n wait.emplace_back(i, a[i]);\n }\n }\n return res;\n}\nint solve(vector<vector<int>> a){\n int n = a.size();\n int m = a[0].size();\n for(int j=0; j<m; j++){\n for(int i=0; i<n-1; i++){\n if(a[i+1][j] == 0) continue;\n a[i+1][j] += a[i][j];\n }\n }\n int res = 0;\n for(int i=0; i<n; i++){\n a[i].push_back(0);\n res = max(res, solve_sub(a[i]));\n }\n return res;\n}\n\nint main(){\n while(1){\n int h,w;\n cin >> h >> w;\n if(h == 0) break;\n\n vector<vector<int>> a(h, vector<int>(w));\n for(int i=0; i<h; i++){\n for(int j=0; j<w; j++){\n char c;\n cin >> c;\n if(c == '.') a[i][j] = 1;\n else a[i][j] = 0;\n }\n }\n cout << solve(a) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5756,
"score_of_the_acc": -0.3737,
"final_rank": 14
},
{
"submission_id": "aoj_0116_4674299",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 1400\n\nstruct Rectangle{\n // indexの地点の高さ\n int height;\n // 始点のX\n int pos;\n};\n\n// buf = Tの一行の配列\n// size = Tの一行のサイズ\nint getLargestRectangle(int w,int buf[]){\n // stackとして長方形を保存\n stack<Rectangle> s;\n int maxV = 0;\n // 配列の最後を0にすることで、範囲外後に最大面積を計算するようにする\n buf[w] = 0;\n // stoperまで回す\n for(int i = 0;i <= w;++i){\n Rectangle rect;\n // 高さ代入\n rect.height = buf[i];\n // 横の位置は計算を始める時点の位置\n rect.pos = i;\n // stack空ならば追加\n if(s.empty()){\n s.push(rect);\n }\n else{\n // stackのトップにあるrectの高さより高い場合\n if(s.top().height < rect.height){\n s.push(rect);\n }\n // stackのトップにあるrectの高さよりも低い場合(保存してあった最大の高さが無効になるので、無効になる高さの面積を計算する必要がある)\n else if(s.top().height > rect.height){\n // 新しく積むrectの幅を出すために保存しておく。\n int targetX = i;\n // スタックに入っているrectが対象のrectの高さ以上の場合最大面積を計算する\n while(!s.empty() && s.top().height >= rect.height){\n Rectangle pre = s.top();\n s.pop();\n // 面積を計算する\n int area = pre.height * (i - pre.pos);\n maxV = max(maxV,area);\n // 始点Xを入れ替える(stackに積むrectの高さは取り出したrectの高さよりも低いので、取り出した地点が、長方形を計算する際のX座標になる)\n targetX = pre.pos;\n }\n rect.pos = targetX;\n s.push(rect);\n }\n }\n }\n return maxV;\n}\n\nint H,W;\n// タイル情報を2次元で保存0:綺麗なタイル,1:汚れたタイル\nchar tiles[MAX][MAX];\n// 高さを格納する2次元配列\nint T[MAX][MAX];\n\nint getLargestRectangle(){\n // 各々の地点における高さを格納するプロセス\n for(int i = 0;i < H;++i){\n for(int j = 0;j < W;++j){\n // 汚れたタイル\n if(tiles[i][j] == '*'){\n T[i][j] = 0;\n }\n else{\n // 対象のindex地点の高さを格納する\n // 上の地点 + 1の高さになる\n T[i][j] = (i > 0) ? T[i - 1][j] + 1 : 1; \n }\n }\n }\n \n // 最大面積保存用\n int maxV = 0;\n\n for(int i = 0;i < H;++i){\n maxV = max(maxV,getLargestRectangle(W,T[i]));\n }\n return maxV;\n}\n\nint main(){\n while(1){\n scanf(\"%d %d\",&H,&W);\n if(H == 0 && W == 0) break;\n \n for(int i = 0;i < H;++i){\n for(int j = 0;j < W;++j){\n scanf(\" %c\",&tiles[i][j]);\n }\n }\n printf(\"%d\\n\",getLargestRectangle());\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 6600,
"score_of_the_acc": -0.5038,
"final_rank": 16
},
{
"submission_id": "aoj_0116_4674290",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 1400\n\nstruct Rectangle{\n // indexの地点の高さ\n int height;\n // 始点のX\n int pos;\n};\n\n// buf = Tの一行の配列\n// size = Tの一行のサイズ\nint getLargestRectangle(int w,int buf[]){\n // stackとして長方形を保存\n stack<Rectangle> s;\n int maxV = 0;\n // 配列の最後を0にすることで、範囲外後に最大面積を計算するようにする\n buf[w] = 0;\n // stoperまで回す\n for(int i = 0;i <= w;++i){\n Rectangle rect;\n // 高さ代入\n rect.height = buf[i];\n // 横の位置は計算を始める時点の位置\n rect.pos = i;\n // stack空ならば追加\n if(s.empty()){\n s.push(rect);\n }\n else{\n // stackのトップにあるrectの高さより高い場合\n if(s.top().height < rect.height){\n s.push(rect);\n }\n // stackのトップにあるrectの高さよりも低い場合(保存してあった最大の高さが無効になるので、無効になる高さの面積を計算する必要がある)\n else if(s.top().height > rect.height){\n // 新しく積むrectの幅を出すために保存しておく。\n int targetX = i;\n // スタックに入っているrectが対象のrectの高さ以上の場合最大面積を計算する\n while(!s.empty() && s.top().height >= rect.height){\n Rectangle pre = s.top();\n s.pop();\n // 面積を計算する\n int area = pre.height * (i - pre.pos);\n maxV = max(maxV,area);\n // 始点Xを入れ替える(stackに積むrectの高さは取り出したrectの高さよりも低いので、取り出した地点が、長方形を計算する際のX座標になる)\n targetX = pre.pos;\n }\n rect.pos = targetX;\n s.push(rect);\n }\n }\n }\n return maxV;\n}\n\nint H,W;\n// タイル情報を2次元で保存0:綺麗なタイル,1:汚れたタイル\nchar tiles[MAX][MAX];\n// 高さを格納する2次元配列\nint T[MAX][MAX];\n\nint getLargestRectangle(){\n // 各々の地点における高さを格納するプロセス\n for(int i = 0;i < H;++i){\n for(int j = 0;j < W;++j){\n // 汚れたタイル\n if(tiles[i][j] == '*'){\n T[i][j] = 0;\n }\n else{\n // 対象のindex地点の高さを格納する\n // 上の地点 + 1の高さになる\n T[i][j] = (i > 0) ? T[i - 1][j] + 1 : 1; \n }\n }\n }\n \n // for(int i = 0;i < H;++i){\n // for(int j = 0;j < W;++j){\n // printf(\"%d\",T[i][j]);\n // }\n // printf(\"\\n\");\n // } \n // 最大面積保存用\n int maxV = 0;\n\n for(int i = 0;i < H;++i){\n maxV = max(maxV,getLargestRectangle(W,T[i]));\n }\n return maxV;\n}\n\nint main(){\n while(1){\n scanf(\"%d %d\",&H,&W);\n if(H == 0 && W == 0) break;\n \n for(int i = 0;i < H;++i){\n for(int j = 0;j < W;++j){\n scanf(\" %c\",&tiles[i][j]);\n //printf(\"%c\",tiles[i][j]);\n }\n //printf(\"\\n\");\n }\n printf(\"%d\\n\",getLargestRectangle());\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6596,
"score_of_the_acc": -0.4827,
"final_rank": 15
},
{
"submission_id": "aoj_0116_4582260",
"code_snippet": "#include <iostream>\t\n\nstruct Rect {\n\tint width;\n\tint height;\n\tint max_width;\n\tint max_height;\n\tRect() : width(0), height(0), max_width(0), max_height(0) {}\n};\n\nvoid show(Rect** DP, int H, int W)\n{\n\tfor (int i=0; i<H; i++) {\n\t\tfor (int j=0; j<W; j++) std::cout << DP[i][j].width << \",\" << DP[i][j].height << \" \";\n\t\tstd::cout << std::endl;\n\t}\n}\n\nint main()\n{\n\tint W, H;\n\twhile (std::cin >> H >> W) {\n\t\t\n\t\tif (W==0) break;\n\t\n\t\tchar** board = new char*[H];\n\t\tfor (int i=0; i<H; i++) board[i] = new char[W];\n\t\tfor (int i=0; i<H; i++) {\n\t\t\tfor (int j=0; j<W; j++) std::cin >> board[i][j];\n\t\t}\n\t\t\n\t\tRect** DP = new Rect*[H];\n\t\tfor (int i=0; i<H; i++) DP[i] = new Rect[W];\n\t\t\n\t\tint max = 0;\n\t\tfor (int i=0; i<H; i++) {\n\t\t\tfor (int j=0; j<W; j++) {\n\t\t\t\tif (board[i][j] == '*') continue;\n\t\t\t\tif (i>0) {\n\t\t\t\t\tif (j>0) {\n\t\t\t\t\t\tDP[i][j].max_width = DP[i][j-1].max_width + 1;\n\t\t\t\t\t\tDP[i][j].max_height = DP[i-1][j].max_height + 1;\n\t\t\t\t\t\tint w = DP[i][j].max_width;\n\t\t\t\t\t\tint max_area = DP[i][j].max_height; // DP[i][j].max_height * 1\n\t\t\t\t\t\tint max_w = 1;\n\t\t\t\t\t\tint max_h = DP[i][j].max_height;\n\t\t\t\t\t\tfor (int h=2; h<=DP[i][j].max_height; h++) {\n\t\t\t\t\t\t\tw = std::min(w, DP[i-h+1][j].max_width);\n\t\t\t\t\t\t\tif (max_area < h*w) {\n\t\t\t\t\t\t\t\tmax_area = h*w;\n\t\t\t\t\t\t\t\tmax_w = w;\n\t\t\t\t\t\t\t\tmax_h = h;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tDP[i][j].width = max_w;\n\t\t\t\t\t\tDP[i][j].height = max_h;\n\t\t\t\t\t}\n\t\t\t\t\telse { // j==0\n\t\t\t\t\t\tDP[i][j].height = DP[i-1][j].height + 1;\n\t\t\t\t\t\tDP[i][j].max_height = DP[i-1][j].max_height + 1;\n\t\t\t\t\t\tDP[i][j].width = 1;\n\t\t\t\t\t\tDP[i][j].max_width = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse { // i==0\n\t\t\t\t\tDP[i][j].height = 1;\n\t\t\t\t\tDP[i][j].max_height = 1;\n\t\t\t\t\tif (j>0) {\n\t\t\t\t\t\tDP[i][j].width = DP[i][j-1].width + 1;\n\t\t\t\t\t\tDP[i][j].max_width = DP[i][j-1].max_width + 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tDP[i][j].width = 1;\n\t\t\t\t\t\tDP[i][j].max_width = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (max < DP[i][j].width * DP[i][j].height) {\n\t\t\t\t\tmax = DP[i][j].width * DP[i][j].height;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//show(DP, H, W);\n\t\tstd::cout << max << std::endl;\n\t\t\n\t\tfor (int i=0; i<H; i++) delete[] board[i];\n\t\tdelete[] board;\n\t\tfor (int i=0; i<H; i++) delete[] DP[i];\n\t\tdelete[] DP;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 6952,
"score_of_the_acc": -0.6192,
"final_rank": 17
},
{
"submission_id": "aoj_0116_4431859",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int h, w;\n while(cin >> h >> w, h){\n vector<vector<int>> v(h, vector<int>(w, 0));\n for (int i = 0; i < h; ++i) {\n string s;\n cin >> s;\n for (int j = 0; j < w; ++j) {\n v[i][j] = (s[j] == '.');\n }\n if(i){\n for (int j = 0; j < w; ++j) {\n if(v[i][j]) v[i][j] += v[i-1][j];\n }\n }\n }\n\n int ans = 0;\n for (int i = 0; i < h; ++i) {\n stack<int> s;\n v[i].emplace_back(0);\n vector<int> l(w+1);\n for (int j = 0; j <= w; ++j) {\n while(!s.empty() && v[i][j] <= v[i][s.top()]){\n int k = s.top(); s.pop();\n ans = max(ans, (j-l[k]-1)*v[i][k]);\n }\n l[j] = s.empty() ? -1 : s.top();\n s.emplace(j);\n }\n }\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4844,
"score_of_the_acc": -0.2127,
"final_rank": 10
},
{
"submission_id": "aoj_0116_4276660",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n\nusing namespace std;\n\nchar cs[501][501];\nint p[501][501][2];\n\nint main()\n{\n\tint H, W;\n\twhile (true)\n\t{\n\t\tcin >> H >> W;\n\t\tif (H == 0 && W == 0)\n\t\t\tbreak;\n\t\tfor (size_t i = 0; i <= H; i++)\n\t\t{\n\t\t\tp[i][0][0] = 0;\n\t\t\tp[i][0][1] = 0;\n\t\t}\n\t\tfor (size_t j = 0; j <= W; j++)\n\t\t{\n\t\t\tp[0][j][0] = 0;\n\t\t\tp[0][j][1] = 0;\n\t\t}\n\n\t\tint max = 0;\n\t\tfor (size_t i = 1; i <= H; i++)\n\t\t{\n\t\t\tfor (size_t j = 1; j <= W; j++)\n\t\t\t{\n\t\t\t\tcin >> cs[i][j];\n\t\t\t\tif (cs[i][j] == '*')\n\t\t\t\t{\n\t\t\t\t\tp[i][j][0] = 0;\n\t\t\t\t\tp[i][j][1] = 0;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tp[i][j][0] = p[i - 1][j][0] + 1;\n\t\t\t\t\tp[i][j][1] = p[i][j - 1][1] + 1;\n\t\t\t\t\tif (p[i][j][0] * p[i][j][1] <= max)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tint hei = 501;\n\t\t\t\t\tfor (int c = j ; c >= 1 ; c--)\n\t\t\t\t\t{\n\t\t\t\t\t\thei = min(hei, p[i][c][0]);\n\t\t\t\t\t\tint area = hei * (j - c + 1);\n\t\t\t\t\t\tif (area > max)\n\t\t\t\t\t\t\tmax = area;\n\t\t\t\t\t}\n\t\t\t\t\tint wid = 501;\n\t\t\t\t\tfor (int r = i; r >= 1; r--)\n\t\t\t\t\t{\n\t\t\t\t\t\twid = min(wid, p[r][j][1]);\n\t\t\t\t\t\tint area = wid * (i - r + 1);\n\t\t\t\t\t\tif (area > max)\n\t\t\t\t\t\t\tmax = area;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << max << endl;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 5252,
"score_of_the_acc": -0.7246,
"final_rank": 18
},
{
"submission_id": "aoj_0116_4276658",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n\nusing namespace std;\n\nchar cs[501][501];\nint p[501][501][2];\n\nint main()\n{\n\tint H, W;\n\twhile (true)\n\t{\n\t\tcin >> H >> W;\n\t\tif (H == 0 && W == 0)\n\t\t\tbreak;\n\t\tfor (size_t i = 0; i <= H; i++)\n\t\t{\n\t\t\tp[i][0][0] = 0;\n\t\t\tp[i][0][1] = 0;\n\t\t}\n\t\tfor (size_t j = 0; j <= W; j++)\n\t\t{\n\t\t\tp[0][j][0] = 0;\n\t\t\tp[0][j][1] = 0;\n\t\t}\n\n\t\tint max = 0;\n\t\tfor (size_t i = 1; i <= H; i++)\n\t\t{\n\t\t\tfor (size_t j = 1; j <= W; j++)\n\t\t\t{\n\t\t\t\tcin >> cs[i][j];\n\t\t\t\tif (cs[i][j] == '*')\n\t\t\t\t{\n\t\t\t\t\tp[i][j][0] = 0;\n\t\t\t\t\tp[i][j][1] = 0;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tp[i][j][0] = p[i - 1][j][0] + 1;\n\t\t\t\t\tp[i][j][1] = p[i][j - 1][1] + 1;\n\t\t\t\t\tint hei = 501;\n\t\t\t\t\tfor (int c = j ; c >= 1 ; c--)\n\t\t\t\t\t{\n\t\t\t\t\t\thei = min(hei, p[i][c][0]);\n\t\t\t\t\t\tint area = hei * (j - c + 1);\n\t\t\t\t\t\tif (area > max)\n\t\t\t\t\t\t\tmax = area;\n\t\t\t\t\t}\n\t\t\t\t\tint wid = 501;\n\t\t\t\t\tfor (int r = i; r >= 1; r--)\n\t\t\t\t\t{\n\t\t\t\t\t\twid = min(wid, p[r][j][1]);\n\t\t\t\t\t\tint area = wid * (i - r + 1);\n\t\t\t\t\t\tif (area > max)\n\t\t\t\t\t\t\tmax = area;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << max << endl;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 5208,
"score_of_the_acc": -1.0443,
"final_rank": 19
},
{
"submission_id": "aoj_0116_4245545",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint rectangularSearching(short** table,int W,int H);\n\nstruct rect{\n unsigned short w;\n unsigned short h;\n bool operator<(const rect &another) const{\n return w*20000+h<another.w*20000+another.h;\n };\n bool operator==(const rect &another) const{\n return w==another.w and h==another.h;\n };\n};\n\n\nint main(void){\n int W,H;\n string s;\n while(1){\n cin>>H>>W;\n if(H==0 and W==0)break;\n short** table;\n table=(short **)malloc(sizeof(short*)*(H+2));\n for(int i=0;i<H+2;i++){\n table[i]=(short*)malloc(sizeof(short)*(W+2));\n }\n for(int i=0;i<H+2;i++){\n table[i][0]=0;\n table[i][W+1]=0;\n }\n for(int j=0;j<W+2;j++){\n table[0][j]=0;\n table[H-1][j]=0;\n }\n\n for(int i=0;i<H;i++){\n cin>>s;\n for(int j=0;j<W;j++){\n if(s[j]=='*'){\n table[i+1][j+1]=0;\n }\n else{\n table[i+1][j+1]=1;\n }\n }\n }\n cout<<rectangularSearching(table,W,H)<<endl;\n for(int i=0;i<H+2;i++){\n free(table[i]);\n }\n free(table);\n }\n return 0;\n}\n\nint rectangularSearching(short** table,int W,int H){\n vector<rect> dp[H][W];\n int retval=0;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n if(table[i+1][j+1]==0){\n continue;\n }\n\n if(table[i+1][j]==0 and table[i][j+1]==0){\n rect r;\n r.h=1;\n r.w=1;\n dp[i][j].push_back(r);\n }\n else if(table[i+1][j]==0 and table[i][j+1]==1){\n unsigned short height=0;\n while(table[i+1-height][j+1]==1){\n height++;\n }\n rect r;\n r.h=height;\n r.w=1;\n dp[i][j].push_back(r);\n }\n else if(table[i+1][j]==1 and table[i][j+1]==0){\n unsigned short width=0;\n while(table[i+1][j+1-width]==1){\n width++;\n }\n rect r;\n r.h=1;\n r.w=width;\n dp[i][j].push_back(r);\n }\n else{\n unsigned short width=0;\n while(table[i+1][j-width+1]==1){\n width++;\n }\n unsigned short height=0;\n while(table[i-height+1][j+1]==1){\n height++;\n }\n\n vector<rect> tmp;\n tmp.clear();\n tmp.shrink_to_fit();\n for(unsigned short k=0;k<dp[i][j-1].size();k++){\n rect r;\n unsigned short h=min(dp[i][j-1][k].h,height);\n unsigned short w=dp[i][j-1][k].w+1;\n r.h=h;\n r.w=w;\n tmp.push_back(r);\n }\n for(int k=0;k<dp[i-1][j].size();k++){\n rect r;\n unsigned short h=dp[i-1][j][k].h+1;\n unsigned short w=min(dp[i-1][j][k].w,width);\n r.h=h;\n r.w=w;\n tmp.push_back(r);\n }\n /*\n rect r,r2;\n for(int k=0;k<tmp.size();k++){\n r=tmp[k];\n bool contain=true;\n for(int l=0;l<tmp.size();l++){\n if(k==l)continue;\n r2=tmp[l];\n if(r.w<r2.w and r.h<r2.h){\n contain=false;\n break;\n }\n }\n if(contain){\n dp[i][j].push_back(r);\n }\n }\n */\n sort(tmp.begin(),tmp.end());\n tmp.erase(unique(tmp.begin(),tmp.end()),tmp.end());\n\n dp[i][j]=tmp;\n }\n vector<rect> v=dp[i][j];\n for(int k=0;k<v.size();k++){\n retval=max((int)v[k].h*(int)v[k].w,retval);\n }\n if(i>=1){\n dp[i-1][j].clear();\n dp[i-1][j].shrink_to_fit();\n }\n }\n }\n\n return retval;\n}",
"accuracy": 1,
"time_ms": 500,
"memory_kb": 9952,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0116_4130859",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint H, W;\nint DpOfRow[500][500];\n\nint calculation() {\n\tint len, ans;\n\n\tans = 0;\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = W - 1; j > -1; j--) {\n\t\t\tif (DpOfRow[i][j] == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tlen = INT_MAX;\n\t\t\tfor (int k = i; k < H; k++) {\n\t\t\t\tlen = min(len, DpOfRow[k][j]);\n\t\t\t\tif (len == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tans = max(ans, len*(k - i + 1));\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn ans;\n}\n\n\nint main() {\n\tchar c;\n\n\twhile (cin >> H >> W, H) {\n\t\tmemset(DpOfRow, 0, sizeof(DpOfRow));\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> c;\n\t\t\t\tif (c == '.') {\n\t\t\t\t\tDpOfRow[i][j] = (j == 0 ? 1 : DpOfRow[i][j - 1] + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << calculation() << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3980,
"score_of_the_acc": -0.1612,
"final_rank": 7
},
{
"submission_id": "aoj_0116_4130858",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint H, W;\nint DpOfRow[500][500];\nchar MapData[11][11];\n\nvoid show() {\n\tcout << endl;\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tcout << MapData[i][j];\n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nint calculation() {\n\tint len, ans;\n\n\tans = 0;\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = W - 1; j > -1; j--) {\n\t\t\tif (DpOfRow[i][j] == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tlen = INT_MAX;\n\t\t\tfor (int k = i; k < H; k++) {\n\t\t\t\tlen = min(len, DpOfRow[k][j]);\n\t\t\t\tif (len == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tans = max(ans, len*(k - i + 1));\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn ans;\n}\n\n\nint main() {\n\tchar c;\n\n\twhile (cin >> H >> W, H) {\n\t\tmemset(DpOfRow, 0, sizeof(DpOfRow));\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> c;\n\t\t\t\tif (c == '.') {\n\t\t\t\t\tDpOfRow[i][j] = (j == 0 ? 1 : DpOfRow[i][j - 1] + 1);\n\t\t\t\t}\n\t\t\t\t//MapData[i][j] = c;\n\t\t\t}\n\t\t}\n\t\t//show();\n\t\tcout << calculation() << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 4064,
"score_of_the_acc": -0.1741,
"final_rank": 9
},
{
"submission_id": "aoj_0116_4130768",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint H, W;\nint DpOfRow[500][500];\nchar MapData[11][11];\n\nvoid show() {\n\tcout << endl;\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tcout << MapData[i][j];\n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nint calculation() {\n\tint len, ans;\n\n\tans = 0;\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = W - 1; j > -1; j--) {\n\t\t\tif (DpOfRow[i][j] == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tlen = INT_MAX;\n\t\t\tfor (int k = i; k < W; k++) {\n\t\t\t\tlen = min(len, DpOfRow[k][j]);\n\t\t\t\tif (len == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tans = max(ans, len*(k - i + 1));\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn ans;\n}\n\n\nint main() {\n\tchar c;\n\n\twhile (cin >> H >> W, H) {\n\t\tmemset(DpOfRow, 0, sizeof(DpOfRow));\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> c;\n\t\t\t\tif (c == '.') {\n\t\t\t\t\tDpOfRow[i][j] = (j == 0 ? 1 : DpOfRow[i][j - 1] + 1);\n\t\t\t\t}\n\t\t\t\t//MapData[i][j] = c;\n\t\t\t}\n\t\t}\n\t\t//show();\n\t\tcout << calculation() << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3976,
"score_of_the_acc": -0.1605,
"final_rank": 6
},
{
"submission_id": "aoj_0116_3881886",
"code_snippet": "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) REP(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define MSG(a) cout << #a << \" \" << a << endl;\n#define REP(i, x, n) for (int i = x; i < n; i++)\n#define OP(m) cout << m << endl\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nint main()\n{\n int w, h;\n while (cin >> h >> w, h)\n {\n int max_area = 0;\n int m[h][w];\n\n rep(i, h)\n {\n rep(j, w)\n {\n char c;\n cin >> c;\n m[i][j] = (c == '.' ? 1 : 0);\n }\n }\n int a[w + 1] = {};\n a[w] = -1;\n rep(i, h)\n {\n rep(j, w) a[j] = (m[i][j] == 1 ? a[j] + 1 : 0);\n stack<int> st;\n rep(j, w + 1)\n {\n while (!st.empty() && a[st.top()] > a[j])\n {\n int t = st.top();\n st.pop();\n max_area = max(max_area, a[t] * (st.empty() ? j : j - st.top() - 1));\n }\n st.push(j);\n }\n }\n OP(max_area);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4084,
"score_of_the_acc": -0.116,
"final_rank": 4
}
] |
aoj_0134_cpp
|
出口調査
あるデパートで買い物金額の出口調査を行いました。買い物金額のデータを入力とし、1 人あたりの平均買い物金額を計算し、出力するプログラムを作成してください。調査人数は、10 万人以下とし、一人あたりの買い物金額は 100 万円を超えないものとします。
Input
入力は以下の形式で与えられます。
n
v
1
v
2
:
v
n
1 行目に調査人数
n
、続く
n
行に
i
人目の買い物金額を表す整数
v
i
が与えられます。
Output
平均買い物金額（整数：小数点以下は切り捨て）を１行に出力してください。
Sample Input
6
12300
5600
33800
0
26495
52000
Output for the Sample Input
21699
|
[
{
"submission_id": "aoj_0134_1891897",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n,w=100000;\n cin>>n;\n double num,ans;\n cin>>ans;\n ans/=w;\n for(int i=1;i<n;i++){\n cin>>num;\n num/=w;\n ans+=num;\n }\n ans/=n;\n n=ans*w;\n cout<<n<<endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": -1,
"final_rank": 4
},
{
"submission_id": "aoj_0134_1847500",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n\tlong long sum=0;\n\tint n, num;\n\tcin>>n;\n\tfor(int i=0; i<n; i++){\n\t\tcin>>num;\n\t\tsum+=num;\n\t}\n\tcout<<sum/n<<\"\\n\";\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0134_1551043",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <string>\n#include <cmath>\nusing namespace std;\n\nint main(){\n\tint j;\n\tdouble a,s,n;\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tcin >> a;\n\t\ts+=a/n;\n\t}\n\tj=s;\n\tcout << j << \"\\n\";\n\t\n\t\nreturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1224,
"score_of_the_acc": -0.9412,
"final_rank": 3
},
{
"submission_id": "aoj_0134_1013715",
"code_snippet": "#include <stdio.h>\n#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <fstream>\n#include <sstream>\n#include <math.h>\n#include <queue>\n#include <stack>\n#include <math.h>\n#include <string.h>\n\n\nusing namespace std;\n\n\nint main(){\n double ans=0.0;\n int n;\n cin>>n;\n for(int i = 0; i < n; i++){\n double temp;\n cin>>temp;\n ans+=temp;\n }\n ans/=n;\n cout<<(int)ans<<endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": -1,
"final_rank": 4
},
{
"submission_id": "aoj_0134_899791",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint main(){\n int n;\n double sum = 0.0,a;\n\n cin >> n;\n for(int i = 0 ; i < n ; i++){\n cin >> a;\n sum += a;\n }\n cout << (int)(sum/n) << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": -1,
"final_rank": 4
},
{
"submission_id": "aoj_0134_820868",
"code_snippet": "#include <stdio.h>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n\tint a;\n\tint counter;\n\tdouble sum = 0;\n\tint kekka;\n\n\tcin >> counter;\n\n\tfor (int i = 0; i < counter; i++) {\n\t\tcin >> a;\n\t\tsum += ((double)a / (double)counter);\n\t}\n\n\tkekka = (int)sum;\n\n\tcout << kekka << endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_0129_cpp
|
かくれんぼう
たろう君はかくれんぼうが苦手です。隠れるとすぐ見つかっちゃうし、隠れている子をなかなか見つけることができません。見かねたお父さんは、超高性能位置探索システムを作ってくれました。これを使うと自分の位置を含めて、友達の位置を正確に知ることができます。鬼になったら、隠れている子を探すことが簡単にできるようになりました。
たろう君はさらにこのシステムを進化させ、鬼から自分が見えるか否かを判定する機能を付加することを思いつきました。これができれば、「もういいかい」と言われても、見える位置にいれば「まあだだよ」だし、見えない位置にいれば「もういいよ」ですね。いつも遊んでいる公園には大小さまざまな円筒形の壁があります。この壁は外からは中は見えないし、中から外も見えません。鬼と一緒に中に入ると別の壁がなければ見えちゃいます。
たろう君はアイデアはいいのですが、ソフトを作るのが苦手です。そこで親友のあなたはたろう君に代わって、「鬼から見えないこと確認システム」のソフトウェアを作ることになりました。公園の壁は固定されていますが、たろう君と鬼のいろいろな位置情報に対して見えるか否かを判定する必要があります。
公園にある壁の情報(中心の座標 (
wx
,
wy
) と 半径
r
) とたろう君と鬼の位置情報(たろう君の位置の座標 (
tx
,
ty
) と鬼の位置の座標 (
sx
,
sy
) ) を入力とし、その位置で鬼からたろう君が見えるか否かを判定するプログラムを作成してください。
なお、鬼からたろう君が見える場合には Danger、見えない場合には Safe と出力してください。鬼とたろう君の位置を結んだ線分上に壁がある場合には見えないものとし、鬼もたろう君も壁の上にはいないものとします。
Input
複数のデータセットが与えられます。各データセットは以下の形式で与えられます。
n
wx
1
wy
1
r
1
wx
2
wy
2
r
2
:
wx
n
wy
n
r
n
m
tx
1
ty
1
sx
1
sy
1
tx
2
ty
2
sx
2
sy
2
:
tx
m
ty
m
sx
m
sy
m
1 行目に円筒形の壁の数
n
(0 ≤
n
≤ 100)、続く
n
行に壁
i
の中心の座標を表す整数
wx
i
,
wy
i
(0 ≤
wx
i
,
wy
i
≤ 255) と半径を表す整数
r
i
(1 ≤
r
i
≤ 255) が与えられます。
続く行にたろう君と鬼の位置情報の個数
m
(m ≤ 100)、続く
m
行に位置情報
i
のたろう君の位置の座標を表す整数
tx
i
,
ty
i
(0 ≤
tx
i
,
ty
i
≤ 255) と鬼の位置の座標を表す整数
sx
i
,
sy
i
(0 ≤
sx
i
,
sy
i
≤ 255) が与えられます。
また、円筒形の壁の一部だけが公園にあるということはなく、全ての壁は円筒として、公園の内部に入っています。
n
が 0 のとき入力の終わりを示します。データセットの数は 20 を超えません。
Output
各データセットについて、位置情報
i
の判定結果 Danger または Safe を
i
行目に出力してください。
Sample Input
3
6 6 3
19 7 4
21 8 1
6
5 4 2 11
12 4 2 11
11 9 2 11
14 3 20 5
17 9 20 5
20 10 20 5
0
Output for the Sample Input
Safe
Safe
Danger
Safe
Danger
Safe
|
[
{
"submission_id": "aoj_0129_6979047",
"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 Inf32 1000000001\n#define Inf64 2000000000000000001\n\nconst double eps = 1e-10;\n\ntemplate <typename T>\nstruct point{\n\tT x,y,rad,dir;\n\t\n\tpoint(T a=0.0,T b=0.0){\n\t\tx = a;\n\t\ty = b;\n\t\tfix_rd();\n\t}\n\t\n\tvoid update_x(T a,T b){\n\t\tx = a*x + b;\n\t\tfix_rd();\n\t}\n\t\n\tvoid update_x(T a){\n\t\tupdate_x(0.0,a);\n\t}\n\t\n\tvoid update_y(T a,T b){\n\t\ty = a*y + b;\n\t\tfix_rd();\n\t}\n\t\n\tvoid update_y(T a){\n\t\tupdate_y(0.0,a);\n\t}\n\t\n\tvoid update_rad(T a,T b){\n\t\trad = a*rad + b;\n\t\tfix_xy();\n\t}\n\t\n\tvoid update_rad(T a){\n\t\tupdate_rad(0.0,a);\n\t}\n\t\n\tvoid update_dir(T a,T b){\n\t\tdir = a*dir + b;\n\t\tfix_xy();\n\t}\n\n\tvoid update_dir(T a){\n\t\tupdate_dir(0.0,a);\n\t}\n\t\n\tvoid fix_xy(){\n\t\tx = rad * cos(dir);\n\t\ty = rad * sin(dir);\n\t\tfix_rd();\n\t}\n\t\n\tvoid fix_rd(){\n\t\trad = hypot(x,y);\n\t\tif(rad==0.0)dir=0.0;\n\t\telse dir = atan2(y,x);\n\t\tfix_zero();\n\t}\n\t\n\tvoid fix_zero(){\n\t\tif(abs(x)<eps)x = 0.0;\n\t\tif(abs(y)<eps)y = 0.0;\n\t\tif(abs(rad)<eps)rad = 0.0;\n\t\tif(abs(dir)<eps)dir = 0.0;\n\t}\n\t\n\tvoid normalize(){\n\t\tT s = size();\n\t\tupdate_x(1.0/s,0.0);\n\t\tupdate_y(1.0/s,0.0);\n\t}\n\t\n\t\n\tT get_dis(point<T> V){\n\t\treturn hypot(x-V.x,y-V.y);\n\t}\n\t\n\tT size(){\n\t\treturn get_dis(point<T>());\n\t}\n\t\n\tT angle_difference(point<T> V){\n\t\tdouble ret = dir - V.dir;\n\t\tif(ret<-acos(-1.0))ret = acos(-1.0)*2.0+ret;\n\t\tif(ret>acos(-1.0))ret=-acos(-1.0)*2.0+ret;\n\t\treturn ret;\n\t}\n\t\n\t//中点\n\tpoint get_midpoint(point<T> V){\n\t\tV.update_x(0.5,x/2.0);\n\t\tV.update_y(0.5,y/2.0);\n\t\treturn V;\n\t}\n\t\n\tT get_inner_product(point<T> V){\n\t\treturn x*V.x+y*V.y;\n\t}\n\t\n\tT get_cross_product(point<T> V){\n\t\treturn x*V.y-y*V.x;\n\t}\n\t\n\tpoint &operator+=(const point<T> &another){\n\t\tupdate_x(1,another.x);\n\t\tupdate_y(1,another.y);\n\t\treturn (*this);\n\t}\n\t\n\tpoint &operator-=(const point<T> &another){\n\t\tupdate_x(1,-another.x);\n\t\tupdate_y(1,-another.y);\n\t\treturn (*this);\n\t}\n\t\n\tpoint operator+(const point<T> &another)const{\n\t\treturn (point(*this)+=another);\n\t}\n\t\n\tpoint operator-(const point<T> &another)const{\n\t\treturn (point(*this)-=another);\n\t}\n\t\n\tvoid show(){\n\t\tcout<<x<<','<<y<<endl;\n\t}\n};\n\n//a+tx\ntemplate <typename T>\nstruct line{\n\tpoint<T> a,t;\n\t\n\tline(){\n\t}\n\t\n\tline(point<T> V1,point<T> V2){\n\t\ta=V1;\n\t\tt=V2-V1;\n\t}\n\n\tT get_signed_dis(point<T> V){\n\t\tpoint<double> PA = a-V;\n\t\treturn PA.get_cross_product(t)/t.size();\n\t}\n\t\n\tT get_dis(point<T> V){\n\t\treturn abs(get_signed_dis(V));\n\t}\n\t\n\tpoint<T> get_projection(point<T> P){\n\t\tT r = t.get_inner_product(P-a)/t.size();\n\t\tpoint<T> temp = t;\n\t\ttemp.update_rad(0.0,r);\n\t\treturn a+temp;\n\t}\t\n\t\n\tpoint<T> get_cross_point(line<T> L){\n\t\tpoint<T> ret(1e20,1e20);\n\t\tif(abs(t.get_cross_product(L.t))<eps)return ret;\n\n\t\tT d0 = L.get_signed_dis(a);\n\t\tT d1 = L.get_signed_dis(a+t);\n\t\tpoint<T> temp = t;\n\t\ttemp.x *= d0/(d1-d0);\n\t\ttemp.y *= d0/(d1-d0);\n\t\tret = a - temp;\n\t\treturn ret;\n\t}\n\t\n};\ntemplate <typename T>\nstruct segment{\n\tpoint<T> V1,V2;\n\tsegment(point<T> a=point<T>(),point<T> b=point<T>()){\n\t\tV1=a;\n\t\tV2=b;\n\t}\n\t\n\tT get_dis(point<T> P){\n\t\tT ret = 1e20;\n\t\tline<T> L(V1,V2);\n\t\tpoint<T> Q = L.get_projection(P);\n\t\tif(Q.x+eps>min(V1.x,V2.x)&&Q.y+eps>min(V1.y,V2.y)\n\t\t&&Q.x<max(V1.x,V2.x)+eps&&Q.y<max(V1.y,V2.y)+eps)ret = min(ret,Q.get_dis(P));\n\t\telse{\n\t\t\tret = min(ret,P.get_dis(V1));\n\t\t\tret = min(ret,P.get_dis(V2));\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tT get_dis(segment<T> l){\n\t\tif(get_cross_point(l).x<1e20)return 0.0;\n\t\treturn min({get_dis(l.V1),get_dis(l.V2),l.get_dis(V1),l.get_dis(V2)});\n\t}\n\t\n\tpoint<T> get_cross_point(segment<T> l){\n\t\tline<T> L1(V1,V2),L2(l.V1,l.V2);\n\t\tpoint<T> P = L1.get_cross_point(L2);\n\t\tif(get_dis(P)<eps&&l.get_dis(P)<eps)return P;\n\t\treturn point<T> (1e20,1e20);\n\t}\n};\n\nint main(){\n\twhile(true){\n\t\tint n;\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\t\n\t\tvector<int> x(n),y(n),r(n);\n\t\trep(i,n)cin>>x[i]>>y[i]>>r[i];\n\t\t\n\t\tint m;\n\t\tcin>>m;\n\t\t\n\t\trep(_,m){\n\t\t\tint a,b,c,d;\n\t\t\tcin>>a>>b>>c>>d;\n\t\t\tbool f = true;\n\t\t\trep(i,n){\n\t\t\t\tbool f0 = (r[i]*r[i]) > (x[i]-a)*(x[i]-a) + (y[i]-b)*(y[i]-b);\n\t\t\t\tbool f1 = (r[i]*r[i]) > (x[i]-c)*(x[i]-c) + (y[i]-d)*(y[i]-d);\n\t\t\t\tif(f0!=f1)f = false;\n\t\t\t\tif(!f0 && !f1){\n\t\t\t\t\tsegment<double> l(point<double>(a,b),point<double>(c,d));\n\t\t\t\t\tpoint<double> p(x[i],y[i]);\n\t\t\t\t\tdouble dd = l.get_dis(p);\n\t\t\t\t\t//if(_==2)cout<<dd<<endl;\n\t\t\t\t\tif(dd < r[i] + eps)f= false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f)cout<<\"Danger\"<<endl;\n\t\t\telse cout<<\"Safe\"<<endl;\n\t\t}\n\t\t\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3600,
"score_of_the_acc": -1,
"final_rank": 13
},
{
"submission_id": "aoj_0129_3641398",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing uint=unsigned;\nusing ll=long long;\nusing ull=unsigned long long;\n#define int ll\n\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,b) rng(i,0,b)\n#define gnr(i,a,b) for(int i=int(b)-1;i>=a;i--)\n#define per(i,b) gnr(i,0,b)\n#define mp make_pair\n#define mt make_tuple\n#define pb push_back\n#define eb emplace_back\n#define fs first\n#define sc second\n#define bg begin()\n#define ed end()\n#define all(x) x.bg,x.ed\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n#define tmp template<class t>\n\ntmp void chmax(t&a,t b){if(a<b)a=b;}\ntmp void chmin(t&a,t b){if(a>b)a=b;}\n\ntmp using vc=vector<t>;\ntmp using vvc=vc<vc<t>>;\n\nusing pi=pair<int,int>;\nusing vi=vc<int>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.fs<<\",\"<<p.sc<<\"}\";\n}\n\ntmp ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\nconstexpr ll ten(int n){\n\treturn n==0?1:ten(n-1)*10;\n}\n\ntmp void mkuni(vc<t>&v){\n\tsort(all(v));\n\tv.erase(unique(all(v)),v.ed);\n}\n\nbool inc(int a,int b,int c){\n\treturn a<=b&&b<=c;\n}\n\nll read(){ll i;cin>>i;return i;}\n\nusing ld=long double;\nusing cm=complex<ld>;\n#define x real()\n#define y imag()\nconst ld eps=1e-7;\nint sgn(ld a){return a<-eps?-1:(a>eps?1:0);}\nauto cmcmp=[](const cm&a,const cm&b){\n\tif(sgn(a.x-b.x))return a.x<b.x;\n\telse return sgn(a.y-b.y)<0;\n};\n\nld dot(cm a,cm b){return a.x*b.x+a.y*b.y;}\nld crs(cm a,cm b){return a.x*b.y-a.y*b.x;}\nint ccw(cm a,cm b){return sgn(crs(a,b));}\nint ccw(cm a,cm b,cm c){return ccw(b-a,c-a);}\n\n//(-2)[a,-1](0)[b,1](2)\nint bet(cm a,cm b,cm c){\n\tcm d=b-a;\n\tld e=dot(d,c-a);\n\tif(sgn(e)<=0)return sgn(e)-1;\n\treturn sgn(e-norm(d))+1;\n}\n\nld tri2(cm a,cm b,cm c){\n\treturn crs(b-a,c-a);\n}\n\n//0-no,1-edge,2-in\nint cont(cm a,cm b,cm c,cm d){\n\tif(ccw(a,b,c)==-1)\n\t\tswap(b,c);\n\treturn min({ccw(a,b,d),ccw(b,c,d),ccw(c,a,d)})+1;\n}\n\nstruct ln{\n\tcm a,b;\n\tcm dir(){return b-a;}\n\tcm proj(cm c){\n\t\tcm d=dir();\n\t\treturn a+d*dot(d,c-a)/norm(d);\n\t}\n\tcm refl(cm c){\n\t\treturn ld(2)*proj(c)-c;\n\t}\n\t//AOJ0153\n\tld dsp(cm c){\n\t\tcm d=proj(c);\n\t\tif(abs(bet(a,b,d))<=1)return abs(c-d);\n\t\treturn min(abs(c-a),abs(c-b));\n\t}\n};\nint ccw(ln a,cm b){return ccw(a.a,a.b,b);}\n\nstruct cr{\n\tcm c;\n\tld r;\n\t//AOJ0153\n\t//0-no,1-edge,2-in\n\tint cont(cm a){\n\t\treturn sgn(r-abs(a-c))+1;\n\t}\n\t//AOJ0153\n\t//0-no,1-touch,2-cross\n\tint ids(ln a){\n\t\treturn sgn(r-a.dsp(c))+1;\n\t}\n\t//0-no(in),1-touch(in),2-cross,3-touch(out),4-no(out)\n\tint ics(ln a){\n\t\tint b=ids(a);\n\t\tif(b<=1)return 4-b;\n\t\treturn sgn(max(abs(a.a-c),abs(a.b-c))-r)+1;\n\t}\n};\n\ncm readcm(){\n\tld a,b;\n\tcin>>a>>b;\n\treturn cm(a,b);\n}\n\nld readld(){\n\tld a;\n\tcin>>a;\n\treturn a;\n}\n\nsigned main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(20);\n\twhile(1){\n\t\tint n=read();\n\t\tif(n==0)break;\n\t\tvc<cr> a(n);\n\t\trep(i,n)\n\t\t\ta[i]=cr{readcm(),readld()};\n\t\tint m=read();\n\t\trep(_,m){\n\t\t\tcm b=readcm();\n\t\t\tcm c=readcm();\n\t\t\tbool ok=true;\n\t\t\tfor(auto d:a)\n\t\t\t\tif(inc(1,d.ics(ln{b,c}),3))\n\t\t\t\t\tok=false;\n\t\t\tif(ok)\n\t\t\t\tcout<<\"Danger\"<<endl;\n\t\t\telse\n\t\t\t\tcout<<\"Safe\"<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3260,
"score_of_the_acc": -0.9056,
"final_rank": 11
},
{
"submission_id": "aoj_0129_1959625",
"code_snippet": "#include<iostream>\n#include<complex>\n#include<algorithm>\n#include<vector>\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\nusing namespace std;\ntypedef complex<double> P;\ntypedef pair<double,double> point;\n\n\ndouble dot(P a,P b){\n\treturn real(conj(a)*b);\n}\n\ndouble cross(P a,P b){\n\treturn imag(conj(a)*b);\n}\n\ndouble dist(P a, P b,P c){\n\tif(dot(b-a,c-a)<0)return abs(c-a);\n\tif(dot(a-b,c-b)<0)return abs(c-b);\n\treturn abs(cross(c-a,b-a))/abs(b-a);\n}\n\nint main(){\n\tint n,m;\n\tdouble x,y,r;\n\tP taro,oni;\n\tvector<pair<P,double> > circle; \n\twhile(cin>>n,n){\n\t\tcircle.clear();\n\t\trep(i,n){\n\t\t\tcin>>x>>y>>r;\n\t\t\tcircle.pb(pair<P,double>(P(x,y),r));\n\t\t}\n\t\tcin>>m;\n\t\trep(p,m){\n\t\t\tcin>>x>>y;\n\t\t\ttaro=P(x,y);\n\t\t\tcin>>x>>y;\n\t\t\toni=P(x,y);\n\t\t\tbool check=false;\n\t\t\trep(i,n){\n\t\t\t\tr=circle[i].second;\n\t\t\t\tdouble d=dist(taro,oni,circle[i].first);\n\t\t\t\tif(d<=r && (abs(taro-circle[i].first)>=r || abs(oni-circle[i].first)>=r)){\n\t\t\t\t\tcheck=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(check)cout<<\"Safe\"<<endl;\n\t\t\telse cout<<\"Danger\"<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1252,
"score_of_the_acc": -0.3478,
"final_rank": 6
},
{
"submission_id": "aoj_0129_1793870",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <functional>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n \nusing namespace std;\n \n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\n#define rep(i,n) REP(i, 0, n)\n#define pb push_back\n#define mp make_pair\n#define all(r) (r).begin(),(r).end()\n#define rall(r) (r).rbegin(),(r).rend()\n#define fi first\n#define se second\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vii;\ntypedef vector<ll> vl;\ntypedef vector<vl> vll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n \n\n \nconst int INF = 1000000;\nconst double EPS = 1e-8;\nconst int mod = 1e9 + 7;\n\nconst double PI = acos(-1);\n\nint dx[] ={-1,0,1,0};\nint dy[] ={0,-1,0,1};\n\nstruct Point\n{\n\tdouble x, y;\n\tPoint(){};\n\tPoint(double x, double y):x(x), y(y){};\n\n\tPoint operator - (const Point& p) const{\n\t\treturn Point(x-p.x, y-p.y);\n\t}\n\n\tdouble getAng(){\n\t\treturn atan2(y, x);\n\t}\n\tdouble getCross(const Point& p) const{\n\t\treturn x*p.y-y*p.x;\n\t}\n\tdouble getDot(const Point& p) const{\n\t\treturn x*p.x+y*p.y;\n\t}\n};\n\nstruct Circle\n{\n\tPoint p;\n\tdouble r;\n\tCircle(){};\n\tCircle(double x, double y, double r):p(x, y), r(r){};\n\tCircle(Point p, double r) :p(p),r(r){};\n\n};\n\nstruct Line{\n\tPoint p;\n\tdouble ang;\n\tLine(){};\n\tLine(Point p1, Point p2):p(p1), ang((p2-p1).getAng()){};\n\tLine(Point p, double ang):p(p), ang(ang){};\n};\n\t\nint n;\nCircle c[1010];\nPoint taro, oni;\nLine l;\nPoint lv;\n\nbool checkSigneCross(Point p){\n\treturn lv.getCross(p-l.p) > 0;\n}\n\nPoint getCrossPoint(Line L){\n\tPoint ret;\n\tret.x = L.p.x + 1000000 * cos(L.ang);\n\tret.y = L.p.y + 1000000 * sin(L.ang);\n\tbool sign = checkSigneCross(L.p), sign2 = checkSigneCross(ret);\n\tsign2 = sign^sign2;\n\t//cout<<sign2<<endl;\n\tdouble l = 0.0, r = 1000000.0, m;\n\trep(i, 1000){\n\t\tm = (l + r) / 2.0;\n\t\tret.x = L.p.x + m * cos(L.ang) * (sign2?1:-1);\n\t\tret.y = L.p.y + m * sin(L.ang) * (sign2?1:-1);\n\t\tif(checkSigneCross(ret) == sign) l = m;\n\t\telse r = m;\n\t}\n\treturn ret;\n}\n\nbool checkInCircle(const Circle& C, const Point& P){\n\tPoint p = C.p-P;\n\treturn p.x*p.x+p.y*p.y < C.r*C.r + EPS;\n}\n\nbool check(){\n\tfor(int i = 0; i < n; i++){\n\t\tif(checkInCircle(c[i], taro)^checkInCircle(c[i], oni)) return true;\n\t\telse if(checkInCircle(c[i], taro)&&checkInCircle(c[i], oni)) continue;\n\t\tLine l2(c[i].p, l.ang+PI/2.0);\n\n\t\tPoint p = getCrossPoint(l2);\n\t\tif(checkInCircle(c[i], p) && (taro-p).getDot(oni-p) < 0) return true;\n\t}\n\treturn false;\n}\n\nint main(){\n\tint m;\n\twhile(cin>>n && n){\n\t\trep(i, n) cin>>c[i].p.x>>c[i].p.y>>c[i].r;\n\t\tcin>>m;\n\t\trep(i, m){\n\t\t\tcin>>taro.x>>taro.y>>oni.x>>oni.y;\n\t\t\tl = Line(taro, oni);\n\t\t\tlv = Point(cos(l.ang), sin(l.ang));\n\t\t\tcout<<(check()?\"Safe\":\"Danger\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1308,
"score_of_the_acc": -0.4403,
"final_rank": 10
},
{
"submission_id": "aoj_0129_1148759",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nstruct Wall { int x, y, r; };\n\nbool inside(Wall w, double x, double y) {\n\treturn w.r * w.r >= (w.x - x) * (w.x - x) + (w.y - y) * (w.y - y);\n}\n\nint main() {\n\tint n, wx, wy, r, m, tx, ty, sx, sy;\n\twhile (cin >> n, n) {\n\t\tvector<Wall> w;\n\t\tfor (int i=0; i<n; ++i) {\n\t\t\tcin >> wx >> wy >> r;\n\t\t\tw.push_back((Wall){wx, wy, r});\n\t\t}\n\t\tcin >> m;\n\t\tfor (int i=0; i<m; ++i) {\n\t\t\tcin >> tx >> ty >> sx >> sy;\n\t\t\tbool safe = false;\n\t\t\tfor (int j=0; j<n && !safe; ++j) {\n\t\t\t\tint k = inside(w[j], tx, ty) + inside(w[j], sx, sy);\n\t\t\t\tif (k == 0) {\n\t\t\t\t\tdouble dx, dy, x, y, minx, maxx, miny, maxy;\n\t\t\t\t\tdx = (sx - tx) / 10000.0;\n\t\t\t\t\tdy = (sy - ty) / 10000.0;\n\t\t\t\t\tx = tx;\n\t\t\t\t\ty = ty;\n\t\t\t\t\tminx = min(sx, tx);\n\t\t\t\t\tmaxx = max(sx, tx);\n\t\t\t\t\tminy = min(sy, ty);\n\t\t\t\t\tmaxy = max(sy, ty);\n\t\t\t\t\twhile ( ! safe && minx <= x && x <= maxx && miny <= y && y <= maxy) {\n\t\t\t\t\t\tif (inside(w[j], x, y)) {\n\t\t\t\t\t\t\tsafe = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tx += dx;\n\t\t\t\t\t\ty += dy;\n\t\t\t\t\t}\n\t\t\t\t} else if (k == 1) {\n\t\t\t\t\tsafe = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << (safe ? \"Safe\" : \"Danger\") << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 1212,
"score_of_the_acc": -0.9905,
"final_rank": 12
},
{
"submission_id": "aoj_0129_1134328",
"code_snippet": "#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 <deque>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cctype>\n#include <cstring>\n#include <ctime>\n#include <iterator>\n#include <bitset>\n#include <numeric>\n#include <list>\n#include <iomanip>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <tuple>\n#include <initializer_list>\n#include <unordered_set>\n#include <unordered_map>\n#include <forward_list>\n\n#define cauto const auto&\n#else\n\n#endif\n\nusing namespace std;\n\n\nnamespace{\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#define double long double\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\n\nint check(double x1,double y1,double x2,double y2,double r2){\n\tdouble xy=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1),r=r2*r2;\n\tif(r-xy<-EPS) return 1;\n\telse return -1;\n}\n\n\nvoid mainmain(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tvector<pair<pair<double,double>,double > > a(n);\n\t\trep(i,n){\n\t\t\tcin>>a[i].F.F>>a[i].F.S>>a[i].S;\n\t\t}\n\t\tint m;\n\t\tcin>>m;\n\t\t// vector<pair<double,double> > b(m);\n\t\trep(l,m){\n\t\t\tdouble b[4];\n\t\t\tcin>>b[0]>>b[1]>>b[2]>>b[3];\n\t\t\tbool f=false;\n\t\t\tdouble x=b[0],y=b[1];\n\t\t\tdouble dx=(b[2]-b[0])/10000.0,dy=(b[3]-b[1])/10000.0;\n\t\t\trep(i,n){\n\t\t\t\tint t=check(b[0],b[1],a[i].F.F,a[i].F.S,a[i].S);\n\t\t\t\treep(j,1,10001){\n\t\t\t\t\tint t1=check(x+dx*j,y+dy*j,a[i].F.F,a[i].F.S,a[i].S);\n\t\t\t\t\t\t// cout<<x+dx*j<<\" \"<<y+dy*j<<\" \"<<a[i].F.F<<\" \"<<a[i].F.S<<\" \"<<a[i].S<<endl;\n\t\t\t\t\tif(t!=t1){\n\t\t\t\t\t\tf=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\t\n\t\t\t\t}\n\t\t\t\tif(f) break;\n\t\t\t}\n\t\t\tif(f) cout<<\"Safe\\n\";\n\t\t\telse cout<<\"Danger\\n\";\n\t\t}\n\t}\n\t// cout<<check(0,3,3,3,3)<<endl;\n\t// cout<<check(-1,3,3,3,3)<<endl;\n\t// cout<<check(0.5,0,1,0,1)<<endl;\n}\n\n\n\n}\nmain() try{\n mainmain();\n}\ncatch(...){\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 1196,
"score_of_the_acc": -1.3322,
"final_rank": 14
},
{
"submission_id": "aoj_0129_874410",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define fr first\n#define sc second\nstruct line: public vector< complex<double> >{\n line(){resize(2);};\n line( const complex<double>& a, const complex<double>& b){\n push_back(a);\n push_back(b);\n }\n};\nstruct circle {\n complex<double> p; double r;\n circle():p(0,0),r(0){};\n circle(const complex<double> &p, double r) : p(p),r(r){}\n};\ntypedef complex < double > P;\ntypedef line L;\ntypedef pair < P, P > Ls;\ntypedef vector< P > G;\ntypedef vector< P > Ps;\ntypedef vector< L > LLL;\ntypedef circle C;\nconst double EPS = 1e-10;\nconst double INF = 1e8;\nbool eq(P,P); //点:点 同一判定\ndouble cross(P,P); //外積\ndouble dot(P,P); //内積\nint ccw(P,P,P); //3点の位置関係\nbool parallel(L,L); // 直線//直線\nbool orthogonal(L,L); //直線⊥直線\nbool intersect(L,L); //線分:線分交差\nbool intersect(L,P); //線分:点交差\nbool intersect(Ls,Ls); //直線:直線交差\nbool intersect(Ls,L); //直線:線分交差\nbool intersect(Ls,P); //直線:点交差\nint intersect(C,L); //円:線分交点数\nbool intersect(C,Ls); //円:直線交差\nbool intersect(C,C); //円:円交差\nbool intersect(C,P); //円:点交差\ndouble distance(L,L); //線分:線分の距離\ndouble distance(L,P); //線分:点の距離\ndouble distance(P,P); //点:点の距離\ndouble distance(Ls,P); //直線:点距離\ndouble distance(Ls,Ls); //直線:直線距離\ndouble distance(Ls,L); //直線:線分距離\nP crosspoint(L,L); //線分:線分交点計算\nL crosspoint(C,Ls); //円:直線交点計算\nL crosspoint(C,L); //円:線分交点計算\nL crosspoint(C,C); //円:円交点計算\nint contains(G,P); //図形:点内包判定\nbool contains(C,P);\ndouble area2(G); //面積\nbool isconvex(G); //凸性判定\nPs convex(G); //凸包\n \nnamespace std {\n bool operator < (const P& a, const P& b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\nL llcomb(Ls a){\n L line( a.fr, a.sc);\n return line;\n}\nLs llrcomb(L a){\n Ls line( a[0], a[1]);\n return line;\n}\nbool eq( P a, P b){ //OK\n return abs( a - b) < EPS;\n}\ndouble cross( P a, P b){ //OK\n return imag( conj(a) * b);\n}\ndouble dot( P a, P b){ //OK\n return real( conj(a) * b);\n}\nP projection( L l, P p) { //OK\n double t = dot( p - l[0], l[0] - l[1]) / norm( l[0] - l[1]);\n return l[0] + t * ( l[0] - l[1]);\n}\nP reflection( L l, P p) {\n return p + 2.0 * ( projection( l, p) - p);\n}\nint ccw( P a, P b, P c){ //OK\n b -= a, c -= a;\n if(cross(b,c) > 0) return +1; // a → b で 反時計方向におれて c\n if(cross(b,c) < 0) return -1; // a → b で 時計方向におれて c\n if(dot(b,c) < 0) return +2; // c -- a -- b\n if(norm(b) < norm(c)) return -2; // a -- b -- c\n return 0; // a -- c -- b\n}\nbool intersect( L a, L b){ //OK\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 intersect( L a, P p){ //OK\n return abs( a[0] - p) + abs( a[1] - p) - abs( a[1] - a[0]) < EPS;\n}\nbool intersect( Ls l, Ls m) { //OK\n return abs(cross(l.sc-l.fr, m.sc-m.fr)) > EPS ||\n abs(cross(l.sc-l.fr, m.fr-l.fr)) < EPS;\n}\nbool intersect(Ls l, L s) { //OK\n return cross( l.sc - l.fr, s[0] - l.fr) *\n cross( l.sc - l.fr, s[1] - l.fr) < EPS;\n}\nbool intersect(Ls l, P p) { //OK\n return abs( cross( l.sc - p, l.fr - p)) < EPS;\n}\nbool intersect( C c, Ls s){ //OK\n return distance( s, c.p) <= c.r + EPS;\n}\nbool intersect( C a, C b){ //OK\n return ( norm( a.p - b.p) - ( a.r + b.r) * ( a.r + b.r) < EPS) &&\n ( norm( a.p - b.p) - ( a.r - b.r) * ( a.r - b.r) > -EPS);\n}\nint intersect( C c, L l){ //OK\n if( norm( projection( l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n const double d1 = abs( c.p - l[0]), d2 = abs( c.p - l[1]);\n if( d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n if( d1 < c.r - EPS && d2 > c.r + EPS\n || d1 > c.r + EPS && d2 < c.r - EPS ) return 1;\n const P h = projection( l, c.p);\n if( dot( l[0] - h, l[1] - h) < 0) return 2;\n return 0;\n}\nbool intersect( C c, P p){ //OK\n return abs( abs( p - c.p) - c.r ) < EPS;\n}\ndouble distance( L s, P p){ //OK\n P r = projection(s, p);\n if ( intersect( s, r)) return abs( r - p);\n return min( abs( s[0] - p), abs( s[1] - p));\n}\ndouble distance( L a, L b){ //OK\n if(intersect( a, b)) return 0;\n return min( min( distance( a, b[0]), distance( a, b[1])),\n min( distance( b, a[0]), distance( b, a[1])));\n}\ndouble distance( Ls l, P p) { //OK\n return abs(p - projection( llcomb(l), p));\n}\ndouble distance( Ls l, Ls m) { //OK\n return intersect( l, m) ? 0 : distance( l, m.fr);\n}\ndouble distance( Ls l, L s) { //OK\n if (intersect(l, s)) return 0;\n return min(distance(l, s[0]), distance(l, s[1]));\n}\ndouble distance( P a, P b){ //OK\n return abs( a - b);\n}\nbool parallel( L a, L b){\n return abs( cross( a[1] - a[0], b[1] - b[0])) < EPS;\n}\nbool orthogonal( L a, L b){\n return dot( a[0] - a[1], b[0] - b[1]) < EPS;\n}\n#define curr(P,i) P[i]\n#define next(P,i) P[(i+1)%P.size()]\n#define prev(P,i) P[(i+P.size()-1) % P.size()]\nenum { OUT, ON, IN };\nint contains(G Q, P p){ //OK\n bool in = false;\n for(int i = 0 ; i < Q.size() ; i++ ){\n P a = curr(Q,i) - p, b = next(Q,i) - p;\n if(imag(a) > imag(b)) swap(a,b);\n if(imag(a) <= 0 && 0 < imag(b) && 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}\nbool contains(C c,P p){\n return abs( c.p - p) < c.r + EPS;\n}\ndouble area2(G p){ //OK\n double A = 0;\n for (int i = 0; i < p.size(); ++i){\n A += cross(curr(p, i), next(p, i));\n \n cout << cross(curr(p,i),next(p,i)) << endl;\n }\n return A;\n}\nbool isconvex(G p) { // OK\n for (int i = 0; i < p.size(); ++i){\n if (ccw(prev(p, i), curr(p, i), next(p, i)) > 0) return false;\n }\n return true;\n}\nPs convex(Ps ps) { //n>=3 OK\n int k = 0;\n sort(ps.begin(), ps.end());\n Ps ch(2 * ps.size());\n for (int i = 0; i < ps.size(); ch[k++] = ps[i++]){\n while (k >= 2 and ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n }\n for (int i = ps.size()-2, t = k+1; i >= 0; ch[k++] = ps[i--]){\n while (k >= t and ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n }\n ch.resize(k-1);\n return ch;\n}\nP crosspoint(L l, L m) { //OK\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 if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\n return m[0] + B / A * (m[1] - m[0]);\n}\nL crosspoint( C c, Ls l) { //OK\n const P hp = projection( llcomb(l), c.p), h = hp - c.p;\n const double d2 = norm(h);\n P v = sqrt( c.r * c.r - d2) * ( l.sc - l.fr) / abs( l.sc - l.fr);\n return L(hp - v, hp + v);\n}\nL crosspoint( C c, L l) { //OK\n if(intersect(c, l) == 2) return crosspoint(c, llrcomb(l));\n L ret = crosspoint(c, llrcomb(l));\n if(dot(l[0] - ret[0], l[1] - ret[0]) < 0) ret[1] = ret[0];\n else ret[0] = ret[1];\n return ret;\n}\nL crosspoint(C c1, C c2){ //OK\n double d = abs(c1.p - c2.p);\n double s = (c1.r + c2.r + d) / 2;\n double S = sqrt( s * ( s - c1.r) * ( s - c2.r) * ( s - d));\n double h = 2 * S / d;\n P v = ( c2.p - c1.p) / ( abs( c2.p - c1.p));\n double m = sqrt( c1.r * c1.r - h * h);\n return L( c1.p + m * v + h * v * P(0,1), c1.p + m * v - h * v * P(0,1));\n}\n\nint main(){\n int n, m;\n while(cin >> n, n){\n vector< C > cs(n);\n for(int i = 0 ; i < n ; i++ ){\n cin >> cs[i].p.real() >> cs[i].p.imag() >> cs[i].r;\n }\n L l;\n cin >> m;\n while(m--){\n cin >> l[0].real() >> l[0].imag() >> l[1].real() >> l[1].imag();\n bool flag = false;\n for(int i = 0 ; i < n ; i++ ){\n flag |= !!intersect( cs[i], l);\n }\n if(flag) cout << \"Safe\" << endl;\n else cout << \"Danger\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1256,
"score_of_the_acc": -0.3489,
"final_rank": 8
},
{
"submission_id": "aoj_0129_696611",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <vector>\n#include <string>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <functional>\n#include <utility>\n#include <numeric>\n#include <iterator>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int,int> PII;\ntypedef vector<PII> VPII;\ntypedef istringstream ISS;\ntypedef ostringstream OSS;\n\n#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )\n#define FOR( v, c ) for ( auto &v : c )\n#define EACH( it, c ) for ( auto it = c.begin(); it != c.end(); ++it )\n#define ALL( c ) (c).begin(), (c).end()\n#define DRANGE( c, p ) (c).begin(), (c).begin() + p, (c).end()\n\n#define PB( n ) push_back( n )\n#define MP( a, b ) make_pair( ( a ), ( b ) )\n#define EXIST( c, e ) ( (c).find( e ) != (c).end() )\n\n#define fst first\n#define snd second\n\n#define DUMP( x ) cerr << #x << \" = \" << ( x ) << endl\n#define DEBUG( x ) cerr << __FILE__ << \":\" << __LINE__ << \": \" << #x << \" = \" << ( x ) << endl\n\n#include <complex>\ntypedef complex<double> Point;\nconst double EPS = 1e-8;\n\n// 入力ストリームから実数二つをとって Point へ\nistream& operator >> ( istream &s, Point &a )\n{\n\tdouble r, i;\n\ts >> r >> i;\n\ta = Point( r, i );\n\treturn s;\n}\n\n// 内積（ドット積）\ndouble dot( const Point &a, const Point &b )\n{\n\treturn a.real() * b.real() + a.imag() * b.imag();\n}\n\n// 外積（クロス積）\ndouble cross( const Point &a, const Point &b )\n{\n\treturn a.real() * b.imag() - a.imag() * b.real();\n}\n\n// 直線 ( p1, p2 ) と点 q の距離\n// include : cross\ndouble distance_line_point( const Point &p1, const Point &p2, const Point &q )\n{\n\treturn abs( cross( p2 - p1, q - p1 ) ) / abs( ( p2 - p1 ) );\n}\n\n// 線分 ( p1, p2 ) と点 q の距離\n// include : dot, distance_line_point\ndouble distance_segment_point( const Point &p1, const Point &p2, const Point q )\n{\n\tif ( EPS < dot( p2 - p1, q - p1 ) && EPS < dot( p1 - p2, q - p2 ) ) // 垂線が交わる\n\t{\n\t\treturn distance_line_point( p1, p2, q );\n\t}\n\telse\n\t{\n\t\treturn min( abs( p1 - q ), abs( p2 - q ) );\n\t}\n}\n\n// 線分 ( p1, p2 ) と円 ( q, r ) が交差するか\n// include : distance_segment_point\nbool segment_circle_intersect( const Point &p1, const Point &p2, const Point &q, const double r )\n{\n\tif ( abs( p1 - q ) + EPS < r && abs( p2 - q ) + EPS < r )\n\t{\n\t\treturn false;\n\t}\n\telse if ( r + EPS < abs( p1 - q ) && r + EPS < abs( p1 - q ) )\n\t{\n\t\treturn distance_segment_point( p1, p2, q ) <= r + EPS;\n\t}\n\telse\n\t{\n\t\treturn true;\n\t}\n};\n\nint main()\n{\n\tcin.tie( 0 );\n\tios::sync_with_stdio( false );\n\n\tfor ( int n; cin >> n, n; )\n\t{\n\t\tvector<Point> walls( n );\n\t\tvector<double> rs( n );\n\t\tREP( i, 0, n )\n\t\t{\n\t\t\tcin >> walls[i] >> rs[i];\n\t\t}\n\n\t\tint m;\n\t\tcin >> m;\n\t\tREP( i, 0, m )\n\t\t{\n\t\t\tPoint t, s;\n\t\t\tcin >> t >> s;\n\n\t\t\tbool safe = false;\n\t\t\tREP( j, 0, n )\n\t\t\t{\n\t\t\t\tsafe |= segment_circle_intersect( t, s, walls[j], rs[j] );\n\t\t\t}\n\t\t\tcout << ( safe ? \"Safe\" : \"Danger\" ) << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1252,
"score_of_the_acc": -0.3478,
"final_rank": 6
},
{
"submission_id": "aoj_0129_695825",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#define _USE_MATH_DEFINES\n#include<cmath>\n#include<vector>\n#include<map>\n#include<algorithm>\nusing namespace std;\n\n\n#define INF 1e+10\n#define EPS 1e-10\n#define EQ(a,b) (abs(a-b)<EPS)\n\n//ティツェツ、テ・ツキツョテ」ツつ津ィツ?εヲツ?ョテ」ツ?療」ツ?ヲティツカツウテ」ツ?療ァツョツ?\ndouble add(double a,double b){\n\tif(abs(a+b) < EPS*(abs(a)+abs(b)))return 0;\n\treturn a+b;\n}\nstruct P{//2テヲツャツ。テ・ツ?ε」ツδ凖」ツつッテ」ツδ暗」ツδォ\n\tdouble x,y;\n\tP(){}\n\tP(double x,double y):x(x),y(y){}\n\tP operator + (P p){\n\t\treturn P(add(x,p.x),add(y,p.y));\n\t}\n\tP operator - (P p){\n\t\treturn P(add(x,-p.x),add(y,-p.y));\n\t}\n\tP operator * (double d){\n\t\treturn P(x*d,y*d);\n\t}\n\tP operator / (double d){\n\t\treturn P(x/d,y/d);\n\t}\n\tdouble dot(P p){//テ・ツ??ァツゥツ?\n\t\treturn add(x*p.x,y*p.y);\n\t}\n\tdouble det(P p){//テ・ツ、ツ姪ァツゥツ?\n\t\treturn add(x*p.y,-y*p.x);\n\t}\n\tbool equal(P p){\n\t\treturn (x-p.x)*(x-p.x)+(y-p.y)*(y-p.y) < EPS*EPS;\n\t}\n};\n//typedef pair<P,P> Line;\n\n//テァツキツ堙・ツ按?1-p2テ、ツクツ甘」ツ?ォテァツつケqテ」ツ?古」ツ?づ」ツつ凝」ツ?凝・ツ按、テ・ツョツ?\nbool on_seg(P p1,P p2,P q){\n\treturn (p1-q).det(p2-q)==0 && (p1-q).dot(p2-q)<=0;\n}\n//テァツ崢エテァツキツ嗔1-p2テ」ツ?ィテァツ崢エテァツキツ嘔1-q2テ」ツ?ョテ、ツコツ、テァツつケ\nP intersection(P p1,P p2,P q1,P q2){\n\treturn p1+(p2-p1)*( (q2-q1).det(q1-p1)/(q2-q1).det(p2-p1) );\n}\n\n\n//テァツキツ堙・ツ按?1-p2テ」ツ?ィテァツキツ堙・ツ按?1-q2テ」ツ?古、ツコツ、テ・ツキツョテ」ツ?凖」ツつ凝」ツ??\nbool exist_intersection(P p1,P p2,P q1,P q2){\n\tif(on_seg(p1,p2,q1)||on_seg(p1,p2,q2)||on_seg(q1,q2,p1)||on_seg(q1,q2,p2))return true;\n\tif((p1-p2).det(q1-q2)==0 )return false;//テ・ツケツウティツ。ツ?\n\tP a=intersection(p1,p2,q1,q2);\n\treturn on_seg(p1,p2,a) && on_seg(q1,q2,a);\n}\n//テ・ツ篠淌ァツつケテ、ツクツュテ・ツソツε・ツ崢榲ィツサツ「\nP rotate(P p,double rad){\n\tdouble s=sin(rad),c=cos(rad);\n\treturn P(c*p.x-s*p.y, s*p.x+c*p.y);\n}\n//originテ」ツつ津、ツクツュテ・ツソツε」ツ?ォテ・ツ崢榲ィツサツ「\nP rotate(P p,double rad,P origin){\n\treturn origin + rotate(p - origin,rad);\n}\n//テ、ツコツ古ァツつケテゥツ鳴禿」ツ?ョティツキツ敕ゥツ崢「\ndouble dist(P p,P q){\n\tp = p-q;\n\treturn sqrt(p.x*p.x+p.y*p.y);\n}\n//テ・ツ債佚、ツスツ催」ツδ凖」ツつッテ」ツδ暗」ツδォテ」ツ?ォテ・ツ、ツ嘉ヲツ渉?\nP to_unit(P p){\n\tdouble d = sqrt(p.x*p.x+p.y*p.y);\n\treturn p/d;\n}\n//テ・ツ??・ツ青古・ツ」ツォテ」ツ?ョテ、ツコツ、テァツつケテ」ツつ津ィツィツ暗ァツョツ?\npair<P,P> circle_intersection(double x1,double y1,double r1,double x2,double y2,double r2){\n\tdouble rad = atan2(y2-y1,x2-x1);\n\tx2 -= x1;\n\ty2 -= y1;\n\tP tmp = rotate(P(x2,y2),-rad);\n\tx2 = tmp.x;\n\ty2 = tmp.y;\n\tdouble x = (r1*r1-r2*r2+x2*x2)/(2*x2);\n\tif(abs(r1) < abs(x))return make_pair(P(0,0),P(0,0));//テ、ツコツ、テァツつケテ」ツ?ェテ」ツ??\n\tdouble y = sqrt(r1*r1-x*x);\n\treturn make_pair( P(x1,y1)+rotate(P(x,y),rad) , P(x1,y1)+rotate(P(x,-y),rad) );\n}\n//2テァツつケテ」ツつ津ゥツ?堙」ツつ凝・ツ債甘・ツセツвテ」ツ?ョテ・ツ??」ツ?ョテ、ツクツュテ・ツソツε・ツコツァテヲツィツ?\nvector<P> circle_on_2P(P p,P q,double r){\n\tvector<P> res; \n\tif(2*r+EPS < dist(p,q))return res;//ティツァツ」テ」ツ?ェテ」ツ??\n\tif(q.x < p.x)swap(p,q);\n\tq = q - p;\n\tdouble rad = atan2(q.y,q.x);\n\tP tmp = rotate(q,-rad);\n\tdouble x = tmp.x/2;\n\tdouble y = sqrt(4*r*r-tmp.x*tmp.x)/2;\n\tP a = p+rotate(P(x,y),rad) , b = p+rotate(P(x,-y),rad);\n\tres.push_back(a);\n\tif(!a.equal(b))res.push_back(b);\n\treturn res;\n}\n//テァツキツ堙・ツ按?」ツ?ィテァツつケテ」ツ?ョティツキツ敕ゥツ崢「\ndouble dist_LP(P p1,P p2,P q){\n\tdouble dx,dy;\n\tdx = p1.x-p2.x;\n\tdy = p1.y-p2.y;\n\tdouble d = min(dist(p1,q) ,dist(p2,q));\n\tpair<P,P> normal = make_pair(q+to_unit(P(-dy,dx))*d ,q+to_unit(P(dy,-dx))*d);//テヲツウツ陛ァツキツ堙」ツδ凖」ツつッテ」ツδ暗」ツδォ\n\tif(exist_intersection(p1,p2,normal.first,normal.second)){\n\t\treturn dist(q, intersection(p1,p2,normal.first,normal.second));\n\t}\n\treturn d;\n}\n//テァツキツ堙・ツ按?ゥツ鳴禿」ツ?ョティツキツ敕ゥツ崢「\ndouble dist_LL(P p1,P p2,P q1,P q2){\n\tif(exist_intersection(p1,p2,q1,q2))return 0;\n\treturn min( min(dist_LP(p1,p2,q1),dist_LP(p1,p2,q2))\n\t\t,min(dist_LP(q1,q2,p1),dist_LP(q1,q2,p2)) );\n}\n//テ」ツδゥテ」ツつクテ」ツつ「テ」ツδウテ」ツ?ォテ・ツ、ツ嘉ヲツ渉?\ndouble radian(double angle){\n\treturn angle/180.0*M_PI;\n}\n//テァツつケpテ」ツつ津ゥツ?堙」ツつ凝・ツ??」ツ?ョテヲツ篠・テァツキツ?\npair<P,P> tangent_CP(double x,double y,double r,P p){\n\t//P q(x,y), m((x+p.x)/2,(y+p.y)/2);\n\tdouble d=sqrt((x-p.x)*(x-p.x)+(y-p.y)*(y-p.y))/2;\n\treturn circle_intersection(x,y,r,(x+p.x)/2,(y+p.y)/2,d);\n}\n\nint main(){\n\tint n;\n\tP w[100];\n\tdouble r[100];\n\twhile(cin>>n,n){\n\t\tvector<P> wall;\n\t\tP p,q;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>w[i].x>>w[i].y>>r[i];\n\t\t}\n\t\tint m;\n\t\tcin>>m;\n\t\twhile(m--){\n\t\t\tP p,q;\n\t\t\tcin>>p.x>>p.y>>q.x>>q.y;\n\t\t\tbool f=false;\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tdouble d1,d2;\n\t\t\t\td1=dist(p,w[i]);\n\t\t\t\td2=dist(q,w[i]);\n\t\t\t\tif(d1<r[i] && r[i]<d2)f=true;\n\t\t\t\tif(r[i]<d1+EPS && d2<r[i]+EPS)f=true;\n\t\t\t\tif(r[i]<d1+EPS && r[i]<d2+EPS){\n\t\t\t\t\tif(dist_LP(p,q,w[i])<r[i]+EPS)f=true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<(f?\"Safe\":\"Danger\")<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1232,
"score_of_the_acc": -0.3807,
"final_rank": 9
},
{
"submission_id": "aoj_0129_695761",
"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#include <complex>\nint sign(double x){\n if(x > EPS) return 1;\n if(x < -EPS) return -1;\n return 0;\n}\ntypedef complex<double> Point;\nstruct Line : public vector<Point> {\n Line(const Point& a, const Point& b){\n push_back(a); push_back(b);\n }\n Point vector() const {\n return back() - front();\n }\n};\nstruct Circle{\n Point c;\n double r;\n Circle() {}\n Circle(Point c, double r) : c(c), r(r) {}\n};\n\ndouble dot(Point a, Point b){\n return real(conj(a) * b);\n}\ndouble cross(Point a, Point b){\n return imag(conj(a) * b);\n}\n\nint ccw(Point a, Point b, Point 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) < 0) return +2;\n if(norm(b) < norm(c)) return -2;\n return 0;\n}\n\n\nbool intersectSP(const Line& s, const Point& p){\n return ccw(s[0], s[1], p) == 0;\n}\n\nPoint projection(const Line& l, const Point& p){\n double t = dot(p - l[0], l.vector()) / norm(l.vector());\n return l[0] + t * l.vector();\n}\n\ndouble distanceSP(const Line& s, const Point& p){\n const Point r = projection(s, p);\n if(intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\n\nenum{ OUT, ON, IN };\nint contains(const Circle& C, const Point& p){\n double d = abs(C.c - p);\n if(sign(d - C.r) > 0) return OUT;\n if(sign(d - C.r) == 0) return ON;\n return IN;\n}\n\nbool intersectCS(const Circle& C, const Line& l){\n int b[2];\n REP(i, 2) b[i] = contains(C, l[i]);\n if(b[0] > b[1]) swap(b[0], b[1]);\n if(b[0] == OUT && b[1] == IN) return true;\n if(b[0] == IN && b[1] == IN) return false;\n if(b[0] == ON) return true;\n double d = distanceSP(l, C.c);\n if(sign(d - C.r) > 0) return false;\n return true;\n}\n\nint main(){\n int N;\n while(cin >> N && N){\n vector<Circle> WALL(N);\n REP(i, N) cin >> WALL[i].c.real() >> WALL[i].c.imag() >> WALL[i].r;\n int M;\n cin >> M;\n Point p[2];\n REP(i, M){\n REP(j, 2) cin >> p[j].real() >> p[j].imag();\n bool danger = true;\n REP(j, N) if(intersectCS(WALL[j], Line(p[0], p[1]))) danger = false;\n if(danger) cout << \"Danger\" << endl;\n else cout << \"Safe\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1248,
"score_of_the_acc": -0.3467,
"final_rank": 5
},
{
"submission_id": "aoj_0129_344981",
"code_snippet": "#include <iostream>\n#include <complex>\n#include <vector>\n#include <algorithm>\n\n#define EPS 1e-7\n\nusing namespace std;\n\ntypedef complex<double> P;\n\nstruct L : public vector<P> {\n L(const P &a, const P &b){\n push_back(a);\n push_back(b);\n }\n};\n\nstruct C{\n P p;\n double r;\n C(const P &p, double r) : p(p), r(r) { }\n};\n\ndouble dot(const P &a, const P &b){\n return real(conj(a) * b);\n}\n\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\n\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\n\ndouble distanceSP(const L &s, const P &p) {\n const P r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\n\nint main(){\n int n,m; \n double x,y,r;\n double a,b;\n\n while(cin >> n && n){\n vector<C> circles;\n bool isok = false;\n for(int i=0;i<n;i++){\n cin >> x >> y >> r;\n circles.push_back(C(P(x,y), r));\n }\n cin >> m;\n for(int i=0;i<m;i++){\n isok = false;\n cin >> x >> y;\n cin >> a >> b;\n L line = L(P(x,y), P(a,b));\n for(int j=0;j<n;j++){\n if((abs(line[0]-circles[j].p) < circles[j].r &&\n abs(line[1]-circles[j].p) < circles[j].r) ||\n distanceSP(line, circles[j].p) > circles[j].r){\n }else{\n isok = true;\n }\n }\n if(isok){\n cout << \"Safe\" << endl;\n }else{\n cout << \"Danger\" << endl;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0129_230662",
"code_snippet": "#define _USE_MATH_DEFINES\n#include <iostream>\n#include <complex>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <string>\n#include <queue>\n#include <cmath>\n#include <math.h>\n#include <numeric>\n#include <list>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n#include <climits>\n#include <set>\n#include <memory.h>\n#include <memory>\n#include <cstdio>\n#include <cstdlib>\n#include <cctype>\n#include <cassert>\n#include <map>\n#include <cassert>\n#include <time.h>\n\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<int , P> PP;\ntypedef pair<int, string> Ps;\ntypedef vector<int> vec;\ntypedef vector<vec> mat;\nconst int INF= 1 << 30;\nconst double EPS = 1e-9;\nconst double PI = 3.1415926535897932384626433832795;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n\ndouble cross(const xy_t &a, const xy_t &b){\n\treturn imag(conj(a) * b);\n}\n\ndouble dot(const xy_t &a, const xy_t &b){\n\treturn real(conj(a) * b);\n}\n\nxy_t projection(const line &l, const xy_t &p){\n\tdouble t = dot(p - l.first, l.first - l.second) / norm(l.first - l.second);\n\treturn l.first + t * (l.first - l.second);\n}\n\nbool intersectSP(const line &l, const xy_t &p){\n\treturn abs(l.first- p) + abs(l.second - p) - abs(l.first - l.second) < EPS;\n}\n\ndouble distanceSP(line s, xy_t p){\n\tconst xy_t r = projection(s, p);\n\tif(intersectSP(s, r)) return abs(r - p);\n\treturn min(abs(s.first - p), abs(s.second - p));\n}\n\nxy_t center[200];\ndouble r[200];\n\nint main(){\n\tint n, m;\n\tdouble wx, wy, tx, ty, sx, sy;\n\twhile(cin >> n && n){\n\t\trep(i, n){\n\t\t\tcin>> wx >> wy >> r[i];\n\t\t\tcenter[i] = xy_t(wx, wy);\n\t\t}\n\t\tcin >> m;\n\t\trep(i, m){\n\t\t\tcin >> tx >> ty >> sx >> sy;\n\t\t\tline ls = line(xy_t(tx, ty), xy_t(sx, sy));\n\t\t\tbool ok = true;\n\t\t\trep(j, n){\n\t\t\t\tif(distanceSP(ls, center[j]) < r[j] + EPS &&\n\t\t\t\t\tmax(abs(center[j] - ls.first), abs(center[j] - ls.second)) > r[j] - EPS){\n\t\t\t\t\t\t//cout << center[j] << \" \" << distanceSP(ls, center[j]) << endl;\n\t\t\t\t\t\tok = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!ok) cout << \"Safe\" << endl;\n\t\t\telse cout << \"Danger\" << endl;\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_0129_174134",
"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>\nusing namespace std;\nstatic const double EPS = 1e-8;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rev(i,n) for(int i=n-1;i>=0;i--)\n#define sz(a) a.size()\n#define all(a) a.begin(),a.end()\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SS stringstream\n#define DBG1(a) rep(_X,sz(a)){printf(\"%d \",a[_X]);}puts(\"\");\n#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf(\"%d \",a[_X][_Y]);puts(\"\");}\n#define bitcount(b) __builtin_popcount(b)\n#define REP(i, s, e) for ( int i = s; i <= e; i++ ) \n\nconst double INF = 1e12;\ntypedef complex<double> P,point;\ntypedef vector<P> G,polygon;\nnamespace std {bool operator < (const P& a, const P& b) {return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);}}\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> {L(const P &a, const P &b) {push_back(a); push_back(b);}};\nstruct C {P p; double r;C(const P &p, double r) : p(p), r(r) { }};\nint ccw(P a, P b, P c) {b -= a; c -= a;if (cross(b, c) > 0) return +1;if (cross(b, c) < 0) return -1;if (dot(b, c) < 0) return +2;if (norm(b) < norm(c)) return -2;return 0;}\n\n// Check Funcs //\nbool intersectLL(const L &l, const L &m) {return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || abs(cross(l[1]-l[0], m[0]-l[0])) < EPS;}\nbool intersectLS(const L &l, const L &s) {return cross(l[1]-l[0], s[0]-l[0])*cross(l[1]-l[0], s[1]-l[0]) < EPS;}\nbool intersectLP(const L &l, const P &p) {return abs(cross(l[1]-p, l[0]-p)) < EPS;}\nbool intersectSS(const L &s, const L &t) {return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 && ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;}\nbool intersectSP(const L &s, const P &p) {return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS;}\n\n// Where is Point in Polygon? //\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nenum { OUT, ON, IN };\nint contains(const polygon& P, const point& p) {bool in = false;for (int i = 0; i < P.size(); ++i) {point a = curr(P,i) - p, b = next(P,i) - p;if (imag(a) > imag(b)) swap(a, b);if (imag(a) <= 0 && 0 < imag(b))if (cross(a, b) < 0) in = !in;if (cross(a, b) == 0 && dot(a, b) <= 0) return ON;}return in ? IN : OUT;}\n// Area of Polygon //\ndouble area2(const polygon& P) {double A = 0;for (int i = 0; i < P.size(); ++i)A += cross(curr(P, i), next(P, i));return A;}\n// Totsuhou! Andrew's Monotone Chain //\nvector<point> convex_hull(vector<point> ps) {int n = ps.size(), k = 0;sort(ps.begin(), ps.end());vector<point> ch(2*n);for (int i = 0; i < n; ch[k++] = ps[i++])while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--])while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;ch.resize(k-1);return ch;}\n\nP projection(const L &l, const P &p) {double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);return l[0] + t*(l[0]-l[1]);}\nP reflection(const L &l, const P &p) {return p + 2.0 * (projection(l, p) - p);}\ndouble distanceLP(const L &l, const P &p) {return abs(p - projection(l, p));}\ndouble distanceLL(const L &l, const L &m) {return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);}\ndouble distanceLS(const L &l, const L &s) {if (intersectLS(l, s)) return 0;return min(distanceLP(l, s[0]), distanceLP(l, s[1]));}\ndouble distanceSP(const L &s, const P &p) {const P r = projection(s, p);if (intersectSP(s, r)) return abs(r - p);return min(abs(s[0] - p), abs(s[1] - p));}\ndouble distanceSS(const L &s, const L &t) {if (intersectSS(s, t)) return 0; return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),min(distanceSP(t, s[0]), distanceSP(t, s[1])));}\nP crosspoint(const L &l, const L &m) {double A = cross(l[1] - l[0], m[1] - m[0]);double B = cross(l[1] - l[0], l[1] - m[0]);if (abs(A) < EPS && abs(B) < EPS) return m[0];return m[0] + B / A * (m[1] - m[0]);}\n\nP getPedal(L l, P p){\n\tdouble A;\n\tif(abs(l[1].real()-l[0].real()) < EPS){\n\t\treturn P(l[1].real(),p.imag());\n\t}else{\n\t\tA = (l[1].imag()-l[0].imag())/(l[1].real()-l[0].real());\n\t}\n\tdouble a = -A , b = 1 , c = A*l[0].real() - l[0].imag();\n\tdouble t = (a*p.real() + b*p.imag() + c)/(a*a+b*b);\n\treturn p-t * P(a,b);\n}\n\nvector<P> crosspointCL(const L l, const C c){\n\tvector<P> ret;\n\tP p = getPedal(l,c.p);\n\n\tif( (abs(c.p-l[0]) < c.r+EPS && abs(c.p-l[1]) < c.r+EPS) &&\n\t\tabs(l[1]-l[0]) < c.r+EPS\n\t){\n\t\t\tfor(int i=0;i<3;i++)ret.push_back(P(0,0));\n\t\t\treturn ret;\n\t}\n\t\n\tif(\tabs(p-c.p) > c.r+EPS)return ret;\n\tP e = P((l[1]-l[0])/abs(l[1]-l[0]));\n\tdouble S = sqrt(c.r*c.r-abs(p-c.p)*abs(p-c.p));\n\tret.push_back(p+S*e);\n\tret.push_back(p-S*e);\n\treturn ret;\n}\nint main(){\n\tint n;\n\twhile(cin >> n , n){\n\t\tvector<C> wall;\n\t\trep(i,n){\n\t\t\tdouble x,y,r;\n\t\t\tcin >> x >> y >> r;\n\t\t\twall.push_back(C(P(x,y),r));\n\t\t}\n\t\tint m; cin >> m;\n\t\trep(i,m){\n\t\t\tdouble x1,y1,x2,y2;\n\t\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\t\tP hero(x1,y1) , enemy(x2,y2);\n\t\t\t//cout << hero << \" \" << enemy << endl;\n\t\t\tL line(hero,enemy);\n\t\t\tbool f = false;\n\t\t\trep(i,wall.size()){\n\t\t\t\tvector<P> get = crosspointCL(line,wall[i]);\n\t\t\t\tif(get.size() != 3){\n\t\t\t\t\trep(j,get.size()){\n\t\t\t\t\t\t//cout << get[j] << endl;\n\t\t\t\t\t\tif(min(x1,x2) <= get[j].real() && get[j].real() <= max(x1,x2) && \n\t\t\t\t\t\t min(y1,y2) <= get[j].imag() && get[j].imag() <= max(y1,y2)\n\t\t\t\t\t\t){\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}\n\t\t\t}\n\t\t\tcout << (f?\"Safe\":\"Danger\") << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 984,
"score_of_the_acc": -0.2733,
"final_rank": 4
},
{
"submission_id": "aoj_0129_21608",
"code_snippet": "#include<vector>\n#include<complex>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n\nconst double EPS = 1e-8;\nconst double INF = 1e12;\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\n\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n};\n\ntypedef vector<P> G;\n\nstruct C {\n P p; double r;\n //C(const P &p, double r) : p(p), r(r) { }\n};\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\n\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\n\nbool inner(P &p, C &c){\n\treturn norm(p-c.p)<(c.r)*(c.r)+EPS;\n}\nint main(){\n\tint m,n;\n\tdouble t1, t2, t3, t4;\n\twhile(cin>>n,n){\n\t\tC wall[n];\n\t\trep(i,n)cin>>t1>>t2>>t3,wall[i].p=P(t1,t2),wall[i].r=t3;\n\t\tcin>>m;\n\t\trep(i,m){\n\t\t\tcin>>t1>>t2>>t3>>t4;\n\t\t\tP t=P(t1,t2),s=P(t3,t4),h,tmp;\n\t\t\tL l(t,s);\n\t\t\tbool danger=1;\n\t\t\trep(j,n){\n\t\t\t\th=projection(l,wall[j].p);\n\t\t\t\tif(intersectSP(l,h)){\n\t\t\t\t\ttmp=norm(t-wall[j].p)>norm(s-wall[j].p)?t:s;\n\t\t\t\t\tdanger=danger&&(inner(tmp,wall[j])==inner(h,wall[j]));\n\t\t\t\t}else{\n\t\t\t\t\tdanger=danger&&(inner(t,wall[j])==inner(s,wall[j]));\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<(danger?\"Danger\":\"Safe\")<<endl;\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
}
] |
aoj_0128_cpp
|
そろばん
そろばんを習い始める友人からのお願いで、あなたはそろばんの珠の並び
を表示するプログラムを作成することになりました。ある数字を入力として、そろばんの珠の並びを出力するプログラムを作成してください。ただし、表示するそろばんの桁数は 5 桁とし、0 から 9 までの珠の配置はそれぞれ '
*
' (半角アスタリスク)、'
' (半角空白)、'
=
' (半角イコール) を用いて以下のように表すものとします。
Input
複数のテストケースが与えられます。各テストケースとして 5 桁までの数字（整数）が １ 行に与えられます。
テストケースの数は 1024 を超えません。
Output
各テストケースついてそろばんの珠の配置を出力してください。テストケースの間に１行の空行を入れてください。
Sample Input
2006
1111
Output for the Sample Input
****
*
=====
* *
****
* ***
*****
*****
*****
=====
****
*
*****
*****
*****
|
[
{
"submission_id": "aoj_0128_1988426",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n\tbool f=false;\n\tint n,i,j;\n\tint a[6];\n\tchar a0[11][10]={\"* = ****\",\"* =* ***\",\"* =** **\",\"* =*** *\",\"* =**** \",\" *= ****\",\" *=* ***\",\" *=** **\",\" *=*** *\",\" *=**** \"};\n\twhile(cin>>n){\n\t\tif(f==true) {cout<<endl;}\n\ta[0]=n/10000;\n\ta[1]=(n-a[0]*10000)/1000;\n\ta[2]=(n-a[0]*10000-a[1]*1000)/100;\n\ta[3]=(n-a[0]*10000-a[1]*1000-a[2]*100)/10;\n\ta[4]=(n-a[0]*10000-a[1]*1000-a[2]*100-a[3]*10);\n\tfor(i=0;i<8;i++){\n\t\tfor(j=0;j<5;j++){\n\t\t\tcout<<a0[a[j]][i];\n\t\t}\n\t\tcout<<endl;\n\t}\n\tf=true;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0128_1980554",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <numeric>\n#include <utility>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s << endl; }\n\nstring str;\nchar res[8][5];\n\nstring conv[10] = {\n \"* = ****\",\n \"* =* ***\",\n \"* =** **\",\n \"* =*** *\",\n \"* =**** \",\n \" *= ****\",\n \" *=* ***\",\n \" *=** **\",\n \" *=*** *\",\n \" *=**** \"\n};\n\nint main() {\n bool start = true;\n while (cin >> str) {\n if (!start) cout << endl;\n while (str.size() < 5) str = \"0\" + str;\n for (int i = 0; i < 5; ++i) {\n int j = str[i] - '0';\n for (int k = 0; k < conv[j].size(); ++k) {\n\tres[k][i] = conv[j][k];\n }\n }\n for (int i = 0; i < 8; ++i) {\n for (int j = 0; j < 5; ++j) {\n\tcout << res[i][j];\n }\n cout << endl;\n }\n start = false;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.6,
"final_rank": 11
},
{
"submission_id": "aoj_0128_1958772",
"code_snippet": "#include<iostream>\n#include<string>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\nusing namespace std;\n\nstring num[10]={\"* = ****\",\"* =* ***\",\"* =** **\",\"* =*** *\",\"* =**** \",\" *= ****\",\" *=* ***\",\" *=** **\",\" *=*** *\",\" *=**** \"};\n\nint main(){\n\tstring s;\n\tint cnt=0;\n\twhile(cin>>s){\n\t\tif(cnt>0)cout<<endl;\n\t\tif(s.size()<5){\n\t\t\twhile(s.size()<5){\n\t\t\t\ts='0'+s;\n\t\t\t}\n\t\t}\n\t\trep(i,8){\n\t\t\tstring temp=\"\";\n\t\t\trep(j,s.size()){\n\t\t\t\ttemp+=num[s[j]-'0'][i];\n\t\t\t}\n\t\t\tcout<<temp<<endl;\n\t\t}\n\t\tcnt++;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.6,
"final_rank": 11
},
{
"submission_id": "aoj_0128_1954521",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nstring s[10]={\"* = ****\",\"* =* ***\",\"* =** **\",\"* =*** *\",\"* =**** \",\" *= ****\",\" *=* ***\",\" *=** **\",\" *=*** *\",\" *=**** \"};\nint main(){\n\tstring d;\n\tint c[5];\n\tbool first=true;\n\twhile(cin>>d){\n\t\tif(!first)cout<<endl;\n\t\tfirst=false;\n\t\tfor(int i=0;i<5;i++)c[i]=0;\n\t\tfor(int i=0;i<d.size();i++)c[5-d.size()+i]=d[i]-'0';\n\t\tfor(int i=0;i<8;i++){for(int j=0;j<5;j++)cout<<s[c[j]][i];cout<<endl;}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1184,
"score_of_the_acc": -0.5333,
"final_rank": 7
},
{
"submission_id": "aoj_0128_1954517",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nstring s[10]={\n\t\"* = ****\",\n\t\"* =* ***\",\n\t\"* =** **\",\n\t\"* =*** *\",\n\t\"* =**** \",\n\t\" *= ****\",\n\t\" *=* ***\",\n\t\" *=** **\",\n\t\" *=*** *\",\n\t\" *=**** \"\n};\nint main(){\n\tstring d;\n\tint c[5];\n\tbool first=true;\n\twhile(cin>>d){\n\t\tif(!first)cout<<endl;\n\t\tfirst=false;\n\t\tfor(int i=0;i<5;i++)c[i]=0;\n\t\tfor(int i=0;i<d.size();i++)c[5-d.size()+i]=d[i]-'0';\n\t\tfor(int i=0;i<8;i++){\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tcout<<s[c[j]][i];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1184,
"score_of_the_acc": -0.5333,
"final_rank": 7
},
{
"submission_id": "aoj_0128_1856514",
"code_snippet": "#include <iostream>\n#include <cstdio>\nusing namespace std;\n\nint main(void)\n{\n\tchar abacus[8][11] = {\n\t\t\"***** \",\n\t\t\" *****\",\n\t\t\"==========\",\n\t\t\" **** ****\",\n\t\t\"* **** ***\",\n\t\t\"** **** **\",\n\t\t\"*** **** *\",\n\t\t\"**** **** \",\n\t};\n\t\n\tint n;\n\tbool flag = false;\n\twhile (scanf(\"%d\", &n) != EOF){\n\t\tint num[5];\n\t\tchar a[8][5];\n\t\tfor (int i = 0; i < 5; i++){\n\t\t\tnum[4 - i] = n % 10;\n\t\t\tn /= 10;\n\t\t}\n\t\tfor (int i = 0; i < 8; i++){\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\ta[i][j] = abacus[i][num[j]];\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (flag){\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < 8; i++){\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tcout << a[i][j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\tflag = true;\n\t}\n\t\n\treturn (0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.8,
"final_rank": 15
},
{
"submission_id": "aoj_0128_1847484",
"code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\n\nstring f[10] = {\n\t\"* = ****\",\n\t\"* =* ***\",\n\t\"* =** **\",\n\t\"* =*** *\",\n\t\"* =**** \",\n\t\" *= ****\",\n\t\" *=* ***\",\n\t\" *=** **\",\n\t\" *=*** *\",\n\t\" *=**** \"\n};\n\nint main(){\n\tstring s;\n\tbool flag = false;\n\n\twhile( cin >> s ){\n\t\tstring ans[10];\n\t\tif( flag ){\n\t\t\tcout << endl;\n\t\t}else{\n\t\t\tflag = true;\n\t\t}\n\t\twhile( s.size() < 5 ){\n\t\t\ts = \"0\" + s;\n\t\t}\n\n\t\tfor(int i=0 ; i < s.size() ; i++ ){\n\t\t\tans[i] = f[s[i]-'0'];\n\t\t}\n\t\tfor(int x=0 ; x < 8 ; x++ ){\n\t\t\tfor(int y=0 ; y < s.size() ; y++ ){\n\t\t\t\tcout << ans[y][x];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.6,
"final_rank": 11
},
{
"submission_id": "aoj_0128_1772750",
"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\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 1000000007\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\n\nint n;\nstring s;\nstring table[] = { \"***** \", \" *****\", \"==========\",\n\" **** ****\", \"* **** ***\", \"** **** **\", \"*** **** *\", \"**** **** \" };\nbool f = 0;\n\nint main(){\n\twhile (cin >> s){\n\t\tif (f)cout << endl;\n\t\treverse(ALL(s));\n\t\tREP(i, 4){\n\t\t\tif (s.size() >= 5)break;\n\t\t\ts += \"0\";\n\t\t}\n\t\treverse(ALL(s));\n\t\tREP(i, 8){\n\t\t\tREP(j, s.size()){\n\t\t\t\tcout << table[i][s[j] - '0'];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\tf = 1;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1184,
"score_of_the_acc": -0.5333,
"final_rank": 7
},
{
"submission_id": "aoj_0128_1726894",
"code_snippet": "// 0128\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\n\nvoid abacus(int num[]){\n\tfor(int j=0;j<2;j++){\n\t\tfor(int i=0;i<5;i++)\n\t\t\tif((5*j <= num[i]) && (num[i] < 5*(j+1)))\n\t\t\t\tcout<<\"*\";\n\t\t\telse\n\t\t\t\tcout<<\" \";\n\t\tcout<<endl;\n\t}\n\n\tfor(int i=0;i<5;i++)\n\t\tcout<<\"=\";\n\tcout<<endl;\n\n\tfor(int j=0;j<5;j++){\n\t\tfor(int i=0;i<5;i++)\n\t\t\tif(num[i]%5 == j)\n\t\t\t\tcout<<\" \";\n\t\t\telse\n\t\t\t\tcout<<\"*\";\n\t\tcout<<endl;\n\t}\n}\n\nint main(){\n\n\tint n, count = 0;\n\twhile(scanf(\"%d\", &n) != EOF){\n\t\tif(count != 0)\n\t\t\tcout<<endl;\n\n\t\tint num[5];\n\t\tfor(int i=0;i<5;i++){\n\t\t\tnum[4-i] = n%10;\n\t\t\tn /= 10;\n\t\t}\n\t\t\n\t\tabacus(num);\n\n\t\tcount++;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.8,
"final_rank": 15
},
{
"submission_id": "aoj_0128_1626426",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint a[5], b[5], c, cnt;\nint main() {\n\twhile (cin >> c) {\n\t\tif (cnt) { cout << endl; }\n\t\tcnt++;\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\ta[4 - i] = ((c / (int)pow(10, i)) % 10) / 5;\n\t\t\tb[4 - i] = (c / (int)pow(10, i)) % 5;\n\t\t}\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tif (a[i] == 0) {\n\t\t\t\tcout << '*';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tif (a[i] == 1) {\n\t\t\t\tcout << '*';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tcout << '=';\n\t\t}\n\t\tcout << endl;\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tif (b[i] != 0) {\n\t\t\t\tcout << '*';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tif (b[i] != 1) {\n\t\t\t\tcout << '*';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tif (b[i] != 2) {\n\t\t\t\tcout << '*';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tif (b[i] != 3) {\n\t\t\t\tcout << '*';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tif (b[i] != 4) {\n\t\t\t\tcout << '*';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.8,
"final_rank": 15
},
{
"submission_id": "aoj_0128_1582683",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <string>\n#include <map>\n#define rep(i, n) for (int i=0; i<n; i++)\nusing namespace std;\n\nstring inp, ans[8];\nmap<char, string> m;\n\nint main(void)\n{\n\tm['0'] = \"* = ****\";\n\tm['1'] = \"* =* ***\";\n\tm['2'] = \"* =** **\";\n\tm['3'] = \"* =*** *\";\n\tm['4'] = \"* =**** \";\n\tm['5'] = \" *= ****\";\n\tm['6'] = \" *=* ***\";\n\tm['7'] = \" *=** **\";\n\tm['8'] = \" *=*** *\";\n\tm['9'] = \" *=**** \";\n\n\tbool first = true;\n\n\twhile (cin >> inp)\n\t{\n\t\tif (first)\n\t\t{\n\t\t\tfirst = false;\n\t\t} else {\n\t\t\tcout << endl;\n\t\t}\n\n\t\tans[5] = \" \";\n\t\tans[6] = \" \";\n\t\tans[7] = \" \";\n\n\t\twhile (inp.length() < 5) inp = \"0\" + inp;\n\t\trep(i, 5) ans[i] = m[inp[i]];\n\t\t//rep(i, 5) cout << ans[i] << endl;\n\t\trep(i, 5)\n\t\t{\n\t\t\trep(j, 8)\n\t\t\t{\n\t\t\t\tif (j < 5 && i < j) continue;\n\t\t\t\tchar w = ans[i][j];\n\t\t\t\tans[i][j] = ans[j][i];\n\t\t\t\tans[j][i] = w;\n\t\t\t}\n\t\t}\n\t\trep(i, 8)\n\t\t{\n\t\t\trep(j, 5)\n\t\t\t{\n\t\t\t\tcout << ans[i][j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.6,
"final_rank": 11
},
{
"submission_id": "aoj_0128_1495147",
"code_snippet": "#include <iostream>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n \nusing namespace std;\n \n#define pb(n)\tpush_back(n)\n#define mp(n,m) make_pair(n,m)\n#define fi \tfirst\n#define se \tsecond\n#define all(r) (r).begin(),(r).end()\n\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define repc(i,a,b) for(int i=(a); i<(b); i++)\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n \nconst int IMAX=((1<<30)-1)*2+1;\nconst double EPS=1e-10;\n//int mod=1000000007\n\n\nstring s[10]={\n\t\"* = ****\",\n\t\"* =* ***\",\n\t\"* =** **\",\n\t\"* =*** *\",\n\t\"* =**** \",\n\t\" *= ****\",\n\t\" *=* ***\",\n\t\" *=** **\",\n\t\" *=*** *\",\n\t\" *=**** \"\n};\n\n\n\nint main(){\n\tint n;\n\t//string t;\n\tbool f=false;\n\twhile(cin>>n){\n\t\tif(f)cout<<endl;\n\t\telse f=true;\n\t\tfor(int i=0; i<8; i++){\n\t\t\tstring t;\n\t\t\tfor(int j=n; j>0; j/=10){\n\t\t\t\tt+=s[(j%10)][i];\n\t\t\t}\n\t\t\tfor(int j=t.size(); j<5; j++){\n\t\t\t\tt+=s[0][i];\n\t\t\t}\n\t\t\treverse(all(t));\n\t\t\tcout<<t<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1204,
"score_of_the_acc": -0.8667,
"final_rank": 19
},
{
"submission_id": "aoj_0128_1490236",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n\nint data[10][10]={ \t{1,0,2,0,1,1,1,1},\n\t\t\t\t\t{1,0,2,1,0,1,1,1},\n\t\t\t\t\t{1,0,2,1,1,0,1,1},\n\t\t\t\t\t{1,0,2,1,1,1,0,1},\n\t\t\t\t\t{1,0,2,1,1,1,1,0},\n\t\t\t\t\t{0,1,2,0,1,1,1,1},\n\t\t\t\t\t{0,1,2,1,0,1,1,1},\n\t\t\t\t\t{0,1,2,1,1,0,1,1},\n\t\t\t\t\t{0,1,2,1,1,1,0,1},\n\t\t\t\t\t{0,1,2,1,1,1,1,0},\n\t\t\t\t};\n\nint main(){\n\tstring n;\n\tint fie[8][5];\n\tbool f=false;\n\twhile(cin>>n){\n\t\tif(f)cout<<endl;\n\t\telse f=true;\n\t\trep(i,5)rep(j,8){\n\t\t\tfie[j][i]=data[0][j];\n\t\t}\n\t\tint len = n.size();\n\n\t\tfor(int i=5-len;i<5;i++){\n\t\t\trep(j,8){\n\t\t\t\tfie[j][i]=data[n[i-(5-len)]-'0'][j];\n\t\t\t}\n\t\t}\n\t\trep(i,8){\n\t\t\trep(j,5){\n\t\t\t\tif(fie[i][j]==1){\n\t\t\t\t\tcout<<'*';\n\t\t\t\t}else if(fie[i][j]==2){\n\t\t\t\t\tcout<<'=';\n\t\t\t\t}else cout<<' ';\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1172,
"score_of_the_acc": -0.3333,
"final_rank": 2
},
{
"submission_id": "aoj_0128_1467871",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <utility>\n#include <vector>\n#include <algorithm>\n#include <string>\nusing namespace std;\nstring num[10]={\n\t\"* = ****\",\n\t\"* =* ***\",\n\t\"* =** **\",\n\t\"* =*** *\",\n\t\"* =**** \",\n\t\" *= ****\",\n\t\" *=* ***\",\n\t\" *=** **\",\n\t\" *=*** *\",\n\t\" *=**** \",\n};\nint main()\n{\n int n;\n\tint a[5];\n\tbool first=true;\n\twhile(cin>>n){\n\t\tif(!first)cout<<endl;\n\t\ta[0]=n/10000;\n\t\ta[1]=(n/1000)%10;\n\t\ta[2]=(n/100)%10;\n\t\ta[3]=(n/10)%10;\n\t\ta[4]=n%10;\n\t\tfor(int i=0;i<8;i++){\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tcout<<num[a[j]][i];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t\tfirst=false;\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.8,
"final_rank": 15
},
{
"submission_id": "aoj_0128_1463316",
"code_snippet": "#include<iostream>\n#include<string>\n#include<sstream>\nusing namespace std;\n\nint main(){\n\tstring str;\n\tstring s[8];\n\ts[0] = \"***** \";\n\ts[1] = \" *****\";\n\ts[2] = \"==========\";\n\ts[3] = \" **** ****\";\n\ts[4] = \"* **** ***\";\n\ts[5] = \"** **** **\";\n\ts[6] = \"*** **** *\";\n\ts[7] = \"**** **** \";\n\tbool flag = false;\n\twhile(cin >> str){\n\t\tif(flag) cout << endl;\n\t\tint len = str.size();\n\t\tint num[5]={0};\n\t\tint cou=0;\n\t\tfor(int i=5-len;i<5;i++){\n\t\t\tstring tmp = \"\";\n\t\t\ttmp += str[cou];\n\t\t\tistringstream ss(tmp);\n\t\t\tss >> num[i];\n\t\t\tcou++;\n\t\t}\n\t\tfor(int i=0;i<8;i++){\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tcout << s[i][num[j]];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\tflag = true;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1212,
"score_of_the_acc": -1,
"final_rank": 20
},
{
"submission_id": "aoj_0128_1427172",
"code_snippet": "#include <iostream>\n#include <cstring>\n#include <cstdlib>\n#include <algorithm>\nusing namespace std;\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,b) FOR(i,0,b)\n#define PB push_back\n#define MP make_pair\nint main(){\n string data[10]={\"* = ****\",\"* =* ***\",\"* =** **\",\"* =*** *\",\"* =**** \",\" *= ****\",\" *=* ***\",\" *=** **\",\" *=*** *\",\" *=**** \"};\n string s;\n int n=0;\n while(cin>>s){\n if(n!=0)cout<<endl;\n n=1;\n string ans[5];\n for(int i=0;i<5-s.size();i++)ans[i]=\"* = ****\";\n int k=5-s.size();\n for(int i=0;i<s.size();i++){\n ans[k]=data[s[i]-'0'];\n k++;\n }\n for(int i=0;i<8;i++){\n for(int j=0;j<5;j++){\n cout<<ans[j][i];\n }\n cout<<endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1184,
"score_of_the_acc": -0.5333,
"final_rank": 7
},
{
"submission_id": "aoj_0128_1404351",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n string s;\n bool flag=false;\n while(cin>> s){\n int ban[8][5]={0}; //0が空白,1がアスタリスク,2が=\n for(int i=0;i<8;i++){\n if(i==0 || i==4 || i==5 || i==6 || i==7){\n\tfor(int j=0;j<5;j++){\n\t ban[i][j]=1;\n\t}\n }\n else if(i==2){\n\tfor(int j=0;j<5;j++){\n\t ban[i][j]=2;\n\t}\n }\n }\n\n for(int i=0;i<s.size();i++){\n int x=i+(5-s.size());\n if(s[i]=='1'){\n\tban[3][x]=1; ban[4][x]=0;\n }\n else if(s[i]=='2'){\n\tban[3][x]=1; ban[5][x]=0;\n }\n else if(s[i]=='3'){\n\tban[3][x]=1; ban[6][x]=0;\n }\n else if(s[i]=='4'){\n\tban[3][x]=1; ban[7][x]=0;\n }\n else if(s[i]=='5'){\n\tban[1][x]=1; ban[0][x]=0;\n }\n else if(s[i]=='6'){\n\tban[1][x]=1; ban[0][x]=0;\n\tban[3][x]=1; ban[4][x]=0;\n }\n else if(s[i]=='7'){\n\tban[1][x]=1; ban[0][x]=0;\n\tban[3][x]=1; ban[5][x]=0;\n }\n else if(s[i]=='8'){\n\tban[1][x]=1; ban[0][x]=0;\n\tban[3][x]=1; ban[6][x]=0;\n }\n else if(s[i]=='9'){\n\tban[1][x]=1; ban[0][x]=0;\n\tban[3][x]=1; ban[7][x]=0;\n }\n }\n if(flag)\n cout<< endl;\n for(int i=0;i<8;i++){\n for(int j=0;j<5;j++){\n\t//cout<< ban[i][j];\n\tif(ban[i][j]==0) cout<< \" \";\n\telse if(ban[i][j]==1) cout<< '*';\n\telse if(ban[i][j]==2) cout<< '=';\n }\n cout<< endl;\n }\n flag=true;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1176,
"score_of_the_acc": -0.4,
"final_rank": 4
},
{
"submission_id": "aoj_0128_1279515",
"code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\n#define rep2(x,from,to) for(int x=(from);x<(to);++(x))\n#define rep(x,to) rep2(x,0,to)\nint main() {\n\tstring n;\n\tbool p = 0;\n\twhile(cin >> n) {\n\t\tif(p) cout << endl;\n\t\tp = 1;\n\t\tint k = n.length();\n\t\tstring ans[8][5];\n\t\trep(i,8) {\n\t\t\trep(j,5) {\n\t\t\t\tif(i==2) ans[i][j] = '=';\n\t\t\t\telse if(i==1||i==3) ans[i][j] = ' ';\n\t\t\t\telse ans[i][j] = '*';\n\t\t\t}\n\t\t}\n\t\trep(i,k) {\n\t\t\tint m = n[i]-'0';\n\t\t\tif(m>=5) swap(ans[0][i+5-k], ans[1][i+5-k]);\n\t\t\trep(j,m%5) swap(ans[3+j][i+5-k],ans[4+j][i+5-k]);\n\t\t}\n\t\trep(i,8) {\n\t\t\trep(j,5) {\n\t\t\t\tcout << ans[i][j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1176,
"score_of_the_acc": -0.4,
"final_rank": 4
},
{
"submission_id": "aoj_0128_1267720",
"code_snippet": "#include<stdio.h>\n#include<string>\n#include<iostream>\nusing namespace std;\n\nint main(){\nstring str;\n\nchar ch[10][6];\nchar n1[10]=\"* =* ***\";\nchar n2[10]=\"* =** **\";\nchar n3[10]=\"* =*** *\";\nchar n4[10]=\"* =**** \";\nchar n5[10]=\" *= ****\";\nchar n6[10]=\" *=* ***\";\nchar n7[10]=\" *=** **\";\nchar n8[10]=\" *=*** *\";\nchar n9[10]=\" *=**** \";\nchar n0[10]=\"* = ****\";\nchar nn[10];\nbool first=true;\nwhile(cin>>str){\n\n\tif(first==false)cout<<endl;\n\tfirst=false;\nint t=5-str.size();\nbool f=true;\n\nfor(int i=0;i<5;i++){\n\tif(i<t){\t\t\n\tfor(int j=0;j<8;j++)\n\tnn[j]=n0[j];\n\tf=false;\n}\n\telse{\n\nchar y=str[i-t];\n\n\nif(y=='0'){\n\tfor(int j=0;j<8;j++)\n\tnn[j]=n0[j];\n}\nelse if(y=='1'){\n\tfor(int j=0;j<8;j++)nn[j]=n1[j];\n}\nelse if(y=='2'){\n\tfor(int j=0;j<8;j++)nn[j]=n2[j];\n}\nelse if(y=='3'){\n\tfor(int j=0;j<8;j++)nn[j]=n3[j];\n}\nelse if(y=='4'){\n\tfor(int j=0;j<8;j++)nn[j]=n4[j];\n}\nelse if(y=='5'){\n\tfor(int j=0;j<8;j++)nn[j]=n5[j];\n}\nelse if(y=='6'){\n\tfor(int j=0;j<8;j++)nn[j]=n6[j];\n}\nelse if(y=='7'){\n\tfor(int j=0;j<8;j++)nn[j]=n7[j];\n}\nelse if(y=='8'){\n\tfor(int j=0;j<8;j++)nn[j]=n8[j];\n}\nelse if(y=='9'){\n\tfor(int j=0;j<8;j++)nn[j]=n9[j];\n}\n\tif(y!='9'&&y!='4')f=false;\n\t}\n\t\nfor(int j=0;j<8;j++){\n\nch[j][i]=nn[j];\n\n}\n\t\n}\nint w=8;\n//\tif(f==true)w=7;\nfor(int i=0;i<w;i++){\nfor(int j=0;j<5;j++)\ncout<<ch[i][j];\n\ncout<<endl;\n}\n\n}\nreturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1180,
"score_of_the_acc": -0.4667,
"final_rank": 6
},
{
"submission_id": "aoj_0128_1219120",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main(){\n\n\tint n, len, cnt, set;\n\tchar sb[7][5];\n\tstring str;\n\t\n\tset = 0;\t\n\n\twhile(cin >> str){\n\t\tset++;\n\t\tif(set != 1) cout << endl;\n\t\tcnt = 0;\n\t\tlen = str.length();\n\t\tfor(int i=0; i<5; i++){\n\t\t\tif(len+i >= 5){\n\t\t\t\tn = str[cnt] - '0';\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\telse n = 0;\n\t\t\tif(n >= 5){\n\t\t\t\tsb[0][i] = ' ';\n\t\t\t\tsb[1][i] = '*';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tsb[0][i] = '*';\n\t\t\t\tsb[1][i] = ' ';\n\t\t\t}\n\t\t\tfor(int j=2; j<7; j++){\n\t\t\t\tsb[j][i] = '*';\n\t\t\t}\n\t\t\tsb[n%5+2][i] = ' ';\n\t\t}\n\t\t\n\t\tfor(int i=0; i<7; i++){\n\t\t\tfor(int j=0; j<5; j++){\n\t\t\t\tcout << sb[i][j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t\tif(i == 1) cout << \"=====\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1172,
"score_of_the_acc": -0.3333,
"final_rank": 2
}
] |
aoj_0131_cpp
|
博士の光電管
博士 : ピーター君。やったよ。
ピーター : またですか。今度はどんなくだらない発明ですか。
博士 : あの幻の素粒子アキシオンの検出器を発明したんじゃ。
ピーター : アキシオンといえば、欧州合同原子核研究機構 (CERN) をはじめとする研究者たちが血眼で追っかけているという、あれですよね。本当ですかぁ?
博士 : 本当だってばよ。細かい説明は省くが、非常に強力な磁場を内蔵する特殊な光電管が光ることによって、通過するアキシオンを検出する。
ピーター : 他 に先んじて検出すれば、小柴先生のニュートリノ検出に匹敵するノーベル賞級の研究ですよ。
これで役立たずの研究ばかりしている「ダメ研究室」などという汚名も返上できますね。
博士 : そうだとも。小柴先生の「スーパーカミオカンデ」にあやかって、この装置を、(悪口言ったら)「タダジャオカンデ」と命名した。
ピーター : ちょっと苦しいって言うか、卑屈って言うか・・・。
博士 : それはいいとして、この装置ちょっとした癖があるんじゃよ。
アキシオン粒子がある光電管を通過すると、感度の関係でその光電管と隣接する上下左右の光電管が反応する。
図1
図2
★
●
●
●
●
●
●
●
★
●
●
●
●
●
●
●
●
●
●
●
●
●
★
●
●
→
○
○
●
○
●
○
●
○
○
○
●
●
●
○
●
●
●
○
●
●
●
○
○
○
●
●
○
○
●
○
○
★
★
○
☆
●
●
○
●
●
○
●
●
○
●
●
○
○
○
●
→
●
●
●
●
●
●
●
●
○
●
●
○
●
●
○
○
●
●
○
●
●
○
○
○
●
ピーター : つまり、図1の左側★印の光電管を粒子が通過した場合、
右側のように点灯すると言うことですね。
(図は 5 × 5 の例。黒は消灯・白は点灯状態。以下同じ。)
博士 : また反応とは、光電管の状態が反転する。つまり消えている光電管は光り、
光っている光電管は消える。
ピーター : つまり、図2の左側の★印や☆印を粒子が通過した場合、右側のような状態になると。
博士 : これを正方形になんと 100 個 (10 × 10) 配置して待ち受けるわけだ。
ピーター : これだけの大発明、ノーベル賞選考委員会も「ホッチャオカンデ」なんて。
博士 : おぉピーター君、君も我が研究室の作風になじんできたようだね。いい感じだ。
では、早速実験を始めよう。まずはこの装置、現在ランダムに光電管が点いているので、
実験が始められるように全部消えた状態にリセットしてくれたまえ。
なあに、どの光電管にアキシオン粒子を当てれば全部消えるか考えればいいだけじゃよ。
簡単だろう?
ピーター : 考えるのはいいんですが博士。当てるためには、
幻のアキシオン粒子を発生させて打ち込める装置がないといけないんじゃないですか。
博士 : ・・・。
博士とピータ (同時に)コリャアカンデ!だははは・・・・。
ー:
ということで、本日も和気あいあいと暮れてゆく博士の研究室ですが、例によって話は全く進みそうもありません。しょうがないので、ピーター君に代わってプログラムを作成してあげてください。
プログラムは次のようなものになります。
A. 装置の光電管の状態を 10 × 10 の配列として入力します。0は消灯中、1は点灯中を表します。
0 と 1 以外のデータは含まれません。
B. 入力した装置の状態をすべて消灯にするために、アキシオン粒子を通過させる位置を計算して出力します。これは、入力と同じ 10 × 10の配列で光電管の位置を表します。「0 は通過させない」、「1 は通過させる」ことを表します。すべてを消灯する方法は必ず 1 通りだけ存在するものとします。
Input
複数のデータセットが与えられます。１行目にデータセットの数
n
(
n
≤ 20) が与えられます。各データセットは以下の形式で与えられます。
a
1,1
a
1,2
...
a
1,10
a
2,1
a
2,2
...
a
2,10
:
a
10,1
a
10,2
...
a
10,10
a
i,j
は装置の
i
行目
j
列目の光電管の状態を示す整数 (0 または 1) を表します。
Output
各データセットについて、粒子を通過させる位置を以下の形式で出力してください。
b
1,1
b
1,2
...
b
1,10
b
2,1
b
2,2
...
b
2,10
:
b
10,1
b
10,2
...
b
10,10
b
i,j
は装置の
i
行目
j
列目の光電管に粒子を通過させるかいなかを示す整数 (0 または 1) を表します。
Sample Input
1
0 1 0 0 0 0 0 0 0 0
1 1 1 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0
0 0 0 0 1 1 0 0 0 0
0 0 0 1 0 0 1 0 0 0
0 0 0 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 1 1 1
0 0 0 0 0 0 0 0 1 0
Output for the Sample Input
0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 0 0
|
[
{
"submission_id": "aoj_0131_6979053",
"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 Inf32 1000000001\n#define Inf64 2000000000000000001\n\nvoid go(vector<vector<int>> &a,int x,int y){\n\trep(i,10){\n\t\trep(j,10){\n\t\t\tif(abs(x-i)+abs(y-j)<=1)a[i][j] ^= 1;\n\t\t}\n\t}\n}\n\nint main(){\n\tint n;\n\tcin>>n;\n\trep(_,n){\n\t\t\n\t\tvector a(10,vector<int>(10));\n\t\trep(i,10){\n\t\t\trep(j,10){\n\t\t\t\tcin>>a[i][j];\n\t\t\t}\n\t\t}\n\t\t\n\t\trep(i,1<<10){\n\t\t\tauto b = a;\n\t\t\tvector ans(10,vector<int>(10,0));\n\t\t\trep(j,10){\n\t\t\t\tif((i>>j)&1){\n\t\t\t\t\tgo(b,0,j);\n\t\t\t\t\tans[0][j] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=1;j<10;j++){\n\t\t\t\trep(k,10){\n\t\t\t\t\tif(b[j-1][k]){\n\t\t\t\t\t\tgo(b,j,k);\n\t\t\t\t\t\tans[j][k] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(b.back()==vector<int>(10,0)){\n\t\t\t\trep(j,10){\n\t\t\t\t\trep(k,10){\n\t\t\t\t\t\tif(k!=0)cout<<' ';\n\t\t\t\t\t\tcout<<ans[j][k];\n\t\t\t\t\t}\n\t\t\t\t\tcout<<endl;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3356,
"score_of_the_acc": -0.282,
"final_rank": 18
},
{
"submission_id": "aoj_0131_5155241",
"code_snippet": "#pragma region Macros\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define drep(i,n) for(ll i = n-1;i >= 0;i--)\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 endl '\\n'\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 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 fi first\n#define se second\n#define all(c) begin(c), end(c)\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;\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}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\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())\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}\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 sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\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}\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 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>>;\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 move(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 move(res);\n}\n#define i128 __int128_t\n#define ull unsigned long long int\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\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;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" :\", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n#define LOCAL\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#pragma endregion\n//#include<atcoder/all>\n//using namespace atcoder;\nbool all_zero(vector<vector<int>> &f){\n rep(i,10)rep(j,10){\n if(f[i][j])return false;\n }\n return true;\n}\nvector<pii> vec = {{0,-1},{-1,0},{1,0},{0,1}};\nbool valid(int x,int y){return x >= 0 && y >= 0 && x < 10 && y < 10;}\nint main(){\n INT(n);\n while(n--){\n VV(int,f,10,10);\n rep(mask,1<<10){\n vv(int,ret,10,10);\n vector<vector<int>> tmp = f;\n rep(i,10){\n if(mask>>i&1){\n ret[0][i] = 1;\n tmp[0][i] ^=1;\n for(auto [dx,dy]:vec){\n int nx = 0+dx,ny = i+dy;\n if(!valid(nx,ny))continue;\n tmp[nx][ny] ^= 1;\n }\n }\n }\n rep(i,10)rep(j,10){\n if(i == 0)continue;\n if(tmp[i-1][j] == 0)continue;\n //oku\n ret[i][j] = 1;\n tmp[i][j] ^=1;\n for(auto [dx,dy]:vec){\n int nx = i+dx,ny = j+dy;\n if(!valid(nx,ny))continue;\n tmp[nx][ny] ^= 1;\n }\n }\n //check\n if(all_zero(tmp)){\n rep(i,10){\n rep(j,10){\n if(j)cout << \" \";\n cout << ret[i][j];\n }\n cout << endl;\n }\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3152,
"score_of_the_acc": -0.2027,
"final_rank": 17
},
{
"submission_id": "aoj_0131_4060569",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\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 LINF (ll)INF*INF\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(int i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vp;\ntypedef vector<vi> vvi;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a/gcd(a,b)*b;\n}\nint n = 10;\nbool in(int a, int b){\n if(a < 0 || a >= n || b < 0 || b >= n)return false;\n return true;\n}\nint dx[] = {0,0,1,0,-1};\nint dy[] = {0,1,0,-1,0};\n\nsigned main(void) {\n int num;\n cin >> num;\n while(num--){\n vvi a(n,vi(n));\n rep(i,n)rep(j,n)cin >> a[i][j];\n rep(bit, 1<<n){\n vvi t = a;\n vvi ans(n,vi(n,0));\n rep(i,n)if(bit&(1<<i)){\n ans[0][i]++;\n rep(j,5){\n int x = 0 + dx[j];\n int y = i + dy[j];\n if(in(x,y))t[x][y] ^= 1;\n }\n }\n rep(i,n-1)rep(j,n)if(t[i][j]){\n ans[i+1][j]++;\n rep(k,5){\n int x = i+1 + dx[k];\n int y = j + dy[k];\n if(in(x,y))t[x][y] ^= 1;\n }\n }\n bool c = true;\n rep(j,n)if(t[n-1][j])c = false;\n if(c){\n rep(i,n)rep(j,n)cout << ans[i][j] << \" \\n\"[j == n-1];\n }\n }\n vvi ans(n,vi(n,0));\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3104,
"score_of_the_acc": -0.1979,
"final_rank": 15
},
{
"submission_id": "aoj_0131_2447199",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#include <stdio.h>\n#include <ctype.h>\n#include <string>\n#include <iostream>\n#include <vector>\n#include <stack>\n#include <fstream>\n#include <sstream>\n#include <queue>\n#include <exception>\n#include <cmath>\n#include <numeric>\n#include <map>\n#include <algorithm>\n#include <bitset>\n#include <set>\n#include <functional>\n\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--)\n\nusing namespace std;\ntypedef long long int lint;\ntypedef vector<vector<int> > matrix;\n\nint dy[5] = { -1, 0, 0, 0, 1 };\nint dx[5] = { 0, -1, 0, 1, 0 };\n\nvoid print(matrix& mat) {\n\tREP(y, 10) {\n\t\tREP(x, 10) {\n\t\t\tif (x) cout << \" \";\n\t\t\tcout << mat[y][x];\n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nmatrix mk_matrix(int n) {\n\tmatrix mat(n);\n\tREP(i, n) {\n\t\tmat[i] = vector<int>(10, 0);\n\t}\n\treturn mat;\n}\n\nvoid push(matrix& mat, int y, int x) {\n\tREP(i, 5) {\n\t\tint nx = x + dx[i];\n\t\tif (nx < 0 || nx >= 10) continue;\n\t\tint ny = y + dy[i];\n\t\tif (ny < 0 || ny >= 10) continue;\n\t\tmat[ny][nx] ^= 1;\n\t}\n}\n\nvoid solve(matrix& mat) {\n\t//?????????????????¨????????????????????????\n\tREP(i, 1024) {\n\t\tmatrix mat_tmp = mat;\n\t\tmatrix pushed = mk_matrix(10);\n\t\tint tmp = i;\n\t\tREP(j, 10) {\n\t\t\tif (!tmp) break;\n\t\t\tif (tmp & 1) {\n\t\t\t\tpush(mat_tmp, 0, j);\n\t\t\t\tpushed[0][j] = 1;\n\t\t\t\t//print(mat_tmp);\n\t\t\t}\n\t\t\ttmp >>= 1;\n\t\t}\n\n\t\tFOR(y, 1, 10) {\n\t\t\tREP(x, 10) {\n\t\t\t\tif (mat_tmp[y - 1][x]) {\n\t\t\t\t\tpush(mat_tmp, y, x);\n\t\t\t\t\tpushed[y][x] = 1;\n\t\t\t\t\t//print(mat_tmp);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//cout << i << endl;\n\t\t//print(mat_tmp);\n\t\tif (find(mat_tmp[9].begin(), mat_tmp[9].end(), 1) == mat_tmp[9].end()) {\n\t\t\tprint(pushed);\n\t\t\t//cout << \"solved.\" << endl;\n\t\t\treturn;\n\t\t}\n\t}\n}\n\nbool AOJ0131()\n{\n\tmatrix mat = mk_matrix(10);\n\tREP(i, 10) {\n\t\tREP(j, 10) {\n\t\t\tcin >> mat[i][j];\n\t\t}\n\t}\n\n\tsolve(mat);\n\n\treturn true;\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tREP(i, n) AOJ0131();\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3128,
"score_of_the_acc": -0.2003,
"final_rank": 16
},
{
"submission_id": "aoj_0131_2351754",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nint a[10][10],b[10][10],ans[10][10];\nint dx[]={1,0,-1,0,0},dy[]={0,1,0,-1,0};\n\nvoid init(void){for(int i=0;i<10;i++){for(int j=0;j<10;j++){b[i][j]=a[i][j];ans[i][j]=0;}}}\n\nvoid rev(int x, int y){for(int k=0;k<5;k++){int ny=y+dy[k],nx=x+dx[k];\n if( 0<=ny && 0<=nx && ny<10 && nx<10)b[ny][nx]=!b[ny][nx];}}\n\nint ok(void){for(int i=0;i<10;i++)for(int j=0;j<10;j++)if(b[i][j])return 0;return 1;}\n\nvoid solve(int p[]){\n init();for(int i=0;i<10;i++){if(p[i])rev(i,0);ans[0][i]=p[i];}\n for(int i=1;i<10;i++){for(int j=0;j<10;j++){if(b[i-1][j]){rev(j,i);ans[i][j]=1;}}}\n if(ok()){for(int i=0;i<10;i++){for(int j=0;j<10;j++){\tcout << ans[i][j];if(j<9)cout << \" \";}cout << endl;}}}\n\nvoid func(int p[], int cnt){if(9<cnt)solve(p);else {p[cnt]=0;func(p,cnt+1);p[cnt]=1;func(p,cnt+1);}}\n\nint main(void){\n int n;cin >> n;\n while(n--){for(int i=0;i<10;i++)for(int j=0;j<10;j++)cin >> a[i][j];\n int p[10]={0};func(p,0);\n }return 0;}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3016,
"score_of_the_acc": -0.1891,
"final_rank": 13
},
{
"submission_id": "aoj_0131_2074542",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\n\nconst int mod = 2;\nstruct Mod {\npublic:\n\tint num;\n\tMod() : Mod(0) { ; }\n\tMod(long long int n) : num((n % mod + mod) % mod) {\n\t\tstatic_assert(mod<INT_MAX / 2, \"mod is too big, please make num 'long long int' from 'int'\");\n\t}\n\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\n\toperator int() { return num; }\n};\n\nMod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\nMod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\nMod operator+(const Mod a, const long long int b) { return b + a; }\nMod operator++(Mod &a) { return a + Mod(1); }\nMod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\nMod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\nMod operator--(Mod &a) { return a - Mod(1); }\nMod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\nMod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\nMod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\nMod operator*(const Mod a, const int b) { return Mod(b)*a; }\nMod operator+=(Mod &a, const Mod b) { return a = a + b; }\nMod operator+=(long long int &a, const Mod b) { return a = a + b; }\nMod operator-=(Mod &a, const Mod b) { return a = a - b; }\nMod operator-=(long long int &a, const Mod b) { return a = a - b; }\nMod operator*=(Mod &a, const Mod b) { return a = a * b; }\nMod operator*=(long long int &a, const Mod b) { return a = a * b; }\nMod operator*=(Mod& a, const long long int &b) { return a = a * b; }\nMod operator^(const Mod a, const int n) {\n\tif (n == 0) return Mod(1);\n\tMod res = (a * a) ^ (n / 2);\n\tif (n % 2) res = res * a;\n\treturn res;\n}\nMod mod_pow(const Mod a, const long long int n) {\n\tif (n == 0) return Mod(1);\n\tMod res = mod_pow((a * a), (n / 2));\n\tif (n % 2) res = res * a;\n\treturn res;\n}\nMod inv(const Mod a) { return a ^ (mod - 2); }\nMod operator/(const Mod a, const Mod b) {\n\tassert(b.num != 0);\n\treturn a * inv(b);\n}\nMod operator/(const long long int a, const Mod b) {\n\treturn Mod(a) / b;\n}\nMod operator/=(Mod &a, const Mod b) {\n\treturn a = a / b;\n}\n\n#define MAX_MOD_N 1024000\n\nMod fact[MAX_MOD_N], factinv[MAX_MOD_N];\nvoid init(const int amax = MAX_MOD_N) {\n\tfact[0] = Mod(1); factinv[0] = 1;\n\tfor (int i = 0; i < amax - 1; ++i) {\n\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n\t}\n}\nMod comb(const int a, const int b) {\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\n/* verified AOJ1327 One-Dimensional Cellular Automaton\n~Matrix~\n??????????°????????¨?????????§??????\nvector iostream cmath cassert ??????\nMatrix a(VV), b(VV);\n?????????:a*b\n????????????:l*a\n???:a+b\n???:a-b\n??¢???:a.transport()\n?????????:a.cofactor()\n?????????:a.det()\na???i???j??????:a.get(i,j)???\na???i??????j?????????k?????£??\\:set(i,j,k)\n????????????a[i][j] (a[i][j]=k)\na???x???:a.pow(x)\nn*n?????¬??????E:Matrix(n)\nm*n 0??????:Matrix(m,n)\nm*n ??¨????´????p?????????:Matrix(m,n,p)\nRow???row??§????????????(m*1??????):Matrix(row)\n**(??´??°??????)**\n????§????:a.triangulate()\n?????????:a.rank()\n?????????:a.inverse()\n//(????????????a.det()?????????a.pre_inverse()??§?±??????? ??´??°???)\n??¬??????????¶???????:a.rowReduction()\n//??£???????¬?????¨????????§£??????\n***\n*/\n\n#include <vector>\n#include <iostream>\n#include <cmath>\n#include <cassert>\nusing namespace std;\n\ntypedef Mod Elem;\ntypedef vector<Elem> Row;\ntypedef vector<Row> VV;\n\ntypedef long double ld;\nconst ld EPS = 1e-11;\n\nconst bool isZero(const Elem e) {\n\treturn e.num == 0;\n}\n\nstruct Matrix {\n\tVV matrix;\n\tint n, m;\n\n\tMatrix(const VV &matrix_);\n\texplicit Matrix(int n_);\n\texplicit Matrix(const Row &row);\n\tMatrix(int m_, int n_);\n\tMatrix(int m_, int n_, Elem e);\n\n\tconst Elem get(const int i, const int j) const;\n\tvoid set(const int x, const int y, const Elem k);\n\n\tconst Matrix operator + (const Matrix &rhs) const;\n\tconst Matrix operator * (const Matrix &rhs) const;\n\tconst Matrix operator - (const Matrix &rhs) const;\n\tMatrix &operator += (const Matrix &rhs);\n\tMatrix &operator *= (const Matrix &rhs);\n\tMatrix &operator -= (const Matrix &rhs);\n\n\tRow &operator[](const int x);\n\n\tconst Matrix transport() const;\n\tconst Matrix pow(int x) const;\n\tconst Matrix cofactor(int x, int y) const;\n\tconst Elem det() const;\n\n\tconst Matrix triangulate() const;\n\tconst int rank() const;\n\n\t//?????????????????¨????????°???(?????????)*(?????????)?????????\n\t//A:matrix,return det A * A^-1\n\tconst Matrix pre_inverse() const;\n\tconst Matrix inverse() const;\n\tconst Matrix rowReduction() const;\n};\n\nconst Matrix operator * (const Elem lambda, const Matrix &rhs) {\n\tMatrix tmp(rhs);\n\tfor (int i = 0; i < rhs.m; i++)\n\t\tfor (int j = 0; j < rhs.n; j++)\n\t\t\ttmp.set(i, j, tmp.get(i, j) * lambda);\n\treturn tmp;\n}\n\nMatrix::Matrix(const VV &matrix_) : matrix(matrix_) {\n\tm = matrix_.size();\n\tif (m == 0) n = 0;\n\telse n = matrix_[0].size();\n}\nMatrix::Matrix(int n_) : m(n_), n(n_) {\n\tmatrix = VV(n, Row(n, 0));\n\tfor (int i = 0; i < n; ++i)\n\t\tset(i, i, 1);\n}\nMatrix::Matrix(const Row &row) : m(1), n(row.size()), matrix(VV(1, row)) {\n\t//size???m???vector<Elem>??????mx1???????????????\n\t(*this) = transport();\n}\nMatrix::Matrix(int m_, int n_) : m(m_), n(n_) {\n\tmatrix = VV(m, Row(n, 0));\n}\nMatrix::Matrix(int m_, int n_, Elem e) : m(m_), n(n_) {\n\tmatrix = VV(m, Row(n, e));\n}\n\nconst Elem Matrix::get(const int i, const int j) const {\n\tif (0 <= i && i < m && 0 <= j && j < n)\n\t\treturn matrix[i][j];\n\n\tcerr << \"get(\" << i << \",\" << j << \")is not exist.\" << endl;\n\tthrow;\n}\nvoid Matrix::set(const int i, const int j, const Elem k) {\n\tif (0 <= i && i < m && 0 <= j && j < n) {\n\t\t*(matrix[i].begin() + j) = k;\n\t\treturn;\n\t}\n\tcerr << \"set(\" << i << \",\" << j << \")is not exist.\" << endl;\n\tthrow;\n}\n\nconst Matrix Matrix::operator + (const Matrix &rhs) const {\n\tassert(m == rhs.m && n == rhs.n);\n\n\tMatrix tmp(m, n, 0);\n\tfor (int i = 0; i < m; i++) {\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\ttmp.set(i, j, get(i, j) + rhs.get(i, j));\n\t\t}\n\t}\n\treturn tmp;\n}\n\nconst Matrix Matrix::operator * (const Matrix &rhs) const {\n\tassert(n == rhs.m);\n\n\tMatrix tmp(m, rhs.n, 0);\n\tElem sum;\n\tfor (int i = 0; i < m; i++)\n\t\tfor (int j = 0; j < rhs.n; j++) {\n\t\t\tsum = 0;\n\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\tsum += get(i, k) * rhs.get(k, j);\n\t\t\t}\n\t\t\ttmp.set(i, j, sum);\n\t\t}\n\treturn tmp;\n}\n\nconst Matrix Matrix::operator - (const Matrix &rhs) const {\n\treturn *this + ((Elem)-1 * rhs);\n}\n\nMatrix &Matrix::operator += (const Matrix &rhs) {\n\treturn *this = *this + rhs;\n}\n\nMatrix &Matrix::operator *= (const Matrix &rhs) {\n\treturn *this = *this * rhs;;\n}\n\nMatrix &Matrix::operator -= (const Matrix &rhs) {\n\treturn *this = *this - rhs;\n}\n\nRow &Matrix::operator[](const int x) {\n\treturn matrix[x];\n}\n\nconst Matrix Matrix::transport() const {\n\tVV tmp;\n\tfor (int i = 0; i < n; i++) {\n\t\tRow row;\n\t\tfor (int j = 0; j < m; j++)\n\t\t\trow.push_back(get(j, i));\n\t\ttmp.push_back(row);\n\t}\n\treturn tmp;\n}\n\nconst Matrix Matrix::pow(int x) const {\n\tMatrix tmp(*this), e(m);\n\tfor (int i = 1; i <= x; i <<= 1) {\n\t\tif ((x & i) > 0)\n\t\t\te = e * tmp;\n\t\ttmp = tmp * tmp;\n\t}\n\treturn e;\n}\n\nconst Matrix Matrix::cofactor(int x, int y) const {\n\tVV tmp;\n\tfor (int i = 0; i < m; i++) {\n\t\tif (x == i) continue;\n\t\tRow row;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tif (y == j) continue;\n\t\t\trow.push_back(get(i, j));\n\t\t}\n\t\ttmp.push_back(row);\n\t}\n\treturn Matrix(tmp);\n}\n\nconst Elem Matrix::det() const {\n\tassert(n == m);\n\n\tif (m == 1)\n\t\treturn get(0, 0);\n\tElem sum = 0;\n\tfor (int i = 0; i < m; i++) {\n\t\tsum += ((i % 2 == 0 ? 1 : -1) * get(i, 0)) * Matrix(cofactor(i, 0)).det();\n\t}\n\treturn sum;\n}\n\nconst Matrix Matrix::triangulate() const {\n\tMatrix tmp(*this);\n\tElem e;\n\tint p = 0;\n\tfor (int i = 0; i < m && p < n; i++, p++) {\n\t\tif (isZero(tmp.get(i, p))) {\n\t\t\ttmp.set(i, p, 0);\n\t\t\tbool flag = true;\n\t\t\tfor (int j = i + 1; j < m; j++)\n\t\t\t\tif (!isZero(tmp.get(j, p))) {\n\t\t\t\t\tfor (int k = 0; k < n; k++)\n\t\t\t\t\t\ttmp.set(i, k, tmp.get(i, k) + tmp.get(j, k));\n\t\t\t\t\t//tmp[i].swap(tmp[j]);\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (flag) {\n\t\t\t\ti--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\tfor (int j = i + 1; j < m; j++) {\n\t\t\te = tmp.get(j, p) / tmp.get(i, p);\n\t\t\tfor (int k = 0; k < n; k++)\n\t\t\t\ttmp.set(j, k, tmp.get(j, k) - tmp.get(i, k) * e);\n\t\t}\n\t}\n\treturn tmp;\n}\n\nconst int Matrix::rank() const {\n\tMatrix tmp(triangulate());\n\tfor (int i = min(tmp.m - 1, tmp.n - 1); i >= 0; i--) {\n\t\tfor (int j = tmp.n - 1; j >= i; j--)\n\t\t\tif (isZero(tmp.get(i, j)))\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\treturn i + 1;\n\t}\n\treturn 0;\n}\n\nconst Matrix Matrix::pre_inverse() const {\n\tassert(m == n);\n\n\tMatrix tmp(m, n, 0);\n\tfor (int i = 0; i < m; i++)\n\t\tfor (int j = 0; j < n; j++)\n\t\t\ttmp.set(i, j, ((i + j) % 2 == 0 ? 1 : -1)*cofactor(i, j).det());\n\treturn tmp.transport();\n}\n\n/*O(n!)????£?\nconst Matrix Matrix::inverse() const {\nMatrix tmp(pre_inverse());\nElem e = det();\nassert(!isZero(e));\ntmp = 1 / e * tmp;\nreturn tmp.transport();\n}*/\n\nconst Matrix Matrix::inverse() const {\n\tassert(m == n);\n\n\tMatrix tmp(m, n * 2), tmp2(m, n);\n\tfor (int i = 0; i < m; i++)\n\t\tfor (int j = 0; j < n; j++)\n\t\t\ttmp.set(i, j, get(i, j));\n\tfor (int i = 0; i < m; i++)\n\t\ttmp.set(i, i + n, 1);\n\n\ttmp = tmp.rowReduction();\n\n\t//?????????????????¨??????????????????????????§??????\n\tfor (int i = 0; i < m; i++)\n\t\tassert(isZero(tmp.get(i, i) - 1));\n\n\tfor (int i = 0; i < m; i++)\n\t\tfor (int j = 0; j < n; j++)\n\t\t\ttmp2.set(i, j, tmp.get(i, j + n));\n\n\treturn tmp2;\n}\n\n/*\na b c j\nd e f k\ng h i l\n\nax+by+cz=j;\ndx+ey+fz=k;\ngx+hy+iz=l;\n\n|\nV\n\n1 0 0 x\n0 1 0 y\n0 0 1 z\n???????????????\n*/\nconst Matrix Matrix::rowReduction() const {\n\tMatrix tmp(*this);\n\tElem e;\n\tint p = 0;\n\tfor (int i = 0; i < m && p < n; i++, p++) {\n\t\tif (isZero(tmp.get(i, p))) {\n\t\t\ttmp.set(i, p, 0);\n\t\t\tbool flag = true;\n\t\t\tfor (int j = i + 1; j < m; j++)\n\t\t\t\tif (!isZero(tmp.get(j, p))) {\n\t\t\t\t\tfor (int k = 0; k < n; k++)\n\t\t\t\t\t\ttmp.set(i, k, tmp.get(i, k) + tmp.get(j, k));\n\t\t\t\t\t//tmp[i].swap(tmp[j]);\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (flag) {\n\t\t\t\ti--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\te = 1 / tmp.get(i, p);\n\t\ttmp.set(i, p, 1);\n\t\tfor (int k = i + 1; k < n; k++)\n\t\t\ttmp.set(i, k, tmp.get(i, k)*e);\n\t\tfor (int j = 0; j < m; j++) {\n\t\t\tif (i == j) continue;\n\t\t\te = tmp.get(j, p);\n\t\t\tfor (int k = 0; k < n; k++)\n\t\t\t\ttmp.set(j, k, tmp.get(j, k) - tmp.get(i, k) * e);\n\t\t}\n\t}\n\treturn tmp;\n}\n\nconst int dx[] = { 0,-1,0,1,0 };\nconst int dy[] = {0, 0,1,0,-1 };\nint main() {\n\tint N; cin >> N;\n\twhile (N--) {\n\t\tMatrix mat(100, 101);\n\t\tfor (int y = 0; y < 10; ++y) {\n\t\t\tfor (int x = 0; x < 10; ++x) {\n\t\t\t\tint num = y * 10 + x;\n\t\t\t\tint a; cin >> a;\n\t\t\t\tfor (int k = 0; k < 5; ++k) {\n\t\t\t\t\tint nextx = x + dx[k];\n\t\t\t\t\tint nexty = y + dy[k];\n\t\t\t\t\tif (nextx>=0&&nextx<10&&nexty>=0&&nexty<10) {\n\t\t\t\t\t\tint nextnum = nexty * 10 + nextx;\n\t\t\t\t\t\tmat[num][nextnum] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmat[num][100] = a;\n\t\t\t}\n\t\t}\n\t\tMatrix ans = mat.rowReduction();\n\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\tfor (int j = 0; j < 10; ++j) {\n\t\t\t\tif (ans[i * 10 + j][100]) {\n\t\t\t\t\tcout << 1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcout << 0;\n\t\t\t\t}\n\t\t\t\tif (j == 9)cout << endl;\n\t\t\t\telse cout << \" \";\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 11096,
"score_of_the_acc": -1.1765,
"final_rank": 20
},
{
"submission_id": "aoj_0131_2006512",
"code_snippet": "#include<iostream>\nusing namespace std;\nint x[12][12];\nint T[12][12], V[12][12];\nvoid compute(int X, int Y) {\n\tint dx[5] = { -1,0,0,0,1 }, dy[5] = { 0,-1,0,1,0 };\n\tfor (int i = 0; i < 5; i++) { T[X + dx[i]][Y + dy[i]]++; T[X + dx[i]][Y + dy[i]] %= 2; }\n}\nint main() {\n\tint n; cin >> n;\n\tfor (int h = 0; h < n; h++) {\n\t\tfor (int i = 1; i <= 10; i++) {\n\t\t\tfor (int j = 1; j <= 10; j++)cin >> x[i][j];\n\t\t}\n\n\t\tfor (int i = 0; i < (1 << 10); i++) {\n\t\t\tint bit[11]; for (int j = 0; j < 10; j++)bit[j + 1] = (i / (1 << j)) % 2;\n\t\t\tfor (int j = 0; j < 12; j++) {\n\t\t\t\tfor (int k = 0; k < 12; k++) { T[j][k] = 0; V[j][k] = 0; }\n\t\t\t}\n\n\t\t\tfor (int j = 1; j <= 10; j++) {\n\t\t\t\tif (bit[j] == 1) {\n\t\t\t\t\tcompute(1, j);\n\t\t\t\t\tV[1][j] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\tfor (int k = 1; k <= 10; k++) {\n\t\t\t\t\tif (T[j - 1][k] != x[j - 1][k]) {\n\t\t\t\t\t\tcompute(j, k);\n\t\t\t\t\t\tV[j][k] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbool OK = true; for (int k = 1; k <= 10; k++) { if (T[10][k] != x[10][k])OK = false; }\n\t\t\tif (OK == true) {\n\t\t\t\tfor (int j = 1; j <= 10; j++) {\n\t\t\t\t\tfor (int k = 1; k <= 10; k++) {\n\t\t\t\t\t\tif (k >= 2)cout << ' '; cout << V[j][k];\n\t\t\t\t\t}\n\t\t\t\t\tcout << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0028,
"final_rank": 3
},
{
"submission_id": "aoj_0131_1954821",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n\nvoid turn(int x, int y, int data[10][10]) {\n\tint dx[5] = {0,1,0,-1,0};\n\tint dy[5] = {0,0,1,0,-1};\n\t\n\tREP(i, 5) {\n\t\tint nx = x + dx[i], ny = y + dy[i];\n\t\tif (!(nx >= 0 && nx < 10 && ny >= 0 && ny < 10)) continue;\n\t\tdata[ny][nx]++;\n\t}\n}\n\nbool check(int data[10][10]) {\n\tbool res = true;\n\t\n\tREP(i, 10) if (data[9][i] & 1) res = false;\n\t\n\treturn res;\n}\n\nint main() {\n\tint n;\n\tcin >> n;\n\twhile (n--) {\n\t\tint in[10][10];\n\t\tREP(i, 10) REP(j, 10) scanf(\"%d\", &in[i][j]);\n\t\t\n\t\tbool ans[10][10];\n\t\tint data[10][10];\n\t\t\n\t\tREP(i, 1<<10) {\n\t\t\tmemset(ans, 0, sizeof(ans));\n\t\t\tmemcpy(data, in, sizeof(in));\n\t\t\t\n\t\t\tREP(j, 10) if ((i >> j) & 1) {\n\t\t\t\tans[0][j] = true;\n\t\t\t\tturn(j, 0, data);\n\t\t\t}\n\t\t\tFOR(j, 1, 10) REP(k, 10) {\t\n\t\t\t\tif (data[j - 1][k] & 1) {\n\t\t\t\t\tans[j][k] = true;\n\t\t\t\t\tturn(k, j, data);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (check(data)) break;\n\t\t}\n\t\t\n\t\tREP(j, 10) REP(k, 10)\n\t\t\tprintf(\"%d%c\", ans[j][k] ? 1 : 0, k == 9 ? '\\n' : ' ');\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": -0.0096,
"final_rank": 11
},
{
"submission_id": "aoj_0131_1844569",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \nconst int dx[5] = {-1, 0, 0, 0, 1};\nconst int dy[5] = {0, -1, 0, 1, 0};\n \nint arr[10][10];\nint ans[10][10], flip[10][10];\n \nint get(int x, int y)\n{\n int c = arr[x][y];\n for (int d = 0; d < 5; d++) {\n\tint x2 = x + dx[d], y2 = y + dy[d];\n\tif (0 <= x2 && x2 < 10 && 0 <= y2 && y2 < 10) {\n\t c += flip[x2][y2];\n\t}\n }\n return c % 2;\n}\n \nint calc()\n{\n for (int i = 1; i < 10; i++) {\n\tfor(int j = 0; j < 10; j++) {\n\t if (get(i-1, j) != 0) {\n\t\tflip[i][j] = 1;\n\t }\n\t}\n }\n \n for (int j = 0; j < 10; j++) {\n\tif (get(9, j) != 0) {\n\t return -1;\n\t}\n }\n \n int res = 0;\n for (int i = 0; i < 10; i++) {\n\tfor (int j = 0; j < 10; j++) {\n\t res += flip[i][j];\n\t}\n }\n return res;\n}\n \nvoid solve()\n{\n int res = -1;\n \n for (int i = 0; i < (1<<10); i++) { \n\tmemset(flip, 0, sizeof(flip));\n\tfor (int j = 0; j < 10; j++) {\n\t flip[0][10-j-1] = i >> j & 1;\n\t}\n\tint num = calc();\n\tif (num >= 0 && (res < 0 || res > num)) {\n\t res = num;\n\t memcpy(ans, flip, sizeof(ans)); \n\t}\n }\n \n for (int i = 0; i < 10; i++) {\n\tfor (int j = 0; j < 10; j++) {\n\t printf(\"%d%c\", ans[i][j], j+1 == 10 ? '\\n' : ' ');\n\t}\n }\n}\n \nint main()\n{\n int Tc;\n cin >> Tc;\n while (Tc--) {\n\tfor (int i = 0; i < 10; i++) {\n\t for (int j = 0; j < 10; j++) {\n\t\tcin >> arr[i][j];\n\t }\n\t}\n\tsolve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3060,
"score_of_the_acc": -0.1935,
"final_rank": 14
},
{
"submission_id": "aoj_0131_1835802",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint mp[10][10],b[10][10];\n\nvoid mark(int y,int x){\n int dx[]={0,0,1,-1},dy[]={1,-1,0,0};\n for(int i=0;i<4;i++) {\n int nx=x+dx[i],ny=y+dy[i];\n if(nx<0||ny<0||nx>=10||ny>=10)continue;\n mp[ny][nx]=!mp[ny][nx];\n }\n mp[y][x]=!mp[y][x];\n}\n\nbool check(){\n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)if(mp[i][j])return 0;\n return 1;\n}\n\nvoid copy(int a[10][10],int b[10][10]){\n for(int i=0;i<10;i++)for(int j=0;j<10;j++)a[i][j]=b[i][j];\n}\n\nint main(){\n int q;\n cin>>q;\n while(q--){\n for(int i=0;i<10;i++)for(int j=0;j<10;j++)cin>>mp[i][j];\n copy(b,mp);\n int ans[10][10]={};\n for(int i=0;!check();i++){\n copy(mp,b),copy(b,mp);\n for(int j=0;j<10;j++)if((ans[0][j]=(i>>j)%2))mark(0,j);\n \n for(int j=1;j<10;j++)\n\tfor(int k=0;k<10;k++)\n\t if((ans[j][k]=mp[j-1][k]))mark(j,k);\n }\n\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++){\n\tif(j) cout <<\" \";\n\tcout << ans[i][j];\n }\n cout <<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0028,
"final_rank": 3
},
{
"submission_id": "aoj_0131_1835801",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\nvoid mark(int mp[10][10],int y,int x){\n int dx[]={0,0,1,-1},dy[]={1,-1,0,0};\n for(int i=0;i<4;i++) {\n int nx=x+dx[i],ny=y+dy[i];\n if(nx<0||ny<0||nx>=10||ny>=10)continue;\n mp[ny][nx]=!mp[ny][nx];\n }\n mp[y][x]=!mp[y][x];\n}\n\nbool check(int mp[10][10]){\n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)if(mp[i][j])return 0;\n return 1;\n}\n\nvoid copy(int a[10][10],int b[10][10]){\n for(int i=0;i<10;i++)for(int j=0;j<10;j++)a[i][j]=b[i][j];\n}\n\nint main(){\n int q;\n cin>>q;\n while(q--){\n int mp[10][10],b[10][10];\n for(int i=0;i<10;i++)for(int j=0;j<10;j++)cin>>mp[i][j];\n\n copy(b,mp);\n int ans[10][10]={};\n for(int i=0;!check(mp);i++){\n copy(mp,b),copy(b,mp);\n for(int j=0;j<10;j++)if((ans[0][j]=((i>>j)%2)))mark(mp,0,j);\n for(int j=1;j<10;j++)\n\tfor(int k=0;k<10;k++)\n\t if((ans[j][k]=mp[j-1][k]))mark(mp,j,k);\n }\n\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++){\n\tif(j) cout <<\" \";\n\tcout << ans[i][j];\n }\n cout <<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0028,
"final_rank": 3
},
{
"submission_id": "aoj_0131_1835799",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\nvoid mark(int mp[10][10],int y,int x){\n int dx[]={0,0,1,-1},dy[]={1,-1,0,0};\n for(int i=0;i<4;i++) {\n int nx=x+dx[i],ny=y+dy[i];\n if(nx<0||ny<0||nx>=10||ny>=10)continue;\n mp[ny][nx]=!mp[ny][nx];\n }\n mp[y][x]=!mp[y][x];\n}\n\nbool check(int mp[10][10]){\n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)if(mp[i][j])return 0;\n return 1;\n}\n\nint main(){\n int q;\n cin>>q;\n while(q--){\n int mp[10][10],b[10][10];\n for(int i=0;i<10;i++)for(int j=0;j<10;j++)cin>>mp[i][j],b[i][j]=mp[i][j];\n\n int ans[10][10]={};\n for(int i=0;!check(mp);i++){\n for(int j=0;j<10;j++)for(int k=0;k<10;k++) mp[j][k]=b[j][k];\n for(int j=0;j<10;j++)for(int k=0;k<10;k++) b[j][k]=mp[j][k];\n\n for(int j=0;j<10;j++)if((ans[0][j]=((i>>j)%2)))mark(mp,0,j);\n for(int j=1;j<10;j++)\n\tfor(int k=0;k<10;k++)\n\t if((ans[j][k]=mp[j-1][k]))mark(mp,j,k);\n }\n\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++){\n\tif(j) cout <<\" \";\n\tcout << ans[i][j];\n\tassert(ans[i][j]==0||ans[i][j]==1);\n }\n cout <<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0028,
"final_rank": 3
},
{
"submission_id": "aoj_0131_1788164",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int n;\n cin >> n;\n while(n--){\n int dtct[10][10];\n int dx[] = {-1, 0, 1, 0};\n int dy[] = {0, 0, 0, 1};\n for(int i = 0; i < 10; i++){\n for(int j = 0; j < 10; j++){\n\tcin >> dtct[i][j];\n }\n }\n \n for(int i = 0; i < 1 << 10; i++){\n int axi[10][10] = {{0}};\n int tmp[10][10] = {{0}};\n for(int j = 0; j < 10; j++){\n\taxi[0][j] = (i >> j) & 1;\n\tif(axi[0][j] == 0) continue;\n\tfor(int k = 0; k < 4; k++){\n\t int nx = j + dx[k], ny = dy[k];\n\t if(nx < 0 || 10 <= nx || ny < 0 || 10 <= ny) continue;\n\t tmp[ny][nx]++;\n\t}\n }\n for(int j = 1; j < 10; j++){\n\tfor(int k = 0; k < 10; k++){\n\t if((dtct[j-1][k]+tmp[j-1][k])%2 == 1){\n\t axi[j][k] = 1;\n\t for(int l = 0; l < 4; l++){\n\t int nx = k + dx[l], ny = j + dy[l];\n\t if(nx < 0 || 10 <= nx || ny < 0 || 10 <= ny) continue;\n\t tmp[ny][nx]++;\n\t }\n\t }\n\t}\n }\n bool flag = true;\n for(int j = 0; j < 10; j++){\n\tif((tmp[9][j]+dtct[9][j])%2 == 1) flag = false;\n }\n if(flag){\n\tfor(int j = 0; j < 10; j++){\n\t for(int k = 0; k < 10; k++) cout << axi[j][k] << (k == 9 ? \"\\n\":\" \");\n\t}\n\tbreak;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0028,
"final_rank": 3
},
{
"submission_id": "aoj_0131_1788103",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n while(n--){\n int mp[12][12],ans[12][12];\n for(int i=1;i<=10;i++)for(int j=1;j<=10;j++) cin>>mp[i][j];\n int cp[12][12];\n\n for(int i=0;i<(1<<10);i++){\n \n for(int j=1;j<=10;j++)\n\tfor(int k=1;k<=10;k++)cp[j][k]=mp[j][k],ans[j][k]=0;\n for(int j=0;j<10;j++){\n\tif(i&(1<<j)){\n\t cp[1][j+1]=!cp[1][j+1];\n\t cp[1][j]=!cp[1][j];\n\t cp[1][j+2]=!cp[1][j+2];\n\t cp[2][j+1]=!cp[2][j+1];\n\t ans[1][j+1]=1;\n\t}\n }\n for(int j=2;j<=10;j++){\n\tfor(int k=1;k<=10;k++){\n\t if(cp[j-1][k]){\n\t cp[j-1][k]=!cp[j-1][k];\n\t cp[j][k]=!cp[j][k];\n\t cp[j][k-1]=!cp[j][k-1];\n\t cp[j][k+1]=!cp[j][k+1];\n\t cp[j+1][k]=!cp[j+1][k];\n\t ans[j][k]=1;\n\t }\n\t}\n }\n int f=0;\n for(int j=1;j<=10;j++)\n\tfor(int k=1;k<=10;k++)\n\t if(cp[j][k])f=1;\n if(!f)break;\n }\n\n for(int i=1;i<=10;i++){\n for(int j=1;j<=10;j++){\n\tif(j!=1)cout<<' ';\n\tcout<<ans[i][j];\n }\n cout<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0028,
"final_rank": 3
},
{
"submission_id": "aoj_0131_1595967",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <sstream>\n#include <algorithm>\n#include <math.h>\n#include <map>\n#include <functional>\n#include <iomanip>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <set>\n#include <typeinfo>\n#define PI 3.14159265359\n#define INF 99999999\n#define rep(i, n) for(int i=0; i<n; i++)\n#define REP(n) rep(i, n)\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\nusing namespace std;\ntypedef pair<int, int> P;\n \nint n;\nconst int dx[5] = {-1, 0, 0, 0, 1};\nconst int dy[5] = {0, -1, 0, 1, 0};\nint tile[10][10];\nint flip[10][10];\n\nint get(int x, int y)\n{\n\tint c = tile[y][x];\n\trep(d, 5)\n\t{\n\t\tint x2 = x + dx[d];\n\t\tint y2 = y + dy[d];\n\t\tif (0 <= x2 && x2 < 10 && 0 <= y2 && y2 < 10)\n\t\t{\n\t\t\tc += flip[y2][x2];\n\t\t}\n\t}\n\treturn c % 2;\n}\n\nvoid print()\n{\n\trep(i, 10)\n\t{\n\t\trep(j, 10)\n\t\t{\n\t\t\tif (j == 9)\n\t\t\t{\n\t\t\t\tprintf(\"%d\\n\", flip[i][j]);\n\t\t\t} else {\n\t\t\t\tprintf(\"%d \", flip[i][j]);\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool calc()\n{\n\tfor (int i=1; i<10; i++)\n\t{\n\t\tfor (int j=0; j<10; j++)\n\t\t{\n\t\t\tif (get(j, i-1) != 0)\n\t\t\t{\n\t\t\t\tflip[i][j] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int j=0; j<10; j++)\n\t{\n\t\tif (get(j, 9) != 0)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nint main()\n{\n\tcin >> n;\n\n\tREP(n)\n\t{\n\t\trep(j, 10)\n\t\t{\n\t\t\trep(k, 10)\n\t\t\t{\n\t\t\t\tcin >> tile[j][k];\n\t\t\t}\n\t\t}\n\n\t\tfor (int j=0; j<(1<<10); j++)\n\t\t{\n\t\t\tmemset(flip, 0, sizeof(flip));\n\t\t\tfor (int k=0; k<10; k++)\n\t\t\t{\n\t\t\t\tflip[0][10-k-1] = j >> k & 1;\n\t\t\t}\n\t\t\t\n\t\t\tif (calc())\n\t\t\t{\n\t\t\t\tprint();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t/*\n\t\t//デバッグ\n\t\trep(j, 10)\n\t\t{\n\t\t\trep(k, 10)\n\t\t\t{\n\t\t\t\tprintf(\"%d \", tile[j][k]);\t\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t\t*/\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1144,
"score_of_the_acc": -0.0012,
"final_rank": 1
},
{
"submission_id": "aoj_0131_1593020",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\nvoid frip(int y, int x, int map[10][10]){\n\tif(y < 0 || x < 0 || y >= 10 || x >= 10){\n\t\treturn;\n\t}else{\n\t\tmap[y][x] = !map[y][x];\n\t}\n}\n\nvoid frips(int y, int x, int map[10][10]){\n\tfrip(y - 1, x, map);\n\tfrip(y + 1, x, map);\n\tfrip(y, x, map);\n\tfrip(y, x - 1, map);\n\tfrip(y, x + 1, map);\n}\n\nint main(){\n\t\n\tint n;\n\t\n\tint origin[10][10];\n\t\n\tint f_point[10][10];\n\t\n\tint map[10][10];\n\t\n\tbool checker;\n\t\n\tcin >> n;\n\t\n\tint N = 10;\n\n\tfor(int loop = 0; loop < n; loop++){\n\t\t\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tfor(int j = 0; j < N; j++){\n\t\t\t\tcin >> origin[i][j];\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < (1 << N); i++){\n\t\t\t\n\t\t\tfor(int x = 0; x < N; x++){\n\t\t\t\tfor(int y = 0; y < N; y++){\n\t\t\t\t\tmap[y][x] = origin[y][x];\n\t\t\t\t\tf_point[y][x] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int x = 0; x < N; x++){\n\t\t\t\tif((i & (1 << (N - x - 1))) != 0){\n\t\t\t\t\tfrips(0, x, map);\n\t\t\t\t\tf_point[0][x] = 1;\n\t\t\t\t}else{\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor(int y = 1; y < N; y++){\n\t\t\t\tfor(int x = 0; x < N; x++){\n\t\t\t\t\tif(map[y - 1][x]){\n\t\t\t\t\t\tfrips(y, x, map);\n\t\t\t\t\t\tf_point[y][x] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tchecker = true;\n\t\t\t\n\t\t\tfor(int x = 0; x < N; x++){\n\t\t\t\tif(map[N - 1][x]){\n\t\t\t\t\tchecker = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(checker){\n\t\t\t\tfor(int y = 0; y < N; y++){\n\t\t\t\t\tif(f_point[y][0]){\n\t\t\t\t\t\tprintf(\"1\");\n\t\t\t\t\t}else{\n\t\t\t\t\t\tprintf(\"0\");\n\t\t\t\t\t}\n\t\t\t\t\tfor(int x = 1; x < N; x++){\n\t\t\t\t\t\tif(f_point[y][x]){\n\t\t\t\t\t\t\tprintf(\" 1\");\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tprintf(\" 0\");\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tprintf(\"\\n\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1132,
"score_of_the_acc": -0.0294,
"final_rank": 12
},
{
"submission_id": "aoj_0131_1544809",
"code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<vector>\n#include<cmath>\n#include<cstring>\n#include<cstdio>\n#include<time.h>\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()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst int inf=1e8;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nvvi out(10,vi(10)),in(10,vi(10)),tmp(10,vi(10));\nvi top(10);\nint dx[]={-1,0,0,0,1};\nint dy[]={0,-1,0,1,0};\nbool solve2(){\n\trep(i,10)rep(j,10)out[i][j]=0;\n\ttmp=in;\n\trep(i,10)if(top[i]){\n\t\tout[0][i]=1;\n\t\trep(j,5){\n\t\t\tint nx=dx[j];\n\t\t\tint ny=i+dy[j];\n\t\t\tif(nx>=0&&nx<10&&ny>=0&&ny<10)tmp[nx][ny]=!tmp[nx][ny];\n\t\t}\n\t}\n\tloop(i,1,10)rep(j,10)if(tmp[i-1][j]){\n\t\tout[i][j]=1;\n\t\trep(k,5){\n\t\t\tint nx=i+dx[k];\n\t\t\tint ny=j+dy[k];\n\t\t\tif(nx>=0&&nx<10&&ny>=0&&ny<10)tmp[nx][ny]=!tmp[nx][ny];\n\t\t}\n\t}\n\tbool h=true;\n\trep(i,10)rep(j,10)if(tmp[i][j])h=false;\n\treturn h;\n}\nbool solve(int a){\n\tif(a==10)if(solve2())return true;\n\telse return false;\n\t\n\ttop[a]=1;\n\tif(solve(a+1))return true;\n\ttop[a]=0;\n\tif(solve(a+1))return true;\n\treturn false;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\twhile(n--){\n\t\trep(i,10)top[i]=0;\n\t\trep(i,10)rep(j,10)cin>>in[i][j];\n\t\tsolve(0);\n\t\trep(i,10){\n\t\t\trep(j,9)cout<<out[i][j]<<\" \";\n\t\t\tcout<<out[i][9]<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1212,
"score_of_the_acc": -0.008,
"final_rank": 10
},
{
"submission_id": "aoj_0131_1543500",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF 999999999\nint ans[11][11]={};\n\nvector<vector<int> > d(int y,int x,vector<vector<int> > t){\n int dx[]={0,0,0,-1,1};\n int dy[]={-1,0,1,0,0};\n rep(k,5){\n int ddy=y+dy[k],ddx=x+dx[k];\n if(ddx>=0&&ddy>=0&&ddx<10&&ddy<10){\n t[ddy][ddx]=!t[ddy][ddx];\n }\n }\n return t;\n}\n\nint main(){\n int n;\n cin>>n;\n rep(loop,n){\n vector<vector<int> > data;\n rep(i,10){\n vector<int> a(10);\n rep(j,10)cin>>a[j];\n data.pb(a);\n }\n// rep(i,10){rep(j,10)cout<<data[i][j]<<\" \";cout<<endl;}\n rep(i,1<<10){\n vector<vector<int> > t=data;\n rep(j,11)rep(k,11)ans[j][k]=0;\n rep(j,10){\n ans[0][j]=((i&(1<<j))!=0);\n if(ans[0][j])t=d(0,j,t);\n }\n for(int j=1;j<10;j++){\n for(int k=0;k<10;k++){\n if(t[j-1][k]==1){\n ans[j][k]=1;\n t=d(j,k,t);\n }\n }\n }\n bool f=true;\n rep(j,10){\n if(t[9][j]==1)f=false;\n }\n if(f){\n rep(j,10){\n rep(k,10){\n if(k)cout<<\" \";\n cout<<ans[j][k];\n }\n cout<<endl;\n }\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 1220,
"score_of_the_acc": -1.0088,
"final_rank": 19
},
{
"submission_id": "aoj_0131_1490450",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<climits>\n#include<string>\n#include<vector>\n#include<list>\n#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cstring>\n#include<stack>\n#include<functional>\n#include<sstream>\nusing namespace std;\ntypedef long long ll;\n\nconst ll MOD = 1000000007;\nint dx[5] = {0, 1, 0, -1, 0}, dy[5] = {0, 0, 1, 0, -1};\nint fld[10][10];\n\nvoid Reverse(int x, int y, int cnt[10][10])\n{\n\tfor(int i = 0; i < 5; i++)\n\t{\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tif(0 <= nx && nx < 10 && 0 <= ny && ny < 10) cnt[ny][nx]++;\n\t}\n}\n\nint main(){\n\tint N;\n\tcin >> N;\n\tfor(int c = 0; c < N; c++)\n\t{\n\t\tfor(int i = 0; i < 10; i++)\n\t\t{\n\t\t\tfor(int j = 0; j < 10; j++)\n\t\t\t{\n\t\t\t\tcin >> fld[i][j];\n\t\t\t}\n\t\t}\n\n\t\tbool ans = false;\n\t\tint out[10][10];\n\t\tfor(int p = 0; p < (1 << 10); p++)\n\t\t{\n\t\t\tint cnt[10][10] = {};\n\t\t\tfor(int i = 0; i < 10; i++)\n\t\t\t{\n\t\t\t\tout[0][i] = ((p >> i) & 1);\n\t\t\t\tif(out[0][i] == 1) Reverse(i, 0, cnt);\n\t\t\t}\n\t\t\tfor(int i = 0; i < 9; i++)\n\t\t\t{\n\t\t\t\tfor(int j = 0; j < 10; j++)\n\t\t\t\t{\n\t\t\t\t\tif(((fld[i][j] + cnt[i][j]) & 1) == 1)\n\t\t\t\t\t{\n\t\t\t\t\t\tout[i + 1][j] = 1;\n\t\t\t\t\t\tReverse(j, i + 1, cnt);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tout[i + 1][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tans = true;\n\t\t\tfor(int i = 0; i < 10; i++)\n\t\t\t{\n\t\t\t\tif(((fld[9][i] + cnt[9][i]) & 1) == 1) ans = false;\n\t\t\t}\n\t\t\tif(ans) break;\n\t\t}\n\n\t\tfor(int i = 0; i < 10; i++)\n\t\t{\n\t\t\tprintf(\"%d\", out[i][0]);\n\t\t\tfor(int j = 1; j < 10; j++)\n\t\t\t{\n\t\t\t\tprintf(\" %d\", out[i][j]);\n\t\t\t}\n\t\t\tputs(\"\");\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1148,
"score_of_the_acc": -0.0016,
"final_rank": 2
},
{
"submission_id": "aoj_0131_1477021",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int dx[]={-1,0,1,0,0};\nconst int dy[]={0,-1,0,1,0};\n\nint ans[10][10];\nint latte[10][10];\n\nvoid change(int y,int x){\n for(int d=0;d<5;d++){\n int ty=y+dy[d],tx=x+dx[d];\n if(ty<0||ty>=10||tx<0||tx>=10)continue;\n latte[ty][tx]=1-latte[ty][tx];\n }\n}\n\nvoid solve(){\n int fld[10][10];\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++){\n cin>>fld[i][j];\n }\n }\n\n for(int s=0;s<(1<<11);s++){\n fill_n(*ans,100,0);\n\n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)\n latte[i][j]=fld[i][j];\n\n for(int i=0;i<10;i++){\n if((s>>i)&1){\n ans[0][i]=1;\n change(0,i);\n }\n }\n\n for(int i=1;i<10;i++){\n for(int j=0;j<10;j++){\n if(latte[i-1][j]){\n ans[i][j]=1;\n change(i,j);\n }\n }\n }\n\n bool f=true;\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++){\n if(latte[i][j])f=false;\n }\n }\n\n if(f){\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++){\n if(j)cout<<\" \";\n cout<<ans[i][j];\n }\n cout<<endl;\n }\n return;\n }\n }\n}\n\nint main(){\n int N;\n cin>>N;\n while(N--)solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0028,
"final_rank": 3
}
] |
aoj_0120_cpp
|
パティシエ
ケーキ屋さんが、まちまちな大きさのロールケーキをたくさん作りました。あなたは、このケーキを箱に並べる仕事を任されました。
ロールケーキはとてもやわらかいので、他のロールケーキが上に乗るとつぶれてしまいます。ですから、図(a) のように全てのロールケーキは必ず箱の底面に接しているように並べなければなりません。並べ替えると必要な幅も変わります。
図(a)
図(b)
n
個のロールケーキの半径
r
1
,
r
2
, ...,
r
n
と箱の長さを読み込み、それぞれについて、箱の中にうまく収まるかどうか判定し、並べる順番を工夫すると箱に入る場合は "OK"、どう並べても入らない場合には "NA"を出力するプログラムを作成してください。
ロールケーキの断面は円であり、箱の壁の高さは十分に高いものとします。 ただし、ロールケーキの半径は 3 以上 10 以下の整数とします。つまり、ケーキの半径に極端な差はなく、図(b) のように大きなケーキの間に小さなケーキがはまり込んでしまうことはありません。
Input
入力は複数のデータセットからなります。各データセットは以下の形式で与えられます。
W
r
1
r
2
...
r
n
最初に箱の長さを表す整数
W
(1 ≤
W
≤ 1,000) が与えられます。 続いて、空白区切りで各ロールケーキの半径を表す整数
r
i
(3 ≤
r
i
≤ 10) が与えられます。ケーキの個数
n
は 12 以下です。
データセットの数は 50 を超えません。
Output
データセットごとに OK または NA を１行に出力してください。
Sample Input
30 4 5 6
30 5 5 5
50 3 3 3 10 10
49 3 3 3 10 10
Output for the Sample Input
OK
OK
OK
NA
|
[
{
"submission_id": "aoj_0120_10848611",
"code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\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); }\n\n// template<typename T> T inf;\n// template<> constexpr int inf<int> = 1e9;\n// template<> constexpr ll inf<ll> = 1e18;\n// template<> constexpr ld inf<ld> = 1e30;\n\nstruct yes_no : numpunct<char> {\n string_type do_truename() const { return \"Yes\"; }\n string_type do_falsename() const { return \"No\"; }\n};\n\nld dp[1 << 12][16];\n\nint main() {\n locale loc(locale(), new yes_no);\n cout << boolalpha;\n cout.imbue(loc);\n string line;\n while (getline(cin, line)) {\n istringstream is(line);\n int W, in;\n is >> W;\n vector<int> r;\n while (is >> in) r.push_back(in);\n const int n = r.size();\n REP(bit,1<<n) REP(i,n) dp[bit][i] = 1e18;\n REP(i,n) dp[1 << i][i] = r[i];\n REP(bit,1<<n) REP(i,n) REP(j,n) {\n if (!((bit >> i) & 1)) continue;\n if ((bit >> j) & 1) continue;\n const ld d = sqrt((r[i] + r[j]) * (r[i] + r[j]) - (r[i] - r[j]) * (r[i] - r[j]));\n chmin(dp[bit | (1 << j)][j], dp[bit][i] + d);\n }\n ld min_w = 1e18;\n REP(i,n) chmin(min_w, dp[(1 << n) - 1][i] + r[i]);\n if (min_w < W + 1e-9) cout << \"OK\" << endl;\n else cout << \"NA\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4376,
"score_of_the_acc": -0.2048,
"final_rank": 17
},
{
"submission_id": "aoj_0120_7168079",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ndouble memo[15][15][10000];\ndouble INF = 10001000;\nvector<double> vec;\ndouble dp(int id, int bef, int bit){\n if(id == vec.size()) return 0;\n if(memo[id][bef][bit]!=INF) return memo[id][bef][bit];\n double res = INF;\n for(int i=0;i<vec.size();i++){\n if((bit&1<<i) == 0){\n if(id == 0) res = min(res, dp(id+1, i, (1<<i))+vec[i]*2);\n else{\n double dist = sqrt(pow(vec[i]+vec[bef], 2)-pow(vec[i]-vec[bef], 2));\n res = min(res, dp(id+1, i, (bit|1<<i))+dist+vec[i]-vec[bef]);\n }\n }\n }\n return memo[id][bef][bit] = res;\n}\nint main(){\n string str;\n double w, r;\n while(getline(cin, str)){\n stringstream ss(str);\n ss >> w;\n while(ss >> r) vec.push_back(r);\n fill_n(**memo, 15*15*10000, INF);\n if(w >= dp(0, 0, 0)) cout << \"OK\" << endl;\n else cout << \"NA\" << endl;\n vec.clear();\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 20796,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0120_7108709",
"code_snippet": "#line 1 \"library/my_template.hpp\"\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\n\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n// https://trap.jp/post/1224/\n#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)\n#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)\n#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)\n#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))\n#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)\n#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\n#define FOR_R(...) \\\n overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\n\n#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))\n#define all(x) x.begin(), x.end()\n#define len(x) ll(x.size())\n#define elif else if\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n\ntemplate <typename T, typename U>\nT SUM(const vector<U> &A) {\n T sum = 0;\n for (auto &&a: A) sum += a;\n return sum;\n}\n\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)))\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n\nint popcnt(int x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(ll x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT pick(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\n\ntemplate <typename T>\nT pick(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(pqg<T> &que) {\n assert(que.size());\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(vc<T> &que) {\n assert(que.size());\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename T, typename U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <typename T, typename U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <typename T, typename U>\npair<T, T> divmod(T x, U y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng) {\n assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return ok;\n}\n\ntemplate <typename F>\ndouble binary_search_real(F check, double ok, double ng, int iter = 100) {\n FOR(iter) {\n double x = (ok + ng) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return (ok + ng) / 2;\n}\n\ntemplate <class T, class S>\ninline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\ntemplate <class T, class S>\ninline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n FOR(i, S.size()) { A[i] = S[i] - first_char; }\n return A;\n}\n\ntemplate <typename T, typename U>\nvector<T> cumsum(vector<U> &A, int off = 1) {\n int N = A.size();\n vector<T> B(N + 1);\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\ntemplate <typename CNT, typename T>\nvc<CNT> bincount(const vc<T> &A, int size) {\n vc<CNT> C(size);\n for (auto &&x: A) { ++C[x]; }\n return C;\n}\n\n// stable\ntemplate <typename T>\nvector<int> argsort(const vector<T> &A) {\n vector<int> ids(A.size());\n iota(all(ids), 0);\n sort(all(ids),\n [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\n int n = len(I);\n vc<T> B(n);\n FOR(i, n) B[i] = A[I[i]];\n return B;\n}\n#line 1 \"library/other/io2.hpp\"\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 long double __VA_ARGS__; \\\n IN(__VA_ARGS__)\n\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n read(name)\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n read(name)\n\nvoid read(int &a) { cin >> a; }\nvoid read(long long &a) { cin >> a; }\nvoid read(char &a) { cin >> a; }\nvoid read(double &a) { cin >> a; }\nvoid read(long double &a) { cin >> a; }\nvoid read(string &a) { cin >> a; }\ntemplate <class T, class S> void read(pair<T, S> &p) { read(p.first), read(p.second); }\ntemplate <class T> void read(vector<T> &a) {for(auto &i : a) read(i);}\ntemplate <class T> void read(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\n read(head);\n IN(tail...);\n}\n\ntemplate <typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& A) {\n os << A.fi << \" \" << A.se;\n return os;\n}\n\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& A) {\n for (size_t i = 0; i < A.size(); i++) {\n if(i) os << \" \";\n os << A[i];\n }\n return os;\n}\n\nvoid print() {\n cout << \"\\n\";\n cout.flush();\n}\n\ntemplate <class Head, class... Tail>\nvoid print(Head&& head, Tail&&... tail) {\n cout << head;\n if (sizeof...(Tail)) cout << \" \";\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\n#line 1 \"library/string/split.hpp\"\nvc<string> split(string S, char sep = ',') {\n vc<string> res = {\"\"};\n for (auto&& s: S) {\n if (s == sep)\n res.eb(\"\");\n else\n res.back() += s;\n }\n return res;\n}\n\nvc<string> split(string S, string seps = \" ,\") {\n vc<string> res = {\"\"};\n for (auto&& s: S) {\n if (count(all(seps), s))\n res.eb(\"\");\n else\n res.back() += s;\n }\n return res;\n}\n#line 4 \"main.cpp\"\n\nvoid solve() {\n string line;\n while (getline(cin, line)) {\n auto tokens = split(line, \" \");\n ll W = stoi(tokens[0]);\n vi A;\n FOR(i, 1, len(tokens)) { A.eb(stoi(tokens[i])); }\n using Re = double;\n const ll INF = 1LL << 60;\n ll N = len(A);\n vv(Re, dp, 1 << N, N, INF);\n FOR(i, N) dp[1 << i][i] = A[i];\n FOR(s, 1 << N) FOR(i, N) {\n FOR(j, N) {\n int t = s | 1 << j;\n if (s == t) continue;\n Re a = 2 * sqrt(A[i] * A[j]);\n chmin(dp[t][j], dp[s][i] + a);\n }\n }\n bool ok = 0;\n FOR(i, N) {\n if (dp[(1 << N) - 1][i] + A[i] <= W) ok = 1;\n }\n print(ok ? \"OK\" : \"NA\");\n }\n}\n\nsigned main() {\n solve();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3588,
"score_of_the_acc": -0.3026,
"final_rank": 18
},
{
"submission_id": "aoj_0120_6976745",
"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\n\nint main(){\n\t\n\tint w;\n\twhile(cin>>w){\n\t\tcin.ignore();\n\t\tvector<int> r;\n\t\tstring s;\n\t\tgetline(cin, s);\n stringstream ss(s);\n while(!ss.eof()){\n\t\t\tint t;\n ss >> t;\n r.push_back(t);\n }\n\t\t\n\t\tint n = r.size();\n\t\tvector dp(1<<n,vector<double>(n,1e9));\n\t\trep(i,n){\n\t\t\tdp[1<<i][i] = r[i];\n\t\t}\n\t\t\n\t\trep(i,1<<n){\n\t\t\tif(i==0)continue;\n\t\t\trep(j,n){\n\t\t\t\tif(dp[i][j]==1e9)continue;\n\t\t\t\trep(k,n){\n\t\t\t\t\tif((i>>k)&1)continue;\n\t\t\t\t\tdp[i|(1<<k)][k] = min(dp[i|(1<<k)][k], dp[i][j] + sqrt(pow(r[j]+r[k],2.0) - pow(abs(r[j]-r[k]),2.0)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdouble ans = 1e9;\n\t\t\n\t\trep(j,n){\n\t\t\tans = min(ans,dp.back()[j] + r[j]);\n\t\t}\n\n\t\t//cout<<ans<<endl;\n\t\tif(ans < w+1e-10)cout<<\"OK\"<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t\t\n\t}\n\t\t\n\t\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3604,
"score_of_the_acc": -0.0178,
"final_rank": 7
},
{
"submission_id": "aoj_0120_6972737",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n vector<string> v;\n string str,s;\n getline(cin,str);\n stringstream ss{str};\n while(getline(ss,s,' ')) v.push_back(s);\n if(str == \"\") break;\n int w = stoi(v[0]);\n long double W = w;\n int N = v.size()-1;\n vector<int> r(N);\n for(int i=0;i<N;i++) r[i] = stoi(v[i+1]);\n vector<long double> R(N);\n for(int i=0;i<N;i++) R[i] = r[i];\n vector<vector<long double>> dp((1<<N),vector<long double>(N,1000000000));\n for(int i=0;i<N;i++) dp[(1<<i)][i] = R[i];\n for(int i=1;i<(1<<N);i++){\n for(int j=0;j<N;j++){\n if(i & (1<<j)){\n for(int k=0;k<N;k++){\n if(!(i & (1<<k))){\n long double val = dp[i][j]+sqrt((R[j]+R[k])*(R[j]+R[k])-(R[j]-R[k])*(R[j]-R[k]));\n if(i+(1<<k) == (1<<N)-1) val += R[k];\n dp[i+(1<<k)][k] = min(dp[i+(1<<k)][k],val);\n }\n }\n }\n }\n }\n long double Min = 1000000000;\n for(int i=0;i<N;i++) Min = min(Min,dp[(1<<N)-1][i]);\n if(Min <= W) cout << \"OK\" << endl;\n else cout << \"NA\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3900,
"score_of_the_acc": -0.1776,
"final_rank": 13
},
{
"submission_id": "aoj_0120_6938663",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n string s;\n while(getline(cin, s)){\n vector<int> a;\n a.push_back(0);\n for(int i = 0; i < s.size(); i++){\n if(s[i] == ' '){\n a.push_back(0);\n }else{\n a.back() *= 10;\n a.back() += s[i] - '0';\n }\n }\n int W = a[0];\n a.erase(a.begin());\n int n = a.size();\n vector<vector<double>> dp(1 << n, vector<double>(n, 1 << 30));\n for(int i = 0; i < n; i++)dp[1 << i][i] = a[i];\n for(int i = 0; i < (1 << n); i++){\n for(int j = 0; j < n; j++){\n if(~i >> j & 1)continue;\n for(int k = 0; k < n; k++){\n if(i >> k & 1)continue;\n dp[i | (1 << k)][k] = min(dp[i | (1 << k)][k], dp[i][j] + 2 * sqrt(a[j] * a[k]));\n }\n }\n }\n double ans = 1 << 30;\n for(int i = 0; i < n; i++)ans = min(ans, dp.back()[i] + a[i]);\n cout << (ans <= W ? \"OK\" : \"NA\") << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3432,
"score_of_the_acc": -0.008,
"final_rank": 4
},
{
"submission_id": "aoj_0120_5831956",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\ndouble dp[4096][12];\nsigned main(){\n\tint w;\n\twhile(cin>>w){\n\t\tstring s;\n\t\tgetline(cin,s);\n\t\tstringstream ss(s);\n\t\tint num;\n\t\tvector<int>r;\n\t\twhile(ss>>num)\n\t\t\tr.push_back(num);\n\t\tint n=r.size();\n\t\tbool ok=0;\n\t\tfor(int s=0;s<1<<n;s++){\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tif(~s>>i&1)\n\t\t\t\t\tcontinue;\n\t\t\t\tdp[s][i]=inf;\n\t\t\t\tint ps=s&~(1<<i);\n\t\t\t\tif(ps==0)\n\t\t\t\t\tdp[s][i]=r[i];\n\t\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\t\tif(ps>>j&1)\n\t\t\t\t\t\tdp[s][i]=min(dp[s][i],dp[ps][j]+2*sqrt(r[i]*r[j]));\n\t\t\t\tif(s==(1<<n)-1){\n\t\t\t\t\tdp[s][i]+=r[i];\n\t\t\t\t\tif(dp[s][i]<=w)\n\t\t\t\t\t\tok=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<(ok?\"OK\":\"NA\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3744,
"score_of_the_acc": -0.0258,
"final_rank": 9
},
{
"submission_id": "aoj_0120_4432259",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nint main() {\n string s;\n while(getline(cin, s)){\n vector<int> v{0};\n for (auto &&i : s) {\n if(i == ' ') v.emplace_back(0);\n else v.back() = v.back()*10+i-'0';\n }\n int W = v.front();\n int n = v.size()-1;\n vector<int> A(v.begin()+1,v.end());\n auto dp = make_v(n, 1 << n, 1e12);\n for (int i = 0; i < n; ++i) {\n dp[i][1 << i] = A[i];\n }\n for (int j = 0; j < (1 << n); ++j) {\n for (int i = 0; i < n; ++i) {\n for (int k = 0; k < n; ++k) {\n if(!(j & (1 << k))){\n chmin(dp[k][j^(1 << k)], dp[i][j]+2*sqrt(A[i]*A[k]));\n }\n }\n }\n }\n int ok = 0;\n for (int i = 0; i < n; ++i) {\n if(dp[i].back()+A[i] <= W+1e-10) ok = 1;\n }\n puts(ok ? \"OK\" : \"NA\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3384,
"score_of_the_acc": -0.1481,
"final_rank": 11
},
{
"submission_id": "aoj_0120_4149376",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ndouble RofCake[12];\ndouble Dp[4096][12];\n\nconst double INF = DBL_MAX;\n\nunsigned popcnt(unsigned u)\n{\n\tunsigned ret = 0;\n\twhile (u)\n\t{\n\t\tu = (u & (u - 1));\n\t\tret++;\n\t}\n\treturn ret;\n}\n\ndouble getDistance(double r1, double r2)\n{\n\treturn sqrt(pow(r1 + r2, 2) - pow(r1 - r2, 2));\n}\n\ndouble solve(int index) {\n\tint next;\n\tdouble ans;\n\n\tfor (int i = 0; i < (1<<index); i++) {\n\t\tfor (int j = 0; j < index; j++) {\n\t\t\tfor (int k = 0; k < index; k++) {\n\t\t\t\tnext = i | (1 << j);\n\t\t\t\tif (i == 0) {\n\t\t\t\t\tDp[next][j] = min( Dp[next][j], RofCake[j]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (Dp[i][k] == INF) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (popcnt(next) == index) {\n\t\t\t\t\tDp[next][j] = min(Dp[next][j], Dp[i][k] + getDistance(RofCake[k], RofCake[j]) + RofCake[j]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tDp[next][j] = min(Dp[next][j], Dp[i][k]+getDistance(RofCake[k],RofCake[j]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tans = INF;\n\tfor (int i = 0; i < index; i++) {\n\t\tans = min(ans, Dp[(1 << index) - 1][i]);\n\t}\n\n\treturn ans;\n}\n\n\nint main() {\n\tint w, index;\n\tstring str;\n\tstringstream ss;\n\tdouble ans;\n\n\twhile (getline(cin,str)) {\n\t\tss << str;\n\t\tss >> w;\n\t\tindex = 0;\n\t\tmemset(RofCake, 0, sizeof(RofCake));\n\t\twhile (ss >> RofCake[index]) {\n\t\t\t//cout<<RofCake[index]<<ends;\n\t\t\tindex++;\n\t\t}\n\t\t//cout << index << endl;\n\t\tfor (int i = 0; i < (1 << index); i++) {\n\t\t\tfor (int j = 0; j < index; j++) {\n\t\t\t\tDp[i][j] = INF;\n\t\t\t}\n\t\t}\n\n\t\tans = solve(index);\n\n\t\tif (ans > w) {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"OK\" << endl;\n\t\t}\n\n\t\tstr = \"\";\n\t\tss.clear();\n\t}\n\t\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3608,
"score_of_the_acc": -0.3038,
"final_rank": 19
},
{
"submission_id": "aoj_0120_3704682",
"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++)\n#ifdef _DEBUG_\n#define dump(val) cerr << __LINE__ << \":\\t\" << #val << \" = \" << (val) << endl\n#else\n#define dump(val)\n#endif\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntemplate<typename T>\nvector<T> make_v(size_t a, T b) {\n return vector<T>(a, b);\n}\ntemplate<typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n return vector<decltype(make_v(ts...))>(a, make_v(ts...));\n}\n\nint string2int(string s) {\n return atoi(s.c_str());\n}\n\nvector<int> parseInputs(string &s) {\n vector<int> res;\n s += \" \";\n int lst = 0;\n REP(i, 0, s.size()) {\n if (s[i] == ' ') {\n res.push_back(string2int(s.substr(lst, i - lst)));\n lst = i + 1;\n }\n }\n return res;\n}\n\n#include <cmath>\ndouble calcDist(double r1, double r2) {\n return sqrt(r1 * r1 - r2 * r2);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n string s;\n while (true) {\n getline(cin, s);\n if (s.size() == 0) break;\n auto res = parseInputs(s);\n int W = res[0];\n res.erase(res.begin());\n int n = res.size();\n auto dp = make_v(1 << n, n, 1e+15);\n REP(i, 0, n) {\n dp[1 << i][i] = res[i];\n }\n REP(i, 1, 1 << n) {\n REP(j, 0, n) {\n if (!((i >> j) & 1)) continue;\n REP(k, 0, n) {\n if ((i >> k) & 1) continue;\n double dist = calcDist(res[j] + res[k], abs(res[j] - res[k]));\n int nxt = i | (1 << k);\n dp[nxt][k] = min(dp[nxt][k], dp[i][j] + dist);\n }\n }\n }\n double ans = 1e+15;\n REP(i, 0, n) {\n ans = min(ans, dp[(1 << n) - 1][i] + res[i]);\n }\n ans -= 1e-6;\n cout << (ans <= W ? \"OK\" : \"NA\") << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3292,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0120_3317321",
"code_snippet": "#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\n#define FOE(i,a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT(n) (1LL<<(n))\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());\n\ntypedef long long LL;\ntemplate<typename T> using V = std::vector<T>;\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\n\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \" \";} std::cout << v[i];} std::cout << \"\\n\"; }\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\n\nconst int INF = 1L << 30;\nconst double EPS = 1e-9;\nconst std::string YES = \"YES\", Yes = \"Yes\", NO = \"NO\", No = \"No\";\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\n\nusing namespace std;\n\n// strをdelimiterで分割する\nvector<string> split(const string &str, const string &delimiter) {\n vector<string> res;\n size_t current = 0, found, delimlen = delimiter.size();\n while ((found = str.find(delimiter, current)) != string::npos) {\n res.emplace_back(string(str, current, found - current));\n current = found + delimlen;\n }\n res.emplace_back(string(str, current, str.size() - current));\n return res;\n}\n\nint main() {\n cin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tstring s;\n\twhile (getline(cin, s)) {\n\t vector<string> raw = split(s, \" \");\n\t int W;\n\t vector<int> v;\n\t W = stoi(raw[0]);\n\t FOR(i, 1, raw.size()) {\n\t v.emplace_back(stoi(raw[i]));\n\t }\n\t int n = v.size();\n\n\t vector<vector<double>> dp(1 << n, vector<double>(n, INF));\n\t FOR(i, 0, n) {\n\t dp[1 << i][i] = v[i];\n\t }\n\n\t FOR(b, 0, 1 << n) {\n\t FOR(i, 0, n) {\n// assert(dp[b][i] != INF);\n\n FOR(j, 0, n) {\n if ((b & (1 << j)) == 0) {\n\n int r1 = v[i];\n int r2 = v[j];\n\n double bb = (r1 + r2) * (r1 + r2) - (r1 - r2) * (r1 - r2);\n double dist = sqrt(bb);\n dp[b | 1 << j][j] = min(dp[b | 1 << j][j], dp[b][i] + dist);\n }\n }\n }\n\t }\n\n\t bool ans = false;\n\t FOR(j, 0, dp[0].size()) {\n\t if (dp[(1 << n) - 1][j] + v[j] <= W) {\n\t ans = true;\n\t }\n\t }\n\t if (ans) {\n\t print(\"OK\");\n\t }\n\t else {\n print(\"NA\");\n }\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3348,
"score_of_the_acc": -0.1461,
"final_rank": 10
},
{
"submission_id": "aoj_0120_3286304",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include\"bits/stdc++.h\"\n#ifdef _DEBUG\n#define DBG(n) n\n#else\n#define DBG(n)\n#endif\n#define INF 1e9\n#define INFLL 1e18\n#define EPS 1e-9\n#define REP(i,n) for(ll i=0,i##_len=(n);i<i##_len;++i)\n#define REP1(i,n) for(ll i=1,i##_len=(n);i<=i##_len;++i)\n#define REPR(i,n) for(ll i=(n)-1;i>=0;--i)\n#define REPR1(i,n) for(ll i=(n);i>0;--i)\n#define REPC(i,obj) for(auto i:obj)\n#define ALL(obj) (obj).begin(),(obj).end()\n#define SETP(n) cout<<fixed<<setprecision(n)\n#define VV(T,h,w) move(vector<vector<T>>(h,vector<T>(w)))\n#define VVI(T,h,w,i) move(vector<vector<T>>(h,vector<T>(w,i)))\nusing namespace std;\nusing ll = long long;\ntemplate<typename T, ll h, ll w>using vec2 = vector<vector<T>>;\ntemplate<typename T = ll>inline T in() { T ret; cin >> ret; return ret; }\n\nvector<ll>r;\nvector<vector<double>>dp;\nll w;\nunsigned n;\nvoid init(const string&str)\n{\n\tr.clear();\n\tstringstream ss(str);\n\tss >> w;\n\tll foo; while (ss >> foo)r.push_back(foo);\n\tn = r.size();\n\tdp = VVI(double, 1 << n, n, -1);\n}\ndouble pack(unsigned state, ll lastcake)\n{\n\tif (state == (1 << n) - 1) return r[lastcake];\n\telse if (dp[state][lastcake] != -1)return dp[state][lastcake];\n\telse {\n\t\tdouble ret = INFLL;\n\t\tREP(i, n) {\n\t\t\tif ((state >> i & 1) == 0) {\n\t\t\t\tif (state == 0)ret = min(ret, r[i] + pack(state | (1 << i), i));\n\t\t\t\telse ret = min(ret, pack(state | (1 << i), i) + 2 * sqrt(r[lastcake] * r[i]));\n\t\t\t}\n\t\t}\n\t\treturn dp[state][lastcake] = ret;\n\t}\n}\nsigned main()\n{\n\tstring str;\n\twhile (getline(cin, str)) {\n\t\tinit(str);\n\t\tcout << (pack(0, 0) <= w ? \"OK\" : \"NA\") << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4132,
"score_of_the_acc": -0.1908,
"final_rank": 16
},
{
"submission_id": "aoj_0120_3018478",
"code_snippet": "#include<iostream>\n#include<ios>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\ndouble w,r[12];\ndouble dp[1<<12][12];\nmain()\n{\n\twhile(~scanf(\"%lf \",&w))\n\t{\n\t\tint n=0;char c;\n\t\twhile(scanf(\"%lf%c\",r+n++,&c),c==' ');\n\t\tfor(int i=0;i<n;i++)for(int j=0;j<1<<n;j++)dp[j][i]=w+1;\n\t\tfor(int i=0;i<n;i++)dp[1<<i][i]=r[i];\n\t\tfor(int i=1;i<1<<n;i++)\n\t\t{\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t{\n\t\t\t\tif(!(i&1<<j))continue;\n\t\t\t\tfor(int k=0;k<n;k++)\n\t\t\t\t{\n\t\t\t\t\tif(i&1<<k)continue;\n\t\t\t\t\tdouble dis=2*sqrt(r[j]*r[k]);\n\t\t\t\t\tdp[i|(1<<k)][k]=min(dp[i|(1<<k)][k],dp[i][j]+dis);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdouble ans=w+1;\n\t\tfor(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]+r[i]);\n\t\tputs(ans>w?\"NA\":\"OK\");\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3408,
"score_of_the_acc": -0.0066,
"final_rank": 2
},
{
"submission_id": "aoj_0120_3005674",
"code_snippet": "#include<iostream>\n#include<sstream>\n#include<vector>\n#include<cstring>\n#include<cmath>\nusing namespace std;\n\ndouble INF = 1000.0;\n\nint main(){\n string s;\n while(getline(cin, s)){\n stringstream ss(s);\n int w;\n ss >> w;\n\n vector<double> rad;\n double next; \n int n = 0;\n \n while(ss >> next){\n rad.push_back(next);\n n++;\n }\n\n double dp[n][1<<n];\n\n for(int i = 0; i < n; i++){\n for(int j = 0; j < 1<<n; j++){\n dp[i][j] = 10000;\n }\n }\n\n for(int i = 0; i < n; i++){\n dp[i][1<<i] = rad[i];\n }\n\n for(int s = 1; s < 1<<n; s++){\n for(int i = 0; i < n; i++){\n if(!((1<<i) & s)) continue;\n for(int j = 0; j < n; j++){\n if((1<<j) & s) continue;\n double tmp = dp[i][s] + 2*sqrt(rad[i]*rad[j]);\n if(tmp < dp[j][s | (1<<j)]){\n dp[j][s | (1<<j)] = tmp;\n }\n }\n }\n }\n\n double ans = INF;\n for(int i = 0; i < n; i++){\n ans = min(ans, dp[i][(1<<n)-1] + rad[i]);\n }\n\n cout << (ans <= w ? \"OK\" : \"NA\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3592,
"score_of_the_acc": -0.16,
"final_rank": 12
},
{
"submission_id": "aoj_0120_2997153",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <sstream>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e10;\n\nint main(){\n string s;\n while(getline(cin, s)){\n stringstream buf(s);\n double w;\n buf >> w;\n vector<double> r;\n double in;\n while(buf >> in){\n r.push_back(in);\n }\n int n = r.size();\n\n vector<vector<double> > dp(n, vector<double>(1<<n, INF));\n for(int i=0; i<n; i++){\n dp[i][1<<i] = r[i];\n }\n for(int i=0; i<(1<<n); i++){\n for(int j=0; j<n; j++){\n if((1<<j & i) == 0) continue;\n for(int k=0; k<n; k++){\n if((1<<k & i) != 0) continue;\n double x = sqrt((r[j]+r[k]) *(r[j]+r[k]) - (r[j]-r[k]) *(r[j]-r[k]));\n dp[k][i | 1<<k] = min(dp[k][i | 1<<k], dp[j][i] +x);\n }\n }\n }\n\n double MIN = INF;\n for(int i=0; i<n; i++){\n MIN = min(MIN, dp[i][(1<<n)-1] +r[i]);\n }\n if(MIN < w +EPS){\n cout << \"OK\" << endl;\n }else{\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3408,
"score_of_the_acc": -0.0066,
"final_rank": 2
},
{
"submission_id": "aoj_0120_2618209",
"code_snippet": "// ?????¬???????????¬??????\n\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n\n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define int long long int\n\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n\ntypedef pair<int, int> pii;\ntypedef long long ll;\n\nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconstexpr ll INF = 1001001001001001LL;\nconstexpr ll MOD = 1000000007LL;\nconstexpr double EPS = 1e-8;\n\ndouble dp[1 << 12][12];\n\nsigned main() {\n string s;\n while(getline(cin, s)) {\n double W;\n stringstream ss(s);\n ss >> W;\n\n vector<int> v;\n int N, val;\n while(ss >> val) {\n v.push_back(val);\n }\n\n N = v.size();\n rep(i,0,1<<N) rep(j,0,N) dp[i][j] = INF;\n dp[0][0] = 0;\n\n rep(bit,0,1<<N) rep(i,0,N) {\n if(dp[bit][i] == INF) continue;\n rep(k,0,N) {\n if(bit >> k & 1) continue;\n int nbit = bit | (1 << k);\n if(__builtin_popcount(nbit) == 1) {\n dp[nbit][k] = v[k] * 2;\n }\n else {\n chmin(dp[nbit][k], dp[bit][i] + 2 * sqrt(v[i] * v[k]) - v[i] + v[k]);\n }\n }\n }\n\n bool ok = false;\n rep(i,0,N) {\n if(dp[(1<<N)-1][i] <= W + EPS) {\n cout << \"OK\" << endl;\n ok = true;\n break;\n }\n }\n if(!ok) cout << \"NA\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3672,
"score_of_the_acc": -0.0217,
"final_rank": 8
},
{
"submission_id": "aoj_0120_2599660",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nstring s;\nint n;\ndouble a[20],w;\ndouble dp[1<<12][12];\nvoid Input(){\n int res=0;n=-1;\n for(int i=0;i<s.size();i++){\n if(isdigit(s[i]))res=res*10+(s[i]-'0');\n if(s[i]==' '||i==s.size()-1){\n if(n==-1)w=res,n++;\n else a[n++]=res;\n res=0;\n }\n }\n}\nint main(){\n while(getline(cin,s)){\n Input();\n r(i,1<<12)r(j,12)dp[i][j]=1e9;\n for(int i=0;i<n;i++)dp[1<<i][i]=a[i];\n for(int i=1;i<(1<<n);i++){\n for(int j=0;j<n;j++){\n\tif(dp[i][j]!=1e9&&((i>>j)&1)){\n\t for(int k=0;k<n;k++){\n\t if(j!=k&&!((i>>k)&1)){\n\t dp[i|(1<<k)][k]=min(dp[i|(1<<k)][k],dp[i][j]+2.0*sqrt(a[j]*a[k]));\n\t }\n\t }\n\t}\n }\n }\n double ans=1e9;\n for(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]+a[i]);\n if(ans<=w)cout<<\"OK\"<<endl;\n else cout<<\"NA\"<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3432,
"score_of_the_acc": -0.008,
"final_rank": 4
},
{
"submission_id": "aoj_0120_2442755",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#include <stdio.h>\n#include <ctype.h>\n#include <string>\n#include <iostream>\n#include <vector>\n#include <stack>\n#include <fstream>\n#include <sstream>\n#include <queue>\n#include <exception>\n#include <cmath>\n#include <numeric>\n#include <map>\n#include <algorithm>\n\n#define INF 100000000\n#define MAX_N 12\n\nusing namespace std;\ntypedef long long int lint;\n\ndouble dp[MAX_N][1 << MAX_N];\ndouble d[MAX_N][MAX_N];\ndouble rad[MAX_N];\n\n//S : ???????????±???????????????, i : ?????????????????±??????\ndouble rec(int S, int i, int n) {\n\tif (dp[i][S] < INF) return dp[i][S];\n\n\tdouble r = 0;\n\n\t//1????????????\n\tif (S == (1 << i)) {\n\t\treturn dp[i][S] = rad[i];\n\t}\n\n\t//??¨????????????\n\tif (S == (1 << n) - 1) {\n\t\tr = rad[i];\n\t}\n\n\tdouble res = INF;\n\t//S ?????? i ??????????????????\n\tint SS = S ^ (1 << i);\n\tfor (int j = 0; j < n; j++) {\n\t\tif ((SS >> j) & 1) {\n\t\t\tres = min(res, rec(SS, j, n) + d[j][i] + r);\n\t\t}\n\t}\n\n\treturn dp[i][S] = res;\n}\n\nvoid init(int n) {\n\tfor (int i = 0; i < n; i++) {\n\t\tfor (int j = 0; j < (1 << n); j++) {\n\t\t\tdp[i][j] = INF + 1;\n\t\t}\n\t}\n}\n\nbool AOJ0120()\n{\n\tstring str;\n\tif (!getline(cin, str)) return false;\n\n\tistringstream iss(str);\n\t\n\tint width;\n\tvector<int> radii;\n\n\tiss >> width;\n\tint radius;\n\twhile (iss >> radius) {\n\t\tradii.push_back(radius);\n\t}\n\n\tint n = radii.size();\n\n\t//init\n\tinit(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\td[i][j] = sqrt(radii[i] * radii[j]) * 2;\n\t\t}\n\t\trad[i] = radii[i];\n\t}\n\n\tdouble ans = INF + 1;\n\tfor (int i = 0; i < n; i++) {\n\t\tans = min(ans, rec((1 << n) - 1, i, n));\n\t}\n\n\tif (ans < width + 1e-8) cout << \"OK\" << endl;\n\telse cout << \"NA\" << endl;\n\t\n\treturn true;\n}\n\nint main()\n{\n\twhile (AOJ0120()) {\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3588,
"score_of_the_acc": -0.0169,
"final_rank": 6
},
{
"submission_id": "aoj_0120_2373799",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 1001000100010001000\n#define INFd 1010001000\n#define MOD 1000000007\n#define EPS 1e-10\n#define int long long\n#define double long double\n#define rep(i, N) for (int i = 0; i < N; i++)\n#define Rep(i, N) for (int i = 1; i < N; i++)\n#define For(i, a, b) for (int i = (a); i < (b); i++)\n#define pb push_back\n#define eb emplece_back\n#define mp make_pair\n#define i_i pair<int, int>\n#define vi vector<int>\n#define vvi vector<vi >\n#define vb vector<bool>\n#define vvb vector<vb >\n#define vp vector< i_i >\n#define Edge pair< i_i, int>\n#define all(a) (a).begin(), (a).end()\n#define Int(x) int x; scanf(\"%lld\", &x);\n#define int2(x, y) int x, y; scanf(\"%lld %lld\", &x, &y);\n#define fir first\n#define sec second\n#define ffir first.first\n#define fsec first.second\n#define sfir second.first\n#define ssec second.second\n#define vd vector<double>\n#define vvd vector<vd>\n\nsigned main()\n{\n double len;\n char t;\n while (scanf(\"%Lf\", &len) != EOF) {\n vi cake;\n while (scanf(\"%c\", &t), t != '\\n') {\n Int(tmp);\n cake.pb(tmp);\n }\n vvd dp(1 << cake.size(), vd(cake.size(), INFd));\n dp[0][0] = 0.0;\n\n\n rep(i, cake.size()) {\n int tmp = 1 << i;\n dp[tmp][i] = cake[i];\n }\n\n rep(i, 1 << cake.size()) {\n rep(j, cake.size()) {\n if (i & (1 << j)) {\n rep(k, cake.size()) {\n if (!(i & (1 << k))) {\n dp[i|(1 << k)][k] = min(dp[i|(1 << k)][k],\n dp[i][j] + \n sqrt( (double)((cake[j]+cake[k])*(cake[j]+cake[k]) - \n (cake[k]-cake[j])*(cake[k]-cake[j])) ));\n }\n }\n }\n }\n }\n bool ans = false;\n rep(i, cake.size()) {\n if (len >= dp[(1 << cake.size())-1][i] + (double)cake[i]) {\n ans = true;\n break;\n }\n }\n cout << ( (ans) ? \"OK\" : \"NA\" ) << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3960,
"score_of_the_acc": -0.181,
"final_rank": 14
},
{
"submission_id": "aoj_0120_2373798",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 1001000100010001000\n#define INFd 1010001000\n#define MOD 1000000007\n#define EPS 1e-10\n#define int long long\n#define double long double\n#define rep(i, N) for (int i = 0; i < N; i++)\n#define Rep(i, N) for (int i = 1; i < N; i++)\n#define For(i, a, b) for (int i = (a); i < (b); i++)\n#define pb push_back\n#define eb emplece_back\n#define mp make_pair\n#define i_i pair<int, int>\n#define vi vector<int>\n#define vvi vector<vi >\n#define vb vector<bool>\n#define vvb vector<vb >\n#define vp vector< i_i >\n#define Edge pair< i_i, int>\n#define all(a) (a).begin(), (a).end()\n#define Int(x) int x; scanf(\"%lld\", &x);\n#define int2(x, y) int x, y; scanf(\"%lld %lld\", &x, &y);\n#define fir first\n#define sec second\n#define ffir first.first\n#define fsec first.second\n#define sfir second.first\n#define ssec second.second\n#define vd vector<double>\n#define vvd vector<vd>\n\n \n//int dxy[5] = {0, 1, 0, -1, 0};\n// assign\n\n\nvoid mmprint(int a)\n{\n string st;\n if (!a) cout << 0 << \" \";\n else {\n while (a) {\n st.pb((a&1)+'0');\n a >>= 1;\n }\n reverse(all(st));\n cout << st << \" \";\n }\n}\n \nsigned main()\n{\n double len;\n char t;\n while (scanf(\"%Lf\", &len) != EOF) {\n vi cake;\n while (scanf(\"%c\", &t), t != '\\n') {\n Int(tmp);\n cake.pb(tmp);\n }\n if (!cake.size()) {\n cout << \"OK\" << endl;\n continue;\n }\n vvd dp(1 << cake.size(), vd(cake.size(), INFd));\n dp[0][0] = 0.0;\n \n \n rep(i, cake.size()) {\n int tmp = 1 << i;\n dp[tmp][i] = cake[i];\n }\n \n rep(i, 1 << cake.size()) {\n // mmprint(i);\n rep(j, cake.size()) {\n if (i & (1 << j)) {\n //cout << \"sento:\" << j << \" \";\n rep(k, cake.size()) {\n if (!(i & (1 << k))) {\n //cout << \"tsuika\" << k << \" \";\n //cout << \"tsuikasaki\" << (i|(1 << k)) << \" \";\n dp[i|(1 << k)][k] = min(dp[i|(1 << k)][k],\n dp[i][j] + \n sqrt( (double)((cake[j]+cake[k])*(cake[j]+cake[k])-\n (cake[k]-cake[j])*(cake[k]-cake[j])) ));\n }\n }\n }\n }\n //cout << endl;\n }\n rep(i, 1 << cake.size()) {\n //mmprint(i);\n rep(j, cake.size()) {\n //cout << dp[i][j] << \" \";\n }\n //cout << endl;\n }\n bool ans = false;\n rep(i, cake.size()) {\n if (len >= dp[(1 << cake.size())-1][i] + (double)cake[i]) {\n ans = true;\n break;\n }\n }\n cout << ( (ans) ? \"OK\" : \"NA\" ) << endl;\n }\n\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4060,
"score_of_the_acc": -0.1867,
"final_rank": 15
}
] |
aoj_0145_cpp
|
カード
正の整数が書かれた一組のカードがあります。カードを積んで山をいくつか作り、それらを横一列に並べます。その中から隣り合った 2 つのカードの山を選び、右側の山の上に左側の山をそのまま重ねます。この操作をカードの山が一つになるまで繰り返していきます。
2 つのカードの山を重ねる時にそれらの一番上と下のカードに書かれた数をすべて掛け合わせます。こうして得られた数をカードの重ね合わせのコストと呼ぶことにします。カードの山を一つにするためのコストはすべての重ね合わせのコストを足し合わせたものとします。
どのような順番でカードの山を重ねるかでコストは変わります。たとえば、3 つのカードの山がある場合を考えます。それらの一番上と下のカードに書かれた数が，左側の山から順にそれぞれ 3 と 5, 2 と 8, 5 と4 だったとします。このとき，はじめに左と真ん中の山を重ねたときのコストは、3 × 5 × 2 × 8 = 240 です。この重ね合わせによって、一番上のカードが 3 で一番下のカードが 8 である山ができます。
この山を右の山の上に重ねると、そのコストは 3 × 8 × 5 × 4 = 480 になります。したがって、この順番でカードの山を一つにまとめたときのコストは 240 + 480 = 720 です。（図1）
一方、はじめに真ん中と右の山を重ねてから最後に左の山を重ねることにすると、そのときのコストは 2 × 8 × 5 × 4 + 3 × 5 × 2 × 4 = 440 になります。したがって，後の場合のように重ねた方がコストが小さくなります。（図2）
カードの山の個数とそれぞれの山の一番上と下のカードに書かれた数を入力とし、カードの山を一つにまとめるのに必要な最小のコストを出力するプログラムを作成してください。ただし、山の個数は 100 個以下とし、入力されるデータはどのような順番でコストを計算しても 2
31
-1 を超えることはありません。
Input
入力は以下の形式で与えられます。
n
a
1
b
1
a
2
b
2
:
a
n
b
n
1 行目にカードの山の個数
n
(
n
≤ 100)、続く
n
行に左から
i
番目の山の 1 番上のカードに書かれた数
a
i
(1 ≤
a
i
≤ 200) と 1 番下のカードに書かれた数
b
i
(1 ≤
b
i
≤ 200) が与えられます。
Output
カードの山を一つにまとめるのに必要な最小のコストを１行に出力してください。
Sample Input
3
3 5
2 8
5 4
Output for the Sample Input
440
|
[
{
"submission_id": "aoj_0145_1792500",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\n#define INF 2147483647\nint dp[120][120];\nint n,a[120],b[120];\nint main(){\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i]>>b[i];\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tdp[i][i]=0;\n\t\tfor(int j=0;j<n;j++){\n\t\t\tif(i!=j)dp[i][j]=INF;\n\t\t}\n\t}\n\tfor(int i=0;i<=n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tfor(int k=0;k<n;k++){\n\t\t\t\tfor(int l=j;l<=k-1;l++){\n\t\t\t\t\tif(dp[j][l]==INF || dp[l+1][k]==INF)continue;\n\t\t\t\t\tint S=dp[j][l]+dp[l+1][k];\n\t\t\t\t\tdp[j][k]=min(dp[j][k],S+a[j]*b[l]*a[l+1]*b[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<dp[0][n-1]<<endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1196,
"score_of_the_acc": -1.0266,
"final_rank": 3
},
{
"submission_id": "aoj_0145_971552",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <set>\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,j) FOR(i,0,j)\n#define mp std::make_pair\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef std::pair<int,int> P;\ntypedef std::pair<int,P> State;\n\nconst int INF = 1001001001;\n\n// S N E W(南北東西)\nconst int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};\n\nstruct Deck{\n int first, last;\n};\n\nDeck ds[100];\n// dp[i][j][k] := 位置iからj個とk個の山に分ける時の最小値\nint dp[100][101][101];\n\nint rec(int pos, int a, int b){\n if(dp[pos][a][b] != -1){\n return dp[pos][a][b];\n }\n\n if(a == 0 || b == 0){\n return 0;\n }\n\n int res = ds[pos].first * ds[pos+a-1].last * ds[pos+a].first * ds[pos+a+b-1].last;\n // printf(\"%d, %d, %d: %d\\n\", pos, a, b, res);\n if(a == 1 && b == 1){\n return res;\n }\n\n int min_a = rec(pos, 1, a-1);\n FOR(i, 2, a){\n min_a = std::min(rec(pos, i, a-i), min_a);\n }\n\n int min_b = rec(pos+a, 1, b-1);\n FOR(i, 2, b){\n min_b = std::min(rec(pos+a, i, b-i), min_b);\n }\n\n res += min_a + min_b;\n return dp[pos][a][b] = res;\n}\n\nint main(){\n int N;\n std::cin >> N;\n \n REP(i, N){\n std::cin >> ds[i].first >> ds[i].last;\n }\n std::fill(dp[0][0], dp[0][0]+100*101*101, -1);\n \n int res = rec(0, 1, N-1);\n FOR(i, 2, N){\n res = std::min(rec(0, i, N-i), res);\n }\n\n std::cout << res << std::endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5148,
"score_of_the_acc": -2,
"final_rank": 4
},
{
"submission_id": "aoj_0145_787833",
"code_snippet": "#include<stdio.h>\n#include<vector>\n#include<stdlib.h>\n#include <string.h>\nstruct Yama{\n\tint a,b;\n};\nstd::vector<Yama> yamas;\nint ans[101][101];\n\nint calc(int n){\n\tmemset(ans,-1,sizeof(ans));\n\tfor(int i=0;i<n;i++)ans[i][i]=0;\n\tfor(int i=1;i<n;i++){\n\t\tfor(int j=0;j<n-1;j++){\n\t\t\tfor(int k=j;k<n-1;k++){\n\t\t\t\tif(ans[j][k]==-1)break;\n\t\t\t\tfor(int l=k+1;l<n&&(l-k)<=i;l++){\n\t\t\t\t\tif(ans[k+1][l]==-1)continue;\n\t\t\t\t\tint temp=ans[j][k]+yamas[j].a*yamas[k].b*yamas[k+1].a*yamas[l].b+ans[k+1][l];\n\t\t\t\t\tif(ans[j][l]==-1 || temp<ans[j][l])ans[j][l]=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ans[0][n-1];\n}\n\n\nint main(){\n\tint n;\n\t\n\tYama yama;\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\"%d %d\",&yama.a,&yama.b);\n\t\tyamas.push_back(yama);\n\t}\n\t\n\tprintf(\"%d\\n\",calc(n));\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1088,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0145_787832",
"code_snippet": "#include<stdio.h>\n#include<vector>\n#include<stdlib.h>\n#include <string.h>\nstruct Yama{\n\tint a,b;\n};\nstd::vector<Yama> yamas;\nint ans[101][101],nextAns[101][101];\n\nint calc(int n){\n\tmemset(ans,-1,sizeof(ans));\n\tfor(int i=0;i<n;i++)ans[i][i]=0;\n\tmemcpy(nextAns,ans,sizeof(nextAns));\n\tfor(int i=1;i<n;i++){\n\t\tfor(int j=0;j<n-1;j++){\n\t\t\tfor(int k=j;k<n-1;k++){\n\t\t\t\tif(ans[j][k]==-1)continue;\n\t\t\t\tfor(int l=k+1;l<n&&(l-k)<=i;l++){\n\t\t\t\t\tif(ans[k+1][l]==-1)continue;\n\t\t\t\t\tint temp=ans[j][k]+yamas[j].a*yamas[k].b*yamas[k+1].a*yamas[l].b+ans[k+1][l];\n\t\t\t\t\tif(ans[j][l]==-1 || temp<nextAns[j][l])nextAns[j][l]=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmemcpy(ans,nextAns,sizeof(nextAns));\n\t}\n\n\treturn ans[0][n-1];\n}\n\n\nint main(){\n\tint n;\n\t\n\tYama yama;\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\"%d %d\",&yama.a,&yama.b);\n\t\tyamas.push_back(yama);\n\t}\n\t\n\tprintf(\"%d\\n\",calc(n));\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1144,
"score_of_the_acc": -1.0138,
"final_rank": 2
}
] |
aoj_0132_cpp
|
ジグソーパズル
子供から大人まで脳トレ系パズルゲームが流行しています。我々も遅れを取らぬよう、パズルゲームを作ってみんなで遊ぶことにしました。
我々が考えたのはジグソーパズルのゲームで、未完成の部分を埋めるのに必要なピースを選ぶというものです。図 1 (a) はパズルの枠の例です。黒が埋まっている部分、白が未完成の部分です。このパズルを完成するのに使えるピースが図 1 (b) のように与えられます。この中から、枠の白い部分を埋めることができる黒いピースを 1 つ以上選択します。例えば、図 2 の選択例 1 のような組み合わせなら正解となります。一方、選択例 2 のような組み合わせではパズルは完成しないので不正解となります。また、選択したピースが余ってしまう場合も不正解です。このように、プレイヤーは適切なピースを選択することでゲームをクリアします。
そこでこのパズルゲームで用いる判定プログラムを開発することになりました。未完成のパズル、ピースの候補、そしてプレイヤーが選んだピースの組み合わせを入力とし、プレイヤーが適切なピースを選ぶことができていれば YES を、そうでなければ NO と出力するプログラムを作成してください。
この問題では、パズルの枠は
H × W
の配列で表し、未完成の部分を . (半角ピリオド)、完成している部分を # (半角シャープ)によって与えます。パズルの枠の大きさは最大
20 × 20
とします。また、各ピースは
h × w
の配列で表し、ピースを構成する部分を # 、そうでない部分を . によって与えます。与えられる各ピースは、元の状態から 90 度、180 度、270 度だけ回転することができます。また、各ピースの大きさは最大
20 × 20
とし、与えられるピースの数
n
は最大 10 とします。
Input
複数のデータセットが与えられます。各データセットは以下の形式で与えられます。
H
W
g
1,1
g
1,2
...
g
1,W
g
2,1
g
2,2
...
g
2,W
:
g
H,1
g
H,2
...
g
H,W
n
h
1
w
1
c1
1,1
c1
1,2
...
c1
1,w
1
c1
2,1
c1
2,2
...
c1
2,w
1
:
c1
h
1
,1
c1
h
1
,2
...
c1
h
1
,w
1
:
:
h
n
w
n
cn
1,1
cn
1,2
...
cn
1,w
n
cn
2,1
cn
2,2
...
cn
2,w
n
:
cn
h
n
,1
cn
h
n
,2
...
cn
h
n
,w
n
p
k
1
t
1
t
2
...
t
k
1
k
2
t
1
t
2
...
t
k
2
:
k
p
t
1
t
2
...
t
k
p
1 行目に、パズルの枠の大きさ
H
(縦) と
W
(横) が与えられます。
2 行目に、文字
g
i,j
(
.
または
#
) からなりパズルの盤面を表す 1 行
W
文字の文字列が
H
行与えられます。
続いてピースの数
n
、
n
個のピースの情報が与えられます。各ピースの情報として、
l
番目のピースの配列のサイズ
h
l
(縦) と
w
l
(横)、
l
番目のピースの配列が与えられます。
l
番目のピースの配列として文字
cl
i,j
(
.
または
#
) からなる 1 行
w
l
文字の文字列が
h
l
行与えられます。
続いてプレイヤーの人数
p
、
i
番目のプレイヤーの選択したピースの数
k
i
と選択したピースの番号
t
j
が与えられます。
入力は２つの 0 を含む行で終了します。データセットの数は 10 を超えません。
Output
各データセットごとに、
i
番目のプレイヤーが選択したピースの正否 YES または NO を
i
行目に出力してください。
Sample Input
14 20
####################
###.............####
####..........######
#######.....########
########.....#######
###..###......######
###..####......#####
#########......#####
###########.....####
############.....###
###.########......##
###.#######...###.##
##...###....#####.##
####################
10
12 15
#############..
.##########....
....#####......
.....#####.....
.....######....
......######...
......######...
........#####..
.........#####.
.........######
........###...#
.....####.....#
3 3
#..
###
#..
2 2
##
##
4 10
....#####.
....######
...###...#
####.....#
6 5
....#
..###
#####
##.##
#..##
#..#.
6 4
...#
.###
####
##.#
##.#
#...
2 6
######
.#####
2 7
..#####
#######
2 13
#############
.##########..
6 9
#####....
.######..
.######..
..######.
...#####.
....#####
8
3 1 2 3
4 1 2 3 4
7 2 3 4 5 6 7 8
5 2 3 10 7 8
6 2 3 9 5 6 4
8 2 3 4 6 9 5 4 10
4 4 5 6 9
5 10 2 3 4 9
0 0
Output for the Sample Input
YES
NO
YES
NO
YES
NO
NO
YES
|
[
{
"submission_id": "aoj_0132_10813103",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\n\nint grid_h, grid_w, piece_count, piece_h[40], piece_w[40], piece_size[40];\nint selected_count, selected_pieces[10];\nchar grid[20][21], pieces[40][20][21];\nbool covered[20][20];\n\nbool solve(int current_piece) {\n if (current_piece == selected_count) return true;\n memset(covered, 0, sizeof(covered));\n for (int i = 0; i < grid_h; ++i) {\n for (int j = 0; j < grid_w; ++j) {\n if (grid[i][j] == '.' && !covered[i][j]) {\n for (int k = current_piece; k < selected_count; ++k) {\n for (int rotation = 0; rotation < 4; ++rotation) {\n int piece_idx = selected_pieces[k] + rotation * piece_count;\n for (int y = max(0, i - piece_h[piece_idx] + 1); y <= i && y + piece_h[piece_idx] <= grid_h; ++y) {\n for (int x = max(0, j - piece_w[piece_idx] + 1); x <= j && x + piece_w[piece_idx] <= grid_w; ++x) {\n bool fits = true;\n for (int a = 0; a < piece_h[piece_idx] && fits; ++a) {\n for (int b = 0; b < piece_w[piece_idx] && fits; ++b) {\n if (pieces[piece_idx][a][b] == '#' && grid[y + a][x + b] == '#') {\n fits = false;\n }\n }\n }\n if (fits) {\n for (int a = 0; a < piece_h[piece_idx]; ++a) {\n for (int b = 0; b < piece_w[piece_idx]; ++b) {\n if (pieces[piece_idx][a][b] == '#') {\n covered[y + a][x + b] = true;\n }\n }\n }\n }\n }\n }\n }\n }\n if (!covered[i][j]) return false;\n }\n }\n }\n\n for (int rotation = 0; rotation < 4; ++rotation) {\n int piece_idx = selected_pieces[current_piece] + rotation * piece_count;\n for (int y = 0; y + piece_h[piece_idx] <= grid_h; ++y) {\n for (int x = 0; x + piece_w[piece_idx] <= grid_w; ++x) {\n bool fits = true;\n for (int a = 0; a < piece_h[piece_idx] && fits; ++a) {\n for (int b = 0; b < piece_w[piece_idx] && fits; ++b) {\n if (grid[y + a][x + b] == '#' && pieces[piece_idx][a][b] == '#') {\n fits = false;\n }\n }\n }\n if (fits) {\n for (int a = 0; a < piece_h[piece_idx]; ++a) {\n for (int b = 0; b < piece_w[piece_idx]; ++b) {\n if (pieces[piece_idx][a][b] == '#') {\n grid[y + a][x + b] = '#';\n }\n }\n }\n bool result = solve(current_piece + 1);\n for (int a = 0; a < piece_h[piece_idx]; ++a) {\n for (int b = 0; b < piece_w[piece_idx]; ++b) {\n if (pieces[piece_idx][a][b] == '#') {\n grid[y + a][x + b] = '.';\n }\n }\n }\n if (result) return true;\n }\n }\n }\n }\n return false;\n}\n\nint main() {\n while (cin >> grid_h >> grid_w, grid_h) {\n int empty_cells = 0;\n for (int i = 0; i < grid_h; ++i) {\n cin >> grid[i];\n for (int j = 0; j < grid_w; ++j) {\n if (grid[i][j] == '.') empty_cells++;\n }\n }\n cin >> piece_count;\n for (int i = 0; i < piece_count; ++i) {\n cin >> piece_h[i] >> piece_w[i];\n piece_size[i] = 0;\n for (int j = 0; j < piece_h[i]; ++j) {\n cin >> pieces[i][j];\n for (int k = 0; k < piece_w[i]; ++k) {\n if (pieces[i][j][k] == '#') piece_size[i]++;\n }\n }\n int current = i;\n for (int j = 0; j < 3; ++j) {\n int rotated = current + piece_count;\n piece_h[rotated] = piece_w[current];\n piece_w[rotated] = piece_h[current];\n piece_size[rotated] = piece_size[current];\n for (int y = 0; y < piece_h[current]; ++y) {\n for (int x = 0; x < piece_w[current]; ++x) {\n pieces[rotated][x][piece_h[current] - y - 1] = pieces[current][y][x];\n }\n }\n current = rotated;\n }\n }\n int queries;\n cin >> queries;\n while (queries--) {\n cin >> selected_count;\n int total_pieces = 0;\n for (int i = 0; i < selected_count; ++i) {\n cin >> selected_pieces[i];\n selected_pieces[i]--;\n total_pieces += piece_size[selected_pieces[i]];\n }\n sort(selected_pieces, selected_pieces + selected_count, [&](int a, int b) {\n return piece_size[a] > piece_size[b];\n });\n cout << (total_pieces == empty_cells && solve(0) ? \"YES\" : \"NO\") << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 3368,
"score_of_the_acc": -0.2271,
"final_rank": 12
},
{
"submission_id": "aoj_0132_8131578",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nusing bs = bitset<400>;\n\nstruct piece {\n int h,w;\n int i,j;\n bs bit;\n piece() {}\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int h,w;\n while (cin >> h >> w, h+w) {\n bs puzzle;\n int rem = 0;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n char c; cin >> c;\n if (c == '#') {\n puzzle[i*w+j] = 1;\n }\n else {\n rem++;\n }\n }\n }\n using A = array<piece, 4>;\n int m; cin >> m;\n vector<A> v(m);\n vector<int> cnt(m);\n for (int i = 0; i < m; ++i) {\n int hh,ww; cin >> hh >> ww;\n vector<vector<char>> s(hh, vector<char>(ww));\n for (int j = 0; j < hh; ++j) {\n for (int k = 0; k < ww; ++k) {\n cin >> s[j][k];\n if (s[j][k] == '#') cnt[i]++;\n }\n }\n for (int j = 0; j < 4; ++j) {\n v[i][j].h = hh; v[i][j].w = ww;\n bool done = false;\n for (int k = 0; k < hh; ++k) {\n for (int l = 0; l < ww; ++l) {\n if (s[k][l] == '#') {\n if (!done) {\n v[i][j].i = k;\n v[i][j].j = l;\n done = true;\n }\n v[i][j].bit[k*w+l] = 1;\n }\n }\n }\n {\n vector<vector<char>> ns(ww, vector<char>(hh));\n for (int k = 0; k < hh; ++k) {\n for (int l = 0; l < ww; ++l) {\n ns[l][k] = s[hh-1-k][l];\n }\n }\n swap(s, ns);\n swap(hh, ww);\n }\n }\n }\n vector<int> sum(1<<m);\n for (int i = 0; i < (1<<m); ++i) {\n for (int j = 0; j < m; ++j) {\n if ((1<<j)&i) sum[i] += cnt[j];\n }\n }\n\n vector<unordered_set<bs>> bfs(1<<m);\n bfs[0].insert(puzzle);\n for (int i = 0; i < (1<<m); ++i) {\n if (sum[i] >= rem) continue;\n for (auto p : bfs[i]) {\n bool done = false;\n int x = -1, y = -1;\n for (int j = 0; j < h; ++j) {\n for (int k = 0; k < w; ++k) {\n if (!p[j*w+k]) {\n done = true;\n x = j, y = k;\n break;\n }\n }\n if (done) break;\n }\n\n for (int j = 0; j < m; ++j) {\n if ((1<<j)&i) continue;\n for (int k = 0; k < 4; ++k) {\n if (x < v[j][k].i) continue;\n if (y < v[j][k].j) continue;\n if (x + (v[j][k].h-1-v[j][k].i) >= h) continue;\n if (y + (v[j][k].w-1-v[j][k].j) >= w) continue;\n auto u = p & (v[j][k].bit << (y-v[j][k].j + w*(x-v[j][k].i)));\n if (u.none()) {\n auto uu = p | (v[j][k].bit << (y-v[j][k].j + w*(x-v[j][k].i)));\n bfs[(1<<j)|i].insert(uu);\n }\n }\n }\n }\n }\n\n int q; cin >> q;\n while (q--) {\n int n; cin >> n;\n int bit = 0;\n for (int i = 0; i < n; ++i) {\n int k; cin >> k; k--;\n bit += (1<<k);\n }\n if (sum[bit] == rem and bfs[bit].size()) {\n cout << \"YES\" << \"\\n\";\n }\n else {\n cout << \"NO\" << \"\\n\";\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4112,
"score_of_the_acc": -0.0494,
"final_rank": 1
},
{
"submission_id": "aoj_0132_6979057",
"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 Inf32 1000000001\n#define Inf64 2000000000000000001\n\nvoid rotate(vector<string> &s){\n\tint h = s.size();\n\tint w = s[0].size();\n\tvector<string> x(w,string(h,'.'));\n\trep(i,h){\n\t\trep(j,w){\n\t\t\tx[j][i] = s[h-1-i][j];\n\t\t}\n\t}\n\ts = x;\n}\nset<int> ok;\nset<pair<vector<string>,int>> used;\n\nbool check(vector<string> a,vector<string> b,int x,int y){\n\tif(x<0||y<0||x+b.size()>a.size()||y+b[0].size()>a[0].size())return false;\n\trep(i,b.size()){\n\t\trep(j,b[i].size()){\n\t\t\tif(b[i][j]=='#' && a[x+i][y+j]=='#')return false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid go(vector<string> &a,vector<string> b,int x,int y){\n\t\n\trep(i,b.size()){\n\t\trep(j,b[i].size()){\n\t\t\tif(b[i][j]=='#')a[x+i][y+j]='#';\n\t\t}\n\t}\n\t\n}\n\nvoid dfs(vector<string> s,vector<vector<string>> ss,int cur){\n\n\tif(used.count(make_pair(s,cur)))return;\n\tused.emplace(s,cur);\n\tif(s==vector<string>(s.size(),string(s[0].size(),'#'))){\n\t\tok.insert(cur);\n\t\treturn;\n\t}\n\tint ii,jj;\n\trep(i,s.size()){\n\t\trep(j,s[i].size()){\n\t\t\tif(s[i][j]=='.'){\n\t\t\t\tii = i,jj = j;\n\t\t\t\tgoto L;\n\t\t\t}\n\t\t}\n\t}\n\tL:;\n\trep(i,ss.size()){\n\t\tif((cur>>i)&1)continue;\n\t\trep(j,4){\n\t\t\tauto ns = s;\n\t\t\tint jjj;\n\t\t\trep(k,ss[i][0].size()){\n\t\t\t\tif(ss[i][0][k]=='#'){\n\t\t\t\t\tjjj = k;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//cout<<jj<<','<<ii<<','<<jjj<<endl;\n\t\t\tif(check(ns,ss[i],ii,jj-jjj)){\n\t\t\t\tgo(ns,ss[i],ii,jj-jjj);\n\t\t\t\tdfs(ns,ss,cur|(1<<i));\n\t\t\t}\n\t\t\trotate(ss[i]);\n\t\t}\n\t}\n\t\t\n}\n\nint main(){\n\t\n\twhile(true){\n\t\tint h,w;\n\t\tcin>>h>>w;\n\t\tif(h==0)break;\n\t\tvector<string> s(h);\n\t\trep(i,h)cin>>s[i];\n\t\tint n;\n\t\tcin>>n;\n\t\tvector<vector<string>> ss(n);\n\t\trep(i,n){\n\t\t\tint a,b;\n\t\t\tcin>>a>>b;\n\t\t\tss[i].resize(a);\n\t\t\trep(j,a)cin>>ss[i][j];\n\t\t}\n\t\trep(i,n){\n\t\t\trep(j,4){\n\t\t\t\trotate(ss[i]);\n\t\t\t\twhile(ss[i].back()==string(ss[0].size(),'.'))ss[i].pop_back();\n\t\t\t}\n\t\t}\n\t\t\n\t\tok.clear();\n\t\tused.clear();\n\t\tdfs(s,ss,0);\n\t\t\n\t\tint p;\n\t\tcin>>p;\n\t\trep(i,p){\n\t\t\tint k;\n\t\t\tcin>>k;\n\t\t\t\n\t\t\tint cur =0;\n\t\t\trep(j,k){\n\t\t\t\tint t;\n\t\t\t\tcin>>t;\n\t\t\t\tcur |= 1<<(t-1);\n\t\t\t}\n\t\t\tif(ok.count(cur))cout<<\"YES\"<<endl;\n\t\t\telse cout<<\"NO\"<<endl;\n\t\t\t\n\t\t\t\n\t\t}\n\t\t\n\t}\n\t\n return 0;\n}",
"accuracy": 1,
"time_ms": 370,
"memory_kb": 7556,
"score_of_the_acc": -0.1941,
"final_rank": 8
},
{
"submission_id": "aoj_0132_5594228",
"code_snippet": "#include<iostream>\n#include<map>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nint puzzle_height, puzzle_width;\n\nclass Puzzle {\npublic:\n\n int used_piece_state;\n char grid[20][20];\n\n bool operator<(const Puzzle &p) const {\n for (int i = 0; i < puzzle_height; i++) {\n for (int j = 0; j < puzzle_width; j++) {\n if (grid[i][j] == p.grid[i][j])continue;\n return grid[i][j] < p.grid[i][j];\n }\n }\n return used_piece_state < p.used_piece_state;\n }\n};\n\nPuzzle puzzle;\nmap<Puzzle, bool> is_searched_puzzle;\n\n\nchar pieces[40][20][20];\n\nint piece_h[40], piece_w[40];\nint num_pieces;\n\nbool result[1024];\n\n#if READ_FROM_FILE\nvoid input(std::ifstream &ifs);\n#else\nvoid input();\n#endif\n\nvoid init();\n\nvoid rotate(int, int);\n\nvoid dfs(int, int);\n\nbool can_append(int, int, int);\n\nvoid append_piece(int, int, int);\n\nvoid remove_piece(int, int, int);\n\n\nint main() {\n#if READ_FROM_FILE\n std::ifstream ifs(\"../test0.txt\");\n#endif\n int used_piece_state;\n#if READ_FROM_FILE\n while (ifs >> puzzle_height >> puzzle_width) {\n#else\n while(cin>>puzzle_height>>puzzle_width){\n#endif\n int num_players = 0;\n if (puzzle_height == 0 && puzzle_width == 0)break;\n\n#if READ_FROM_FILE\n input(ifs);\n#else\n input();\n#endif\n init();\n\n puzzle.used_piece_state = 0;\n dfs(0, 0);\n\n#if READ_FROM_FILE\n ifs >> num_players;\n#else\n cin>>num_players;\n#endif\n for (int i = 0; i < num_players; i++) {\n int num_selected_pieces = 0;\n#if READ_FROM_FILE\n ifs >> num_selected_pieces;\n#else\n cin>>num_selected_pieces;\n#endif\n used_piece_state = 0;\n for (int j = 0; j < num_selected_pieces; j++) {\n int idx = 0;\n#if READ_FROM_FILE\n ifs >> idx;\n#else\n cin>>idx;\n#endif\n idx--;\n used_piece_state += (1 << idx);\n }\n\n if (result[used_piece_state])cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n }\n\n }\n return 0;\n}\n\n\nvoid dfs(int y, int x) {\n\n int tmp = puzzle.used_piece_state;\n bool is_solved = true;\n\n for (int i = 0; i < puzzle_height; i++) {\n for (int j = 0; j < puzzle_width; j++) {\n if (puzzle.grid[i][j] != '#'){\n is_solved = false;\n }\n }\n }\n if (is_solved) {\n result[puzzle.used_piece_state] = true;\n return;\n }\n\n is_searched_puzzle[puzzle] = true;\n\n for (int i = 0; i < num_pieces; i++) {\n if (((puzzle.used_piece_state >> i) & 1) == 1){\n continue;\n }\n for (int j = 0; j < 4; j++) {\n\n if (!can_append(y, x, 4 * i + j)){\n continue;\n }\n\n puzzle.used_piece_state += (1 << i);\n\n append_piece(y, x, 4 * i + j);\n\n if (!is_searched_puzzle[puzzle]){\n dfs(y, x);\n }\n\n remove_piece(y, x, 4 * i + j);\n puzzle.used_piece_state = tmp;\n }\n }\n\n if (puzzle.grid[y][x] == '#'){\n dfs((x + 1 == puzzle_width ? y + 1 : y), (x + 1 == puzzle_width ? 0 : x + 1));\n }\n}\n\n\nvoid rotate(int a, int b) {\n for (int i = 0; i < piece_h[a]; i++) {\n for (int j = 0; j < piece_w[a]; j++) {\n pieces[a][i][j] = pieces[b][j][piece_h[a] - i - 1];\n }\n }\n}\n\n\nvoid init() {\n is_searched_puzzle.clear();\n for (int i = 0; i < 1024; i++){\n result[i] = false;\n }\n}\n\n#if READ_FROM_FILE\nvoid input(std::ifstream &ifs) {\n#else\n void input(){\n#endif\n for (int i = 0; i < 20; i++)\n for (int j = 0; j < 20; j++){\n puzzle.grid[i][j] = '.';\n }\n\n string str;\n for (int i = 0; i < puzzle_height; i++) {\n#if READ_FROM_FILE\n ifs >> str;\n#else\n cin>>str;\n#endif\n for (int j = 0; j < puzzle_width; j++) {\n puzzle.grid[i][j] = str[j];\n }\n }\n#if READ_FROM_FILE\n ifs >> num_pieces;\n#else\n cin>>num_pieces;\n#endif\n for (int k = 0; k < num_pieces; k++) {\n#if READ_FROM_FILE\n ifs >> piece_h[k * 4] >> piece_w[k * 4];\n#else\n cin>>piece_h[k*4]>>piece_w[k*4];\n#endif\n for (int i = 0; i < piece_h[k * 4]; i++) {\n#if READ_FROM_FILE\n ifs >> str;\n#else\n cin>>str;\n#endif\n for (int j = 0; j < piece_w[k * 4]; j++) {\n pieces[k * 4][i][j] = str[j];\n }\n }\n for (int i = 1; i < 4; i++) {\n piece_h[k * 4 + i] = piece_w[k * 4 + i - 1];\n piece_w[k * 4 + i] = piece_h[k * 4 + i - 1];\n rotate(k * 4 + i, k * 4 + i - 1);\n }\n }\n}\n\n\nbool can_append(int y, int x, int piece_idx) {\n if (y + piece_h[piece_idx] > puzzle_height || x + piece_w[piece_idx] > puzzle_width){\n return false;\n }\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#' && puzzle.grid[i][j] == '#'){\n return false;\n }\n }\n }\n return true;\n}\n\n\nvoid append_piece(int y, int x, int piece_idx) {\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#'){\n puzzle.grid[i][j] = '#';\n }\n }\n }\n}\n\n\nvoid remove_piece(int y, int x, int piece_idx) {\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#'){\n puzzle.grid[i][j] = '.';\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 8432,
"score_of_the_acc": -0.1956,
"final_rank": 9
},
{
"submission_id": "aoj_0132_5594210",
"code_snippet": "#include<iostream>\n#include<map>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nint puzzle_height, puzzle_width;\n\nclass Puzzle {\npublic:\n\n int used_piece_state;\n char grid[20][20];\n\n bool operator<(const Puzzle &p) const {\n for (int i = 0; i < puzzle_height; i++) {\n for (int j = 0; j < puzzle_width; j++) {\n if (grid[i][j] == p.grid[i][j])continue;\n return grid[i][j] < p.grid[i][j];\n }\n }\n return used_piece_state < p.used_piece_state;\n }\n};\n\nPuzzle puzzle;\nmap<Puzzle, bool> is_searched_puzzle;\n\n\nchar pieces[40][20][20];\n\nint piece_h[40], piece_w[40];\nint num_pieces;\n\nbool result[2048];\n\n#if READ_FROM_FILE\nvoid input(std::ifstream &ifs);\n#else\nvoid input();\n#endif\n\nvoid init();\n\nvoid rotate(int, int);\n\nvoid dfs(int, int);\n\nbool can_append(int, int, int);\n\nvoid append_piece(int, int, int);\n\nvoid remove_piece(int, int, int);\n\n\nint main() {\n#if READ_FROM_FILE\n std::ifstream ifs(\"../test0.txt\");\n#endif\n int used_piece_state;\n#if READ_FROM_FILE\n while (ifs >> puzzle_height >> puzzle_width) {\n#else\n while(cin>>puzzle_height>>puzzle_width){\n#endif\n int num_players = 0;\n if (puzzle_height == 0 && puzzle_width == 0)break;\n\n#if READ_FROM_FILE\n input(ifs);\n#else\n input();\n#endif\n init();\n\n puzzle.used_piece_state = 0;\n dfs(0, 0);\n\n#if READ_FROM_FILE\n ifs >> num_players;\n#else\n cin>>num_players;\n#endif\n for (int i = 0; i < num_players; i++) {\n int num_selected_pieces = 0;\n#if READ_FROM_FILE\n ifs >> num_selected_pieces;\n#else\n cin>>num_selected_pieces;\n#endif\n used_piece_state = 0;\n for (int j = 0; j < num_selected_pieces; j++) {\n int idx = 0;\n#if READ_FROM_FILE\n ifs >> idx;\n#else\n cin>>idx;\n#endif\n idx--;\n used_piece_state += (1 << idx);\n }\n\n if (result[used_piece_state])cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n }\n\n }\n return 0;\n}\n\n\nvoid dfs(int y, int x) {\n\n int tmp = puzzle.used_piece_state;\n bool is_solved = true;\n\n for (int i = 0; i < puzzle_height; i++) {\n for (int j = 0; j < puzzle_width; j++) {\n if (puzzle.grid[i][j] != '#'){\n is_solved = false;\n }\n }\n }\n if (is_solved) {\n result[puzzle.used_piece_state] = true;\n return;\n }\n\n is_searched_puzzle[puzzle] = true;\n\n for (int i = 0; i < num_pieces; i++) {\n if (((puzzle.used_piece_state >> i) & 1) == 1){\n continue;\n }\n for (int j = 0; j < 4; j++) {\n\n if (!can_append(y, x, 4 * i + j)){\n continue;\n }\n\n puzzle.used_piece_state += (1 << i);\n\n append_piece(y, x, 4 * i + j);\n\n if (!is_searched_puzzle[puzzle]){\n dfs(y, x);\n }\n\n remove_piece(y, x, 4 * i + j);\n puzzle.used_piece_state = tmp;\n }\n }\n\n if (puzzle.grid[y][x] == '#'){\n dfs((x + 1 == puzzle_width ? y + 1 : y), (x + 1 == puzzle_width ? 0 : x + 1));\n }\n}\n\n\nvoid rotate(int a, int b) {\n for (int i = 0; i < piece_h[a]; i++) {\n for (int j = 0; j < piece_w[a]; j++) {\n pieces[a][i][j] = pieces[b][j][piece_h[a] - i - 1];\n }\n }\n}\n\n\nvoid init() {\n is_searched_puzzle.clear();\n for (int i = 0; i < 2048; i++){\n result[i] = false;\n }\n}\n\n#if READ_FROM_FILE\nvoid input(std::ifstream &ifs) {\n#else\n void input(){\n#endif\n for (int i = 0; i < 20; i++)\n for (int j = 0; j < 20; j++){\n puzzle.grid[i][j] = '.';\n }\n\n string str;\n for (int i = 0; i < puzzle_height; i++) {\n#if READ_FROM_FILE\n ifs >> str;\n#else\n cin>>str;\n#endif\n for (int j = 0; j < puzzle_width; j++) {\n puzzle.grid[i][j] = str[j];\n }\n }\n#if READ_FROM_FILE\n ifs >> num_pieces;\n#else\n cin>>num_pieces;\n#endif\n for (int k = 0; k < num_pieces; k++) {\n#if READ_FROM_FILE\n ifs >> piece_h[k * 4] >> piece_w[k * 4];\n#else\n cin>>piece_h[k*4]>>piece_w[k*4];\n#endif\n for (int i = 0; i < piece_h[k * 4]; i++) {\n#if READ_FROM_FILE\n ifs >> str;\n#else\n cin>>str;\n#endif\n for (int j = 0; j < piece_w[k * 4]; j++) {\n pieces[k * 4][i][j] = str[j];\n }\n }\n for (int i = 1; i < 4; i++) {\n piece_h[k * 4 + i] = piece_w[k * 4 + i - 1];\n piece_w[k * 4 + i] = piece_h[k * 4 + i - 1];\n rotate(k * 4 + i, k * 4 + i - 1);\n }\n }\n}\n\n\nbool can_append(int y, int x, int piece_idx) {\n if (y + piece_h[piece_idx] > puzzle_height || x + piece_w[piece_idx] > puzzle_width){\n return false;\n }\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#' && puzzle.grid[i][j] == '#'){\n return false;\n }\n }\n }\n return true;\n}\n\n\nvoid append_piece(int y, int x, int piece_idx) {\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#'){\n puzzle.grid[i][j] = '#';\n }\n }\n }\n}\n\n\nvoid remove_piece(int y, int x, int piece_idx) {\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#'){\n puzzle.grid[i][j] = '.';\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 8332,
"score_of_the_acc": -0.194,
"final_rank": 7
},
{
"submission_id": "aoj_0132_5594195",
"code_snippet": "#include<iostream>\n#include<map>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nint puzzle_height, puzzle_width;\n\nclass Puzzle {\npublic:\n\n int used_piece_state;\n char grid[20][20];\n\n bool operator<(const Puzzle &p) const {\n for (int i = 0; i < puzzle_height; i++) {\n for (int j = 0; j < puzzle_width; j++) {\n if (grid[i][j] == p.grid[i][j])continue;\n return grid[i][j] < p.grid[i][j];\n }\n }\n return used_piece_state < p.used_piece_state;\n }\n};\n\nPuzzle puzzle;\nmap<Puzzle, bool> is_searched_puzzle;\n\n\nchar pieces[40][20][20];\n\nint piece_h[40], piece_w[40];\nint num_pieces;\n\nbool result[2048];\n\n#if READ_FROM_FILE\nvoid input(std::ifstream &ifs);\n#else\nvoid input();\n#endif\n\nvoid init();\n\nvoid rotate(int, int);\n\nvoid dfs(int, int);\n\nbool can_append(int, int, int);\n\nvoid append_piece(int, int, int);\n\nvoid remove_piece(int, int, int);\n\n\nint main() {\n#if READ_FROM_FILE\n std::ifstream ifs(\"../test0.txt\");\n#endif\n int used_piece_state;\n#if READ_FROM_FILE\n while (ifs >> puzzle_height >> puzzle_width) {\n#else\n while(cin>>puzzle_height>>puzzle_width){\n#endif\n int num_players = 0;\n if (puzzle_height == 0 && puzzle_width == 0)break;\n\n#if READ_FROM_FILE\n input(ifs);\n#else\n input();\n#endif\n init();\n\n puzzle.used_piece_state = 0;\n dfs(0, 0);\n\n#if READ_FROM_FILE\n ifs >> num_players;\n#else\n cin>>num_players;\n#endif\n for (int i = 0; i < num_players; i++) {\n int num_selected_pieces = 0;\n#if READ_FROM_FILE\n ifs >> num_selected_pieces;\n#else\n cin>>num_selected_pieces;\n#endif\n used_piece_state = 0;\n for (int j = 0; j < num_selected_pieces; j++) {\n int idx = 0;\n#if READ_FROM_FILE\n ifs >> idx;\n#else\n cin>>idx;\n#endif\n idx--;\n used_piece_state += (1 << idx);\n }\n\n if (result[used_piece_state])cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n }\n\n }\n return 0;\n}\n\n\nvoid dfs(int y, int x) {\n\n int tmp = puzzle.used_piece_state;\n bool is_solved = true;\n\n for (int i = 0; i < puzzle_height; i++) {\n for (int j = 0; j < puzzle_width; j++) {\n if (puzzle.grid[i][j] != '#'){\n is_solved = false;\n }\n }\n }\n if (is_solved) {\n result[puzzle.used_piece_state] = true;\n return;\n }\n\n is_searched_puzzle[puzzle] = true;\n\n for (int i = 0; i < num_pieces; i++) {\n if ((puzzle.used_piece_state >> i) & 1 == 1){\n continue;\n }\n for (int j = 0; j < 4; j++) {\n\n if (can_append(y, x, 4 * i + j) == false){\n continue;\n }\n\n puzzle.used_piece_state += (1 << i);\n\n append_piece(y, x, 4 * i + j);\n\n if (is_searched_puzzle[puzzle] == false){\n dfs(y, x);\n }\n\n remove_piece(y, x, 4 * i + j);\n puzzle.used_piece_state = tmp;\n }\n }\n\n if (puzzle.grid[y][x] == '#'){\n dfs((x + 1 == puzzle_width ? y + 1 : y), (x + 1 == puzzle_width ? 0 : x + 1));\n }\n}\n\n\nvoid rotate(int a, int b) {\n for (int i = 0; i < piece_h[a]; i++) {\n for (int j = 0; j < piece_w[a]; j++) {\n pieces[a][i][j] = pieces[b][j][piece_h[a] - i - 1];\n }\n }\n}\n\n\nvoid init() {\n is_searched_puzzle.clear();\n for (int i = 0; i < 2048; i++){\n result[i] = false;\n }\n}\n\n#if READ_FROM_FILE\nvoid input(std::ifstream &ifs) {\n#else\n void input(){\n#endif\n for (int i = 0; i < 20; i++)\n for (int j = 0; j < 20; j++){\n puzzle.grid[i][j] = '.';\n }\n\n string str;\n for (int i = 0; i < puzzle_height; i++) {\n#if READ_FROM_FILE\n ifs >> str;\n#else\n cin>>str;\n#endif\n for (int j = 0; j < puzzle_width; j++) {\n puzzle.grid[i][j] = str[j];\n }\n }\n#if READ_FROM_FILE\n ifs >> num_pieces;\n#else\n cin>>num_pieces;\n#endif\n for (int k = 0; k < num_pieces; k++) {\n#if READ_FROM_FILE\n ifs >> piece_h[k * 4] >> piece_w[k * 4];\n#else\n cin>>piece_h[k*4]>>piece_w[k*4];\n#endif\n for (int i = 0; i < piece_h[k * 4]; i++) {\n#if READ_FROM_FILE\n ifs >> str;\n#else\n cin>>str;\n#endif\n for (int j = 0; j < piece_w[k * 4]; j++) {\n pieces[k * 4][i][j] = str[j];\n }\n }\n for (int i = 1; i < 4; i++) {\n piece_h[k * 4 + i] = piece_w[k * 4 + i - 1];\n piece_w[k * 4 + i] = piece_h[k * 4 + i - 1];\n rotate(k * 4 + i, k * 4 + i - 1);\n }\n }\n}\n\n\nbool can_append(int y, int x, int piece_idx) {\n if (y + piece_h[piece_idx] > puzzle_height || x + piece_w[piece_idx] > puzzle_width){\n return false;\n }\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#' && puzzle.grid[i][j] == '#'){\n return false;\n }\n }\n }\n return true;\n}\n\n\nvoid append_piece(int y, int x, int piece_idx) {\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#'){\n puzzle.grid[i][j] = '#';\n }\n }\n }\n}\n\n\nvoid remove_piece(int y, int x, int piece_idx) {\n for (int i = y; i < y + piece_h[piece_idx]; i++) {\n for (int j = x; j < x + piece_w[piece_idx]; j++) {\n if (pieces[piece_idx][i - y][j - x] == '#'){\n puzzle.grid[i][j] = '.';\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 8432,
"score_of_the_acc": -0.1956,
"final_rank": 9
},
{
"submission_id": "aoj_0132_4483001",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 25\n\nstruct LOC{\n\tLOC(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\nstruct Info{\n\n\tint num_tile;\n\tvector<LOC> V[4];\n};\n\nint H,W;\nint N,POW[12];\nint TABLE[SIZE][SIZE],ARRAY[10];\nchar table[SIZE][SIZE],work[SIZE][SIZE];\nbool ans[1024],used[10];\nvector<LOC> MAP;\nInfo info[10];\n\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\nvoid recursive(int index,int row,int col){\n\n\tif(row == H){\n\n\t\tint state = 0;\n\t\tfor(int i = 0; i < index; i++){\n\n\t\t\tstate += POW[ARRAY[i]];\n\t\t}\n\t\tans[state] = true;\n\t\treturn;\n\t}\n\n\tint next_row = row;\n\tint next_col = col+1;\n\n\tif(col == W-1){\n\n\t\tnext_row = row+1;\n\t\tnext_col = 0;\n\t}\n\n\tif(TABLE[row][col] != 0){\n\n\t\trecursive(index,next_row,next_col);\n\t\treturn;\n\t}\n\n\t//TABLE[row][col] == 0 //空きマス\n\n\n\tfor(int a = 0; a < N; a++){\n\n\t\tif(used[a])continue;\n\n\t\tint id = a;\n\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tif(info[id].V[i].size() == 0)continue;\n\t\t\tbool FLG = true;\n\t\t\tfor(int k = 0; k < info[id].num_tile; k++){\n\n\t\t\t\tif(!rangeCheck(row+info[id].V[i][k].row,col+info[id].V[i][k].col)){\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(TABLE[row+info[id].V[i][k].row][col+info[id].V[i][k].col] != 0){\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\tfor(int k = 0; k < info[id].num_tile; k++){\n\n\t\t\t\tTABLE[row+info[id].V[i][k].row][col+info[id].V[i][k].col]++;\n\t\t\t}\n\t\t\tused[a] = true;\n\t\t\tARRAY[index] = a;\n\t\t\trecursive(index+1,next_row,next_col);\n\t\t\tused[a] = false;\n\t\t\tfor(int k = 0; k < info[id].num_tile; k++){\n\n\t\t\t\tTABLE[row+info[id].V[i][k].row][col+info[id].V[i][k].col]--;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid func(){\n\n\tMAP.clear();\n\n\tfor(int row = 0; row < H; row++){\n\t\tscanf(\"%s\",table[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(table[row][col] == '.'){\n\t\t\t\tMAP.push_back(LOC(row,col));\n\t\t\t}\n\t\t}\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 4; k++){\n\t\t\tinfo[i].V[k].clear();\n\t\t}\n\t}\n\n\tint h,w;\n\tint base_row,base_col;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tfor(int row = 0; row < max(H,W); row++){\n\t\t\tfor(int col = 0; col < max(H,W); col++){\n\t\t\t\ttable[row][col] = '.';\n\t\t\t}\n\t\t}\n\t\tscanf(\"%d %d\",&h,&w);\n\t\tfor(int row = 0; row< h; row++){\n\t\t\tscanf(\"%s\",work[row]);\n\t\t\tfor(int col = 0; col < w; col++){\n\t\t\t\tif(work[row][col] == '#'){\n\n\t\t\t\t\ttable[row][col] = '#';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int loop = 0; loop < 4; loop++){\n\n\t\t\tfor(int row = 0; row < max(H,W); row++){\n\t\t\t\tfor(int col = 0; col < max(H,W); col++){\n\t\t\t\t\twork[row][col] = '.';\n\t\t\t\t}\n\t\t\t}\n\t\t\t//90度回転\n\t\t\tfor(int row = 0; row < max(H,W); row++){\n\t\t\t\tfor(int col = 0; col < max(H,W); col++){\n\t\t\t\t\twork[col][W-1-row] = table[row][col];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbool FLG = false;\n\n\t\t\tfor(int row = 0; row < max(H,W); row++){\n\t\t\t\tfor(int col = 0; col < max(H,W); col++){\n\t\t\t\t\tif(work[row][col] == '.')continue;\n\n\t\t\t\t\tif(!FLG){\n\t\t\t\t\t\tbase_row = row;\n\t\t\t\t\t\tbase_col = col;\n\t\t\t\t\t\tFLG = true;\n\t\t\t\t\t}\n\t\t\t\t\tinfo[i].V[loop].push_back(LOC(row-base_row,col-base_col));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int row = 0; row < max(H,W); row++){\n\t\t\t\tfor(int col = 0; col < max(H,W);col++){\n\t\t\t\t\ttable[row][col] = work[row][col];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int a = 0; a < 3; a++){\n\t\t\tfor(int b = a+1; b < 4; b++){\n\t\t\t\tbool FLG = true;\n\t\t\t\tfor(int k = 0; k < info[i].V[a].size();k++){\n\t\t\t\t\tif(info[i].V[a][k].row != info[i].V[b][k].row || info[i].V[a][k].col != info[i].V[b][k].col){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(FLG){\n\n\t\t\t\t\tinfo[i].V[b].clear();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tinfo[i].num_tile = info[i].V[0].size();\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\n\t\tans[state] = false;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tused[i] = false;\n\t}\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tTABLE[row][col] = BIG_NUM;\n\t\t}\n\t}\n\tfor(int i = 0; i < MAP.size(); i++){\n\n\t\tTABLE[MAP[i].row][MAP[i].col] = 0;\n\t}\n\trecursive(0,0,0);\n\n\n\tint num_query;\n\tscanf(\"%d\",&num_query);\n\n\tint num,tmp;\n\n\tfor(int i = 0; i < num_query; i++){\n\n\t\tscanf(\"%d\",&num);\n\t\tint sum = 0;\n\t\tfor(int k = 0; k < num; k++){\n\n\t\t\tscanf(\"%d\",&tmp);\n\t\t\ttmp--;\n\t\t\tsum += POW[tmp];\n\t\t}\n\n\t\tif(ans[sum]){\n\n\t\t\tprintf(\"YES\\n\");\n\n\t\t}else{\n\n\t\t\tprintf(\"NO\\n\");\n\t\t}\n\t}\n}\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < 12; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&H,&W);\n\t\tif(H == 0 && W == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 3176,
"score_of_the_acc": -0.1692,
"final_rank": 6
},
{
"submission_id": "aoj_0132_4462966",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\n\nusing B = bitset<401>;\nbool solve(){\n int h, w;\n cin >> h >> w;\n if(!h) return 0;\n B x;\n int cnt = 0;\n for (int i = 0; i < h; ++i) {\n string s;\n cin >> s;\n for (int j = 0; j < w; ++j) {\n if(s[j] == '#') {\n x.set(i*w+j);\n cnt++;\n }\n }\n }\n int n;\n cin >> n;\n vector<vector<B>> piece(n);\n vector<int> cnts(n);\n vector<int> ok(1 << n);\n for (int i = 0; i < n; ++i) {\n int hh, ww;\n cin >> hh >> ww;\n vector<string> v(hh);\n for (auto &&j : v) {\n cin >> j;\n for (auto &&k : j) {\n if(k == '#') cnts[i]++;\n }\n }\n for (int _ = 0; _ < 4; ++_) {\n for (int j = 0; j+hh <= h; ++j) {\n for (int k = 0; k+ww <= w; ++k) {\n B y{};\n for (int l = 0; l < hh; ++l) {\n for (int m = 0; m < ww; ++m) {\n if(v[l][m] == '#'){\n y.set((j+l)*w+k+m);\n }\n }\n }\n piece[i].emplace_back(y);\n }\n }\n auto vv = vector<string>(ww, string(hh, ' '));\n for (int j = 0; j < hh; ++j) {\n for (int k = 0; k < ww; ++k) {\n vv[ww-k-1][j] = v[j][k];\n }\n }\n swap(vv, v);\n swap(hh, ww);\n }\n }\n B MX{};\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n MX.set(i*w+j);\n }\n }\n int t;\n cin >> t;\n for (int i = 0; i < t; ++i) {\n int p;\n cin >> p;\n vector<int> v(p);\n for (auto &&j : v) scanf(\"%d\", &j), j--;\n sort(v.begin(),v.end(), [&](int x, int y){ return cnts[x] > cnts[y]; });\n int dif = h*w-cnt;\n for (auto &&k : v) dif -= cnts[k];\n auto dfs = [&](int cur, B x, auto &&f) -> bool {\n if(cur == p) return 1;\n B xx = x;\n for (auto &&i : v) {\n for (auto &&j : piece[i]) {\n if((x&j).none()){\n xx |= j;\n }\n }\n }\n if(xx != MX) return 0;\n for (auto &&j : piece[v[cur]]) {\n if((x&j).none()){\n if(f(cur+1, x|j, f)) return 1;\n }\n }\n return 0;\n };\n if(!dif && dfs(0, x, dfs)) puts(\"YES\");\n else puts(\"NO\");\n }\n return 1;\n}\n\nint main() {\n while(solve()){}\n return 0;\n}",
"accuracy": 1,
"time_ms": 3340,
"memory_kb": 3404,
"score_of_the_acc": -0.8686,
"final_rank": 17
},
{
"submission_id": "aoj_0132_3964100",
"code_snippet": "#include <ctime>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <functional>\nusing namespace std;\nconst int inf = 1012345678;\nvector<string> compress(vector<string> S) {\n\tint H = S.size(), W = S[0].size();\n\tint xl = inf, xr = -inf, yl = inf, yr = -inf;\n\tfor (int i = 0; i < H; ++i) {\n\t\tfor (int j = 0; j < W; ++j) {\n\t\t\tif (S[i][j] == '#') {\n\t\t\t\txl = min(xl, i);\n\t\t\t\txr = max(xr, i);\n\t\t\t\tyl = min(yl, j);\n\t\t\t\tyr = max(yr, j);\n\t\t\t}\n\t\t}\n\t}\n\tvector<string> T(xr - xl + 1);\n\tfor (int i = xl; i <= xr; ++i) {\n\t\tT[i - xl] = S[i].substr(yl, yr - yl + 1);\n\t}\n\treturn T;\n}\nvector<string> rotate90(vector<string> S) {\n\tint H = S.size(), W = S[0].size();\n\tvector<string> T(W, string(H, '?'));\n\tfor (int i = 0; i < H; ++i) {\n\t\tfor (int j = 0; j < W; ++j) {\n\t\t\tT[W - j - 1][i] = S[i][j];\n\t\t}\n\t}\n\treturn T;\n}\nint main() {\n\tint H, W, N;\n\twhile (cin >> H >> W, H) {\n\t\tvector<string> S(H);\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tcin >> S[i];\n\t\t}\n\t\tint all_sz = 0;\n\t\tvector<int> B(H);\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (S[i][j] == '#') {\n\t\t\t\t\tB[i] |= 1 << j;\n\t\t\t\t\t++all_sz;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> N;\n\t\tvector<int> R(N), C(N), SZ(N);\n\t\tvector<vector<int> > RX(N, vector<int>(4)), CX(N, vector<int>(4)), OY(N, vector<int>(4));\n\t\tvector<vector<vector<int> > > D(N, vector<vector<int> >(4));\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> R[i] >> C[i];\n\t\t\tvector<string> T(R[i]);\n\t\t\tfor (int j = 0; j < R[i]; ++j) {\n\t\t\t\tcin >> T[j];\n\t\t\t\tfor (int k = 0; k < C[i]; ++k) {\n\t\t\t\t\tif (T[j][k] == '#') ++SZ[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tT = compress(T);\n\t\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\t\tRX[i][j] = T.size();\n\t\t\t\tCX[i][j] = T[0].size();\n\t\t\t\tD[i][j].resize(RX[i][j]);\n\t\t\t\tfor (int k = 0; k < RX[i][j]; ++k) {\n\t\t\t\t\tfor (int l = 0; l < CX[i][j]; ++l) {\n\t\t\t\t\t\tif (T[k][l] == '#') {\n\t\t\t\t\t\t\tD[i][j][k] |= 1 << l;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < CX[i][j]; ++k) {\n\t\t\t\t\tif (T[0][k] == '#') {\n\t\t\t\t\t\tOY[i][j] = k;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tT = rotate90(T);\n\t\t\t}\n\t\t}\n\t\tvector<int> cur = B;\n\t\tint u = clock();\n\t\tfunction<bool(int)> dfs = [&](int bit) {\n\t\t\tif (bit == 0) return true;\n\t\t\tif (clock() - u > CLOCKS_PER_SEC) return false;\n\t\t\tint lx = -1, ly = -1;\n\t\t\tfor (int i = 0; i < H; ++i) {\n\t\t\t\tif (cur[i] != (1 << W) - 1) {\n\t\t\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\t\t\tif (!((cur[i] >> j) & 1)) {\n\t\t\t\t\t\t\tlx = i, ly = j;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tif (!((bit >> i) & 1)) continue;\n\t\t\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\t\t\tif (lx + RX[i][j] > H || ly + CX[i][j] - OY[i][j] > W || ly - OY[i][j] < 0) continue;\n\t\t\t\t\tbool ok = true;\n\t\t\t\t\tfor (int k = 0; k < RX[i][j]; ++k) {\n\t\t\t\t\t\tif ((cur[lx + k] & (D[i][j][k] << (ly - OY[i][j]))) != 0) {\n\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (!ok) continue;\n\t\t\t\t\tfor (int k = 0; k < RX[i][j]; ++k) {\n\t\t\t\t\t\tcur[lx + k] ^= D[i][j][k] << (ly - OY[i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tbool res = dfs(bit - (1 << i));\n\t\t\t\t\tfor (int k = 0; k < RX[i][j]; ++k) {\n\t\t\t\t\t\tcur[lx + k] ^= D[i][j][k] << (ly - OY[i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tif (res) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t};\n\t\tint Q;\n\t\tcin >> Q;\n\t\tfor (int i = 0; i < Q; ++i) {\n\t\t\tint K;\n\t\t\tcin >> K;\n\t\t\tvector<int> E(K);\n\t\t\tint bit = 0, sum_sz = all_sz;\n\t\t\tfor (int j = 0; j < K; ++j) {\n\t\t\t\tcin >> E[j]; --E[j];\n\t\t\t\tbit |= 1 << E[j];\n\t\t\t\tsum_sz += SZ[E[j]];\n\t\t\t}\n\t\t\tif (sum_sz != H * W) {\n\t\t\t\tcout << \"NO\\n\";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbool ans = dfs(bit);\n\t\t\t\tcout << (ans ? \"YES\\n\" : \"NO\\n\");\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 2080,
"memory_kb": 3188,
"score_of_the_acc": -0.5509,
"final_rank": 14
},
{
"submission_id": "aoj_0132_3896754",
"code_snippet": "#include<iostream>\n#include<bitset>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,H,W,h[10],w[10];\nstring t[20];\nbitset<400>R[10][4];\nbool used[10];\nint cnt[10];\nvector<int>id;\nbool dfs(const bitset<400>&F,int I,int rest)\n{\n\tif(rest==0)return true;\n\tbool flag=true;\n\tint p;\n\twhile(flag)\n\t{\n\t\tfor(int j=0;j<W;j++)if(!F[I*W+j])\n\t\t{\n\t\t\tp=j;\n\t\t\tflag=false;\n\t\t\tbreak;\n\t\t}\n\t\tI+=flag;\n\t}\n\tbitset<400>test=F;\n\tfor(int ii=0;ii<N;ii++)\n\t{\n\t\tint i=id[ii];\n\t\tif(used[i])continue;\n\t\tfor(int r=0;r<4;r++)\n\t\t{\n\t\t\tfor(int I=0;I<H;I++)\n\t\t\t{\n\t\t\t\tif(r%2==0&&I+h[i]>H||r%2==1&&I+w[i]>H)break;\n\t\t\t\tfor(int J=0;J<W;J++)\n\t\t\t\t{\n\t\t\t\t\tif(r%2==0&&J+w[i]>W||r%2==1&&J+h[i]>W)break;\n\t\t\t\t\tif(!(F&(R[i][r]<<I*W+J)).any())test|=R[i][r]<<I*W+J;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(test.count()!=H*W)return false;\n\tfor(int ii=0;ii<N;ii++)\n\t{\n\t\tint i=id[ii];\n\t\tif(used[i])continue;\n\t\tused[i]=true;\n\t\tfor(int r=0;r<4;r++)\n\t\t{\n\t\t\tif(r%2==0&&I+h[i]>H||r%2==1&&I+w[i]>H)continue;\n\t\t\tfor(int J=0;J<=p;J++)\n\t\t\t{\n\t\t\t\tif(r%2==0&&J+w[i]>W||r%2==1&&J+h[i]>W)break;\n\t\t\t\tif(!R[i][r][p-J])continue;\n\t\t\t\tif((F&(R[i][r]<<I*W+J)).any())continue;\n\t\t\t\tif(dfs(F|(R[i][r]<<I*W+J),I,rest-cnt[i]))return true;\n\t\t\t}\n\t\t}\n\t\tused[i]=false;\n\t}\n\treturn false;\n}\nmain()\n{\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\twhile(cin>>H>>W,H)\n\t{\n\t\tbitset<400>F;\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tstring s;cin>>s;\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(s[j]=='#')F[i*W+j]=1;\n\t\t\t}\n\t\t}\n\t\tcin>>N;\n\t\tid.clear();\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tid.push_back(i);\n\t\t\tcin>>h[i]>>w[i];\n\t\t\tfor(int r=0;r<4;r++)R[i][r].reset();\n\t\t\tcnt[i]=0;\n\t\t\tfor(int j=0;j<h[i];j++)cin>>t[j];\n\t\t\tfor(int I=0;I<h[i];I++)for(int J=0;J<w[i];J++)if(t[I][J]=='#')\n\t\t\t{\n\t\t\t\tcnt[i]+=1;\n\t\t\t\tR[i][0][I*W+J]=1;\n\t\t\t\tR[i][1][J*W+(h[i]-I-1)]=1;\n\t\t\t\tR[i][2][(h[i]-I-1)*W+(w[i]-J-1)]=1;\n\t\t\t\tR[i][3][(w[i]-J-1)*W+I]=1;\n\t\t\t}\n\t\t}\n\t\tsort(id.begin(),id.end(),[](int a,int b){return cnt[a]>cnt[b];});\n\t\tint p;cin>>p;\n\t\tint T=H*W-F.count();\n\t\tfor(;p--;)\n\t\t{\n\t\t\tint k;cin>>k;\n\t\t\tfor(int i=0;i<N;i++)used[i]=true;\n\t\t\tint left=T;\n\t\t\tfor(;k--;)\n\t\t\t{\n\t\t\t\tint a;cin>>a;a--;\n\t\t\t\tused[a]=false;\n\t\t\t\tleft-=cnt[a];\n\t\t\t}\n\t\t\tcout<<(left==0&&dfs(F,0,T)?\"YES\":\"NO\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 4020,
"memory_kb": 3116,
"score_of_the_acc": -1.0336,
"final_rank": 18
},
{
"submission_id": "aoj_0132_2604272",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nconst int INF = 1 << 28;\n\nclass Piece\n{\nprivate:\n\tint h, w;\n\tchar g[20][20];\n\tvector<int> bit;\n\npublic:\n\tPiece() { };\n\n\tbool readFromStdin(bool cutflag = true)\n\t{\n\t\tcin >> h >> w;\n\t\tif (h == 0 && w == 0)\n\t\t\treturn false;\n\n\t\tfor (int y = 0; y < h; ++y)\n\t\t{\n\t\t\tfor (int x = 0; x < w; ++x)\n\t\t\t{\n\t\t\t\tchar c;\n\t\t\t\tcin >> c;\n\t\t\t\tg[y][x] = c;\n\t\t\t}\n\t\t}\n\n\t\tif (cutflag)\n\t\t\treduce();\n\n\t\tmakeBitVector();\n\t\treturn true;\n\t}\n\n\tvoid reduce()\n\t{\n\t\tint ly, lx, hy, hx;\n\t\tint x, y;\n\t\tfor (x = 0; x < w; ++x)\n\t\t{\n\t\t\tfor (y = 0; y < h; ++y)\n\t\t\t{\n\t\t\t\tif (g[y][x] == '#')\n\t\t\t\t\tbreak;\n\t\t\t}\t\t\t\n\n\t\t\tif (y < h)\n\t\t\t\tbreak;\n\t\t}\n\n\t\tlx = x;\n\t\tfor (x = w - 1; x >= 0; --x)\n\t\t{\n\t\t\tfor (y = 0; y < h; ++y)\n\t\t\t{\n\t\t\t\tif (g[y][x] == '#')\n\t\t\t\t\tbreak;\n\t\t\t}\t\t\t\n\n\t\t\tif (y < h)\n\t\t\t\tbreak;\n\t\t}\n\n\t\thx = x;\n\t\tfor (y = 0; y < h; ++y)\n\t\t{\n\t\t\tfor (x = 0; x < w; ++x)\n\t\t\t{\n\t\t\t\tif (g[y][x] == '#')\n\t\t\t\t\tbreak;\n\t\t\t}\t\t\t\n\n\t\t\tif (x < w)\n\t\t\t\tbreak;\n\t\t}\n\n\t\tly = y;\n\t\tfor (y = h - 1; y >= 0; --y)\n\t\t{\n\t\t\tfor (x = 0; x < w; ++x)\n\t\t\t{\n\t\t\t\tif (g[y][x] == '#')\n\t\t\t\t\tbreak;\n\t\t\t}\t\t\t\n\n\t\t\tif (x < w)\n\t\t\t\tbreak;\n\t\t}\n\n\t\thy = y;\n\n\t\th = hy - ly + 1;\n\t\tw = hx - lx + 1;\n\t\tfor (int y = 0; y < h; ++y)\n\t\t{\n\t\t\tfor (int x = 0; x < w; ++x)\n\t\t\t\tg[y][x] = g[ly + y][lx + x];\n\t\t}\n\t}\n\n\tvoid makeBitVector()\n\t{\n\t\tbit.clear();\n\t\tfor (int y = 0; y < h; ++y)\n\t\t{\n\t\t\tint b = 0;\n\t\t\tfor (int x = 0; x < w; ++x)\n\t\t\t\tb |= ((g[y][x] == '#') ? 1 : 0) << x;\n\n\t\t\tbit.push_back(b);\n\t\t}\n\t}\n\n\tPiece rotate() const\n\t{\n\t\tPiece p;\n\t\tp.h = w;\n\t\tp.w = h;\n\n\t\tfor (int y = 0; y < p.h; ++y)\n\t\t{\n\t\t\tfor (int x = 0; x < p.w; ++x)\n\t\t\t\tp.g[y][x] = g[h - 1 - x][y];\n\t\t}\n\n\t\tp.makeBitVector();\n\t\treturn p;\n\t}\n\n\tbool ok(const Piece &p, int by, int bx) const\n\t{\n\t\tif (by < 0 || by + p.h > h)\n\t\t\treturn false;\n\n\t\tif (bx < 0 || bx + p.w > w)\n\t\t\treturn false;\n\n\t\tfor (int y = 0; y < p.h; ++y)\n\t\t{\n\t\t\tif (bit[by + y] & (p.bit[y] << bx))\n\t\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tvoid bury(const Piece &p, int by, int bx)\n\t{\n\t\tfor (int y = 0; y < p.h; ++y)\n\t\t\tbit[by + y] |= p.bit[y] << bx;\n\t}\n\n\tvoid erase(const Piece &p, int by, int bx)\n\t{\n\t\tfor (int y = 0; y < p.h; ++y)\n\t\t\tbit[by + y] &= ~(p.bit[y] << bx);\n\t}\n\n\tint getH() const { return h; }\n\tint getW() const { return w; }\n\tint getSize() const { return h * w; }\n\tbool getDot(int y, int j) const { return (bit[y] >> j) & 1; }\n\n\tint getCount() const\n\t{\n\t\tint res = 0;\n\t\tfor (int y = 0; y < h; ++y)\n\t\t{\n\t\t\tfor (int x = 0; x < w; ++x)\n\t\t\t\tres += (g[y][x] == '#') ? 1 : 0;\n\t\t}\n\n\t\treturn res;\n\t}\n\n\tvoid show() const\n\t{\n\t\tfor (int y = 0; y < h; ++y)\n\t\t{\n\t\t\tfor (int x = 0; x < w; ++x)\n\t\t\t\tcout << g[y][x];\n\n\t\t\tcout << endl;\n\t\t}\n\t}\n};\n\nconst int MAX_N = 10;\nint H, W;\nPiece base;\nint n;\nPiece piece[MAX_N][4];\nint t[MAX_N];\n\nbool\nrec(int s1, int e1)\n{\n\tif (s1 == e1)\n\t\treturn true;\n\n\t{\n\t\tPiece b = base;\n\t\tfor (int by = 0; by < H; ++by)\n\t\t{\n\t\t\tfor (int bx = 0; bx < W; ++bx)\n\t\t\t{\n\t\t\t\tif (!b.getDot(by, bx))\n\t\t\t\t{\n\t\t\t\t\tfor (int i = s1; i != e1; ++i)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int a = 0; a < 4; ++a)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tconst Piece &p = piece[t[i]][a];\n\t\t\t\t\t\t\tint h = p.getH();\n\t\t\t\t\t\t\tint w = p.getW();\n\t\t\t\t\t\t\tfor (int y = max(0, by - h + 1); y <= by && y + h <= H; ++y)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tfor (int x = max(0, bx - w + 1); x <= bx && x + w <= W; ++x)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif (base.ok(p, y, x))\n\t\t\t\t\t\t\t\t\t\tb.bury(p, y, x);\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\n\t\t\t\tif (!b.getDot(by, bx))\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int a = 0; a < 4; ++a)\n\t{\n\t\tconst Piece &p = piece[t[s1]][a];\n\t\tint h = p.getH();\n\t\tint w = p.getW();\n\t\tfor (int y = 0; y + h <= H; ++y)\n\t\t{\n\t\t\tfor (int x = 0; x + w <= W; ++x)\n\t\t\t{\n\t\t\t\tif (base.ok(p, y, x))\n\t\t\t\t{\n\t\t\t\t\tbase.bury(p, y, x);\n\t\t\t\t\tbool res = rec(s1 + 1, e1);\n\t\t\t\t\tbase.erase(p, y, x);\n\t\t\t\t\tif (res)\n\t\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint\nmain(int argc, char **argv)\n{\n\tint k;\n\n\twhile (base.readFromStdin(false))\n\t{\n\t\tH = base.getH();\n\t\tW = base.getW();\n\t\tcin >> n;\n\t\tfor (int s = 0; s < n; ++s)\n\t\t{\n\t\t\tpiece[s][0].readFromStdin();\n\t\t\tfor (int a = 1; a < 4; ++a)\n\t\t\t\tpiece[s][a] = piece[s][a - 1].rotate();\n\t\t}\n\n\t\tint p;\n\t\tcin >> p;\n\t\twhile(p--)\n\t\t{\n\t\t\t{\n\t\t\t\tcin >> k;\n\t\t\t\tvector<pair<int,int> > tmp(k);\n\t\t\t\tfor (int i = 0; i < k; ++i)\n\t\t\t\t{\n\t\t\t\t\tcin >> tmp[i].second;\n\t\t\t\t\ttmp[i].second--;\n\t\t\t\t\ttmp[i].first = -piece[tmp[i].second][0].getSize();\n\t\t\t\t}\n\n\t\t\t\tsort(tmp.begin(), tmp.end());\n\t\t\t\tfor (int i = 0; i < k; ++i)\n\t\t\t\t\tt[i] = tmp[i].second;\n\t\t\t}\n\n\t\t\tint sum = 0;\n\t\t\tfor (int i = 0; i < k; ++i)\n\t\t\t\tsum += piece[t[i]][0].getCount();\n\n\t\t\tif (sum == base.getSize() - base.getCount() && rec(0, k))\n\t\t\t\tcout << \"YES\" << endl;\n\t\t\telse\n\t\t\t\tcout << \"NO\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3180,
"score_of_the_acc": -0.072,
"final_rank": 2
},
{
"submission_id": "aoj_0132_2351854",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\nint H, W, n, h[40], w[40], sz[40];\nint m, no[10];\nchar in[20][21], pc[40][20][21];\nbool v[20][20], u[20][20];\n\nbool cmp(int a, int b){\n\treturn sz[a] > sz[b];\n}\nbool rec(int c){\n\tif(c == m) return 1;\n\tmemset(u, 0, sizeof(u));\n\trep(i, H) rep(j, W) if(in[i][j] == '.' && !u[i][j]){\n\t\tfor(int k = c; k < m; k++) rep(t, 4){\n\t\t\tint p = no[k] + t * n;\n\t\t\tfor(int y = max(0, i - h[p] + 1); y <= i && y + h[p] <= H; y++)\n\t\t\tfor(int x = max(0, j - w[p] + 1); x <= j && x + w[p] <= W; x++){\n\t\t\t\trep(a, h[p]) rep(b, w[p]){\n\t\t\t\t\tif(pc[p][a][b] == '#' && in[y + a][x + b] == '#') goto FAIL;\n\t\t\t\t}\n\t\t\t\trep(a, h[p]) rep(b, w[p]){\n\t\t\t\t\tif(pc[p][a][b] == '#') u[y + a][x + b] = 1;\n\t\t\t\t}\n\t\t\t\tFAIL:;\n\t\t\t}\n\t\t}\n\t\tif(!u[i][j]) return 0;\n\t}\n\trep(t, 4){\n\t\tint p = no[c] + t * n;\n\t\tfor(int y = 0; y + h[p] <= H; y++)\n\t\tfor(int x = 0; x + w[p] <= W; x++){\n\t\t\tbool ok = 1;\n\t\t\trep(a, h[p]) rep(b, w[p]) if(in[y + a][x + b] == '#' && pc[p][a][b] == '#') ok = 0;\n\t\t\tif(ok){\n\t\t\t\trep(a, h[p]) rep(b, w[p]) if(pc[p][a][b] == '#') in[y + a][x + b] = '#';\n\t\t\t\tbool res = rec(c + 1);\n\t\t\t\trep(a, h[p]) rep(b, w[p]) if(pc[p][a][b] == '#') in[y + a][x + b] = '.';\n\t\t\t\tif(res) return 1;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nint main()\n{while(cin >> H >> W, H){int sp = 0;rep(i, H){cin >> in[i];rep(j, W) if(in[i][j] == '.') sp++;}cin >> n;\n\t\trep(i, n){cin >> h[i] >> w[i];sz[i] = 0;rep(j, h[i]){\tcin >> pc[i][j];\n\t\trep(k, w[i]) if(pc[i][j][k] == '#') sz[i]++;}\n\t\t\tint s = i;rep(j, 3){\n\t\t\t\tint t = s + n;\n\n\t\t\t\th[t] = w[s];\n\t\t\t\tw[t] = h[s];\n\t\t\t\tsz[t] = sz[s];\n\n\t\t\t\trep(y, h[s]) rep(x, w[s])\n\t\t\t\t\tpc[t][x][h[s] - y - 1] = pc[s][y][x];\n\t\t\t\ts = t;\n\t\t\t}\n\t\t}\n\t\tint q;\n\t\tcin >> q;\n\t\twhile(q--){\n\t\t\tcin >> m;\n\t\t\tint sum = 0;\n\t\t\trep(i, m) cin >> no[i], sum += sz[--no[i]];\n\t\t\tsort(no, no + m, cmp);\n\n\t\t\tmemset(v, 0, sizeof(v));\n\t\t\tcout << (sum == sp && rec(0) ? \"YES\" : \"NO\") << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 1100,
"memory_kb": 3152,
"score_of_the_acc": -0.3059,
"final_rank": 13
},
{
"submission_id": "aoj_0132_1847493",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <deque>\n#include <set>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define all(n) n.begin(),n.end()\ntypedef long long ll;\n\nint bx[20];\nint xbit[10][4][20];\nint H[10][4],W[10][4];\nint pzlCnt[10];\nint num[10];\nint h,w,P;\nint v[10];\n\nint generate(int _bx[20],deque<string> t,char del,int &_H,int &_W){\n\trep(i,20) _bx[i] = 0;\n\twhile(count(all(t[0]),del) == t[0].size()) t.pop_front();\n\twhile(count(all(t[t.size()-1]),del) == t[t.size()-1].size()) t.pop_back();\n\twhile(1){\n\t\tbool f = true;\n\t\trep(i,t.size()) f &= t[i][0] == del;\n\t\tif(f) rep(i,t.size()) t[i] = t[i].substr(1); else break;\n\t}\n\twhile(1){\n\t\tbool f = true;\n\t\trep(i,t.size()) f &= t[i][t[i].size()-1] == del;\n\t\tif(f) rep(i,t.size()) t[i] = t[i].erase(t[i].size()-1); else break;\n\t}\n\tint H = t.size() , W = t[0].length();\n\t\n\trep(i,H)rep(j,W) _bx[i] |= ( (t[i][j]=='#') << j);\n\t_W = W , _H = H;\n}\n\nstring genString(char c,int l){\n\tstring ans;\n\trep(i,l)ans += c;\n\treturn ans;\n}\n\nvoid fix(deque<string> &t){\n\tint mxsz = max(t.size(),t[0].size());\n\trep(i,t.size()) while(t[i].size() < mxsz) t[i] += '.';\n\twhile(t.size() < mxsz) t.push_back(genString('.',mxsz));\n}\nvoid rotate(deque<string> &t){\n\trep(i,t.size()) rep(j,i) swap(t[i][j],t[j][i]);\n\trep(i,t.size()) reverse(all(t[i]));\n}\n\n\nbool isok(int ax[20],int tx[20],int x,int y){\n\trep(i,20) if(ax[i+y] & (tx[i] << x) )return false;\n\treturn true;\n}\nvoid add(int a[20],int b[20],int x,int y){rep(i,20) a[i+y] |= (b[i]<<x);}\nvoid sub(int a[20],int b[20],int x,int y){rep(i,20) a[i+y] &= ~(b[i]<<x);}\n\nstruct NODE{\n\tint v[20];\n\tNODE(int a[20]){rep(i,20)v[i] = a[i];}\n};\n\nbool operator < (const NODE &a, const NODE& b){\n\trep(i,20)if(a.v[i] != b.v[i]) return a.v[i] < b.v[i];\n\treturn false;\n}\n\nset<NODE> memo[10];\n\nint dfs(int k , int cx[20]){\n\tif(k == P)return true;\n\t\n\tNODE key(cx);\n\tif(memo[k].find(key) != memo[k].end())return false;\n\telse memo[k].insert(key);\n\t\n\tint cur = v[k];\n\t\n\tint pre[20]={0};\n\tfor(int f=k;f<P;f++){\n\t\tint c = v[f];\n\t\trep(d,4){\n\t\t\trep(i,h-H[c][d]+1){\n\t\t\t\trep(j,w-W[c][d]+1){\n\t\t\t\t\tif( isok(cx,xbit[c][d],j,i) ){\n\t\t\t\t\t\tadd(pre,xbit[c][d],j,i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\trep(i,h){\n\t\tif( pre[i] != ((~cx[i]) & ((1<<w)-1)) ) return false;\n\t}\n\t\n\trep(d,4){\n\t\trep(i,h-H[cur][d]+1){\n\t\t\trep(j,w-W[cur][d]+1){\n\t\t\t\tif( isok(cx,xbit[cur][d],j,i) ){\n\t\t\t\t\tadd(cx,xbit[cur][d],j,i);\n\t\t\t\t\tif(dfs(k+1,cx)) return true;\n\t\t\t\t\tsub(cx,xbit[cur][d],j,i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn false;\n}\n\nint _2dCount(deque<string> &t,char c){\n\tint ans = 0;\n\trep(i,t.size())rep(j,t[i].size()) ans += t[i][j] == c;\n\treturn ans;\n}\n\nint main(){\n\tstring t;\n\tdeque<string> tmp;\n\twhile(cin >> h >> w && h || w){\n\t\trep(i,10)num[i] = i;\n\t\t\n\t\ttmp.clear(); rep(i,h)cin >> t , tmp.push_back(t);\n\t\t\n\t\tgenerate(bx,tmp,'-',h,w);\n\t\tint allCnt = _2dCount(tmp,'.');\n\t\tint N; cin >> N;\n\t\trep(k,N){\n\t\t\ttmp.clear();\n\t\t\tint th,tw; cin >> th >> tw;\n\t\t\trep(i,th)cin >> t , tmp.push_back(t);\n\t\t\tpzlCnt[k] = _2dCount(tmp,'#');\n\t\t\tfix(tmp);\n\t\t\trep(d,4){\n\t\t\t\tgenerate(xbit[k][d] , tmp , '.' , H[k][d] , W[k][d]);\n\t\t\t\trotate(tmp);\n\t\t\t}\n\t\t}\n\t\tint Q; cin >> Q;\n\t\trep(x,Q){\n\t\t\trep(i,10)memo[i].clear();\n\t\t\tint qCnt = 0;\n\t\t\tint tmpField[20];\n\t\t\trep(i,20)tmpField[i] = bx[i];\n\t\t\tcin >> P;\n\t\t\trep(j,P) cin >> v[j] , v[j] = find(num,num+10,v[j]-1)-num , qCnt += pzlCnt[v[j]];\n\t\t\tif(qCnt == allCnt && dfs(0,tmpField)){\n\t\t\t\tcout << \"YES\" << endl;\n\t\t\t}else{\n\t\t\t\tcout << \"NO\" << endl;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 3192,
"score_of_the_acc": -0.1146,
"final_rank": 3
},
{
"submission_id": "aoj_0132_1493886",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define BIT(x) (1 << (x))\n\nstruct Piece {\n\tint h, w;\n\tvector<int> v;\n};\n\nint H, W;\nint n;\nint board[20];\nPiece p[10][4];\n\nvoid generate(vector<vector<int> > v, Piece p[])\n{\n\tfor (int i = 0; i < 4; i++){\n\t\tint bx = 20, by = 20, ex = -1, ey = -1;\n\t\tfor (int j = 0; j < 20; j++){\n\t\t\tfor (int k = 0; k < 20; k++){\n\t\t\t\tif (v[j][k]){\n\t\t\t\t\tbx = min(bx, j);\n\t\t\t\t\tby = min(by, k);\n\t\t\t\t\tex = max(ex, j);\n\t\t\t\t\tey = max(ey, k);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tp[i].h = ex - bx + 1;\n\t\tp[i].w = ey - by + 1;\n\t\tp[i].v.assign(p[i].h, 0);\n\t\tfor (int j = 0; j < p[i].h; j++){\n\t\t\tfor (int k = 0; k < p[i].w; k++){\n\t\t\t\tif (v[bx + j][by + k]){\n\t\t\t\t\tp[i].v[j] |= BIT(k);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tvector<vector<int> > nx(20, vector<int>(20));\n\t\tfor (int i = 0; i < 20; i++){\n\t\t\tfor (int j = 0; j < 20; j++){\n\t\t\t\tnx[i][j] = v[j][19 - i];\n\t\t\t}\n\t\t}\n\t\tv = nx;\n\t}\n}\n\nvector<int> ch;\nvector<int> used;\nbool check()\n{\n\tint sum = 0;\n\tfor (int i = 0; i < 20; i++){\n\t\tsum += __builtin_popcount(~board[i]);\n\t}\n\tfor (int i = 0; i < ch.size(); i++){\n\t\tfor (int j = 0; j < p[ch[i]][0].v.size(); j++){\n\t\t\tsum -= __builtin_popcount(p[ch[i]][0].v[j]);\n\t\t}\n\t}\n\treturn sum == 0;\n}\n\nbool can(int x, int y, Piece &pi)\n{\n\tfor (int i = 0; i < pi.h; i++){\n\t\tif (board[x + i] & (pi.v[i] << y)){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool act(int x, int y, Piece &pi)\n{\n\tfor (int i = 0; i < pi.h; i++){\n\t\tboard[x + i] ^= pi.v[i] << y;\n\t}\n}\n\nbool ng()\n{\n\tint b[20] = {};\n\tfor (int i = 0; i < 20; i++) b[i] = board[i];\n\tfor (int i = 0; i < ch.size(); i++){\n\t\tif (used[i]) continue;\n\t\tfor (int a = 0; a < 4; a++){\n\t\t\tPiece &pi = p[ch[i]][a];\n\t\t\tfor (int j = 0; j + pi.h <= H; j++){\n\t\t\t\tfor (int k = 0; k + pi.w <= W; k++){\n\t\t\t\t\tif (can(j, k, pi)){\n\t\t\t\t\t\tfor (int l = 0; l < pi.h; l++){\n\t\t\t\t\t\t\tb[j + l] |= pi.v[l] << k;\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\tfor (int i = 0; i < 20; i++){\n\t\tif (b[i] != -1) return true;\n\t}\n\treturn false;\n}\n\nbool dfs(int cur)\n{\n\tif (cur == ch.size()) return true;\n\tif (ng()) return false;\n\t\n\tfor (int a = 0; a < 4; a++){\n\t\tPiece &pi = p[ch[cur]][a];\n\t\tfor (int i = 0; i + pi.h <= H; i++){\n\t\t\tfor (int j = 0; j + pi.w <= W; j++){\n\t\t\t\tif (can(i, j, pi)){\n\t\t\t\t\tact(i, j, pi);\n\t\t\t\t\tused[cur] = true;\n\t\t\t\t\tbool f = dfs(cur + 1);\n\t\t\t\t\tact(i, j, pi);\n\t\t\t\t\tused[cur] = false;\n\t\t\t\t\tif (f) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\twhile (scanf(\"%d %d\", &H, &W), H){\n\t\tmemset(board, -1, sizeof(board));\n\t\t\n\t\tfor (int i = 0; i < H; i++){\n\t\t\tstring str;\n\t\t\tcin >> str;\n\t\t\tfor (int j = 0; j < W; j++){\n\t\t\t\tif (str[j] == '.') board[i] ^= BIT(j);\n\t\t\t}\n\t\t}\n\t\t\n\t\tscanf(\"%d\", &n);\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tint h, w;\n\t\t\tscanf(\"%d %d\", &h, &w);\n\t\t\tvector<vector<int> > buf(20, vector<int>(20));\n\t\t\tfor (int j = 0; j < h; j++){\n\t\t\t\tfor (int k = 0; k < w; k++){\n\t\t\t\t\tchar c;\n\t\t\t\t\tcin >> c;\n\t\t\t\t\tif (c == '#') buf[j][k] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tgenerate(buf, p[i]);\n\t\t}\n\t\t\n\t\tint m;\n\t\tscanf(\"%d\", &m);\n\t\tfor (int i = 0; i < m; i++){\n\t\t\tint k;\n\t\t\tscanf(\"%d\", &k);\n\t\t\tch.resize(k);\n\t\t\tused.assign(k, 0);\n\t\t\tfor (int j = 0; j < k; j++){\n\t\t\t\tscanf(\"%d\", &ch[j]);\n\t\t\t\tch[j]--;\n\t\t\t}\n\t\t\tputs(check() && dfs(0) ? \"YES\" : \"NO\");\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 1252,
"score_of_the_acc": -0.1335,
"final_rank": 4
},
{
"submission_id": "aoj_0132_1168064",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <bitset>\n#include <algorithm>\nusing namespace std;\n\nvector<string> puzzle_flame;\nint puzzle_size;\nint puzzle_w;\nint puzzle_h;\nint piece_num;\n\nstruct piece {\n\tvector<vector<string> > p;\n\tint size;\n\tvector<int> sharp_x;\n\tvector<int> sharp_y;\n\tbitset<4> same_flg;\n\tpiece() {}\n\tpiece(vector<string> v) {\n// make rotate piece {{{\n\t\tvector<string> tmp;\n\n\t\tp.push_back(v);\n\n\t\tfor(int i = 0; i < v[0].size(); i++) {\n\t\t\tstring s = \"\";\n\t\t\tfor(int j = 0; j < v.size(); j++) {\n\t\t\t\ts += v[j][v[0].size() - 1 - i];\n\t\t\t}\n\t\t\ttmp.push_back(s);\n\t\t}\n\t\tp.push_back(tmp);\n\n\t\ttmp.clear();\n\t\tfor(int i = 0; i < v.size(); i++) {\n\t\t\tstring s = \"\";\n\t\t\tfor(int j = 0; j < v[i].size(); j++) {\n\t\t\t\ts += v[v.size() - 1 - i][v[0].size() - 1 - j];\n\t\t\t}\n\t\t\ttmp.push_back(s);\n\t\t}\n\t\tp.push_back(tmp);\n\n\t\ttmp.clear();\n\t\tfor(int i = 0; i < v[0].size(); i++) {\n\t\t\tstring s = \"\";\n\t\t\tfor(int j = 0; j < v.size(); j++) {\n\t\t\t\ts += v[v.size() - 1 - j][i];\n\t\t\t}\n\t\t\ttmp.push_back(s);\n\t\t}\n\t\tp.push_back(tmp);\n// }}}\n// init size {{{\n\t\tsize = 0;\n\t\tfor(int i = 0; i < v.size(); i++) {\n\t\t\tfor(int j = 0; j < v[i].size(); j++) {\n\t\t\t\tsize += v[i][j] == '#';\n\t\t\t}\n\t\t}\n// }}}\n// make sharp_x,y {{{\n\t\tfor(int i = 0; i < p.size(); i++) {\n\t\t\tfor(int j = 0; j < p[i].size(); j++) {\n\t\t\t\tfor(int k = 0; k < p[i][j].size(); k++) {\n\t\t\t\t\tif(p[i][j][k] == '#') {\n\t\t\t\t\t\tsharp_y.push_back(j);\n\t\t\t\t\t\tsharp_x.push_back(k);\n\t\t\t\t\t\tgoto exit_mk_sharp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\nexit_mk_sharp:;\n\t\t}\n// }}}\n\t\tfor(int i = 0; i < p.size(); i++) {\n\t\t\tsame_flg[i] = false;\n\t\t\tfor(int j = 0; j < i; j++) {\n\t\t\t\tif(p[i].size() == p[j].size()) {\n\t\t\t\t\tbool flg = true;\n\t\t\t\t\tfor(int k = 0; k < p[i].size(); k++) {\n\t\t\t\t\t\tfor(int l = 0; l < p[i][k].size(); l++) {\n\t\t\t\t\t\t\tif(p[i][k][l] != p[j][k][l]) {\n\t\t\t\t\t\t\t\tflg = false;\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(flg)\n\t\t\t\t\t\tsame_flg[i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nvector<piece> usable_pieces;\n\nbitset<64> interference[40][40][64];\nconst int margin = 32;\n// piece a, b, bias Y b - a, bias X b - a\nvoid set_interference() { // {{{\n\tfor(int i = 0; i < usable_pieces.size()*4; i++) {\n\t\tconst vector<string> a = usable_pieces[i >> 2].p[i & 0x3];\n\t\tfor(int j = 0; j < usable_pieces.size()*4; j++) {\n\t\t\tconst vector<string> b = usable_pieces[j >> 2].p[j & 0x3];\n\n\t\t//\tcout << i << \",\" << j << endl;\n\t\t//\tcout << (i >> 2) << \",\" << (i & 0x3) << \" \" << (j >> 2) << \",\" << (j & 0x3) << endl;\n\n\t\t\tif((i >> 2) == (j >> 2)) {\n\t\t\t\tfor(int bias_i = 0; bias_i < 64; bias_i++) {\n\t\t\t\t\tfor(int bias_j = 0; bias_j < 64; bias_j++) {\n\t\t\t\t\t\tinterference[i][j][bias_i][bias_j] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int bias_i = -25; bias_i <= 25; bias_i++) {\n\t\t\t\tfor(int bias_j = -25; bias_j <= 25; bias_j++) {\n\t\t\t\t\tbool f = true;\n\t\t\t\t\tfor(int i_ = max(0, bias_i); i_ < min((int)a.size(), (int)b.size() + bias_i); i_++) {\n\t\t\t\t\t\tfor(int j_ = max(0, bias_j); j_ < min((int)a[0].size(), (int)b[0].size() + bias_j); j_++) {\n\t\t\t\t\t\t\tif((a[i_][j_] == '#') && (b[i_ - bias_i][j_ - bias_j] == '#'))\n\t\t\t\t\t\t\t\tf = false;\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\tinterference[i][j][margin + bias_i].set(margin + bias_j);\n\t\t\t\t\telse {\n\t\t\t\t\t\tinterference[i][j][margin + bias_i].reset(margin + bias_j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n// }}}\n}\n\n\nbitset<20> put[40][20];\nvoid set_put() { // {{{\n\tfor(int i = 0; i < usable_pieces.size()*4; i++) {\n\t\tconst vector<string> a = usable_pieces[i >> 2].p[i & 0x3];\n\t\tfor(int j = 0; j < puzzle_h; j++) {\n\t\t\tfor(int k = 0; k < puzzle_w; k++) {\n\t\t\t\tif(j + a.size() > puzzle_h || k + a[0].size() > puzzle_w) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbool f = true;\n\t\t\t\tfor(int j_ = 0; j_ < a.size(); j_++) {\n\t\t\t\t\tfor(int k_ = 0; k_ < a[j_].size(); k_++) {\n\t\t\t\t\t\tif(puzzle_flame[j+j_][k+k_] == '#' && a[j_][k_] == '#')\n\t\t\t\t\t\t\tf = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(f)\n\t\t\t\t\tput[i][j].set(k);\n\t\t\t\telse\n\t\t\t\t\tput[i][j].reset(k);\n\t\t\t}\n\t\t}\n\t}\n\t//cout << endl;\n// }}}\n}\n\nint piece_list;\nstruct position {\n\tint x, y;\n\tint n;\n\tposition(int x_, int y_, int n_) {\n\t\tx = x_;\n\t\ty = y_;\n\t\tn = n_;\n\t}\n};\nvector<position> use;\nint use_flgs;\n\nbool solve(int y, int x) {\n\t/*\n\tcout << endl;\n\tfor(int i = 0; i < puzzle_h; i++) {\n\t\tcout << puzzle_flame[i] << endl;\n\t} cout << endl;\n\tfor(int i = 0; i < 10; i++)\n\t\tcout << (((piece_list^use_flgs) & (1 << i)) ? '1' : '0');\n\tcout << endl;\n\tfor(int i = 0; i < puzzle_h; i++) {\n\t\tfor(int j = 0; j < puzzle_w; j++) {\n\t\t\tif(puzzle_flame[i][j] == '*')\n\t\t\t\tpuzzle_flame[i][j] = '#';\n\t\t}\n\t}\n\t// */\n\tif(!(piece_list ^ use_flgs))\n\t\treturn true;\n\tfor(int i = 0; i < puzzle_h; i++) {\n\t\tfor(int j = 0; j < puzzle_w; j++) {\n\t\t\tif(puzzle_flame[i][j] == '.') {\n\t\t\t//\tcout << \"i,j:\" << i << \",\" << j << endl;\n\t\t\t\tfor(int k = 0; k < piece_num; k++) {\n\t\t\t\t\tif((piece_list ^ use_flgs) & (1 << k)) {\n\t\t\t\t\t\tfor(int l = 0; l < 4; l++) {\n\t\t\t\t\t\t\tif(usable_pieces[k].same_flg[l]) {\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tint X, Y;\n\t\t\t\t\t\t\tY = i - usable_pieces[k].sharp_y[l];\n\t\t\t\t\t\t\tX = j - usable_pieces[k].sharp_x[l];\n\t\t\t\t//\t\t\tcout << X << \",\" << Y << \",\" << k << endl;\n\t\t\t\t\t\t\tif(Y >= 0 && X >= 0 && put[(k << 2) + l][Y][X]) {\n\t\t\t\t\t\t\t\tbool call_flg = true;\n\t\t\t\t\t\t\t\tfor(int m = 0; m < use.size(); m++) {\n\t\t\t\t\t\t\t\t\tcall_flg &= interference[(k<<2)+l][use[m].n][margin + use[m].y - Y][margin + use[m].x - X];\n\t\t\t\t\t\t\t\t//\tcout << use[m].y << \",\" << use[m].x << \",\" << use[m].n << endl;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(call_flg) {\n\t\t\t\t\t\t\t\t\tint next_x, next_y;\n\t\t\t\t\t\t\t\t\tnext_x = (j + 1) % puzzle_w;\n\t\t\t\t\t\t\t\t\tnext_y = i + (j + 1) / puzzle_w;\n\n\t\t\t\t\t\t\t\t\tfor(int i_ = 0; i_ < usable_pieces[k].p[l].size(); i_++) {\n\t\t\t\t\t\t\t\t\t\tfor(int j_ = 0; j_ < usable_pieces[k].p[l][i_].size(); j_++) {\n\t\t\t\t\t\t\t\t\t\t\tif(usable_pieces[k].p[l][i_][j_] == '#') {\n\t\t\t\t\t\t\t\t\t\t\t\t/*\n\t\t\t\t\t\t\t\t\t\t\t\tif(puzzle_flame[Y + i_][X + j_] == '#')\n\t\t\t\t\t\t\t\t\t\t\t\t\tcout << \"fail\" << endl;\n\t\t\t\t\t\t\t\t\t\t\t\t// */\n\t\t\t\t\t\t\t\t\t\t\t\tpuzzle_flame[Y + i_][X + j_] = '#';\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tuse.push_back(position(X,Y,(k << 2)+l));\n\t\t\t\t\t\t\t\t\tuse_flgs |= 1 << k;\n\n\t\t\t\t\t\t\t\t\tbool solve_res;\n\t\t\t\t\t\t\t\t\tsolve_res = solve(next_y, next_x);\n\n\t\t\t\t\t\t\t\t\tfor(int i_ = 0; i_ < usable_pieces[k].p[l].size(); i_++) {\n\t\t\t\t\t\t\t\t\t\tfor(int j_ = 0; j_ < usable_pieces[k].p[l][i_].size(); j_++) {\n\t\t\t\t\t\t\t\t\t\t\tif(usable_pieces[k].p[l][i_][j_] == '#') {\n\t\t\t\t\t\t\t\t\t\t\t\tpuzzle_flame[Y + i_][X + j_] = '.';\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tuse.pop_back();\n\t\t\t\t\t\t\t\t\tuse_flgs &= ~(1 << k);\n\n\t\t\t\t\t\t\t\t\tif(solve_res)\n\t\t\t\t\t\t\t\t\t\treturn 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}\n\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nvoid init_global_val() {\n\tpuzzle_flame.clear();\n\tpuzzle_size = 0;\n\tpuzzle_w = 0;\n\tpuzzle_h = 0;\n\tpiece_num = 0;\n\tusable_pieces.clear();\n\tfor(int i = 0; i < 40; i++) {\n\t\tfor(int j = 0; j < 40; j++) {\n\t\t\tfor(int k = 0; k < 64; k++) {\n\t\t\t\tfor(int l = 0; l < 64; l++) {\n\t\t\t\t\tinterference[i][j][k].set(l);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tpiece_list = 0;\n\tuse.clear();\n\tuse_flgs = 0;\n\tfor(int i = 0; i < 40; i++) {\n\t\tfor(int j = 0; j < 20; j++) {\n\t\t\tfor(int k = 0; k < 20; k++) {\n\t\t\t\tput[i][j].reset(k);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid solve_init() {\n\tpiece_list = 0;\n\tuse_flgs = 0;\n\tuse.clear();\n}\n\nint main() {\n\tinit_global_val();\n\twhile(cin >> puzzle_h >> puzzle_w, puzzle_h || puzzle_w) {\n// input puzzle {{{\n\t\tfor(int i = 0; i < puzzle_h; i++) {\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\tpuzzle_flame.push_back(s);\n\t\t}\n\t\tcin >> piece_num;\n\t\tfor(int i = 0; i < piece_num; i++) {\n\t\t\tint h, w;\n\t\t\tcin >> h >> w;\n\t\t\tvector<string> v;\n\t\t\tfor(int j = 0; j < h; j++) {\n\t\t\t\tstring s;\n\t\t\t\tcin >> s;\n\t\t\t\tv.push_back(s);\n\t\t\t}\n\t\t\tusable_pieces.push_back(piece(v));\n\t\t}\n// }}}\n// prepaire {{{\n\t\tpuzzle_size = 0;\n\t\tfor(int i = 0; i < puzzle_flame.size(); i++) {\n\t\t\tfor(int j = 0; j < puzzle_flame[i].size(); j++) {\n\t\t\t\tpuzzle_size += (puzzle_flame[i][j] == '.');\n\t\t\t}\n\t\t}\n\n\t\t//cout << puzzle_size << endl;\n\n\t\tset_interference();\n\t\tset_put();\n\n\t\t/*\n\t\tfor(int i = 0; i < 4*usable_pieces.size(); i++) {\n\t\t\tcout << (i >> 2) << \":\" << (i & 0x3) << endl;\n\t\t\tfor(int j = 0; j < puzzle_h; j++) {\n\t\t\t\tfor(int k = 0; k < puzzle_w; k++) {\n\t\t\t\t\tcout << (put[i][j][k] ? '.' : '@');\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t// */\n// }}}\n// query {{{\n\t\tint query_num;\n\t\tcin >> query_num;\n\t\tfor(int q = 0; q < query_num; q++) {\n\t\t\tint n;\n\t\t\tcin >> n;\n\t\t\tsolve_init();\n\n\t\t\tint sz = 0;\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tint k;\n\t\t\t\tcin >> k;\n\t\t\t\tpiece_list ^= (1 << (k - 1));\n\t\t\t\tsz += usable_pieces[k-1].size;\n\t\t\t}\n\n\t\t\t/*\n\t\t\tif(puzzle_size != sz)\n\t\t\t\tcout << \"size error:\";\n\t\t\t// */\n\t\t\tif(puzzle_size == sz && solve(0,0))\n\t\t\t\tcout << \"YES\" << endl;\n\t\t\telse\n\t\t\t\tcout << \"NO\" << endl;\n\t\t}\n// }}}\n\t\tinit_global_val();\n\t}\n}",
"accuracy": 1,
"time_ms": 2530,
"memory_kb": 2084,
"score_of_the_acc": -0.6455,
"final_rank": 15
},
{
"submission_id": "aoj_0132_1112481",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<vector>\n#include<set>\nusing namespace std;\nchar str[22][22];\nint has[12];\nchar p[12][22][22];\nint bit[12][4][22];\nint h[12];\nint w[12];\nint r;\nint com[12];\nvector<int> now;\nint H,W;\n\n//set<vector<int> >S;\nint solve(int a){\n\tif(a==r)return 1;\n//\tif(S.count(now))return 0;\n//\tS.insert(now);\n\tint tmp[22];\n\tfor(int i=0;i<H;i++)tmp[i]=now[i];\n\tfor(int i=a;i<r;i++){\n\t\tint v=com[i];\n\t\tfor(int j=0;j<=H-h[v];j++)for(int k=0;k<=W-w[v];k++){\n\t\t\tbool ok=true;\n\t\t\tfor(int l=0;l<h[v];l++)if((bit[v][0][l]<<k)&now[j+l]){ok=false;break;}\n\t\t\tif(ok){\n\t\t\t\tfor(int l=0;l<h[v];l++)tmp[j+l]|=(bit[v][0][l]<<k);\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=H-h[v];j++)for(int k=0;k<=W-w[v];k++){\n\t\t\tbool ok=true;\n\t\t\tfor(int l=0;l<h[v];l++)if((bit[v][2][l]<<k)&now[j+l]){ok=false;break;}\n\t\t\tif(ok){\n\t\t\t\tfor(int l=0;l<h[v];l++)tmp[j+l]|=(bit[v][2][l]<<k);\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=H-w[v];j++)for(int k=0;k<=W-h[v];k++){\n\t\t\tbool ok=true;\n\t\t\tfor(int l=0;l<w[v];l++)if((bit[v][1][l]<<k)&now[j+l]){ok=false;break;}\n\t\t\tif(ok){\n\t\t\t\tfor(int l=0;l<w[v];l++)tmp[j+l]|=(bit[v][1][l]<<k);\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=H-w[v];j++)for(int k=0;k<=W-h[v];k++){\n\t\t\tbool ok=true;\n\t\t\tfor(int l=0;l<w[v];l++)if((bit[v][3][l]<<k)&now[j+l]){ok=false;break;}\n\t\t\tif(ok){\n\t\t\t\tfor(int l=0;l<w[v];l++)tmp[j+l]|=(bit[v][3][l]<<k);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(!(tmp[i]&(1<<j)))return 0;\n\tint f=com[a];\n\tfor(int i=0;i<=H-h[f];i++){\n\t\tfor(int j=0;j<=W-w[f];j++){\n\t\t\tbool ok=true;\n\t\t\tfor(int k=0;k<h[f];k++)if((bit[f][0][k]<<j)&now[i+k]){ok=false;break;}\n\t\t\tif(ok){\n\t\t\t\tfor(int k=0;k<h[f];k++)now[i+k]^=(bit[f][0][k]<<j);\n\t\t\t\tif(solve(a+1))return 1;\n\t\t\t\tfor(int k=0;k<h[f];k++)now[i+k]^=(bit[f][0][k]<<j);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<=H-h[f];i++){\n\t\tfor(int j=0;j<=W-w[f];j++){\n\t\t\tbool ok=true;\n\t\t\tfor(int k=0;k<h[f];k++)if((bit[f][2][k]<<j)&now[i+k]){ok=false;break;}\n\t\t\tif(ok){\n\t\t\t\tfor(int k=0;k<h[f];k++)now[i+k]^=(bit[f][2][k]<<j);\n\t\t\t\tif(solve(a+1))return 1;\n\t\t\t\tfor(int k=0;k<h[f];k++)now[i+k]^=(bit[f][2][k]<<j);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<=H-w[f];i++){\n\t\tfor(int j=0;j<=W-h[f];j++){\n\t\t\tbool ok=true;\n\t\t\tfor(int k=0;k<w[f];k++)if((bit[f][1][k]<<j)&now[i+k]){ok=false;break;}\n\t\t\tif(ok){\n\t\t\t\tfor(int k=0;k<w[f];k++)now[i+k]^=(bit[f][1][k]<<j);\n\t\t\t\tif(solve(a+1))return 1;\n\t\t\t\tfor(int k=0;k<w[f];k++)now[i+k]^=(bit[f][1][k]<<j);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<=H-w[f];i++){\n\t\tfor(int j=0;j<=W-h[f];j++){\n\t\t\tbool ok=true;\n\t\t\tfor(int k=0;k<w[f];k++)if((bit[f][3][k]<<j)&now[i+k]){ok=false;break;}\n\t\t\tif(ok){\n\t\t\t\tfor(int k=0;k<w[f];k++)now[i+k]^=(bit[f][3][k]<<j);\n\t\t\t\tif(solve(a+1))return 1;\n\t\t\t\tfor(int k=0;k<w[f];k++)now[i+k]^=(bit[f][3][k]<<j);\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nint sts[12];\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tH=a;W=b;\n\t\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\t\tint cnt=0;\n\t\tnow=vector<int>(a);\n\t\tfor(int i=0;i<a;i++)now[i]=0;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)if(str[i][j]=='#')now[i]+=(1<<j);\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)if(str[i][j]=='.')cnt++;\n\t\tint n;scanf(\"%d\",&n);\n\t\tfor(int i=0;i<n;i++)for(int j=0;j<4;j++)for(int k=0;k<22;k++)\n\t\t\tbit[i][j][k]=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\thas[i]=0;\n\t\t\tscanf(\"%d%d\",h+i,w+i);\n\t\t\tsts[i]=max((H-h[i]+1)*(W-w[i]+1),(H-w[i]+1)*(W-h[i]+1));\n\t\t\tfor(int j=0;j<h[i];j++)scanf(\"%s\",p[i][j]);\n\t\t\tfor(int j=0;j<h[i];j++){\n\t\t\t\tfor(int k=0;k<w[i];k++){\n\t\t\t\t\tif(p[i][j][k]=='#'){\n\t\t\t\t\t\thas[i]++;\n\t\t\t\t\t\tbit[i][0][j]+=(1<<k);\n\t\t\t\t\t\tbit[i][1][w[i]-1-k]+=(1<<j);\n\t\t\t\t\t\tbit[i][2][h[i]-1-j]+=(1<<(w[i]-1-k));\n\t\t\t\t\t\tbit[i][3][k]+=(1<<(h[i]-1-j));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint m;scanf(\"%d\",&m);\n\t\twhile(m--){\n\t//\t\tS.clear();\n\t\t\tfor(int i=0;i<a;i++)now[i]=0;\n\t\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)if(str[i][j]=='#')now[i]+=(1<<j);\n\t\t\tint sum=0;\n\t\t\tscanf(\"%d\",&r);\n\t\t\tfor(int i=0;i<r;i++){\n\t\t\t\tscanf(\"%d\",com+i);com[i]--;\n\t\t\t\tsum+=has[com[i]];\n\t\t\t}\n\t\t\tif(sum!=cnt){printf(\"NO\\n\");continue;}\n\t\t\tfor(int i=0;i<r;i++){\n\t\t\t\tfor(int j=0;j<r-1;j++){\n\t\t\t\t\tif(sts[com[j]]>sts[com[j+1]]){\n\t\t\t\t\t\tswap(com[j],com[j+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint res=solve(0);\n\t\t\tif(res)printf(\"YES\\n\");\n\t\t\telse printf(\"NO\\n\");\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 1012,
"score_of_the_acc": -0.1372,
"final_rank": 5
},
{
"submission_id": "aoj_0132_1006750",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\n#include<algorithm>\nusing namespace std;\n\nenum {Blank, Fill};\n\nclass Piece{\n vector<vector<int>> tile_value[4];\n int h_value[4], w_value[4];\n int dx_value[4];\n int direction;\npublic:\n Piece(const vector<vector<int>>& tile) {\n direction = 0;\n for(int d = 0; d < 4; ++d) {\n h_value[d] = d & 1 ? tile[0].size() : tile.size();\n w_value[d] = d & 1 ? tile.size() : tile[0].size();\n }\n for(int d = 0; d < 4; ++d) tile_value[d].resize(h_value[d]);\n for(int d = 0; d < 4; ++d) for(int i = 0; i < h_value[d]; ++i) tile_value[d][i].resize(w_value[d]);\n tile_value[0] = tile;\n for(int d = 1; d < 4; ++d) for(int i = 0; i < h_value[d]; ++i) for(int j = 0; j < w_value[d]; ++j)\n tile_value[d][i][j] = tile_value[d - 1][j][h_value[d] - 1 - i];\n for(int d = 0; d < 4; ++d) for(int j = 0; j < w_value[d]; ++j) {\n if(tile_value[d][0][j] == Blank) continue;\n dx_value[d] = j;\n break;\n }\n }\n int h() const {return h_value[direction];}\n int w() const {return w_value[direction];}\n int tile(int i, int j) const {return tile_value[direction][i][j];}\n int dx() const {return dx_value[direction];}\n void rotate() {direction = (direction + 1) % 4;}\n};\n\nint h, w;\nvector<Piece> piece;\nmap<pair<vector<vector<int>>, vector<int>>, bool> memo;\n\nbool dfs(const vector<vector<int>>& puzzle, const vector<int>& candidate) {\n if(memo.count(make_pair(puzzle, candidate))) return memo[make_pair(puzzle, candidate)];\n bool ok = true;\n int y, x;\n for(int i = 0; ok && i < h; ++i) for(int j = 0; ok && j < w; ++j) {\n if(puzzle[i][j] == Fill) continue;\n y = i;\n x = j;\n ok = false;\n }\n if(ok) return memo[make_pair(puzzle, candidate)] = (candidate.size() == 0);\n\n for(int c = 0; c < candidate.size(); ++c) {\n Piece p = piece[candidate[c]];\n for(int d = 0; d < 4; ++d) {\n p.rotate();\n if(h < y + p.h()) continue;\n if(w < x - p.dx() + p.w()) continue;\n if(x - p.dx() < 0) continue;\n vector<vector<int>> _puzzle = puzzle;\n ok = true;\n for(int i = 0; ok && i < p.h(); ++i) for(int j = 0; ok && j < p.w(); ++j) {\n _puzzle[y + i][x - p.dx() + j] += p.tile(i, j);\n if(_puzzle[y + i][x - p.dx() + j] == 2) ok = false;\n }\n if(!ok) continue;\n vector<int> _candidate = candidate;\n _candidate.erase(_candidate.begin() + c);\n if(dfs(_puzzle, _candidate)) return memo[make_pair(puzzle, candidate)] = true;\n }\n }\n return memo[make_pair(puzzle, candidate)] = false;\n}\n\nint main() {\n while(cin >> h >> w, h | w) {\n vector<vector<int>> puzzle(h, vector<int>(w));\n for(int i = 0; i < h; ++i) {\n string input;\n cin >> input;\n for(int j = 0; j < w; ++j) puzzle[i][j] = (input[j] == '#' ? Fill : Blank);\n }\n\n int n;\n piece.clear();\n for(cin >> n; 0 < n; --n) {\n int h1, w1;\n cin >> h1 >> w1;\n vector<vector<int>> tile(h1, vector<int>(w1));\n for(int i = 0; i < h1; ++i) {\n string input;\n cin >> input;\n for(int j = 0; j < w1; ++j) tile[i][j] = (input[j] == '#' ? Fill : Blank);\n }\n piece.push_back(Piece(tile));\n }\n\n memo.clear();\n int p;\n for(cin >> p; 0 < p; --p) {\n int k;\n vector<int> candidate;\n for(cin >> k; 0 < k; --k) {\n int x;\n cin >> x;\n candidate.push_back(x - 1);\n }\n sort(candidate.begin(), candidate.end());\n cout << (dfs(puzzle, candidate) ? \"YES\" : \"NO\") << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 2260,
"memory_kb": 63692,
"score_of_the_acc": -1.5607,
"final_rank": 19
},
{
"submission_id": "aoj_0132_1006709",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\n#include<algorithm>\nusing namespace std;\n\nenum {Blank, Fill};\n\nclass Piece{\n vector<vector<int>> tile_value[4];\n int h_value[4], w_value[4];\n int dx_value[4];\n int direction;\npublic:\n Piece(vector<vector<int>> tile) {\n direction = 0;\n for(int d = 0; d < 4; ++d) {\n h_value[d] = d & 1 ? tile[0].size() : tile.size();\n w_value[d] = d & 1 ? tile.size() : tile[0].size();\n }\n for(int d = 0; d < 4; ++d) tile_value[d].resize(h_value[d]);\n for(int d = 0; d < 4; ++d) for(int i = 0; i < h_value[d]; ++i) tile_value[d][i].resize(w_value[d]);\n tile_value[0] = tile;\n for(int d = 1; d < 4; ++d) for(int i = 0; i < h_value[d]; ++i) for(int j = 0; j < w_value[d]; ++j)\n tile_value[d][i][j] = tile_value[d - 1][j][h_value[d] - 1 - i];\n for(int d = 0; d < 4; ++d) for(int j = 0; j < w_value[d]; ++j) {\n if(tile_value[d][0][j] == Blank) continue;\n dx_value[d] = j;\n break;\n }\n }\n int h() {return h_value[direction];}\n int w() {return w_value[direction];}\n int tile(int i, int j) {return tile_value[direction][i][j];}\n int dx() {return dx_value[direction];}\n void rotate() {direction = (direction + 1) % 4;}\n};\n\nint h, w;\nvector<Piece> piece;\nmap<pair<vector<vector<int>>, vector<int>>, bool> memo;\n\nbool dfs(vector<vector<int>> puzzle, vector<int> candidate) {\n if(memo.count(make_pair(puzzle, candidate))) return memo[make_pair(puzzle, candidate)];\n bool ok = true;\n int y, x;\n for(int i = 0; ok && i < h; ++i) for(int j = 0; ok && j < w; ++j) {\n if(puzzle[i][j] == Fill) continue;\n y = i;\n x = j;\n ok = false;\n }\n if(ok) return memo[make_pair(puzzle, candidate)] = (candidate.size() == 0);\n\n for(int c = 0; c < candidate.size(); ++c) {\n Piece p = piece[candidate[c]];\n for(int d = 0; d < 4; ++d) {\n p.rotate();\n if(h < y + p.h()) continue;\n if(w < x - p.dx() + p.w()) continue;\n if(x - p.dx() < 0) continue;\n vector<vector<int>> _puzzle = puzzle;\n ok = true;\n for(int i = 0; ok && i < p.h(); ++i) for(int j = 0; ok && j < p.w(); ++j) {\n _puzzle[y + i][x - p.dx() + j] += p.tile(i, j);\n if(_puzzle[y + i][x - p.dx() + j] == 2) ok = false;\n }\n if(!ok) continue;\n vector<int> _candidate = candidate;\n _candidate.erase(_candidate.begin() + c);\n if(dfs(_puzzle, _candidate)) return memo[make_pair(puzzle, candidate)] = true;\n }\n }\n return memo[make_pair(puzzle, candidate)] = false;\n}\n\nint main() {\n while(cin >> h >> w, h | w) {\n vector<vector<int>> puzzle(h, vector<int>(w));\n for(int i = 0; i < h; ++i) {\n string input;\n cin >> input;\n for(int j = 0; j < w; ++j) puzzle[i][j] = (input[j] == '#' ? Fill : Blank);\n }\n\n int n;\n piece.clear();\n for(cin >> n; 0 < n; --n) {\n int h1, w1;\n cin >> h1 >> w1;\n vector<vector<int>> tile(h1, vector<int>(w1));\n for(int i = 0; i < h1; ++i) {\n string input;\n cin >> input;\n for(int j = 0; j < w1; ++j) tile[i][j] = (input[j] == '#' ? Fill : Blank);\n }\n piece.push_back(Piece(tile));\n }\n\n int p;\n memo.clear();\n for(cin >> p; 0 < p; --p) {\n int k;\n vector<int> candidate;\n for(cin >> k; 0 < k; --k) {\n int x;\n cin >> x;\n candidate.push_back(x - 1);\n }\n sort(candidate.begin(), candidate.end());\n cout << (dfs(puzzle, candidate) ? \"YES\" : \"NO\") << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 2330,
"memory_kb": 63720,
"score_of_the_acc": -1.5786,
"final_rank": 20
},
{
"submission_id": "aoj_0132_1006706",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\n#include<algorithm>\nusing namespace std;\n\nenum {Blank, Fill};\n\nclass Piece{\n vector<vector<int>> tile_value[4];\n int h_value[4], w_value[4];\n int dx_value[4];\n int direction;\npublic:\n Piece(vector<vector<int>> tile) {\n direction = 0;\n for(int d = 0; d < 4; ++d) {\n h_value[d] = d & 1 ? tile[0].size() : tile.size();\n w_value[d] = d & 1 ? tile.size() : tile[0].size();\n }\n for(int d = 0; d < 4; ++d) tile_value[d].resize(h_value[d]);\n for(int d = 0; d < 4; ++d) for(int i = 0; i < h_value[d]; ++i) tile_value[d][i].resize(w_value[d]);\n tile_value[0] = tile;\n for(int d = 1; d < 4; ++d) for(int i = 0; i < h_value[d]; ++i) for(int j = 0; j < w_value[d]; ++j)\n tile_value[d][i][j] = tile_value[d - 1][j][h_value[d] - 1 - i];\n for(int d = 0; d < 4; ++d) for(int j = 0; j < w_value[d]; ++j) {\n if(tile_value[d][0][j] == Blank) continue;\n dx_value[d] = j;\n break;\n }\n }\n int h() {return h_value[direction];}\n int w() {return w_value[direction];}\n int tile(int i, int j) {return tile_value[direction][i][j];}\n int dx() {return dx_value[direction];}\n void rotate() {direction = (direction + 1) % 4;}\n};\n\nint h, w;\nvector<Piece> piece;\nmap<pair<vector<vector<int>>, vector<int>>, bool> memo;\n\nbool dfs(vector<vector<int>> puzzle, vector<int> candidate) {\n if(memo.count(make_pair(puzzle, candidate))) return memo[make_pair(puzzle, candidate)];\n bool ok = true;\n int y, x;\n for(int i = 0; ok && i < h; ++i) for(int j = 0; ok && j < w; ++j) {\n if(puzzle[i][j] == Fill) continue;\n y = i;\n x = j;\n ok = false;\n }\n if(ok) return memo[make_pair(puzzle, candidate)] = (candidate.size() == 0);\n\n for(int c = 0; c < candidate.size(); ++c) {\n Piece p = piece[candidate[c]];\n for(int d = 0; d < 4; ++d) {\n p.rotate();\n if(h < y + p.h()) continue;\n if(w < x - p.dx() + p.w()) continue;\n if(x - p.dx() < 0) continue;\n vector<vector<int>> _puzzle = puzzle;\n ok = true;\n for(int i = 0; ok && i < p.h(); ++i) for(int j = 0; ok && j < p.w(); ++j) {\n _puzzle[y + i][x - p.dx() + j] += p.tile(i, j);\n if(_puzzle[y + i][x - p.dx() + j] == 2) ok = false;\n }\n if(!ok) continue;\n vector<int> _candidate = candidate;\n _candidate.erase(_candidate.begin() + c);\n if(dfs(_puzzle, _candidate)) return memo[make_pair(puzzle, candidate)] = true;\n }\n }\n return memo[make_pair(puzzle, candidate)] = false;\n}\n\nint main() {\n while(cin >> h >> w, h | w) {\n vector<vector<int>> puzzle(h, vector<int>(w));\n for(int i = 0; i < h; ++i) {\n string input;\n cin >> input;\n for(int j = 0; j < w; ++j) puzzle[i][j] = (input[j] == '#' ? Fill : Blank);\n }\n\n int n;\n piece.clear();\n for(cin >> n; 0 < n; --n) {\n int h1, w1;\n cin >> h1 >> w1;\n vector<vector<int>> tile(h1, vector<int>(w1));\n for(int i = 0; i < h1; ++i) {\n string input;\n cin >> input;\n for(int j = 0; j < w1; ++j) tile[i][j] = (input[j] == '#' ? Fill : Blank);\n }\n piece.push_back(Piece(tile));\n }\n\n int p;\n for(cin >> p; 0 < p; --p) {\n int k;\n vector<int> candidate;\n for(cin >> k; 0 < k; --k) {\n int x;\n cin >> x;\n candidate.push_back(x - 1);\n }\n memo.clear();\n sort(candidate.begin(), candidate.end());\n cout << (dfs(puzzle, candidate) ? \"YES\" : \"NO\") << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 2000,
"memory_kb": 12848,
"score_of_the_acc": -0.685,
"final_rank": 16
},
{
"submission_id": "aoj_0132_956344",
"code_snippet": "#include<iostream>\n#include<map>\nusing namespace std;\n\nint H,W;\nclass Puzzle{\n public:\n \n int S;\n char t[20][20];\n\n bool operator < (const Puzzle &p)const{\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n\tif(t[i][j]==p.t[i][j])continue;\n\treturn t[i][j]<p.t[i][j];\n }\n }\n return S<p.S;\n }\n};\n\nPuzzle p;\nmap<Puzzle,bool> vd;\n\n\nchar u[40][20][20];\n\nint h[40],w[40];\nint n,m,a,b;\nint v;\n \nbool ans[2048];\n \nvoid input();\nvoid init();\nvoid rotate(int,int);\n \nvoid dfs(int,int);\n\nvoid check();\nbool on_check(int,int,int);\n \nvoid on_tab(int,int,int);\nvoid off_tab(int,int,int);\n \n \nint main(){\n int S;\n while(cin>>H>>W){\n if(H==0&&W==0)break;\n\n input();\n init();\n \n p.S=0;\n dfs(0,0);\n\n cin>>m;\n for(int i=0;i<m;i++){\n cin>>a;\n S=0;\n for(int j=0;j<a;j++){\n\tcin>>v;\n\tv--;\n\tS+=(1<<v);\n }\n \n if(ans[S])cout<<\"YES\"<<endl;\n else cout<<\"NO\"<<endl;\n }\n \n }\n return 0;\n}\n \n \nvoid dfs(int y,int x){\n \n int tmp=p.S;\n \n bool flg=true;\n\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n if(p.t[i][j]!='#')flg=false;\n }\n }\n if(flg){\n ans[p.S]=true;\n return;\n }\n\n vd[p]=true; \n\n for(int i=0;i<n;i++){\n if((p.S>>i)&1==1)continue;\n for(int j=0;j<4;j++){\n \n if(on_check(y,x,4*i+j)==false)continue;\n \n p.S+=(1<<i);\n \n on_tab(y,x,4*i+j);\n\n if(vd[p]==false)dfs(y,x);\n\n off_tab(y,x,4*i+j);\n\n p.S=tmp;\n }\n }\n\n if(p.t[y][x]=='#')dfs((x+1==W?y+1:y),(x+1==W?0:x+1));\n \n}\n \n \n \nvoid rotate(int a,int b){\n for(int i=0;i<h[a];i++){\n for(int j=0;j<w[a];j++){\n u[a][i][j]=u[b][j][h[a]-i-1];\n }\n }\n}\n \n \nvoid init(){\n vd.clear();\n for(int i=0;i<2048;i++)ans[i]=false;\n \n}\n \n \nvoid input(){\n for(int i=0;i<20;i++)\n for(int j=0;j<20;j++)p.t[i][j]='.';\n\n string str;\n for(int i=0;i<H;i++){\n cin>>str;\n for(int j=0;j<W;j++){\n p.t[i][j]=str[j];\n }\n }\n cin>>n;\n for(int k=0;k<n;k++){\n cin>>h[k*4]>>w[k*4];\n for(int i=0;i<h[k*4];i++){\n cin>>str;\n for(int j=0;j<w[k*4];j++){\n\tu[k*4][i][j]=str[j];\n }\n }\n for(int i=1;i<4;i++){\n h[k*4+i]=w[k*4+i-1];\n w[k*4+i]=h[k*4+i-1];\n rotate(k*4+i,k*4+i-1);\n }\n }\n}\n \n\n \nbool on_check(int y,int x,int A){\n if(y+h[A]>H||x+w[A]>W)return false;\n for(int i=y;i<y+h[A];i++){\n for(int j=x;j<x+w[A];j++){\n if(u[A][i-y][j-x]=='#'&&p.t[i][j]=='#')return false;\n }\n }\n return true;\n}\n \n \nvoid on_tab(int y,int x,int A){\n for(int i=y;i<y+h[A];i++){\n for(int j=x;j<x+w[A];j++){\n if(u[A][i-y][j-x]=='#')p.t[i][j]='#';\n }\n }\n}\n \n \nvoid off_tab(int y,int x,int A){\n for(int i=y;i<y+h[A];i++){\n for(int j=x;j<x+w[A];j++){\n if(u[A][i-y][j-x]=='#')p.t[i][j]='.';\n }\n }\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 6636,
"score_of_the_acc": -0.2019,
"final_rank": 11
}
] |
aoj_0121_cpp
|
7 パズル
7 パズルは 8 つの正方形のカードとこれらのカードがぴたりと収まる枠で構成されています。それぞれのカードには、互いに区別できるように 0, 1, 2, ..., 7 と番号がつけられています。枠には、縦に 2 個、横に 4 個のカードを並べることができます。
7 パズルを始めるときには、まず枠にすべてのカードを入れます。枠のなかで 0 のカードだけは、上下左右に隣接するカードと位置を交換することができます。たとえば、枠の状態が図(a) のときに、0 のカードの右に隣接した、7 のカードと位置を交換すれば、図(b) の状態になります。あるいは、図(a) の状態から 0 のカードの下に隣接した 2 のカードと位置を交換すれば図(c) の状態になります。図(a) の状態で 0 のカードと上下左右に隣接するカードは 7 と 2 のカードだけなので、これ以外の位置の入れ替えは許されません。
ゲームの目的は、カードをきれいに整列して図(d) の状態にすることです。最初の状態を入力とし、カードをきれいに整列するまでに、必要な最小手数を出力するプログラムを作成してください。ただし、入力されたカードの状態からは図(d) の状態に移ることは可能であるとします。
入力データは、1 行に 8 つの数字が空白区切りで与えられます。これらは、最初の状態のカードの並びを表します。例えば、図(a) の数字表現は
0 7 3 4 2 5 1 6
に、図(c) は
2 7 3 4 0 5 1 6
となります。
図(a)
0 7 3 4 2 5 1 6
の場合
図(b)
7 0 3 4 2 5 1 6
の場合
図(c)
2 7 3 4 0 5 1 6
の場合
図(d)
0 1 2 3 4 5 6 7
(最終状態)
Input
上記形式で複数のパズルが与えられます。入力の最後まで処理してください。
与えられるパズルの数は 1,000 以下です。
Output
各パズルについて、最終状態へ移行する最小手数を１行に出力してください。
Sample Input
0 1 2 3 4 5 6 7
1 0 2 3 4 5 6 7
7 6 5 4 3 2 1 0
Output for the Sample Input
0
1
28
|
[
{
"submission_id": "aoj_0121_10884785",
"code_snippet": "// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\nusing ld=long double;\nusing pl=pair<ll,ll>;\nusing vpl=vector<pl>;\nusing vl=vector<ll>;\nusing vvl=vector<vl>;\n\n#define rep(i,n) for(long long i=0LL;i<n;i++)\n#define rrep(i,a,b) for(long long i=a;i>=b;i--)\n#define FOR(i,k,n) for(long long i=k;i<n;i++)\n#define ALL(v) v.begin(),v.end()\ntemplate<typename T>ostream&operator<<(ostream& os,vector<T>&v){for(int i = 0;i < int(size(v));i++)os << v[i] << (i+1==int(size(v))?\"\":\" \");return os;}\ntemplate<typename T>istream&operator>>(istream& is,vector<T>&v){for(auto &in : v)is >> in;return is;}\nll INF = (1LL << 60) - 6846976;\n/* INF = (1LL << 60) - 6846976*/\n\n\n// #include<atcoder/all> \n// using namespace atcoder;\n// using mint = modint998244353;ll mod = 998244353;\n// // using mint = modint1000000007;ll mod = 1000000007;\n// //using mint = modint;\n// using vm = vector<mint>;\n// using vvm = vector<vm>;\n// ostream&operator<<(ostream& os,vector<mint>&v){for(int i = 0;i < int(size(v));i++)os << v[i].val() << (i+1==int(size(v))?\"\":\" \");return os;}\n\n#define LB(A,x) int(lower_bound(ALL(A),x)-A.begin())\n\n\n\n// vl dx = {1,0,-1,0}, dy = {0,1,0,-1};\n// vl dx = {1,1,1,0,-1,-1,-1,0},dy={-1,0,1,1,-1,0,1,-1};\n//----------------------------------------------\n\n\nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);\n//==============================================\n vl A(8);\n vl vec(8);\n map<vl,ll> mp;\n ll sz=0;\n iota(ALL(vec),0LL);\n vvl to(100009);\n do{\n mp[vec]=sz++;\n }while(next_permutation(ALL(vec)));\n do{\n vl tmp = vec;\n rep(i,8) if(vec[i]==0){\n if(i<4){\n swap(tmp[i],tmp[i+4]);\n to[mp[vec]].push_back(mp[tmp]);\n to[mp[tmp]].push_back(mp[vec]);\n swap(tmp[i],tmp[i+4]);\n }\n if(i%4!=3){\n swap(tmp[i],tmp[i+1]);\n to[mp[vec]].push_back(mp[tmp]);\n to[mp[tmp]].push_back(mp[vec]);\n swap(tmp[i],tmp[i+1]);\n }\n }\n }while(next_permutation(ALL(vec)));\n\n\n while(cin>>A[0]){\n FOR(i,1,8) cin>>A[i];\n queue<ll> que;\n vl dist(mp.size(),INF);\n dist[mp[A]]=0;\n que.push(mp[A]);\n while(que.size()){\n ll v = que.front(); que.pop();\n for(ll nv : to[v]){\n if(dist[nv]>dist[v]+1){\n dist[nv]=dist[v]+1;\n que.push(nv);\n }\n }\n }\n cout<<dist[0]<<endl;\n\n }\n\n\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 13600,
"score_of_the_acc": -1.5294,
"final_rank": 18
},
{
"submission_id": "aoj_0121_10853838",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <queue>\n\nusing namespace std;\n\nmap<string,int> dp;\nint dx[]={-1,1,4,-4};\n\nvoid BFS()\n{\n\tqueue<string> que;\n\n\tdp[\"01234567\"]=0;\n\tque.push(\"01234567\");\n\n\twhile(!que.empty())\n\t{\n\t\tstring strbak=que.front();\n\t\tque.pop();\n\n\t\tint pos=strbak.find('0');\n\n\t\tfor(int i=0;i<4;i++)\n\t\t{\n\t\t\tint npos=pos+dx[i];\n\n\t\t\tif((npos<0 || npos>=8) || (pos==3 && npos==4) || (npos==3 && pos==4)) continue;\n\t\t\tstring strtmp=strbak;\n swap(strtmp[pos],strtmp[npos]);\n if(dp.find(strtmp)==dp.end())\n {\n\t\t\t\tdp[strtmp]=dp[strbak]+1;\n\t\t\t\tque.push(strtmp);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main()\n{\n\tBFS();\n\n\tstring str;\n\twhile(getline(cin,str))\n\t{\n\t\tstr.erase(remove(str.begin(),str.end(),' '),str.end());\n\t\tcout<<dp[str]<<endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4924,
"score_of_the_acc": -0.1201,
"final_rank": 4
},
{
"submission_id": "aoj_0121_10760587",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<queue>\n#include<map>\nusing namespace std;\nmap<int,int> bfs;\nint a[8];\nint main(){\n\tbfs[342391]=0;\n\tqueue<int>Q;\n\tQ.push(342391);\n\twhile(Q.size()){\n\t\tint at=Q.front();\n\t\tQ.pop();\n\t\tint zero;\n\t\tfor(int i=0;i<8;i++)if((at%(8<<(3*i))/(1<<(3*i)))==0)zero=i;\n\t\tif(zero%4){\n\t\t\tif(!bfs.count(at-(at%(8<<(3*(zero-1)))/(1<<(3*(zero-1))))*(1<<(3*(zero-1)))+(at%(8<<(3*(zero-1)))/(1<<(3*(zero-1))))*(1<<(3*zero)))){\n\t\t\t\tbfs[at-(at%(8<<(3*(zero-1)))/(1<<(3*(zero-1))))*(1<<(3*(zero-1)))+(at%(8<<(3*(zero-1)))/(1<<(3*(zero-1))))*(1<<(3*zero))]=bfs[at]+1;\n\t\t\t\tQ.push(at-(at%(8<<(3*(zero-1)))/(1<<(3*(zero-1))))*(1<<(3*(zero-1)))+(at%(8<<(3*(zero-1)))/(1<<(3*(zero-1))))*(1<<(3*zero)));\n\t\t\t}\n\t\t}\n\t\tif(zero%4!=3){\n\t\t\tif(!bfs.count(at-(at%(8<<(3*(zero+1)))/(1<<(3*(zero+1))))*(1<<(3*(zero+1)))+(at%(8<<(3*(zero+1)))/(1<<(3*(zero+1))))*(1<<(3*zero)))){\n\t\t\t\tbfs[at-(at%(8<<(3*(zero+1)))/(1<<(3*(zero+1))))*(1<<(3*(zero+1)))+(at%(8<<(3*(zero+1)))/(1<<(3*(zero+1))))*(1<<(3*zero))]=bfs[at]+1;\n\t\t\t\tQ.push(at-(at%(8<<(3*(zero+1)))/(1<<(3*(zero+1))))*(1<<(3*(zero+1)))+(at%(8<<(3*(zero+1)))/(1<<(3*(zero+1))))*(1<<(3*zero)));\n\t\t\t}\n\t\t}\n\t\tif(!bfs.count(at-(at%(8<<(3*(zero^4)))/(1<<(3*(zero^4))))*(1<<(3*(zero^4)))+(at%(8<<(3*(zero^4)))/(1<<(3*(zero^4))))*(1<<(3*zero)))){\n\t\t\tbfs[at-(at%(8<<(3*(zero^4)))/(1<<(3*(zero^4))))*(1<<(3*(zero^4)))+(at%(8<<(3*(zero^4)))/(1<<(3*(zero^4))))*(1<<(3*zero))]=bfs[at]+1;\n\t\t\tQ.push(at-(at%(8<<(3*(zero^4)))/(1<<(3*(zero^4))))*(1<<(3*(zero^4)))+(at%(8<<(3*(zero^4)))/(1<<(3*(zero^4))))*(1<<(3*zero)));\n\t\t}\n\t}\n\twhile(~scanf(\"%d\",a)){\n\t\tfor(int i=1;i<8;i++)scanf(\"%d\",a+i);\n\t\t//bfs.clear();\n\t\tint t=0;\n\t\tfor(int i=0;i<8;i++){\n\t\t\tt*=8;\n\t\t\tt+=a[i];\n\t\t}\n\t\tprintf(\"%d\\n\",bfs[t]);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3740,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0121_10696785",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <map>\n#include <queue>\n#include <string>\n\nusing namespace std;\n\nmap<string, int> mp;\nstring curstr, net;\nint prefix[4] = {-1, -4, 1, 4};\n\n\nvoid bfs() {\n string ori = \"01234567\";\n mp[ori] = 0;\n queue<string> que; que.push(ori);\n\n while(que.size()) {\n curstr = que.front();\n que.pop();\n\n int index_0 = curstr.find(\"0\");\n for (int i = 0; i < 4; i++) {\n if ((index_0 == 3 && i == 2) || (index_0 == 4 && i == 0)) {\n continue;\n }\n\n net = curstr;\n int target = index_0 + prefix[i];\n if (target >= 0 && target < net.size()) {\n net.replace(index_0, 1, net.substr(target, 1));\n net.replace(target, 1, \"0\");\n\n if (!mp.count(net)) {\n mp[net] = mp[curstr] + 1;\n que.push(net);\n }\n }\n }\n }\n}\n\nint main() {\n // ios::sync_with_stdio(false);\n // cin.tie(0);\n\n bfs();\n string result = \"\";\n string start;\n while (getline(cin, start)) {\n if (start == \"\") {\n break;\n }\n\n istringstream iss(start);\n string str;\n for (int i = 0; i < 8; i++) {\n iss >> str;\n result += str;\n }\n\n cout << mp[result] << '\\n';\n start = \"\";\n result = \"\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4944,
"score_of_the_acc": -0.1221,
"final_rank": 6
},
{
"submission_id": "aoj_0121_10349367",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n queue<ll> q;\n ll x;\n while (cin >> x)\n {\n q.push(x);\n }\n map<vector<vector<ll>>, ll> mp;\n map<vector<vector<ll>>, bool> v;\n queue<vector<vector<ll>>> bfs;\n vector<vector<ll>> ini = {{0, 1, 2, 3}, {4, 5, 6, 7}};\n bfs.push(ini);\n mp[ini] = 0;\n v[ini] = true;\n while (!bfs.empty())\n {\n vector<vector<ll>> now = bfs.front();\n bfs.pop();\n ll x = -1, y = -1;\n rep(i, 0, 2)\n {\n rep(j, 0, 4)\n {\n if (now[i][j] == 0)\n {\n x = i;\n y = j;\n }\n }\n }\n vector<ll> dx = {1, 0, -1, 0};\n vector<ll> dy = {0, -1, 0, 1};\n rep(i, 0, 4)\n {\n ll nx = x + dx[i];\n ll ny = y + dy[i];\n vector<vector<ll>> nxt = now;\n if (isin(nx, 0, 2) && isin(ny, 0, 4))\n {\n swap(nxt[x][y], nxt[nx][ny]);\n }\n if (!v[nxt])\n {\n v[nxt] = true;\n mp[nxt] = mp[now] + 1;\n bfs.push(nxt);\n }\n }\n }\n while (!q.empty())\n {\n vector<vector<ll>> ar(2, vector<ll>(4));\n rep(i, 0, 8)\n {\n ar[i / 4][i % 4] = q.front();\n q.pop();\n }\n cout << mp[ar] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 13184,
"score_of_the_acc": -0.9813,
"final_rank": 17
},
{
"submission_id": "aoj_0121_10039411",
"code_snippet": "#include <iostream>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\n#include<queue>\n#include<vector>\n#include<stack>\n#include<set>\n#include<map>\n#include<cstdio>\n#include<iomanip>\n#include<sstream>\nusing namespace std;\n#define ll long long\n\nconst int mod = 998244353;\nconst int N = 4e6 + 10;\nconst int M = 1e5 + 10;\nconst int inf = 0x3f3f3f3f;\n\nint t, l, r, ans = inf, ex, sy;\nll k, x, n, cnt;\nmap<string, int>m;\nint run[4] = { 1,-1,4,-4 };\n\nvoid bfs() {\n\tqueue<string>q;\n\tq.push(\"01234567\");\n\twhile (!q.empty()) {\n\t\tstring now = q.front();\n\t\tq.pop();\n\t\tint p = 0;\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tif (now[i] == '0')\n\t\t\t\tp = i;\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tint np = p + run[i];\n\t\t\tstring nxt=now;\n\t\t\tif (np >= 0 && np < 8 && !(p == 3 && np == 4) && !(p == 4 && np == 3))\n\t\t\t{\n\t\t\t\tswap(nxt[p], nxt[np]);\n\t\t\t\tif (m.find(nxt) == m.end()) {\n\t\t\t\t\tm[nxt] = m[now] + 1;\n\t\t\t\t\tq.push(nxt);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid solve() {\n\tstring s;\n\tm[\"01234567\"] = 0;\n\tbfs();\n\twhile (getline(cin,s)) {\n\t\ts.erase(remove(s.begin(), s.end(),' '), s.end());\n\t\tcout << m[s] << endl;\n\t}\n}\n\nint main() {\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\tcout.tie(0);\n\tt = 1;\n\t//cin >> t;\n\twhile (t--)\n\t\tsolve();\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4984,
"score_of_the_acc": -0.1262,
"final_rank": 7
},
{
"submission_id": "aoj_0121_9867702",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n// 目标状态\nconst string goal = \"01234567\";\n\n// 方向数组，表示0可以移动的四个方向（上、下、左、右）\nconst int dx[] = {-1, 1, 0, 0};\nconst int dy[] = {0, 0, -1, 1};\n\n// 将状态转换为字符串\nstring to_string(const vector<int>& state) {\n string s;\n for (int num : state) {\n s += to_string(num);\n }\n return s;\n}\n\n// 找到0的位置\npair<int, int> find_zero(const string& state) {\n for (int i = 0; i < 8; ++i) {\n if (state[i] == '0') {\n return {i / 4, i % 4};\n }\n }\n return {-1, -1}; // 不应该发生\n}\n\n// 检查位置是否在边界内\nbool in_bounds(int x, int y) {\n return x >= 0 && x < 2 && y >= 0 && y < 4;\n}\n\n// 双向BFS搜索\nint bidirectional_bfs(const string& start) {\n queue<string> q1, q2;\n unordered_map<string, int> dist1, dist2;\n\n q1.push(start);\n dist1[start] = 0;\n\n q2.push(goal);\n dist2[goal] = 0;\n\n while (!q1.empty() && !q2.empty()) {\n // 从初始状态扩展\n string current1 = q1.front();\n q1.pop();\n\n if (dist2.find(current1) != dist2.end()) {\n return dist1[current1] + dist2[current1];\n }\n\n auto [x1, y1] = find_zero(current1);\n int zero_index1 = x1 * 4 + y1;\n\n for (int d = 0; d < 4; ++d) {\n int nx1 = x1 + dx[d];\n int ny1 = y1 + dy[d];\n\n if (in_bounds(nx1, ny1)) {\n int new_index1 = nx1 * 4 + ny1;\n string next1 = current1;\n swap(next1[zero_index1], next1[new_index1]);\n\n if (dist1.find(next1) == dist1.end()) {\n dist1[next1] = dist1[current1] + 1;\n q1.push(next1);\n }\n }\n }\n\n // 从目标状态扩展\n string current2 = q2.front();\n q2.pop();\n\n if (dist1.find(current2) != dist1.end()) {\n return dist1[current2] + dist2[current2];\n }\n\n auto [x2, y2] = find_zero(current2);\n int zero_index2 = x2 * 4 + y2;\n\n for (int d = 0; d < 4; ++d) {\n int nx2 = x2 + dx[d];\n int ny2 = y2 + dy[d];\n\n if (in_bounds(nx2, ny2)) {\n int new_index2 = nx2 * 4 + ny2;\n string next2 = current2;\n swap(next2[zero_index2], next2[new_index2]);\n\n if (dist2.find(next2) == dist2.end()) {\n dist2[next2] = dist2[current2] + 1;\n q2.push(next2);\n }\n }\n }\n }\n\n return -1; // 不应该发生\n}\n\nint main() {\n int num;\n while (cin >> num) {\n vector<int> initial_state(8);\n initial_state[0] = num;\n for (int i = 1; i < 8; ++i) {\n cin >> initial_state[i];\n }\n\n string start = to_string(initial_state);\n int result = bidirectional_bfs(start);\n cout << result << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3836,
"score_of_the_acc": -0.2803,
"final_rank": 13
},
{
"submission_id": "aoj_0121_9867621",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <unordered_map>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\n\n// 目标状态\nconst string goal = \"01234567\";\n\n// 方向数组，表示0可以移动的四个方向（上、下、左、右）\nconst int dx[] = {-1, 1, 0, 0};\nconst int dy[] = {0, 0, -1, 1};\n\n// 将状态转换为字符串\nstring to_string(const vector<int>& state) {\n string s;\n for (int num : state) {\n s += to_string(num);\n }\n return s;\n}\n\n// 找到0的位置\npair<int, int> find_zero(const string& state) {\n for (int i = 0; i < 8; ++i) {\n if (state[i] == '0') {\n return {i / 4, i % 4};\n }\n }\n return {-1, -1}; // 不应该发生\n}\n\n// 检查位置是否在边界内\nbool in_bounds(int x, int y) {\n return x >= 0 && x < 2 && y >= 0 && y < 4;\n}\n\n// 双向BFS搜索\nint bidirectional_bfs(const string& start) {\n queue<string> q1, q2;\n unordered_map<string, int> dist1, dist2;\n\n q1.push(start);\n dist1[start] = 0;\n\n q2.push(goal);\n dist2[goal] = 0;\n\n while (!q1.empty() && !q2.empty()) {\n // 从初始状态扩展\n string current1 = q1.front();\n q1.pop();\n\n if (dist2.find(current1) != dist2.end()) {\n return dist1[current1] + dist2[current1];\n }\n\n auto [x1, y1] = find_zero(current1);\n int zero_index1 = x1 * 4 + y1;\n\n for (int d = 0; d < 4; ++d) {\n int nx1 = x1 + dx[d];\n int ny1 = y1 + dy[d];\n\n if (in_bounds(nx1, ny1)) {\n int new_index1 = nx1 * 4 + ny1;\n string next1 = current1;\n swap(next1[zero_index1], next1[new_index1]);\n\n if (dist1.find(next1) == dist1.end()) {\n dist1[next1] = dist1[current1] + 1;\n q1.push(next1);\n }\n }\n }\n\n // 从目标状态扩展\n string current2 = q2.front();\n q2.pop();\n\n if (dist1.find(current2) != dist1.end()) {\n return dist1[current2] + dist2[current2];\n }\n\n auto [x2, y2] = find_zero(current2);\n int zero_index2 = x2 * 4 + y2;\n\n for (int d = 0; d < 4; ++d) {\n int nx2 = x2 + dx[d];\n int ny2 = y2 + dy[d];\n\n if (in_bounds(nx2, ny2)) {\n int new_index2 = nx2 * 4 + ny2;\n string next2 = current2;\n swap(next2[zero_index2], next2[new_index2]);\n\n if (dist2.find(next2) == dist2.end()) {\n dist2[next2] = dist2[current2] + 1;\n q2.push(next2);\n }\n }\n }\n }\n\n return -1; // 不应该发生\n}\n\nint main() {\n int num;\n while (cin >> num) {\n vector<int> initial_state(8);\n initial_state[0] = num;\n for (int i = 1; i < 8; ++i) {\n cin >> initial_state[i];\n }\n\n string start = to_string(initial_state);\n int result = bidirectional_bfs(start);\n cout << result << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3844,
"score_of_the_acc": -0.2811,
"final_rank": 14
},
{
"submission_id": "aoj_0121_9816824",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <cstdio>\n#include <algorithm>\n#include <cstring>\n#include <cmath>\nusing namespace std;\n\nint visited[8][8][8][8][8][8][8];\n\nint direction[] = {-1, 1, 4, -4};\n\nstruct PuzzleState {\n int tiles[8];\n int moves;\n PuzzleState(int* initialTiles, int moveCount) {\n for (int i = 0; i < 8; i++)\n tiles[i] = initialTiles[i];\n moves = moveCount;\n }\n};\n\nbool hasVisited(int* currentTiles) {\n return visited[currentTiles[0]][currentTiles[1]][currentTiles[2]][currentTiles[3]][currentTiles[4]][currentTiles[5]][currentTiles[6]] == 1;\n}\n\nvoid markVisited(int* currentTiles) {\n visited[currentTiles[0]][currentTiles[1]][currentTiles[2]][currentTiles[3]][currentTiles[4]][currentTiles[5]][currentTiles[6]] = 1;\n}\n\nbool isGoalState(int* currentTiles) {\n for (int i = 0; i < 7; i++)\n if (currentTiles[i] != i)\n return false;\n return true;\n}\n\nint bfs(int* initialTiles) {\n queue<PuzzleState> queue;\n queue.push(PuzzleState(initialTiles, 0));\n markVisited(initialTiles);\n \n while (!queue.empty()) {\n PuzzleState currentState = queue.front();\n queue.pop();\n int tempTiles[8]; // Temporary array to store current state\n int zeroPosition = 0; // Record the position of the zero tile\n\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 8; j++)\n tempTiles[j] = currentState.tiles[j];\n for (int j = 0; j < 8; j++)\n if (tempTiles[j] == 0) zeroPosition = j;\n\n int newPosition = zeroPosition + direction[i];\n if (newPosition < 0 || newPosition > 7) continue;\n if (zeroPosition == 3 && newPosition == 4) continue;\n if (zeroPosition == 4 && newPosition == 3) continue;\n\n swap(tempTiles[newPosition], tempTiles[zeroPosition]);\n if (isGoalState(tempTiles)) return currentState.moves + 1; // Found the goal state\n if (hasVisited(tempTiles)) continue; // If this state has been visited\n\n queue.push(PuzzleState(tempTiles, currentState.moves + 1)); // Add new state to queue\n markVisited(tempTiles); // Mark this state as visited\n }\n }\n return -1; // Should not reach here if the input is valid\n}\n\nint main() {\n int tiles[8];\n while (scanf(\"%d\", &tiles[0]) != EOF) {\n memset(visited, 0, sizeof(visited));\n for (int i = 1; i < 8; i++)\n scanf(\"%d\", &tiles[i]);\n\n if (isGoalState(tiles)) cout << 0 << endl;\n else cout << bfs(tiles) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 860,
"memory_kb": 11432,
"score_of_the_acc": -1.7801,
"final_rank": 20
},
{
"submission_id": "aoj_0121_9816800",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <cstdio>\n#include <algorithm>\n#include <cstring>\n#include <cmath>\nusing namespace std;\n \nint vis[8][8][8][8][8][8][8];\n \nint d[]={-1,1,4,-4};\n \nstruct node\n{\n int a[8];\n int time;\n node(int * b,int ti)//深拷贝\n {\n for(int i=0;i<8;i++)\n a[i]=b[i];\n time=ti;\n }\n};\n \nbool judge(int * a1)//判断是否访问过这种状态\n{\n if(vis[a1[0]][a1[1]][a1[2]][a1[3]][a1[4]][a1[5]][a1[6]]==1)\n return true;\n return false;\n}\n \nvoid update(int * a1)\n{\n vis[a1[0]][a1[1]][a1[2]][a1[3]][a1[4]][a1[5]][a1[6]]=1;\n}\n \nbool is_ans(int * b)\n{\n for(int i=0;i<7;i++)\n if(b[i]!=i)\n return false;\n return true;\n}\n \nint bfs(int * a1)\n{\n queue<node> que;\n que.push(node(a1,0));\n vis[a1[0]][a1[1]][a1[2]][a1[3]][a1[4]][a1[5]][a1[6]]=1;\n while(!que.empty())\n {\n node no=que.front();\n que.pop();\n int b[8];//临时数组用来保存no的数据\n int p=0;//记录0的位置\n \n \n for(int i=0;i<4;i++)\n {\n for(int i=0;i<8;i++)\n b[i]=no.a[i];\n for(int i=0;i<8;i++)\n if(b[i]==0)p=i;\n int x=p+d[i];\n if(x<0||x>7)continue ;\n if(p==3&&x==4)continue;\n if(p==4&&x==3)continue;\n swap(b[x],b[p]);\n if(is_ans(b))return no.time+1;//找到最终状态\n if(judge(b))continue;//如果这种状态处理过了\n que.push(node(b,no.time+1));//放入队列\n update(b);//更新vis数组\n }\n \n \n }\n}\n \nint main()\n{\n int a[8];\n while(scanf(\"%d\",&a[0])!=EOF)\n {\n memset(vis,0,sizeof(vis));\n for(int i=1;i<8;i++)\n scanf(\"%d\",&a[i]);\n if(is_ans(a))cout<<0<<endl;\n else\n cout<<bfs(a)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 860,
"memory_kb": 11396,
"score_of_the_acc": -1.7765,
"final_rank": 19
},
{
"submission_id": "aoj_0121_9636195",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <map>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nvector<int> a;\n\nint moves[4] = {-1, 1, -4, 4};\n\nmap<vector<int>, int> dist;\n\nvoid pre_calc()\n{\n queue<vector<int>> q;\n q.push({0, 1, 2, 3, 4, 5, 6, 7});\n dist[{0, 1, 2, 3, 4, 5, 6, 7}] = 0;\n while (!q.empty())\n {\n auto v = q.front();\n q.pop();\n int pos = find(v.begin(), v.end(), 0) - v.begin();\n for (int i = 0; i < 4; i++)\n {\n int next = pos + moves[i];\n if (next < 0 || next >= 8 || (pos == 3 && next == 4) || (pos == 4 && next == 3))\n continue;\n vector<int> u = v;\n swap(u[pos], u[next]);\n if (dist.find(u) == dist.end())\n {\n dist[u] = dist[v] + 1;\n q.push(u);\n }\n }\n }\n}\n\nvoid solve()\n{\n\n cout << dist[a] << endl;\n}\n\nint main()\n{\n a = vector<int>(8);\n pre_calc();\n while (cin >> a[0])\n {\n for (int i = 1; i < 8; i++)\n cin >> a[i];\n solve();\n a = vector<int>(8);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5868,
"score_of_the_acc": -0.2276,
"final_rank": 12
},
{
"submission_id": "aoj_0121_9553917",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n#include <unordered_set>\n#include <functional>\nusing namespace std;\n//using namespace atcoder;\nusing ll = long long;\nusing P = pair<int, int>;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n//void chmin(ll & a, ll b) { a = min(a, b); }\n//using mint = modint998244353;\n\nint main() {\n vector<int> ori(8);\n map<vector<int>, int> mp;\n rep(i, 8) ori[i] = i;\n vector<int> oric = ori;\n do {\n mp[ori] = -1;\n } while (next_permutation(ori.begin(), ori.end()));\n\n mp[oric] = 0;\n queue<vector<int>> q;\n queue<int> pos;\n int p = 0;\n q.push(oric);\n while (!q.empty()) {\n auto cur = q.front();\n q.pop();\n vector<int> nex = cur;\n rep(i, cur.size()) {\n if (cur[i] == 0) {\n if (i % 4 != 0) { // 左へ\n swap(nex[i], nex[i - 1]);\n if (mp[nex] == -1) {\n q.push(nex);\n mp[nex] = mp[cur] + 1;\n }\n swap(nex[i], nex[i - 1]);\n }\n if (i % 4 != 3) { // 右へ\n swap(nex[i], nex[i + 1]);\n if (mp[nex] == -1) {\n q.push(nex);\n mp[nex] = mp[cur] + 1;\n }\n swap(nex[i], nex[i + 1]);\n }\n if (i >= 4) { // 上へ\n swap(nex[i], nex[i - 4]);\n if (mp[nex] == -1) {\n q.push(nex);\n mp[nex] = mp[cur] + 1;\n }\n swap(nex[i], nex[i - 4]);\n }\n if (i < 4) { // 下へ\n swap(nex[i], nex[i + 4]);\n if (mp[nex] == -1) {\n q.push(nex);\n mp[nex] = mp[cur] + 1;\n }\n swap(nex[i], nex[i + 4]);\n }\n }\n }\n }\n vector<int> a(8);\n while (cin >> a[0]) { // 8つの数字を順に読み込む\n for (int i = 1; i < 8; i++) {\n cin >> a[i];\n }\n cout << mp[a] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 8548,
"score_of_the_acc": -0.5112,
"final_rank": 16
},
{
"submission_id": "aoj_0121_9298033",
"code_snippet": "#include<iostream>\n#include<string>\n#include<queue>\n#include<map>\n\nusing namespace std;\nmap<string, int> mp;\nint bh[4] = {-1,1,4,-4};\n\n\nvoid bfs()\n{\n string s = \"01234567\";\n queue<string> q;\n mp[s] = 1;\n q.push(s);\n while(!q.empty())\n {\n s = q.front();\n q.pop();\n int i;\n for(i=0;i<8;i++)\n {\n if(s[i]=='0') break;\n }\n for(int j=0;j<4;j++)\n {\n int t = i+bh[j];\n if((t>=0)&&(t<8)&&!((i==3)&&(j==1))&&!((i==4)&&(j==0)))\n {\n string s2 = s;\n s2[t] = s[i];\n s2[i] = s[t];\n if(!mp[s2])\n {\n mp[s2] = mp[s] + 1;\n q.push(s2);\n }\n }\n }\n }\n}\n\nusing namespace std;\n\n\nint main()\n{\n int A[8];\n bfs();\n while(cin >> A[0] >> A[1] >> A[2] >> A[3] >> A[4] >> A[5] >> A[6] >> A[7])\n {\n string s = \"\";\n s += A[0]+'0';s += A[1]+'0';s += A[2]+'0';s += A[3]+'0';s += A[4]+'0';s += A[5]+'0';s += A[6]+'0';s += A[7]+'0';\n cout << mp[s]-1 << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5440,
"score_of_the_acc": -0.1842,
"final_rank": 10
},
{
"submission_id": "aoj_0121_9238114",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<queue>\n#include<map>\n#include<string>\nusing namespace std;\nint d[4]={-1,1,-4,4};\nmap <string,int> mp;\nstring s;\nvoid bfs()\n{\n\tqueue <string> q;\n\tq.push(\"01234567\");\n\tmp[\"01234567\"]=0;\n\twhile(!q.empty())\n\t{\n\t\tstring now=q.front();\n\t\tq.pop();\n\t\tint pos=now.find('0');\n\t\tfor(int i=0;i<4;++i)\n\t\t{\n\t\t\tint dpos=pos+d[i];\n\t\t\tif(0<=dpos&&dpos<=7&&(!(pos==4&&i==0))&&(!(pos==3&&i==1)))\n\t\t\t{\n\t\t\t\tstring net=now;\n\t\t\t\tswap(net[pos],net[dpos]);\n\t\t\t\tif(mp.find(net)==mp.end())\n\t\t\t\t{\n\t\t\t\t\tq.push(net);\n\t\t\t\t\tmp[net]=mp[now]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nvoid solve()\n{\n\tprintf(\"%d\\n\",mp[s]);\n}\nint main()\n{ \n ios::sync_with_stdio(false);\n\tbfs();\n\twhile(getline(cin,s))\n\t{\n\t\ts.erase(remove(s.begin(),s.end(),' '),s.end());\n\t\tsolve();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4928,
"score_of_the_acc": -0.1205,
"final_rank": 5
},
{
"submission_id": "aoj_0121_9238104",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<queue>\n#include<map>\n#include<string>\nusing namespace std; \nint d[4]={-1,1,-4,4};\nmap <string,int> mp;\nstring s;\nvoid bfs()\n{\n\tqueue <string> q;\n\tq.push(\"01234567\"); \n\tmp[\"01234567\"]=0;\n\twhile(!q.empty())\n\t{\n\t\tstring now=q.front();\n\t\tq.pop();\n\t\tint pos=now.find('0');\n\t\tfor(int i=0;i<4;i++)\n\t\t{\n\t\t\tint dpos=pos+d[i];\n\t\t\tif(dpos>=0&&dpos<=7&&(!(pos==4&&i==0))&&(!(pos==3&&i==1)))\n\t\t\t{\n\t\t\t\tstring net=now;\n\t\t\t\tswap(net[pos],net[dpos]);\n\t\t\t\tif(mp.find(net)==mp.end())\n\t\t\t\t{\n\t\t\t\t\tmp[net]=mp[now]+1;\n\t\t\t\t\tq.push(net);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nvoid solve()\n{\n\tprintf(\"%d\\n\",mp[s]);\n}\nint main()\n{\n\tios::sync_with_stdio(false);\n\tbfs();\n\twhile(getline(cin,s))\t\n\t{\n\t\ts.erase(remove(s.begin(),s.end(),' '),s.end());\n\t\tsolve();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5092,
"score_of_the_acc": -0.1371,
"final_rank": 9
},
{
"submission_id": "aoj_0121_9163838",
"code_snippet": "#include <iostream>\n#include <map>\n#include <queue>\n#include <cmath>\nusing namespace std;\n\nint a[8];\nmap<int, int> table;\nqueue<int> que;\n\nint main() {\n table[1234567] = 0;\n que.push(1234567);\n while (!que.empty()) {\n int n = que.front(); que.pop();\n int a[4][2];\n int tmp = n;\n int idx, idy;\n for (int i = 0; i < 8; i++) {\n int x = i % 4, y = i / 4;\n a[x][y] = tmp % 10;\n tmp /= 10;\n if (a[x][y] == 0)\n idx = x, idy = y;\n }\n int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};\n for (int i = 0; i < 4; i++) {\n int ndx = idx + dx[i], ndy = idy + dy[i];\n if (ndx >= 0 && ndx < 4 && ndy >= 0 && ndy < 2) {\n swap(a[idx][idy], a[ndx][ndy]);\n int m = 0;\n for (int x = 0; x < 4; x++) {\n for (int y = 0; y < 2; y++) {\n m += a[x][y] * int(pow(10, x + 4 * y));\n }\n }\n if (table.count(m) == 0) {\n table[m] = table.at(n) + 1;\n que.push(m);\n }\n swap(a[idx][idy], a[ndx][ndy]);\n }\n }\n }\n int b[8];\n while (cin >> b[0]) {\n for (int i = 1; i < 8; i++) {\n cin >> b[i];\n }\n int n = 0;\n for (int i = 0; i < 8; i++) {\n n += b[7 - i] * int(pow(10, i));\n }\n cout << table.at(n) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4228,
"score_of_the_acc": -0.0613,
"final_rank": 2
},
{
"submission_id": "aoj_0121_9143960",
"code_snippet": "#include <iostream>\n#include <cstring>\n#include <algorithm>\n#include <queue>\n#include <map>\nusing namespace std;\n#define INF 1e8\nmap<string, int> res;\nconst int dx[4] = {4, -4, 1, -1};\nbool valid(int x)\n{\n return x >= 0 && x < 8;\n}\n\nvoid bfs()\n{\n res[\"01234567\"] = 0;\n queue<string> q;\n q.push(\"01234567\");\n while (!q.empty())\n {\n string s = q.front();\n q.pop();\n int x = s.find('0',0);\n\n for (int i = 0; i < 4; i++)\n {\n int tx = x + dx[i];\n string t = s;\n if (valid(tx) && !(x == 3 && tx == 4) && !(x == 4 && tx == 3))\n {\n swap(t[x], t[tx]);\n if (res.find(t) == res.end())\n {\n res[t] = res[s] + 1;\n q.push(t);\n }\n }\n }\n }\n}\nvoid solve()\n{\n bfs();\n\n string s;\n while (getline(cin, s))\n {\n s.erase(remove(s.begin(), s.end(), ' '), s.end());\n cout << res[s] << \"\\n\";\n }\n}\nint main()\n{\n ios::sync_with_stdio(false);\n std::cin.tie(0);\n std::cout.tie(0);\n\n int T = 1;\n // cin >> T;\n while (T--)\n {\n solve();\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4752,
"score_of_the_acc": -0.1026,
"final_rank": 3
},
{
"submission_id": "aoj_0121_9007090",
"code_snippet": "#include<string>\n#include<map>\n#include<bits/stdc++.h>\n#include<queue>\n#include<iostream>\nusing namespace std;\nstring s={\"01234567\"};\nint ch[4]={1,-1,4,-4};\nmap<string,int>mp;\nvoid bfs(){\n queue<string> q;\n q.push(s);\n while(!q.empty()){\n string p=q.front();\n q.pop();\n int pos=p.find(\"0\");\n for(int i=0;i<4;i++){\n int tpos=pos+ch[i];\n if(tpos>=0&&tpos<=7&&!(pos==3&&i==0)&&!(pos==4&&i==1)){\n string c=p;\n swap(c[pos],c[tpos]);\n if(mp[c]==0&&c!=\"01234567\"){\n mp[c]=mp[p]+1;\n q.push(c);\n }\n }\n }\n }\n}\nint main(){\n\tbfs();\n\twhile(getline(cin,s)){\n\t\ts.erase(remove(s.begin(),s.end(),' '),s.end());\n\t\tprintf(\"%d\\n\",mp[s]);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5088,
"score_of_the_acc": -0.1367,
"final_rank": 8
},
{
"submission_id": "aoj_0121_8991602",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int p, d, c {};\n vector<int> v {0, 1, 2, 3, 4, 5, 6, 7};\n map<vector<int>, int> mp;\n mp[v] = 0;\n queue<vector<int>> q;\n q.push(v);\n while (!q.empty()) {\n vector<int> a {q.front()};\n d = mp[a];\n q.pop();\n for (int i = 0; i < 8; ++i) {\n if(a[i] == 0) p = i;\n }\n if (p < 4) {\n swap(a[p], a[p+4]);\n if (!mp.count(a)) {\n mp[a] = d + 1;\n q.push(a);\n }\n swap(a[p], a[p+4]);\n }\n else {\n swap(a[p], a[p-4]);\n if (!mp.count(a)) {\n mp[a] = d + 1;\n q.push(a);\n }\n swap(a[p], a[p-4]);\n }\n if (p % 4) {\n swap(a[p], a[p-1]);\n if (!mp.count(a)) {\n mp[a] = d + 1;\n q.push(a);\n }\n swap(a[p], a[p-1]);\n }\n if (p % 4 != 3) {\n swap(a[p], a[p+1]);\n if (!mp.count(a)) {\n mp[a] = d + 1;\n q.push(a);\n }\n }\n }\n vector<int> u(8);\n while (cin >> u[0]) {\n for (int i = 1; i < 8; ++i) {\n cin >> u[i];\n }\n cout << mp[u] << '\\n';\n }\n // for (auto& [a, b]: mp) {\n // cout << b << '\\n';\n // for (int i = 0; i < 8; ++i) cout << a[i] << ' ';\n // cout << '\\n';\n // }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5740,
"score_of_the_acc": -0.2028,
"final_rank": 11
},
{
"submission_id": "aoj_0121_8903773",
"code_snippet": "#include <algorithm>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <queue>\n#include <map>\nusing namespace std;\ntypedef pair<vector<vector<int>>, pair<int, int>> P;\nint dx[] = {-1, 1, 0, 0};\nint dy[] = {0, 0, -1, 1};\n\nmap<vector<vector<int>>, int> costs;\nvoid bfs(P start){\n costs[start.first] = 0;\n queue<P> que;\n que.push(start);\n\n while(que.size() > 0){\n P now = que.front();\n que.pop();\n for(int i = 0; i < 4; i++){\n if(0 <= now.second.first + dx[i] && now.second.first + dx[i] < 2 && 0 <= now.second.second + dy[i] && now.second.second + dy[i] < 4){\n P sample = now;\n swap(sample.first[now.second.first + dx[i]][now.second.second + dy[i]], sample.first[now.second.first][now.second.second]);\n if(!costs.count(sample.first)){\n costs[sample.first] = costs[now.first] + 1;\n sample.second.first += dx[i];\n sample.second.second += dy[i];\n que.push(sample);\n } \n }\n }\n }\n}\n\nint main(){\n vector<vector<int>> ans{{0, 1, 2, 3}, {4, 5, 6, 7}};\n P start;\n start.first = ans;\n start.second.first = 0;\n start.second.second = 0;\n bfs(start);\n vector<vector<int>> vec(2, vector<int>(4));\n while(cin >> vec[0][0] >> vec[0][1] >> vec[0][2] >> vec[0][3] >> vec[1][0] >> vec[1][1] >> vec[1][2] >> vec[1][3]){\n //print the answer\n cout << costs[vec] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 7556,
"score_of_the_acc": -0.4105,
"final_rank": 15
}
] |
aoj_0139_cpp
|
ヘビ
ある世界には，文字だけでできた不思議なヘビが住んでいます。このヘビには現在A種とB種の2種類が確認されていますが、それ以外の種類がいる可能性もあります。
A種は，">'"の後に"="が1個以上並んだ後、"#"が来て、さらに前と同じ個数の"="が来た後、"~"（半角チルダ）で終わります。
B種は，">^"の後に "Q="が1個以上並んだ後、"~~"で終わります。
A種の例： >'====#====~ >'==#==~
B種の例： >^Q=Q=Q=Q=~~ >^Q=Q=~~
ヘビを文字列データとして受け取り、それがどんな種類であるかを判別して、A種の場合は「A」、B種の場合は「B」、それ以外の種類の場合は「NA」を出力するプログラムを作成してください。
Input
入力は以下の形式で与えられます。
n
S
1
S
2
:
S
n
1 行目に判別されるヘビの数
n
（1 ≤
n
≤ 10000）、続く
n
行に
i
匹目のヘビを表す文字列
S
i
(200文字以下の、空白を含まない文字列) がそれぞれ１行に与えられます。
Output
i
行目に
i
匹目のヘビの種類 A、B または NA を出力してください。
Sample Input
3
>'======#======~
>^Q=Q=Q=Q=Q=Q=Q=Q=Q=~~
>'===#====~
Output for the Sample Input
A
B
NA
|
[
{
"submission_id": "aoj_0139_5057526",
"code_snippet": "#include<iostream>\n#include<string>\n#include<regex>\nusing namespace std;\nint main(){\nstring A = \">'(=+)#\\\\1~$\";\nstring B = \">\\\\^(Q=)+~~$\";\nint n; cin >> n;\nfor ( int i = 0; i < n; i++ ) {\nstring snake; cin >> snake;\nif( regex_search(snake, regex(A)) )\ncout << \"A\" << endl;\nelse if( regex_search(snake, regex(B)) )\ncout << \"B\" << endl;\nelse\ncout << \"NA\" << endl;\n}\nreturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3328,
"score_of_the_acc": -0.9555,
"final_rank": 18
},
{
"submission_id": "aoj_0139_2066625",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\n\n#define rep(i, n)for((i) = 0;(i) < (n);++(i))\n\nstring solve(string s){\n\tint i = 0, j;\n\tstring tmp;\n\trep(i, 100){\n\t\ttmp += \"=\";\n\t\tif(s == \">'\" + tmp + \"#\" + tmp + \"~\")return \"A\";\n\t}\n\ttmp.clear();\n\trep(i, 100){\n\t\ttmp += \"Q=\";\n\t\tif(s == \">^\" + tmp + \"~~\")return \"B\";\n\t}\n\treturn \"NA\";\n}\n\nint main(void){\n\tint i, j, n;\n\tstring s;\n\tscanf(\"%d\", &n);\n\tfor(;n--;){\n\t\tcin >> s;\n\t\tcout << solve(s) << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3240,
"score_of_the_acc": -1.9164,
"final_rank": 19
},
{
"submission_id": "aoj_0139_2015125",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<algorithm>\n#include<array>\n#include<bitset>\n#include<cassert>\n#include<cctype>\n#include<cmath>\n#include<cstdio>\n#include<cstring>\n#include<functional>\n#include<limits>\n#include<list>\n#include<map>\n#include<numeric>\n#include<set>\n#include<stack>\n#include<string>\n#include<sstream>\n#include<unordered_map>\n#include<queue>\n#include<regex>\n#include<vector>\nusing namespace std;\n\n//#define int long long\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int, int>;\n\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define all(a) (a).begin(),(a).end()\n#define dump(o) {cerr<<#o<<\" \"<<o<<endl;}\n#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<\" \"<<e;cerr<<endl;}\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\nconst int MOD = 1e9 + 7;\n\nsigned main() {\n\tint n; cin >> n;\n\tregex b(R\"(>\\^(Q=)+~~)\");\n\trep(i, 0, n) {\n\t\tstring s; cin >> s;\n\t\tint m = 0;\n\t\trep(j, 0, s.size())if (s[j] == '=')m++;\n\t\tregex a(\">'={\" + to_string(m / 2) + \"}#={\" + to_string(m / 2) + \"}~\");\n\t\tif (regex_match(s, a) && m) { cout << \"A\" << endl; }\n\t\telse if (regex_match(s, b)) { cout << \"B\" << endl; }\n\t\telse cout << \"NA\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3428,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0139_1970619",
"code_snippet": "#include<iostream>\n#include<string>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\nusing namespace std;\n\nbool asnake(string s){\n\tint n=s.size();\n\tif(n%2 || n<6)return false;\n\tstring com=\">\\'\";\n\trep(i,(n-4)/2)com+='=';\n\tcom+='#';\n\trep(i,(n-4)/2)com+='=';\n\tcom+='~';\n\tif(s==com)return true;\n\telse return false;\n}\n\nbool bsnake(string s){\n\tint n=s.size();\n\tif(n%2 || n<6)return false;\n\tstring com=\">^\";\n\trep(i,(n-4)/2)com+=\"Q=\";\n\tcom+=\"~~\";\n\tif(s==com)return true;\n\telse return false;\n}\n\nint main(){\n\tint n;\n\tcin>>n;\n\trep(p,n){\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(asnake(s))cout<<\"A\"<<endl;\n\t\telse if(bsnake(s))cout<<\"B\"<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -0.016,
"final_rank": 12
},
{
"submission_id": "aoj_0139_1830610",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n int n;\n string s;\n cin>>n;\n for(int u=0;u<n;u++){\n cin>>s;\n bool a=true,b=true;\n if(s[0]!='>'||s.size()%2!=0||s.size()<6)a=false,b=false;\n if(s[1]!='\\''||s[s.size()-1]!='~')a=false;\n if(s[1]!='^'||s[s.size()-1]!='~'||s[s.size()-2]!='~')b=false;\n if(a){\n if(s[s.size()/2]!='#')a=false;\n int count=0;\n for(int i=2;i<s.size()-1;i++)if(s[i]!='=')count++;\n if(count!=1)a=false;\n if(a)cout<<\"A\"<<endl;\n }\n if(b){\n for(int i=2;i<s.size()-2;i++){\n if(i%2==0&&s[i]!='Q')b=false;\n if(i%2==1&&s[i]!='=')b=false;\n }\n if(b)cout<<\"B\"<<endl;\n }\n if(!a&&!b)cout<<\"NA\"<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.0089,
"final_rank": 3
},
{
"submission_id": "aoj_0139_1709891",
"code_snippet": "#include<cstdio>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\n int N;\n cin>>N;\n for(int i=0;i<N;i++){\n string sn;\n cin>>sn;\n int type=0;\n if(sn[0]=='>'&&sn[1]==39)type=1;\n if(sn[0]=='>'&&sn[1]=='^')type=2;\n int flg=1;\n if(type==1){\n int cou=0;\n int aftercou=0;\n int p;\n for(int j=2;j<sn.size();j++){\n if(sn[j]=='=')cou++;\n else if(sn[j]=='#'){\n p=j;\n break;\n }\n else{\n flg=0;\n goto syutu;\n }\n }\n for(int k=p+1;k<sn.size();k++){\n if(sn[k]=='=')aftercou++;\n else if(sn[k]=='~'&&k==sn.size()-1){\n if(cou!=aftercou)flg=0;\n goto syutu;\n }\n else{\n flg=0;\n goto syutu;\n }\n }\n if(sn[sn.size()-1]!='~')flg=0;\nsyutu:\n if(flg&&cou)puts(\"A\");\n else puts(\"NA\");\n }\n else if(type==2){\n for(int j=2;j<sn.size()-1;j+=2){\n if(sn[j]=='~'&&sn[j+1]=='~'&&j!=2)break;\n if(!(sn[j]=='Q'&&sn[j+1]=='='))flg=0;\n }\n if(sn[sn.size()-2]!='~'||sn[sn.size()-1]!='~')flg=0;\n if(flg)puts(\"B\");\n else puts(\"NA\");\n }\n else puts(\"NA\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1180,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0139_1620518",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\n\twhile(n--)\n\t{\n\t\tstring str;\n\t\tstring kp;\n\t\tstring set;\n\t\tint flag=0;\n\t\tint count=0;\n\t\tint count_b=0;\n\t\tint i=0;\n\n\t\tcin >> str;\n\t\tfor(i=0;i<2;i++)kp+=str[i]++;\n\t\t\n\t\tif(kp==\">'\")\n\t\t{\n\t\t\twhile(str[i]!='#')\n\t\t\t{\n\t\t\t\tif(str[i]=='=')count++;\n\t\t\t\telse flag=-1;\n\n\t\t\t\tif(flag==-1)break;\n\t\t\t\ti++;\t\n\t\t\t}\n\t\t\ti++;\n\t\t\twhile(str[i]!='~')\n\t\t\t{\n\t\t\t\tif(str[i]=='=')count_b++;\n\t\t\t\telse flag=-1;\n\n\t\t\t\tif(flag==-1)break;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tif(flag!=-1 && count==count_b && count>=1)flag=1;\n\n\t\t\tcount=0;\n\t\t\tfor(int j=i;j<str.length();j++)\n\t\t\t{\n\t\t\t\tif(str[i]!='~')flag=-1;\n\t\t\t\telse count++;\n\n\t\t\t\tif(flag==-1)break;\n\t\t\t}\n\t\t\tif(count!=1)flag=-1;\n\t\t}\n\t\telse if(kp==\">^\")\n\t\t{\n\t\t\twhile(i<str.length()-2)\n\t\t\t{\n\t\t\t\tcount=2;\n\t\t\t\twhile(count--)\n\t\t\t\t{\n\t\t\t\t\tset+=str[i];\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\tif(set==\"Q=\")flag=2;\n\t\t\t\telse flag=-1;\n\n\t\t\t\tset.erase(set.begin(),set.end());\n\t\t\t\tif(flag==-1)break;\n\t\t\t}\n\t\t\tfor(i=str.length()-2;i<str.length();i++)set+=str[i];\n\t\t\tif(set==\"~~\" && flag==2)flag=2;\n\t\t\telse flag=-1;\n\t\t}\n\n\t\tif(flag==1) cout << \"A\" << endl;\n\t\telse if(flag==2)cout << \"B\" << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1212,
"score_of_the_acc": -0.0142,
"final_rank": 11
},
{
"submission_id": "aoj_0139_1583565",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <string>\n#include <algorithm>\n#define int long long\n#define rep(i, n) for (int i=0; i<n; i++)\n#define REP(n) rep(i, n)\nusing namespace std;\n\nint n;\nstring snake, head, tail, body;\n\nsigned main()\n{\n cin >> n;\n\n REP(n)\n { \n cin >> snake;\n\n if (snake.length() < 6)\n { \n cout << \"NA\" << endl;\n continue;\n } \n\n head = snake.substr(0, 2); \n if (head == \">'\")\n { \n tail = snake.substr(snake.length() - 1, 1); \n if (tail != \"~\")\n { \n cout << \"NA\" << endl;\n continue;\n } \n body = string((snake.length() - 4) / 2, '=') + \"#\" + string((snake.length() - 4) / 2, '=');\n if (snake.substr(2, snake.length() - 3) == body)\n { \n cout << \"A\" << endl;\n continue;\n } else {\n cout << \"NA\" << endl;\n continue;\n } \n } else if (head == \">^\") {\n tail = snake.substr(snake.length() - 2, 2); \n if (tail != \"~~\")\n { \n cout << \"NA\" << endl;\n continue;\n } \n body = \"\"; \n int cnt = (snake.length() - 4) / 2;\n while (cnt--) body += \"Q=\";\n if (snake.substr(2, snake.length() - 4) == body)\n {\n cout << \"B\" << endl;\n continue;\n } else {\n cout << \"NA\" << endl;\n continue;\n }\n } else {\n cout << \"NA\" << endl;\n continue;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1224,
"score_of_the_acc": -0.5196,
"final_rank": 17
},
{
"submission_id": "aoj_0139_1436289",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nbool isOutOfStr(int ind, string str){\n return ind >= str.length();\n}\n\nint main(void){\n int n;\n cin >> n;\n while(n--){\n string str; cin >> str;\n if(!isOutOfStr(1, str) &&str[0] == '>' && str[1] == '\\''){\n int sharp_cnt = 0;\n int ind;\n ind = 2;\n\n if(isOutOfStr(ind, str) || str[ind] != '='){\n cout << \"NA\" << endl;\n continue;\n }\n\n for(;;ind++){\n if(isOutOfStr(ind, str) || str[ind] != '='){\n break;\n }\n sharp_cnt++;\n }\n\n if(isOutOfStr(ind, str) || str[ind] != '#'){\n cout << \"NA\" << endl;\n continue;\n }\n ind++;\n\n bool flg = true;\n for(int i=0; i < sharp_cnt; i++, ind++){\n if(isOutOfStr(ind, str) || str[ind] != '='){\n cout << \"NA\" << endl;\n flg = false;\n break;\n }\n }\n if(!flg) continue;\n\n if(!isOutOfStr(ind, str) && str[ind] == '~' && ind == str.length() - 1)\n cout << \"A\" << endl;\n else{\n cout << \"NA\" << endl;\n }\n\n\n\n }else if(str[0] == '>' && str[1] == '^'){\n int ind;\n ind=2;\n\n if(isOutOfStr(ind, str) || !(str[ind] == 'Q' && str[ind+1] == '=')){\n cout << \"NA\" << endl;\n }else{\n int flg = true;\n for(;;ind+=2){\n if(isOutOfStr(ind, str) || !(str[ind] == 'Q' && str[ind+1] == '=')){\n break;\n }\n }\n\n if(!isOutOfStr(ind, str) && !isOutOfStr(ind+1, str) && str[ind] == '~' && str[ind+1] == '~' && ind+1 == str.length() - 1){\n cout << \"B\" << endl;\n }else{\n cout << \"NA\" << endl;\n }\n }\n }else{\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_0139_1433502",
"code_snippet": "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n\n for(int q=0;q<n;q++) {\n string str;\n cin >> str;\n if(str[0] != '>') {\n cout <<\"NA\"<<endl; \n continue;\n } else if(str[1] != '\\''&& str[1] != '^') {\n cout << \"NA\" << endl;\n continue;\n }\n int flg = 0,sum;\n if(str[1] == '\\'') {\n int t = 0;\n sum=0;\n for(int i=2;i<str.size();i++) {\n\tif(str[i] == '=') t++;\n\telse if(str[i] == '#' && sum==0 && i!=2) sum = t , t = 0;\n\telse break;\n\tif(str[str.size()-1] == '~' && i == str.size() -2 && sum==t ) flg = 1;\n\t\n }\n }\n\n if(str[1] == '^' && flg == 0) {\n\tflg = 0;\n\tfor(int i=2;i<str.size() ;i++) {\n\t if(i%2 == 0 && str[i] != 'Q') break;\n\t if(i%2 == 1 && str[i] !='=') break;\n\n\t if(str[str.size()-2] == '~' && str[str.size()-1] =='~' && i == str.size()-3&& i%2==1 ){\n\t flg = 2;\n\t break;\n\t }\n\t}\n }\n\n if(flg == 0) cout << \"NA\" << endl;\n else if(flg == 1)cout <<\"A\" << endl;\n else if(flg == 2) cout << \"B\"<<endl;\n } \n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_0139_1364102",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cassert>\n#include <vector>\n#include <string>\n#include <cmath>\n#include <map> \n#include <sstream>\n#include <cstdio>\n#include <complex>\n#include <cstring>\nusing namespace std;\n \nconst int MAX= 10000100;\n\n#define loop(i,a,b) for(int i = a ; i < b ; i ++)\n#define rep(i,a) loop(i,0,a)\n#define all(a) (a).begin(),(a).end()\n#define ll long long int\n#define gcd(a,b) __gcd(a,b)\n#define pb(a) push_back(a)\nint GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}\nint lcm(int a, int b) {return a*b / gcd(a, b);}\n\nbool A(string s){\n if(s.size() < 6) return false;\n if(s.size()%2 != 0)return false;\n if(s[0] != '>')return false;\n if(s[1] != '\\'')return false;\n if(s[s.size()-1] != '~')return false;\n if(s[s.size()/2] != '#')return false;\n else s[s.size()/2] = '=';\n loop(i,2,s.size()-1){\n if(s[i] != '=')return false;\n }\n return true;\n}\nbool B(string s){\n if(s.size() < 6) return false;\n if(s[0] != '>')return false;\n if(s[1] != '^')return false;\n loop(i,2,s.size()-2){\n if(i%2){\n if(s[i] != '=')return false;\n }else{\n if(s[i] != 'Q')return false;\n }\n }\n if(s[s.size()-2] != '~')return false;\n if(s[s.size()-1] != '~')return false;\n return true;\n}\nint main(void){\n int n;\n cin>>n;\n rep(i,n){\n string s;\n cin>>s;\n if(A(s))cout<<\"A\";\n else if(B(s))cout<<\"B\";\n else cout<<\"NA\";\n cout<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_0139_1361043",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n#define loop(i,a,b) for(int i=(a);i<ull(b);++i)\n#define rep(i,n) loop(i,0,n)\n#define all(a) (a).begin(), (a).end()\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst double inf = (int)1e8;\n\nint main(){\n\tint n; cin >> n;\n\trep(q, n){\n\t\tstring s; cin >> s;\n\t\tif(s.substr(0, 2) == \">'\"){\n\t\t\ts = s.substr(2);\n\t\t\tint c = 0;\n\t\t\tbool p = true;\n\t\t\tfor(int i=0; i < s.size(); i++) if(s[i] == '='){c++;} else break;\n\t\t\tif(s[c] != '#' || c == 0)p = false;\n\t\t\ts = s.substr(c+1);\n\t\t\tif(c+1 != s.size() || s[s.size()-1] != '~')p = false;\n\t\t\trep(i, c) if(s[i] != '=')p = false;\n\t\t\tcout << (p ? \"A\" : \"NA\") << endl;\n\t\t}else if(s.substr(0, 2) == \">^\"){\n\t\t\tbool p = true;\n\t\t\ts = s.substr(2);\n\t\t\tif(s.substr(0, 2) != \"Q=\") p = false;\n\t\t\twhile(s.substr(0, 2) == \"Q=\") s = s.substr(2);\n\t\t\tcout << (s == \"~~\" && p ? \"B\" : \"NA\") << endl;\n\t\t}else {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -0.016,
"final_rank": 12
},
{
"submission_id": "aoj_0139_1361022",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n\nstring solve(string s){\n if(s.substr(0,2)==\">'\"){\n int eq=0;\n for(int i=2;i<s.size();i++){\n if(s[i]!='=')break;\n else{\n eq++;\n }\n }\n \n if(eq==0)return \"NA\";\n \n if( s[ (2 + eq -1) +1 ] != '#')return \"NA\";\n \n if( s.substr( ((2+eq-1)+1) +1 ,eq ) != s.substr( 2,eq ) )return \"NA\";\n\n if( 2+eq+1+eq+1 == s.size() && s[ (2+eq+1+eq+1) -1 ]=='~')return \"A\";\n \n }else if(s.substr(0,2)==\">^\"){\n int c=2;\n while( s[c]=='Q' && s[c+1]=='=' ){\n c+=2;\n }\n if(c==2)return \"NA\";\n \n \n if( c+1==s.size()-1 && s[c]=='~' && s[c+1]=='~')return \"B\";\n else return \"NA\";\n \n \n }else return \"NA\";\n\n return \"NA\";\n}\n\n\nint main(){\n int n;\n cin>>n;\n rep(i,n){\n string s;\n cin>>s;\n \n cout<<solve(s)<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -0.016,
"final_rank": 12
},
{
"submission_id": "aoj_0139_1242183",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<climits>\n#include<string>\n#include<vector>\n#include<list>\n#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cstring>\n#include<stack>\n#include<functional>\nusing namespace std;\n\nbool isA(string s){\n\tint n = 0;\n\tif(s.at(n)!='>' || s.at(++n)!='\\'' ||s.at(++n)!='=') return false;\n\tint cnt = 1;\n\tfor(;s.at(++n)=='='; cnt++);\n\tif(s.at(n)!='#') return false;\n\tfor(int i=0; i<cnt; i++){\n\t\tif(s.at(++n)!='=') return false;\n\t}\n\tif(s.at(++n)!='~' || s.size()>n+1) return false;\n\treturn true;\n}\n\nbool isB(string s){\n\tint n = 0;\n\tif(s.at(n)!='>' || s.at(++n)!='^' || s.at(++n)!='Q' || s.at(++n)!='=') return false;\n\twhile(true){\n\t\tif(s.at(++n)=='Q'){\n\t\t\tif(s.at(++n)!='=') return false;\n\t\t}\n\t\telse break;\n\t}\n\tif(s.at(n)!='~' || s.at(++n)!='~' || s.size()>n+1) return false;\n\treturn true;\n}\n\nint main(){\n\tstring S;\n\tint N;\n\tcin>>N;\n\tfor(int i=0;i<N;i++){\n\t\tcin>>S;\n\t\tif(isA(S)) puts(\"A\");\n\t\telse if(isB(S)) puts(\"B\");\n\t\telse puts(\"NA\");\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0036,
"final_rank": 2
},
{
"submission_id": "aoj_0139_1195389",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint main(){\n int N;\n cin>>N;\n while(N--){\n string str;\n cin>>str;\n int len=str.size();\n int ans=-1;\n if(str[0]=='>'&&str[1]=='\\''){\n int pos=2;\n int cnt=0;\n int turn=0;\n int flag=0;\n do{\n if(str[pos]=='=')\n cnt+=(turn)?(-1):(1);\n else if(str[pos]=='#')turn=1;\n else flag=0;\n if(pos==2&&cnt>0)flag=1;\n pos++;\n }while(pos<len-1);\n if(cnt==0&&flag&&str[pos]=='~')ans=0;\n }\n else if(str[0]=='>'&&str[1]=='^'){\n int pos=2;\n int flag=1;\n do{\n if(str[pos]!='Q'||str[pos+1]!='='){\n flag=0;\n break;\n }\n pos+=2;\n }while(pos<len-2);\n if(flag&&str[pos]=='~'&&str[pos+1]=='~')ans=1;\n }\n if(ans==0)cout<<\"A\"<<endl;\n else if(ans==1)cout<<\"B\"<<endl;\n else cout<<\"NA\"<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.0089,
"final_rank": 3
},
{
"submission_id": "aoj_0139_1151454",
"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;\n\nint solve(string &s){\n if(s.length() >= 6 && s.substr(0, 2) == \">'\" && s[(int)s.length() - 1] == '~'){\n int c1 = 0, c2 = 0, t = 0, f = 0;\n for(int i = 2; i + 1 < (int)s.length(); ++i){\n if(s[i] != '=' && s[i] != '#') f = 1;\n if(s[i] == '#' && t >= 1) f = 1;\n if(f) break;\n if(s[i] == '#') ++t;\n else if(t) ++c2;\n else ++c1;\n }\n if(!f && c1 == c2) return 0;\n }\n if(s.length() >= 6 && s.substr(0, 2) == \">^\" && s.substr((int)s.length() - 2) == \"~~\"){\n int f = 0;\n for(int i = 2; i + 2 < s.length(); i += 2) if(s.substr(i, 2) != \"Q=\") f = 1;\n if(!f) return 1;\n }\n return -1;\n}\n\nint main() {\n int T; cin >>T;\n REP(t, T){\n string s; cin >>s;\n int ans = solve(s);\n cout <<(ans == 0 ? \"A\" : (ans == 1 ? \"B\" : \"NA\")) <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -0.016,
"final_rank": 12
},
{
"submission_id": "aoj_0139_1144625",
"code_snippet": "//include\n//------------------------------------------\n#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <deque>\n#include <queue>\n#include <stack>\n#include <bitset>\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>\n#include <ctime>\n#include <tuple>\n\nusing namespace std;\n\n//conversion\n//------------------------------------------\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\n\n//math\n//-------------------------------------------\ntemplate<class T> inline T sqr(T x) {return x*x;}\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef long long LL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define MT make_tuple\n#define SZ(a) int((a).size())\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n//constant\n//--------------------------------------------\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst int DX[] = {0, 1, 0, -1};\nconst int DY[] = {-1, 0, 1, 0};\n\n//other\n//--------------------------------------------\n#define RANGE(a, c, b) ((a <= b) && (b < c))\n\n//clear memory\n#define CLR(a) memset((a), 0 ,sizeof(a))\n\n//debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\nint solve(string snake){\n\tif(snake[0] != '>') return 0;\n\tif(snake[1] == '\\''){\n\t\tint i = 2;\n\t\twhile(snake[i] == '='){\n\t\t\ti++;\n\t\t}\n\t\tif(snake[i] != '#') return 0;\n\t\tint length = i - 2;\n\t\ti++;\n\t\twhile(snake[i] == '='){\n\t\t\ti++;\n\t\t}\n\t\tint length2 = i -3 - length;\n\t\tif(length2 != length) return 0;\n\t\tif(length > 0 &&\n\t\t\tsnake[i] == '~' && \n\t\t\ti == snake.length() - 1){\n\t\t\treturn 1;\n\t\t}\n\t}else if(snake[1] == '^'){\n\t\tint i = 2;\n\t\tint length = 0;\n\t\twhile(snake[i] =='Q' &&\n\t\t\tsnake[i + 1] == '='){\n\t\t\ti += 2;\n\t\t\tlength++;\n\t\t}\n\t\tif(length > 0 &&\n\t\t\tsnake[i] == '~' &&\n\t\t\tsnake[i + 1] == '~' &&\n\t\t\ti + 1 == snake.length() - 1){\n\t\t\treturn 2;\n\t\t}\n\t}\n\treturn 0;\n}\n\nint main(int argc, char const *argv[])\n{\n\tint n;\n\tcin >> n;\n\tREP(i, n){\n\t\tstring snake;\n\t\tcin >> snake;\n\t\tstring ans;\n\t\tswitch(solve(snake)){\n\t\t\tcase 0:\n\t\t\tans = \"NA\";\n\t\t\tbreak;\n\n\t\t\tcase 1:\n\t\t\tans = \"A\";\n\t\t\tbreak;\n\n\t\t\tcase 2:\n\t\t\tans = \"B\";\n\t\t\tbreak;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_0139_1141406",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <set>\n#include <map>\n#include <string>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <cstdio>\n#include <istream>\n#include <sstream>\n#include <iomanip>\n#include <iterator>\n#include <climits>\nusing namespace std;\n\ntypedef ostringstream OSS;\ntypedef istringstream ISS;\n\ntypedef vector<int> VI;\ntypedef vector< VI > VVI;\n\ntypedef long long LL;\n\ntypedef pair<int, int> PII;\ntypedef vector<PII> VPII;\n\n#define X first\n#define Y second\n\nbool check1(string s) {\n\tint n = s.size();\n\n\tif (n < 6 || s[0] != '>' || s[1] != '\\'' || s[n - 1] != '~') {\n\t\treturn false;\n\t}\n\n\tstring sub = s.substr(2, n - 3);\n\tn = sub.size();\n\n\tif (!(n % 2) || sub[n / 2] != '#') {\n\t\treturn false;\n\t}\n\n\tfor (int i = 0; i < n / 2; i++) {\n\t\tif (sub[i] != '=' || sub[n - i - 1] != '=') {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool check2(string s) {\n\tint n = s.size();\n\n\tif (n < 6 || s[0] != '>' || s[1] != '^' || s[n - 1] != '~' || s[n - 2] != '~') {\n\t\treturn false;\n\t}\n\n\tstring sub = s.substr(2, n - 4);\n\tn = sub.size();\n\n\tfor (int i = 0; i < n / 2; i++) {\n\t\tif (sub[i * 2] != 'Q' || sub[i * 2 + 1] != '=') {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nint main(void) {\n\tint n;\n\tcin >> n;\n\n\tfor (int i = 0; i < n; i++) {\n\t\tstring s;\n\t\tcin >> s;\n\n\t\tif (check1(s)) {\n\t\t\tcout << \"A\" << endl;\n\t\t}else if (check2(s)) {\n\t\t\tcout << \"B\" << endl;\n\t\t}else {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_0139_1091447",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <cstring>\n#include <cmath>\n#include <complex>\n#include <map>\n#include <climits>\n#include <sstream>\nusing namespace std;\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define EPS 1e-8\n#define F first\n#define S second\n#define mkp make_pair\n\nstatic const double PI=6*asin(0.5);\ntypedef long long ll;\ntypedef complex<double> CP;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vint;\nstatic const int INF=1<<24;\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v,int a,int b, const T &t = T()){\n\tv.assign(a,vector<T>(b,t));\n}\n\n//v.erase(unique(v.begin(),v.end()),v.end());\nint main(){\n\tint n;\n\tcin>>n;\n\trep(i,n){\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(s.substr(0,2)==\">'\"&&s.substr(s.size()-1,1)==\"~\"){\n\t\t\ts=s.substr(2);\n\t\t\ts=s.substr(0,s.size()-1);\n\t\t\tbool f=true;\n\t\t\tif(s.size()==0) f=false;\n\t\t\tif(s.size()&&s[0]!='='){\n\t\t\t\tf=false;\n\t\t\t}\n\t\t\twhile(s.size()>1){\n\t\t\t\tif(s[0]==s[s.size()-1]&&s[0]=='='){\n\t\t\t\t\ts=s.substr(1,s.size()-2);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t\tif(s[0]=='#'){\n\t\t\t\t\tcout<<\"A\\n\";\n\t\t\t\t}\n\t\t\t\telse cout<<\"NA\\n\";\n\t\t\t}\n\t\t\telse{\n\t\t\t\tcout<<\"NA\\n\";\n\t\t\t}\n\t\t}\n\t\telse if(s.substr(0,2)==\">^\"&&s.substr(s.size()-2,2)==\"~~\"){\n\t\t\ts=s.substr(2);\n\t\t\ts=s.substr(0,s.size()-2);\n\t\t\tbool f=true;\n\t\t\tif(s.size()<2) f=false;\n\t\t\tif(s.size()>=2&&s.substr(0,2)!=\"Q=\") f=false;\n\t\t\twhile(s.size()>=2){\n\t\t\t\tif(s.substr(0,2)==\"Q=\"){\n\t\t\t\t\ts=s.substr(2);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t\tcout<<\"B\\n\";\n\t\t\t}\n\t\t\telse cout<<\"NA\\n\";\n\t\t}\n\t\telse{\n\t\t\tcout<<\"NA\\n\";\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -0.016,
"final_rank": 12
},
{
"submission_id": "aoj_0139_1090353",
"code_snippet": "#include <iostream>\n#include <string>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\t\n\trep(i,n)\n\t{\n\t\tstring s;\n\t\tcin >> s;\n\n\t\tif(s[0] == '>' && s[1] == '\\'' && s[2] == '=')\n\t\t{\n\t\t\tint i = 2;\n\t\t\tint cnt = 0;\n\t\t\twhile(s[i] == '=')\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\tcnt++;\n\t\t\t}\n\n\t\t\tif(s[i] == '#' && i < s.size())\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\twhile(s[i] == '=')\n\t\t\t\t{\n\t\t\t\t\tif(i == s.size()-1) break;\n\t\t\t\t\ti++;\n\t\t\t\t\tcnt--;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(cnt == 0 && s[i] == '~') cout << \"A\" << endl;\n\t\t\telse cout << \"NA\" << endl;\n\t\t}\n\t\telse if(s[0] == '>' && s[1] == '^' && s[2] == 'Q')\n\t\t{\n\t\t\tint i = 2;\n\t\t\tint cnt = 0;\n\t\t\tbool end = false;\n\t\t\twhile(i+1 < s.size())\n\t\t\t{\n\t\t\t\tif(s[i] == 'Q' && s[i+1] == '=')\n\t\t\t\t{\n\t\t\t\t\ti += 2;\n\t\t\t\t}\n\t\t\t\telse if(s[i] == '~' && s[i+1] == '~')\n\t\t\t\t{\n\t\t\t\t\tend = true;\n\t\t\t\t\tcout << \"B\" << endl;\n\t\t\t\t\ti += 2;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!end) cout << \"NA\" << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1204,
"score_of_the_acc": -0.0107,
"final_rank": 5
}
] |
aoj_0144_cpp
|
パケット転送
インターネットでは、データはパケットに分割され、パケットごとにルータと呼ばれる中継機器を介して宛先に転送されます。各ルータはパケットに記載された宛先から次に転送すべきルータを判断します。さらに、無限にルータ間を転送され続けることを防ぐため、パケットには TTL（Time To Live） という値が付加されています。ルータは受け取ったパケットの TTL を 1 減算し、その結果が 0 ならそのパケットを破棄し、それ以外なら次のルータに転送します。
そこで、ネットワークの設計を手助けするプログラムを作ることになりました。ネットワークの接続情報と送信パケットの情報を入力として、各パケットが宛先ルータに到着するまでに経由するルータの数のうち最小の値を表示するプログラムを作成してください。
ネットワークは図のように複数のルータとそれらを結ぶケーブルで構成されています。ただし、各接続（ケーブル）は単方向であることに注意してください。各ルータが直接つながっているルータの番号の配列がネットワークの接続の情報として与えられます。ルータの数を
n
とすれば、各ルータは 1 から
n
までの整数で識別されます。送信元から宛先ルータまでの経路が複数ある場合は、経由するルータの数が少ない方の値を出力してください。また、パケットが宛先に到達しない場合は NA と出力してください。
例えば、以下の図のようなネットワークで、送信元ルータが 6、宛先ルータが 5 の場合を考えます。最短経路は 6→1→5 であり経由するルータは 3 個です。この場合、TTL はルータ 6、1 でそれぞれ減算されるので、送信時の TTL が 3 以上であればパケットは到達できます。宛先ルータでは TTL を減算する必要はありません。また、送信元と宛先が同じルータになるようなパケットは無いものとします。
Input
入力は以下の形式で与えられます。
n
r
1
k
1
t
11
t
12
...
t
1k
1
r
2
k
2
t
21
t
22
...
t
2k
2
:
r
n
k
n
t
n1
t
n2
...
t
nk
n
p
s
1
d
1
v
1
s
2
d
2
v
2
:
s
p
d
p
v
p
1 行目にルータの総数
n
（
n
≤ 100）、続く
n
行に
i
番目のルータの接続情報が与えられます。接続情報として、
i
番目のルータの番号
r
i
、
i
番目のルータと直接接続しているルータの個数
k
i
、
i
番目のルータから送信できるルータの番号
t
i1
,
t
i2
, ...
t
ik
i
が与えられます。
続く行にパケットの個数
p
（
p
≤ 1000）、続く
p
行に
i
番目のパケットの情報が与えられます。パケットの情報として、 送信元ルータの番号
s
i
, 宛先ルータの番号
d
i
, TTL の値
v
i
(0 ≤
v
i
≤ 10000) が与えられます。
Output
各パケットごとに、経由するルータの個数または NA を１行に出力してください。
Sample Input
7
1 4 2 5 4 3
2 1 5
3 1 6
4 1 7
5 2 7 6
6 1 1
7 0
6
1 2 2
1 5 3
1 2 1
5 1 3
6 3 3
1 7 4
Output for the Sample Input
2
2
NA
3
3
3
|
[
{
"submission_id": "aoj_0144_3006057",
"code_snippet": "#include<iostream>\n#include<map>\n#include<vector>\n#include<queue>\n#include<set>\nusing namespace std;\n\nint main(){\n int n, r, k, t;\n cin >> n;\n\n map<int, vector<int>> path;\n for(int i = 0; i < n; i++){\n cin >> r >> k;\n for(int j = 0; j < k; j++){\n cin >> t;\n path[r].push_back(t);\n }\n }\n\n int p, s, d, v;\n cin >> p;\n for(int i = 0; i < p; i++){\n cin >> s >> d >> v;\n queue<pair<int, int>> q;\n set<int> appear;\n\n q.push({s,1});\n\n int ans = -1;\n while(!q.empty()){\n pair<int,int> p = q.front(); q.pop();\n if(appear.find(p.first) != appear.end()) continue;\n \n if(p.first == d){\n ans = p.second;\n break;\n }\n\n appear.insert(p.first);\n\n for(int j = 0; j < path[p.first].size(); j++){\n if(appear.find(path[p.first][j]) == appear.end()){\n q.push({path[p.first][j], p.second+1});\n }\n }\n }\n\n if(ans == -1 || ans > v){\n cout << \"NA\" << endl;\n }else{\n cout << ans << endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3180,
"score_of_the_acc": -1.04,
"final_rank": 15
},
{
"submission_id": "aoj_0144_2574644",
"code_snippet": "#include <cstdio>\n#include <vector>\n#include <utility>\nusing namespace std;\n\n#define INF 10000000\n\nint n,r,k,t,p,s,d,v;\nvector<pair<int,vector<int> > > vec;\n\nint find(int num){\n\tfor(int i = 0; i < n; i++){\n\t\tif(vec[i].first == num){\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\nint sch(int st, int ed){\n\tint from = find(st);\n\tint to = find(ed);\n\tvector<int> vv = vector<int>(n,INF);\n\tvv[from] = 0;\n\tfor(int i = 1; i <= n; i++){\n\t\tfor(int vi = 0; vi < n; vi++){\n\t\t\tif(vv[vi] == i - 1){\n\t\t\t\tfor(int j = 0; j < vec[vi].second.size(); j++){\n\t\t\t\t\tint tmp = find(vec[vi].second[j]);\n\t\t\t\t\tif(vv[tmp] == INF){\n\t\t\t\t\t\tvv[tmp] = i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn vv[to];\n}\n\nint main(){\n\tscanf(\"%d\",&n);\n\tvec = vector<pair<int,vector<int> > >(n);\n\tfor(int i = 0; i < n; i++){\n\t\tscanf(\"%d%d\",&r,&k);\n\t\tvec[i].first = r;\n\t\tvec[i].second = vector<int>(k);\n\t\tfor(int j = 0; j < k; j++){\n\t\t\tscanf(\"%d\",&t);\n\t\t\tvec[i].second[j] = t;\n\t\t}\n\t}\n\tscanf(\"%d\",&p);\n\tfor(int i = 0; i < p; i++){\n\t\tscanf(\"%d%d%d\",&s,&d,&v);\n\t\tint l = sch(s,d);\n\t\tl += 1;\n\t\tif(l <= v){\n\t\t\tprintf(\"%d\\n\",l);\n\t\t}\n\t\telse{\n\t\t\tprintf(\"NA\\n\");\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2748,
"score_of_the_acc": -0.7814,
"final_rank": 5
},
{
"submission_id": "aoj_0144_2539665",
"code_snippet": "/* ????????????????????????????????????????????? */\n#include <stdio.h>\n\n/* ?????°???????????? */\ntypedef\tvoid\t\t\tVD;\ntypedef\tsigned char\t\tI1;\ntypedef unsigned char \tU1;\ntypedef\tsigned short\tI2;\ntypedef unsigned short \tU2;\ntypedef\tsigned int\t\tI4;\ntypedef unsigned int \tU4;\n\n/* ?????°?????? */\n#define MAX_ROUTER 100\n#define MAX_TTL 10000\n\n#define CONNECT 1\n#define DISCONNECT 0\n#define SENTINEL -1\n\n#define TRUE 1\n#define FALSE 0\n\n#define INPUT_SUCCESS 0\n#define INPUT_ERORR -1\n\n/* ????????????????????£?¨? */\nVD setInit(VD);\nI1 inputConnectInfo(VD);\nI1 inputTransmitPacket(VD);\nI4 CalcSumRouter(I4 i4Sender,I4 i4Destination,I4 i4TTL);\n/* ??°?????????????????° */\nI1 u1Connect[MAX_ROUTER+1][MAX_ROUTER+1];\nI4 i4RouterNum;\n\n/* main??? */\nI4 main(VD)\n{\n\tI1 i1ErrorCheck;\n\tI4 i4CalcNum;\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\t\n\tsetInit();\n\ti1ErrorCheck = inputConnectInfo();\n\tif(i1ErrorCheck == INPUT_SUCCESS){\n\t\tscanf(\"%d\",&i4CalcNum);\n\t\tfor( i4RoopCnt1=0; i4RoopCnt1<i4CalcNum; i4RoopCnt1++)\n\t\t{\n\t\t\tinputTransmitPacket();\n\t\t}\n\t}\n\telse{\n\t\t;\n\t}\n\treturn 0;\n}\n\n/* ???????????¢??° */\nVD setInit(VD)\n{\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\t\n\tfor( i4RoopCnt1=1; i4RoopCnt1<=MAX_ROUTER; i4RoopCnt1++)\n\t{\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++)\n\t\t{\n\t\t\tu1Connect[i4RoopCnt1][i4RoopCnt2] = DISCONNECT;\n\t\t}\n\t}\n\treturn;\n}\n\n/* ??????????????\\?¶??????±??\\?????¢??° */\nI1 inputConnectInfo(VD)\n{\n\tI1 i1Return;\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\tI4 i4RouterCnt;\n\tI4 i4ConnectNum;\n\tI4 i4AccessPoint;\n\t\n\ti1Return = INPUT_SUCCESS;\n\t\n\tscanf(\"%d\",&i4RouterNum);\n\tif(i4RouterNum <= (I4)MAX_ROUTER){\n\t\tfor( i4RoopCnt1=1; i4RoopCnt1<=i4RouterNum; i4RoopCnt1++){\n\t\t\tscanf(\"%d%d\",&i4RouterCnt,&i4ConnectNum);\n\t\t\tfor( i4RoopCnt2=0; i4RoopCnt2<i4ConnectNum; i4RoopCnt2++){\n\t\t\t\tscanf(\"%d\",&i4AccessPoint);\n\t\t\t\tu1Connect[i4RouterCnt][i4AccessPoint] = CONNECT;\n\t\t\t}\n\t\t\tu1Connect[i4RouterCnt][i4RouterNum+1] = SENTINEL;\n\t\t}\n\t}\n\telse{\n\t\ti1Return = INPUT_ERORR;\n\t}\n\treturn i1Return;\n}\n\n/* ???????????±???????????±??\\?????¢??° */\nI1 inputTransmitPacket(VD)\n{\n\tI1 i1Return;\n\tI4 i4StartRouter;\n\tI4 i4GoalRouter;\n\tI4 i4TTL;\n\tI4 i4Ans;\n\t\n\ti1Return = INPUT_SUCCESS;\n\t\n\tscanf(\"%d%d%d\",&i4StartRouter,&i4GoalRouter,&i4TTL);\n\tif(i4TTL <= MAX_TTL){\n\t\ti4Ans = CalcSumRouter(i4StartRouter,i4GoalRouter,i4TTL);\n\t\tif(i4Ans > 0){\n\t\t\tprintf(\"%d\\n\",i4Ans);\n\t\t}\n\t\telse{\n\t\t\tprintf(\"NA\\n\");\n\t\t}\n\t}\n\telse{\n\t\ti1Return = INPUT_ERORR;\n\t}\n\treturn i1Return;\n}\n\n/* ??????????????????????¨????????????°?¨??????¢??° */\nI4 CalcSumRouter(I4 i4Sender,I4 i4Destination,I4 i4TTL)\n{\n\t/* ?????°??£?¨? */\n\tI1 i1StarTable[MAX_ROUTER+1][MAX_ROUTER+1];\t/* ????????¨ */\n\tI4 i4MinVal[MAX_ROUTER+1];\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\tI4 i4RoopCnt3;\n\tI4 i4RoopMax;\n\t\n\t/* ????????? */\n\tfor( i4RoopCnt1=1; i4RoopCnt1<=i4RouterNum; i4RoopCnt1++){\n\t\ti4MinVal[i4RoopCnt1] = 0;\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=i4RouterNum; i4RoopCnt2++){\n\t\t\ti1StarTable[i4RoopCnt1][i4RoopCnt2] = FALSE;\n\t\t}\n\t}\n\t\n\tif(i4TTL<=i4RouterNum){\n\t\ti4RoopMax = i4TTL;\n\t}\n\telse{\n\t\ti4RoopMax = i4RouterNum;\n\t}\n\t\n\ti1StarTable[1][i4Sender] = TRUE;\n\t\n\tfor(i4RoopCnt1=1; i4RoopCnt1<i4RoopMax; i4RoopCnt1++){\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=i4RouterNum; i4RoopCnt2++){\n\t\t\tif(i1StarTable[i4RoopCnt1][i4RoopCnt2] == TRUE){\n\t\t\t\tfor(i4RoopCnt3=1; i4RoopCnt3<=i4RouterNum; i4RoopCnt3++){\n\t\t\t\t\tif(u1Connect[i4RoopCnt2][i4RoopCnt3] == CONNECT){\n\t\t\t\t\t\tif(i4RoopCnt3 == i4Destination){\n\t\t\t\t\t\t\treturn i4RoopCnt1+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\t;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti1StarTable[i4RoopCnt1+1][i4RoopCnt3] = TRUE;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\t;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 2696,
"score_of_the_acc": -0.8751,
"final_rank": 8
},
{
"submission_id": "aoj_0144_2539654",
"code_snippet": "/* ????????????????????????????????????????????? */\n#include <stdio.h>\n\n/* ?????°???????????? */\ntypedef\tvoid\t\t\tVD;\ntypedef\tsigned char\t\tI1;\ntypedef unsigned char \tU1;\ntypedef\tsigned short\tI2;\ntypedef unsigned short \tU2;\ntypedef\tsigned int\t\tI4;\ntypedef unsigned int \tU4;\n\n/* ?????°?????? */\n#define MAX_ROUTER 100\n#define MAX_TTL 10000\n\n#define CONNECT 1\n#define DISCONNECT 0\n#define SENTINEL -1\n\n#define TRUE 1\n#define FALSE 0\n\n#define INPUT_SUCCESS 0\n#define INPUT_ERORR -1\n\n/* ????????????????????£?¨? */\nVD setInit(VD);\nI1 inputConnectInfo(VD);\nI1 inputTransmitPacket(VD);\nI4 CalcDijikstra(I4 i4Sender,I4 i4Destination,I4 i4TTL);\n/* ??°?????????????????° */\nI1 u1Connect[MAX_ROUTER+1][MAX_ROUTER+1];\nI4 i4RouterNum;\n\nI4 main(VD)\n{\n\tI1 i1ErrorCheck;\n\tI4 i4CalcNum;\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\t\n\tsetInit();\n\ti1ErrorCheck = inputConnectInfo();\n\tif(i1ErrorCheck == INPUT_SUCCESS){\n\t\tscanf(\"%d\",&i4CalcNum);\n\t\tfor( i4RoopCnt1=0; i4RoopCnt1<i4CalcNum; i4RoopCnt1++)\n\t\t{\n\t\t\tinputTransmitPacket();\n\t\t}\n\t}\n\telse{\n\t\t;\n\t}\n\treturn 0;\n}\n\nVD setInit(VD)\n{\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\t\n\tfor( i4RoopCnt1=1; i4RoopCnt1<=MAX_ROUTER; i4RoopCnt1++)\n\t{\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++)\n\t\t{\n\t\t\tu1Connect[i4RoopCnt1][i4RoopCnt2] = DISCONNECT;\n\t\t}\n\t}\n\treturn;\n}\n\nI1 inputConnectInfo(VD)\n{\n\tI1 i1Return;\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\tI4 i4RouterCnt;\n\tI4 i4ConnectNum;\n\tI4 i4AccessPoint;\n\t\n\ti1Return = INPUT_SUCCESS;\n\t\n\tscanf(\"%d\",&i4RouterNum);\n\tif(i4RouterNum <= (I4)MAX_ROUTER){\n\t\tfor( i4RoopCnt1=1; i4RoopCnt1<=i4RouterNum; i4RoopCnt1++)\t\t{\n\t\t\tscanf(\"%d%d\",&i4RouterCnt,&i4ConnectNum);\n\t\t\tfor( i4RoopCnt2=0; i4RoopCnt2<i4ConnectNum; i4RoopCnt2++)\t\t\t{\n\t\t\t\tscanf(\"%d\",&i4AccessPoint);\n\t\t\t\tu1Connect[i4RouterCnt][i4AccessPoint] = CONNECT;\n\t\t\t}\n\t\t\tu1Connect[i4RouterCnt][i4RouterNum+1] = SENTINEL;\n\t\t}\n\t}\n\telse{\n\t\ti1Return = INPUT_ERORR;\n\t}\n\treturn i1Return;\n}\n\nI1 inputTransmitPacket(VD)\n{\n\tI1 i1Return;\n\tI4 i4StartRouter;\n\tI4 i4GoalRouter;\n\tI4 i4TTL;\n\tI4 i4Ans;\n\t\n\ti1Return = INPUT_SUCCESS;\n\t\n\tscanf(\"%d%d%d\",&i4StartRouter,&i4GoalRouter,&i4TTL);\n\tif(i4TTL <= MAX_TTL){\n\t\ti4Ans = CalcDijikstra(i4StartRouter,i4GoalRouter,i4TTL);\n\t\tif(i4Ans > 0){\n\t\t\tprintf(\"%d\\n\",i4Ans);\n\t\t}\n\t\telse{\n\t\t\tprintf(\"NA\\n\");\n\t\t}\n\t}\n\telse{\n\t\ti1Return = INPUT_ERORR;\n\t}\n\treturn i1Return;\n}\n\nI4 CalcDijikstra(I4 i4Sender,I4 i4Destination,I4 i4TTL)\n{\n\tI1 i1StarTable[MAX_ROUTER+1][MAX_ROUTER+1];\n\tI4 i4MinVal[MAX_ROUTER+1];\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\tI4 i4RoopCnt3;\n\t\n\tfor( i4RoopCnt1=1; i4RoopCnt1<=MAX_ROUTER; i4RoopCnt1++){\n\t\ti4MinVal[i4RoopCnt1] = 0;\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++){\n\t\t\ti1StarTable[i4RoopCnt1][i4RoopCnt2] = FALSE;\n\t\t}\n\t}\n\t\n\ti1StarTable[1][i4Sender] = TRUE;\n\t\n\tfor(i4RoopCnt1=1; i4RoopCnt1<MAX_ROUTER; i4RoopCnt1++){\n\t\tif(i4TTL <= i4RoopCnt1){\n\t\t\treturn 0;\n\t\t}\n\t\telse{\n\t\t\t;\n\t\t}\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++){\n\t\t\tif(i1StarTable[i4RoopCnt1][i4RoopCnt2] == TRUE){\n\t\t\t\tfor(i4RoopCnt3=1; i4RoopCnt3<=MAX_ROUTER; i4RoopCnt3++){\n\t\t\t\t\tif(u1Connect[i4RoopCnt2][i4RoopCnt3] == CONNECT){\n\t\t\t\t\t\tif(i4RoopCnt3 == i4Destination){\n\t\t\t\t\t\t\treturn i4RoopCnt1+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\t;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti1StarTable[i4RoopCnt1+1][i4RoopCnt3] = TRUE;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\t;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 2664,
"score_of_the_acc": -0.8989,
"final_rank": 10
},
{
"submission_id": "aoj_0144_2539633",
"code_snippet": "/* ????????????????????????????????????????????? */\n#include <stdio.h>\n\n/* ?????°???????????? */\ntypedef\tvoid\t\t\tVD;\ntypedef\tsigned char\t\tI1;\ntypedef unsigned char \tU1;\ntypedef\tsigned short\tI2;\ntypedef unsigned short \tU2;\ntypedef\tsigned int\t\tI4;\ntypedef unsigned int \tU4;\n\n/* ?????°?????? */\n#define MAX_ROUTER 100\n#define MAX_TTL 10000\n\n#define CONNECT 1\n#define DISCONNECT 0\n#define SENTINEL -1\n\n#define TRUE 1\n#define FALSE 0\n\n#define INPUT_SUCCESS 0\n#define INPUT_ERORR -1\n\n/* ????????????????????£?¨? */\nVD setInit(VD);\nI1 inputConnectInfo(VD);\nI1 inputTransmitPacket(VD);\nI4 CalcDijikstra(I4 i4Sender,I4 i4Destination,I4 i4TTL,I4 i4RouterSum);\n\nI4 CalcDijikstra(I4 i4Sender,I4 i4Destination,I4 i4TTL,I4 i4RouterSum);\n/* ??°?????????????????° */\nI1 u1Connect[MAX_ROUTER+1][MAX_ROUTER+1];\nI4 i4RouterNum;\n\nI4 main(VD)\n{\n\tI1 i1ErrorCheck;\n\tI4 i4CalcNum;\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\t\n\tsetInit();\n\ti1ErrorCheck = inputConnectInfo();\n\tif(i1ErrorCheck == INPUT_SUCCESS){\n\t\tscanf(\"%d\",&i4CalcNum);\n\t\tfor( i4RoopCnt1=0; i4RoopCnt1<i4CalcNum; i4RoopCnt1++)\n\t\t{\n\t\t\tinputTransmitPacket();\n\t\t}\n\t}\n\treturn 0;\n}\n\nVD setInit(VD)\n{\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\t\n\tfor( i4RoopCnt1=1; i4RoopCnt1<=MAX_ROUTER; i4RoopCnt1++)\n\t{\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++)\n\t\t{\n\t\t\tu1Connect[i4RoopCnt1][i4RoopCnt2] = DISCONNECT;\n\t\t}\n\t}\n\treturn;\n}\n\nI1 inputConnectInfo(VD)\n{\n\tI1 i1Return;\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\tI4 i4RouterCnt;\n\tI4 i4ConnectNum;\n\tI4 i4AccessPoint;\n\t\n\ti1Return = INPUT_SUCCESS;\n\t\n\tscanf(\"%d\",&i4RouterNum);\n\tif(i4RouterNum <= (I4)MAX_ROUTER)\n\t{\n\t\tfor( i4RoopCnt1=1; i4RoopCnt1<=i4RouterNum; i4RoopCnt1++)\n\t\t{\n\t\t\tscanf(\"%d%d\",&i4RouterCnt,&i4ConnectNum);\n\t\t\tfor( i4RoopCnt2=0; i4RoopCnt2<i4ConnectNum; i4RoopCnt2++)\n\t\t\t{\n\t\t\t\tscanf(\"%d\",&i4AccessPoint);\n\t\t\t\tu1Connect[i4RouterCnt][i4AccessPoint] = CONNECT;\n\t\t\t}\n\t\t\tu1Connect[i4RouterCnt][i4RouterNum+1] = SENTINEL;\n\t\t}\n\t}\n\telse\n\t{\n\t\ti1Return = INPUT_ERORR;\n\t}\n\treturn i1Return;\n}\n\nI1 inputTransmitPacket(VD)\n{\n\tI1 i1Return;\n\tI4 i4StartRouter;\n\tI4 i4GoalRouter;\n\tI4 i4TTL;\n\tI4 i4Ans;\n\t\n\ti1Return = INPUT_SUCCESS;\n\t\n\tscanf(\"%d%d%d\",&i4StartRouter,&i4GoalRouter,&i4TTL);\n\tif(i4TTL <= MAX_TTL)\n\t{\n\t\ti4Ans = CalcDijikstra(i4StartRouter,i4GoalRouter,i4TTL,1);\n\t\tif(i4Ans > 0){\n\t\t\tprintf(\"%d\\n\",i4Ans);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"NA\\n\");\n\t\t}\n\t}\n\telse\n\t{\n\t\ti1Return = INPUT_ERORR;\n\t}\n\treturn i1Return;\n}\n\nI4 CalcDijikstra(I4 i4Sender,I4 i4Destination,I4 i4TTL,I4 i4RouterSum)\n{\n\tI1 i1StarTable[MAX_ROUTER+1][MAX_ROUTER+1];\n\tI4 i4MinVal[MAX_ROUTER+1];\n\tI4 i4RoopCnt1;\n\tI4 i4RoopCnt2;\n\tI4 i4RoopCnt3;\n\t\n\tfor( i4RoopCnt1=1; i4RoopCnt1<=MAX_ROUTER; i4RoopCnt1++)\n\t{\n\t\ti4MinVal[i4RoopCnt1] = 0;\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++)\n\t\t{\n\t\t\ti1StarTable[i4RoopCnt1][i4RoopCnt2] = FALSE;\n\t\t}\n\t}\n\t\n\ti1StarTable[1][i4Sender] = TRUE;\n\t\n\tfor(i4RoopCnt1=1; i4RoopCnt1<MAX_ROUTER; i4RoopCnt1++)\n\t{\n\t\tif(i4TTL <= i4RoopCnt1)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\tfor(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++)\n\t\t{\n\t\t\tif(i1StarTable[i4RoopCnt1][i4RoopCnt2] == TRUE)\n\t\t\t{\n\t\t\t\tfor(i4RoopCnt3=1; i4RoopCnt3<=MAX_ROUTER; i4RoopCnt3++)\n\t\t\t\t{\n\t\t\t\t\tif(u1Connect[i4RoopCnt2][i4RoopCnt3] == CONNECT)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(i4RoopCnt3 == i4Destination)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn i4RoopCnt1+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti1StarTable[i4RoopCnt1+1][i4RoopCnt3] = TRUE;\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\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 2700,
"score_of_the_acc": -0.8771,
"final_rank": 9
},
{
"submission_id": "aoj_0144_2477895",
"code_snippet": "#include<functional>\n#include<algorithm>\n#include<iostream>\n#include<utility>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<stack>\n#include<queue>\n#include<deque>\n#include<map>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define loop(i,x,n) for(int i=x;i<n;i++)\n#define pf push_front\n#define pb push_back\n#define int long long\nusing namespace std;\nconst int INF=1000000007;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nconst int N=101;\n\nint net[N][N];\n\nint bfs(int n,int s,int d){\n vector<int> time(n);\n queue<int> que;\n rep(i,n)time[i]=INF;\n time[s]=0;\n que.push(s);\n int u;\n while(!que.empty()){\n u=que.front(),que.pop();\n rep(i,n){\n if(time[i]>time[u]+net[u][i]){\n time[i]=time[u]+net[u][i];\n que.push(i);\n }\n }\n }\n return time[d];\n}\n\nsigned main(){\n int n;\n cin>>n;\n rep(i,n)rep(j,n)net[i][j]=INF;\n rep(i,n){\n int r,k;\n cin>>r>>k;\n r--;\n rep(i,k){\n int t;\n cin>>t;\n t--;\n net[r][t]=1;\n }\n }\n\n int p;\n cin>>p;\n rep(i,p){\n int s,d,v;\n cin>>s>>d>>v;\n s--;d--;\n int ans=bfs(n,s,d)+1;\n\n if(ans<=v)cout<<ans<<endl;\n else cout<<\"NA\"<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3100,
"score_of_the_acc": -0.9595,
"final_rank": 11
},
{
"submission_id": "aoj_0144_2475683",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n;\n\tcin >> n;\n\tint g[n][n];\n\tfor(int i = 0; i < n; i++)\n\t\tfor(int j = 0; j < n; j++)\n\t\t\tg[i][j] = 100000000;\n\tint r,k,t;\n\tfor(int i = 0; i < n; i++){\n\t\tcin >> r >> k;\n\t\tr--;\n\t\tfor(int j = 0; j < k; j++){\n\t\t\tcin >> t;\n\t\t\tt--;\n\t\t\tg[r][t] = 1;\n\t\t}\n\t}\n\tint p;\n\tcin >> p;\n\tfor(int i = 0; i < p; i++){\n\t\tint s,d,v;\n\t\tcin >> s >> d >> v;\n\t\ts--; d--;\n\t\tvector <int> used(n,false);\n\t\tvector <int> dist(n,100000000);\n\t\tdist[s] = false;\n\t\twhile(1){\n\t\t\tint va = -1;\n\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\tif(used[j] == false && (va == -1 || dist[va] > dist[j]))\n\t\t\t\t\tva = j;\n\t\t\t}\n\t\t\tif(va == -1)\n\t\t\t\tbreak;\n\t\t\tused[va] = true;\n\t\t\tfor(int j = 0; j < n; j++)\n\t\t\t\tdist[j] = min(dist[j] , dist[va] + g[va][j]);\t\n\t\t}\n\n\t\tif(v > dist[d])\n\t\t\tcout << dist[d] + 1 << endl;\n\t\telse\n\t\t\tcout << \"NA\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3096,
"score_of_the_acc": -0.9975,
"final_rank": 13
},
{
"submission_id": "aoj_0144_2191501",
"code_snippet": "#define _USE_MATH_DEFINES\n#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<string>\n#include<iostream>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<stack>\n#include<queue>\n#include <algorithm>\n#include<math.h>\n#include<set>\n#include<map>\n#include<iomanip>\n\n//#include<bits/stdc++.h>\n\n\nusing namespace std;\n\n\n\nint main() {\n\n\tbool y[105][105] = {};\n\n\n\tint n; cin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint a,b; cin >> a>>b;\n\t\tfor (int j = 0; j < b; j++) {\n\t\t\tint z;\n\t\t\tcin >> z;\n\t\t\ty[a][z] = 1;\n\t\t}\n\t}\n\t\n\tint p; cin >> p;\n\tfor (int i = 0; i < p; i++) {\n\t\tint s, d, t;\n\t\tcin >> s >> d >> t;\n\t\tqueue<int>Q;\n\t\tQ.push(s);\n\t\tint h = 1;\n\t\tint R[105] = {};\n\t\tfor (int j = 0; j <= 102; j++)\n\t\t\tR[j] = 999999;\n\t\tR[s] = 1;\n\t\twhile (Q.size()) {\n\t\t\tint v = Q.front();\n\t\t\th = R[v];\n\t\t\th++;\n\t\t\n\t\t\t\n\t\t\tbool F[105] = {};\n\t\t\tfor (int j = 1; j <= n; j++) {\n\t\t\t\tif (y[v][j] && R[j] > h) {\n\t\t\t\t\tR[j] = h;\n\t\t\t\t\tQ.push(j);\n\t\t\t\t}\n\n\n\n\t\t\t}\n\t\t\tQ.pop();\t\n\t\t}\n/*\t\tfor (int j = 0; j < n; j++)\n\t\t\tcout << R[j] << \" \";*/\n\t\tif (R[d] <= t)cout << R[d] << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\t\n\treturn 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3100,
"score_of_the_acc": -0.9595,
"final_rank": 11
},
{
"submission_id": "aoj_0144_2173622",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cmath>\n#include<queue>\n#include<vector>\n#include<bits//stdc++.h>\n#include<functional>\nusing namespace std;\nstruct P{\n\tint cost,pos;\n};\nbool operator<(P a,P b) {return a.cost<b.cost;}\nbool operator>(P a,P b) {return a.cost>b.cost;}\nlong long a[101];\nconst long long inf=800000000;\nvector<long long>e[101];\nint main() {\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tint r,k,c;\n\t\tcin>>r>>k;\n\t\tfor(int i=0;i<k;i++){\n\t\t\tcin>>c;\n\t\t\te[r].push_back(c);\n\t\t}\n\t}\n\tint p;\n\tcin>>p;\n\tfor(int z=0;z<p;z++){\n\t\tint s,d,v;\n\t\tcin>>s>>d>>v;\n\t\tfill(a,a+n+1,inf);\n\t\tpriority_queue<P>p;\n\t\tp.push(P{1,s});\n\t\ta[s]=1;\n\t\twhile(!p.empty()){\n\t\t\tP t=p.top();p.pop();\n\t\t\tfor(int i=0;i<(int)e[t.pos].size();i++){\n\t\t\t\tif(a[t.pos]+1<a[e[t.pos][i]]){\n\t\t\t\t\ta[e[t.pos][i]]=a[t.pos]+1;\n\t\t\t\t\tp.push(P{a[t.pos]+1,e[t.pos][i]});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(a[d]<=v) cout<<a[d]<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3160,
"score_of_the_acc": -1.0299,
"final_rank": 14
},
{
"submission_id": "aoj_0144_2063097",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\n\n\nint main(){\n\n\tint n,r,k,to,table[101][101],num_of_packet,start,goal,t_limit,P[101],D[101],num,min,min_index,current,Distance[101][101];\n\n\tfor(int i=1; i < 101; i++){\n\t\tfor(int k=1; k < 101; k++){\n\t\t\ttable[i][k] = 0;\n\t\t\tDistance[i][k] = 1000000000;\n\t\t}\n\t}\n\n\tscanf(\"%d\",&n);\n\n\tfor(int i = 0; i < n; i++){\n\t\tscanf(\"%d %d\",&r,&k);\n\t\tfor(int p=0;p < k; p++){\n\t\t\tscanf(\"%d\",&to);\n\t\t\ttable[r][to] = 1;\n\t\t}\n\t}\n\n\tfor(int i = 1; i<= n; i++){\n\t\tfor(int k=1; k <= n; k++){\n\t\t\tif(i != k){\n\t\t\t\tstart = i, goal = k;\n\n\t\t\t\tfor(int index=1; index <= n; index++){\n\t\t\t\t\tP[index] = 0;\n\t\t\t\t\tD[index] = 1000000000;\n\t\t\t\t}\n\n\t\t\t\tP[start] = 1;\n\t\t\t\tnum = 1;\n\n\t\t\t\tfor(int index = 1; index <= n; index++){\n\t\t\t\t\tif(index != start && table[start][index] == 1){\n\t\t\t\t\t\tD[index] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\twhile(num < n){\n\t\t\t\t\tmin = 1000000000;\n\t\t\t\t\tfor(int index=1;index <= n; index++){\n\t\t\t\t\t\tif(P[index] == 0 && D[index] < min){\n\t\t\t\t\t\t\tmin = D[index];\n\t\t\t\t\t\t\tmin_index =index;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(min == 1000000000)break;\n\n\t\t\t\t\tP[min_index] = 1;\n\t\t\t\t\tcurrent = min_index;\n\t\t\t\t\tnum++;\n\t\t\t\t\tfor(int index=1; index <= n; index++){\n\t\t\t\t\t\tif(table[current][index] == 1){\n\t\t\t\t\t\t\tD[index] = (D[index] <= (D[current]+1))?D[index]:(D[current]+1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tDistance[start][goal] = D[goal];\n\t\t\t}\n\t\t}\n\t}\n\n\tscanf(\"%d\",&num_of_packet);\n\n\tfor(int i=0; i < num_of_packet; i++){\n\t\tscanf(\"%d %d %d\",&start,&goal,&t_limit);\n\n\t\tif(Distance[start][goal] >= t_limit){\n\t\t\tprintf(\"NA\\n\");\n\t\t}else{\n\t\t\tprintf(\"%d\\n\",Distance[start][goal]+1);\n\t\t}\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 2780,
"score_of_the_acc": -1.7976,
"final_rank": 16
},
{
"submission_id": "aoj_0144_2063072",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\n\n\nint main(){\n\n\tint n,r,k,to,table[101][101],num_of_packet,start,goal,t_limit,memo[101][101],P[101],D[101],num,min,min_index,current;\n\n\tfor(int i=1; i < 101; i++){\n\t\tfor(int k=1; k < 101; k++){\n\t\t\ttable[i][k] = 0;\n\t\t\tmemo[i][k] = 0;\n\t\t}\n\t}\n\n\tscanf(\"%d\",&n);\n\n\tfor(int i = 0; i < n; i++){\n\t\tscanf(\"%d %d\",&r,&k);\n\t\tfor(int p=0;p < k; p++){\n\t\t\tscanf(\"%d\",&to);\n\t\t\ttable[r][to] = 1;\n\t\t}\n\t}\n\n\tscanf(\"%d\",&num_of_packet);\n\n\tbool FLG;\n\n\tfor(int i=0; i < num_of_packet; i++){\n\t\tscanf(\"%d %d %d\",&start,&goal,&t_limit);\n\n\t\tFLG = false;\n\n\t\tif(t_limit <= 1){\n\t\t\tprintf(\"NA\\n\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(memo[start][goal] != 0){\n\t\t\tif(memo[start][goal] <= t_limit){\n\t\t\t\tprintf(\"%d\\n\",memo[start][goal]);\n\t\t\t}else{\n\t\t\t\tprintf(\"NA\\n\");\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\n\t\tfor(int index=1; index <= n; index++){\n\t\t\tP[index] = 0;\n\t\t\tD[index] = 1000000000;\n\t\t}\n\n\t\tP[start] = 1;\n\t\tnum = 1;\n\n\t\tfor(int index = 1; index <= n; index++){\n\t\t\tif(index != start && table[start][index] == 1){\n\t\t\t\tD[index] = 1;\n\t\t\t}\n\t\t}\n\n\t\tif(FLG)continue;\n\n\t\twhile(num < n){\n\t\t\tmin = 1000000000;\n\t\t\tfor(int index=1;index <= n; index++){\n\t\t\t\tif(P[index] == 0 && D[index] < min){\n\t\t\t\t\tmin = D[index];\n\t\t\t\t\tmin_index =index;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(min == 1000000000)break;\n\n\t\t\tP[min_index] = 1;\n\t\t\tcurrent = min_index;\n\t\t\tnum++;\n\t\t\tfor(int i=1; i <= n; i++){\n\t\t\t\tif(table[current][i] == 1){\n\t\t\t\t\tD[i] = (D[i] <= (D[current]+1))?D[i]:(D[current]+1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tif(D[goal] >= t_limit){\n\t\t\tprintf(\"NA\\n\");\n\t\t}else{\n\t\t\tmemo[start][goal] = D[goal]+1;\n\t\t\tprintf(\"%d\\n\",D[goal]+1);\n\t\t}\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2756,
"score_of_the_acc": -0.8254,
"final_rank": 6
},
{
"submission_id": "aoj_0144_2063067",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\n\n\nint main(){\n\n\tint n,r,k,to,table[101][101],num_of_packet,start,goal,t_limit,memo[101][101],P[101],D[101],num,min,min_index,current;\n\n\tfor(int i=1; i < 101; i++){\n\t\tfor(int k=1; k < 101; k++){\n\t\t\ttable[i][k] = 0;\n\t\t\tmemo[i][k] = 0;\n\t\t}\n\t}\n\n\tscanf(\"%d\",&n);\n\n\tfor(int i = 0; i < n; i++){\n\t\tscanf(\"%d %d\",&r,&k);\n\t\tfor(int p=0;p < k; p++){\n\t\t\tscanf(\"%d\",&to);\n\t\t\ttable[r][to] = 1;\n\t\t}\n\t}\n\n\tscanf(\"%d\",&num_of_packet);\n\n\tbool FLG;\n\n\tfor(int i=0; i < num_of_packet; i++){\n\t\tscanf(\"%d %d %d\",&start,&goal,&t_limit);\n\n\t\tFLG = false;\n\n\t\tif(t_limit <= 1){\n\t\t\tprintf(\"NA\\n\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(memo[start][goal] != 0){\n\t\t\tif(memo[start][goal] <= t_limit){\n\t\t\t\tprintf(\"%d\\n\",memo[start][goal]);\n\t\t\t}else{\n\t\t\t\tprintf(\"NA\\n\");\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\n\t\tfor(int index=1; index <= n; index++){\n\t\t\tP[index] = 0;\n\t\t\tD[index] = 1000000000;\n\t\t}\n\n\t\tP[start] = 1;\n\t\tnum = 1;\n\n\t\tfor(int index = 1; index <= n; index++){\n\t\t\tif(index != start && table[start][index] == 1){\n\t\t\t\tif(memo[index][goal] > 0 && memo[index][goal] + 1 <= t_limit){\n\t\t\t\t\tprintf(\"%d\\n\",memo[index][goal]+1);\n\t\t\t\t\tFLG = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tD[index] = 1;\n\t\t\t}\n\t\t}\n\n\t\tif(FLG)continue;\n\n\t\twhile(num < n){\n\t\t\tmin = 1000000000;\n\t\t\tfor(int index=1;index <= n; index++){ //??????????????°?????????????????????????????¢???\n\t\t\t\tif(P[index] == 0 && D[index] < min){ //?????????????????§?????????????????????????????????\n\t\t\t\t\tmin = D[index];\n\t\t\t\t\tmin_index =index;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(min == 1000000000)break; //?????????????????????????????????????????°break\n\n\t\t\tP[min_index] = 1; //min_index?????????????????¨??????\n\t\t\tcurrent = min_index;\n\t\t\tnum++; //???????????????????????°???1?¢???????\n\n\t\t\t/*if(memo[current][goal] > 0 && D[current]+memo[current][goal] <= t_limit){\n\t\t\t\tD[goal] = D[current]+memo[current][goal]-1;\n\t\t\t\tbreak;\n\t\t\t}*/\n\n\t\t\tfor(int i=1; i <= n; i++){\n\t\t\t\tif(table[current][i] == 1){\t//start???????????????????????¨???????????£????????????\n\t\t\t\t\tD[i] = (D[i] <= (D[current]+1))?D[i]:(D[current]+1); //?????????????????´??\\????????¢??¨???current????????±???????????¢???????????????D??¨??????\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tif(D[goal] >= t_limit){\n\t\t\tprintf(\"NA\\n\");\n\t\t}else{\n\t\t\tmemo[start][goal] = D[goal]+1;\n\t\t\tprintf(\"%d\\n\",D[goal]+1);\n\t\t}\n\n\t}\n\n return 0;\n}",
"accuracy": 0.6666666666666666,
"time_ms": 20,
"memory_kb": 2728,
"score_of_the_acc": -0.8113,
"final_rank": 19
},
{
"submission_id": "aoj_0144_2063042",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\n\n\nint main(){\n\n\tint n,r,k,to,table[101][101],num_of_packet,start,goal,t_limit,memo[101][101],P[101],D[101],num,min,min_index,current;\n\n\tfor(int i=1; i < 101; i++){\n\t\tfor(int k=1; k < 101; k++){\n\t\t\ttable[i][k] = 0;\n\t\t\tmemo[i][k] = 0;\n\t\t}\n\t}\n\n\tscanf(\"%d\",&n);\n\n\tfor(int i = 0; i < n; i++){\n\t\tscanf(\"%d %d\",&r,&k);\n\t\tfor(int p=0;p < k; p++){\n\t\t\tscanf(\"%d\",&to);\n\t\t\ttable[r][to] = 1;\n\t\t}\n\t}\n\n\tscanf(\"%d\",&num_of_packet);\n\n\n\tfor(int i=0; i < num_of_packet; i++){\n\t\tscanf(\"%d %d %d\",&start,&goal,&t_limit);\n\n\t\tif(t_limit <= 1){\n\t\t\tprintf(\"NA\\n\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(memo[start][goal] != 0){\n\t\t\tif(memo[start][goal] <= t_limit){\n\t\t\t\tprintf(\"%d\\n\",memo[start][goal]);\n\t\t\t}else{\n\t\t\t\tprintf(\"NA\\n\");\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\n\t\tfor(int index=1; index <= n; index++){\n\t\t\tP[index] = 0; //???????????????????????¨???????????????\n\t\t\tD[index] = 1000000000; //start??°?????????????????¢?????¨???????????????\n\t\t}\n\n\t\tP[start] = 1; //??????????????°????????????????????¨??????\n\t\tnum = 1;\n\n\t\tfor(int index = 1; index <= n; index++){\n\t\t\tif(index != start && table[start][index] == 1){\n\t\t\t\tD[index] = 1; //start??°???????????????????????????start??°??????????????¢1??¨??????\n\t\t\t}\n\t\t}\n\n\t\twhile(num < n){\n\t\t\tmin = 1000000000;\n\t\t\tfor(int index=1;index <= n; index++){ //??????????????°?????????????????????????????¢???\n\t\t\t\tif(P[index] == 0 && D[index] < min){ //?????????????????§?????????????????????????????????\n\t\t\t\t\tmin = D[index];\n\t\t\t\t\tmin_index =index;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(min == 1000000000)break; //?????????????????????????????????????????°break\n\n\t\t\tP[min_index] = 1; //min_index?????????????????¨??????\n\t\t\tcurrent = min_index;\n\t\t\tnum++; //???????????????????????°???1?¢???????\n\n\t\t\tfor(int i=1; i <= n; i++){\n\t\t\t\tif(table[current][i] == 1){\t//start???????????????????????¨???????????£????????????\n\t\t\t\t\tD[i] = (D[i] <= (D[current]+1))?D[i]:(D[current]+1); //?????????????????´??\\????????¢??¨???current????????±???????????¢???????????????D??¨??????\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tif(D[goal] >= t_limit){\n\t\t\tprintf(\"NA\\n\");\n\t\t}else{\n\t\t\tmemo[start][goal] = D[goal]+1;\n\t\t\tprintf(\"%d\\n\",D[goal]+1);\n\t\t}\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2792,
"score_of_the_acc": -0.8436,
"final_rank": 7
},
{
"submission_id": "aoj_0144_2061343",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <queue>\nusing namespace std;\n\n#define loop(i, n) for (int i = 0; i < n; i++)\n#define pb push_back \n\nint bfs(int s, int t, int c);\n\nvector<vector<int> > g(101);\n\nint main()\n{\n int n;\n cin >> n;\n loop(i, n) {\n int r, k, t;\n cin >> r >> k;\n loop(j, k) {\n cin >> t;\n g[r].pb(t);\n }\n }\n int p;\n cin >> p;\n loop (i, p) {\n int s, d, v;\n cin >> s >> d >> v;\n int ans = bfs(s, d, v);\n if (ans != -1) {\n cout << v-ans << endl;\n } else {\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}\n\nint bfs(int s, int t, int c)\n{\n vector<bool> check(101, false);\n queue<int> fq, nq, sq;\n fq.push(s);\n while (1) {\n c--;\n while (!fq.empty()) {\n int pos = fq.front(); fq.pop();\n if (check[pos]) {\n continue;\n } else {\n check[pos] = true;\n }\n //cout << pos << endl;\n if (pos == t) {\n return c;\n } else {\n for (int i: g[pos]) {\n nq.push(i);\n }\n }\n }\n if (c == 0) {\n return -1;\n }\n fq = nq;\n nq = sq;\n }\n}",
"accuracy": 0.6666666666666666,
"time_ms": 30,
"memory_kb": 3104,
"score_of_the_acc": -1.0415,
"final_rank": 20
},
{
"submission_id": "aoj_0144_1923526",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint d[101][101]={};\nint x[101];\nint n;\nvoid bfs(int);\nint main(){\n int p;\n int na[100];\n int to;\n int th;\n int st,go,ttl;\n //syoki\n for(int i=0;i<n;i++){\n x[i]=10000;\n }\n //in\n cin >> n;\n for(int i=0;i<n;i++){\n cin >> na[i] >> to;\n for(int j=0;j<to;j++){\n cin >> th;\n d[na[i]][th]=1;\n }\n \n }\n //in2\n cin >> p;\n for(int i=0;i<p;i++){\n for(int j=0;j<=n;j++){\n x[j]=10000;\n }\n \n cin>> st >> go >> ttl;\n x[st]=1;\n bfs(st);\n if(x[go]<=ttl && x[go]!=10000)cout << x[go] << endl;\n else cout << \"NA\" << endl;\n }\n return 0;\n}\n\n///bfs///////////////////////////////////////////\nvoid bfs(int s){\n queue<int>q;\n int u;\n q.push(s);\n while(!q.empty()){\n u=q.front();\n q.pop();\n for(int v=0;v<=n;v++){\n if(d[u][v]==1&&x[v]==10000){\n\tx[v]=x[u]+1;\n\tq.push(v);\n }\n }\n }\n return ;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1244,
"score_of_the_acc": -0.0202,
"final_rank": 2
},
{
"submission_id": "aoj_0144_1923516",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint d[101][101]={};\nint x[101];\nint n;\nvoid bfs(int);\nint main(){\n int p;\n int na[100];\n int to;\n int th;\n int st,go,ttl;\n //syoki\n for(int i=0;i<n;i++){\n x[i]=10000;\n }\n //in\n cin >> n;\n for(int i=0;i<n;i++){\n cin >> na[i] >> to;\n for(int j=0;j<to;j++){\n cin >> th;\n d[na[i]][th]=1;\n }\n \n }\n //in2\n cin >> p;\n for(int i=0;i<p;i++){\n for(int j=0;j<=n;j++){\n x[j]=10000;\n }\n \n cin>> st >> go >> ttl;\n x[st]=1;\n bfs(st);\n if(x[go]<=ttl)cout << x[go] << endl;\n else cout << \"NA\" << endl;\n }\n return 0;\n}\n\n///bfs///////////////////////////////////////////\nvoid bfs(int s){\n queue<int>q;\n int u;\n q.push(s);\n while(!q.empty()){\n u=q.front();\n q.pop();\n for(int v=0;v<=n;v++){\n if(d[u][v]==1&&x[v]==10000){\n\tx[v]=x[u]+1;\n\tq.push(v);\n }\n }\n }\n return ;\n}",
"accuracy": 0.6666666666666666,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0182,
"final_rank": 17
},
{
"submission_id": "aoj_0144_1923512",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint d[1000][1000]={};\nint x[100];\nint n;\nint nm=0;\nvoid bfs(int);\nint main(){\n int p;\n int na[100];\n int to;\n int th;\n int st,go,ttl;\n //syoki\n for(int i=0;i<n;i++){\n x[i]=10000;\n }\n //in\n cin >> n;\n for(int i=0;i<n;i++){\n cin >> na[i] >> to;\n if(na[i]>nm)nm=na[i];\n for(int j=0;j<to;j++){\n cin >> th;\n d[na[i]][th]=1;\n }\n \n }\n //in2\n cin >> p;\n for(int i=0;i<p;i++){\n for(int j=0;j<=nm;j++){\n x[j]=10000;\n }\n \n cin>> st >> go >> ttl;\n x[st]=1;\n bfs(st);\n if(x[go]<=ttl)cout << x[go] << endl;\n else cout << \"NA\" << endl;\n }\n return 0;\n}\n\n///bfs///////////////////////////////////////////\nvoid bfs(int s){\n queue<int>q;\n int u;\n q.push(s);\n while(!q.empty()){\n u=q.front();\n q.pop();\n for(int v=0;v<=nm;v++){\n if(d[u][v]==1&&x[v]==10000){\n\tx[v]=x[u]+1;\n\tq.push(v);\n }\n }\n }\n}",
"accuracy": 0.6666666666666666,
"time_ms": 10,
"memory_kb": 1576,
"score_of_the_acc": -0.1883,
"final_rank": 18
},
{
"submission_id": "aoj_0144_1900873",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <iomanip>\nusing namespace std;\nconst int INF = 10000000;\nint wf[101][101];\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint n;\n\tcin >> n;\n\tfor(int i = 1; i <= n; i++) {\n\t\tfor(int j = 1; j <= n; j++) {\n\t\t\twf[i][j] = i == j ? 0 : INF;\n\t\t}\n\t}\n\tfor(int i = 0; i < n; i++) {\n\t\tint a, t;\n\t\tcin >> a >> t;\n\t\twhile(t--) {\n\t\t\tint b;\n\t\t\tcin >> b;\n\t\t\twf[a][b] = 1;\n\t\t}\n\t}\n\n\tfor(int k = 1; k <= n; k++)\n\t\tfor(int i = 1; i <= n; i++)\n\t\t\tfor(int j = 1; j <= n; j++)\n\t\t\t\twf[i][j] = min(wf[i][j], wf[i][k] + wf[k][j]);\n\n\tint q;\n\tcin >> q;\n\twhile(q--) {\n\t\tint s, d, v;\n\t\tcin >> s >> d >> v;\n\t\tif(wf[s][d] >= v) {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << wf[s][d] + 1 << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0182,
"final_rank": 1
},
{
"submission_id": "aoj_0144_1847522",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <map>\n#include <climits>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\ntypedef pair<int,int> NODE;\n#define pos first\n#define distance second\n\nint n;\nbool info[100][100];\n\nint bfs(int s,int d){\n\tqueue<NODE> Q;\n\tbool done[100]={false};\n\t\n\tQ.push( make_pair(s,0) );\n\twhile( !Q.empty() ){\n\t\tNODE now = Q.front();\n\t\tQ.pop();\n\t\tdone[now.pos] = true;\n\n\t\tif(now.pos == d){\n\t\t\treturn now.distance;\n\t\t}\n\n\t\tfor(int next=0;next<n;next++){\n\t\t\tif(info[now.pos][next] && !done[next]){\n\t\t\t\tQ.push( make_pair(next,now.distance+1) );\n\t\t\t}\n\t\t}\n\t}\n\treturn INT_MAX;\n}\n\nint main(){\n\tint r,k,t,p,s,d,v;\n\t\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tcin >> r >> k;\n\t\tr--;\n\t\tfor(int j=0;j<k;j++){\n\t\t\tcin >> t;\n\t\t\tt--;\n\t\t\tinfo[r][t] = true;\n\t\t}\n\t}\t\n\t\n\tcin >> p;\n\tfor(int i=0;i<p;i++){\n\t\tcin >> s >> d >> v;\n\t\ts--;d--;\n\t\tif(v > bfs(s,d) )cout << bfs(s,d)+1 << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1224,
"score_of_the_acc": -0.0501,
"final_rank": 3
},
{
"submission_id": "aoj_0144_1785084",
"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\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 1000000007\n#define EPS 1e-10\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\n\nstruct edge{ \n\tint to, cost;\n\tedge(int to, int cost) :to(to), cost(cost){};\n};\nvector<edge> G[110];\n\nint n, r, k, t;\nint p, s, d, v;\n\nint dis[110];\n\nvoid dijkstra(int start){\n\tdis[start] = 0;\n\n\tpriority_queue<P> que;\n\tque.push(P(0, start));\n\n\twhile (!que.empty()){\n\t\tP p = que.top(); que.pop();\n\t\tint a = p.second;\n\n\t\tif (dis[a] < p.first)continue;\n\n\t\tfor (int i = 0; i < G[a].size(); i++){\n\t\t\tedge e = G[a][i];\n\t\t\tif (dis[e.to] > dis[a] + e.cost){\n\t\t\t\tdis[e.to] = dis[a] + e.cost;\n\t\t\t\tque.push(P(dis[e.to], e.to));\n\t\t\t}\n\n\t\t}\n\t}\n}\n\nint main(){\n\tcin >> n;\n\tREP(i, n){\n\t\tcin >> r >> k;\n\t\tREP(j, k){\n\t\t\tcin >> t;\n\t\t\tG[r].push_back(edge(t, 1));\n\t\t}\n\t}\n\tcin >> p;\n\tREP(i, p){\n\t\tREP(j, 110)dis[j] = INF;\n\t\tcin >> s >> d >> v;\n\t\tdijkstra(s);\n\t\tif (dis[d] + 1 <= v)cout << dis[d] + 1 << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1204,
"score_of_the_acc": -0.08,
"final_rank": 4
}
] |
aoj_0142_cpp
|
素数の性質
4 で割ると 3 あまる素数
n
(11、19、23 など) には、面白い性質があります。1 以上
n
未満の自然数 (1, 2,... ,
n
- 1) を 2 乗したものを
n
で割ったあまりを計算した結果を並べると、同じ数になるものがあるため、互いに異なった数の個数は、(
n
- 1)/2 になります。
この様にして得られた数の集合には、特別な性質があります。得られた数の集合から、互いに異なる 2 つ
a
と
b
を選んでその差を計算します。差が負になったときは、その差に
n
を足します。さらに結果が (
n
- 1)/2 より大きいときは、その差を
n
から引きます。
例えば、
n = 11
のとき 1 と 9 の差は、
1 − 9 = −8
→
−8 + n = −8 + 11 = 3
になります。9 と 1 の差も
9 −1 = 8
→
n − 8 = 11 − 8 = 3
で、同じ値 3 になります。この差は、円周上に 0, 1, ・・・,
n
- 1 を書いて、二つの数字の間の短い方の円弧を考えるとわかりやすくなります。(下図参照)
こうして得られた数の「差」は、1, 2, . . ., (
n
- 1)/2 のいずれかであり、同じ回数出現します。
【例】
n = 11
の時は、以下のようになります。
1 から
n
-1 までの数を 2 乗したものを
n
で割った余りを計算します。
1
2
= 1 → 1
2
2
= 4 → 4
3
2
= 9 → 9
4
2
= 16 → 5
5
2
= 25 → 3
6
2
= 36 → 3
7
2
= 49 → 5
8
2
= 64 → 9
9
2
= 81 → 4
10
2
= 100 → 1
a
,
b
の「差」の計算
1 で得られた 1, 3, 4, 5, 9 について異なる数同士の差を計算します。
計算結果が負の場合、
n
= 11 を加算します。
さらに、計算結果が (
n
-1)/2 = 5 より大きい場合
n
= 11 から減算します。
出現回数を求める
計算結果 1, 2, 3, 4, 5 の出現回数をそれぞれ数え上げます。
これらの計算結果から 1, 2, 3, 4, 5 の出現回数が 4 回であることがわかります。この性質は 4 で割ると 3 あまる素数特有の性質であり 4 で割ると 1 あまる素数ではこのようなことはおきません。このことを確認するため、10000 以下の奇数
n
を入力とし、例題にあるような計算 (
n
で割ったあまりの 2 乗の差の頻度を求める)を実行し、その出現回数を出力するプログラムを作成してください。
Input
複数のデータセットが与えられます。各データセットとして１つの整数
n
(
n
≤ 10000) が１行に与えられます。入力は 0 を１つ含む行でおわります。
Output
各データセットについて、出現頻度を以下の形式で出力してください。
剰余の平方の差が 1 である(
a, b
)の出現個数(整数)
剰余の平方の差が 2 である(
a, b
)の出現個数(整数)
:
:
剰余の平方の差が (
n
-1)/2 である(
a, b
)の出現個数(整数)
Sample Input
11
15
0
Output for the Sample Input
4
4
4
4
4
2
2
4
2
4
4
2
|
[
{
"submission_id": "aoj_0142_9058431",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n while (cin >> n, n) {\n int m = (n+1)/2;\n vector<int> res(m);\n vector<int> v;\n for (int i = 1; i < n; ++i) {\n v.push_back(i*i%n);\n }\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n for (int i : v) {\n for (int j : v) {\n if (i == j) continue;\n int val = (i - j + n) % n;\n if (val > (n-1)/2) val = n - val;\n res[val] += 1;\n }\n }\n for (int i = 1; i < m; ++i) {\n cout << res[i] << \"\\n\";\n }\n }\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3504,
"score_of_the_acc": -1.0065,
"final_rank": 15
},
{
"submission_id": "aoj_0142_6981995",
"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 1000000000000000\n\n\n\nint main(){\t\n\n\t\n\twhile(true){\n\t\tint n;\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tvector<int> t;\n\t\tfor(int i=1;i<n;i++){\n\t\t\tt.push_back((i*i)%n);\n\t\t}\n\t\tsort(t.begin(),t.end());\n\t\tt.erase(unique(t.begin(),t.end()),t.end());\n\t\tvector<int> cnt(n/2+1);\n\t\trep(i,t.size()){\n\t\t\tfor(int j=i+1;j<t.size();j++){\n\t\t\t\tint d = t[j] - t[i];\n\t\t\t\tif(d>n/2)d = n-d;\n\t\t\t\tcnt[d]++;\n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<cnt.size();i++)cout<<cnt[i]*2<<endl;\n\t}\n\t\n\treturn 0;\n\t\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3428,
"score_of_the_acc": -0.7403,
"final_rank": 10
},
{
"submission_id": "aoj_0142_6944744",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<int> b, ans((n + 1) / 2);\n for(int i = 1; i < n; i++)b.push_back(i * i % n);\n sort(b.begin(), b.end());\n b.erase(unique(b.begin(), b.end()), b.end());\n auto f = [&](int i, int j){\n int res = j - i;\n if(res < 0)res += n;\n if(res > (n - 1) / 2)res = n - res;\n return res;\n };\n for(int i = 0; i < b.size(); i++){\n for(int j = 0; j < b.size(); j++){\n if(i == j)continue;\n ans[f(b[i], b[j])]++;\n }\n }\n for(int i = 1; i < ans.size(); i++){\n cout << ans[i] << '\\n';\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3288,
"score_of_the_acc": -0.5447,
"final_rank": 8
},
{
"submission_id": "aoj_0142_6390096",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <random>\n#include <array>\n#include <climits>\n#include <map>\n#include <cassert>\n#include <stack>\n#include <iomanip>\n#include <cfloat>\n#include <bitset>\n#include <fstream>\n#include <chrono>\n\nstd::vector<int> solve(const int n) {\n\tconst auto half = (n - 1) >> 1;\n\tstd::vector<int> count(half);\n\tstd::vector<int> num; num.reserve(n - 1);\n\tfor (auto i = 1; i < n; ++i) {\n\t\tconst auto r = i * i % n;\n\t\tnum.push_back(r);\n\t}\n\tstd::sort(num.begin(), num.end());\n\tnum.erase(std::unique(num.begin(), num.end()), num.end());\n\tfor (auto i = 0; i < num.size(); ++i) {\n\t\tfor (auto j = 0; j < i; ++j) {\n\t\t\tconst auto r = (num[i] - num[j]) % n;\n\t\t\tif (r > 0) count[(r > half) ? n - r - 1: r - 1] += 2;\n\t\t}\n\t}\n\treturn count;\n}\nint main() {\n\twhile (true) {\n\t\tint n; std::cin >> n;\n\t\tif (n == 0) break;\n\t\tfor (const auto r : solve(n)) {\n\t\t\tstd::cout << r << '\\n';\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3468,
"score_of_the_acc": -0.8528,
"final_rank": 14
},
{
"submission_id": "aoj_0142_5761327",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<sstream>\n#include<regex>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-10;\nsigned main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tint cnt[5000]={};\n\t\tset<int>st;\n\t\tvector<int>v;\n\t\tfor(int i=1;i<n;i++)\n\t\t\tst.insert(i*i%n);\n\t\tfor(auto x:st)\n\t\t\tv.push_back(x);\n\t\tfor(int i=0;i<v.size();i++){\n\t\t\tfor(int j=0;j<v.size();j++){\n\t\t\t\tif(i==j)\n\t\t\t\t\tcontinue;\n\t\t\t\tint d=abs(v[i]-v[j]);\n\t\t\t\td=min(d,n-d);\n\t\t\t\tcnt[d]++;\n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<=n/2;i++)\n\t\t\tcout<<cnt[i]<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3588,
"score_of_the_acc": -1.0476,
"final_rank": 16
},
{
"submission_id": "aoj_0142_5151543",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<int> a;\n for(int i=1; i<n; i++){\n a.push_back(i*i % n);\n }\n sort(a.begin(), a.end());\n a.erase(unique(a.begin(), a.end()), a.end());\n \n int m = a.size();\n vector<int> ans(n, 0);\n for(int i=0; i<m; i++){\n for(int j=0; j<m; j++){\n if(i == j) continue;\n int diff = a[i]-a[j];\n if(diff < 0) diff += n;\n if(diff > (n-1)/2) diff = n-diff;\n ans[diff]++;\n }\n }\n for(int i=1; i<=(n-1)/2; i++){\n cout << ans[i] << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3476,
"score_of_the_acc": -0.8499,
"final_rank": 13
},
{
"submission_id": "aoj_0142_4599232",
"code_snippet": "#include <iostream>\n#include <set>\n#include <vector>\n#include <algorithm>\n\nint main()\n{\n\tint n;\n\twhile (true) {\n\t\tstd::cin >> n;\n\t\tif (n==0) break;\n\t\t\n\t\tstd::set<int> rem;\n\t\tfor (int i=1; i<=n/2; i++) {\n\t\t\trem.insert((i*i)%n);\n\t\t}\n\t\tstd::vector<int> v(n/2);\n\t\tfor (std::set<int>::iterator it1 = rem.begin(); it1 != rem.end(); ++it1) {\n\t\t\tint a = *it1;\n\t\t\tfor (std::set<int>::iterator it2 = rem.begin(); it2 != rem.end(); ++it2) {\n\t\t\t\tif (it1 == it2) continue;\n\t\t\t\tint b = *it2;\n\t\t\t\tint d = a-b;\n\t\t\t\tif (d<0) d += n;\n\t\t\t\tif (d>n/2) d = n - d;\n\t\t\t\tv[d-1]++;\n\t\t\t}\n\t\t}\n\t\tfor (int i=0; i<n/2; i++) std::cout << v[i] << std::endl;\n\t}\n\t\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 430,
"memory_kb": 3252,
"score_of_the_acc": -1.0895,
"final_rank": 17
},
{
"submission_id": "aoj_0142_4434073",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<int> v((n+1)/2);\n vector<int> a;\n for (int i = 1; i < n; ++i) {\n a.emplace_back(i*i%n);\n }\n sort(a.begin(), a.end());\n a.erase(unique(a.begin(), a.end()), a.end());\n for (int i = 0; i < a.size(); ++i) {\n for (int j = 0; j < a.size(); ++j) {\n if(i == j) continue;\n int val = (a[i]-a[j]+n)%n;\n if(val > (n-1)/2) val = n-val;\n v[val]++;\n }\n }\n for (int i = 1; i < v.size(); ++i) {\n printf(\"%d\\n\", v[i]);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 3292,
"score_of_the_acc": -0.71,
"final_rank": 9
},
{
"submission_id": "aoj_0142_4313565",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nvoid calc(int n);\n\nint main(void){\n int n;\n while(true){\n cin>>n;\n if(n==0){break;}\n calc(n);\n }\n return 0;\n}\n\nvoid calc(int n){\n int mod[n];\n for(int i=0;i<n;i++){\n mod[i]=0;\n }\n for(int i=1;i<n;i++){\n mod[(i*i)%n]=1;\n }\n int retval[1+n/2];\n for(int i=0;i<=n/2;i++){\n retval[i]=0;\n }\n for(int i=0;i<n;i++){\n if(mod[i]==0){\n continue;\n }\n for(int j=i+1;j<n;j++){\n if(mod[j]==0){\n continue;\n }\n int d=j-i;\n if(d<0){\n d+=n;\n }\n if(d>n/2){\n d=n-d;\n }\n retval[d]++;\n }\n }\n for(int i=1;i<=n/2;i++){\n cout<<retval[i]*2<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3064,
"score_of_the_acc": -0.3716,
"final_rank": 5
},
{
"submission_id": "aoj_0142_4223806",
"code_snippet": "#include<iostream>\n#include<set>\n#include<cstring>\n\nusing namespace std;\n\nset<int> SubData;\nset<int>::iterator it,tmp;\nint CntData[10000];\n\nvoid solve(int n, int limit) {\n\tint result;\n\n //cout<<\"result_before: \"<<*it<<\"-\"<<*tmp<<\"=\"<<result<<endl;\n\tresult = *it - *tmp;\n\twhile (result<0 || result>limit) {\n\t\tif (result < 0) {\n\t\t\tresult += n;\n\t\t}\n\t\telse if (result > limit) {\n\t\t\tresult = n - result;\n\t\t}\n\t}\n\t//cout<<\"result_after:\"<<result<<endl;\n\tCntData[result]++;\n}\n\nint main() {\n\tint n, limit;\n\n\twhile (cin >> n, n) {\n\t\tSubData.clear();\n\t\tmemset(CntData, 0, sizeof(CntData));\n\t\tlimit = (n - 1) / 2;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tSubData.insert((i*i) % n);\n\t\t}\n\t\tfor (it = SubData.begin(); it != SubData.end(); it++) {\n\t\t\tfor (tmp = SubData.begin(); tmp != SubData.end(); tmp++) {\n\t\t\t\tif (*tmp == *it) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tsolve(n, limit);\n\t\t\t}\n\t\t}\n\t\tlimit++;\n\t\tfor (int i = 1; i < limit; i++) {\n\t\t\tif (CntData[i] != 0) {\n\t\t\t\tcout << CntData[i] << endl;\n\t\t\t}\n\t\t}\n\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 3288,
"score_of_the_acc": -1.4812,
"final_rank": 20
},
{
"submission_id": "aoj_0142_3583030",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\nconstexpr long double PI = acos(-1);\nconstexpr long double EPS = 1e-15;\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 rep(i,a,b) for (int i = (a); i < (b); i++)\n#define rrep(i,a,b) for (int i = (a); i >= (b); i--)\n#define REP(i,n) rep(i,0,n)\n#define RREP(i,n) rrep(i,n,0)\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 n;\n\nint main(){\n while(cin >> n, n){\n bitset<11234> a;\n rep(i, 1, n) a[i * i % n] = 1;\n for(int i = 1; i <= n / 2; ++i){\n int cnt = 0;\n REP(j, n) if(a[j] && a[(j + i) % n]) ++cnt;\n cout << cnt * 2 << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 660,
"memory_kb": 3080,
"score_of_the_acc": -1.1753,
"final_rank": 18
},
{
"submission_id": "aoj_0142_3580744",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <map>\n\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\n#ifdef _DEBUG_\n#define dump(val) cerr << __LINE__ << \":\\t\" << #val << \" = \" << (val) << endl\n#else\n#define dump(val)\n#endif\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntemplate<typename T>\nvector<T> make_v(size_t a, T b) {\n return vector<T>(a, b);\n}\ntemplate<typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n return vector<decltype(make_v(ts...))>(a, make_v(ts...));\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n while (cin >> n, n) {\n vector<int> v(n - 1, 0);\n REP(i, 0, n - 1) {\n v[i] = ((i + 1) * (i + 1)) % n;\n }\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n vector<int> m(n, 0);\n REP(i, 0, v.size()) {\n REP(j, 0, v.size()) {\n if (i == j) continue;\n int diff = v[i] - v[j];\n if (diff < 0) {\n diff += n;\n }\n if ((n - 1) / 2 < diff) {\n diff = n - diff;\n }\n m[diff] += 1;\n }\n }\n REP(i, 1, (n - 1) / 2 + 1) {\n cout << m[i] << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3216,
"score_of_the_acc": -0.4755,
"final_rank": 7
},
{
"submission_id": "aoj_0142_3450834",
"code_snippet": "#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <cmath>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e9 + 7;\n\nint main(){\n while(true){\n int n;\n cin >> n;\n if(n == 0){\n break;\n }\n map<int, bool> m;\n for(int i = 1; i < n; i++){\n m[(i * i) % n] = true;\n }\n vector<int> v;\n for(pair<int, bool> p : m){\n v.push_back(p.first);\n }\n int cnt[11000] = {};\n for(int i = 0; i < v.size(); i++){\n for(int j = 0; j < v.size(); j++){\n if(i == j){\n continue;\n }\n int num = v[i] - v[j];\n if(num < 0){\n num += n;\n }\n if(num > (n - 1) / 2){\n num = n - num;\n }\n cnt[num] += 1;\n }\n }\n for(int i = 1; i <= (n - 1) / 2; i++){\n cout << cnt[i] << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3376,
"score_of_the_acc": -0.7511,
"final_rank": 11
},
{
"submission_id": "aoj_0142_3312469",
"code_snippet": "#include <stdio.h>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N=1e4+10;\n#define PB push_back\nint abs(int n){return n>0?n:-n;}\nint main(){\n int n,a[N],mid,temp;\n set<int> s;\n vector<int> v;\n while(scanf(\"%d\",&n)!=EOF){\n if(n==0)return 0;\n s.clear();\n v.clear();\n for(int i=1;i<n;i++)s.insert((i*i)%n);\n mid=n>>1;\n for(int i=1;i<=mid;i++)a[i]=0;\n for(int i:s)v.PB(i);\n for(int i=0;i<v.size();i++)for(int j=0;j<v.size();j++)if(i!=j){\n temp=abs(v[j]-v[i]);\n if(temp>mid)a[n-temp]++;\n else a[temp]++;\n }\n for(int i=1;i<=mid;i++)printf(\"%d\\n\",a[i]);\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3036,
"score_of_the_acc": -0.1515,
"final_rank": 3
},
{
"submission_id": "aoj_0142_3033439",
"code_snippet": "#include<iostream>\n#include<set>\nusing namespace std;\nint n;\nmain()\n{\n\twhile(cin>>n,n)\n\t{\n\t\tset<int>M;\n\t\tfor(int i=1;i<n;i++)M.insert(i*i%n);\n\t\tint cnt[5555]={};\n\t\tfor(int a:M)\n\t\t{\n\t\t\tfor(int b:M)\n\t\t\t{\n\t\t\t\tif(a==b)continue;\n\t\t\t\tint d=a-b;\n\t\t\t\tif(d<0)d+=n;\n\t\t\t\tif(d>n/2)d=n-d;\n\t\t\t\tcnt[d]++;\n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<=n/2;i++)cout<<cnt[i]<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 3264,
"score_of_the_acc": -1.2042,
"final_rank": 19
},
{
"submission_id": "aoj_0142_3016290",
"code_snippet": "#include <iostream>\n#include <map>\n#include <set>\n#include <cstring>\n\nusing namespace std;\n\nconst int N = 10000;\nint cnt[N] = { 0 }, ans[N / 2 + 1] = { 0 };\n\nint main(){\n\tint n;\n\twhile(cin >> n, n) {\n\t\t// memset(cnt, 0, sizeof(cnt));\n\t\tmemset(ans, 0, sizeof(ans));\n\t\tset<int> k;\n\t\tfor(int i = 1;i < n;++i){\n\t\t\tint a = i % n;\n\t\t\tint v = (a * a) % n;\n\t\t\t// cnt[v]++;\n\t\t\tk.insert(v);\n\t\t}\n\t\tfor(auto f = k.begin();f != k.end();++f){\n\t\t\tfor(auto b = next(f, 1);b != k.end();++b){\n\t\t\t\tint diff = (*b - *f);\n\t\t\t\t// cout << \"diff : \" << diff << endl;\n\t\t\t\tif(diff > (n - 1) / 2) {\n\t\t\t\t\tdiff = n - diff;\n\t\t\t\t}\n\t\t\t\tans[diff] += 2;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 1;i <= (n - 1) / 2;++i){\n\t\t\tcout << ans[i] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 3288,
"score_of_the_acc": -0.8304,
"final_rank": 12
},
{
"submission_id": "aoj_0142_3005832",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n while(1){\n int n;\n cin >> n;\n\n if(n == 0) break;\n\n bool appear[n+1] = {};\n for(int i = 1; i < n; i++){\n appear[(i*i)%n] = true;\n }\n\n vector<int> p;\n for(int i = 0; i <= n; i++){\n if(appear[i]) p.push_back(i);\n }\n\n int len = p.size();\n int ans[(n-1)/2 + 1] = {};\n\n for(int i = 0; i < len; i++){\n for(int j = 0; j < len; j++){\n if(i == j) continue;\n int diff = p[i] - p[j];\n if(diff < 0) diff += n;\n if(diff > (n-1)/2) diff = n - diff;\n ans[diff]++;\n }\n }\n\n for(int i = 1; i <= (n-1)/2; i++){\n cout << ans[i] << endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3080,
"score_of_the_acc": -0.2547,
"final_rank": 4
},
{
"submission_id": "aoj_0142_2638195",
"code_snippet": "#include <cstdio> // printf(), scanf()\n#include <set>\n\nusing namespace std;\n\nconst int MAX_N = 10000;\nconst int MAX_R = 5000;\n\nvoid\nsolve(int n)\n{\n\tint bins[MAX_N / 2];\n\tset<int> remains;\n\tint re[MAX_R];\n\n\tint ix = 0;\n\tfor (int i = 1; i < n; ++i)\n\t{\n\t\tint r = (i * i) % n;\n\n\t\tif (remains.find(r) == remains.end())\n\t\t{\n\t\t\tremains.insert(r);\n\t\t\tre[ix++] = r;\n\t\t}\n\t}\n\n\tint m = (n - 1) / 2;\n\tfor (int i = 1; i <= m; ++i)\n\t\tbins[i] = 0;\n\n\tfor (int i = 0; i < ix; ++i)\n\t{\n\t\tfor (int j = i + 1; j < ix; ++j)\n\t\t{\n\t\t\tif (i != j)\n\t\t\t{\n\t\t\t\tint d = re[i] - re[j];\n\t\t\t\tif (d < 0)\n\t\t\t\t\td += n;\n\n\t\t\t\tif (d > m)\n\t\t\t\t\td = n - d;\n\n\t\t\t\tbins[d]++;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int i = 1; i <= m; ++i)\n\t\tprintf(\"%d\\n\", 2 * bins[i]);\n}\n\nint\nmain(int argc, char **argv)\n{\n\twhile (true)\n\t{\n\t\tint n;\n\t\tscanf(\"%d\", &n);\n\t\tif (n == 0)\n\t\t\tbreak;\n\n\t\tsolve(n);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3036,
"score_of_the_acc": -0.1198,
"final_rank": 2
},
{
"submission_id": "aoj_0142_2638193",
"code_snippet": "#include <cstdio> // printf(), scanf()\n#include <set>\n\nusing namespace std;\n\nconst int MAX_N = 10000;\nconst int MAX_R = 5000;\n\nvoid\nsolve(int n)\n{\n\tint bins[MAX_N / 2];\n\tset<int> remains;\n\tint re[MAX_R];\n\n\tint ix = 0;\n\tfor (int i = 1; i < n; ++i)\n\t{\n\t\tint r = (i * i) % n;\n\n\t\tif (remains.find(r) == remains.end())\n\t\t{\n\t\t\tremains.insert(r);\n\t\t\tre[ix++] = r;\n\t\t}\n\t}\n\n\tint m = (n - 1) / 2;\n\tfor (int i = 1; i <= m; ++i)\n\t\tbins[i] = 0;\n\n\tfor (int i = 0; i < ix; ++i)\n\t{\n\t\tfor (int j = 0; j < ix; ++j)\n\t\t{\n\t\t\tif (i != j)\n\t\t\t{\n\t\t\t\tint d = re[i] - re[j];\n\t\t\t\tif (d < 0)\n\t\t\t\t\td += n;\n\n\t\t\t\tif (d > m)\n\t\t\t\t\td = n - d;\n\n\t\t\t\tbins[d]++;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int i = 1; i <= m; ++i)\n\t\tprintf(\"%d\\n\", bins[i]);\n}\n\nint\nmain(int argc, char **argv)\n{\n\twhile (true)\n\t{\n\t\tint n;\n\t\tscanf(\"%d\", &n);\n\t\tif (n == 0)\n\t\t\tbreak;\n\n\t\tsolve(n);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 2972,
"score_of_the_acc": -0.0952,
"final_rank": 1
},
{
"submission_id": "aoj_0142_2630289",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nbool exists(vector<int> v, int n) {\n for (int i = 0; i < v.size(); i++) {\n if (v[i] == n) return true;\n }\n return false;\n}\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (!n) return 0;\n int count[(n - 1) / 2 + 1];\n vector<int> mod;\n for (int i = 0; i < (n - 1) / 2 + 1; i++) {\n count[i] = 0;\n }\n for (int i = 1; i < n; i++) {\n int res = (i * i) % n;\n if (!exists(mod, res)) {\n mod.push_back(res);\n }\n }\n for (int i = 0; i < mod.size(); i++) {\n for (int j = 0; j < mod.size(); j++) {\n if (i == j) continue;\n int res = mod[i] - mod[j];\n if (res < 0) res += n;\n if (res > (n - 1) / 2) res = n - res;\n count[res]++;\n }\n }\n for (int i = 1; i < (n - 1) / 2 + 1; i++) {\n cout << count[i] << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3168,
"score_of_the_acc": -0.4452,
"final_rank": 6
}
] |
aoj_0155_cpp
|
スパイダー人
正義のヒーロー「スパイダー人」は、腕からロープを出してビルからビルへ飛び移ることができます。しかし、ロープが短いので自分からの距離が 50 以下のビルにしか移動できません。それより遠くのビルに移動するには、一旦別のビルに飛び移らなくてはなりません。
ビルの数
n
、
n
個のビルの情報、スパイダー人の移動開始位置及び目的地を入力とし、その移動の最短経路を出力するプログラムを作成してください。どのようにビルを経由しても目標のビルに移動できない場合は NA と出力してください。各ビルは点として扱い、最短距離で移動するビルの経由方法が２つ以上存在することはないものとします。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
b
1
x
1
y
1
b
2
x
2
y
2
:
b
n
x
n
y
n
m
s
1
g
1
s
2
g
2
:
s
m
g
m
１行目にビルの数
n
(1 ≤
n
≤ 100)、続く
n
行に
i
番目のビルのビル番号
b
i
(1 ≤
b
i
≤
n
)、そのビルのx座標とy座標を表す整数
x
i
,
y
i
(-1000 ≤
x
i
,
y
i
≤ 1000) が空白区切りで与えられます。
続く行に移動情報の個数
m
(1 ≤
m
≤ 100)、続く
m
行に
i
番目の移動情報が与えられます。各移動情報として、移動を開始するビルの番号
s
i
と目的地ビルの番号
g
i
が空白区切りで与えられます。
データセットの数は 10 を超えません。
Output
入力データセットごとに次の形式で出力します。
i
行目に
i
番目の移動情報に対する経路または NA を１行に出力します。各経路は以下の形式で出力します。
s
i
br
i1
br
i2
...
g
i
br
ij
は
i
番目の移動情報における、
j
番目に経由するビルの番号を表します。
Sample Input
4
1 0 0
2 30 0
3 60 40
4 0 60
2
1 3
1 4
22
1 0 0
2 150 40
3 30 20
4 180 150
5 40 80
6 130 130
7 72 28
8 172 118
9 50 50
10 160 82
11 90 105
12 144 131
13 130 64
14 80 140
15 38 117
16 190 90
17 60 100
18 100 70
19 130 100
20 71 69
21 200 110
22 120 150
1
1 22
0
Output for the Sample Input
1 2 3
NA
1 3 9 20 11 6 22
|
[
{
"submission_id": "aoj_0155_4066976",
"code_snippet": "#include <iostream>\n#include <complex>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\n#define INF 10e6\n#define X real()\n#define Y imag()\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\ntypedef complex<double> P;\n\n\nint n; //ビルの数\nP build[1001]; //ビルの座標\ndouble graph[1001][1001];//距離グラフ\ndouble d[1001]; //最短距離\nint prev[1001]; //経路\nbool used[1001]; //\t訪問済み\n\nvoid initial(){\n\tfor(int i=0;i<1001;i++)\n\t\tfor(int j=0;j<1001;j++)\n\t\t\tgraph[i][j]=(abs(build[i]-build[j]))<=50.0?abs(build[i]-build[j]):INF;\n\treturn ;\n}\n\nvoid dijkstra(int s){\n\tfill(d,d+1001,INF);\n\tfill(used,used+1001,false);\n\tfill(prev,prev+1001,-1);\n\td[s]=0;\n\t\n\twhile(true){\n\t\tint v=-1;\n\t\tfor(int u=0;u<n;u++){\n\t\t\tif(!used[u]&&(v==-1||d[u]<d[v]))v=u;\n\t\t}\n\t\tif(v==-1)\n\t\t\tbreak;\n\t\tused[v]=true;\n\t\tfor(int u=0;u<n;u++){\n\t\t\tif(d[u]>d[v]+graph[u][v])\n\t\t\t\td[u]=d[v]+graph[u][v],prev[u]=v;\n\t\t}\n\t}\n\treturn ;\n}\n\nvector<int> get_path(int t){\n\tvector<int> path;\n\tfor(;t!=-1;t=prev[t])path.push_back(t);\n\treverse(path.begin(),path.end());\n\treturn path;\n\n}\n\nint main(){\n\tint tem,m;\n\twhile(cin >> n,n){\n\t\tfor(int i=0;i<n;i++)\n\t\t\tcin >>tem,cin >>build[tem-1].X>> build[tem-1].Y;\n\t\tinitial();\n\t\tcin >> m;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tint s,g,c;\n\t\t\tvector<int> root;\n\t\t\tcin >> s >> g;\n\t\t\tdijkstra(s-1);\n\t\t\tif(d[g-1]>=INF)\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\telse{\n\t\t\t\troot=get_path(g-1);\n\t\t\t\tc=0;\n\t\t\t\tEACH(j,root)\n\t\t\t\t\tcout<< (c? \" \":\"\") << (*j)+1,c++;\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n\nreturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 11072,
"score_of_the_acc": -0.3704,
"final_rank": 1
},
{
"submission_id": "aoj_0155_1500804",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cmath>\n\nusing namespace std;\n\nint n, m, b, i, j, x, y, s, g;\nvector <pair <int, int> > map(1000);\nvector <int> from(1000, 1001);\n\ndouble dist(int mi, int j) {\n double d = sqrt(1.0 * (map[j].first - map[mi].first) * (map[j].first - map[mi].first) + (map[j].second - map[mi].second) * (map[j].second - map[mi].second));\n if(d <= 50) return d;\n else return 100000000;\n} \n\ndouble dik(){\n int f[1000] = {};\n int mi = s;\n vector <int> cost(1000, 100000000);\n cost[mi] = 0;\n \n for(i = 0; i < 1000; i++) {\n f[mi] = 1;\n \n for(j = 0; j < 1000; j++)\n if(!f[j] && map[j].first != 100000000 && cost[j] > cost[mi] + dist(mi, j)) {\n cost[j] = cost[mi] + dist(mi, j);\n from[j] = mi;\n }\n int min = 200000000;\n for(j = 0; j < 1000; j++)\n if(!f[j] && min > cost[j]) min = cost[mi = j];\n }\n return cost[g];\n\n}\n\n\nint main(){\n while(cin >> n, n != 0) {\n for(i = 0; i < 1000; i++) {\n map[i].first = 100000000; map[i].second = 100000000;\n }\n \n while(n--){\n cin >> b >> x >> y; b--; x--; y--;\n map[b].first = x; map[b].second = y;\n }\n \n cin >> m;\n while(m--) {\n cin >> s >> g; s--; g--;\n int ans[1000] = {};\n for(i = 0; i < 1000; i++) from[i] = 1001;\n if(dik() != 100000000) {\n\t\n\tfor(i = g,j = 0; i < 1000; j++){\n\t ans[j] = from[i] + 1;\n\t i = from[i];\n\t}\n\t//\tcout << ans[0] << ' ' << ans[1] <<' '<< ans[2] << ' ' << ans[3] << endl;\n\tfor(i = j - 2; i >= 0; i--) cout << ans[i] << ' ';\n\tcout << g + 1 << endl;\n }\n \n else cout << \"NA\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1220,
"score_of_the_acc": -0.5556,
"final_rank": 2
},
{
"submission_id": "aoj_0155_1497324",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF 999999999\n\npii d[2000];\nbool used[2000];\ndouble pass[2000][2000];\nint n;\n\nvoid dijk(int s){\n rep(i,2000)d[i]=pii(INF,-1);\n rep(i,2000)used[i]=false;\n d[s]=pii(0,-1);\n \n while (1) {\n int v=-1;\n rep(u,n){\n if( !used[u]&&(v==-1||d[u].first<d[v].first) )v=u;\n }\n \n if(v==-1)break;\n \n used[v]=true;\n \n rep(u,n){\n if( d[u].first>d[v].first+pass[v][u] )\n d[u] = pii( d[v].first+pass[v][u] , v );\n }\n }\n}\n\n\nint main(){\n while(cin>>n){\n if(n==0)break;\n \n rep(i,2000)rep(j,2000) pass[i][j]=INF;\n int b[2000],x[2000],y[2000];\n double res;\n rep(i,n){\n cin>>b[i]>>x[i]>>y[i];\n }\n rep(i,n){\n rep(j,n){\n if(i==j)\n pass[b[i]-1][b[i]-1]=0;\n else if( ( res=sqrt( (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]) ) )<=50+1e-9 ){\n pass[b[i]-1][b[j]-1]=res;\n pass[b[j]-1][b[i]-1]=res;\n }\n }\n }\n int m;\n cin>>m;\n rep(i,m){\n int s,g;\n cin>>s>>g;\n s--,g--;\n dijk(s);\n if(d[g].first==INF){cout<<\"NA\"<<endl;continue;}\n int tmp = g;\n vector<int> ans;\n while(tmp!=s){\n ans.pb(tmp);\n tmp = d[tmp].second;\n }\n ans.pb(s);\n reverse(all(ans));\n rep(i,ans.size()){\n if(i!=0)cout<<\" \";\n cout<<ans[i]+1;\n }\n cout<<endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 32508,
"score_of_the_acc": -1,
"final_rank": 4
},
{
"submission_id": "aoj_0155_1234839",
"code_snippet": "#include<iostream>\n#include<complex>\n#include<map>\n#include<vector>\n#include<algorithm>\n#define INF 20000000\nusing namespace std;\ntypedef complex<double> P;\nmap<int,P>data;\ndouble gr[1200][1200];\n\n\nint prev[1200];\ndouble d[1200];\nint used[1200];\nvoid dijkstra(int s){\n\tfill(d,d+1200,INF);\n\tfill(used,used+1200,false);\n\tfill(prev,prev+1200,-1);\n\td[s]=0;\n\twhile(true){\n\t\tint v=-1;\n\t\tfor(int u=0;u<1200;u++){\n\t\t\tif(!used[u]&&(v==-1||d[u]<d[v]))v=u;\n\t\t}\n\t\tif(v==-1)break;\n\t\tused[v]=true;\n\t\t\n\t\tfor(int u=0;u<1200;u++){\n\t\t\tif(d[u]>d[v]+gr[v][u]){\n\t\t\t\td[u]=d[v]+gr[v][u];\n\t\t\t\tprev[u]=v;\n\t\t\t}\n\t\t}\n\t}\n}\nvector<int>get_path(int t){\n\tvector<int>path;\n\tfor(;t!=-1;t=prev[t])path.push_back(t);\n\treverse(path.begin(),path.end());\n\treturn path;\n}\nint main(){\n\tint n;\n\t\twhile(cin>>n &&n){\n\t\tfill((double*)gr,(double*)gr+1200*1200,INF);\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint b,x,y;\n\t\t\tcin>>b>>x>>y;\n\t\t\tdata[b].real()=x;\n\t\t\tdata[b].imag()=y;\n\t\t}\n\t\tfor(map<int,P>::iterator itr=data.begin();itr!=data.end();itr++){\n\t\t\tfor(map<int,P>::iterator it=data.begin();it!=data.end();it++){\n\t\t\t\tif(abs(itr->second-it->second)<=50 &&abs(itr->second-it->second)>0){\n\t\t\t\t\tgr[itr->first][it->first]=abs(itr->second-it->second);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\t\tint m;\n\t\tcin>>m;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tint a,b;\n\t\t\tcin>>a>>b;\n\t\t\tdijkstra(a);\n\t\t\tif(d[b]==INF){\n\t\t\t\tcout<<\"NA\"<<endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse{\n\t\t\n\t\t\t\tvector<int>ans;\n\t\t\t\tans=get_path(b);\n\t\t\t\tfor(int i=0;i<ans.size();i++){\n\t\t\t\t\tif(i)cout<<\" \";\n\t\t\t\t\tcout<<ans[i];\n\t\t\t\t}\n\t\t\t\tcout<<endl;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 12504,
"score_of_the_acc": -1.3606,
"final_rank": 5
},
{
"submission_id": "aoj_0155_835574",
"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 complex<double>\n#define Y real()\n#define X imag()\nconst double INF = (1 << 16);\nconst int N = 1010;\n\nclass C{\n public:\n double dis;\n int now;\n vector<int> visited;\n C(double _d, int _n, vector<int> _v){\n dis = _d;\n now = _n;\n visited = _v;\n }\n bool operator>(const C &c) const { return dis > c.dis; }\n};\n\nint main() {\n int n;\n while(cin >>n && n){\n vector< pair<int, P> > building(n);\n REP(i, n){\n int a, b;\n cin >>building[i].first >>a >>b;\n building[i].second = P(a, b);\n }\n vector< vector<double> > v(N, vector<double>(N, INF));\n REP(i, n){\n REP(j, n){\n double d = abs(building[i].second - building[j].second);\n if(d <= 50.0) v[building[i].first][building[j].first] = d;\n }\n }\n\n int m; cin >>m;\n REP(z, m){\n int s, g; cin >>s >>g;\n priority_queue<C, vector<C>, greater<C> > open;\n vector<int> tmp(N, INF);\n tmp[s] = 0;\n open.push( C(0.0, s, tmp) );\n vector<double> closed(N, INF);\n C ans = C(0.0, -1, vector<int>());\n\n while(!open.empty()){\n C now = open.top();\n open.pop();\n\n //debug\n //cout <<now.dis <<\", \" <<now.now <<\", \";\n //REP(i, N) REP(j, N) if(now.visited[j] == i) cout <<j <<\" \";\n //cout <<endl <<\"---------\" <<endl;\n\n if(now.now == g){\n ans = now;\n break;\n }\n if(closed[now.now] <= now.dis) continue;\n closed[now.now] = now.dis;\n\n REP(i, N){\n if(now.visited[i] != INF || v[now.now][i] == INF) continue;\n now.visited[i] = now.dis + v[now.now][i];\n open.push( C(now.dis + v[now.now][i], i, now.visited) );\n now.visited[i] = INF;\n }\n }\n\n if(ans.now == -1) cout <<\"NA\" <<endl;\n else{\n vector<int> ans_v;\n REP(i, N) REP(j, N) if(ans.visited[j] == i) ans_v.push_back(j);\n cout <<ans_v[0];\n FOR(i, 1, ans_v.size()) cout <<\" \" <<ans_v[i];\n cout <<endl;\n }\n\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 9384,
"score_of_the_acc": -0.6498,
"final_rank": 3
}
] |
aoj_0143_cpp
|
牽牛と織女
織女は天帝の子供でしたが、父の言いつけであけてもくれても機を織っていました。
織女の織る雲錦という見事な布で仕立てた服を着るのが天帝の楽しみでした。雲錦は寿命が短くすぐに劣化してしまいますが、働き者の織女が毎日織ってくれるので、問題はありませんでした。織女は、父の言いつけを守り、毎日毎日雲錦を織り続けていたので、ボーイフレンドはいませんでした。かわいそうに思った父は、天の川の向こう岸に住む牽牛という働き者を紹介し、嫁入りさせました。
すると、織女は、結婚の楽しさに夢中になって、機織りなどそっちのけで、牽牛と遊び呆けています。天帝のお気に入りの雲錦の服も新しく仕立てられないためボロボロになってしまいました。
これには父も怒って、織女を宮殿に連れ戻したいと思いました。しかし人間である牽牛の前にボロボロの服で姿を現すわけにはいきません。遊び呆けている二人を 3 角形の壁で遮断し自分以外の全てのものが行き来できなくすることを考えました。そして、牽牛に見つからずに、織女に会って、まじめに機を織るか、さもなければ強制的に連れ帰ると宣言するというのです。
天帝はこの作戦を遂行するために 3 角形の壁生成装置を開発することにしました。3 角形の 3 頂点の位置
(xp
1
, yp
1
)
,
(xp
2
, yp
2
)
,
(xp
3
, yp
3
)
、牽牛の位置
(xk, yk)
、および織女の位置
(xs, ys)
、を入力とし、三角形が牽牛と織女を遮断しているか否かを判定し、遮断できている場合は OK、遮断できていない場合には NG を出力するプログラムを作成してください。ただし、遮断しているとは、牽牛と織女のいずれかが三角形の内側にあり、他方が外側にある場合を言います。牽牛と織女は三角形の頂点もしくは辺の上にはいないものとします。
織女と牽牛は時々刻々場所を変えるため、プログラムは様々な位置情報を入力し質問に答えなければなりません。
Input
入力は以下の形式で与えられます。
n
query
1
query
2
:
query
n
１行目に判別したい情報の個数
n
(
n
≤ 10000)、続く
n
行に
i
番目の質問
query
i
が与えられます。各質問は以下の形式で与えられます。
xp
1
yp
1
xp
2
yp
2
xp
3
yp
3
xk
yk
xs
ys
各質問として、3 角形の 3 頂点の位置、牽牛の位置、および織女の位置 (-1000 ≤
xp
1
,
yp
1
,
xp
2
,
yp
2
,
xp
3
,
yp
3
,
xk
,
yk
,
xs
,
ys
≤ 1000) が１行に与えられます。入力はすべて整数です。
Output
質問ごとに、判定結果 OK または NG を１行に出力してください。
Sample Input
5
2 5 9 2 8 9 2 11 6 5
2 5 9 2 8 9 2 11 12 6
2 5 9 2 8 9 2 11 11 9
14 1 25 7 17 12 17 9 20 5
14 1 25 7 17 12 22 13 20 5
Output for the Sample Input
OK
NG
NG
NG
OK
|
[
{
"submission_id": "aoj_0143_10851063",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\nusing namespace std;\n\n/* 幾何の基本 */\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;//複素数\n\nconst ld eps = 1e-9, pi = acos(-1.0);\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(ld a, ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// 内積\nld dot(Point a, Point b) {\n\treturn real(conj(a) * b);//conj::共役複素数\n}\n\n// 外積\nld cross(Point a, 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};\n\n/*int main(){\nPoint a(1,1),b(2,2);\nLine l(a,b);\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::counter clockwise\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\n\n/* 交差判定 */\n\n// 直線と直線の交差判定\n//l::直線 s::線分\nbool isis_ll(Line l, Line m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// 直線と線分の交差判定 *slide誤植\nbool isis_ls(Line l, 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(Line s, 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(Line l, Point p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\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\n// 垂線の足\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\t//norm::絶対値の2乗\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, 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\n// 直線と点の距離\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n\n// 直線と直線の距離\nld dist_ll(Line l, Line m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\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\n// 線分と点の距離\nld dist_sp(Line s, 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(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\n\n/* 円 */\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\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// 円と直線の交点\nvector<Point> is_lc(Circle c, 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(Circle c, 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(Circle c, 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(Circle c1, 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(), ALL(nret));\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\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\n// 面積\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) 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\tREP(i, n) {\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// -1 => out\n// 0 => on\n// 1 => in\nint is_in_polygon(const Polygon &poly, Point p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\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// 凸包\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// 凸カット\nPolygon convex_cut(const Polygon &ps, Line l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tREP(i, n) {\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) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m))\n\t\t\tQ.push_back(is_ll(l, m));\n\t}\n\treturn Q;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n int n;cin>>n;\n for(int i=0;i<n;i++){\n ld xp1,yp1,xp2,yp2,xp3,yp3,xk,yk,xs,ys;\n //Tringle:(xp1,yp1)-(xp2,yp2)-(xp3,yp3) Altair:(xk,yk) Vega:(xs,ys)\n cin>>xp1>>yp1>>xp2>>yp2>>xp3>>yp3>>xk>>yk>>xs>>ys;\n Point alt=Point(xk,yk),veg=Point(xs,ys);\n vector<Point> tri;\n tri.push_back(Point(xp1,yp1));tri.push_back(Point(xp2,yp2));tri.push_back(Point(xp3,yp3));\n Polygon sankaku=Polygon(tri);\n //cout<<is_in_polygon(sankaku,alt)<<\" \"<<is_in_polygon(sankaku,veg)<<endl;\n if(is_in_polygon(sankaku,alt)!=is_in_polygon(sankaku,veg)) cout<<\"OK\"<<endl;\n else cout<<\"NG\"<<endl;\n } \n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3516,
"score_of_the_acc": -1.1022,
"final_rank": 18
},
{
"submission_id": "aoj_0143_9650731",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ndouble area(double x1, double y1, double x2, double y2, double x3, double y3) {\n return abs((x1 * (y2 - y3) + x2 * (y3 - y1)) + x3 * (y1 - y2)) / 2.0;\n}\n\ndouble xp1, yp1, xp2, yp2, xp3, yp3, xk, yk, xs, ys;\n\nbool inTriangle(double x, double y) {\n double totalArea = area(xp1, yp1, xp2, yp2, xp3, yp3);\n\n double areaPBC = area(x, y, xp2, yp2, xp3, yp3);\n double areaPCA = area(x, y, xp1, yp1, xp3, yp3);\n double areaPAB = area(x, y, xp1, yp1, xp2, yp2);\n\n double sumOfTriangles = areaPAB + areaPCA + areaPBC;\n\n return (abs(totalArea - sumOfTriangles) < 1e-6);\n}\n\nint main() {\n int t; cin >> t;\n while (t--) {\n cin >> xp1 >> yp1 >> xp2 >> yp2 >> xp3 >> yp3 >> xk >> yk >> xs >> ys;\n if (inTriangle(xk, yk) == inTriangle(xs, ys))\n cout << \"NG\" << endl;\n else\n cout << \"OK\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3096,
"score_of_the_acc": -0.5376,
"final_rank": 8
},
{
"submission_id": "aoj_0143_9336516",
"code_snippet": "#include <bits/stdc++.h>\n\n#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <iterator>\n#include <utility>\n#include <vector>\n\nusing Real = long double;\nconstexpr Real EPS = 1e-10;\nconst Real PI = std::acos(-1);\n\nint sign(Real x) {\n return x < -EPS ? -1 : x > EPS ? 1 : 0;\n}\n\nbool eq(Real lhs, Real rhs) {\n return sign(rhs - lhs) == 0;\n}\n\nbool lte(Real lhs, Real rhs) {\n return sign(rhs - lhs) >= 0;\n}\n\nbool lt(Real lhs, Real rhs) {\n return sign(rhs - lhs) > 0;\n}\n\nbool gte(Real lhs, Real rhs) {\n return lte(rhs, lhs);\n}\n\nbool gt(Real lhs, Real rhs) {\n return lt(rhs, lhs);\n}\n\nstruct Point {\n Real x;\n Real y;\n Point(Real x = 0, Real y = 0): x(x), y(y) {}\n Point& operator+=(Point rhs) {\n this->x += rhs.x;\n this->y += rhs.y;\n return *this;\n }\n Point& operator-=(Point rhs) {\n this->x -= rhs.x;\n this->y -= rhs.y;\n return *this;\n }\n Point& operator*=(Real k) {\n this->x *= k;\n this->y *= k;\n return *this;\n }\n Point& operator/=(Real k) {\n this->x /= k;\n this->y /= k;\n return *this;\n }\n friend Point operator+(Point lhs, Point rhs) {\n return lhs += rhs;\n }\n friend Point operator-(Point lhs, Point rhs) {\n return lhs -= rhs;\n }\n friend Point operator*(Point p, Real k) {\n return p *= k;\n }\n friend Point operator/(Point p, Real k) {\n return p /= k;\n }\n friend Point operator*(Real k, Point p) {\n return p * k;\n }\n friend Point operator/(Real k, Point p) {\n return p / k;\n }\n friend bool operator==(Point lhs, Point rhs) {\n return eq(lhs.x, rhs.x) && eq(lhs.y, rhs.y);\n }\n friend bool operator<(Point lhs, Point rhs) {\n if (eq(lhs.x, rhs.x)) return lt(lhs.y, rhs.y);\n return lt(lhs.x, rhs.x);\n }\n friend bool operator>(Point lhs, Point rhs) {\n return rhs < lhs;\n }\n friend std::istream& operator>>(std::istream& is, Point& p) {\n is >> p.x >> p.y;\n return is;\n }\n friend std::ostream& operator<<(std::ostream& os, Point& p) {\n os << p.x << ' ' << p.y;\n return os;\n }\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = Points;\nusing Vector = Point;\n\nReal norm(Vector p) {\n return p.x * p.x + p.y * p.y;\n}\n\nReal abs(Vector p) {\n return std::sqrt(norm(p));\n}\n\nReal dot(Vector lhs, Vector rhs) {\n return lhs.x * rhs.x + lhs.y * rhs.y;\n}\n\nReal cross(Vector lhs, Vector rhs) {\n return lhs.x * rhs.y - lhs.y * rhs.x;\n}\n\nint ccw(Point p0, Point p1, Point p2) {\n Vector a = p1 - p0;\n Vector b = p2 - p0;\n\n if (cross(a, b) > EPS) return 1;\n\n if (cross(a, b) < -EPS) return -1;\n\n if (dot(a, b) < 0) return 2;\n\n if (norm(a) < norm(b)) return -2;\n\n return 0;\n}\n\nstruct Circle {\n Real r;\n Point c;\n Circle() {}\n Circle(Real r, Point c): r(r), c(c) {}\n};\n\nstruct Segment {\n Segment() {}\n Segment(Point p0, Point p1): p0(p0), p1(p1) {}\n Point p0, p1;\n};\n\nstruct Line {\n Line() {}\n Line(Point p0, Point p1): p0(p0), p1(p1) {}\n explicit Line(Segment s): p0(s.p0), p1(s.p1) {}\n Point p0, p1;\n};\n\nReal distance(Point lhs, Point rhs) {\n return abs(rhs - lhs);\n}\n\nReal distance(Line l, Point p) {\n return std::abs(cross(l.p1 - l.p0, p - l.p0)) / abs(l.p1 - l.p0);\n}\n\nReal distance(Segment s, Point p) {\n if (dot(s.p1 - s.p0, p - s.p0) < 0) {\n return distance(p, s.p0);\n }\n if (dot(s.p0 - s.p1, p - s.p1) < 0) {\n return distance(p, s.p1);\n }\n return distance(Line(s), p);\n}\n\nbool intersect(Segment lhs, Segment rhs) {\n return ccw(lhs.p0, lhs.p1, rhs.p0) * ccw(lhs.p0, lhs.p1, rhs.p1) <= 0\n && ccw(rhs.p0, rhs.p1, lhs.p0) * ccw(rhs.p0, rhs.p1, lhs.p1) <= 0;\n}\n\nbool intersect(Segment s, Point p) {\n return ccw(s.p0, s.p1, p) == 0;\n}\n\nReal distance(Segment lhs, Segment rhs) {\n if (intersect(lhs, rhs)) {\n return Real(0);\n }\n return std::min({distance(lhs, rhs.p0), distance(lhs, rhs.p1), distance(rhs, lhs.p0), distance(rhs, lhs.p1)});\n}\n\nbool parallel(Vector lhs, Vector rhs) {\n return eq(cross(lhs, rhs), 0);\n}\n\nbool parallel(Segment lhs, Segment rhs) {\n return parallel(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nbool parallel(Line lhs, Line rhs) {\n return parallel(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nPoint crosspoint(Line lhs, Line rhs) {\n Real a = cross(lhs.p1 - lhs.p0, rhs.p1 - rhs.p0);\n Real b = cross(lhs.p1 - lhs.p0, lhs.p1 - rhs.p0);\n return rhs.p0 + (rhs.p1 - rhs.p0) * b / a;\n}\n\nbool intersect(Line l, Segment s) {\n return ccw(l.p0, l.p1, s.p0) * ccw(l.p0, l.p1, s.p1) <= 0;\n}\n\nbool intersect(Circle c, Line l) {\n return lte(distance(l, c.c), c.r);\n}\n\nbool intersect(Circle c, Point p) {\n return eq(distance(c.c, p), c.r);\n}\n\nbool internal(Circle c, Point p) {\n return lt(distance(c.c, p), c.r);\n}\n\nbool intersect(Circle c, Segment s) {\n return lte(distance(s, c.c), c.r);\n}\n\nint intersect(Circle lhs, Circle rhs) {\n if (gt(lhs.r, rhs.r)) std::swap(lhs, rhs);\n Real d = distance(lhs.c, rhs.c);\n if (lt(lhs.r + rhs.r, d)) return 4;\n if (eq(lhs.r + rhs.r, d)) return 3;\n if (gt(lhs.r + d, rhs.r)) return 2;\n if (eq(lhs.r + d, rhs.r)) return 1;\n return 0;\n}\n\nbool orthogonal(Vector lhs, Vector rhs) {\n return eq(dot(lhs, rhs), 0);\n}\n\nbool orthogonal(Segment lhs, Segment rhs) {\n return orthogonal(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nbool orthogonal(Line lhs, Line rhs) {\n return orthogonal(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nPoint crosspoint(Segment lhs, Segment rhs) {\n Real d0 = distance(Line(lhs.p0, lhs.p1), rhs.p0);\n Real d1 = distance(Line(lhs.p0, lhs.p1), rhs.p1);\n return rhs.p0 + (rhs.p1 - rhs.p0) * (d0 / (d0 + d1));\n}\n\nReal arg(Vector p) {\n return std::atan2(p.y, p.x);\n}\n\nVector polar(Real a, Real r) {\n return Point(std::cos(r) * a, std::sin(r) * a);\n}\n\nPoint rotate(Point p, Real t) {\n Point v = polar(1, t);\n return Point(p.x * v.x - p.y * v.y, p.x * v.y + p.y * v.x);\n}\n\nReal angle(Point p0, Point p1, Point p2) {\n Real a = arg(p0 - p1);\n Real b = arg(p2 - p1);\n if (gt(a, b)) std::swap(a, b);\n return std::min(b - a, 2 * PI - (b - a));\n}\n\nPoints crosspoint(Circle lhs, Circle rhs) {\n Real d = abs(lhs.c - rhs.c);\n if (eq(d, lhs.r + rhs.r)) return {lhs.c + lhs.r * (rhs.c - lhs.c) / d};\n Real a = std::acos((lhs.r * lhs.r + d * d - rhs.r * rhs.r) / (2 * lhs.r * d));\n Real t = arg(rhs.c - lhs.c);\n return {lhs.c + polar(lhs.r, t + a), lhs.c + polar(lhs.r, t - a)};\n}\n\nPoint projection(Segment s, Point p) {\n Vector a = p - s.p0;\n Vector b = s.p1 - s.p0;\n Real t = dot(a, b) / norm(b);\n return s.p0 + t * b;\n}\n\nPoint projection(Line l, Point p) {\n Vector a = p - l.p0;\n Vector b = l.p1 - l.p0;\n Real t = dot(a, b) / norm(b);\n return l.p0 + t * b;\n}\n\nPoint reflection(Segment s, Point p) {\n return p + (projection(s, p) - p) * Real(2);\n}\n\nPoint reflection(Line l, Point p) {\n return p + (projection(l, p) - p) * Real(2);\n}\n\nPoints crosspoint(Circle c, Line l) {\n Vector p = projection(l, c.c);\n Real t = std::sqrt(c.r * c.r - norm(c.c - p));\n if (eq(t, 0)) return {p};\n Vector e = (l.p1 - l.p0) / abs(l.p1 - l.p0);\n return {p + t * e, p + -t * e};\n}\n\nReal area(Polygon poly) {\n int n = poly.size();\n Real result = 0;\n for (int i = 0; i < n; i++) {\n result += cross(poly[i], poly[(i + 1) % n]);\n }\n return result / 2;\n}\n\nReal perimeter(Polygon poly) {\n int n = poly.size();\n Real result = 0;\n for (int i = 0; i < n; i++) {\n result += abs(poly[i] - poly[(i + 1) % n]);\n }\n return result;\n}\n\nbool convex(Polygon poly) {\n int n = poly.size();\n for (int i = 0; i < n; i++) {\n if (ccw(poly[i], poly[(i + 1) % n], poly[(i + 2) % n]) == -1) return false;\n }\n return true;\n}\n\nint contain(Polygon poly, Point p) {\n int n = poly.size();\n bool parity = false;\n for (int i = 0; i < n; i++) {\n Point a = poly[i] - p;\n Point b = poly[(i + 1) % n] - p;\n if (gt(a.y, b.y)) std::swap(a, b);\n if (lte(a.y, 0) && lt(0, b.y) && lt(cross(a, b), 0)) parity ^= true;\n if (eq(cross(a, b), 0) && lte(dot(a, b), 0)) return 1;\n }\n return (parity ? 2 : 0);\n}\n\nPolygon convex_hull(Points points) {\n std::sort(points.begin(), points.end(), [](Point lhs, Point rhs) {\n if (eq(lhs.x, rhs.x)) return lt(lhs.y, rhs.y);\n return lt(lhs.x, rhs.x);\n });\n int n = points.size();\n Points lower, upper;\n lower.push_back(points[n - 1]);\n lower.push_back(points[n - 2]);\n upper.push_back(points[0]);\n upper.push_back(points[1]);\n for (int i = n - 3; i >= 0; i--) {\n for (int m = lower.size(); m >= 2 && ccw(lower[m - 2], lower[m - 1], points[i]) >= 0; m--) {\n lower.pop_back();\n }\n lower.push_back(points[i]);\n }\n for (int i = 2; i < n; i++) {\n for (int m = upper.size(); m >= 2 && ccw(upper[m - 2], upper[m - 1], points[i]) >= 0; m--) {\n upper.pop_back();\n }\n upper.push_back(points[i]);\n }\n std::reverse(lower.begin(), lower.end());\n std::copy(std::next(upper.rbegin()), std::prev(upper.rend()), std::back_inserter(lower));\n return lower;\n}\n\nPolygon convex_cut(Polygon poly, Line l) {\n int n = poly.size();\n Polygon res;\n for (int i = 0; i < n; i++) {\n Point a = poly[i];\n Point b = poly[(i + 1) % n];\n if (ccw(l.p0, l.p1, a) != -1) res.push_back(a);\n if (ccw(l.p0, l.p1, a) * ccw(l.p0, l.p1, b) == -1) {\n res.push_back(crosspoint(l, Line(a, b)));\n }\n }\n return res;\n}\n\nLine bisector(Point p0, Point p1, Point p2) {\n return Line(p1, p1 + polar(1, angle(p0, p1, p2) / 2));\n}\n\nCircle incircle(Point p0, Point p1, Point p2) {\n Point c = crosspoint(bisector(p0, p1, p2), bisector(p1, p2, p0));\n Real r = std::abs(2 * area({p0, p1, p2}) / perimeter({p0, p1, p2}));\n return Circle(r, c);\n}\n\nLine perpendicular(Line l, Point p) {\n Vector v = l.p1 - l.p0;\n return Line(p, p + Vector(-v.y, v.x));\n}\n\nLine perpendicular_bisector(Segment s) {\n return perpendicular(Line(s), (s.p0 + s.p1) / 2);\n}\n\nCircle circumscribed_circle(Point p0, Point p1, Point p2) {\n Point c = crosspoint(perpendicular_bisector(Segment(p0, p1)), perpendicular_bisector(Segment(p0, p2)));\n return Circle(distance(p0, c), c);\n}\n\nReal area(Circle c) {\n return c.r * c.r * PI;\n}\n\nPoints tangent(Circle c, Point p) {\n return crosspoint(c, Circle(std::sqrt(norm(c.c - p) - c.r * c.r), p));\n}\n\nint solve() {\n Polygon ps;\n for (int i = 0; i < 3; i++) {\n Point p;\n std::cin >> p;\n ps.push_back(p);\n }\n Point s, t;\n std::cin >> s >> t;\n if (contain(ps, s) ^ contain(ps, t)) {\n std::cout << \"OK\" << std::endl;\n } else {\n std::cout << \"NG\" << std::endl;\n }\n return 0;\n}\n\nint main() {\n int n;\n std::cin >> n;\n while (n--) solve();\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3336,
"score_of_the_acc": -0.8602,
"final_rank": 14
},
{
"submission_id": "aoj_0143_9152931",
"code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to, cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, int cost) : to(to), cost(cost) {}\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nvector<string> split_str(string S, char c) {\n vector<string> ret;\n stringstream ss;\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == c) {\n ret.pb(ss.str());\n ss.str(\"\");\n ss.clear();\n } else {\n ss << S[i];\n }\n }\n ret.pb(ss.str());\n return ret;\n}\n\nstruct Point {\n\tdouble x, y;\n\n\tPoint() {}\n\tPoint(double x, double y) : x(x), y(y) {}\n\n\tPoint operator+(const Point& p) const { return Point(x + p.x, y + p.y); }\n\tPoint operator-(const Point& p) const { return Point(x - p.x, y - p.y); }\n\tPoint operator*(const double& k) const { return Point(x * k, y * k); }\n\tPoint operator/(const double& k) const { return Point(x / k, y / k); }\n\n\tfriend istream& operator>>(istream& is, Point& p) {\n\t\tis >> p.x >> p.y;\n\t\treturn is;\n\t}\n\tfriend ostream& operator<<(ostream& os, Point& p) {\n\t\tos << p.x << \" \" << p.y;\n\t\treturn os;\n\t}\n\n\tbool operator==(const Point& p) const { return (fabs(x - p.x) < EPS && fabs(y - p.y) < EPS); }\n\tbool operator<(const Point& p) const { return (x != p.x ? x < p.x : y < p.y); }\n\t// (x, y) の辞書順比較\n\n\tdouble norm() { return x * x + y * y; }\n\tdouble abs() { return sqrt(norm()); }\n};\n\ntypedef Point Vector;\n\ndouble radToDeg(double radian) { return radian * 180.0 / PI; }\ndouble degToRad(double degree) { return degree * PI / 180.0; }\n\nint sign(double x) { return x < -EPS ? -1 : x > EPS; } // -1(負)/0/1(正)\n\ndouble norm(Vector a) { return a.x * a.x + a.y * a.y; }\ndouble abs(Vector a) { return sqrt(norm(a)); }\ndouble dist(Point a, Point b) { return sqrt(norm(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\nVector orth(Vector p) { return {-p.y, p.x}; }\n\ndouble arg(Vector p) { return atan2(p.y, p.x); } // 偏角\nPoint polar(double r, double a) { return Point(cos(a) * r, sin(a) * r); } // 極座標から直交座標への変換\n\nbool isParallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }\nbool isOrthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }\n// bool isSameLine(Vector a, Vector b) { return equals(); }\n\nstruct EndPoint { // 端点の構造体(マンハッタン幾何)\n\tPoint p;\n\tint seg, st; // 点のid, 点の種別\n\n\tEndPoint() {}\n\tEndPoint(Point p, int seg, int st) : p(p), seg(seg), st(st) {}\n\n\tbool operator<(const EndPoint& ep) const {\n\t\tif (p.y == ep.p.y) return st < ep.st;\n\t\treturn p.y < ep.p.y;\n\t}\n};\n\nstruct Segment {\n\tPoint p1, p2;\n\n\tSegment() {}\n\tSegment(Point p1, Point p2) : p1(p1), p2(p2) {}\n\n\tfriend istream& operator>>(istream& is, Segment& s) {\n\t\tis >> s.p1 >> s.p2;\n\t\treturn is;\n\t}\n};\n\nstruct Line {\n\tPoint p1, p2;\n\n\tLine() {}\n\tLine(Point p1, Point p2) : p1(p1), p2(p2) {}\n\t// Ax + By = C\n Line(double A, double B, double C) {\n if (equals(A, 0)) {\n p1 = Point(0, C / B), p2 = Point(1, C / B);\n } else if (equals(B, 0)) {\n p2 = Point(C / A, 0), p2 = Point(C / A, 1);\n } else {\n p1 = Point(0, C / B), p2 = Point(C / A, 0);\n }\n }\n\n\tfriend istream& operator>>(istream& is, Line& l) {\n\t\tis >> l.p1 >> l.p2;\n\t\treturn is;\n\t}\n};\n\nbool isParallel(Segment S1, Segment S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Line S1, Line S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Line S1, Segment S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isParallel(Segment S1, Line S2) { return isParallel(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\nbool isOrthogonal(Segment S1, Segment S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Line S1, Line S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Line S1, Segment S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\nbool isOrthogonal(Segment S1, Line S2) { return isOrthogonal(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\n// bool isSameLine(Segment S1, Segment S2) { return isSameLine(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n// bool isSameLine(Line S1, Line S2) { return isSameLine(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n// bool isSameLine(Line S1, Segment S2) { return isSameLine(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n// bool isSameLine(Segment S1, Line S2) { return isSameLine(S1.p2 - S1.p1, S2.p2 - S2.p1); }\n\nbool onSegment(Segment S, Point p) {\n\tif (sign(cross(S.p1-p, S.p2-p)) != 0) return false;\n \tif (sign( dot(S.p1-p, S.p2-p)) > 0) return false;\n\treturn true;\n}\nbool onLine(Line L, Point p) {\n\tif (sign(cross(L.p1-p, L.p2-p)) != 0) return false;\n\treturn true;\n}\n\nPoint project(Segment s, Point p) { // 点の射影\n\tVector base = s.p2 - s.p1;\n\tdouble r = dot(p - s.p1, base) / base.norm();\n\treturn s.p1 + base * r;\n}\n\nPoint reflect(Segment s, Point p) { // 点の反射\n\treturn p + (project(s, p) - p) * 2.0;\n}\n\nstruct Circle {\n\tPoint c;\n\tdouble r;\n\n\tCircle() {}\n\tCircle(Point c, double r) : c(c), r(r) {}\n};\n\ntypedef vector<Point> Polygon;\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;\n\t\tPoint b = G[(i + 1) % N] - p;\n\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\nsigned main() {\n int N;\n cin >> N;\n for (int i = 0; i < N; i++) {\n Point p1, p2, p3;\n Segment S;\n cin >> p1 >> p2 >> p3 >> S;\n\n vector<Point> P = {p1, p2, p3};\n\n if (contains(P, S.p1) != contains(P, S.p2)) cout << \"OK\" << endl;\n\t else cout << \"NG\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3504,
"score_of_the_acc": -0.586,
"final_rank": 10
},
{
"submission_id": "aoj_0143_7254096",
"code_snippet": "#line 1 \"test/AOJ/0143.test.cpp\"\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0143\"\n#line 1 \"template/template.hpp\"\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define elif else if\n#define updiv(N, X) ((N + X - 1) / X)\n#define sigma(a, b) ((a + b) * (b - a + 1) / 2)\nstruct fast_ios {\n fast_ios() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n };\n} fast_ios_;\ntemplate <typename T>\ninline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate <typename T>\ninline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }\nconstexpr int inf = 1 << 30;\nconstexpr ll INF = 1LL << 60;\nconstexpr int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};\nconstexpr int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};\nconstexpr int mod = 998244353;\nconstexpr int MOD = 1e9 + 7;\n#line 1 \"geomeny/geomeny-template.hpp\"\nusing DD = long double; // to be set appropriately\nconst DD EPS = 1e-10; // to be set appropriately\nconst DD PI = acosl(-1.0);\nDD torad(int deg) { return (DD)(deg)*PI / 180; }\nDD todeg(DD ang) { return ang * 180 / PI; }\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream &operator<<(ostream &s, const Point &p) { return s << '(' << p.x << \", \" << p.y << ')'; }\n};\ninline Point operator+(const Point &p, const Point &q) { return Point(p.x + q.x, p.y + q.y); }\ninline Point operator-(const Point &p, const Point &q) { return Point(p.x - q.x, p.y - q.y); }\ninline Point operator*(const Point &p, DD a) { return Point(p.x * a, p.y * a); }\ninline Point operator*(DD a, const Point &p) { return Point(a * p.x, a * p.y); }\ninline Point operator*(const Point &p, const Point &q) { return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x); }\ninline Point operator/(const Point &p, DD a) { return Point(p.x / a, p.y / a); }\ninline Point conj(const Point &p) { return Point(p.x, -p.y); }\ninline Point rot(const Point &p, DD ang) { return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y); }\ninline Point rot90(const Point &p) { return Point(-p.y, p.x); }\ninline DD cross(const Point &p, const Point &q) { return p.x * q.y - p.y * q.x; }\ninline DD dot(const Point &p, const Point &q) { return p.x * q.x + p.y * q.y; }\ninline DD norm(const Point &p) { return dot(p, p); }\ninline DD abs(const Point &p) { return sqrt(dot(p, p)); }\ninline DD amp(const Point &p) {\n DD res = atan2(p.y, p.x);\n if (res < 0) res += PI * 2;\n return res;\n}\ninline bool eq(const Point &p, const Point &q) { return abs(p - q) < EPS; }\ninline bool operator<(const Point &p, const Point &q) { return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y); }\ninline bool operator>(const Point &p, const Point &q) { return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y); }\ninline Point operator/(const Point &p, const Point &q) { return p * conj(q) / norm(q); }\n\n/* Line */\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n friend ostream &operator<<(ostream &s, const Line &l) { return s << '{' << l[0] << \", \" << l[1] << '}'; }\n};\n\n/* Circle */\nstruct Circle : Point {\n DD r;\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\n friend ostream &operator<<(ostream &s, const Circle &c) { return s << '(' << c.x << \", \" << c.y << \", \" << c.r << ')'; }\n};\n#line 2 \"geomeny/ccw.hpp\"\n\n// 粗\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b - a, c - a) > EPS) return 1;\n if (cross(b - a, c - a) < -EPS) return -1;\n return 0;\n}\n\n// 精\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)\n// 2：c-a-bの順に一直線上、-2：a-b-cの順に一直線上、0：a-c-bの順に一直線上\nint ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b - a, c - a) > EPS) return 1;\n if (cross(b - a, c - a) < -EPS) return -1;\n if (dot(b - a, c - a) < -EPS) return 2;\n if (norm(b - a) < norm(c - a) - EPS) return -2;\n return 0;\n}\n#line 2 \"geomeny/is-contain-in-the-triangle.hpp\"\n\n// 辺上については判定していない\nbool is_contain(const Point &p, const Point &a, const Point &b, const Point &c) {\n int r1 = simple_ccw(p, b, c), r2 = simple_ccw(p, c, a), r3 = simple_ccw(p, a, b);\n if (r1 == 1 && r2 == 1 && r3 == 1) return true;\n if (r1 == -1 && r2 == -1 && r3 == -1) return true;\n return false;\n}\n#line 4 \"test/AOJ/0143.test.cpp\"\n\nint main() {\n int N;\n cin >> N;\n for (int i = 0; i < N; i++) {\n Point a, b, c, d, e;\n cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y >> d.x >> d.y >> e.x >> e.y;\n if (is_contain(d, a, b, c) == is_contain(e, a, b, c)) {\n cout << \"NG\" << endl;\n } else {\n cout << \"OK\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3356,
"score_of_the_acc": -0.3871,
"final_rank": 5
},
{
"submission_id": "aoj_0143_7253276",
"code_snippet": "#line 1 \"test/AOJ/0143.test.cpp\"\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0143\"\n#line 1 \"template/template.hpp\"\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define elif else if\n#define updiv(N, X) ((N + X - 1) / X)\n#define sigma(a, b) ((a + b) * (b - a + 1) / 2)\nstruct fast_ios {\n fast_ios() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n };\n} fast_ios_;\ntemplate <typename T>\ninline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate <typename T>\ninline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }\nconstexpr int inf = 1 << 30;\nconstexpr ll INF = 1LL << 60;\nconstexpr int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};\nconstexpr int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};\nconstexpr int mod = 998244353;\nconstexpr int MOD = 1e9 + 7;\n#line 1 \"geomeny/geomeny-template.hpp\"\nusing DD = long double; // to be set appropriately\nconst DD EPS = 1e-10; // to be set appropriately\nconst DD PI = acosl(-1.0);\nDD torad(int deg) { return (DD)(deg)*PI / 180; }\nDD todeg(DD ang) { return ang * 180 / PI; }\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream &operator<<(ostream &s, const Point &p) { return s << '(' << p.x << \", \" << p.y << ')'; }\n};\ninline Point operator+(const Point &p, const Point &q) { return Point(p.x + q.x, p.y + q.y); }\ninline Point operator-(const Point &p, const Point &q) { return Point(p.x - q.x, p.y - q.y); }\ninline Point operator*(const Point &p, DD a) { return Point(p.x * a, p.y * a); }\ninline Point operator*(DD a, const Point &p) { return Point(a * p.x, a * p.y); }\ninline Point operator*(const Point &p, const Point &q) { return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x); }\ninline Point operator/(const Point &p, DD a) { return Point(p.x / a, p.y / a); }\ninline Point conj(const Point &p) { return Point(p.x, -p.y); }\ninline Point rot(const Point &p, DD ang) { return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y); }\ninline Point rot90(const Point &p) { return Point(-p.y, p.x); }\ninline DD cross(const Point &p, const Point &q) { return p.x * q.y - p.y * q.x; }\ninline DD dot(const Point &p, const Point &q) { return p.x * q.x + p.y * q.y; }\ninline DD norm(const Point &p) { return dot(p, p); }\ninline DD abs(const Point &p) { return sqrt(dot(p, p)); }\ninline DD amp(const Point &p) {\n DD res = atan2(p.y, p.x);\n if (res < 0) res += PI * 2;\n return res;\n}\ninline bool eq(const Point &p, const Point &q) { return abs(p - q) < EPS; }\ninline bool operator<(const Point &p, const Point &q) { return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y); }\ninline bool operator>(const Point &p, const Point &q) { return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y); }\ninline Point operator/(const Point &p, const Point &q) { return p * conj(q) / norm(q); }\n\n/* Line */\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n friend ostream &operator<<(ostream &s, const Line &l) { return s << '{' << l[0] << \", \" << l[1] << '}'; }\n};\n\n/* Circle */\nstruct Circle : Point {\n DD r;\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\n friend ostream &operator<<(ostream &s, const Circle &c) { return s << '(' << c.x << \", \" << c.y << \", \" << c.r << ')'; }\n};\n#line 2 \"geomeny/ccw.hpp\"\n\n// 粗\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b - a, c - a) > EPS) return 1;\n if (cross(b - a, c - a) < -EPS) return -1;\n return 0;\n}\n\n// 精\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)\n// 2：c-a-bの順に一直線上、-2：a-b-cの順に一直線上、0：a-c-bの順に一直線上\nint ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b - a, c - a) > EPS) return 1;\n if (cross(b - a, c - a) < -EPS) return -1;\n if (dot(b - a, c - a) < -EPS) return 2;\n if (norm(b - a) < norm(c - a) - EPS) return -2;\n return 0;\n}\n#line 2 \"geomeny/is-contain-in-the-triangle.hpp\"\n\n// 辺上については判定していない\nbool is_contain(const Point &p, const Point &a, const Point &b, const Point &c) {\n int r1 = simple_ccw(p, b, c), r2 = simple_ccw(p, c, a), r3 = simple_ccw(p, a, b);\n if (r1 == 1 && r2 == 1 && r3 == 1) return true;\n if (r1 == -1 && r2 == -1 && r3 == -1) return true;\n return false;\n}\n#line 4 \"test/AOJ/0143.test.cpp\"\n\nint main() {\n cout << fixed << setprecision(8);\n int N;\n cin >> N;\n for (int i = 0; i < N; i++) {\n Point a, b, c, d, e;\n cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y >> d.x >> d.y >> e.x >> e.y;\n if (is_contain(d, a, b, c) == is_contain(e, a, b, c)) {\n cout << \"NG\" << endl;\n } else {\n cout << \"OK\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3532,
"score_of_the_acc": -0.6237,
"final_rank": 12
},
{
"submission_id": "aoj_0143_7253085",
"code_snippet": "#line 1 \"test/AOJ/0143.test.cpp\"\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0143\"\n#line 1 \"template/template.hpp\"\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define elif else if\n#define updiv(N, X) ((N + X - 1) / X)\n#define sigma(a, b) ((a + b) * (b - a + 1) / 2)\nstruct fast_ios {\n fast_ios() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n };\n} fast_ios_;\ntemplate <typename T>\ninline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate <typename T>\ninline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }\nconstexpr int inf = 1 << 30;\nconstexpr ll INF = 1LL << 60;\nconstexpr int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};\nconstexpr int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};\nconstexpr int mod = 998244353;\nconstexpr int MOD = 1e9 + 7;\n#line 1 \"geomeny/geomeny-template.hpp\"\nusing DD = double; // to be set appropriately\nconst DD EPS = 1e-10; // to be set appropriately\nconst DD PI = acosl(-1.0);\nDD torad(int deg) { return (DD)(deg)*PI / 180; }\nDD todeg(DD ang) { return ang * 180 / PI; }\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream &operator<<(ostream &s, const Point &p) { return s << '(' << p.x << \", \" << p.y << ')'; }\n};\ninline Point operator+(const Point &p, const Point &q) { return Point(p.x + q.x, p.y + q.y); }\ninline Point operator-(const Point &p, const Point &q) { return Point(p.x - q.x, p.y - q.y); }\ninline Point operator*(const Point &p, DD a) { return Point(p.x * a, p.y * a); }\ninline Point operator*(DD a, const Point &p) { return Point(a * p.x, a * p.y); }\ninline Point operator*(const Point &p, const Point &q) { return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x); }\ninline Point operator/(const Point &p, DD a) { return Point(p.x / a, p.y / a); }\ninline Point conj(const Point &p) { return Point(p.x, -p.y); }\ninline Point rot(const Point &p, DD ang) { return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y); }\ninline Point rot90(const Point &p) { return Point(-p.y, p.x); }\ninline DD cross(const Point &p, const Point &q) { return p.x * q.y - p.y * q.x; }\ninline DD dot(const Point &p, const Point &q) { return p.x * q.x + p.y * q.y; }\ninline DD norm(const Point &p) { return dot(p, p); }\ninline DD abs(const Point &p) { return sqrt(dot(p, p)); }\ninline DD amp(const Point &p) {\n DD res = atan2(p.y, p.x);\n if (res < 0) res += PI * 2;\n return res;\n}\ninline bool eq(const Point &p, const Point &q) { return abs(p - q) < EPS; }\ninline bool operator<(const Point &p, const Point &q) { return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y); }\ninline bool operator>(const Point &p, const Point &q) { return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y); }\ninline Point operator/(const Point &p, const Point &q) { return p * conj(q) / norm(q); }\n\n/* Line */\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n friend ostream &operator<<(ostream &s, const Line &l) { return s << '{' << l[0] << \", \" << l[1] << '}'; }\n};\n\n/* Circle */\nstruct Circle : Point {\n DD r;\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\n friend ostream &operator<<(ostream &s, const Circle &c) { return s << '(' << c.x << \", \" << c.y << \", \" << c.r << ')'; }\n};\n#line 2 \"geomeny/ccw.hpp\"\n\n// 粗\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b - a, c - a) > EPS) return 1;\n if (cross(b - a, c - a) < -EPS) return -1;\n return 0;\n}\n\n// 精\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)\n// 2：c-a-bの順に一直線上、-2：a-b-cの順に一直線上、0：a-c-bの順に一直線上\nint ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b - a, c - a) > EPS) return 1;\n if (cross(b - a, c - a) < -EPS) return -1;\n if (dot(b - a, c - a) < -EPS) return 2;\n if (norm(b - a) < norm(c - a) - EPS) return -2;\n return 0;\n}\n#line 2 \"geomeny/is-contain-in-the-triangle.hpp\"\n\n// 辺上については判定していない\nbool is_contain(const Point &p, const Point &a, const Point &b, const Point &c) {\n int r1 = simple_ccw(p, b, c), r2 = simple_ccw(p, c, a), r3 = simple_ccw(p, a, b);\n if (r1 == 1 && r2 == 1 && r3 == 1) return true;\n if (r1 == -1 && r2 == -1 && r3 == -1) return true;\n return false;\n}\n#line 4 \"test/AOJ/0143.test.cpp\"\n\nint main() {\n int N;\n cin >> N;\n for (int i = 0; i < N; i++) {\n Point a, b, c, d, e;\n cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y >> d.x >> d.y >> e.x >> e.y;\n if (is_contain(d, a, b, c) == is_contain(e, a, b, c)) {\n cout << \"NG\" << endl;\n } else {\n cout << \"OK\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3480,
"score_of_the_acc": -0.5538,
"final_rank": 9
},
{
"submission_id": "aoj_0143_6981996",
"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 1000000000000000\n\nconst double eps = 1e-10;\n\ntemplate <typename T>\nstruct point{\n\tT x,y,rad,dir;\n\t\n\tpoint(T a=0.0,T b=0.0){\n\t\tx = a;\n\t\ty = b;\n\t\tfix_rd();\n\t}\n\t\n\tvoid update_x(T a,T b){\n\t\tx = a*x + b;\n\t\tfix_rd();\n\t}\n\t\n\tvoid update_x(T a){\n\t\tupdate_x(0.0,a);\n\t}\n\t\n\tvoid update_y(T a,T b){\n\t\ty = a*y + b;\n\t\tfix_rd();\n\t}\n\t\n\tvoid update_y(T a){\n\t\tupdate_y(0.0,a);\n\t}\n\t\n\tvoid update_rad(T a,T b){\n\t\trad = a*rad + b;\n\t\tfix_xy();\n\t}\n\t\n\tvoid update_rad(T a){\n\t\tupdate_rad(0.0,a);\n\t}\n\t\n\tvoid update_dir(T a,T b){\n\t\tdir = a*dir + b;\n\t\tfix_xy();\n\t}\n\n\tvoid update_dir(T a){\n\t\tupdate_dir(0.0,a);\n\t}\n\t\n\tvoid fix_xy(){\n\t\tx = rad * cos(dir);\n\t\ty = rad * sin(dir);\n\t\tfix_rd();\n\t}\n\t\n\tvoid fix_rd(){\n\t\trad = hypot(x,y);\n\t\tif(rad==0.0)dir=0.0;\n\t\telse dir = atan2(y,x);\n\t\tfix_zero();\n\t}\n\t\n\tvoid fix_zero(){\n\t\tif(abs(x)<eps)x = 0.0;\n\t\tif(abs(y)<eps)y = 0.0;\n\t\tif(abs(rad)<eps)rad = 0.0;\n\t\tif(abs(dir)<eps)dir = 0.0;\n\t}\n\t\n\tvoid normalize(){\n\t\tT s = size();\n\t\tupdate_x(1.0/s,0.0);\n\t\tupdate_y(1.0/s,0.0);\n\t}\n\t\n\t\n\tT get_dis(point<T> V){\n\t\treturn hypot(x-V.x,y-V.y);\n\t}\n\t\n\tT size(){\n\t\treturn get_dis(point<T>());\n\t}\n\t\n\tT angle_difference(point<T> V){\n\t\tdouble ret = dir - V.dir;\n\t\tif(ret<-acos(-1.0))ret = acos(-1.0)*2.0+ret;\n\t\tif(ret>acos(-1.0))ret=-acos(-1.0)*2.0+ret;\n\t\treturn ret;\n\t}\n\t\n\t//中点\n\tpoint get_midpoint(point<T> V){\n\t\tV.update_x(0.5,x/2.0);\n\t\tV.update_y(0.5,y/2.0);\n\t\treturn V;\n\t}\n\t\n\tT get_inner_product(point<T> V){\n\t\treturn x*V.x+y*V.y;\n\t}\n\t\n\tT get_cross_product(point<T> V){\n\t\treturn x*V.y-y*V.x;\n\t}\n\t\n\tpoint &operator+=(const point<T> &another){\n\t\tupdate_x(1,another.x);\n\t\tupdate_y(1,another.y);\n\t\treturn (*this);\n\t}\n\t\n\tpoint &operator-=(const point<T> &another){\n\t\tupdate_x(1,-another.x);\n\t\tupdate_y(1,-another.y);\n\t\treturn (*this);\n\t}\n\t\n\tpoint operator+(const point<T> &another)const{\n\t\treturn (point(*this)+=another);\n\t}\n\t\n\tpoint operator-(const point<T> &another)const{\n\t\treturn (point(*this)-=another);\n\t}\n\t\n\tvoid show(){\n\t\tcout<<x<<','<<y<<endl;\n\t}\n};\n\n//a+tx\ntemplate <typename T>\nstruct line{\n\tpoint<T> a,t;\n\t\n\tline(){\n\t}\n\t\n\tline(point<T> V1,point<T> V2){\n\t\ta=V1;\n\t\tt=V2-V1;\n\t}\n\n\tT get_signed_dis(point<T> V){\n\t\tpoint<double> PA = a-V;\n\t\treturn PA.get_cross_product(t)/t.size();\n\t}\n\t\n\tT get_dis(point<T> V){\n\t\treturn abs(get_signed_dis(V));\n\t}\n\t\n\tpoint<T> get_projection(point<T> P){\n\t\tT r = t.get_inner_product(P-a)/t.size();\n\t\tpoint<T> temp = t;\n\t\ttemp.update_rad(0.0,r);\n\t\treturn a+temp;\n\t}\t\n\t\n\tpoint<T> get_cross_point(line<T> L){\n\t\tpoint<T> ret(1e20,1e20);\n\t\tif(abs(t.get_cross_product(L.t))<eps)return ret;\n\n\t\tT d0 = L.get_signed_dis(a);\n\t\tT d1 = L.get_signed_dis(a+t);\n\t\tpoint<T> temp = t;\n\t\ttemp.x *= d0/(d1-d0);\n\t\ttemp.y *= d0/(d1-d0);\n\t\tret = a - temp;\n\t\treturn ret;\n\t}\n\t\n};\n\ntemplate <typename T>\nstruct segment{\n\tpoint<T> V1,V2;\n\tsegment(point<T> a=point<T>(),point<T> b=point<T>()){\n\t\tV1=a;\n\t\tV2=b;\n\t}\n\t\n\tT get_dis(point<T> P){\n\t\tT ret = 1e20;\n\t\tline<T> L(V1,V2);\n\t\tpoint<T> Q = L.get_projection(P);\n\t\tif(Q.x+eps>min(V1.x,V2.x)&&Q.y+eps>min(V1.y,V2.y)\n\t\t&&Q.x<max(V1.x,V2.x)+eps&&Q.y<max(V1.y,V2.y)+eps)ret = min(ret,Q.get_dis(P));\n\t\telse{\n\t\t\tret = min(ret,P.get_dis(V1));\n\t\t\tret = min(ret,P.get_dis(V2));\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tT get_dis(segment<T> l){\n\t\tif(get_cross_point(l).x<1e20)return 0.0;\n\t\treturn min({get_dis(l.V1),get_dis(l.V2),l.get_dis(V1),l.get_dis(V2)});\n\t}\n\t\n\tpoint<T> get_cross_point(segment<T> l){\n\t\tline<T> L1(V1,V2),L2(l.V1,l.V2);\n\t\tpoint<T> P = L1.get_cross_point(L2);\n\t\tif(get_dis(P)<eps&&l.get_dis(P)<eps)return P;\n\t\treturn point<T> (1e20,1e20);\n\t}\n};\n\ntemplate <typename T>\nstruct triangle{\n\tpoint<T> V[3];\n\t\n\ttriangle(point<T> V1,point<T> V2,point<T> V3){\n\t\tV[0] = V1;\n\t\tV[1] = V2;\n\t\tV[2] = V3;\n\t}\n\t\n\tpoint<T> get_circumcenter(){\n\t\tline<T> L1(V[0],V[1]);\n\t\tpoint<T> M1 = V[0].get_midpoint(V[1]);\n\t\tL1 = line<T>(M1,L1.b,L1.a);\n\n\t\tline<T> L2(V[1],V[2]);\n\t\tpoint<T> M2 = V[1].get_midpoint(V[2]);\n\t\tL2 = line<T>(M2,L2.b,L2.a);\n\t\t\t\t\n\t\treturn L1.get_cross_point(L2);\n\t}\n\t\n\tT get_signed_area(){\n\t\treturn ((V[1].x-V[0].x)*(V[2].y-V[0].y) - (V[2].x-V[0].x)*(V[1].y-V[0].y))/2.0;\n\t}\n\t\n\tT get_area(){\n\t\treturn abs(get_signed_area());\n\t}\n\t\n\tbool is_inside(point<T> P){\n\t\tT S = triangle<T>(V[0],V[1],P).get_area() + triangle<T>(V[1],V[2],P).get_area() + triangle<T>(V[2],V[0],P).get_area();\n\t\treturn abs(S - get_area())<eps;\n\t}\n\t\n\tbool is_clockwise(){\n\t\tpoint<T> X = V[1]-V[0],Y = V[2]-V[1];\n\t\treturn X.x*Y.y-X.y*Y.x < 0.0;\n\t}\n\t\n};\n\nint main(){\t\n\n\tint n;\n\tcin>>n;\n\trep(_,n){\n\t\tvector<point<double>> p(3);\n\t\trep(i,3){\n\t\t\tdouble x,y;\n\t\t\tcin>>x>>y;\n\t\t\tp[i] = point<double>(x,y);\n\t\t}\n\t\n\t\ttriangle<double> t(p[0],p[1],p[2]);\n\t\tint xa = 0;\n\t\trep(i,2){\n\t\t\tdouble x,y;\n\t\t\tcin>>x>>y;\n\t\t\tif(t.is_inside(point<double>(x,y)))xa ^= 1;\n\t\t}\n\t\tif(xa)cout<<\"OK\"<<endl;\n\t\telse cout<<\"NG\"<<endl;\n\t}\n\t\n\treturn 0;\n\t\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3812,
"score_of_the_acc": -1.5,
"final_rank": 20
},
{
"submission_id": "aoj_0143_6946838",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\ntemplate<class T> struct point{\n T x, y;\n point(): x(0), y(0){}\n point(T a, T b): x(a), y(b){}\n point& operator += (const point& rhs) {x += rhs.x, y += rhs.y; return *this;}\n point& operator -= (const point& rhs) {x -= rhs.x, y -= rhs.y; return *this;}\n point& operator *= (const T& rhs) {x *= rhs, y *= rhs; return *this;}\n point& operator /= (const T& rhs) {x /= rhs, y /= rhs; return *this;}\n point operator +() const { return *this; }\n point operator -() const { return point() - *this; }\n friend point operator + (const point& lhs, const point& rhs) {return point(lhs) += rhs;}\n friend point operator - (const point& lhs, const point& rhs) {return point(lhs) -= rhs;}\n friend point operator * (const point& lhs, const T& rhs) {return point(lhs) *= rhs;}\n friend point operator * (const T& lhs, const point& rhs) {return point(rhs) *= lhs;}\n friend point operator / (const point& lhs, const T& rhs) {return point(lhs) /= rhs;}\n friend T operator * (const point& lhs, const point& rhs) {return lhs.x * rhs.x + lhs.y * rhs.y;}\n friend T operator ^ (const point& lhs, const point& rhs) {return lhs.x * rhs.y - lhs.y * rhs.x;}\n friend istream& operator >> (istream& os, point& rhs) noexcept {\n os >> rhs.x >> rhs.y;\n return os;\n }\n friend constexpr ostream& operator << (ostream &os, const point& rhs) noexcept {\n return os << '('<< rhs.x << ',' << rhs.y << ')';\n }\n double norm(){return sqrt(x * x + y * y);}\n T norm2(){return x * x + y * y;}\n int orthant(){//第何象限かのベクトルを返す(0,0は0象限とする)\n if(x == 0 && y == 0)return 0;\n if(y > 0)return (x > 0 ? 1 : 2);\n return (x > 0 ? 4 : 3);\n }\n //偏角ソート->ベクトルの大きさの小さい順の優先度\n friend bool operator < (point &lhs, point &rhs){\n int lo = lhs.orthant(), ro = rhs.orthant();\n if(lo != ro)return (lo < ro);\n T cv = (lhs ^ rhs);\n if(cv != 0)return (cv > 0);\n return (lhs.norm2() < rhs.norm2());\n }\n};\n\nint main(){\n int q;\n cin >> q;\n while(q--){\n vector<point<ll>> a(5);\n for(int i = 0; i < 5; i++)cin >> a[i];\n vector<ll> b(3), c(3);\n for(int i = 0; i < 3; i++){\n b[i] = ((a[3] - a[i]) ^ (a[(i + 1) % 3] - a[i]));\n c[i] = ((a[4] - a[i]) ^ (a[(i + 1) % 3] - a[i]));\n }\n sort(b.begin(), b.end());\n sort(c.begin(), c.end());\n if((b[0] * b[2] < 0) ^ (c[0] * c[2] < 2)){\n cout << \"OK\" << '\\n';\n }else{\n cout << \"NG\" << '\\n';\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3344,
"score_of_the_acc": -0.371,
"final_rank": 4
},
{
"submission_id": "aoj_0143_6040336",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i=0; i < (n); i++)\n\ntypedef double D; // 座標値の型。doubleかlong doubleを想定\ntypedef complex<D> P; // Point\ntypedef pair<P, P> L; // Line\ntypedef vector<P> VP;\nconst D EPS = 1e-9; // 許容誤差。問題によって変える\n#define X real()\n#define Y imag()\n#define LE(n,m) ((n) < (m) + EPS)\n#define GE(n,m) ((n) + EPS > (m))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\nD dot(P a, P b) {\n return (conj(a)*b).X;\n}\n\nD cross(P a, P b) {\n return (conj(a)*b).Y;\n}\n\nnamespace std {\n bool operator<(const P a, const P b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n}\n\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inPolygon(const VP& ps, P p) {\n int n = ps.size();\n bool in = false;\n rep (i, n) {\n P a = ps[i] - p;\n P 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\nint main(){\n int N;\n cin >> N;\n for(int i=0;i<N;i++){\n VP vec(3);\n for(int j=0;j<3;j++){\n D x,y;\n cin >> x >> y;\n complex<D> c(x,y);\n vec[j] = c;\n }\n D x1,y1,x2,y2;\n cin >> x1 >> y1 >> x2 >> y2;\n complex<D> A(x1,y1),B(x2,y2);\n if(inPolygon(vec,A)+inPolygon(vec,B) == 1) cout << \"OK\" << endl;\n else cout << \"NG\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3508,
"score_of_the_acc": -1.0914,
"final_rank": 17
},
{
"submission_id": "aoj_0143_5833832",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\ndouble cross(double x1,double y1,double x2,double y2){\n\treturn x1*y2-x2*y1;\n}\nbool intri(double x1,double y1,double x2,double y2,double x3,double y3,double xp,double yp){\n\tdouble c1=cross(x2-x1,y2-y1,xp-x1,yp-y1),c2=cross(x3-x2,y3-y2,xp-x2,yp-y2),c3=cross(x1-x3,y1-y3,xp-x3,yp-y3);\n\treturn c1>=0&&c2>=0&&c3>=0||c1<=0&&c2<=0&&c3<=0;\n}\nsigned main(){\n\tint n,xp1,yp1,xp2,yp2,xp3,yp3,xk,yk,xs,ys;\n\tcin>>n;\n\twhile(cin>>xp1>>yp1>>xp2>>yp2>>xp3>>yp3>>xk>>yk>>xs>>ys){\n\t\tbool k=intri(xp1,yp1,xp2,yp2,xp3,yp3,xk,yk),s=intri(xp1,yp1,xp2,yp2,xp3,yp3,xs,ys);\n\t\tcout<<(k!=s?\"OK\":\"NG\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3196,
"score_of_the_acc": -0.172,
"final_rank": 3
},
{
"submission_id": "aoj_0143_4434101",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nusing real = double;\nstatic constexpr real EPS = 1e-10;\nstruct Point {\n real x, y;\n Point& operator+=(const Point a) { x += a.x; y += a.y; return *this; }\n Point& operator-=(const Point a) { x -= a.x; y -= a.y; return *this; }\n Point& operator*=(const real k) { x *= k; y *= k; return *this; }\n Point& operator/=(const real k) { x /= k; y /= k; return *this; }\n Point operator+(const Point a) const {return Point(*this) += a; }\n Point operator-(const Point a) const {return Point(*this) -= a; }\n Point operator*(const real k) const {return Point(*this) *= k; }\n Point operator/(const real k) const {return Point(*this) /= k; }\n bool operator<(const Point &a) const { return (x != a.x ? x < a.x : y < a.y); }\n explicit Point(real a = 0, real b = 0) : x(a), y(b) {};\n};\n\nbool sorty(Point a, Point b){\n return (a.y != b.y ? a.y < b.y : a.x < b.x);\n}\n\nistream& operator>> (istream& s, Point& P){\n s >> P.x >> P.y;\n return s;\n}\n\ninline real dot(Point a, Point b){ return a.x*b.x + a.y*b.y; }\ninline real cross(Point a, Point b){ return a.x*b.y - a.y*b.x; }\ninline real abs(Point a){ return sqrt(dot(a, a)); }\n\n\nreal angle(Point A, Point B){\n return acos(dot(A, B)/abs(A)/abs(B));\n}\n\n\n\nstatic constexpr int COUNTER_CLOCKWISE = 1;\nstatic constexpr int CLOCKWISE = -1;\nstatic constexpr int ONLINE_BACK = 2;\nstatic constexpr int ONLINE_FRONT = -2;\nstatic constexpr int ON_SEGMENT = 0;\n\nint ccw(Point a, Point b, Point c){\n b -= a; c -= a;\n if(cross(b, c) > EPS) return COUNTER_CLOCKWISE;\n if(cross(b, c) < -EPS) return CLOCKWISE;\n if(dot(b, c) < 0) return ONLINE_BACK;\n if(abs(b) < abs(c)) return ONLINE_FRONT;\n return ON_SEGMENT;\n}\nstruct Segment {\n Point a, b;\n Segment(Point x, Point y) : a(x), b(y) {};\n};\n\nstruct Line {\n Point a, b;\n Line(Point x, Point y) : a(x), b(y) {};\n};\n\nstruct Circle{\n Point c; real r;\n Circle(Point c, real r): c(c), r(r) {};\n};\n\nusing Polygon = vector<Point>;\n\nbool intersect(Segment s, 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\nbool intersect(Segment s, Line t){\n int a = ccw(t.a, t.b, s.a), b = ccw(t.a, t.b, s.b);\n return (!(a&1) || !(b&1) || a != b);\n}\n\nPoint polar(double r, double t){\n return Point(r*cos(t), r*sin(t));\n}\n\ndouble arg(Point p){\n return atan2(p.y, p.x);\n}\n\nstatic constexpr int CONTAIN = 0;\nstatic constexpr int INSCRIBE = 1;\nstatic constexpr int INTERSECT = 2;\nstatic constexpr int CIRCUMSCRIBED = 3;\nstatic constexpr int SEPARATE = 4;\n\nint intersect(Circle c1, Circle c2){\n if(c1.r < c2.r) swap(c1, c2);\n real d = abs(c1.c-c2.c);\n real r = c1.r + c2.r;\n if(fabs(d-r) < EPS) return CIRCUMSCRIBED;\n if(d > r) return SEPARATE;\n if(fabs(d+c2.r-c1.r) < EPS) return INSCRIBE;\n if(d+c2.r < c1.r) return CONTAIN;\n return INTERSECT;\n}\n\nreal distance(Line l, Point c){\n return abs(cross(l.b-l.a, c-l.a)/abs(l.b-l.a));\n}\n\n\nreal distance(Segment s, Point c){\n if(dot(s.b-s.a, c-s.a) < EPS) return abs(c-s.a);\n if(dot(s.a-s.b, c-s.b) < EPS) return abs(c-s.b);\n return abs(cross(s.b-s.a, c-s.a)) / abs(s.a-s.b);\n}\n\nreal distance(Segment s, Segment t){\n if(intersect(s, t)) return 0.0;\n return min({distance(s, t.a), distance(s, t.b),\n distance(t, s.a), distance(t, s.b)});\n}\n\n\nPoint project(Line l, Point p){\n Point Q = l.b-l.a;\n return l.a + Q*(dot(p-l.a, Q) / dot(Q, Q));\n}\n\n\nPoint project(Segment s, Point p){\n Point Q = s.b-s.a;\n return s.a + Q*(dot(p-s.a, Q) / dot(Q, Q));\n}\n\nPoint refrect(Segment s, Point p){\n Point Q = project(s, p);\n return Q*2-p;\n}\n\nbool isOrthogonal(Segment s, Segment t){\n return fabs(dot(s.b-s.a, t.b-t.a)) < EPS;\n}\n\nbool isparallel(Segment s, Segment t){\n return fabs(cross(s.b-s.a, t.b-t.a)) < EPS;\n}\n\n\nPoint crossPoint(Segment s, Segment t){\n real d1 = cross(s.b-s.a, t.b-t.a);\n real d2 = cross(s.b-s.a, s.b-t.a);\n if(fabs(d1) < EPS && fabs(d2) < EPS) return t.a;\n return t.a+(t.b-t.a)*d2/d1;\n}\n\nPoint crossPoint(Line s, Line t){\n real d1 = cross(s.b-s.a, t.b-t.a);\n real d2 = cross(s.b-s.a, s.b-t.a);\n if(fabs(d1) < EPS && fabs(d2) < EPS) return t.a;\n return t.a+(t.b-t.a)*d2/d1;\n}\n\nPolygon crossPoint(Circle c, Line l){\n Point p = project(l, c.c), q = (l.b-l.a)/abs(l.b-l.a);\n if(abs(distance(l, c.c)-c.r) < EPS){\n return {p};\n }\n double k = sqrt(c.r*c.r-dot(p-c.c, p-c.c));\n return {p-q*k, p+q*k};\n}\n\nPolygon crossPoint(Circle c, Segment s){\n auto tmp = crossPoint(c, Line(s.a, s.b));\n Polygon ret;\n for (auto &&i : tmp) {\n if(distance(s, i) < EPS) ret.emplace_back(i);\n }\n return ret;\n}\n\n\nPolygon crossPoint(Circle c1, Circle 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 {c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a)};\n}\n\nPolygon tangent(Circle c1, Point p){\n Circle c2 = Circle(p, sqrt(dot(c1.c-p, c1.c-p)-c1.r*c1.r));\n return crossPoint(c1, c2);\n}\nvector<Line> tangent(Circle c1, Circle c2){\n vector<Line> ret;\n if(c1.r < c2.r) swap(c1, c2);\n double k = dot(c1.c-c2.c, c1.c-c2.c);\n if(abs(k) < EPS) return {};\n Point u = (c2.c-c1.c)/sqrt(k);\n Point v(-u.y, u.x);\n for (auto &&i : {-1, 1}) {\n double h = (c1.r+i*c2.r)/sqrt(k);\n if(abs(h*h-1) < EPS){\n ret.emplace_back(c1.c+u*c1.r, c1.c+(u+v)*c1.r);\n }else if(h*h < 1){\n Point u2 = u*h, v2 = v*sqrt(1-h*h);\n ret.emplace_back(c1.c+(u2+v2)*c1.r, c2.c-(u2+v2)*c2.r*i);\n ret.emplace_back(c1.c+(u2-v2)*c1.r, c2.c-(u2-v2)*c2.r*i);\n }\n }\n return ret;\n}\n\nreal area(Polygon v){\n if(v.size() < 3) return 0.0;\n real ans = 0.0;\n for (int i = 0; i < v.size(); ++i) {\n ans += cross(v[i], v[(i+1)%v.size()]);\n }\n return ans/2;\n}\n\nreal area(Circle c, Polygon &v){\n int n = v.size();\n real ans = 0.0;\n Polygon u;\n for (int i = 0; i < n; ++i) {\n u.emplace_back(v[i]);\n auto q = crossPoint(c, Segment(v[i], v[(i+1)%n]));\n for (auto &&j : q) {\n u.emplace_back(j);\n }\n }\n for (int i = 0; i < u.size(); ++i) {\n Point A = u[i]-c.c, B = u[(i+1)%u.size()]-c.c;\n if(abs(A) >= c.r+EPS || abs(B) >= c.r+EPS){\n Point C = polar(1, arg(B)-arg(A));\n ans += c.r*c.r*arg(C)/2;\n }else {\n ans += cross(A, B)/2;\n }\n }\n return ans;\n}\n\nPolygon convex_hull(Polygon v){\n int n = v.size();\n sort(v.begin(),v.end(), sorty);\n int k = 0;\n Polygon ret(n*2);\n for (int i = 0; i < n; ++i) {\n while(k > 1 && cross(ret[k-1]-ret[k-2], v[i]-ret[k-1]) < 0) k--;\n ret[k++] = v[i];\n }\n for(int i = n-2, t=k; i >= 0; i--){\n while(k > t && cross(ret[k-1]-ret[k-2], v[i]-ret[k-1]) < 0) k--;\n ret[k++] = v[i];\n }\n ret.resize(k-1);\n return ret;\n}\n\nbool isconvex(Polygon v){\n int n = v.size();\n for (int i = 0; i < n; ++i) {\n if(ccw(v[(i+n-1)%n], v[i], v[(i+1)%n]) == CLOCKWISE) return false;\n }\n return true;\n}\n\nint contains(Polygon v, Point p){\n int n = v.size();\n bool x = false;\n static constexpr int IN = 2;\n static constexpr int ON = 1;\n static constexpr int OUT = 0;\n for (int i = 0; i < n; ++i) {\n Point a = v[i]-p, b = v[(i+1)%n]-p;\n if(fabs(cross(a, b)) < EPS && dot(a, b) < EPS) return ON;\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?IN:OUT);\n}\n\nreal diameter(Polygon v){\n int n = v.size();\n if(n == 2) return abs(v[0]-v[1]);\n int i = 0, j = 0;\n for (int k = 0; k < n; ++k) {\n if(v[i] < v[k]) i = k;\n if(!(v[j] < v[k])) j = k;\n }\n real ret = 0;\n int si = i, sj = j;\n while(i != sj || j != si){\n ret = max(ret, abs(v[i]-v[j]));\n if(cross(v[(i+1)%n]-v[i], v[(j+1)%n]-v[j]) < 0.0) i = (i+1)%n;\n else j = (j+1)%n;\n }\n return ret;\n}\n\nPolygon convexCut(Polygon v, Line l){\n Polygon q;\n int n = v.size();\n for (int i = 0; i < n; ++i) {\n Point a = v[i], b = v[(i+1)%n];\n if(ccw(l.a, l.b, a) != -1) q.push_back(a);\n if(ccw(l.a, l.b, a)*ccw(l.a, l.b, b) < 0){\n q.push_back(crossPoint(Line(a, b), l));\n }\n }\n return q;\n}\n\nreal closest_pair(Polygon &v, int l = 0, int r = -1){\n if(!(~r)){\n r = v.size();\n sort(v.begin(),v.end());\n }\n if(r - l < 2) {\n return abs(v.front()-v.back());\n }\n int mid = (l+r)/2;\n real p = v[mid].x;\n real d = min(closest_pair(v, l, mid), closest_pair(v, mid, r));\n inplace_merge(v.begin()+l, v.begin()+mid, v.begin()+r, sorty);\n Polygon u;\n for (int i = l; i < r; ++i) {\n if(fabs(v[i].x-p) >= d) continue;\n for (int j = 0; j < u.size(); ++j) {\n real dy = v[i].y-next(u.rbegin(), j)->y;\n if(dy >= d) break;\n d = min(d, abs(v[i]-*next(u.rbegin(), j)));\n }\n u.emplace_back(v[i]);\n }\n return d;\n}\n\nint main() {\n int n;\n cin >> n;\n for (int i = 0; i < n; ++i) {\n Point A, B, C, p, q;\n cin >> A >> B >> C >> p >> q;\n Polygon X{A, B, C};\n if(contains(X, p) != contains(X, q)) puts(\"OK\");\n else puts(\"NG\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3124,
"score_of_the_acc": -1.0753,
"final_rank": 16
},
{
"submission_id": "aoj_0143_4314731",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n\nusing namespace std;\n\nbool IsInTriangle(int x1, int y1, int x2, int y2, int x3, int y3, int x0, int y0)\n{\n\tint v1 = (x2 - x1) * (y0 - y1) - (y2 - y1) * (x0 - x1);\n\tint v2 = (x3 - x2) * (y0 - y2) - (y3 - y2) * (x0 - x2);\n\tint v3 = (x1 - x3) * (y0 - y3) - (y1 - y3) * (x0 - x3);\n\n\treturn (v1 > 0 && v2 > 0 && v3 > 0) || (v1 < 0 && v2 < 0 && v3 < 0);\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint xp1, yp1, xp2, yp2, xp3, yp3, xk, yk, xs, ys;\n\tfor (size_t i = 0; i < n; i++)\n\t{\n\t\tcin >> xp1 >> yp1 >> xp2 >> yp2 >> xp3 >> yp3 >> xk >> yk >> xs >> ys;\n\t\tif (IsInTriangle(xp1, yp1, xp2, yp2, xp3, yp3, xk, yk) ^\n\t\t\tIsInTriangle(xp1, yp1, xp2, yp2, xp3, yp3, xs, ys))\n\t\t\tcout << \"OK\";\n\t\telse\n\t\t\tcout << \"NG\";\n\t\tcout << endl;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3088,
"score_of_the_acc": -0.0269,
"final_rank": 2
},
{
"submission_id": "aoj_0143_4297409",
"code_snippet": "/* is_contain_in_triangle.cpp\n 点が三角形に含まれているか判定する\n\n verified:\n AOJ 0143\n http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0143\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing D = double;\n\n// P: 点,座標\nusing P = std::complex<D>;\nnamespace std {\nbool operator<(const P& a, const P& b) { return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b); }\nbool operator>(const P& a, const P& b) { return real(a) != real(b) ? real(a) > real(b) : imag(a) > imag(b); }\n} // namespace std\nD dot(const P& a, const P& b) { return real(conj(a) * b); } // 内積\nD cross(const P& a, const P& b) { return imag(conj(a) * b); } // 外積\nD norm(const P& a) { return dot(a, a); }\n\nconst D PI = std::acos(-1);\nconst D EPS = 1e-10;\nconst D INF = 1e12;\n\nint sgn(D a) { return (a < -EPS) ? -1 : (a > EPS) ? 1 : 0; } // 比較\n\n/* ccw(a,b,c)\n 出力:\n 1: a-bから見てcは反時計, -1: a-bから見てcは時計\n 2: c-a-bで直線, -2: a-b-cで直線, 0: a-c-bで直線\n*/\nint ccw(const P& a, const P& b, const P& c) {\n if (sgn(cross(b - a, c - a)) == 1) return 1; // 1: a-bから見てcは反時計\n if (sgn(cross(b - a, c - a)) == -1) return -1; //-1: a-bから見てcは時計\n if (sgn(dot(b - a, c - a)) == -1) return 2; // 2: c-a-bで直線\n if (sgn(norm(c - a) - norm(b - a)) == 1) return -2; //-2: a-b-cで直線\n return 0; // 0: a-c-bで直線\n}\n\n/* is_contain_in_triangle(p, a,b,c)\n p が 三角形abc に含まれていれば true を返す\n*/\nbool is_contain_in_triangle(const P& p, const P& a, const P& b, const P& c) {\n int r1 = ccw(p, b, c), r2 = ccw(p, c, a), r3 = ccw(p, a, b);\n if (r1 == r2 && r2 == r3 && (r1 == 1 || r1 == -1)) return true;\n return false;\n}\n\nint main() {\n int n;\n cin >> n;\n vector<int> ans(n);\n for (int i = 0; i < n; i++) {\n D x, y;\n P p[3];\n for (int j = 0; j < 3; j++) {\n cin >> x >> y;\n P tmp(x, y);\n p[j] = tmp;\n }\n cin >> x >> y;\n P k(x, y);\n cin >> x >> y;\n P s(x, y);\n\n if (is_contain_in_triangle(k, p[0], p[1], p[2]) ^ is_contain_in_triangle(s, p[0], p[1], p[2])) {\n ans[i] = 1;\n } else {\n ans[i] = 0;\n }\n }\n\n for (int i = 0; i < n; i++) {\n if (ans[i]) {\n cout << \"OK\\n\";\n } else {\n cout << \"NG\\n\";\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3248,
"score_of_the_acc": -0.7419,
"final_rank": 13
},
{
"submission_id": "aoj_0143_4165791",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nstruct Point{\n int x;\n int y;\n}typedef point;\n\nbool contain(point* p1, point* p2, point* p3, point* p);\n\nint main(void){\n int n;\n cin>>n;\n int xp1,yp1,xp2,yp2,xp3,yp3,xk,yk,xs,ys;\n point p1,p2,p3,pk,ps;\n bool s,k;\n for(int i=0;i<n;i++){\n cin>>xp1>>yp1>>xp2>>yp2>>xp3>>yp3>>xk>>yk>>xs>>ys;\n p1.x=xp1;\n p1.y=yp1;\n p2.x=xp2;\n p2.y=yp2;\n p3.x=xp3;\n p3.y=yp3;\n pk.x=xk;\n pk.y=yk;\n ps.x=xs;\n ps.y=ys;\n s=contain(&p1,&p2,&p3,&ps);\n k=contain(&p1,&p2,&p3,&pk);\n if(s==k){\n cout<<\"NG\"<<endl;\n }\n else{\n cout<<\"OK\"<<endl;\n }\n }\n return 0;\n}\n\nbool contain(point* p1, point* p2, point* p3, point* p){\n int z1=0;\n int z2=0;\n z1+=(p1->x-p->x)*(p2->y-p->y)-(p2->x-p->x)*(p1->y-p->y);\n z2+=abs((p1->x-p->x)*(p2->y-p->y)-(p2->x-p->x)*(p1->y-p->y));\n z1+=(p2->x-p->x)*(p3->y-p->y)-(p3->x-p->x)*(p2->y-p->y);\n z2+=abs((p2->x-p->x)*(p3->y-p->y)-(p3->x-p->x)*(p2->y-p->y));\n z1+=(p3->x-p->x)*(p1->y-p->y)-(p1->x-p->x)*(p3->y-p->y);\n z2+=abs((p3->x-p->x)*(p1->y-p->y)-(p1->x-p->x)*(p3->y-p->y));\n if(abs(z1)==z2){\n return true;\n }\n else{\n return false;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3088,
"score_of_the_acc": -0.5269,
"final_rank": 7
},
{
"submission_id": "aoj_0143_4131118",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<cmath>\n#define int long long\n#define mod 1000000007\n#define for0(i, n) for(int i = 0; i < (n); i++)\n#define for1(i, n) for(int i = 1; i <= (n);i++)\nusing namespace std;\nint get() { int r; cin >> r; return r; }\nvoid solve() {\n\tdouble x[5], y[5], xs, ys, xt, yt;\n\tcin >> x[1] >> y[1] >> x[2] >> y[2] >> x[0] >> y[0] >> xs >> ys >> xt >> yt;\n\tint i1 = 1, i2 = 1, a = 1, b = 2, c = 0;\n\tfor1(i, 3) {\n\t\tif (((x[a] - x[b]) * (ys - y[a]) - (y[a] - y[b]) * (xs - x[a])) * ((x[a] - x[b]) * (y[c] - y[a]) - (y[a] - y[b]) * (x[c] - x[a])) < 0)i1 = 0;\n\t\tif (((x[a] - x[b]) * (yt - y[a]) - (y[a] - y[b]) * (xt - x[a])) * ((x[a] - x[b]) * (y[c] - y[a]) - (y[a] - y[b]) * (x[c] - x[a])) < 0)i2 = 0;\n\t\ta++; b++; c++;\n\t\tif (a >= 3)a %= 3;\n\t\tif (b >= 3)b %= 3;\n\t\tif (c >= 3)c %= 3;\n\t}\n\tcout << (i1 + i2 == 1 ? \"OK\\n\" : \"NG\\n\");\n}\nsigned main() {\n\tint n; cin >> n; for1(i, n)solve();\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3068,
"score_of_the_acc": -1,
"final_rank": 15
},
{
"submission_id": "aoj_0143_4011035",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass Point {\npublic:\n\tint x, y;\n};\n\nPoint PointData[5];\n\n\nint isExistTriangle(const Point& p) {\n\n\tint r1 = (PointData[1].x - PointData[0].x) * (p.y - PointData[0].y) - (p.x - PointData[0].x) * (PointData[1].y - PointData[0].y);\n\tint r2 = (PointData[2].x - PointData[1].x) * (p.y - PointData[1].y) - (p.x - PointData[1].x) * (PointData[2].y - PointData[1].y);\n\tint r3 = (PointData[0].x - PointData[2].x) * (p.y - PointData[2].y) - (p.x - PointData[2].x) * (PointData[0].y - PointData[2].y);\n\n\tif (r1 > 0 && r2 > 0 && r3 > 0) {\n\t\treturn 1;\n\t}\n\tif (r1 < 0 && r2 < 0 && r3 < 0) {\n\t\treturn 1;\n\t}\n\treturn -1;\n}\n\nint main(void) {\n\tint n, flag1, flag2;\n\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tfor (int j = 0; j < 5; j++) {\n\t\t\tcin >> PointData[j].x >> PointData[j].y;\n\t\t}\n\t\t\n\t\tflag1 = isExistTriangle(PointData[3]);\n\t\tflag2 = isExistTriangle(PointData[4]);\n\t\t//cout << flag1 << ends << flag2 << endl;\n\t\tif (flag1*flag2 == 1) {\n\t\t\tcout << \"NG\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"OK\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3080,
"score_of_the_acc": -0.0161,
"final_rank": 1
},
{
"submission_id": "aoj_0143_4011030",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass Point {\npublic:\n\tint x, y;\n};\n\nPoint PointData[5];\n\n\nint isExistTriangle(const Point& p) {\n\n\tint r1 = (PointData[1].x - PointData[0].x) * (p.y - PointData[0].y) - (p.x - PointData[0].x) * (PointData[1].y - PointData[0].y);\n\tint r2 = (PointData[2].x - PointData[1].x) * (p.y - PointData[1].y) - (p.x - PointData[1].x) * (PointData[2].y - PointData[1].y);\n\tint r3 = (PointData[0].x - PointData[2].x) * (p.y - PointData[2].y) - (p.x - PointData[2].x) * (PointData[0].y - PointData[2].y);\n\n\tif (r1 >= 0 && r2 >= 0 && r3 >= 0) {\n\t\treturn 1;\n\t}\n\tif (r1 <= 0 && r2 <= 0 && r3 <= 0) {\n\t\treturn 1;\n\t}\n\treturn -1;\n}\n\nint main(void) {\n\tint n, flag1, flag2;\n\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tfor (int j = 0; j < 5; j++) {\n\t\t\tcin >> PointData[j].x >> PointData[j].y;\n\t\t}\n\t\t\n\t\tflag1 = isExistTriangle(PointData[3]);\n\t\tflag2 = isExistTriangle(PointData[4]);\n\t\t//cout << flag1 << ends << flag2 << endl;\n\t\tif (flag1*flag2 == 1) {\n\t\t\tcout << \"NG\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"OK\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3080,
"score_of_the_acc": -0.5161,
"final_rank": 6
},
{
"submission_id": "aoj_0143_3979056",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <vector>\n#include <iostream>\n#include <vector>\n#include <string>\n#include <cassert>\n#include <algorithm>\n#include <functional>\n#include <cmath>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <map>\n#include <iomanip>\n#include <utility>\n#include <stack>\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define all(x) (x).begin(),(x).end()\n#define rep3(var, min, max) for (ll (var) = (min); (var) < (max); ++(var))\n#define repi3(var, min, max) for (ll (var) = (max) - 1; (var) + 1 > (min); --(var))\n#define Mp(a,b) make_pair((a),(b))\n#define F first\n#define S second\n#define Icin(s) ll (s);cin>>(s);\n#define Scin(s) ll (s);cin>>(s);\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; }\nconst double EPS=1e-10;\ndouble add(double l, double r){\n if(abs(l+r)<EPS*(abs(l)+abs(r))) return 0;\n return l+r;\n}\n//l-r は add(l,-r)\n//l==r は add(l,-r)==0\nstruct Pt{\n double x, y;\n Pt(double xx=0, double yy=0){x=xx; y=yy;}\n Pt& operator=(const Pt &rhs){\n x=rhs.x; y=rhs.y; return *this;\n }\n Pt& operator+=(const Pt &rhs){\n x = add(x,rhs.x); y = add(y,rhs.y); return *this;\n }\n Pt& operator-=(const Pt &rhs){\n x = add(x,-rhs.x); y = add(y,-rhs.y); return *this;\n }\n Pt& operator*=(const double &rhs){\n x *= rhs; y *= rhs; return *this;\n }\n Pt& operator/=(const double &rhs){\n x /= rhs; y /= rhs; return *this;\n }\n};\nPt operator+(const Pt &a){return a;}\nPt operator-(const Pt &a){return Pt(-a.x,-a.y);}\nPt operator+(const Pt &lhs, const Pt &rhs){\n Pt ans=lhs; ans += rhs; return ans;\n}\nPt operator-(const Pt &lhs, const Pt &rhs){\n Pt ans=lhs; ans -= rhs; return ans;\n}\nPt operator*(const Pt &lhs, const double &rhs){\n Pt ans=lhs; ans *= rhs; return ans;\n}\nPt operator*(const double &lhs, const Pt &rhs){\n Pt ans=rhs; ans *= lhs; return ans;\n}\nPt operator/(const Pt &lhs, const double &rhs){\n Pt ans=lhs; ans /= rhs; return ans;\n}\nbool operator==(const Pt &lhs, const Pt &rhs){\n return add(lhs.x,-rhs.x)==0 && add(lhs.y,-rhs.y)==0;\n}\nbool operator!=(const Pt &lhs, const Pt &rhs){return !(lhs==rhs);}\nbool operator<(const Pt &lhs, const Pt &rhs){\n return add(lhs.x,-rhs.x)!=0 ? lhs.x<rhs.x : add(lhs.y,-rhs.y)<0;\n}\nbool operator>(const Pt &lhs, const Pt &rhs){return rhs<lhs;}\nbool operator<=(const Pt &lhs, const Pt &rhs){return !(lhs>rhs);}\nbool operator>=(const Pt &lhs, const Pt &rhs){return !(lhs<rhs);}\nistream& operator>>(istream &is, Pt &rhs){\n double x, y;\n is >> x >> y;\n rhs=Pt(x,y);\n return is;\n}\nostream& operator<<(ostream &os, const Pt &rhs){\n os << rhs.x << \" \" << rhs.y;\n return os;\n}\ndouble norm(const Pt &a){return add(a.x*a.x,a.y*a.y);}\ndouble abs(const Pt &a){return sqrt(norm(a));}\ndouble dot(Pt a, Pt b){return add(a.x*b.x,a.y*b.y);}\ndouble cross(Pt a, Pt b){return add(a.x*b.y,-a.y*b.x);}\nint ccw(Pt a, Pt b, Pt c) {\n b -= a; c -= a;\n if(cross(b, c)>0) return +2; // counter clockwise\n if(cross(b, c)<0) return -2; // clockwise\n if(dot(b, c)<0) return +1; // c--a--b on line\n if(norm(c)<norm(b)) return -1; // b--c--a on line\n return 0; // a--b--c on line\n}\nbool judge_cross(ld ax,ld ay,ld bx,ld by,ld cx,ld cy,ld dx,ld dy){\n ld ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);\n ld tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);\n ld tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);\n ld td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);\n\n return tc * td < 0 && ta * tb < 0;\n}\nint main(){\n int n;\n cin>>n;\n rep(i,n){\n vector<Pt> vec(3);\n rep(j,3)cin>>vec[j];\n ld xk,yk,xs,ys;\n cin>>xk>>yk>>xs>>ys;\n int c=0;\n if(judge_cross(vec[0].x,vec[0].y,vec[1].x,vec[1].y,xk,yk,xs,ys))c++;\n if(judge_cross(vec[1].x,vec[1].y,vec[2].x,vec[2].y,xk,yk,xs,ys))c++;\n if(judge_cross(vec[2].x,vec[2].y,vec[0].x,vec[0].y,xk,yk,xs,ys))c++;\n //cout<<c<<endl;\n if(c==0||c==2){\n cout<<\"NG\"<<endl;\n }else{\n cout<<\"OK\"<<endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3144,
"score_of_the_acc": -0.6022,
"final_rank": 11
},
{
"submission_id": "aoj_0143_3978978",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n// #define double long double\n#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)\n#define FORR(i, a, b) for(ll i = (a); i > (b); --i)\n#define REP(i, n) for(ll i = 0; i < (n); ++i)\n#define REPR(i, n) for(ll i = n; i >= 0; i--)\n#define FOREACH(x, a) for(auto &(x) : (a))\n#define VECCIN(x) \\\n for(auto &youso_ : (x)) cin >> youso_\n#define bitcnt __builtin_popcount\n#define SZ(x) ((ll)(x).size())\n#define fi first\n#define se second\n#define All(a) (a).begin(), (a).end()\n#define rAll(a) (a).rbegin(), (a).rend()\ntemplate <typename T = long long> inline T IN() {\n T x;\n cin >> x;\n return (x);\n}\ninline void CIN() {}\ntemplate <class Head, class... Tail>\ninline void CIN(Head &&head, Tail &&... tail) {\n cin >> head;\n CIN(move(tail)...);\n}\n#define CCIN(...) \\\n char __VA_ARGS__; \\\n CIN(__VA_ARGS__)\n#define DCIN(...) \\\n double __VA_ARGS__; \\\n CIN(__VA_ARGS__)\n#define LCIN(...) \\\n ll __VA_ARGS__; \\\n CIN(__VA_ARGS__)\n#define SCIN(...) \\\n string __VA_ARGS__; \\\n CIN(__VA_ARGS__)\n#define Printv(v) \\\n { \\\n REP(x, v.size()) { cout << v[x] << (x == v.size() - 1 ? \"\\n\" : \" \"); } \\\n }\ntemplate <typename T = string> inline void eputs(T s) {\n cout << s << \"\\n\";\n exit(0);\n}\ntemplate <typename A, size_t N, typename T>\nvoid Fill(A (&array)[N], const T &val) {\n std::fill((T *)array, (T *)(array + N), val);\n}\ntemplate <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T> using PQ = priority_queue<T>;\n\ntypedef long long ll;\ntypedef pair<ll, ll> PL;\ntypedef vector<PL> VPL;\ntypedef vector<ll> VL;\ntypedef vector<VL> VVL;\ntypedef vector<double> VD;\n\nconst int INF = 1e9;\nconst int MOD = 1e9 + 7;\nconst ll LINF = 1e18;\nconst ll dx[] = {1, 0, -1, 0};\nconst ll dy[] = {0, 1, 0, -1};\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n#define PI 3.141592653589793238\n\n// COUNTER CLOCKWISE\nstatic const int CCW_COUNTER_CLOCKWISE = 1;\nstatic const int CCW_CLOCKWISE = -1;\nstatic const int CCW_ONLINE_BACK = 2;\nstatic const int CCW_ONLINE_FRONT = -2;\nstatic const int CCW_ON_SEGMENT = 0;\n\n// Intercsect Circle & Circle\nstatic const int ICC_SEPERATE = 4;\nstatic const int ICC_CIRCUMSCRIBE = 3;\nstatic const int ICC_INTERSECT = 2;\nstatic const int ICC_INSCRIBE = 1;\nstatic const int ICC_CONTAIN = 0;\n\nstruct Point {\n double x, y;\n Point() {}\n Point(double x, double y) : x(x), y(y) {}\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 k) { return Point(x * k, y * k); }\n Point operator/(double k) { return Point(x / k, y / k); }\n double norm() { return x * x + y * y; }\n double abs() { return sqrt(norm()); }\n\n bool operator<(const Point &p) const {\n return x != p.x ? x < p.x : y < p.y;\n // grid-point only\n // return !equals(x,p.x)?x<p.x:!equals(y,p.y)?y<p.y:0;\n }\n\n bool operator==(const Point &p) const {\n return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;\n }\n};\n\nstruct EndPoint {\n Point p;\n int seg, st;\n EndPoint() {}\n EndPoint(Point p, int seg, int st) : p(p), seg(seg), st(st) {}\n bool operator<(const EndPoint &ep) const {\n if(p.y == ep.p.y) return st < ep.st;\n return p.y < ep.p.y;\n }\n};\n\nistream &operator>>(istream &is, Point &p) {\n is >> p.x >> p.y;\n return is;\n}\n\nostream &operator<<(ostream &os, Point p) {\n os << fixed << setprecision(12) << p.x << \" \" << p.y;\n return os;\n}\n\nbool sort_x(Point a, Point b) { return a.x != b.x ? a.x < b.x : a.y < b.y; }\n\nbool sort_y(Point a, Point b) { return a.y != b.y ? a.y < b.y : a.x < b.x; }\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nistream &operator>>(istream &is, Polygon &p) {\n for(int i = 0; i < (int)p.size(); i++) is >> p[i];\n return is;\n}\n\nstruct Segment {\n Point p1, p2;\n Segment() {}\n Segment(Point p1, Point p2) : p1(p1), p2(p2) {}\n};\ntypedef Segment Line;\n\nistream &operator>>(istream &is, Segment &s) {\n is >> s.p1 >> s.p2;\n return is;\n}\n\nstruct Circle {\n Point c;\n double r;\n Circle() {}\n Circle(Point c, double r) : c(c), r(r) {}\n};\n\nistream &operator>>(istream &is, Circle &c) {\n is >> c.c >> c.r;\n return is;\n}\n\ndouble norm(Vector a) { return a.x * a.x + a.y * a.y; }\ndouble abs(Vector a) { return sqrt(norm(a)); }\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 orth(Point p) { return Point(-p.y, p.x); }\n\nbool isOrthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }\n\nbool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {\n return isOrthogonal(a1 - a2, b1 - b2);\n}\n\nbool isOrthogonal(Segment s1, Segment s2) {\n return equals(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\n}\n\nbool isParallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }\n\nbool isParallel(Point a1, Point a2, Point b1, Point b2) {\n return isParallel(a1 - a2, b1 - b2);\n}\n\nbool isParallel(Segment s1, Segment s2) {\n return equals(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\n}\n\nPoint project(Segment s, Point p) {\n Vector base = s.p2 - s.p1;\n double r = dot(p - s.p1, base) / norm(base);\n return s.p1 + base * r;\n}\n\nPoint reflect(Segment s, Point p) { return p + (project(s, p) - p) * 2.0; }\n\ndouble arg(Vector p) { return atan2(p.y, p.x); }\n\nVector polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }\n\nint ccw(Point p0, Point p1, Point p2);\nbool intersectSS(Point p1, Point p2, Point p3, Point p4);\nbool intersectSS(Segment s1, Segment s2);\nbool intersectPS(Polygon p, Segment l);\nint intersectCC(Circle c1, Circle c2);\nbool intersectSC(Segment s, Circle c);\ndouble getDistanceLP(Line l, Point p);\ndouble getDistanceSP(Segment s, Point p);\ndouble getDistanceSS(Segment s1, Segment s2);\nPoint getCrossPointSS(Segment s1, Segment s2);\nPoint getCrossPointLL(Line l1, Line l2);\nPolygon getCrossPointCL(Circle c, Line l);\nPolygon getCrossPointCC(Circle c1, Circle c2);\nint contains(Polygon g, Point p);\nPolygon andrewScan(Polygon s);\nPolygon convex_hull(Polygon ps);\ndouble diameter(Polygon s);\nbool isConvex(Polygon p);\ndouble area(Polygon s);\nPolygon convexCut(Polygon p, Line l);\nLine bisector(Point p1, Point p2);\nVector translate(Vector v, double theta);\nvector<Line> corner(Line l1, Line l2);\nvector<vector<int>> segmentArrangement(vector<Segment> &ss, Polygon &ps);\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 CCW_COUNTER_CLOCKWISE;\n if(cross(a, b) < -EPS) return CCW_CLOCKWISE;\n if(dot(a, b) < -EPS) return CCW_ONLINE_BACK;\n if(a.norm() < b.norm()) return CCW_ONLINE_FRONT;\n return CCW_ON_SEGMENT;\n}\n\nbool intersectSS(Point p1, Point p2, Point p3, Point p4) {\n return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&\n ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);\n}\n\nbool intersectSS(Segment s1, Segment s2) {\n return intersectSS(s1.p1, s1.p2, s2.p1, s2.p2);\n}\n\nbool intersectPS(Polygon p, Segment l) {\n int n = p.size();\n for(int i = 0; i < n; i++)\n if(intersectSS(Segment(p[i], p[(i + 1) % n]), l)) return 1;\n return 0;\n}\n\nint intersectCC(Circle c1, Circle c2) {\n if(c1.r < c2.r) swap(c1, c2);\n double d = abs(c1.c - c2.c);\n double r = c1.r + c2.r;\n if(equals(d, r)) return ICC_CIRCUMSCRIBE;\n if(d > r) return ICC_SEPERATE;\n if(equals(d + c2.r, c1.r)) return ICC_INSCRIBE;\n if(d + c2.r < c1.r) return ICC_CONTAIN;\n return ICC_INTERSECT;\n}\n\nbool intersectSC(Segment s, Circle c) { return getDistanceSP(s, c.c) <= c.r; }\n\nint intersectCS(Circle c, Segment s) {\n if(norm(project(s, c.c) - c.c) - c.r * c.r > EPS) return 0;\n double d1 = abs(c.c - s.p1), d2 = abs(c.c - s.p2);\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))\n return 1;\n Point h = project(s, c.c);\n if(dot(s.p1 - h, s.p2 - h) < 0) return 2;\n return 0;\n}\n\ndouble getDistanceLP(Line l, Point p) {\n return abs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));\n}\n\ndouble getDistanceSP(Segment s, Point p) {\n if(dot(s.p2 - s.p1, p - s.p1) < 0.0) return abs(p - s.p1);\n if(dot(s.p1 - s.p2, p - s.p2) < 0.0) return abs(p - s.p2);\n return getDistanceLP(s, p);\n}\n\ndouble getDistanceSS(Segment s1, Segment s2) {\n if(intersectSS(s1, s2)) return 0.0;\n return min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),\n min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)));\n}\n\nPoint getCrossPointSS(Segment s1, Segment s2) {\n for(int k = 0; k < 2; k++) {\n if(getDistanceSP(s1, s2.p1) < EPS) return s2.p1;\n if(getDistanceSP(s1, s2.p2) < EPS) return s2.p2;\n swap(s1, s2);\n }\n Vector base = s2.p2 - s2.p1;\n double d1 = abs(cross(base, s1.p1 - s2.p1));\n double d2 = abs(cross(base, s1.p2 - s2.p1));\n double t = d1 / (d1 + d2);\n return s1.p1 + (s1.p2 - s1.p1) * t;\n}\n\nPoint 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}\n\nPolygon getCrossPointCL(Circle c, Line l) {\n Polygon ps;\n Point pr = project(l, c.c);\n Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);\n if(equals(getDistanceLP(l, c.c), c.r)) {\n ps.emplace_back(pr);\n return ps;\n }\n double base = sqrt(c.r * c.r - norm(pr - c.c));\n ps.emplace_back(pr + e * base);\n ps.emplace_back(pr - e * base);\n return ps;\n}\n\nPolygon getCrossPointCS(Circle c, Segment s) {\n Line l(s);\n Polygon res = getCrossPointCL(c, l);\n if(intersectCS(c, s) == 2) return res;\n if(res.size() > 1u) {\n if(dot(l.p1 - res[0], l.p2 - res[0]) > 0) swap(res[0], res[1]);\n res.pop_back();\n }\n return res;\n}\n\nPolygon getCrossPointCC(Circle c1, Circle c2) {\n Polygon p(2);\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 p[0] = c1.c + polar(c1.r, t + a);\n p[1] = c1.c + polar(c1.r, t - a);\n return p;\n}\n\n// IN:2 ON:1 OUT:0\nint contains(Polygon g, Point p) {\n int n = g.size();\n bool x = false;\n for(int i = 0; i < n; i++) {\n Point a = g[i] - p, b = g[(i + 1) % n] - p;\n if(fabs(cross(a, b)) < EPS && 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\nPolygon andrewScan(Polygon s) {\n Polygon u, l;\n if(s.size() < 3) return s;\n sort(s.begin(), s.end());\n u.push_back(s[0]);\n u.push_back(s[1]);\n l.push_back(s[s.size() - 1]);\n l.push_back(s[s.size() - 2]);\n for(int i = 2; i < (int)s.size(); i++) {\n for(int n = u.size();\n n >= 2 && ccw(u[n - 2], u[n - 1], s[i]) != CCW_CLOCKWISE; n--) {\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n for(int i = s.size() - 3; i >= 0; i--) {\n for(int n = l.size();\n n >= 2 && ccw(l[n - 2], l[n - 1], s[i]) != CCW_CLOCKWISE; n--) {\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n reverse(l.begin(), l.end());\n for(int i = u.size() - 2; i >= 1; i--) l.push_back(u[i]);\n return l;\n}\n\nPolygon convex_hull(Polygon ps) {\n int n = ps.size();\n sort(ps.begin(), ps.end(), sort_y);\n int k = 0;\n Polygon qs(n * 2);\n for(int i = 0; i < n; i++) {\n while(k > 1 && cross(qs[k - 1] - qs[k - 2], ps[i] - qs[k - 1]) < 0) k--;\n qs[k++] = ps[i];\n }\n for(int i = n - 2, t = k; i >= 0; i--) {\n while(k > t && cross(qs[k - 1] - qs[k - 2], ps[i] - qs[k - 1]) < 0) k--;\n qs[k++] = ps[i];\n }\n qs.resize(k - 1);\n return qs;\n}\n\ndouble diameter(Polygon s) {\n Polygon p = s;\n int n = p.size();\n if(n == 2) return abs(p[0] - p[1]);\n int i = 0, j = 0;\n for(int k = 0; k < n; k++) {\n if(p[i] < p[k]) i = k;\n if(!(p[j] < p[k])) j = k;\n }\n double res = 0;\n int si = i, sj = j;\n while(i != sj || j != si) {\n res = max(res, abs(p[i] - p[j]));\n if(cross(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j]) < 0.0) {\n i = (i + 1) % n;\n } else {\n j = (j + 1) % n;\n }\n }\n return res;\n}\n\nbool isConvex(Polygon p) {\n bool f = 1;\n int n = p.size();\n for(int i = 0; i < n; i++) {\n int t = ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]);\n f &= t != CCW_CLOCKWISE;\n }\n return f;\n}\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 res;\n}\n\ndouble area(Circle c1, Circle c2) {\n double d = abs(c1.c - c2.c);\n if(c1.r + c2.r <= d + EPS) return 0;\n if(d <= abs(c1.r - c2.r)) {\n double r = min(c1.r, c2.r);\n return PI * r * r;\n }\n double rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n double th = acos(rc / c1.r);\n double ph = acos((d - rc) / c2.r);\n return c1.r * c1.r * th + c2.r * c2.r * ph - d * c1.r * sin(th);\n}\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}\n\nLine bisector(Point p1, Point p2) {\n Circle c1 = Circle(p1, abs(p1 - p2)), c2 = Circle(p2, abs(p1 - p2));\n Polygon p = getCrossPointCC(c1, c2);\n if(cross(p2 - p1, p[0] - p1) > 0) swap(p[0], p[1]);\n return Line(p[0], p[1]);\n}\n\nVector translate(Vector v, double theta) {\n Vector res;\n res.x = cos(theta) * v.x - sin(theta) * v.y;\n res.y = sin(theta) * v.x + cos(theta) * v.y;\n return res;\n}\n\nvector<Line> corner(Line l1, Line l2) {\n vector<Line> res;\n if(isParallel(l1, l2)) {\n double d = getDistanceLP(l1, l2.p1) / 2.0;\n Vector v1 = l1.p2 - l1.p1;\n v1 = v1 / v1.abs() * d;\n Point p = l2.p1 + translate(v1, 90.0 * (PI / 180.0));\n double d1 = getDistanceLP(l1, p);\n double d2 = getDistanceLP(l2, p);\n if(abs(d1 - d2) > d) {\n p = l2.p1 + translate(v1, -90.0 * (PI / 180.0));\n }\n res.push_back(Line(p, p + v1));\n } else {\n Point p = getCrossPointLL(l1, l2);\n Vector v1 = l1.p2 - l1.p1, v2 = l2.p2 - l2.p1;\n v1 = v1 / v1.abs();\n v2 = v2 / v2.abs();\n res.push_back(Line(p, p + (v1 + v2)));\n res.push_back(Line(p, p + translate(v1 + v2, 90.0 * (PI / 180.0))));\n }\n return res;\n}\n\nPolygon tangent(Circle c1, Point p2) {\n Circle c2 = Circle(p2, sqrt(norm(c1.c - p2) - c1.r * c1.r));\n Polygon p = getCrossPointCC(c1, c2);\n sort(p.begin(), p.end());\n return p;\n}\n\nvector<Line> tangent(Circle c1, Circle c2) {\n vector<Line> ls;\n if(c1.r < c2.r) swap(c1, c2);\n double g = norm(c1.c - c2.c);\n if(equals(g, 0)) return ls;\n Point u = (c2.c - c1.c) / sqrt(g);\n Point v = orth(u);\n for(int s = 1; s >= -1; s -= 2) {\n double h = (c1.r + s * c2.r) / sqrt(g);\n if(equals(1 - h * h, 0)) {\n ls.emplace_back(c1.c + u * c1.r, c1.c + (u + v) * c1.r);\n } else if(1 - h * h > 0) {\n Point uu = u * h, vv = v * sqrt(1 - h * h);\n ls.emplace_back(c1.c + (uu + vv) * c1.r,\n c2.c - (uu + vv) * c2.r * s);\n ls.emplace_back(c1.c + (uu - vv) * c1.r,\n c2.c - (uu - vv) * c2.r * s);\n }\n }\n\n return ls;\n}\n\ndouble closest_pair(Polygon &a, int l = 0, int r = -1) {\n if(r < 0) {\n r = a.size();\n sort(a.begin(), a.end(), sort_x);\n }\n if(r - l <= 1) return abs(a[0] - a[1]);\n int m = (l + r) >> 1;\n double x = a[m].x;\n double d = min(closest_pair(a, l, m), closest_pair(a, m, r));\n inplace_merge(a.begin() + l, a.begin() + m, a.begin() + r, sort_y);\n\n Polygon b;\n for(int i = l; i < r; i++) {\n if(fabs(a[i].x - x) >= d) continue;\n for(int j = 0; j < (int)b.size(); j++) {\n double dy = a[i].y - next(b.rbegin(), j)->y;\n if(dy >= d) break;\n d = min(d, abs(a[i] - *next(b.rbegin(), j)));\n }\n b.emplace_back(a[i]);\n }\n return d;\n}\n\nvector<vector<int>> segmentArrangement(vector<Segment> &ss, Polygon &ps) {\n int n = ss.size();\n for(int i = 0; i < n; i++) {\n ps.emplace_back(ss[i].p1);\n ps.emplace_back(ss[i].p2);\n for(int j = i + 1; j < n; j++)\n if(intersectSS(ss[i], ss[j]))\n ps.emplace_back(getCrossPointSS(ss[i], ss[j]));\n }\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n\n vector<vector<int>> G(ps.size());\n for(int i = 0; i < n; i++) {\n vector<pair<double, int>> ls;\n for(int j = 0; j < (int)ps.size(); j++)\n if(getDistanceSP(ss[i], ps[j]) < EPS)\n ls.emplace_back(make_pair(norm(ss[i].p1 - ps[j]), j));\n\n sort(ls.begin(), ls.end());\n for(int j = 0; j + 1 < (int)ls.size(); j++) {\n int a = ls[j].second, b = ls[j + 1].second;\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n }\n for(auto &v : G) {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n }\n return G;\n}\n\nint manhattanIntersection(vector<Segment> ss, const int INF) {\n const int BTM = 0;\n const int LFT = 1;\n const int RGH = 2;\n const int TOP = 3;\n\n int n = ss.size();\n vector<EndPoint> ep;\n for(int i = 0; i < n; i++) {\n if(ss[i].p1.y == ss[i].p2.y) {\n if(ss[i].p1.x > ss[i].p2.x) swap(ss[i].p1, ss[i].p2);\n ep.emplace_back(ss[i].p1, i, LFT);\n ep.emplace_back(ss[i].p2, i, RGH);\n } else {\n if(ss[i].p1.y > ss[i].p2.y) swap(ss[i].p1, ss[i].p2);\n ep.emplace_back(ss[i].p1, i, BTM);\n ep.emplace_back(ss[i].p2, i, TOP);\n }\n }\n sort(ep.begin(), ep.end());\n\n set<int> bt;\n bt.insert(INF);\n\n int cnt = 0;\n for(int i = 0; i < n * 2; i++) {\n if(ep[i].st == TOP) {\n bt.erase(ep[i].p.x);\n } else if(ep[i].st == BTM) {\n bt.emplace(ep[i].p.x);\n } else if(ep[i].st == LFT) {\n auto b = bt.lower_bound(ss[ep[i].seg].p1.x);\n auto e = bt.upper_bound(ss[ep[i].seg].p2.x);\n cnt += distance(b, e);\n }\n }\n\n return cnt;\n}\n\ndouble area(Polygon ps, Circle c) {\n if(ps.size() < 3u) return 0;\n function<double(Circle, Point, Point)> dfs = [&](Circle c, Point a,\n Point b) {\n Vector va = c.c - a, vb = c.c - b;\n double f = cross(va, vb), res = 0;\n if(equals(f, 0.0)) return res;\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\n Vector d(dot(va, vb), cross(va, vb));\n if(getDistanceSP(Segment(a, b), c.c) > c.r - EPS)\n return c.r * c.r * atan2(d.y, d.x);\n auto u = getCrossPointCS(c, Segment(a, b));\n if(u.empty()) return res;\n if(u.size() > 1u && dot(u[1] - u[0], a - u[0]) > 0) swap(u[0], u[1]);\n u.emplace(u.begin(), a);\n u.emplace_back(b);\n for(int i = 1; i < (int)u.size(); i++) res += dfs(c, u[i - 1], u[i]);\n return res;\n };\n double res = 0;\n for(int i = 0; i < (int)ps.size(); i++)\n res += dfs(c, ps[i], ps[(i + 1) % ps.size()]);\n return res / 2;\n}\n\nsigned main() {\n LCIN(N);\n while(N--) {\n DCIN(x1, y1, x2, y2, x3, y3, xk, yk, xs, ys);\n ll cnt = 0;\n cnt += intersectSS(Point(x1, y1), Point(x2, y2), Point(xk, yk),\n Point(xs, ys));\n cnt += intersectSS(Point(x2, y2), Point(x3, y3), Point(xk, yk),\n Point(xs, ys));\n cnt += intersectSS(Point(x3, y3), Point(x1, y1), Point(xk, yk),\n Point(xs, ys));\n cout << (cnt == 1 ? \"OK\" : \"NG\") << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3176,
"score_of_the_acc": -1.1452,
"final_rank": 19
}
] |
aoj_0146_cpp
|
ルパン四世
怪盗「ルパン四世」は会津藩士を末裔とする美女「富士峰子」より、会津若松市に会津藩が残した軍資金が眠っていることを聞かされる。ルパンの長年の仲間である「石川越ェ門」の報告によれば、軍資金は千両箱に収められいくつかの蔵に保管されている。蔵に見張りはいないが厳重に施錠されている。しかし、越ェ門は彼が父から伝授された秘伝「鋼鉄斬り」の技を繰り出せば瞬時に蔵を破れるという。
残った問題は千両箱の運搬だ。体力のないルパンと越ェ門は千両箱を一つも持てない。そこで、頼りになる男「無限大介」に運搬を頼んだ。
すべての千両箱を運び出すために、ルパンは以下のような計画を立案した。
まず、ルパンの運転で最初の蔵へ行き、越ェ門と大介を降ろす。
越ェ門が蔵を破る
大介がすべての千両箱を運び出す
その千両箱を持ったままルパンが決めた次の蔵へ向かう
これを繰り返し、最後の蔵まで破り千両箱を運び出す。その間にルパンはヘリコプターを準備し最後の蔵で二人と千両箱を運び上げ脱出する。大介はどんなに重いものも運搬できるが、荷物の重さに応じて移動速度は遅くなる。ルパンは、このことを考慮して蔵を破る順番を決めなければならない。
ルパンに代わって、最初の蔵を破ってから最後の蔵に辿りつくまでの移動時間が最小となるような蔵を破る順番を出力するプログラムを作成してください。ただし、
蔵はすべて鶴ヶ城からまっすぐ北に走る通りに面している。蔵の数は高々 15 個であり、城からの距離は高々 10000 メートル以下である。
千両箱の重さはいずれもひとつ 20 キログラムである。それぞれの蔵に収められている千両箱の個数は 10000 個以下である。
蔵から蔵への移動は、通りに沿って地下に設置されている地下道を使う。
大介は
w
キログラムの荷物を運ぶのに、分速 2,000／(70 +
w
) メートルで移動する。
入力データは、それぞれの蔵について蔵の番号（100 以下の整数）と城からの距離（メートル）とその蔵に保管されている千両箱の個数が与えられる。
Input
入力は以下の形式で与えられます。
n
s
1
d
1
v
1
s
2
d
2
v
2
:
s
n
d
n
v
n
1 行目に蔵の個数
n
（
n
≤ 15）、続く
n
行に第
i
の蔵の情報が与えられます。蔵の情報として、蔵の番号
s
i
(1 ≤
s
i
≤ 100)、城からの距離
d
i
(1 ≤
d
i
≤ 10000)、 千両箱の数
v
i
(1 ≤
v
i
≤ 10000) が１行に与えられます。
Output
蔵を破る順番を１行に出力してください。蔵の番号を空白で区切ってください。
Sample Input 1
2
1 100 1
2 200 2
Output for the Sample Input 1
1 2
Sample Input 2
3
11 100 1
13 200 20
12 300 3
Output for the Sample Input 2
11 12 13
Sample Input 3
5
13 199 1
51 1000 1
37 350 10
27 300 2
99 200 1000
Output for the Sample Input 3
51 37 27 13 99
|
[
{
"submission_id": "aoj_0146_10989382",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint n;\nvector<int> dist, box;\nvector<vector<int>> dp, bef, sum;\n\ndouble solve(int bit, int lpos){\n\tif(dp[bit][lpos] != -1) return dp[bit][lpos];\n\tif(bit == (1 << lpos)){\n\t\tsum[bit][lpos] = box[lpos];\n\t\treturn dp[bit][lpos] = 0;\n\t}\n\tint pre = (bit & ~(1 << lpos));\n\tdouble mn = 20000000, tmp;\n\tfor(int i = 0; i < n; i++){\n\t\tif(pre & (1 << i)){\n\t\t\ttmp = solve(pre, i) + abs(dist[lpos] - dist[i]) * (70.0 + 20 * sum[pre][i]) / 2000.0;\n\t\t\tif(mn > tmp){\n\t\t\t\tmn = tmp;\n\t\t\t\tsum[bit][lpos] = sum[pre][i] + box[lpos];\n\t\t\t\tbef[bit][lpos] = i;\n\t\t\t}\n\t\t}\n\t}\n\treturn dp[bit][lpos] = mn;\n}\n\nint main(){\n\tcin >> n;\n\tvector<int> num(n);\n\tdist.resize(n);\n\tbox.resize(n);\n\tdp.assign((1 << n), vector<int>(n, -1));\n\tbef = dp;\n\tsum = dp;\n\tfor(int i = 0; i < n; i++) cin >> num[i] >> dist[i] >> box[i];\n\tdouble mt = 20000000, t;\n\tint ans;\n\tfor(int i = 0; i < n; i++){\n\t\tt = solve((1 << n) - 1, i);\n\t\tif(mt > t){\n\t\t\tmt = t;\n\t\t\tans = i;\n\t\t}\n\t}\n\tvector<int> route;\n\tfor(int tag = (1 << n) - 1, i = ans, k; i != -1;){\n\t\troute.push_back(num[i]);\n\t\tk = i;\n\t\ti = bef[tag][i];\n\t\ttag = (tag & ~(1 << k));\n\t}\n\treverse(route.begin(), route.end());\n\tfor(int i = 0; i < n - 1; i++) cout << route[i] << ' ';\n\tcout << route[n - 1] << endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 13312,
"score_of_the_acc": -0.2821,
"final_rank": 16
},
{
"submission_id": "aoj_0146_9030701",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n cin >> n;\n vector<int> id(n), d(n), v(n);\n for (int i = 0; i < n; i++) {\n cin >> id[i] >> d[i] >> v[i];\n }\n vector<vector<double>> dp(n, vector<double>(1 << n, 1e18));\n vector<vector<int>> pre(n, vector<int>(1 << n, -1));\n vector<int> sum(1 << n);\n for (int i = 0; i < (1 << n); i++) {\n for (int j = 0; j < n; j++) {\n if ((1 << j) & i) sum[i] += v[j];\n }\n }\n\n for (int i = 0; i < n; i++) {\n dp[i][1 << i] = 0;\n }\n for (int j = 0; j < (1 << n); j++) {\n for (int i = 0; i < n; i++) {\n if (dp[i][j] == 1e18) continue;\n for (int k = 0; k < n; k++) {\n if ((1 << k) & j) continue;\n double dist = abs(d[i] - d[k]);\n double tm = dist / 2000 * (70 + sum[j] * 20);\n double cost = dp[i][j] + tm;\n if (dp[k][(1 << k) + j] > cost) {\n dp[k][(1 << k) + j] = cost;\n pre[k][(1 << k) + j] = i;\n }\n }\n }\n }\n vector<int> res;\n int lst = 0;\n for (int i = 0; i < n; i++) {\n if (dp[i].back() < dp[lst].back()) {\n lst = i;\n }\n }\n int bit = (1 << n) - 1;\n while (res.size() < n) {\n res.push_back(id[lst]);\n int nxt = pre[lst][bit];\n bit -= (1 << lst);\n lst = nxt;\n }\n reverse(res.begin(), res.end());\n for (int i = 0; i < n; i++) {\n if (i) cout << \" \";\n cout << res[i];\n }\n cout << endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 8784,
"score_of_the_acc": -0.0302,
"final_rank": 1
},
{
"submission_id": "aoj_0146_6982004",
"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 Inf32 1000000001\n#define Inf64 4000000000000000001\n\n\nint main(){\t\n\n\tint n;\n\tcin>>n;\n\t\n\tvector<int> s(n);\n\tvector<double> d(n),v(n);\n\trep(i,n)cin>>s[i]>>d[i]>>v[i];\n\t\n\tvector dp(1<<n,vector<double>(n,1e18));\n\tvector pre(1<<n,vector<int>(n,-1));\n\trep(i,n){\n\t\tdp[1<<i][i] = 0.0;\n\t}\n\t\n\trep(i,1<<n){\n\t\trep(j,n){\n\t\t\tif(dp[i][j]==1e18)continue;\n\t\t\tdouble w = 0.0;\n\t\t\trep(k,n){\n\t\t\t\tif((i>>k)&1)w += v[k];\n\t\t\t}\n\t\t\tw *= 20.0;\n\t\t\tdouble V = 2000.0;\n\t\t\tV /= 70+w;\n\t\t\trep(k,n){\n\t\t\t\tif((i>>k)&1)continue;\n\t\t\t\tint ii = i | (1<<k);\n\t\t\t\tint jj = k;\n\t\t\t\tdouble nv = dp[i][j];\n\t\t\t\tnv += abs(d[j]-d[k]) / V;\n\t\t\t\tif(dp[ii][jj]>nv){\n\t\t\t\t\tdp[ii][jj] = nv;\n\t\t\t\t\tpre[ii][jj] = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ii = 0;\n\trep(i,n){\n\t\tif(dp.back()[i]<dp.back()[ii])ii = i;\n\t}\n\tvector<int> ans(1,ii);\n\tint x = 1<<n;\n\tx--;\n\twhile(ans.size()!=n){\n\t\tint y = ii;\n\t\tii = pre[x][ii];\n\t\tx ^= 1<<y;\n\t\tans.insert(ans.begin(),ii);\n\t}\n\trep(i,ans.size()){\n\t\tif(i!=0)cout<<' ';\n\t\tcout<<s[ans[i]];\n\t}\n\tcout<<endl;\n\treturn 0;\n\t\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 11272,
"score_of_the_acc": -0.233,
"final_rank": 14
},
{
"submission_id": "aoj_0146_6947519",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n cin >> n;\n //千両箱の重さはいずれもひとつ 20 キログラム\n vector<int> s(n), d(n), v(n);\n for(int i = 0; i < n; i++){\n cin >> s[i] >> d[i] >> v[i];\n }\n auto f = [&](int S){\n int w = 0;\n for(int i = 0; i < n; i++){\n if(S >> i & 1)w += v[i] * 20;\n }\n return 2000.0 / (70 + w);\n };\n vector<vector<double>> dp(1 << n, vector<double>(n, 1 << 30));\n vector<vector<int>> par(1 << n, vector<int>(n, -1));\n double V = f(0);\n for(int i = 0; i < n; i++){\n dp[1 << i][i] = d[i] / V;\n }\n for(int i = 1; i < (1 << n); i++){\n V = f(i);\n for(int j = 0; j < n; j++){\n if(~i >> j & 1)continue;\n for(int k = 0; k < n; k++){\n if(i >> k & 1)continue;\n if(dp[i][j] + abs(d[j] - d[k]) / V < dp[i | (1 << k)][k]){\n dp[i | (1 << k)][k] = dp[i][j] + abs(d[j] - d[k]) / V;\n par[i | (1 << k)][k] = j;\n }\n }\n }\n }\n int cur = 0;\n V = 1 << 30;\n vector<int> ans(n);\n for(int i = 0; i < n; i++){\n if(dp.back()[i] < V){\n V = dp.back()[i];\n cur = i;\n }\n }\n ans[n - 1] = s[cur];\n int S = (1 << n) - 1;\n for(int i = n - 1; i >= 1; i--){\n ans[i - 1] = s[par[S][cur]];\n S ^= 1 << cur;\n cur = par[S ^ (1 << cur)][cur];\n }\n for(int i = 0; i < n; i++){\n if(i)cout << \" \";\n cout << ans[i];\n }\n cout << '\\n';\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11244,
"score_of_the_acc": -0.0894,
"final_rank": 4
},
{
"submission_id": "aoj_0146_5834546",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nint dp[32768][15],pre[32768][15];\nsigned main(){\n\tint n,s[15],d[15],v[15];\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t\tcin>>s[i]>>d[i]>>v[i];\n\tfor(int S=0;S<1<<n;S++){\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(~S>>i&1)\n\t\t\t\tcontinue;\n\t\t\tif(S==1<<i)\n\t\t\t\tcontinue;\n\t\t\tdp[S][i]=inf;\n\t\t\tint pS=S&~(1<<i),sum=0;\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\tif(pS>>j&1)\n\t\t\t\t\tsum+=v[j];\n\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\tif(~pS>>j&1)\n\t\t\t\t\tcontinue;\n\t\t\t\tif(dp[pS][j]+sum*abs(d[i]-d[j])<dp[S][i]){\n\t\t\t\t\tdp[S][i]=dp[pS][j]+sum*abs(d[i]-d[j]);\n\t\t\t\t\tpre[S][i]=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint S=(1<<n)-1,tmp=-1;\n\tvector<int>ans;\n\tfor(int i=0;i<n;i++)\n\t\tif(tmp==-1||dp[S][i]<dp[S][tmp])\n\t\t\ttmp=i;\n\twhile(S){\n\t\tans.push_back(tmp);\n\t\tint pS=S&~(1<<tmp);\n\t\ttmp=pre[S][tmp];\n\t\tS=pS;\n\t}\n\treverse(ans.begin(),ans.end());\n\tfor(int i=0;i<n;i++)\n\t\tcout<<s[ans[i]]<<(i==n-1?'\\n':' ');\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 11040,
"score_of_the_acc": -0.2274,
"final_rank": 12
},
{
"submission_id": "aoj_0146_5233266",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nusing lli = long long int;\nconst lli inf = 1e18;\n\nint main(){\n int n;\n cin >> n;\n vector<lli> s(n),d(n),v(n);\n for(int i=0; i<n; i++){\n cin >> s[i] >> d[i] >> v[i];\n }\n\n vector<vector<lli>> dp(1<<n, vector<lli>(n, inf));\n vector<vector<int>> prev(1<<n, vector<int>(n, -1));\n for(int i=0; i<n; i++){\n dp[1<<i][i] = 0;\n prev[1<<i][i] = i;\n }\n for(int i=1; i<(1<<n); i++){\n lli w = 0;\n for(int j=0; j<n; j++){\n if(i>>j&1) w += v[j];\n }\n w *= 20;\n // from j to k\n for(int j=0; j<n; j++){\n if(!(i>>j&1)) continue;\n for(int k=0; k<n; k++){\n if(i>>k&1) continue;\n int nmask = i | (1<<k);\n lli dist = abs(d[j]-d[k]);\n lli ncost = dp[i][j] +dist*(70+w);\n if(ncost >= dp[nmask][k]) continue;\n dp[nmask][k] = ncost;\n prev[nmask][k] = j;\n }\n }\n }\n\n int mask = (1<<n) -1;\n int last = min_element(dp[mask].begin(), dp[mask].end()) -dp[mask].begin();\n vector<int> ans;\n while(mask > 0){\n ans.push_back(s[last]);\n int nlast = prev[mask][last];\n mask ^= 1<<last;\n last = nlast;\n }\n reverse(ans.begin(), ans.end());\n for(int i=0; i<n-1; i++){\n cout << ans[i] << \" \";\n }\n cout << ans.back() << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11296,
"score_of_the_acc": -0.0907,
"final_rank": 5
},
{
"submission_id": "aoj_0146_4658160",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N;\nint Id[15], Dist[15], Weight[15];\nint DpWeight[1 << 15], traceInfo[15][1 << 15];\ndouble DpTime[15][1 << 15];\n\ndouble getTime(double dist, double weight) {\n\treturn dist * (70 + weight) / 2000.0;\n}\n\ndouble judge(int now, int visited) {\n\tdouble curTime,resTime;\n\n\tif (DpTime[now][visited] != -1) {\n\t\treturn DpTime[now][visited];\n\t}\n\tif (visited == (1 << N) - 1) {\n\t\treturn 0;\n\t}\n\n\tresTime = DBL_MAX;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (((visited >> i) & 1) == 1) {\n\t\t\tcontinue;\n\t\t}\n\t\tcurTime = judge(i, visited^(1<<i)) + getTime(abs(Dist[i] - Dist[now]), DpWeight[visited]);\n\t\tif (curTime < resTime) {\n\t\t\tresTime = curTime;\n\t\t\ttraceInfo[now][visited] = i;\n\t\t}\n\t}\n\n\treturn DpTime[now][visited] = resTime;\n}\n\nvoid solve(int limit) {\n\tint id;\n\tdouble timeMin, curTime;\n\n\tfor (int i = 0; i < N; ++i) {\n\t\tfill(DpTime[i], DpTime[i] + limit, -1);\n\t}\n\n\ttimeMin = DBL_MAX;\n\tfor (int i = 0; i < N; ++i) {\n\t\tcurTime = judge(i, 1 << i);\n\t\tif (curTime < timeMin) {\n\t\t\ttimeMin = curTime;\n\t\t\tid = i;\n\t\t}\n\t}\n\n\t--limit;\n\tcout << Id[id];\n\tfor (int i = 1 << id; i < limit; i^=(1<<id)) {\n\t\tid = traceInfo[id][i];\n\t\tcout << \" \" << Id[id];\n\t}\n\tcout << endl;\n}\n\nint main() {\n\tint limit;\n\n\tmemset(DpWeight, 0, sizeof(DpWeight));\n\tcin >> N;\n\tfor (int i = 0; i < N; ++i) {\n\t\tcin >> Id[i] >> Dist[i] >> Weight[i];\n\t}\n\n\tlimit = 1 << N;\n\tfor (int i = 1; i < limit; ++i) {\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tif (((i >> j) & 1) == 1) {\n\t\t\t\tDpWeight[i] += Weight[j] * 20;\n\t\t\t}\n\t\t}\n\t}\n\tsolve(limit);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 8784,
"score_of_the_acc": -0.1731,
"final_rank": 10
},
{
"submission_id": "aoj_0146_4658159",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N;\nint Id[15], Dist[15], Weight[15];\nint DpWeight[1 << 15], traceInfo[15][1 << 15];\ndouble DpTime[15][1 << 15];\n\ndouble getTime(double dist, double weight) {\n\treturn dist * (70 + weight) / 2000.0;\n}\n\ndouble judge(int now, int visited) {\n\tdouble curTime,resTime;\n\n\tif (DpTime[now][visited] != -1) {\n\t\treturn DpTime[now][visited];\n\t}\n\tif (visited == (1 << N) - 1) {\n\t\treturn 0;\n\t}\n\n\tresTime = DBL_MAX;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (((visited >> i) & 1) == 1) {\n\t\t\tcontinue;\n\t\t}\n\t\tcurTime = judge(i, visited^(1<<i)) + getTime(abs(Dist[i] - Dist[now]), DpWeight[visited]);\n\t\tif (curTime < resTime) {\n\t\t\tresTime = curTime;\n\t\t\ttraceInfo[now][visited] = i;\n\t\t}\n\t}\n\n\treturn DpTime[now][visited] = resTime;\n}\n\nvoid solve(int limit) {\n\tint id;\n\tdouble timeMin, curTime;\n\n\tfor (int i = 0; i < N; ++i) {\n\t\tfill(DpTime[i], DpTime[i] + limit, -1);\n\t}\n\n\ttimeMin = DBL_MAX;\n\tfor (int i = 0; i < N; ++i) {\n\t\tcurTime = judge(i, 1 << i);\n\t\tif (curTime < timeMin) {\n\t\t\ttimeMin = curTime;\n\t\t\tid = i;\n\t\t}\n\t}\n\n\t--limit;\n\tcout << Id[id];\n\tfor (int i = 1 << id; i < limit; i^=(1<<id)) {\n\t\tid = traceInfo[id][i];\n\t\tcout << \" \" << Id[id];\n\t}\n\tcout << endl;\n}\n\nint main() {\n\tint limit;\n\n\tmemset(DpWeight, 0, sizeof(DpWeight));\n\tcin >> N;\n\tfor (int i = 0; i < N; ++i) {\n\t\tcin >> Id[i] >> Dist[i] >> Weight[i];\n\t}\n\n\tlimit = 1 << N;\n\tfor (int i = 0; i < limit; ++i) {\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tif (((i >> j) & 1) == 1) {\n\t\t\t\tDpWeight[i] += Weight[j] * 20;\n\t\t\t}\n\t\t}\n\t}\n\tsolve(limit);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 8768,
"score_of_the_acc": -0.1727,
"final_rank": 9
},
{
"submission_id": "aoj_0146_4435864",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> bool chmin(T &a, const T &b){ return a > b && (a = b, true); }\ntemplate<class T> bool chmax(T &a, const T &b){ return a < b && (a = b, true); }\n\nint main() {\n int n;\n cin >> n;\n vector<int> s(n), d(n), v(n);\n for (int i = 0; i < n; ++i) {\n scanf(\"%d %d %d\", &s[i], &d[i], &v[i]);\n }\n vector<int> S(1 << n, 7);\n for (int i = 0; i < 1 << n; ++i) {\n for (int j = 0; j < n; ++j) {\n if(i & (1 << j)) S[i] += 2*v[j];\n }\n }\n auto dp = make_v(n, 1 << n, INF<ll>);\n auto prv = make_v(n, 1 << n, 0);\n for (int i = 0; i < n; ++i) {\n dp[i][1 << i] = 0;\n }\n for (int j = 0; j < 1 << n; ++j) {\n for (int i = 0; i < n; ++i) {\n if(dp[i][j] == INF<ll>) continue;\n for (int k = 0; k < n; ++k) {\n if(!(j & (1 << k))) {\n if(chmin(dp[k][j^(1 << k)], dp[i][j]+S[j]*abs(d[i]-d[k]))){\n prv[k][j^(1 << k)] = i;\n }\n }\n }\n }\n }\n stack<int> ans;\n int b = 0, a = (1 << n)-1;\n for (int i = 0; i < n; ++i) if(dp[i][a] < dp[b][a]) b = i;\n while(a){\n ans.emplace(b);\n int x = prv[b][a];\n a -= 1 << b; b = x;\n }\n while(!ans.empty()){\n printf(\"%d\", s[ans.top()]);\n ans.pop();\n if(!ans.empty()) printf(\" \");\n }\n puts(\"\");\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 8852,
"score_of_the_acc": -0.0319,
"final_rank": 2
},
{
"submission_id": "aoj_0146_3964839",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <cassert>\nstruct Warehouse {\n\tint id, position, count;\n};\nlong long int min_cost(const int state, const int current, const long long int weight, const std::vector<Warehouse>& warehouses, std::vector<std::vector<long long int>>& memo) {\n\tif (state == memo.size() - 1) return 0;\n\tif (memo[state][current] >= 0) return memo[state][current];\n\tlong long int min_time = LLONG_MAX;\n\tfor (auto i = 0; i < warehouses.size(); ++i) if ((state & (1 << i)) == 0) {\n\t\tmin_time = std::min(min_time, min_cost(state | (1 << i), i, weight + warehouses[i].count * 20, warehouses, memo) + std::abs(warehouses[current].position - warehouses[i].position) * weight);\n\t}\n\treturn memo[state][current] = min_time;\n}\nstd::vector<int> cal_min_route(const std::vector<Warehouse>& warehouse) {\n\tstd::vector<std::vector<long long int>> memo(1 << warehouse.size(), std::vector<long long int>(warehouse.size(), -1));\n\tstd::vector<int> result; result.reserve(warehouse.size());\n\tint state = 0;\n\tlong long int default_weight = 70;\n\tint current_pos = 0;\n\tfor (auto _i = 0; _i < warehouse.size(); ++_i) {\n\t\tlong long int min = LLONG_MAX;\n\t\tint min_pos = 0;\n\t\tfor (auto i = 0; i < warehouse.size(); ++i) if ((state & (1 << i)) == 0) {\n\t\t\tconst auto temp = min_cost(state | (1 << i), i, default_weight + warehouse[i].count * 20, warehouse, memo) + (result.empty() ? 0.0 : (std::abs(current_pos - warehouse[i].position) * default_weight));\n\t\t\tif (min > temp) {\n\t\t\t\tmin = temp;\n\t\t\t\tmin_pos = i;\n\t\t\t}\n\t\t}\n\t\tresult.push_back(warehouse[min_pos].id);\n\t\tstate |= 1 << min_pos;\n\t\tdefault_weight += warehouse[min_pos].count * 20;\n\t\tcurrent_pos = warehouse[min_pos].position;\n\t}\n\treturn result;\n}\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<Warehouse> warehourse(n); for (auto& w : warehourse) std::cin >> w.id >> w.position >> w.count;\n\tauto result = cal_min_route(warehourse);\n\tfor (auto i = 0; i < n; ++i) {\n\t\tif (i != 0) std::cout << ' ';\n\t\tstd::cout << result[i];\n\t}\n\tstd::cout << '\\n';\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7528,
"score_of_the_acc": -0.1429,
"final_rank": 6
},
{
"submission_id": "aoj_0146_3704675",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, d[15], s[15], v[15], w[1<<15], pre[15][1<<15];\ndouble dp[15][1<<15]; // dp[現在地][すでに訪れたものの集合]\n\ndouble t(int l, int S){\n return double(l)/(double(2000)/(70+w[S]*20));\n}\n\ndouble rec(int now, int S){\n if(dp[now][S] != -1) return dp[now][S];\n if(S == (1<<n)-1) return 0;\n\n double res = DBL_MAX;\n for(int i=0;i<n;i++){\n if((S>>i)&1) continue;\n double tmp = rec(i, S^(1<<i)) + t(abs(d[i]-d[now]), S);\n if(tmp < res){\n res = tmp;\n pre[now][S] = i;\n }\n }\n return dp[now][S] = res;\n}\n\nint main() {\n cin >> n;\n for(int i=0;i<n;i++){\n cin >> s[i] >> d[i] >> v[i];\n }\n for(int i=0;i<(1<<n);i++){\n for(int j=0;j<n;j++){\n if((i>>j)&1){\n w[i] += v[j];\n }\n }\n }\n for(int i=0;i<n;i++) fill(dp[i], dp[i]+(1<<n), -1);\n int id = 0;\n double tmin = DBL_MAX;\n for(int i=0;i<n;i++){\n if(rec(i, 1<<i) < tmin){\n tmin = rec(i, 1<<i);\n id = i;\n }\n }\n cout << s[id];\n for(int S=1<<id; S<(1<<n)-1; S ^= 1<<id){\n id = pre[id][S];\n cout << \" \" << s[id];\n }\n cout << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 8720,
"score_of_the_acc": -0.1715,
"final_rank": 8
},
{
"submission_id": "aoj_0146_3423227",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cfloat>\n#include<algorithm>\nusing namespace std;\n\nconst double INF = DBL_MAX;\n\nint main(){\n int n;\n cin >> n;\n vector<int> s(n), d(n), v(n);\n for(int i = 0; i < n; i++) cin >> s[i] >> d[i] >> v[i];\n vector<vector<double>> dp(n, vector<double>(1<<n, INF));\n vector<vector<int>> back(n, vector<int>(1<<n, -1));\n for(int i = 0; i < n; i++){\n dp[i][1<<i] = 0;\n }\n for(int s = 0; s < 1<<n; s++){\n for(int i = 0; i < n; i++){\n if(((s>>i)&1) == 0) continue;\n double w = 0;\n for(int k = 0; k < n; k++) if((s>>k)&1) w += v[k];\n w *= 20;\n for(int j = 0; j < n; j++){\n if((s>>j)&1) continue;\n if(dp[j][s|(1<<j)] > dp[i][s] + abs(d[i]-d[j])/2000.0*(70+w)){\n dp[j][s|(1<<j)] = dp[i][s] + abs(d[i]-d[j])/2000.0*(70+w);\n back[j][s|(1<<j)] = i;\n }\n }\n }\n }\n vector<int> ans;\n int pos = -1, bit = (1<<n)-1;\n double tim = INF;\n for(int j = 0; j < n; j++){\n if(dp[j][(1<<n)-1] < tim){\n tim = dp[j][bit];\n pos = j;\n }\n }\n while(pos != -1){\n ans.push_back(s[pos]);\n int nbit = bit^(1<<pos);\n pos = back[pos][bit];\n bit = nbit;\n }\n reverse(ans.begin(), ans.end());\n for(int i = 0; i < n; i++){\n cout << ans[i] << \" \\n\"[i==n-1];\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 8656,
"score_of_the_acc": -0.17,
"final_rank": 7
},
{
"submission_id": "aoj_0146_3321167",
"code_snippet": "#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\n#define FOE(i,a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT_ON(bit, i) (bit & (1LL << i))\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());\n\ntypedef long long LL;\ntemplate<typename T> using V = std::vector<T>;\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\ntemplate<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;\n\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \" \";} std::cout << v[i];} std::cout << \"\\n\"; }\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\n\nconst int INF = 1L << 30;\nconst double EPS = 1e-9;\nconst std::string YES = \"YES\", Yes = \"Yes\", NO = \"NO\", No = \"No\";\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\n\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n\n int N;\n cin >> N;\n\n V<tuple<int, int, int>> v(N);\n FOR(i, 0, N) {\n int S, D, V;\n cin >> S >> D >> V;\n v[i] = make_tuple(S, D, V);\n }\n\n VV<int> dist(101, V<int>(101, 0));\n FOR(i, 0, N) {\n FOR(j, 0, N) {\n int a, b, c, d, e, f;\n tie(a, b, c) = v[i];\n tie(d, e, f) = v[j];\n\n dist[i][j] = dist[j][i] = abs(b - e);\n }\n }\n\n vector<int> weight(1LL << N);\n FOR(b, 0, 1LL << N) {\n int w = 0;\n FOR(i, 0, N) {\n if (BIT_ON(b, i)) {\n w += get<2>(v[i]);\n }\n }\n weight[b] = w;\n }\n\n VV<int> pre(1LL << N, V<int>(N, -1));\n VV<double> dp(1LL << N, V<double>(N, INF));\n FOR(i, 0, N) {\n dp[1LL << i][i] = 0;\n }\n\n FOR(b, 0, 1LL << N) {\n FOR(i, 0, N) {\n FOR(j, 0, N) {\n if (BIT_ON(b, i) and not BIT_ON(b, j)) {\n int d = dist[i][j];\n int w = weight[b] * 20;\n double cost = d / (2000.0 / (70.0 + w));\n if (dp[b][i] + cost < dp[b | (1LL << j)][j]) {\n dp[b | (1LL << j)][j] = dp[b][i] + cost;\n pre[b | (1LL << j)][j] = i;\n }\n }\n }\n }\n }\n\n int now = -1;\n double mini_cost = INF;\n FOR(i, 0, N) {\n if (dp[(1LL << N) - 1][i] < mini_cost) {\n mini_cost = dp[(1LL << N) - 1][i];\n now = i;\n }\n }\n\n vector<int> ans;\n auto b = (1LL << N) - 1;\n while (now != -1) {\n ans.emplace_back(get<0>(v[now]));\n int p = now;\n now = pre[b][now];\n b &= ~(1LL << p);\n }\n\n reverse(ALL(ans));\n print_vec(ans);\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 11248,
"score_of_the_acc": -0.2324,
"final_rank": 13
},
{
"submission_id": "aoj_0146_3270686",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<double, double> P;\ntypedef pair<P, int> P2;\n\n#define INF 100000000\n\nint n;\ndouble s[55] = {0}, v[55] = {0}, d[55] = {0};\nP2 dp[1 << 16][16];\nvector<int>e;\n\nvoid dfs(int now, int nowb){\n\te.push_back(s[now]);\n\tif(dp[nowb][now].second == -1) return;\n\tdfs(dp[nowb][now].second, nowb & ~(1 << now));\n}\n\nint main(){\n\tcin >> n;\n\tfor(int i = 0; i < n; i++) cin >> s[i] >> d[i] >> v[i];\n\tfor(int i = 0; i < (1 << n); i++){\n\t\tfor(int j = 0; j < n; j++){\n\t\t\tdp[i][j].first.second = INF;\n\t\t}\n\t}\n\tfor(int i = 0; i < (1 << n); i++){\n\t\tfor(int j = 0; j < n; j++){\n\t\t\tif(i == 0){\n\t\t\t\tdp[(1 << j) | i][j].first.first = v[j]*20.0;\n\t\t\t\tdp[(1 << j) | i][j].first.second = 0;\n\t\t\t\tdp[(1 << j) | i][j].second = -1;\n \t\t\t}\n\t\t\telse{\n\t\t\t\tif(i & (1 << j)) continue;\n\t\t\t\tfor(int k = 0; k < n; k++){\n\t\t\t\t\tif(!(i & (1 << k))) continue;\n\t\t\t\t\tint pv = dp[i][k].first.first;\n\t\t\t\t\tint pd = dp[i][k].first.second;\n\t\t\t\t\tif((2000.0 / (70.0 + pv)) <= 0) continue;\n\t\t\t\t\tif(dp[i | (1 << j)][j].first.second > pd + (abs(d[j] - d[k]) / (2000.0 / (70.0 + pv)))){\n\t\t\t\t\t\tdp[i | (1 << j)][j].first.first = pv + v[j]*20.0;\n\t\t\t\t\t\tdp[i | (1 << j)][j].first.second = pd + (abs(d[j] - d[k]) / (2000.0 / (70.0 + pv)));\n\t\t\t\t\t\tdp[(1 << j) | i][j].second = k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint st = -1;\n\tint ma = INF;\n\tfor(int i = 0; i < n; i++){\n\t\tif(ma > dp[(1 << n) - 1][i].first.second){\n\t\t\tma = dp[(1 << n) - 1][i].first.second;\n\t\t\t//cout << ma << endl;\n\t\t\tst = i;\n\t\t}\n\t\t//out << dp[(1 << n) - 1][i].first.second << endl;\n\t}\n\tdfs(st, (1 << n)-1);\n\t//cout << endl;\n\tfor(int i = n-1; i >= 0; i--){\n\t\tif(i == 0) cout << e[i] << endl;\n\t\telse cout << e[i] << \" \";\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 27752,
"score_of_the_acc": -0.6297,
"final_rank": 18
},
{
"submission_id": "aoj_0146_3215901",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\nusing ll = long long;\n// #define int ll\nusing PII = pair<int, int>;\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<typename T>\nistream& operator >> (istream& is, vector<T>& vec){\n for(T& x: vec) {is >> x;} return is;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'['; for(T i: a) {out<<i<<',';} out<<']'; 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;\nll MOD = 1000000007;\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll n;\n cin >> n;\n vector<ll> s(n), d(n), v(n);\n REP(i, n) cin >> s[i] >> d[i] >> v[i];\n\n vector<ll> weight(1<<n);\n REP(i, 1<<n) {\n REP(j, n) {\n if(i&1<<j) weight[i] += v[j] * 20;\n }\n }\n\n auto dp = make_v<double>(1<<n, n);\n fill_v(dp, LLINF);\n auto prev = make_v<ll>(1<<n, n);\n REP(i, n) {\n dp[1<<i][i] = 0;\n prev[1<<i][i] = -1;\n }\n REP(i, 1<<n) REP(j, n) {\n REP(k, n) {\n if(!(i&1<<k)) {\n double ndist = dp[i][j] + (70+weight[i]) / 2000.0 * abs(d[j]-d[k]);\n if(dp[i|1<<k][k] > ndist) {\n dp[i|1<<k][k] = ndist;\n prev[i|1<<k][k] = j;\n }\n }\n }\n }\n\n ll idx = -1;\n double mi = LLINF;\n REP(i, n) {\n if(mi > dp[(1<<n)-1][i]) {\n mi = dp[(1<<n)-1][i];\n idx = i;\n }\n }\n\n vector<ll> path;\n ll mask = (1<<n)-1, now = idx;\n while(now != -1) {\n path.push_back(now);\n ll tmp = now;\n now = prev[mask][now];\n mask ^= 1<<tmp;\n }\n reverse(ALL(path));\n\n REP(i, path.size()) {\n cout << s[path[i]];\n if(i != path.size()-1) cout << \" \";\n }\n cout << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 12904,
"score_of_the_acc": -0.2723,
"final_rank": 15
},
{
"submission_id": "aoj_0146_3214021",
"code_snippet": "// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nint N, S[20], D[20], V[20];\ndouble dp[1 << 15][15];\nvector<int> vec[1 << 15][15];\n \nsigned main() {\n cin >> N;\n for(int i=0; i<N; i++) {\n cin >> S[i] >> D[i] >> V[i];\n }\n\n fill(dp[0], dp[1<<N], INF);\n dp[0][0] = 0;\n\n for(int bit=0; bit<(1<<N); bit++) {\n for(int k=0; k<N; k++) {\n if(dp[bit][k] == INF) continue;\n\n int weight = 0;\n for(int i=0; i<N; i++) {\n if(bit >> i & 1) weight += V[i] * 20;\n }\n for(int i=0; i<N; i++) {\n if(bit >> i & 1) continue;\n else {\n int nbit = bit | (1 << i);\n int pre = (bit ? D[k] : 0);\n int dist = abs(D[i] - pre);\n\n double cost = dist / (2000.0 / (70 + weight));\n if(dp[nbit][i] > dp[bit][k] + cost) {\n dp[nbit][i] = dp[bit][k] + cost;\n vec[nbit][i] = vec[bit][k];\n vec[nbit][i].push_back(S[i]);\n }\n }\n }\n }\n }\n \n vector<int> ans;\n double rec = INF;\n for(int i=0; i<N; i++) {\n if(rec > dp[(1<<N)-1][i]) {\n rec = dp[(1<<N)-1][i];\n ans = vec[(1<<N)-1][i];\n }\n }\n\n for(size_t i=0; i<ans.size(); i++) {\n cout << ans[i] << \" \\n\"[i+1==ans.size()];\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 49072,
"score_of_the_acc": -1.7143,
"final_rank": 20
},
{
"submission_id": "aoj_0146_3073730",
"code_snippet": "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n\ndouble dp[1<<15][15],MIN=1e15;\nint pre[1<<15][15],s[15],d[15],v[15],id,S,n;\n\nmain(){\n\tcin>>n;\n\tr(i,n)cin>>s[i]>>d[i]>>v[i];\n\tr(i,1<<n)r(j,15)dp[i][j]=1e15;\n\tr(i,n)dp[1<<i][i]=0;\n\tfor(int i=1;i<(1<<n);i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tfor(int k=0;k<n;k++){\n\t\t\t\tif(j==k)continue;\n\t\t\t\tif((i&(1<<k)))continue;\n\t\t\t\tdouble sum=0,dis=abs(d[k]-d[j]);\n\t\t\t\tr(l,n)if(i&(1<<l))sum+=v[l];\n\t\t\t\tdouble cost=dp[i][j];\n\t\t\t\tcost+=dis/(2000.0/(sum*20+70));\n\t\t\t\tif(dp[i|(1<<k)][k]>cost){\n\t\t\t\t\tdp[i|(1<<k)][k]=cost;\n\t\t\t\t\tpre[i|(1<<k)][k]=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tr(i,n)if(MIN>dp[(1<<n)-1][i]){\n\t\tMIN=dp[(1<<n)-1][i];\n\t\tid=i;\n\t}\n\tstack<int>st;\n\tS=(1<<n)-1;\n\tr(i,n){\n\t\tst.push(s[id]);\n\t\tS-=(1<<id);\n\t\tid=pre[S|(1<<id)][id];\n\t}\n\tr(i,n){\n\t\tif(i)cout<<' ';\n\t\tcout<<st.top();\n\t\tst.pop();\n\t}\n\tcout<<endl;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 8760,
"score_of_the_acc": -1.0297,
"final_rank": 19
},
{
"submission_id": "aoj_0146_3033555",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n;\nint s[15],d[15],v[15];\ndouble dp[1<<15][15];\nint sum[1<<15];\nint parent[1<<15][15];\nvoid print(int k,int a)\n{\n\tint l=k&~(1<<a);\n\tif(l)\n\t{\n\t\tprint(l,parent[k][a]);\n\t\tcout<<\" \";\n\t}\n\tcout<<s[a];\n}\nmain()\n{\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>s[i]>>d[i]>>v[i];\n\t\tfor(int j=0;j<1<<n;j++)dp[j][i]=1e300;\n\t}\n\tfor(int i=0;i<1<<n;i++)\n\t{\n\t\tfor(int j=0;j<n;j++)if(i&1<<j)sum[i]+=v[j];\n\t}\n\tfor(int i=0;i<n;i++)dp[0][i]=0;\n\tfor(int i=1;i<1<<n;i++)\n\t{\n\t\tfor(int j=0;j<n;j++)\n\t\t{\n\t\t\tif(!(i&1<<j))continue;\n\t\t\tint k=i&~(1<<j);\n\t\t\tdouble ans=dp[i][j];\n\t\t\tint p;\n\t\t\tfor(int l=0;l<n;l++)\n\t\t\t{\n\t\t\t\tdouble now=dp[k][l]+(70+sum[k]*20)/2e3*abs(d[l]-d[j]);\n\t\t\t\tif(ans>now)\n\t\t\t\t{\n\t\t\t\t\tans=now;\n\t\t\t\t\tp=l;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp[i][j]=ans;\n\t\t\tparent[i][j]=p;\n\t\t}\n\t}\n\tdouble m=1e300;int p,k=(1<<n)-1;\n\tfor(int i=0;i<n;i++)if(m>dp[k][i])m=dp[k][i],p=i;\n\tprint(k,p);\n\tcout<<endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 8888,
"score_of_the_acc": -0.0327,
"final_rank": 3
},
{
"submission_id": "aoj_0146_2802547",
"code_snippet": "#include <stdio.h>\n#include <vector>\nusing namespace std;\n#define PB push_back\nconst int N=1e1+10;\nconst int MAXN=1<<16;\nconst double INF=1<<30;\nint abs(int a){return a>0?a:-a;}\nint main(){\n int n,s[N],d[N],v[N],from[MAXN][N],val[MAXN],all,now=0,top;\n vector<int> ans;\n double dp[MAXN][N],temp;\n scanf(\"%d\",&n);\n for(int i=0;i<n;i++)scanf(\"%d%d%d\",&s[i],&d[i],&v[i]);\n all=1<<n;\n for(int i=0;i<all;i++){\n val[i]=0;\n for(int j=0;j<n;j++){\n dp[i][j]=INF;\n if(i&(1<<j))val[i]+=v[j];\n }\n val[i]*=20;\n }\n for(int i=0;i<n;i++){\n from[1<<i][i]=-1;\n dp[1<<i][i]=((double)70/2000)*d[i];\n }\n for(int i=0;i<all;i++)for(int j=0;j<n;j++)if(i&(1<<j)){\n for(int k=0;k<n;k++)if(k!=j&&i&(1<<k)){\n temp=dp[i^(1<<j)][k]+((double)(70+val[i^(1<<j)])/2000)*abs(d[j]-d[k]);\n if(dp[i][j]>temp){\n from[i][j]=k;\n dp[i][j]=temp;\n }\n }\n }\n all--;\n top=dp[all][0];\n for(int i=1;i<n;i++)if(dp[all][i]<top){\n top=dp[all][i];\n now=i;\n }\n while(all>0){\n ans.PB(s[now]);\n top=all;\n all-=1<<now;\n now=from[top][now];\n }\n printf(\"%d\",ans.back());\n for(int i=static_cast<int>(ans.size()-2);i>=0;i--)printf(\" %d\",ans[i]);\n printf(\"\\n\");\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 10400,
"score_of_the_acc": -0.212,
"final_rank": 11
},
{
"submission_id": "aoj_0146_2596179",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<complex>\n#define mod 1000000007\n#define lol(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint dp[1<<16][15];\npair<int,int> from[1<<16][15];\nint w[1<<16],n;\nint s[15],d[15],v[15];\nint main(){\n cin>>n;\n lol(i,n){\n cin>>s[i]>>d[i]>>v[i];\n lol(j,(1<<n)){\n dp[j][i]=mod;\n }\n dp[(1<<i)][i]=0;\n }\n w[0]=0;\n for(int k=0;k<(1<<n);k++){\n lol(last,n){\n lol(to,n){\n\tif(k%(1<<(to+1))>=(1<<to))continue;\n\tint tmp=dp[k][last]+abs(d[to]-d[last])*(7+2*w[k]);\n\tif(tmp<dp[k+(1<<to)][to]){\n\t dp[k+(1<<to)][to]=tmp;\n\t from[k+(1<<to)][to]=make_pair(k,last);\n\t}\n\tw[k+(1<<to)]=w[k]+v[to];\n }\n }\n }\n vector<int> v;\n pair<int,int> pnt;\n int mini=mod;\n lol(i,n){\n if(mini>dp[(1<<n)-1][i]){\n mini=dp[(1<<n)-1][i];\n pnt=make_pair((1<<n)-1,i);\n }\n }\n while(true){\n int a=pnt.first,b=pnt.second;\n v.push_back(s[b]);\n if(a==(1<<b))break;\n pnt=from[a][b];\n }\n lol(i,v.size()){\n if(i)cout<<\" \";\n cout<<v[v.size()-1-i];\n }\n cout<<endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 12816,
"score_of_the_acc": -0.5559,
"final_rank": 17
}
] |
aoj_0159_cpp
|
理想の体型
肥満度を表す指数としてBMI（Body Mass Index）があります。BMIの値は以下の式で計算します。
BMI = 体重(kg) / (身長(m))
2
BMIの値が標準値に近いほど「理想の体型」と考えられます。そこで、BMIの標準値を 22 とした場合、対象者の情報を入力とし、最も「理想の体型」に近い人の情報を出力するプログラムを作成してください。
対象者の数を
n
とすると、各対象者には重複のないように1 以上
n
以下の整数値の受付番号
p
が振られています。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
n
p
1
h
1
w
1
p
2
h
2
w
2
:
p
n
h
n
w
n
１行目に対象者の人数
n
(
n
≤ 1000)、続く
n
行に
i
人目の対象者の受付番号
p
i
(1 ≤
p
i
≤
n
)、センチメートル単位の身長
h
i
(1 ≤
h
i
≤ 200)、キログラム単位の体重
w
i
(1 ≤
w
i
≤ 200) が与えられます。入力は全て整数で与えられます。
Output
データセットごとに「理想の体型」に最も近い人の受付番号（整数）を１行に出力します。最も「理想の体型」に近い人が二人以上いる場合は、受付番号の小さい方を出力することとします。
Sample Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output for the Sample Input
3
2
|
[
{
"submission_id": "aoj_0159_728665",
"code_snippet": "#include<iostream>\n#include<cstdlib>\n#include<algorithm>\nusing namespace std;\ntypedef struct {\n int no;\n double BMI,abs;\n}P;\nint main(){\n int n,a,b,c;\n while(1){\n cin >> n;\n if(n==0)break;\n P temp;\n P sets[n];\n for(int i=0;i<n;i++){\n cin >> sets[i].no >> b >> c;\n\n sets[i].BMI=double(c)/((double)(b)/100.0*(double)(b)/100.0);\n if(sets[i].BMI<=22){\n\tsets[i].abs=22-sets[i].BMI;\n }else{\n\tsets[i].abs=sets[i].BMI-22;\n }\n }\n for(int i=0;i<n-1;i++){\n for(int j=n-1;j>i;j--){\n\tif(sets[j].abs<sets[j-1].abs){\n\t temp=sets[j];\n\t sets[j]=sets[j-1];\n\t sets[j-1]=temp;\n\t}\n }\n }\n for(int i=0;i<n-1;i++){\n for(int j=n-1;j>i;j--){\n\tif(sets[j].abs==sets[j-1].abs && sets[j].no<sets[j-1].no){\n\t temp=sets[j];\n\t sets[j]=sets[j-1];\n\t sets[j-1]=temp;\n\t}\n }\n }\n cout << sets[0].no << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1180,
"score_of_the_acc": -1,
"final_rank": 1
},
{
"submission_id": "aoj_0159_287136",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\tint n;\n\twhile( cin >> n , n ){\n\t\tdouble BMI[1000001];\n\t\tfor(int i=0 ; i < 1000001 ; i++ ){\n\t\t\tBMI[i] = -1;\n\t\t}\n\n\t\tfor(int i=0 ; i < n ; i++ ){\n\t\t\tint id,h,w;\n\t\t\tcin >> id >> h >> w;\n\t\t\tBMI[id] = fabs( 22.0 - (double) w / ( (h/100.0)*(h/100.0) ) );\n\t\t}\n\t\tdouble m = 1000.0;\n\t\tfor(int i=0 ; i < 1000001 ; i++ ){\n\t\t\tif( BMI[i] != -1 )\n\t\t\t\tm = min( m , BMI[i] );\n\t\t}\n\t\tfor(int i=0 ; i < 1000001 ; i++ ){\n\t\t\tif( BMI[i] == m ){\n\t\t\t\tcout << i << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 0,
"score_of_the_acc": -1,
"final_rank": 1
},
{
"submission_id": "aoj_0159_223595",
"code_snippet": "#include<vector>\n#include<list>\n#include<algorithm>\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint gcd(int a,int b){\n int i;\n if(a<b)\n swap(a,b);\n for(i=1;a%(b/i);)\n for(i++;b%i;i++); \n return b/i;\n}\nlong long lcm(int a,int b){\n return (long long)a*b/gcd(a,b);\n}\nint main(){\n int i;\n int n,b,h,w,bb,hh,ww;\n long long l;\n for(;;){\n cin>>n;\n if(n==0)\n break;\n cin>>bb>>hh>>ww;\n for(i=1;i<n;i++){\n cin>>b>>h>>w;\n l=lcm(hh*hh,h*h);\n if(llabs(ww*10000*l/hh/hh-l*22)>llabs(w*10000*l/h/h-l*22)){\n\tbb=b;\n\thh=h;\n\tww=w;\n }\n }\n cout<<bb<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 868,
"score_of_the_acc": -1.4023,
"final_rank": 3
}
] |
aoj_0151_cpp
|
Grid
There is a n × n grid D where each cell contains either 1 or 0.
Your task is to create a program that takes the gird data as input and computes the greatest number of consecutive 1s in either vertical, horizontal, or diagonal direction.
For example, the consecutive 1s with greatest number in the figure below is circled by the dashed-line.
The size of the grid n is an integer where 2 ≤ n ≤ 255.
Input
The input is a sequence of datasets. The end of the input is indicated by a line containing one zero. Each dataset is formatted as follows:
n
D
11
D
12
... D
1n
D
21
D
22
... D
2n
.
.
D
n1
D
n2
... D
nn
Output
For each dataset, print the greatest number of consecutive 1s.
Sample Input
5
00011
00101
01000
10101
00010
8
11000001
10110111
01100111
01111010
11111111
01011010
10100010
10000001
2
01
00
3
000
000
000
0
Output for the Sample Input
4
8
1
0
|
[
{
"submission_id": "aoj_0151_10958639",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint dfs(int y, int x, int dy, int dx, vector<vector<int>> const& v) {\n int n = v.size();\n if(y < 0 || n <= y || x < 0 || n <= x || v[y][x] == 0) {\n return 0;\n }\n return dfs(y+dy, x+dx, dy, dx, v) + 1;\n}\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<vector<int>> v(n, vector<int>(n));\n for(int i=0; i<n; ++i) {\n for(int j=0; j<n; ++j) {\n char c; cin >> c;\n v[i][j] = c - '0';\n }\n }\n int res = 0;\n for(int i=0; i<n; ++i) {\n for(int j=0; j<n; ++j) {\n if(v[i][j] == 1) {\n res = max(res, dfs(i+1, j, 1, 0, v)+1);\n res = max(res, dfs(i, j+1, 0, 1, v)+1);\n res = max(res, dfs(i+1, j+1, 1, 1, v)+1);\n res = max(res, dfs(i+1, j-1, 1, -1, v)+1);\n }\n }\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3528,
"score_of_the_acc": -0.2538,
"final_rank": 13
},
{
"submission_id": "aoj_0151_9612805",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint ans(vector<int> &a) {\n int curr = 0, best = 0;\n for (auto to: a) {\n if (to != 1) {\n best = max(best, curr);\n curr = 0;\n } else {\n curr++;\n }\n }\n best = max(best, curr);\n return best;\n}\n\nint main() {\n int n;\n while (cin >> n) {\n if (n == 0) {\n return 0;\n }\n vector<vector<int>> a(n, vector<int>(n));\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n char c;\n cin >> c;\n a[i][j] = c - '0';\n }\n }\n int best = 0;\n for (int i = 0; i < n; ++i) {\n best = max(best, ans(a[i]));\n }\n for (int j = 0; j < n; ++j) {\n vector<int> p;\n for (int i = 0; i < n; ++i) {\n p.push_back(a[i][j]);\n }\n best = max(best, ans(p));\n }\n for (int l = 0; l < 2 * n - 1; ++l) {\n vector<int> p;\n for (int i = 0; i < n; ++i) {\n int j = l - i;\n if (j >= n || j < 0) {\n continue;\n }\n p.push_back(a[i][j]);\n }\n best = max(best, ans(p));\n }\n for (int l = -n + 1; l <= n - 1; ++l) {\n vector<int> p;\n for (int i = 0; i < n; ++i) {\n int j = l + i;\n if (j >= n || j < 0) {\n continue;\n }\n p.push_back(a[i][j]);\n }\n best = max(best, ans(p));\n }\n cout << best << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3532,
"score_of_the_acc": -0.1603,
"final_rank": 8
},
{
"submission_id": "aoj_0151_9390481",
"code_snippet": "#include<bits/stdc++.h>\n//#pragma GCC target(\"avx,avx2\")\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n#ifdef LOCAL\n#include <debug.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing pll = pair<ll,ll>;\nusing pii = pair<int,int>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing vvvl = vector<vvl>;\nusing vul = vector<ull>;\nusing vpii = vector<pii>;\nusing vvpii = vector<vpii>;\nusing vpll = vector<pll>;\nusing vs = vector<string>;\ntemplate<class T> using pq = priority_queue<T,vector<T>, greater<T>>;\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define overload3(a,b,c,name,...) name\n#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)\n#define rep2(i, n) for (ll i = 0; i < (n); ++i)\n#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)\n#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\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,b) for(ll i = (b) - 1;i >= (a);i--)\n#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n#define all1(i) begin(i) , end(i)\n#define all2(i,a) begin(i) , begin(i) + a\n#define all3(i,a,b) begin(i) + a , begin(i) + b\n#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\ntemplate<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }\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... Ts> void in(Ts&... t);\n#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)\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 DBL(...) double __VA_ARGS__; in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)\n#define VEC(type, name, size) vector<type> name(size); in(name)\n#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)\nll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}\nll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nbool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}\nvoid Yes() {cout << \"Yes\\n\";return;}\nvoid No() {cout << \"No\\n\";return;}\nvoid YES() {cout << \"YES\\n\";return;}\nvoid NO() {cout << \"NO\\n\";return;}\ntemplate <typename T>\nT floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}\ntemplate <typename T>\nT ceil(T x, T y) {return floor(x + y - 1, y);}\ntemplate <typename T>\nT bmod(T x, T y) {return x - y * floor(x, y);}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}\nnamespace IO{\n#define VOID(a) decltype(void(a))\nstruct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;\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>{});} \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)); }\n#undef unpack\nconstexpr long double PI = 3.141592653589793238462643383279L;\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};\n\n//constexpr int mod = 998244353;\nconstexpr int mod = 1000000007;\n\nint dx[] = {1,-1,0,0,1,1,-1,-1};\nint dy[] = {0,0,1,-1,1,-1,1,-1};\nint main() {\n string x;\n while(getline(cin,x)) {\n int n = stoi(x);\n if(n == 0) break;\n vs s(n);\n rep(i,n) getline(cin,s[i]);\n int ans = 0;\n rep(i,n) {\n rep(j,n) {\n if(s[i][j] == '1') {\n rep(k,8) {\n int cnt = 0;\n rep(l,n) {\n int ni = i + dx[k] * l;\n int nj = j + dy[k] * l;\n if(is_clamp(ni,0,n) && is_clamp(nj,0,n) && s[ni][nj] == '1') cnt++;\n else break;\n }\n chmax(ans,cnt);\n }\n }\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3364,
"score_of_the_acc": -0.3759,
"final_rank": 16
},
{
"submission_id": "aoj_0151_9128455",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n if (n == 0) return 1;\n vc<string> a(n);\n rep(i, n) cin >> a[i];\n ll ans = 0;\n rep(i, n) {\n rep(j, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, j+1, n) {\n if (a[i][k] == '0') {\n j = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, n) {\n rep(i, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, i+1, n) {\n if (a[k][j] == '0') {\n i = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, -n+1, n) {\n ll k = j;\n while (k < 0) k++;\n rep(i, k - j, n) {\n if (k >= n) break;\n if (a[i][k] == '1') {\n ll cnt = 0;\n rep(l, i, n) {\n if ((k+(l-i) >= n) or (a[l][k+(l-i)] == '0')) {\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rrep(j, 0, 2*n-1) {\n ll k = j;\n while (k >= n) k--;\n rep(i, j - k, n) {\n if (k < 0) break;\n if (a[i][k] == '1') {\n ll cnt = 0;\n rep(l, i, n) {\n if ((k-(l-i) < 0) or (a[l][k-(l-i)] == '0')) {\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3468,
"score_of_the_acc": -0.1812,
"final_rank": 9
},
{
"submission_id": "aoj_0151_9128445",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n if (n == 0) return 1;\n vc<string> a(n);\n rep(i, n) cin >> a[i];\n ll ans = 0;\n rep(i, n) {\n rep(j, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, j+1, n) {\n if (a[i][k] == '0') {\n j = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, n) {\n rep(i, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, i+1, n) {\n if (a[k][j] == '0') {\n i = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, -n+1, n) {\n ll k = j;\n while (k < 0) k++;\n rep(i, k - j, n) {\n if (k >= n) break;\n if (a[i][k] == '1') {\n ll cnt = 0;\n rep(l, i, n) {\n if ((k+(l-i) >= n) or (a[l][k+(l-i)] == '0')) {\n i = l;\n k += l-i;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n } else {\n k++;\n }\n }\n }\n rrep(j, 0, 2*n-1) {\n ll k = j;\n while (k >= n) k--;\n rep(i, j - k, n) {\n if (k < 0) break;\n if (a[i][k] == '1') {\n ll cnt = 0;\n rep(l, i, n) {\n if ((k-(l-i) < 0) or (a[l][k-(l-i)] == '0')) {\n //i = l;\n //k -= l-i-1;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n } else {\n //k--;\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3356,
"score_of_the_acc": -0.1344,
"final_rank": 7
},
{
"submission_id": "aoj_0151_9128437",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n if (n == 0) return 1;\n vc<string> a(n);\n rep(i, n) cin >> a[i];\n ll ans = 0;\n rep(i, n) {\n rep(j, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, j+1, n) {\n if (a[i][k] == '0') {\n j = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, n) {\n rep(i, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, i+1, n) {\n if (a[k][j] == '0') {\n i = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, -n+1, n) {\n ll k = j;\n while (k < 0) k++;\n rep(i, k - j, n) {\n if (k >= n) break;\n if (a[i][k] == '1') {\n ll cnt = 0;\n rep(l, i, n) {\n if ((k+(l-i) >= n) or (a[l][k+(l-i)] == '0')) {\n i = l;\n k += l-i;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n } else {\n k++;\n }\n }\n }\n rrep(j, 0, 2*n-1) {\n ll k = j;\n while (k >= n) k--;\n rep(i, j - k, n) {\n if (k < 0) break;\n if (a[i][k] == '1') {\n ll cnt = 0;\n rep(l, i, n) {\n if ((k-(l-i) < 0) or (a[l][k-(l-i)] == '0')) {\n //i = l;\n //k -= l-i;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n } else {\n //k--;\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3496,
"score_of_the_acc": -0.1929,
"final_rank": 11
},
{
"submission_id": "aoj_0151_9128379",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n if (n == 0) return 1;\n vc<string> a(n);\n rep(i, n) cin >> a[i];\n ll ans = 0;\n rep(i, n) {\n rep(j, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, j+1, n) {\n if (a[i][k] == '0') {\n j = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, n) {\n rep(i, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, i+1, n) {\n if (a[k][j] == '0') {\n i = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, -n+1, n) {\n ll k = j;\n while (k < 0) k++;\n rep(i, k - j, n) {\n if (a[i][k] == '1') {\n ll cnt = 1;\n rep(l, i+1, n) {\n if ((k+(l-i) >= n) or (a[l][k+(l-i)] == '0')) {\n i = l;\n k += l-i;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n } else {\n k++;\n if (k >= n) break;\n }\n }\n }\n rrep(j, 0, 2*n-1) {\n ll k = j;\n while (k >= n) k--;\n rep(i, j - k, n) {\n if (a[i][k] == '1') {\n ll cnt = 1;\n rep(l, i+1, n) {\n if ((k-(l-i) < 0) or (a[l][k-(l-i)] == '0')) {\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n } else {\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3244,
"score_of_the_acc": -0.0877,
"final_rank": 4
},
{
"submission_id": "aoj_0151_9128343",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n if (n == 0) return 1;\n vc<string> a(n);\n rep(i, n) cin >> a[i];\n ll ans = 0;\n rep(i, n) {\n rep(j, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, j+1, n) {\n if (a[i][k] == '0') {\n j = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, n) {\n rep(i, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, i+1, n) {\n if (a[k][j] == '0') {\n i = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, -n+1, n) {\n ll k = j;\n while (k < 0) k++;\n rep(i, k - j, n) {\n if (a[i][k] == '1') {\n ll cnt = 1;\n rep(l, i+1, n) {\n if ((k+(l-i) >= n) or (a[l][k+(l-i)] == '0')) {\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rrep(j, 0, 2*n-1) {\n ll k = j;\n while (k >= n) k--;\n rep(i, j - k, n) {\n if (a[i][k] == '1') {\n ll cnt = 1;\n rep(l, i+1, n) {\n if ((k-(l-i) < 0) or (a[l][k-(l-i)] == '0')) {\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3472,
"score_of_the_acc": -0.1828,
"final_rank": 10
},
{
"submission_id": "aoj_0151_9128327",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n if (n == 0) return 1;\n vc<string> a(n);\n rep(i, n) cin >> a[i];\n ll ans = 0;\n rep(i, n) {\n rep(j, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, j+1, n) {\n if (a[i][k] == '0') {\n j = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, n) {\n rep(i, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, i+1, n) {\n if (a[k][j] == '0') {\n i = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, -n+1, n) {\n ll k = j;\n while (k < 0) k++;\n rep(i, k - j, n) {\n if (a[i][k] == '1') {\n ll cnt = 1;\n rep(l, i+1, n) {\n if ((k+(l-i) >= n) or (a[l][k+(l-i)] == '0')) {\n //i = l;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rrep(j, 0, 2*n-1) {\n ll k = j;\n while (k >= n) k--;\n rep(i, j - k, n) {\n if (a[i][k] == '1') {\n ll cnt = 1;\n rep(l, i+1, n) {\n if ((k-(l-i) < 0) or (a[l][k-(l-i)] == '0')) {\n //i = l;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3548,
"score_of_the_acc": -0.2146,
"final_rank": 12
},
{
"submission_id": "aoj_0151_9128322",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n if (n == 0) return 1;\n vc<string> a(n);\n rep(i, n) cin >> a[i];\n ll ans = 0;\n rep(i, n) {\n rep(j, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, j+1, n) {\n if (a[i][k] == '0') {\n //j = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, n) {\n rep(i, n) {\n if (a[i][j] == '1') {\n ll cnt = 1;\n rep(k, i+1, n) {\n if (a[k][j] == '0') {\n //i = k;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rep(j, -n+1, n) {\n ll k = j;\n while (k < 0) k++;\n rep(i, k - j, n) {\n if (a[i][k] == '1') {\n ll cnt = 1;\n rep(l, i+1, n) {\n if ((k+(l-i) >= n) or (a[l][k+(l-i)] == '0')) {\n //i = l;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n rrep(j, 0, 2*n-1) {\n ll k = j;\n while (k >= n) k--;\n rep(i, j - k, n) {\n if (a[i][k] == '1') {\n ll cnt = 1;\n rep(l, i+1, n) {\n if ((k-(l-i) < 0) or (a[l][k-(l-i)] == '0')) {\n //i = l;\n break;\n }\n cnt++;\n }\n chmax(ans, cnt);\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3320,
"score_of_the_acc": -0.1194,
"final_rank": 6
},
{
"submission_id": "aoj_0151_8455670",
"code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n;\n while (std::cin >> n) {\n if (n == 0) break;\n std::vector<std::string> s(n);\n for (int i = 0; i < n; i++) std::cin >> s[i];\n int ans = 0;\n const int di[] = {0, 1, 1, 1};\n const int dj[] = {1, 0, 1, -1};\n const int d[] = {n, n, 2 * n - 1, 2 * n - 1};\n std::vector pos(4, std::vector<std::vector<std::pair<int, int>>>());\n for (int i = 0; i < 4; i++) {\n pos[i].resize(d[i]);\n }\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < 3; k++) {\n pos[k][di[k] * i + dj[k] * j].emplace_back(i, j);\n }\n pos[3][di[3] * i + dj[3] * j + n - 1].emplace_back(i, j);\n }\n }\n\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < d[i]; j++) {\n int now = 0;\n for (auto [x, y]: pos[i][j]) {\n if (s[x][y] == '1') {\n now++;\n } else {\n now = 0;\n }\n ans = std::max(ans, now);\n }\n }\n }\n std::cout << ans << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5544,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_0151_8029623",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int N; cin >> N;\n if (N == 0) return false;\n vector<string> S(N);\n for (auto& c : S) cin >> c;\n\n array<int, 8> dy = { 1, 0, -1, 0, 1, -1, 1, -1 };\n array<int, 8> dx = { 0, 1, 0, -1, 1, -1, -1, 1 };\n\n auto in = [&](int y, int x) -> bool {\n return 0 <= y and y < N and 0 <= x and x < N;\n };\n\n int ans = 0;\n \n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < N ; j++) {\n for (int d = 0 ; d < 8 ; d++) {\n int val = 0;\n while (1) {\n int ny = i + dy[d] * val;\n int nx = j + dx[d] * val;\n if (in(ny, nx) and S[ny][nx] == '1') {\n val++;\n ans = max(ans, val);\n }\n else {\n break;\n }\n }\n }\n }\n }\n\n cout << ans << endl;\n \n return true;\n}\n\nint main() {\n while (solve()) ;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3496,
"score_of_the_acc": -0.7167,
"final_rank": 18
},
{
"submission_id": "aoj_0151_6875751",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<string> A(n);\n for(auto &&s:A)cin >> s;\n function<int(int,int,int,int)> dfs = [&](int y, int x, int dy, int dx){\n if(y < 0 || y >= n || x < 0 || x >= n)return 0;\n if(A[y][x] == '0')return 0;\n return 1 + dfs(y + dy, x + dx, dy, dx);\n };\n int ans = 0;\n for(int y = 0; y < n; y++){\n for(int x = 0; x < n; x++){\n for(int dy = -1; dy <= 1; dy++){\n for(int dx = -1; dx <= 1; dx++){\n if(dy == 0 && dx == 0)continue;\n ans = max(ans, dfs(y, x, dy, dx));\n }\n }\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3508,
"score_of_the_acc": -1.1503,
"final_rank": 20
},
{
"submission_id": "aoj_0151_6779108",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; ++i)\ntypedef long long ll;\nusing namespace std;\nconst int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};\nconst int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nvoid solve(int N) {\n vector<string> S(N);\n rep(i, N) cin >> S[i];\n\n int ans = 0;\n rep(i, N) rep(j, N) {\n if (S[i][j] == '0') continue;\n\n rep(k, 8) {\n int cur = 0;\n rep(l, N) {\n int ny = i + dy[k] * l;\n int nx = j + dx[k] * l;\n if (ny < 0 || ny >= N || nx < 0 || nx >= N) break;\n if (S[ny][nx] == '0') break;\n cur++;\n }\n ans = max(ans, cur);\n }\n }\n cout << ans << \"\\n\";\n}\n\nint main() {\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n int N;\n while (cin >> N, N)\n solve(N);\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3240,
"score_of_the_acc": -0.2765,
"final_rank": 14
},
{
"submission_id": "aoj_0151_4988558",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\n#pragma GCC target (\"avx2\")\n#pragma GCC optimization (\"O3\")\n#pragma GCC optimization (\"unroll-loops\")\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).endf()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).endf())\n#define SORT(c) sort((c).begin(), (c).endf())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-4, PI = acos(-1);\n//ここから編集 \ntypedef string::const_iterator State;\n\nbool sieve[20101];\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n \n int n;\n while(cin >> n, n){\n vector<string> v(n);\n REP(i,n) cin >> v[i];\n int ans = 0;\n REP(i,n){\n REP(j,n){\n\n if(v[i][j] == '1'){\n int t = 0;\n for(int k=0; k<n; k++){\n if(j+k < n && v[i][j+k] == '1'){\n t++;\n }else break;\n }\n ans = max(ans, t);\n t = 0;\n for(int k=0; k<n; k++){\n if(j-k >= 0 && v[i][j-k] == '1'){\n t++;\n }else break;\n }\n ans = max(ans, t);\n t = 0;\n for(int k=0; k<n; k++){\n if(i+k < n && v[i+k][j] == '1'){\n t++;\n }else break;\n }\n ans = max(ans, t);\n t = 0;\n for(int k=0; k<n; k++){\n if(i-k >= 0 && v[i-k][j] == '1'){\n t++;\n }else break;\n }\n ans = max(ans, t);\n\n t = 0;\n for(int k=0; k<n; k++){\n if(i+k < n && j+k < n&& v[i+k][j+k] == '1'){\n t++;\n }else break;\n }\n ans = max(ans, t);\n t = 0;\n for(int k=0; k<n; k++){\n if(i-k >= 0 && j+k < n && v[i-k][j+k] == '1'){\n t++;\n }else break;\n }\n ans = max(ans, t);\n\n t = 0;\n for(int k=0; k<n; k++){\n if(i+k < n && j-k >= 0&& v[i+k][j-k] == '1'){\n t++;\n }else break;\n }\n ans = max(ans, t);\n t = 0;\n for(int k=0; k<n; k++){\n if(i-k >= 0 && j-k >= 0 && v[i-k][j-k] == '1'){\n t++;\n }else break;\n }\n ans = max(ans, t);\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3220,
"score_of_the_acc": -0.3634,
"final_rank": 15
},
{
"submission_id": "aoj_0151_4606304",
"code_snippet": "#include <iostream>\n\nint getH(char** board, int n)\n{\n\tint res = 0;\n\tfor (int i=0; i<n; i++) {\n\t\tint count = 0;\n\t\tfor (int j=0; j<n; j++) {\n\t\t\tif (board[i][j] == '0') count = 0;\n\t\t\telse {\n\t\t\t\tcount++;\n\t\t\t\tif (count > res) res = count;\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nint getV(char** board, int n)\n{\n\tint res = 0;\n\tfor (int j=0; j<n; j++) {\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif (board[i][j] == '0') count = 0;\n\t\t\telse {\n\t\t\t\tcount++;\n\t\t\t\tif (count > res) res = count;\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nint getLD(char** board, int n)\n{\n\tint res = 0;\n\tfor (int i=0; i<n; i++) {\n\t\tint count = 0;\n\t\tfor (int j=0; j<=i; j++) {\n\t\t\tif (board[j][i-j] == '0') count = 0;\n\t\t\telse {\n\t\t\t\tcount++;\n\t\t\t\tif (count > res) res = count;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i=0; i<n-1; i++) {\n\t\tint count = 0;\n\t\tfor (int j=0; j<=i; j++) {\n\t\t\tif (board[n-1-i+j][n-1-j] == '0') count = 0;\n\t\t\telse {\n\t\t\t\tcount++;\n\t\t\t\tif (count > res) res = count;\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nint getRD(char** board, int n)\n{\n\tint res = 0;\n\tfor (int i=0; i<n; i++) {\n\t\tint count = 0;\n\t\tfor (int j=0; j<=i; j++) {\n\t\t\tif (board[j][n-1-i+j] == '0') count = 0;\n\t\t\telse {\n\t\t\t\tcount++;\n\t\t\t\tif (count > res) res = count;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i=0; i<n-1; i++) {\n\t\tint count = 0;\n\t\tfor (int j=0; j<=i; j++) {\n\t\t\tif (board[n-1-i+j][j] == '0') count = 0;\n\t\t\telse {\n\t\t\t\tcount++;\n\t\t\t\tif (count > res) res = count;\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tint n;\n\twhile (true) {\n\t\tstd::cin >> n;\n\t\tif (n==0) break;\n\t\tchar** board = new char*[n];\n\t\tfor (int i=0; i<n; i++) board[i] = new char[n];\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tfor (int j=0; j<n; j++) std::cin >> board[i][j];\n\t\t}\n\t\tint res = std::max( std::max(getH(board,n), getV(board,n)), std::max(getLD(board,n), getRD(board,n)) );\n\t\tstd::cout << res << std::endl;\n\t\tfor (int i=0; i<n; i++) delete[] board[i];\n\t\tdelete[] board;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3148,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0151_4373892",
"code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\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// ---------------------------------------------------------------------------\n\nint N;\nvector<string> G;\n\nint solve(int row,int col){\n int res = 0;\n for(int k=0; k<6; k++){\n int x = row;\n int y = col;\n int now = 0;\n while(x>=0 and x<N and y<N and y>=0){\n if(G[x][y]-'0' > 0) now++;\n else{\n chmax(res,now);\n now = 0;\n }\n y += dy[k];\n x += dx[k];\n }\n chmax(res,now);\n }\n return res;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cin >> N;\n while(N != 0){\n int ans = 0;\n G.resize(N);\n for(int i=0; i<N; i++){\n cin >> G[i];\n }\n for(int i=0; i<N; i++){\n chmax(ans,solve(i,0));\n chmax(ans,solve(0,i));\n chmax(ans,solve(i,N-1));\n chmax(ans,solve(N-1,i));\n }\n cout << ans << enld;\n cin >> N;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3300,
"score_of_the_acc": -0.0634,
"final_rank": 3
},
{
"submission_id": "aoj_0151_4373879",
"code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\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// ---------------------------------------------------------------------------\n\nint N;\nvector<string> G;\n\nint solve(int row, int col) {\n int res = 0;\n for(int k=0; k<6; k++) {\n int x = row, y = col, cons = 0;\n while(x >= 0 and x < N and y >= 0 and y < N) {\n if(G[x][y] > '0') cons++;\n else chmax(res, cons), cons = 0;\n x += dx[k], y += dy[k];\n }\n chmax(res, cons);\n }\n return res;\n}\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(cin >> N) {\n if(N == 0) break;\n G.resize(N);\n for(int i=0; i<N; i++) {\n cin >> G[i];\n }\n int ans = 0;\n for(int i=0; i<N; i++) {\n chmax(ans, solve(i, 0));\n chmax(ans, solve(0, i));\n chmax(ans, solve(N-1, i));\n chmax(ans, solve(i, N-1));\n }\n cout << ans << enld;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.0167,
"final_rank": 2
},
{
"submission_id": "aoj_0151_4362829",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\n\nvoid solve(int n) {\n vector<vector<int>> v(n, vector<int>(n, 0));\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n scanf(\"%1d\", &v[i][j]);\n }\n }\n int ans = 0;\n for (int i = 0; i < n; ++i) {\n int cnt = 0;\n for (int j = 0; j < n; ++j) {\n if(v[i][j]) cnt++;\n else cnt = 0;\n ans = max(ans, cnt);\n }\n }\n for (int i = 0; i < n; ++i) {\n int cnt = 0;\n for (int j = 0; j < n; ++j) {\n if(v[j][i]) cnt++;\n else cnt = 0;\n ans = max(ans, cnt);\n }\n }\n auto dp = v;\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if(i && j && dp[i][j]) dp[i][j] += dp[i-1][j-1];\n ans = max(ans, dp[i][j]);\n }\n }\n dp = v;\n for (int i = 0; i < n; ++i) {\n for (int j = n-1; j >= 0; --j) {\n if(i && j != n-1 && dp[i][j]) dp[i][j] += dp[i-1][j+1];\n ans = max(ans, dp[i][j]);\n }\n }\n cout << ans << \"\\n\";\n}\n\nint main() {\n int n;\n while(cin >> n, n){\n solve(n);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3412,
"score_of_the_acc": -0.1102,
"final_rank": 5
},
{
"submission_id": "aoj_0151_4244572",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint MapData[255][255], DpResult[4][255][255], Ans[4], MaxLen;\nstring strOfRow;\n\nvoid solve(int n) {\n\tfor (int i = 0; i < n; i++) {\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tif (MapData[i][j] == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t//上下\n\t\t\tif (i > 0) {\n\t\t\t\tDpResult[0][i][j] = DpResult[0][i - 1][j] + 1;\n\t\t\t}\n\t\t\t//左右\n\t\t\tif (j > 0) {\n\t\t\t\tDpResult[1][i][j] = DpResult[1][i][j - 1] + 1;\n\t\t\t}\n\t\t\t//左斜め\n\t\t\tif (i > 0 && j > 0) {\n\t\t\t\tDpResult[2][i][j] = DpResult[2][i - 1][j - 1] + 1;\n\t\t\t}\n\t\t\t//右斜め\n\t\t\tif (i > 0 && j < n-1) {\n\t\t\t\tDpResult[3][i][j] = DpResult[3][i - 1][j + 1] + 1;\n\t\t\t}\n\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tAns[k] = max(Ans[k], DpResult[k][i][j]);\n\t\t\t\tMaxLen = max(MaxLen, Ans[k]);\n\t\t\t}\n\t\t}\n\t}\n\t\n}\n\nvoid show(int n) {\n\tcout << \"Dp:\" << endl;\n\tfor (int k = 0; k < 4; k++) {\n\t\tcout << \"k=\" << k << endl;\n\t\tfor (int row = 0; row < n; row++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tcout << DpResult[k][row][j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\tcout << \"ans=\" << Ans[k] << endl << endl;\n\t}\n}\n\nint main() {\n\tint n;\n\n\twhile (cin >> n, n) {\n\t\tmemset(MapData, 0, sizeof(MapData));\n\t\tmemset(DpResult, 0, sizeof(DpResult));\n\t\tmemset(Ans, 0, sizeof(Ans));\n\t\tMaxLen = 0;\n\t\tfor (int row = 0; row < n; row++) {\n\t\t\tcin >> strOfRow;\n\t\t\tfor (int col = 0; col < n; col++) {\n\t\t\t\tMapData[row][col] = DpResult[0][row][col] = DpResult[1][row][col] = DpResult[2][row][col] = DpResult[3][row][col] = strOfRow[col] - '0';\n\t\t\t}\t\t\t\n\t\t}\n\t\tsolve(n);\n\t\t//show(n);\n\t\tcout << MaxLen << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4428,
"score_of_the_acc": -0.5342,
"final_rank": 17
}
] |
aoj_0154_cpp
|
カードの組み合わせ
整数が書いてあるカードが何枚か入っている袋を使ってゲームをしましょう。各回のゲームで参加者はまず、好きな数
n
を一つ宣言します。そして、袋の中から適当な枚数だけカードを一度に取り出して、それらのカードに書かれた数の総和が
n
に等しければ豪華賞品がもらえます。なお、それぞれのゲーム終了後カードは袋に戻されます。
袋の中の
m
種類のカードの情報および、
g
回のゲームで参加者が宣言した数を入力とし、それぞれのゲームで豪華商品をもらえるカードの組み合わせが何通りあるかを出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
m
a
1
b
1
a
2
b
2
:
a
m
b
m
g
n
1
n
2
:
n
g
１行目にカードの種類数
m
（1 ≤
m
≤ 7）、続く
m
行に
i
種類目のカードに書かれた整数
a
i
(1 ≤
a
i
≤ 100) とその枚数
b
i
(1 ≤
b
i
≤ 10) が空白区切りで与えられます。
続く行にゲームの回数
g
(1 ≤
g
≤ 10)、続く
g
行にゲーム
i
で宣言された整数
n
i
(1 ≤
n
i
≤ 1,000) が与えられます。
データセットの数は 100 を超えない。
Output
入力データセットごとに、
i
行目にゲーム
i
で豪華賞品がもらえるカードの組み合わせ数を出力します。
Sample Input
5
1 10
5 3
10 3
25 2
50 2
4
120
500
100
168
7
1 10
3 10
5 10
10 10
25 10
50 10
100 10
3
452
574
787
0
Output for the Sample Input
16
0
12
7
9789
13658
17466
|
[
{
"submission_id": "aoj_0154_6878269",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int m;\n while(cin >> m, m){\n int n, g;\n vector<int> a(m), b(m);\n vector<ll> dp(7001);\n for(int i = 0; i < m; i++){\n cin >> a[i] >> b[i];\n }\n function<void(int,int)> dfs = [&](int i, int v){\n if(i == m){\n dp[v]++;\n return;\n }\n for(int j = 0; j <= b[i]; j++){\n dfs(i + 1, v + j * a[i]);\n }\n };\n dfs(0, 0);\n cin >> g;\n for(int i = 0; i < g; i++){\n cin >> n;\n cout << dp[n] << '\\n';\n }\n }\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 3472,
"score_of_the_acc": -0.4219,
"final_rank": 10
},
{
"submission_id": "aoj_0154_5751711",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint m;\n\twhile(cin>>m,m){\n\t\tint a[7],b[7],g,n;\n\t\tfor(int i=0;i<m;i++)\n\t\t\tcin>>a[i]>>b[i];\n\t\tint cnt[7001]={};\n\t\tfor(int i=0;i<pow(11,m);i++){\n\t\t\tint tmp=i,sum=0;\n\t\t\tbool ok=1;\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tsum+=a[j]*(tmp%11);\n\t\t\t\tif(tmp%11>b[j])\n\t\t\t\t\tok=0;\n\t\t\t\ttmp/=11;\n\t\t\t}\n\t\t\tif(ok)\n\t\t\t\tcnt[sum]++;\n\t\t}\n\t\tcin>>g;\n\t\tfor(int i=0;i<g;i++){\n\t\t\tcin>>n;\n\t\t\tcout<<cnt[n]<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 2600,
"memory_kb": 3856,
"score_of_the_acc": -1.4019,
"final_rank": 20
},
{
"submission_id": "aoj_0154_4807715",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define each(i, a) for(auto &i : a)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#define line cout << \"-----------------------------\\n\" \n#define ENDL(i,n) ((i) == (n) - 1 ? \"\\n\" : \" \")\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\n\nint main() {\n init();\n\n for (int m; cin >> m && m;) {\n VI a(m), b(m);\n FOR(i, 0, m)cin >> a[i] >> b[i];\n VI x(10001);\n auto dfs = [&](auto&& f, int i, int sum)->void {\n if (i == m)++x[sum];\n else {\n eFOR(j, 0, b[i])f(f, i + 1, sum + a[i] * j);\n }\n };\n dfs(dfs, 0, 0);\n\n int g; cin >> g;\n FOR(i, 0, g) {\n int n; cin >> n;\n print(x[n]);\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3256,
"score_of_the_acc": -0.3704,
"final_rank": 5
},
{
"submission_id": "aoj_0154_4615757",
"code_snippet": "#include <iostream>\n\nint numOfWays(int a[], int b[], int m, int n, int index)\n{\n\tif (n<0) return 0;\n\tif (n==0) return 1;\n\tif (index == m) return 0;\n\tint res = 0;\n\tfor (int k=0; k<=b[index]; k++) {\n\t\tres += numOfWays(a, b, m, n - k*a[index], index+1);\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tint m;\n\twhile (true) {\n\t\tstd::cin >> m;\n\t\tif (m==0) break;\n\t\tint a[7], b[7];\n\t\tfor (int i=0; i<m; i++) std::cin >> a[i] >> b[i];\n\t\tint g; std::cin >> g;\n\t\tfor (int i=0; i<g; i++) {\n\t\t\tint n;\n\t\t\tstd::cin >> n;\n\t\t\tstd::cout << numOfWays(a, b, m, n, 0) << std::endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 840,
"memory_kb": 2996,
"score_of_the_acc": -0.5942,
"final_rank": 14
},
{
"submission_id": "aoj_0154_4340497",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n\nusing namespace std;\n\nint m;\nint count0;\n\nint EstimateMax(int from, pair<int, int> cards[])\n{\n\tint result = 0;\n\tfor (int i = from; i < m; i++)\n\t{\n\t\tresult += cards[i].first * cards[i].second;\n\t}\n\treturn result;\n}\n\nvoid Backtrace(int n, pair<int, int> cards[], int floor)\n{\n\tif (floor == m || n == 0)\n\t{\n\t\tif (n == 0)\n\t\t\tcount0++;\n\t\treturn;\n\t}\n\tint value = cards[floor].first;\n\tint amount = cards[floor].second;\n\tfor (size_t i = 0; i <= amount; i++)\n\t{\n\t\tif (n - value * i >= 0 && EstimateMax(floor + 1,cards) >= (n - value * i))\n\t\t\tBacktrace(n - value * i, cards, floor + 1);\n\t}\n}\n\nint main()\n{\n\tcin >> m;\n\twhile (m != 0)\n\t{\n\t\tpair<int,int> cards[7];\n\t\tfor (size_t i = 0; i < m; i++)\n\t\t{\n\t\t\tcin >> cards[i].first >> cards[i].second;\n\t\t}\n\t\tint g;\n\t\tcin >> g;\n\t\tint n;\n\t\tfor (size_t i = 0; i < g; i++)\n\t\t{\n\t\t\tcin >> n;\n\t\t\tcount0 = 0;\n\t\t Backtrace(n, cards, 0);\n\t\t\tcout << count0 << endl;\n\t\t}\n\t\tcin >> m;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 3048,
"score_of_the_acc": -0.4011,
"final_rank": 7
},
{
"submission_id": "aoj_0154_4340445",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n\nusing namespace std;\n\nint count0;\n\nvoid Backtrace(int n, pair<int, int> cards[], int floor)\n{\n\tif (floor == -1 || n == 0)\n\t{\n\t\tif (n == 0)\n\t\t\tcount0++;\n\t\treturn;\n\t}\n\tint value = cards[floor].first;\n\tint amount = cards[floor].second;\n\tfor (size_t i = 0; i <= amount; i++)\n\t{\n\t\tif (n - value * i >= 0)\n\t\t\tBacktrace(n - value * i, cards, floor - 1);\n\t}\n}\n\nint main()\n{\n\tint m;\n\tcin >> m;\n\twhile (m != 0)\n\t{\n\t\tpair<int,int> cards[7];\n\t\tfor (size_t i = 0; i < m; i++)\n\t\t{\n\t\t\tcin >> cards[i].first >> cards[i].second;\n\t\t}\n\t\tint g;\n\t\tcin >> g;\n\t\tint n;\n\t\tfor (size_t i = 0; i < g; i++)\n\t\t{\n\t\t\tcin >> n;\n\t\t\tcount0 = 0;\n\t\t\tBacktrace(n, cards, m - 1);\n\t\t\tcout << count0 << endl;\n\t\t}\n\t\tcin >> m;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 1340,
"memory_kb": 3072,
"score_of_the_acc": -0.7985,
"final_rank": 17
},
{
"submission_id": "aoj_0154_4298605",
"code_snippet": "#include<bits/stdc++.h>\n#define int long long\n#define for0(i, n) for(int i = 0; i < (n); i++)\n#define for1(i, n) for(int i = 1; i <= (n);i++)\nusing namespace std;\nint m, a[10], b[10], n, g, ans[1010];\nvoid f(int sum, int i) {\n\tif (sum > 1000)return;\n\tif (i == m) {\n\t\tans[sum]++; return;\n\t}\n\tfor0(p, b[i] + 1) f(sum + a[i] * p, i + 1);\n}\nint get() { int r; cin >> r; return r; }\nsigned main() {\n\twhile (cin >> m, m) {\n\t\tfor0(i, m)cin >> a[i] >> b[i];\n\t\tfor0(i, 1001)ans[i] = 0;\n\t\tf(0, 0);\n\t\tcin >> g;\n\t\twhile (g--)cout << ans[get()] << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3012,
"score_of_the_acc": -0.3147,
"final_rank": 3
},
{
"submission_id": "aoj_0154_4166434",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\nusing namespace std;\n\nint main(void){\n int m;\n while(1){\n cin>>m;\n if(m==0)break;\n map<int,int> card;\n vector<int> A;\n int a,b;\n for(int i=0;i<m;i++){\n cin>>a>>b;\n A.push_back(a);\n card[a]=b;\n }\n for(int i=m;i<7;i++){\n A.push_back(0);\n card[0]=0;\n }\n int max=0;\n for(int i=0;i<m;i++){\n max+=A[i]*card[A[i]];\n }\n map<int,int> pattern;\n for(int i=0;i<max+1;i++){\n pattern[i]=0;\n }\n int cost;\n for(int i0=0;i0<=card[A[0]];i0++){\n for(int i1=0;i1<=card[A[1]];i1++){\n for(int i2=0;i2<=card[A[2]];i2++){\n for(int i3=0;i3<=card[A[3]];i3++){\n for(int i4=0;i4<=card[A[4]];i4++){\n for(int i5=0;i5<=card[A[5]];i5++){\n for(int i6=0;i6<=card[A[6]];i6++){\n cost=i0*A[0]+i1*A[1]+i2*A[2]+i3*A[3]+i4*A[4]+i5*A[5]+i6*A[6];\n pattern[cost]=pattern[cost]+1;\n }\n }\n }\n }\n }\n }\n }\n int g;\n cin>>g;\n int n;\n for(int i=0;i<g;i++){\n cin>>n;\n cout<<pattern[n]<<endl;\n }\n }\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 2380,
"memory_kb": 3124,
"score_of_the_acc": -1.2078,
"final_rank": 19
},
{
"submission_id": "aoj_0154_3896820",
"code_snippet": "#include<iostream>\nusing namespace std;\nint a[7],b[7];\nint N;\nint dfs(int U,int id)\n{\n\tif(id==N)return U==0;\n\tint ret=0;\n\tfor(int k=0;k<=b[id];k++)\n\t{\n\t\tif(U<k*a[id])break;\n\t\tret+=dfs(U-k*a[id],id+1);\n\t}\n\treturn ret;\n}\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tfor(int i=0;i<N;i++)cin>>a[i]>>b[i];\n\t\tint Q;cin>>Q;\n\t\tfor(;Q--;)\n\t\t{\n\t\t\tint g;cin>>g;cout<<dfs(g,0)<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 450,
"memory_kb": 3008,
"score_of_the_acc": -0.4454,
"final_rank": 11
},
{
"submission_id": "aoj_0154_3423328",
"code_snippet": "// 枝狩り無し全探索だと流石にきついか？\n#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nvector<pair<int,int>> v;\nint m, ans;\n\nvoid dfs(int pos, int res){\n if(res == 0){\n ans++;\n return;\n }\n if(pos == m) return;\n for(int j = min(v[pos].second, res/v[pos].first); j >= 0; j--){\n dfs(pos+1, res-j*v[pos].first);\n }\n}\n\nint main(){\n while(cin >> m, m){\n v.resize(m);\n for(int i = 0; i < m; i++) cin >> v[i].first >> v[i].second;\n sort(v.rbegin(), v.rend());\n int g, n;\n cin >> g;\n while(g-- > 0){\n cin >> n;\n ans = 0;\n dfs(0, n);\n cout << ans << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 430,
"memory_kb": 3092,
"score_of_the_acc": -0.4502,
"final_rank": 12
},
{
"submission_id": "aoj_0154_2375445",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 1001000100010001000\n#define MOD 1000000007\n#define EPS 1e-10\n#define int long long\n#define rep(i, N) for (int i = 0; i < N; i++)\n#define Rep(i, N) for (int i = 1; i < N; i++)\n#define For(i, a, b) for (int i = (a); i < (b); i++)\n#define pb push_back\n#define eb emplece_back\n#define mp make_pair\n#define i_i pair<int, int>\n#define vi vector<int>\n#define vvi vector<vi >\n#define vb vector<bool>\n#define vvb vector<vb >\n#define vp vector< i_i >\n#define Edge pair< i_i, int>\n#define all(a) (a).begin(), (a).end()\n#define Int(x) int x; scanf(\"%lld\", &x);\n#define int2(x, y) int x, y; scanf(\"%lld %lld\", &x, &y);\n#define fir first\n#define sec second\n#define ffir first.first\n#define fsec first.second\n#define sfir second.first\n#define ssec second.second\n \n//int dxy[5] = {0, 1, 0, -1, 0};\n// assign\n \nsigned main()\n{\n int n;\n while (cin >> n, n) {\n vi data(n), num(n);\n rep(i, n) {\n cin >> data[i] >> num[i];\n }\n vvi dp(n+1, vi(70200, 0));\n dp[0][0] = 1;\n rep(i, n) {\n rep(j, 70200) {\n dp[i+1][j] += dp[i][j];\n }\n Rep(j, num[i]+1) {\n for (int k = 70100; k >= 0; k--) {\n if (dp[i][k]) {\n dp[i+1][k+data[i]*j] += dp[i][k];\n }\n }\n }\n }\n Int(g);\n while (g--) {\n Int(tmp);\n cout << dp[n][tmp] << endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7868,
"score_of_the_acc": -1,
"final_rank": 18
},
{
"submission_id": "aoj_0154_2050793",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<cmath>\n#include<list>\n#include<stack>\n#include<queue>\n#include<cctype>\n#include<iomanip>\n#include<functional>\n#include<numeric>\n#include<map>\n#include<set>\n#include<complex>\n#define EPS 1e-10\nusing namespace std;\ntypedef long long llong;\nvector<int>ans;\nvector<int>a, b;\nint m;\nvoid dandc(int x, int i) {\n\tif (x > 1009)return;\n\tif (i == m) {\n\t\tans[x]++;\n\t\t//cout << \"ans[\" << x << \"] = \" << ans[x] << endl;\n\t\treturn;\n\t}\n\t//cout << \"i\" << \" = \" << i << endl;\n\tfor (int j = 0; j <= b[i]; j++) {\n\t\tdandc(x + j*a[i], i + 1);\n\t}\n}\nint main() {\n\twhile (cin >> m&&m) {\n\t\tans = vector<int>(1010, 0);\n\t\ta = b = vector<int>(m,0);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> a[i] >> b[i];\n\t\t}\n\t\tdandc(0, 0);\n\t\t//for (int i = 0; i < 1010; i++) {\n\t\t//\tcout << i << \" : \" << ans[i] << endl;\n\t\t//}\n\t\tint g, n;\n\t\tcin >> g;\n\t\twhile (g--) {\n\t\t\tcin >> n;\n\t\t\tcout << ans[n] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3160,
"score_of_the_acc": -0.3368,
"final_rank": 4
},
{
"submission_id": "aoj_0154_1990072",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\n#define fi first\n#define sec second\n#define pb push_back\nint num[10],cnt[10];\nint sum[10000];\nint m;\nvoid dfs(int x,int s){\n\tif(x==m){\n\t\tsum[s]++;\n\t\treturn;\n\t}\n\tfor(int i=0;i<=cnt[x];i++){\n\t\tdfs(x+1,s+num[x]*i);\n\t}\n}\nint main(){\n\twhile(1){\n\t\tmemset(sum,0,sizeof(sum));\n\t\tscanf(\"%d\",&m);\n\t\tif(m==0)break;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tscanf(\"%d %d\",&num[i],&cnt[i]);\n\t\t}\n\t\tdfs(0,0);\n\t\tint n,g;\n\t\tscanf(\"%d\",&n);\n\t\tfor(int i=0;i<n;i++){\n\t\t\tscanf(\"%d\",&g);\n\t\t\tprintf(\"%d\\n\",sum[g]);\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 1232,
"score_of_the_acc": -0.1111,
"final_rank": 2
},
{
"submission_id": "aoj_0154_1887288",
"code_snippet": "#include<bits/stdc++.h>\n#define M 7\nusing namespace std;\nint m,a[M],b[M],g,n,ans;\n\nvoid dfs(int x,int sum){\n if(x==m){\n if(sum==n)ans++;\n return;\n }\n for(int i=0;i<=b[x];i++)\n dfs(x+1,sum+a[x]*i);\n}\n\nint main(){\n while(1){\n cin>>m;\n if(!m)break;\n for(int i=0;i<m;i++)\n cin>>a[i]>>b[i];\n cin>>g;\n while(g--){\n cin>>n;\n ans=0;\n dfs(0,0);\n cout<<ans<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1970,
"memory_kb": 1160,
"score_of_the_acc": -0.7568,
"final_rank": 16
},
{
"submission_id": "aoj_0154_1848443",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint n,a[10],b[10],ans;\nint p;\n \nvoid saiki(int ima,int sum){\n if(sum==p) ans++;\n if(ima==n||sum>=p) return;\n for(int i=0;i<=b[ima];i++) saiki(ima+1,sum+a[ima]*i);\n}\n \nint main(){\n while(cin>>n,n){\n for(int i=0;i<n;i++)cin>>a[i]>>b[i];\n int m;\n cin>>m;\n while(m--){\n cin>>p;\n ans=0;\n saiki(0,0);\n cout <<ans<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1070,
"memory_kb": 1160,
"score_of_the_acc": -0.4093,
"final_rank": 8
},
{
"submission_id": "aoj_0154_1846165",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<string>\n#include<cstdlib>\n#include<cmath>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\nusing namespace std;\n\nint cnt;\nint m, num;\nint cards[7][2];\n\nvoid calc(int point, int sum) {\n\tfor(int i=0; i<=cards[point][1]; i++) {\n\t\tint temp = sum;\n\t\ttemp += cards[point][0]*i;\n\t\tif(temp == num) {\n\t\t\tcnt++;\n\t\t\treturn;\n\t\t}\n\t\telse {\n\t\t\tif(point != m-1)\n\t\t\t\tcalc(point+1, temp);\n\t\t}\n\t}\n}\n\nint main() {\n\twhile(1) {\n\t\tcin >> m;\n\t\tif(m==0) break;\n\n\t\tfor(int i=0; i<m; i++)\n\t\t\tcin >> cards[i][0] >> cards[i][1];\n\n\t\tint g;\n\t\tcin >> g;\n\t\tfor(int i=0; i<g; i++) {\n\t\t\tcnt = 0;\n\t\t\tcin >> num;\n\t\t\tcalc(0, 0);\n\t\t\tcout << cnt << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 980,
"memory_kb": 1160,
"score_of_the_acc": -0.3745,
"final_rank": 6
},
{
"submission_id": "aoj_0154_1845850",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 7\ntypedef pair<int,int> P;\n \nint m, cnt;\nvector<P> v;\n \nvoid check(int num, int pos)\n{\n if (num == 0) {\n\tcnt++;\n\treturn;\n } else if(num < 0 || m <= pos) {\n\treturn;\n }\n \n for (int i = 0; i < v[pos].second; i++) {\n\tcheck(num-v[pos].first*(i+1), pos+1);\n }\n check(num, pos+1);\n}\n \nint main()\n{\n int g, num;\n while (cin >> m, m) {\n\tv.clear(); v.resize(m);\n\tfor (int i = 0; i < m; i++) {\n\t cin >> v[i].first >> v[i].second;\n\t}\n \n\tcin >> g;\n\tfor (int i = 0; i < g; i++) {\n\t cin >> num;\n\t cnt = 0; check(num, 0);\n\t cout << cnt << endl;\n\t}\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 860,
"memory_kb": 3076,
"score_of_the_acc": -0.6138,
"final_rank": 15
},
{
"submission_id": "aoj_0154_1775266",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint n,a[10],b[10],ans;\nint p;\n\nvoid saiki(int ima,int sum){\n if(sum==p) ans++;\n if(ima==n||sum>=p) return;\n for(int i=0;i<=b[ima];i++) saiki(ima+1,sum+a[ima]*i);\n}\n\nint main(){\n while(cin>>n,n){\n for(int i=0;i<n;i++)cin>>a[i]>>b[i];\n int m;\n cin>>m;\n while(m--){\n cin>>p;\n ans=0;\n saiki(0,0);\n cout <<ans<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1100,
"memory_kb": 1160,
"score_of_the_acc": -0.4208,
"final_rank": 9
},
{
"submission_id": "aoj_0154_1772080",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std ;\n\nint m,n,g;\nint card[7][2]; // ??°???????????°\n\nint calc( int cnt , int N ){\n\tif( N < 0 ) return 0;\n\tif( N == 0 ) return 1;\n\t\n\tif( cnt == m-1 ){\n\t\tif( N%card[cnt][0] == 0 && N/card[cnt][0] <= card[cnt][1] ) return 1;\n\t\telse return 0;\n\t}\n\t\n\tint ans = 0 ;\n\tfor( int i=0 ; i<=card[cnt][1] ; i++ ){\n\t\tans += calc( cnt+1 , N - (i*card[cnt][0]) ) ;\n\t}\n\t\n\treturn ans ;\n}\n\nint main(){\n\t\n\twhile( cin >> m , m ){\n\t\tfor( int i=0 ; i<m ; i++ ){\n\t\t\tcin >> card[i][0] >> card[i][1];\n\t\t}\n\t\tfor( int i=0 ; i<m ; i++ ){\n\t\t\tfor( int j=i+1 ; j<m ; j++ ){\n\t\t\t\tif( card[i][0] < card[j][0] ){\n\t\t\t\t\tswap( card[i] , card[j] ) ;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tcin >> g ;\n\t\twhile( g-- ){\n\t\t\tcin >> n ;\n\t\t\tcout << calc(0,n) << endl ;\n\t\t}\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 1160,
"score_of_the_acc": -0.0463,
"final_rank": 1
},
{
"submission_id": "aoj_0154_1763903",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define INF (1<<20)\ntypedef pair<int,int> P;\n\nint m,g;\nint card[7],num[7];\nint dp[10][10000];\nint n;\n\nint solve(int idx,int sum){\n if(sum == n) return 1;\n if(idx == m) return 0;\n if(sum > n) return 0;\n \n int ret = 0;\n for(int i=0;i<=num[idx];i++){\n ret += solve(idx+1,sum+(card[idx]*i));\n }\n return ret;\n}\n\nint main(){\n while(cin >> m , m){\n for(int i=0;i<m;i++){\n cin >> card[i] >> num[i];\n }\n cin >> g;\n for(int i=0;i<g;i++){\n cin >> n;\n cout << solve(0,0) << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 1400,
"memory_kb": 1164,
"score_of_the_acc": -0.5373,
"final_rank": 13
}
] |
aoj_0156_cpp
|
城の堀
いま、忍者が城外から天守閣に忍び入ろうと計画を立てています。この忍者は地面を走ったり、堀の中を泳いだりすることは難なくできますが、堀から這い上がることはとても苦手なので、忍者は堀に入る回数をできるだけ少なくしたいと考えています。
お城の見取図を入力とし、城外から天守閣に至るまでに、堀から這い上がらなくてはならない最小回数を出力するプログラムを作成して下さい。お城の見取図は二次元格子として与えられます。見取り図に描かれた記号には、天守閣の位置を示す「&」と堀の位置を示す「#」の位置が記され、そのほかの地点には「.」（半角ピリオド）が記されています。なお、お城には天守閣は一つだけあるものとし、忍者は走ったり泳いだりして移動するときに東西南北方向に1マスずつ移動するものとし、斜めには移動しません。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロ２つの行で示されます。各データセットは以下の形式で与えられます。
n
m
c
1,1
c
1,2
...
c
1,n
c
2,1
c
2,2
...
c
2,n
:
c
m,1
c
m,2
...
c
m,n
１行目に見取図の東西の幅
n
と 南北の幅
m
(1 ≤
n
,
m
≤ 100) が与えられる。続く
m
行に見取り図の
i
行目の情報が与えられる。各情報は記号「&」、「#」、「.」からなる長さ
n
の文字列である。
データセットの数は 50 を越えない。
Output
データセットごとに堀から這い上がらなくてはならない最小回数（整数）を１行に出力します。
Sample Input
5 5
.###.
#...#
#.&.#
#...#
.###.
18 15
..####....####....
####..####....####
#...............##
.#.############.##
#..#..........#.##
.#.#.########.#.##
#..#.#......#.#.##
.#.#....&...#.#.##
#..#........#.#.##
.#.#.########.#.##
#..#..........#.##
.#.############.##
#...............##
.#################
##################
9 10
#########
........#
#######.#
#.....#.#
#.###.#.#
#.#&#.#.#
#.#...#.#
#.#####.#
#.......#
#########
9 3
###...###
#.#.&.#.#
###...###
0 0
</pre>
<H2>Output for the Sample Input</H2>
<pre>
1
2
0
0
</pre>
|
[
{
"submission_id": "aoj_0156_7400944",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst int INF = (1<<30);\nint dx[] = {1, -1, 0, 0};\nint dy[] = {0, 0, 1, -1};\nstring c[110];\nint n, m, cost[110][110];\nvoid dfs(int x, int y){\n for(int i=0;i<4;i++){\n int nx = x+dx[i];\n int ny = y+dy[i];\n if(nx<0||nx>=n||ny<0||ny>=m) continue;\n int ncost = cost[y][x];\n if(c[y][x]=='#' && c[ny][nx]=='.') ncost++;\n if(cost[ny][nx] > ncost){\n cost[ny][nx] = ncost;\n dfs(nx, ny);\n }\n }\n}\nint main(){\n int sx, sy, mi;\n while(cin >> n >> m, n!=0){\n for(int i=0;i<m;i++){\n cin >> c[i];\n for(int j=0;j<n;j++){\n if(c[i][j]=='&'){\n sx = j;\n sy = i;\n }\n cost[i][j] = INF;\n }\n }\n cost[sy][sx] = 0;\n dfs(sx, sy);\n mi = INF;\n for(int i=0;i<m;i++){\n if(c[i][0]=='#') cost[i][0]++;\n if(c[i][n-1]=='#') cost[i][n-1]++;\n mi = min(mi, cost[i][0]);\n mi = min(mi, cost[i][n-1]);\n }\n for(int i=0;i<n;i++){\n if(c[0][i]=='#') cost[0][i]++;\n if(c[m-1][i]=='#') cost[m-1][i]++;\n mi = min(mi, cost[0][i]);\n mi = min(mi, cost[m-1][i]);\n }\n cout << mi << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 3600,
"score_of_the_acc": -1.2284,
"final_rank": 19
},
{
"submission_id": "aoj_0156_2598507",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#define lol(i,n) for(int i=0;i<n;i++)\n#define mod 1000000007\ntypedef long long ll;\nusing namespace std;\nint dis[110][110],p[110][110];\ntypedef pair<int,pair<int,int> >P;\npriority_queue<P,vector<P>,greater<P> >Q;\nvoid Qpush(int a,int b,int c){Q.push(make_pair(a,make_pair(b,c)));}\nint main(){\n int h,w;\n while(cin>>w>>h&&h+w){\n lol(i,h)lol(j,w){\n char z;cin>>z;\n if(z=='&')Qpush(0,i,j);\n if(z=='#')p[i][j]=1;\n else p[i][j]=0;\n dis[i][j]=mod;\n }\n while(!Q.empty()){\n int cost=Q.top().first;\n int y=Q.top().second.first;\n int x=Q.top().second.second;\n Q.pop();\n if(dis[y][x]<=cost)continue;\n dis[y][x]=cost;\n int dx[]={-1,0,1,0},dy[]={0,1,0,-1};\n lol(i,4){\n\tint xx=x+dx[i],yy=y+dy[i];\n\tif(xx<0||xx==w||yy<0||yy==h)continue;\n\tint newcost=cost+(p[y][x]!=p[yy][xx]);\n\tif(dis[yy][xx]>newcost)Qpush(newcost,yy,xx);\n }\n }\n int ans=mod;\n for(int i=0;i<h;i++)ans=min(ans,min(dis[i][0],dis[i][w-1]));\n for(int j=0;j<w;j++)ans=min(ans,min(dis[0][j],dis[h-1][j]));\n cout<<(ans+1)/2<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3224,
"score_of_the_acc": -0.1922,
"final_rank": 15
},
{
"submission_id": "aoj_0156_1999548",
"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) begin(r),end(r)\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 pii = pair<int,int> ;\nusing pll = pair<ll,ll> ;\n\nconst int mod = 1000000007;\nconstexpr ll inf = ((1<<30)-1)*2+1 ;\nconstexpr double PI = acos(-1.0) ;\ndouble eps = 1e-10 ;\nconst int dy[] = {-1,0,1,0,1,-1,1,-1};\nconst int dx[] = {0,-1,0,1,1,-1,-1,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\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n ll n,m;\n while(cin >> n >> m && n+m){\n vector<vector<char>> v(m+1,vector<char>(n+1,' '));\n using piii = pair<int,pair<int,int>>;\n priority_queue<piii> q;\n vector<vector<int>> d(m+1,vector<int>(n+1,inf));\n {\n int x = 0,y = 0;\n rep(j,m){\n rep(i,n){\n cin >> v[j][i];\n if(v[j][i] == '&'){\n x = i;\n y = j;\n }\n }\n }\n piii pos = mp(0,mp(y,x));\n d[y][x] = 0;\n q.push(pos);\n }\n int ans = inf;\n while(q.size()){\n auto Q = q.top();q.pop();\n auto p = Q.se;\n int dpt = Q.fi;\n int x = p.se,y = p.fi;\n rep(i,4){\n int nx = x + dx[i],ny = y + dy[i];\n if(value(nx,ny,n,m)){\n if(v[y][x] == v[ny][nx] && d[ny][nx] > d[y][x]){\n d[ny][nx] = d[y][x];\n q.push(mp(-dpt,mp(ny,nx)));\n }\n else if(d[ny][nx] > d[y][x] + (v[ny][nx] == '#')){\n d[ny][nx] = (v[ny][nx] == '#') + d[y][x];\n q.push(mp(-(dpt+1),mp(ny,nx)));\n }\n }\n else{\n ans = min(ans,d[y][x]);\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3608,
"score_of_the_acc": -0.2818,
"final_rank": 16
},
{
"submission_id": "aoj_0156_1964655",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define INF (1<<29)\n\ntypedef pair<int, int> pii;\n\nint main() {\n\tint n, m;\n\twhile (cin >> n >> m, n || m) {\n\t\tvector<vector<int> > cnt(m, vector<int>(n, INF));\n\t\tvector<string> str(m);\n\t\tREP(i, m) cin >> str[i];\n\t\t\n\t\tpriority_queue<pair<int, pii>, vector<pair<int, pii> >, greater<pair<int, pii> > > pq;\n\t\tREP(i, m) {\n\t\t\tpq.push(make_pair(str[i][0] == '#', pii(i, 0)));\n\t\t\tpq.push(make_pair(str[i][n - 1] == '#', pii(i, n - 1)));\n\t\t}\n\t\tREP(i, n) {\n\t\t\tpq.push(make_pair(str[0][i] == '#', pii(0, i)));\n\t\t\tpq.push(make_pair(str[m - 1][i] == '#', pii(m - 1, i)));\n\t\t}\n\t\t\n\t\twhile (!pq.empty()) {\n\t\t\tpair<int, pii> now = pq.top();\n\t\t\tpq.pop();\n\t\t\t\n\t\t\tint x = now.second.second, y = now.second.first;\n\t\t\tif (cnt[y][x] != INF) continue;\n\t\t\tcnt[y][x] = now.first;\n\t\t\t\n\t\t\tif (str[y][x] == '&') {\n\t\t\t\tcout << cnt[y][x] << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tint dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};\n\t\t\tREP(i, 4) {\n\t\t\t\tint nx = x + dx[i], ny = y + dy[i];\n\t\t\t\tif (!(nx >= 0 && nx < n && ny >= 0 && ny < m)) continue;\n\t\t\t\tpq.push(make_pair(cnt[y][x] + (str[y][x] != '#' && str[ny][nx] == '#'), pii(ny, nx)));\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1532,
"score_of_the_acc": -0.0559,
"final_rank": 12
},
{
"submission_id": "aoj_0156_1950645",
"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\t;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1<<30;\nint dx[]={0,0,1,-1};\nint dy[]={1,-1,0,0};\nint dp[110][110];\nint main(){\n\tint n,m;\n\twhile(cin>>m>>n,n+m){\n\t\tvector<string>in(n);\n\t\trep(i,n)cin>>in[i];\n\t\tqueue<pip>q;\n\t\tint sx,sy;\n\t\trep(i,110)rep(j,110)dp[i][j]=inf;\n\t\trep(i,n)rep(j,m)if(i==0||j==0||i==n-1||j==m-1){\n\t\t\tif(in[i][j]!='#'){\n\t\t\t\tq.push(pip(i,pii(j,0)));\n\t\t\t\tdp[i][j]=0;\n\t\t\t}else{\n\t\t\t\tq.push(pip(i,pii(j,1)));\n\t\t\t\tdp[i][j]=1;\n\t\t\t}\n\t\t}\n\t\trep(i,n)rep(j,m)if(in[i][j]=='&')sx=i,sy=j;\n\t\twhile(!q.empty()){\n\t\t\tpip p=q.front();\n\t\t\tq.pop();\n\t\t\tint x=p.first,y=p.second.first,cost=p.second.second;\n//\t\t\tcout<<x<<\" \"<<y<<\" \"<<cost<<endl;\n\t\t\tif(dp[x][y]<cost)continue;\n\t\t\trep(k,4){\n\t\t\t\tint nx=x+dx[k],ny=y+dy[k];\n\t\t\t\tif(nx<0||ny<0||nx>=n||ny>=m)continue;\n\t\t\t\tint ncost=cost+(in[nx][ny]=='#'?1:0);\n\t\t\t\tif(in[nx][ny]=='#'&&in[x][y]=='#')ncost--;\n//\t\t\t\tcout<<\" \"<<nx<<\" \"<<ny<<\" \"<<ncost<<endl;\n\t\t\t\tif(dp[nx][ny]>ncost){\n\t\t\t\t\tdp[nx][ny]=ncost;\n\t\t\t\t\tq.push(pip(nx,pii(ny,ncost)));\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<dp[sx][sy]<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1312,
"score_of_the_acc": -0.0085,
"final_rank": 3
},
{
"submission_id": "aoj_0156_1855760",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <cmath>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<P, int> Q;\n\nint main() {\n\tint n, m;\n\twhile (cin >> m >> n) {\n\t\tif (n == 0 && m == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector< vector<char> > c(n, vector<char>(m));\n\t\tvector< vector<int> > d(n, vector<int>(m, 1000));\n\t\tint si, sj;\n\t\tsi = sj = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tcin >> c[i][j];\n\t\t\t\tif (c[i][j] == '&') {\n\t\t\t\t\tsi = i;\n\t\t\t\t\tsj = j;\n\t\t\t\t\tc[si][sj] = '.';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\td[si][sj] = 0;\n\t\tqueue<Q> q;\n\t\tint di[] = {1, 0, -1, 0};\n\t\tint dj[] = {0, 1, 0, -1};\n\t\tq.push(Q(P(si, sj), 0));\n\t\twhile (!q.empty()) {\n\t\t\tQ qq = q.front();\n\t\t\tq.pop();\n\t\t\tP pp = qq.first;\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tif (pp.first+di[i] >= 0 && pp.first+di[i] < n && pp.second+dj[i] >= 0 && pp.second+dj[i] < m) {\n\t\t\t\t\tint aa = qq.second;\n\t\t\t\t\tif (c[pp.first][pp.second] == '.' && c[pp.first+di[i]][pp.second+dj[i]] == '#') {\n\t\t\t\t\t\taa++;\n\t\t\t\t\t}\n\t\t\t\t\tif (d[pp.first+di[i]][pp.second+dj[i]] > aa) {\n\t\t\t\t\t\td[pp.first+di[i]][pp.second+dj[i]] = aa;\n\t\t\t\t\t\tq.push(Q(P(pp.first+di[i], pp.second+dj[i]), aa));\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 < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tcout << d[i][j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t*/\n\t\tint MIN = 1000;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tMIN = min(MIN, min(d[i][0], d[i][m-1]));\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tMIN = min(MIN, min(d[0][i], d[n-1][i]));\n\t\t}\n\t\tcout << MIN << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1284,
"score_of_the_acc": -0.0058,
"final_rank": 2
},
{
"submission_id": "aoj_0156_1808207",
"code_snippet": "#include <iostream>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <functional>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <deque>\n#include <ctime>\n \nusing namespace std;\n \n#define rep(i,n) REP(i,0,n)\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\n#define pb push_back\n#define mp make_pair\n#define all(r) r.begin(),r.end()\n#define rall(r) r.rbegin(),r.rend()\n#define fi first\n#define se second\n#define println(X) cout<<X<<endl;\n#define DBG(X) cout<<#X<<\" : \"<<X<<endl;\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vii;\ntypedef vector<ll> vl;\ntypedef vector<vl> vll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n \nconst int INF = 1e9;\nconst ll MOD = 1e9 + 7;\ndouble EPS = 1e-8;\nconst double PI = acos(-1);\n\n//0156\n\nint dx[]={-1,1,0,0};\nint dy[]={0,0,-1,1};\n\nint d[110][110];\n\nbool isOutOfRange(int x, int y, int w, int h){\n if(x < 0 || x >= w || y < 0 || y >= h) return true;\n return false;\n}\n\nstring s[110];\n\nint main(){\n int x, y;\n int sx, sy;\n while(cin>>x>>y && x && y){\n rep(i, y) cin>>s[i];\n rep(i, y) rep(j, x){\n if(s[i][j] == '&'){\n sx = j;\n sy = i;\n }\n d[i][j] = INF;\n }\n //cout<<y<<\" \"<<x<<endl;\n priority_queue<pair<int, pii> > q;\n q.push(mp(0, mp(sy, sx)));\n d[sy][sx] = 0;\n pair<int, pii> p;\n int ans = INF;\n while(!q.empty()){\n p = q.top(); q.pop();\n //cout<<\" \"<<p.fi<<\" (\"<<p.se.fi<<\", \"<<p.se.fi<<endl;\n rep(i, 4){\n int nx = p.se.se + dx[i];\n int ny = p.se.fi + dy[i];\n if(isOutOfRange(nx, ny, x, y)){\n ans = min(ans, -p.fi);\n break;\n }\n int c = -p.fi + ((s[p.se.fi][p.se.se]!='#'&&s[ny][nx]=='#')?1:0);\n if(d[ny][nx] <= c) continue;\n d[ny][nx] = c;\n q.push(mp(-c, mp(ny, nx)));\n }\n if(ans != INF) break;\n }\n cout<<ans<<endl;\n // rep(i, y){\n // rep(j, x){\n // cout<<\" \"<<d[i][j];\n // }\n // cout<<endl;\n // }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1400,
"score_of_the_acc": -0.0169,
"final_rank": 5
},
{
"submission_id": "aoj_0156_1779364",
"code_snippet": "#include <queue>\n#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\n\n// ------ Class ------ //\nclass Graph2 {\npublic:\n\tstatic const long long INF = 1000000000000000000;\n\tint V, E; vector<vector<pair<int, long long> > > G;\n\tGraph2() : V(0), E(0), G(vector<vector<pair<int, long long> > >()) {}\n\tGraph2(int v) : V(v), E(0), G(vector<vector<pair<int, long long> > >(v)) {}\n\tGraph2(vector<vector<pair<int, long long> > > g) : V(g.size()), G(g) { for (int i = 0; i < g.size(); i++) E += g[i].size(); }\n\tint size() { return V; }\n\tvoid add1(int v1, int v2, long long w) { G[v1].push_back(make_pair(v2, w)); E++; }\n\tvoid add2(int v1, int v2, long long w) { add1(v1, v2, w); add1(v2, v1, w); }\n\tbool operator==(const Graph2& g) const { return G == g.G; }\n\tbool operator!=(const Graph2& g) const { return G != g.G; }\n\tvector<pair<int, long long> > operator[](int x) { return G[x]; }\n\tvector<long long> dist(int s) {\n\t\tpriority_queue<pair<long long, int> > que; que.push(make_pair(0, s));\n\t\tvector<long long> d(V, INF); d[s] = 0;\n\t\twhile (!que.empty()) {\n\t\t\tpair<long long, int> t = que.top(); que.pop();\n\t\t\tint u = t.second;\n\t\t\tfor (int i = 0; i < G[u].size(); i++) {\n\t\t\t\tint v = G[u][i].first; long long e = G[u][i].second;\n\t\t\t\tif (d[v] > d[u] + e) {\n\t\t\t\t\td[v] = d[u] + e;\n\t\t\t\t\tque.push(make_pair(-d[v], v));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn d;\n\t}\n};\n\n// ------ Main ------ //\nint H, W, g; string s[100];\nint main() {\n\twhile (cin >> W >> H, H) {\n\t\tfor (int i = 0; i < H; i++) cin >> s[i];\n\t\tGraph2 G(H * W + 1);\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 1; j < W; j++) {\n\t\t\t\tG.add1(i * W + j - 1, i * W + j, (s[i][j - 1] == '#' && s[i][j] != '#') ? 1 : 0);\n\t\t\t\tG.add1(i * W + j, i * W + j - 1, (s[i][j - 1] != '#' && s[i][j] == '#') ? 1 : 0);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tG.add1(i * W + j - W, i * W + j, (s[i - 1][j] == '#' && s[i][j] != '#') ? 1 : 0);\n\t\t\t\tG.add1(i * W + j, i * W + j - W, (s[i - 1][j] != '#' && s[i][j] == '#') ? 1 : 0);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tif (i == 0 || i + 1 == H || j == 0 || j + 1 == W) G.add1(H * W, i * W + j, 0);\n\t\t\t\tif (s[i][j] == '&') g = i * W + j;\n\t\t\t}\n\t\t}\n\t\tcout << G.dist(H * W)[g] << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4204,
"score_of_the_acc": -0.2864,
"final_rank": 17
},
{
"submission_id": "aoj_0156_1726132",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<queue>\nusing namespace std;\n#define MAX_N 1000\nint X[MAX_N][MAX_N], dist[MAX_N][MAX_N], W, H, gx, gy; char c;\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < MAX_N; i++) {\n\t\t\tfor (int j = 0; j < MAX_N; j++) {\n\t\t\t\tX[i][j] = 1000000000;\n\t\t\t\tdist[i][j] = 1000000000;\n\t\t\t}\n\t\t}\n\t\tcin >> W >> H; queue<pair<int, int>>Q;\n\t\tif (W == 0 && H == 0) { break; }\n\t\tfor (int i = 1; i <= H; i++) {\n\t\t\tfor (int j = 1; j <= W; j++) {\n\t\t\t\tcin >> c;\n\t\t\t\tif (c == '&') { gx = i; gy = j; }\n\t\t\t\tif (c == '#') { X[i][j] = 1; }\n\t\t\t\telse { X[i][j] = 0; }\n\t\t\t\tif (i == 1 || i == H || j == 1 || j == W) {\n\t\t\t\t\tQ.push(make_pair(i, j));\n\t\t\t\t\tdist[i][j] = X[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (!Q.empty()) {\n\t\t\tpair<int, int>pa = Q.front(); Q.pop();\n\t\t\tint cx = pa.first, cy = pa.second;\n\t\t\tint dx[4] = { 1,0,-1,0 };\n\t\t\tint dy[4] = { 0,1,0,-1 };\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint ex = cx + dx[i], ey = cy + dy[i];\n\t\t\t\tif (X[ex][ey] >= 2) { continue; }\n\t\t\t\tint dis = dist[cx][cy];\n\t\t\t\tif (X[cx][cy] == 0 && X[ex][ey] == 1) {\n\t\t\t\t\tdis += 1;\n\t\t\t\t}\n\t\t\t\tif (dist[ex][ey]>dis) {\n\t\t\t\t\tdist[ex][ey] = dis;\n\t\t\t\t\tQ.push(make_pair(ex, ey));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dist[gx][gy] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 10956,
"score_of_the_acc": -0.9617,
"final_rank": 18
},
{
"submission_id": "aoj_0156_1450171",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<stack>\n#include<cmath>\n#include<climits>\nusing namespace std;\n\nconst int dy[4] = {-1, 0, 1, 0}, dx[4] = {0, 1, 0, -1};\n\nint N, M;\n\nstruct Data{\n\tint y, x, cost;\n\tData(){}\n\tData(int _y, int _x, int _cost){\n\t\ty = _y; x = _x; cost = _cost;\n\t}\n};\n\nbool IsOutside(int y, int x){\n\treturn y < 0 || N <= y || x < 0 || M <= x;\n}\n\nint main(){\n\twhile(cin >> N >> M, N || M){\n\t\tswap(N, M);\n\t\t\n\t\tchar fld[100][100];\n\t\tqueue<Data> q;\n\t\tData q_front;\n\t\tint cost[100][100];\n\t\tfill_n( (int*)cost, 100*100, INT_MAX );\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tfor(int j = 0; j < M; j++){\n\t\t\t\tcin >> fld[i][j];\n\t\t\t\tif(fld[i][j] == '&') q.push( Data(i, j, 0) );\n\t\t\t}\n\t\t}\n\n\t\tint ans = INT_MAX;\n\t\twhile( !q.empty() ){\n\t\t\tq_front = q.front(); q.pop();\n\t\t\tif(cost[q_front.y][q_front.x] <= q_front.cost) continue;\n\t\t\tcost[q_front.y][q_front.x] = q_front.cost;\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tint ny = q_front.y + dy[i], nx = q_front.x + dx[i];\n\t\t\t\t\n\t\t\t\tif( IsOutside(ny, nx) ){\n\t\t\t\t\tans = min(ans, q_front.cost);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tint cnt = 0;\n\t\t\t\t\tif(fld[q_front.y][q_front.x] != '#' && fld[ny][nx] == '#')\n\t\t\t\t\t\tcnt = 1;\n\t\t\t\t\tq.push( Data(ny, nx, q_front.cost + cnt) );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1276,
"score_of_the_acc": -0.005,
"final_rank": 1
},
{
"submission_id": "aoj_0156_1340772",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <iostream>\n#include <sstream>\n#include <utility>\n#include <map>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <set>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int , int>P;\ntypedef pair<P,P>PP;//wall dist y x\nint M,N,mv[5]={-1,0,1,0,-1},res;\nchar B[105][105];\nP d[105][105];\n\nstruct Order\n{\n\tbool operator ()(PP const&a, PP const&b) const\n\t{\n\t\tif(a.first.first==b.first.first)\n\t\t\treturn a.first.second>b.first.second;\n\t\treturn a.first.first>b.first.first;\n\t}\n};\n\npriority_queue<PP,vector<PP>,Order>Q; //need finit\n\nvoid Pset(int y, int x)\n{\n\td[y][x]=make_pair(0,0);\n\tQ.push(make_pair(make_pair(0,0),make_pair(y,x)));\n}\n\nint main()\n{\n\tfor (;scanf(\"%d%d\\n\" ,&N,&M),N+M;)\n\t{\n\t\tres=100000000;\n\t\tmemset(d,0x7f, sizeof (d));\n\t\tfor(int i=0;i<=M+1;i++)for(int j=0;j<=N+1;j++)B[i][j]='.';\n\t\tfor(int i=0;i<M;i++)gets(B[i+1]+1);\n\t\tfor(int i=0;i<=M+1;i++){B[i][N+1]='.';B[i][N+2]=0;}\n\t\tN++;M++;\n\t\tQ.push(make_pair(make_pair(0,0),make_pair(0,0)));\n\t\twhile (!Q.empty())\n\t\t{\n\t\t\tPP tmp=Q.top();Q.pop();\n\t\t\tint y=tmp.second.first;\n\t\t\tint x=tmp.second.second;\n\t\t\tP cost=tmp.first;\n\t\t\tif (d[y][x]<cost)continue;\n\t\t\tif (B[y][x]=='&' )\n\t\t\t{\n\t\t\t\tres=min(res,cost.first);\n\t\t\t\tcontinue ;\n\t\t\t}\n\t\t\tfor (int i=0;i<4;i++)\n\t\t\t{\n\t\t\t\tint ny=y+mv[i];\n\t\t\t\tint nx=x+mv[i+1];\n\t\t\t\tif (ny<0||ny>M||nx<0||nx>N) continue;\n\t\t\t\tP nc=make_pair(cost.first+(B[y][x]=='#' &&B[ny][nx]!= '#'),cost.second+1);\n\t\t\t\tif (nc<d[ny][nx])\n\t\t\t\t{\n\t\t\t\t\td[ny][nx]=nc;\n\t\t\t\t\tQ.push(make_pair(nc,make_pair(ny,nx)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf( \"%d\\n\" ,res);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1432,
"score_of_the_acc": -0.02,
"final_rank": 8
},
{
"submission_id": "aoj_0156_1272113",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<string>\n#include<iostream>\n#include<cmath>\n#include<map>\n#include<set>\n#include<climits>\nusing namespace std;\ntypedef vector<string>vs;\ntypedef vector<int>vi;\ntypedef vector<vi>vvi;\ntypedef vector<double>vd;\ntypedef pair<int,int>pii;\ntypedef long long ll;\ntypedef pair<ll,ll>pll;\ntypedef vector<ll>vl;\ntypedef pair<int,pii>piii;\n#define rrep(i,x,n) for(int i=(x);i<(n);++i)\n#define rep(i,x) rrep(i,0,(x))\n#define fi first\n#define se second\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)\n#define all(c) (c).begin(),(c).end()\n#define rall(c) (c).rbegin(),(c).rend()\n#define pb push_back\n#define maxs(a,b) (a)=max(a,b)\n#define mins(a,b) (a)=min(a,b)\n///#include<sstream>\n///#include<cstring>\n///#include<stack>\n///#include<complex>\n\nint W,H;\nchar fld[100][101];\nconst int dx[]={-1,0,1,0};\nconst int dy[]={0,-1,0,1};\nint solve(){\n bool done[100][100]={{0}};\n priority_queue<piii,vector<piii>,greater<piii> >Q;\n rep(i,H){\n Q.push(piii(0,pii(i,0)));\n Q.push(piii(0,pii(i,W-1)));\n }\n rep(j,W){\n Q.push(piii(0,pii(0,j)));\n Q.push(piii(0,pii(H-1,j)));\n }\n\n while(!Q.empty()){\n piii p=Q.top();Q.pop();\n if(done[p.se.fi][p.se.se])continue;\n done[p.se.fi][p.se.se]=true;\n if(fld[p.se.fi][p.se.se]=='&')return p.fi;\n\n rep(i,4){\n int ty=p.se.fi+dy[i],tx=p.se.se+dx[i];\n if(ty<0||ty>=H||tx<0||tx>=W)continue;\n int tcost=p.fi;\n if(fld[p.se.fi][p.se.se]=='#'&&fld[ty][tx]!='#')tcost++;\n Q.push(piii(tcost,pii(ty,tx)));\n }\n }\n}\n\nint main(){\n while(scanf(\"%d%d\",&W,&H),W||H){\n rep(i,H)scanf(\"%s\",fld[i]);\n printf(\"%d\\n\",solve());\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1424,
"score_of_the_acc": -0.0192,
"final_rank": 7
},
{
"submission_id": "aoj_0156_1176564",
"code_snippet": "//「這い上がる」の定義があいまいなことから、エスパー力が本質っぽい問題だと思う。\n#include<iostream>\n#include<queue>\n#include<vector>\nusing namespace std;\ntypedef pair<int,int> P;\n\nint h, w;\nchar data[114][514];\nint dp[552194];\nqueue<P> que;\n\nint dy[4] = {1,0,-1,0};\nint dx[4] = {0,1,0,-1};\nint main(){\n\tint i,j;\n\twhile (cin >> w >> h) {\n\t\tint g;\n\t\tif (!h) break;\n\t\tfor (i = 0; i < h; i++) cin >> data[i];\n\t\tfor (i = 0; i < w*h; i++) dp[i] = 5642194;\n\t\tfor (i = 0; i < h; i++)\n\t\t\tfor (j = 0; j < w; j++) {\n\t\t\t\tif (i == 0 || i == h-1 || j == 0 || j == w-1)\n\t\t\t\t\tque.push(P(0, i*w + j));\n\t\t\t\tif (data[i][j] == '&')\n\t\t\t\t\tg = i * w + j;\n\t\t\t}\n\t\twhile(!que.empty()) {\n\t\t\tint cost = que.front().first;\n\t\t\tint pos = que.front().second;\n\t\t\tque.pop();\n\t\t\tif (dp[pos] <= cost)\n\t\t\t\tcontinue;\n\t\t\tdp[pos] = cost;\n\t\t\tfor (i = 0; i < 4; i++) {\n\t\t\t\tint ny = pos/w + dy[i];\n\t\t\t\tint nx = pos%w + dx[i];\n\t\t\t\tif (ny < 0 || ny >= h || nx < 0 || nx >= w)\n\t\t\t\t\tcontinue;\n\t\t\t\tque.push( P( cost + (data[ny][nx] != '#' && data[pos/w][pos%w] == '#'), ny*w + nx ) );\n\t\t\t}\n\t\t}\n\t\tcout << dp[g] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1332,
"score_of_the_acc": -0.0104,
"final_rank": 4
},
{
"submission_id": "aoj_0156_1176432",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1000000000;\nconst int dx[] = {-1, 0, 1, 0};\nconst int dy[] = {0, -1, 0, 1};\n\nstruct STATE\n{\n\tint x, y, d;\n\tbool operator<(const STATE &t)const{\n\t\treturn d > t.d;\n\t}\n};\n\nchar grid[128][128];\nint d[128][128];\n\nbool ingrid(int x, int y, int w, int h)\n{\n\treturn x >= 0 && x <= h + 1 && y >= 0 && y <= w + 1;\n}\n\nint main()\n{\n\tint w, h;\n\twhile (scanf(\"%d %d\", &w, &h), w + h){\n\t\tmemset(grid, '.', sizeof(grid));\n\t\tfor (int i = 0; i < 128; i++){\n\t\t\tfor (int j = 0; j < 128; j++){\n\t\t\t\td[i][j] = INF;\n\t\t\t}\n\t\t}\n\n\t\tint sx, sy;\n\t\tfor (int i = 1; i <= h; i++){\n\t\t\tfor (int j = 1; j <= w; j++){\n\t\t\t\tscanf(\" %c\", &grid[i][j]);\n\t\t\t\tif (grid[i][j] == '&'){\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint res = 0;\n\t\tpriority_queue<STATE> que;\n\t\tfor (que.push({sx, sy, 0}); !que.empty(); que.pop()){\n\t\t\tSTATE st = que.top();\n\t\t\tif (d[st.x][st.y] <= st.d) continue;\n\t\t\td[st.x][st.y] = st.d;\n\t\t\tif (st.x == 0 || st.y == 0 || st.x == h + 1 || st.y == w + 1){\n\t\t\t\tres = st.d;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor (int dir = 0; dir < 4; dir++){\n\t\t\t\tint tx = st.x + dx[dir];\n\t\t\t\tint ty = st.y + dy[dir];\n\t\t\t\tif (!ingrid(tx, ty, w, h)) continue;\n\t\t\t\tif (d[tx][ty] > st.d + (grid[st.x][st.y] == '#')){\n\t\t\t\t\tque.push({tx, ty, st.d + (grid[st.x][st.y] == '#' && grid[tx][ty] == '.')});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", res);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1420,
"score_of_the_acc": -0.0188,
"final_rank": 6
},
{
"submission_id": "aoj_0156_1173933",
"code_snippet": "#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 <deque>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n//#include <cctype>\n#include <cstring>\n//#include <ctime>\n#include <iterator>\n#include <bitset>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <tuple>\n#include <initializer_list>\n#include <unordered_set>\n#include <unordered_map>\n#include <forward_list>\n\n#define cauto const auto&\n#else\n\n#endif\n\nusing namespace std;\n\n\nnamespace{\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\nint dd[]={1,0,-1,0,1};\n\nVV(char) vv;\nvvint vis;\nvvint tmp;\nint h,w;\nbool foo2(int a,int b){\n\t// cout<<a<<\" \"<<b<<endl;\n\tif(vv[a][b]==' ') return true;\n\tif(vis[a][b]) return false;\n\tif(tmp[a][b]==-1) return false;\n\tif(vv[a][b]=='#'&&tmp[a][b]==0){\n\t\t// vis[a][b]=1;\n\t\ttmp[a][b]=-1;\n\t\treturn false;\n\t}\n\t// if(vv[a][b]=='#') return false;\n\tvis[a][b]=1;\n\tbool ret=false;\n\trep(i,4){\n\t\tret|=foo2(a+dd[i],b+dd[i+1]);\n\t}\n\treturn ret;\n}\nvoid foo3(int a,int b){\n\tif(vv[a][b]!='#') return;\n\ttmp[a][b]=-1;\n\trep(i,4){\n\t\tif(tmp[a+dd[i]][b+dd[i+1]]==-1) continue;\n\t\tfoo3(a+dd[i],b+dd[i+1]);\n\t}\n}\nint foo(int c){\n\t// cout<<a<<\" \"<<b<<\" \"<<c<<endl;\n\t// rep(i,h+2){\n\t\t// rep(j,w+2){\n\t\t\t// cout<<tmp[i][j];\n\t\t// }\n\t\t// cout<<endl;\n\t// }\n\t// cout<<endl;\n\t// int a;\n\t// cin>>a;\n\trep(i,h+2){\n\t\trep(j,w+2){\n\t\t\tif(tmp[i][j]==1){\n\t\t\t\t// cout<<\"aaa \"<<endl;\n\t\t\t\tif(foo2(i,j)) return c;\n\t\t\t}\n\t\t}\n\t}\n\trep(i,h+2){\n\t\trep(j,w+2){\n\t\t\tif(tmp[i][j]==1){\n\t\t\t\ttmp[i][j]=2;\n\t\t\t}\n\t\t}\n\t}\n\trep(i,h+2){\n\t\trep(j,w+2){\n\t\t\tif(tmp[i][j]==-1){\n\t\t\t\tfoo3(i,j);\n\t\t\t}\n\t\t}\n\t}\n\trep(i,h+2){\n\t\trep(j,w+2){\n\t\t\tif(tmp[i][j]==-1){\n\t\t\t\ttmp[i][j]=1;\n\t\t\t}\n\t\t}\n\t}\n\treturn foo(c+1);\n}\n\nvoid mainmain(){\n\t// int w,h;\n\twhile(cin>>w>>h,w||h){\n\t\tinitvv(vv,h+2,w+2,' ');\n\t\tinitvv(vis,h+2,w+2,0);\n\t\tinitvv(tmp,h+2,w+2,0);\n\t\treep(i,1,h+1){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\treep(j,1,w+1){\n\t\t\t\tvv[i][j]=s[j-1];\n\t\t\t\tif(vv[i][j]=='&'){\n\t\t\t\t\ttmp[i][j]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// rep(i,h+2){\n\t\t\t// rep(j,w+2){\n\t\t\t\t// cout<<vv[i][j];\n\t\t\t// }\n\t\t\t// cout<<endl;\n\t\t// }\n\t\tcout<<foo(0)<<endl;\n\t}\n}\n\n\n\n}\nmain() try{\n mainmain();\n}\ncatch(...){\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1572,
"score_of_the_acc": -0.0334,
"final_rank": 11
},
{
"submission_id": "aoj_0156_1155681",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nconst int dx[] = {1, -1, 0, 0};\nconst int dy[] = {0, 0, 1, -1};\nchar field[104][104];\n\nint main() {\n int n, m;\n while (cin >> n >> m, n) {\n for (int i=0; i<104; ++i) {\n for (int j=0; j<104; ++j) {\n if (i % 103 == 0 || j % 103 == 0) {\n field[i][j] = '*';\n } else {\n field[i][j] = '.';\n }\n }\n }\n for (int i=2; i<=m+1; ++i) {\n for (int j=2; j<=n+1; ++j) {\n cin >> field[i][j];\n }\n }\n bool ok = false;\n int k = 0;\n for (; !ok; ++k) {\n queue<pair<int,int> > q;\n q.push(make_pair(1,1));\n while ( ! q.empty() && ! ok) {\n int x = q.front().first;\n int y = q.front().second;\n q.pop();\n for (int i=0; i<4; ++i) {\n if (field[y + dy[i]][x + dx[i]] == '&') {\n ok = true;\n break;\n }\n if (field[y + dy[i]][x + dx[i]] == '.') {\n field[y + dy[i]][x + dx[i]] = '#';\n q.push(make_pair(x + dx[i], y + dy[i]));\n }\n }\n }\n if (ok) break;\n queue<pair<int,int> > q2;\n q2.push(make_pair(1,1));\n while ( ! q2.empty()) {\n int x = q2.front().first;\n int y = q2.front().second;\n q2.pop();\n for (int i=0; i<4; ++i) {\n if (field[y + dy[i]][x + dx[i]] == '#') {\n field[y + dy[i]][x + dx[i]] = '.';\n q2.push(make_pair(x + dx[i], y + dy[i]));\n }\n }\n }\n }\n cout << k << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1224,
"score_of_the_acc": -0.0263,
"final_rank": 10
},
{
"submission_id": "aoj_0156_1150798",
"code_snippet": "#include <bits/stdc++.h>\n\n//{{{ graph.hpp\n#ifndef INCLUDE_GRAPH_HPP\n#define INCLUDE_GRAPH_HPP\n#include <vector>\nnamespace orislib {\nstruct Edge {\n typedef int weight_t;\n int from, to;\n weight_t w;\n Edge(int from, int to, weight_t w) : from(from), to(to), w(w) {}\n bool operator<(const Edge& e) const {\n return w != e.w ? w > e.w : from != e.from ? from < e.from : to < e.to;\n }\n static const weight_t INF;\n};\nconst int Edge::INF=INT_MAX;\ntypedef std::vector<Edge> Edges;\ntypedef std::vector<Edges> Graph;\n}\n#endif\n//}}}\n\nusing namespace std;\nusing namespace orislib;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef tuple<int, int> duo;\nconst int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};\nconst int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};\nconst int Mod = 1000000000 + 0;\n//{{{ templates\n#define TT_ template<typename T>inline\n#define TTF_ template<typename T,typename F>inline\nTT_ T sq(T x){return x*x;}\nTT_ T In(){T x;cin>>x;return x;}\nTT_ void Out(T&x){cout<<x;}\nTT_ void sort(T&v){sort(begin(v),end(v));}\nTT_ void revs(T&v){reverse(begin(v),end(v));}\nTT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}\nTT_ int ubnd(T&v,typename T::value_type x){return upper_bound(begin(v),end(v),x)-begin(v);}\nTT_ int lbnd(T&v,typename T::value_type x){return lower_bound(begin(v),end(v),x)-begin(v);}\nTTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}\nTTF_ void show(T&v,F f,string d=\" \",string e=\"\\n\"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}\nTT_ typename T::iterator minel(T&v){return min_element(begin(v),end(v));}\nTT_ typename T::iterator maxel(T&v){return max_element(begin(v),end(v));}\n\ninline void fast_io(){ios_base::sync_with_stdio(0);cin.tie(0);}\ninline int in(){int x;scanf(\"%d\",&x);return x;}\ninline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}\ninline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}\n//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple\n\n//{{{ void dijkstra(g, s, &dist, &prev)\nvoid dijkstra(const Graph& g, int s, vector<Edge::weight_t>& dist, vector<int>& prev)\n{\n const int V = g.size();\n prev.assign(V, -1);\n dist.assign(V, Edge::INF);\n dist[s] = 0;\n priority_queue<Edge> pq;\n for (pq.push(Edge(-2, s, 0)); !pq.empty();){\n Edge c = pq.top();\n pq.pop();\n if (prev[c.to] != -1) continue;\n prev[c.to] = c.from;\n for (const auto& e : g[c.to]){\n if (dist[e.to] > e.w + c.w){\n dist[e.to] = e.w + c.w;\n pq.push(Edge(e.from, e.to, e.w + c.w));\n }\n }\n }\n}\n//}}}\n\nint main()\n{\n int w, h;\n while (w = in(), h = in()){\n Graph g(w * h);\n char field[128][128];\n for (int i = 0; i < h; i++) scanf(\"%s\", field[i]);\n int s;\n for (int i = 0; i < h; i++){\n for (int j = 0; j < w; j++){\n if (field[i][j] == '&'){\n s = i * w + j;\n field[i][j] = '.';\n }\n for (int d = 0; d < 4; d++){\n int nx = j + dx[d], ny = i + dy[d];\n if (nx < 0 || w <= nx || ny < 0 || h <= ny) continue;\n g[i * w + j].emplace_back(i * w + j, ny * w + nx, field[i][j] == '.' && field[ny][nx] == '#');\n }\n }\n }\n vector<int> dist, prev;\n dijkstra(g, s, dist, prev);\n int mini = 1000000;\n for (int i = 0; i < h; i++){\n mini = min(mini, dist[i * w]);\n mini = min(mini, dist[i * w + w - 1]);\n }\n for (int i = 0; i < w; i++){\n mini = min(mini, dist[i]);\n mini = min(mini, dist[(h - 1) * w + i]);\n }\n printf(\"%d\\n\", mini);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2248,
"score_of_the_acc": -0.0984,
"final_rank": 14
},
{
"submission_id": "aoj_0156_1149438",
"code_snippet": "#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\ntypedef pair<int, int> P;\ntypedef pair<int, P> PP;\nconst int INF = 1e9;\n\nint W, H, my[] = {0, 0, 1, -1}, mx[] = {1, -1, 0, 0};\nvector< vector<char> > v;\n\nint solve(){\n priority_queue<PP, vector<PP>, greater<PP> > open;\n open.push(PP(0, P(0, 0)));\n vector< vector<int> > closed(H, vector<int>(W, INF));\n while(!open.empty()){\n PP tmp = open.top(); open.pop();\n int y = tmp.second.first, x = tmp.second.second, cnt = tmp.first;\n if(closed[y][x] <= cnt) continue;\n closed[y][x] = cnt;\n REP(i, 4){\n int ny = y + my[i], nx = x + mx[i];\n if(ny >= 0 && nx >= 0 && ny < H && nx < W) open.push(PP((v[y][x] == '#' && v[ny][nx] != '#' ? cnt + 1 : cnt), P(ny, nx)));\n }\n }\n P tar;\n REP(i, H) REP(j, W) if(v[i][j] == '&') tar = P(i, j);\n return closed[tar.first][tar.second];\n}\n\nint main() {\n while(cin >>W >>H && W){\n H += 2; W += 2;\n v = vector< vector<char> >(H, vector<char>(W, '.'));\n FOR(i, 1, H - 1) FOR(j, 1, W - 1) cin >>v[i][j];\n cout <<solve() <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1532,
"score_of_the_acc": -0.0559,
"final_rank": 12
},
{
"submission_id": "aoj_0156_1061027",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <queue>\nusing namespace std;\n\nstruct pos {\n\tint x, y;\n\tint cost;\n\tpos() {}\n\tpos(int x_, int y_, int cost_) {\n\t\tx = x_; y = y_; cost = cost_;\n\t}\n\tbool operator<(const pos p) const {\n\t\treturn cost > p.cost;\n\t}\n};\n\nconst int INF = 1000000;\n\nint main() {\n\tint n, m;\n\twhile(cin >> n >> m, n | m) {\n\t\tchar in[128][128];\n\t\tint cost[128][128];\n\t\tfor(int i = 0; i < 128; i++) {\n\t\t\tfor(int j = 0; j < 128; j++) {\n\t\t\t\tin[i][j] = '.';\n\t\t\t\tcost[i][j] = INF;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < m; i++) {\n\t\t\tscanf(\"%s\", in[i + 1] + 1);\n\t\t\tin[i + 1][n + 1] = '.';\n\t\t}\n\n\t\tpriority_queue<pos> q;\n\t\tfor(int i = 1; i < m + 1; i++) {\n\t\t\tfor(int j = 1; j < n + 1; j++) {\n\t\t\t\tif(in[i][j] == '&') {\n\t\t\t\t\tq.push(pos(j, i, 0));\n\t\t\t\t\ti = m + 1;\n\t\t\t\t\tj = n + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint dx[] = {-1, 1, 0, 0};\n\t\tint dy[] = {0, 0, -1, 1};\n\t\tint ans = -1;\n\t\twhile(!q.empty()) {\n\t\t\tpos p;\n\t\t\tp = q.top(); q.pop();\n\t\t\tif(cost[p.y][p.x] == INF) {\n\t\t\t\tif(p.x <= 0 || n + 1 <= p.x || p.y <= 0 || m + 1 <= p.y) {\n\t\t\t\t\tans = p.cost;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcost[p.y][p.x] = p.cost;\n\t\t\t\tfor(int i = 0; i < 4; i++) {\n\t\t\t\t\tif(cost[p.y + dy[i]][p.x + dx[i]] == INF) {\n\t\t\t\t\t\tint c = p.cost;\n\t\t\t\t\t\tif(in[p.y][p.x] == '#' && in[p.y + dy[i]][p.x + dx[i]] == '.') {\n\t\t\t\t\t\t\tc++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tq.push(pos(p.x + dx[i], p.y + dy[i], c));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/*\n\t\tfor(int i = 1; i < m + 1; i++) {\n\t\t\tfor(int j = 1; j < n + 1; j++) {\n\t\t\t\tcout << (cost[i][j] == INF ? in[i][j] : '*');\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t*/\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1436,
"score_of_the_acc": -0.0204,
"final_rank": 9
},
{
"submission_id": "aoj_0156_1059882",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <set>\n#include <cstring>\n#include <cassert>\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,j) FOR(i,0,j)\n#define mp std::make_pair\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef std::pair<int,int> P;\ntypedef std::pair<int,P> State;\n\nconst int INF = 1001001001;\n\n// S N E W(南北東西)\nconst int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};\n\nint N, M; // N: x, M: y\nint map[102][102];\nbool used[1000][102][102];\n\nint main(){\n while(std::cin >> N >> M, N){\n memset(used, 0, sizeof(used));\n memset(map, 0, sizeof(map));\n\n FOR(i, 1, M+1){\n FOR(j, 1, N+1){\n char c;\n std::cin >> c;\n if(c == '.'){map[i][j] = 0;}\n else if(c == '#'){map[i][j] = -1;}\n else{map[i][j] = 1;}\n }\n }\n \n std::priority_queue<State,std::vector<State>,std::greater<State>> q;\n REP(i, N+2){\n q.push(mp(0, mp(0, i)));\n q.push(mp(0, mp(M+1, i)));\n }\n\n REP(i, M+2){\n q.push(mp(0, mp(i, 0)));\n q.push(mp(0, mp(i, N+1)));\n }\n\n int res = -1;\n while(!q.empty()){\n State s = q.top(); q.pop();\n int t = s.first, y = s.second.first, x = s.second.second;\n\n if(t >= 1000){continue;}\n if(map[y][x] == 1){res = t; break;}\n if(used[t][y][x]){continue;}\n\n used[t][y][x] = true;\n \n REP(i, 4){\n int nx = x + dx[i], ny = y + dy[i];\n if(0 <= nx && nx <= N+1 &&\n 0 <= ny && ny <= M+1){\n if(map[y][x] == 0 && map[ny][nx] == -1){\n if(!used[t+1][ny][nx]){\n q.push(mp(t+1, mp(ny, nx)));\n }\n }else{\n q.push(mp(t, mp(ny, nx)));\n }\n }\n }\n }\n\n assert(res != -1);\n std::cout << res << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 11628,
"score_of_the_acc": -1.5789,
"final_rank": 20
}
] |
aoj_0157_cpp
|
マトリョーシカ
マトリョーシカとは女性像をかたどった木製の人形で、ロシアの代表的な民芸品です。マトリョーシカは、大きな人形の中にそれより小さな人形が入っている入れ子構造になっており、大きさの異なる複数の人形で構成されています。このような入れ子構造にするため、各人形の胴体は上下で分割できる筒状の構造になっています。マトリョーシカは職人の手で手作りされるため、一つ一つの人形は世界に一つしかない非常に貴重なものになります。
兄弟である一郎君と次郎君は、マトリョーシカで遊ぶのが大好きで、各自がそれぞれ1組のマトリョーシカを持っていました。一郎君のマトリョーシカは
n
個の人形から構成されており、次郎君のマトリョーシカは
m
個の人形から構成されています。
ある日、好奇心が旺盛な一郎君は、これら2組のマトリョーシカに含まれる人形たちを組み合わせて、より多くの人形を含む新たなマトリョーシカを作れないかと考えました。つまり、
n + m
個の人形を使い、
k
個の人形からなる１組のマトリョーシカを作ることを試みたのです。
n
と
m
の大きい方よりも
k
を大きくすることができれば、一郎君の目的は達成されます。
兄弟は2人仲良く、どのように人形を組み合わせれば
k
の値を最大にできるかを考えました。しかし、幼い2人にとってこの問題はあまりにも難しいので、年上のあなたはプログラムを作成して弟たちを助けることにしました。
一郎君と次郎君のマトリョーシカの人形の情報を入力とし、新たなマトリョーシカが含む人形の数
k
を出力するプログラムを作成して下さい。入力される人形に大きさが同じものは存在しません。また、人形を高さ
h
半径
r
の円柱とみなした場合、高さ
h
、半径
r
の人形が含むことのできる人形は
x < h
かつ
y < r
を満たす高さ
x
半径
y
の人形です。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
n
h
1
r
1
h
2
r
2
:
h
n
r
n
m
h
1
r
1
h
2
r
2
:
h
m
r
m
１行目に一郎君のマトリョーシカの人形の数
n
(
n
≤ 100)、続く
n
行に一郎君の第
i
の人形の高さ
h
i
と半径
r
i
(
h
i
,
r
i
< 1000) が与えられます。
続く行に二郎君のマトリョーシカの人形の数
m
(
m
≤ 100)、続く
m
行に二郎君の第
i
の人形の高さ
h
i
と半径
r
i
(
h
i
,
r
i
< 1000) が与えられます。
データセットの数は 20 を越えない。
Output
入力データセットごとに新たなマトリョーシカが含む人形の数
k
を出力します。
Sample Input
6
1 1
4 3
6 5
8 6
10 10
14 14
5
2 2
5 4
6 6
9 8
15 10
4
1 1
4 3
6 5
8 6
3
2 2
5 4
6 6
4
1 1
4 3
6 5
8 6
4
10 10
12 11
18 15
24 20
0
Output for the Sample Input
9
6
8
|
[
{
"submission_id": "aoj_0157_6310934",
"code_snippet": "#include<string.h>\n#include<stdio.h>\n\n\n#define MAX_LEN 100\nstruct Node\n{\n\tint r;\n\tint h;\n\tint id;\n};\n\nNode g_a[MAX_LEN];\nNode g_b[MAX_LEN];\nint g_dp[MAX_LEN+1][MAX_LEN+1][MAX_LEN *2 + 1];\n\nint search(Node a[], int aidx, int alen, Node b[], int bidx, int blen, Node lastNode)\n{\n\tif (aidx >= alen && bidx >= blen)\n\t{\n\t\treturn 0;\n\t}\n\t\n\n\tif (g_dp[aidx][bidx][lastNode.id] != -1)\n\t\treturn g_dp[aidx][bidx][lastNode.id];\n\n\tint cnt = 0;\n\tint tmp = 0;\n\tint ret1 = 0, ret2 = 0;\n\tif (aidx < alen)\n\t{\n\n\t\t//选择\n\t\tif (a[aidx].h > lastNode.h && a[aidx].r > lastNode.r)\n\t\t{\n\t\t\ttmp = search(a, aidx + 1, alen, b, bidx, blen, a[aidx]) + 1;\n\t\t\tif (ret1 < tmp)\n\t\t\t\tret1 = tmp;\n\t\t}\n\n\t\ttmp = search(a, aidx + 1, alen, b, bidx, blen, lastNode);\n\t\tif (ret1 < tmp)\n\t\t\tret1 = tmp;\n\t}\n\n\tif (bidx < blen)\n\t{\n\t\tif (b[bidx].h > lastNode.h && b[bidx].r > lastNode.r)\n\t\t{\n\t\t\ttmp = search(a, aidx, alen, b, bidx + 1, blen, b[bidx]) + 1;\n\t\t\tif (ret2 < tmp)\n\t\t\t\tret2 = tmp;\n\t\t}\n\t\ttmp = search(a, aidx, alen, b, bidx + 1, blen, lastNode);\n\t\tif (ret2 < tmp)\n\t\t\tret2 = tmp;\n\t}\n\tif (ret1 < ret2)\n\t\tret1 = ret2;\n\t\n\tg_dp[aidx][bidx][lastNode.id] = ret1;\n\treturn g_dp[aidx][bidx][lastNode.id];\n}\n\n\n\nint main()\n{\n\tint n, m;\n\n\twhile (1)\n\t{\n\t\tscanf(\"%d\", &n);\n\t\tif (n == 0)\n\t\t\tbreak;\n\t\tmemset(g_a, 0, sizeof(g_a));\n\t\tmemset(g_b, 0, sizeof(g_b));\n\t\tmemset(g_dp, -1, sizeof(g_dp));\n\n\n\t\tint id = 1;\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tscanf(\"%d%d\", &g_a[i].h, &g_a[i].r);\n\t\t\tg_a[i].id = id++;\n\t\t}\n\t\tscanf(\"%d\", &m);\n\t\tfor (int i = 0; i < m; i++)\n\t\t{\n\t\t\tscanf(\"%d%d\", &g_b[i].h, &g_b[i].r);\n\t\t\tg_b[i].id = id++;\n\t\t}\n\n\t\tNode lastNode;\n\t\tlastNode.r = 0;\n\t\tlastNode.h = 0;\n\t\tlastNode.id = 0;\n\t\tint num = search(g_a, 0, n, g_b, 0, m, lastNode);\n\t\tprintf(\"%d\\n\", num);\n\t}\n\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 10640,
"score_of_the_acc": -1.2872,
"final_rank": 17
},
{
"submission_id": "aoj_0157_3302098",
"code_snippet": "#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\n#define FOE(i,a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT(n) (1LL<<(n))\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());\n\ntypedef long long LL;\ntemplate<typename T> using V = std::vector<T>;\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\n\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \" \";} std::cout << v[i];} std::cout << \"\\n\"; }\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\n\nconst int INF = 1L << 30;\nconst double EPS = 1e-9;\nconst std::string YES = \"YES\", Yes = \"Yes\", NO = \"NO\", No = \"No\";\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\n\nusing namespace std;\n\nint main() {\n cin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile (true) {\n\t int N , M;\n\t cin >> N;\n\t if (N == 0) {\n\t break;\n\t }\n\t vector<pair<int, int>> m;\n\t FOR(i, 0, N) {\n\t int h, r;\n\t cin >> h >> r;\n\t m.emplace_back(make_pair(h, r));\n\t }\n\t cin >> M;\n FOR(i, 0, M) {\n int h, r;\n cin >> h >> r;\n m.emplace_back(make_pair(h, r));\n }\n\n vector<vector<int>> dp(1001, vector<int>(1001, -1));\n dp[0][0] = 0;\n\n FOR(j, 0, dp.size()) {\n FOR(k, 0, dp[0].size()) {\n if (dp[j][k] == -1) {\n continue;\n }\n FOR(i, 0, m.size()) {\n int h = m[i].first;\n int r = m[i].second;\n\n if (j < h and k < r) {\n dp[h][r] = max(dp[h][r], dp[j][k] + 1);\n }\n }\n }\n }\n\n int ans = 0;\n FOR(j, 0, dp.size()) {\n FOR(k, 0, dp[0].size()) {\n ans = max(ans, dp[j][k]);\n }\n }\n\n print(ans);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6800,
"score_of_the_acc": -0.3182,
"final_rank": 10
},
{
"submission_id": "aoj_0157_2523593",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\nint n, m, ans;\npair<int, int> doll[200];\nint dp[1000][1000];\nint main()\n{\n\twhile(cin >> n && n)\n\t{\n\t\tmemset(dp, -1, sizeof(dp));\n\t\tans = 0;\n\t\tdp[0][0] = 0;\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tcin >> doll[i].F >> doll[i].S;\n\t\tcin >> m;\n\t\tfor(int i = n; i < n + m; i++)\n\t\t\tcin >> doll[i].F >> doll[i].S;\n\t\tsort(doll, doll + n + m);\n\t\tfor(int i = 0; i < n + m; i++)\n\t\t\tfor(int j = 0; j < doll[i].F; j++)\n\t\t\t\tfor(int k = 0; k < doll[i].S; k++)\n\t\t\t\t\tdp[doll[i].F][doll[i].S] = max(dp[doll[i].F][doll[i].S], dp[j][k] + 1);\n\n\t\tfor(int i = 0; i < 1000; i++)\n\t\t\tfor(int j = 0; j < 1000; j++)\n\t\t\t\tans = max(ans, dp[i][j]);\n\t\t\tcout << ans << endl;\n\t}\n\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 7000,
"score_of_the_acc": -1.3296,
"final_rank": 20
},
{
"submission_id": "aoj_0157_2513600",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct doll{\n int h,r;\n};\n\nbool operator<(const doll& d1,const doll& d2){\n if(d1.h == d2.h){\n return d1.r > d2.r;\n }\n return d1.h < d2.h;\n}\n\nint dp[1001][1001] = {0};//h,r\n\nint main() {\n\n while(1){\n\n for(int i=0;i<1001;i++){\n for(int j=0;j<1001;j++){\n dp[i][j] = 0;\n }\n }\n\n int n;\n\n cin >> n;\n\n if(n==0) break;\n\n int h,r;\n\n vector<doll> v;\n doll tmp;\n\n for(int i=0;i<n;i++){\n cin >> h >> r;\n tmp.h = h;\n tmp.r = r;\n dp[h][r] = 1;\n v.push_back(tmp);\n }\n\n int m;\n\n cin >> m;\n\n for(int i=0;i<m;i++){\n cin >> h >> r;\n tmp.h = h;\n tmp.r = r;\n dp[h][r] = 1;\n v.push_back(tmp);\n }\n\n /*for(int i=0;i<n+m;i++){\n cout << v[i].h << \" \" << v[i].r << endl;\n }*/\n\n sort(v.begin(),v.end());\n\n\n\n for(int k=0;k<n+m;k++) {\n for (int i = 1; i < v[k].h; i++) {\n for (int j = 1; j < v[k].r; j++) {\n if (dp[i][j] != 0) {\n dp[v[k].h][v[k].r] = max(dp[v[k].h][v[k].r], dp[i][j] + 1);\n }\n }\n }\n }\n\n /*for(int i=0;i<=n+m;i++){\n for(int j=0;j<=n+m;j++){\n cout << dp[i][j] << \" \";\n }\n cout << endl;\n }*/\n\n int ans = 0;\n\n for(int i=0;i<n+m;i++){\n //cout << dp[i] << endl;\n ans = max(dp[v[i].h][v[i].r],ans);\n }\n\n cout << ans << endl;\n\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 7008,
"score_of_the_acc": -1.0801,
"final_rank": 14
},
{
"submission_id": "aoj_0157_2418079",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint N, M, h[200], r[200];\n\nint main() {\n while (true) {\n cin >> N;\n if (N == 0) break;\n for (int j = 0; j < N; ++j) {\n cin >> h[j] >> r[j];\n }\n cin >> M;\n for (int j = 0; j < M; ++j) {\n cin >> h[j+N] >> r[j+N];\n }\n\n int arr[1001][1001];\n for (int j = 0; j <= 1000; ++j) fill(arr[j], arr[j] + 1001, 0);\n\n for (int j = 0; j < N+M; ++j) {\n arr[h[j]][r[j]] = 1;\n }\n\n int dp[1001][1001];\n for (int j = 0; j <= 1000; ++j) fill(dp[j], dp[j] + 1001, 0);\n\n for (int j = 0; j <= 1000; ++j) {\n for (int k = 0; k <= 1000; ++k) {\n if (j > 0 && k > 0) {\n dp[j][k] = max(dp[j-1][k-1] + arr[j][k], max(dp[j-1][k], dp[j][k-1]));\n } else if (j > 0) {\n dp[j][k] = dp[j-1][k];\n } else if (k > 0) {\n dp[j][k] = dp[j][k-1];\n }\n }\n }\n\n cout << dp[1000][1000] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 10892,
"score_of_the_acc": -1.3016,
"final_rank": 18
},
{
"submission_id": "aoj_0157_2317385",
"code_snippet": "#include<bits/stdc++.h>\n#define mk make_pair\n#define f first\n#define s second\nusing namespace std;\nint n,m,p1,p2;\nmap<pair<int,pair<int,int> >,int >m1;\n\nvector<pair<int,int> >v;\n\nint dfs(int d,int h,int w){\n int res=0;\n if(m1[mk(d,mk(h,w))])return m1[mk(d,mk(h,w))];\n if(d==v.size()) return 0;\n if(v[d].f<h&&v[d].s<w)\n res=max(res,dfs(d+1,v[d].f,v[d].s))+1;\n res=max(res,dfs(d+1,h,w));\n return m1[mk(d,mk(h,w))]=res;\n}\n\nmain(){\n while(cin>>n,n){\n m1.clear();\n v.clear();\n for(int i=0;i<n;i++){\n cin>>p1>>p2;\n v.push_back(mk(p2,p1));\n }\n cin>>m;\n for(int i=0;i<m;i++){\n cin>>p1>>p2;\n v.push_back(mk(p2,p1));\n }\n stable_sort(v.begin(),v.end(),greater<pair<int,int> >());\n for(int i=0;i<v.size();i++)swap(v[i].f,v[i].s);\n stable_sort(v.begin(),v.end(),greater<pair<int,int> >());\n cout<<dfs(0,1001,1001)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3872,
"score_of_the_acc": -0.1512,
"final_rank": 5
},
{
"submission_id": "aoj_0157_2317383",
"code_snippet": "#include<bits/stdc++.h>\n#define mk make_pair\n#define f first\n#define s second\nusing namespace std;\nint n,m,p1,p2,dp[201][1001][1001];\nmap<pair<int,pair<int,int> >,int >m1;\n\nvector<pair<int,int> >v;\n\nint dfs(int d,int h,int w){\n int res=0;\n if(m1[mk(d,mk(h,w))])return m1[mk(d,mk(h,w))];\n if(d==v.size()) return 1;\n if(v[d].f<h&&v[d].s<w)\n res=max(res,dfs(d+1,v[d].f,v[d].s))+1;\n res=max(res,dfs(d+1,h,w));\n return m1[mk(d,mk(h,w))]=res;\n}\n\nmain(){\n while(cin>>n,n){\n m1.clear();\n v.clear();\n for(int i=0;i<n;i++){\n cin>>p1>>p2;\n v.push_back(mk(p2,p1));\n }\n cin>>m;\n for(int i=0;i<m;i++){\n cin>>p1>>p2;\n v.push_back(mk(p2,p1));\n }\n stable_sort(v.begin(),v.end(),greater<pair<int,int> >());\n for(int i=0;i<v.size();i++)swap(v[i].f,v[i].s);\n stable_sort(v.begin(),v.end(),greater<pair<int,int> >());\n cout<<dfs(0,1001,1001)-1<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3800,
"score_of_the_acc": -0.1471,
"final_rank": 4
},
{
"submission_id": "aoj_0157_2144907",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\ntypedef long long int ll;\n\n#define BIG_NUM 2000000000\n\nusing namespace std;\n\nstruct Info{\n\tInfo(){\n\t\th = 0;\n\t\tr = 0;\n\t\tused = false;\n\t\tmay_in_num = in_num = 0;\n\t}\n\tint h,r,may_in_num,in_num;\n\tbool used;\n};\n\nvoid func(int n){\n\n\tInfo info[401];\n\tint m;\n\n\tfor(int i = 0; i < n; i++){\n\t\tscanf(\"%d %d\",&info[i].h,&info[i].r);\n\t}\n\n\tscanf(\"%d\",&m);\n\n\tfor(int i = 0; i < m; i++){\n\t\tscanf(\"%d %d\",&info[n+i].h,&info[n+i].r);\n\t}\n\n\tint count,maximum = 0,limit = n+m;\n\n\twhile(true){\n\t\tcount = 0;\n\n\t\tfor(int i = 0; i < limit; i++){\n\t\t\tif(info[i].used)continue;\n\t\t\tfor(int k = 0; k < limit; k++){\n\t\t\t\tif(info[k].used == false && info[k].h < info[i].h && info[k].r < info[i].r){\n\t\t\t\t\tinfo[i].may_in_num++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < limit; i++){\n\t\t\tif(info[i].may_in_num == 0){\n\t\t\t\tinfo[i].used = true;\n\n\t\t\t\tfor(int k = 0; k < limit; k++){\n\t\t\t\t\tif(info[k].h > info[i].h && info[k].r > info[i].r){\n\t\t\t\t\t\tif(info[k].in_num < info[i].in_num+1){\n\t\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t\tinfo[k].in_num = info[i].in_num+1;\n\t\t\t\t\t\t\tmaximum = max(maximum,info[k].in_num);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < limit; i++){\n\t\t\tif(info[i].used == false){\n\t\t\t\tinfo[i].may_in_num = 0;\n\t\t\t}\n\t\t}\n\n\t\tif(count == 0)break;\n\t}\n\n\tprintf(\"%d\\n\",maximum+1);\n\n}\n\nint main(){\n\n\tint n;\n\n\twhile(true){\n\t\tscanf(\"%d\",&n);\n\t\tif(n == 0)break;\n\n\t\tfunc(n);\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2624,
"score_of_the_acc": -0.0801,
"final_rank": 3
},
{
"submission_id": "aoj_0157_2142796",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cstdio>\n#include<algorithm>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<cmath>\n#include<utility>\n#include<set>\n#include<complex>\n#include<map>\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 CC puts(\"-------ok--------\");\n#define all(in) in.begin(), in.end()\nusing namespace std;\ntypedef pair<int, int> pii;\n#define MAX 99999999\nint main(){\n int n;\n while(cin>>n,n){\n vvi d(1040,vi(1040,0));\n vvi dp(1040,vi(1040,0));\n rep(i,n){\n pii temp; cin>>temp.first>>temp.second;\n d[temp.first][temp.second]++;\n }\n int m;\n cin>>m;\n rep(i,m){\n pii temp;\n cin>>temp.first>>temp.second;\n d[temp.first][temp.second]++;\n }\n loop(i,1,1001){\n loop(j,1,1001){\n dp[i][j]=max(max(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1]+d[i][j]);\n \n }\n }\n cout<<dp[999][999]<<endl;\n }\n \n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 11268,
"score_of_the_acc": -1.323,
"final_rank": 19
},
{
"submission_id": "aoj_0157_2110326",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\nbool exist[2000][2000];\nint max_doll[2000][2000];\n\nint main(){\n\t\n\tint n, m;\n\t\n\twhile(true){\n\t\t\n\t\tcin >> n;\n\t\t\n\t\tif(n == 0){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tfor(int i = 0; i <= 1000; i++){\n\t\t\tfor(int j = 0; j <= 1000; j++){\n\t\t\t\texist[i][j] = false;\n\t\t\t\tmax_doll[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint h, r;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tcin >> h >> r;\n\t\t\texist[h][r] = true;\n\t\t}\n\t\t\n\t\tcin >> m;\n\t\t\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tcin >> h >> r;\n\t\t\texist[h][r] = true;\n\t\t}\n\t\t\n\t\tfor(int i = 1; i <= 1000; i++){\n\t\t\tfor(int j = 1; j <= 1000; j++){\n\t\t\t\tif(exist[i][j]){\n\t\t\t\t\tmax_doll[i][j] = max(max(max_doll[i - 1][j], max_doll[i][j - 1]), max_doll[i - 1][j - 1] + 1);\n\t\t\t\t}else{\n\t\t\t\t\tmax_doll[i][j] = max(max_doll[i - 1][j], max_doll[i][j - 1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << max_doll[1000][1000] << endl;\n\t\t\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 12824,
"score_of_the_acc": -1.1617,
"final_rank": 16
},
{
"submission_id": "aoj_0157_1988316",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n while (true)\n {\n int n;\n cin>>n;\n if (n==0)\n break;\n vector<int> h(n), r(n);\n for (int i=0; i<n; i++)\n cin>>h[i]>>r[i];\n int m;\n cin>>m;\n h.resize(n+m);\n r.resize(n+m);\n for (int i=n; i<n+m; i++)\n cin>>h[i]>>r[i];\n\n vector<int> c(n+m, 1);\n for (int i=0; i<n+m; i++)\n for (int j=0; j<n+m; j++)\n for (int k=0; k<n+m; k++)\n if (h[k]<h[j] && r[k]<r[j])\n c[j] = max(c[j], c[k]+1);\n cout<<*max_element(c.begin(), c.end())<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1220,
"score_of_the_acc": -0.25,
"final_rank": 7
},
{
"submission_id": "aoj_0157_1953227",
"code_snippet": "# define _CRT_SECURE_NO_WARNINGS 1\n# define _USE_MATH_DEFINES\n# include <iostream>\n# include <numeric>\n# include <string>\n# include <bitset>\n# include <vector>\n# include <algorithm>\n# include <cstdlib>\n# include <cstdio>\n# include <cstring>\n# include <cstdlib>\n# include <iomanip>\n# include <queue>\n# include <sstream>\n# include <climits>\n# include <cmath>\n# include <list>\n# include <functional>\n# include <string>\n# include <ctime>\n# include <set>\n# include <forward_list>\n# include <map>\n# include <stack>\nusing namespace std;\n# define INF ((int)(1<<25))\n# define REP(i,n) for(int i=0;i<(int)n;i++)\n# define FOR(i,n) REP(i,n)\n# define TORAD 2.0*M_PI/360.0\n# define INT(x) int x;cin>>x;\n# define ALL(x) (x).begin(),(x).end()\n# define RALL(x) (x).rbegin(),(x).rend()\n# define DEBUG(x) cout<<#x<<\" :\"<<x<<endl;\n# define EPS 1e-12\ntemplate<class T> void debug(T a) { for (auto i : a)cout << i << endl; }\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef pair<int, pii> piii;\nint dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 };\n\nint n;\nvi h, r;\nint memo[2000][2000];\nint dp(int H, int R)\n{\n\tif (memo[H][R] != -1)return memo[H][R];\n\tint ans=0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif (h[i] > H&&r[i] > R)\n\t\t{\n\t\t\tans = max(ans, dp(h[i], r[i]));\n\t\t}\n\t}\n\tans++;\n\treturn memo[H][R] = ans;\n}\nint main()\n{\n\twhile (cin >> n&&n)\n\t{\n\t\tmemset(memo, -1, sizeof memo);\n\t\th.clear();\n\t\tr.clear();\n\t\tFOR(i, n)\n\t\t{\n\t\t\tINT(H); INT(R);\n\t\t\th.push_back(H);\n\t\t\tr.push_back(R);\n\t\t}\n\t\tINT(m);\n\t\tn += m;\n\t\tFOR(i, m)\n\t\t{\n\t\t\tINT(H); INT(R);\n\t\t\th.push_back(H);\n\t\t\tr.push_back(R);\n\t\t}\n\t\tcout << dp(0, 0)-1 << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 18756,
"score_of_the_acc": -1,
"final_rank": 13
},
{
"submission_id": "aoj_0157_1926007",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cstdio>\n#include<algorithm>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<cmath>\n#include<utility>\n#define ll long long int\n#define ld long double\n#define INF 1000000000\n#define EPS 0.0000000001\n#define rep(i,n) for(i=0;i<n;i++)\nusing namespace std;\ntypedef pair<int, int> P;\n\nstring str;\n\nint main()\n{\n int n,m;\n int i,j;\n int h,r;\n\n while(1){\n\n int doll[1005][1005]={};\n int dp[1005][1005]={};\n\n scanf(\"%d\",&n);\n if(n==0)break;\n rep(i,n){\n scanf(\"%d %d\",&h,&r);\n doll[h][r]=1;\n }\n\n scanf(\"%d\",&m);\n rep(i,m){\n scanf(\"%d %d\",&h,&r);\n doll[h][r]=1;\n }\n \n for(i=1;i<1001;i++){\n for(j=1;j<1001;j++){\n\tdp[i][j]=max(max(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1]+doll[i][j]);\n }\n }\n \n cout<<dp[1000][1000]<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 9112,
"score_of_the_acc": -0.95,
"final_rank": 12
},
{
"submission_id": "aoj_0157_1726024",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\n#define MAX_N 1000\nint x[MAX_N], y[MAX_N], X[MAX_N][MAX_N], dist[MAX_N];\nint A, B, N;\nint main() {\n\twhile (true) {\n\t\tcin >> A; if (A == 0) { break; } \n\t\tfor (int i = 0; i < A; i++) { cin >> x[i] >> y[i]; }\n\t\tcin >> B; \n\t\tfor (int i = A; i < A + B; i++) { cin >> x[i] >> y[i]; }N = A + B;\n\t\tfor (int i = 0; i < N; i++) { \n\t\t\tfor (int j = 0; j < N; j++) { \n\t\t\t\tif (x[i] < x[j] && y[i] < y[j]) { X[i][j] = 1; }\n\t\t\t\telse { X[i][j] = 0; }\n\t\t\t} \n\t\t}\n\t\tqueue<int>Q; int res = 0; for (int i = 0; i < N; i++) { dist[i] = 1; Q.push(i); }\n\t\twhile (!Q.empty()) {\n\t\t\tint a1 = Q.front(); Q.pop();\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif (X[a1][i] == 1 && dist[a1] + 1 > dist[i]) { dist[i] = dist[a1] + 1; Q.push(i); }\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; i++) { if (res < dist[i]) { res = dist[i]; } }cout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1940,
"score_of_the_acc": -0.0411,
"final_rank": 1
},
{
"submission_id": "aoj_0157_1706397",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF 999999999\n\nint main(){\n int n,m;\n bool data[1000][1000]={};\n \n while(cin>>n&&n){\n rep(i,1000)rep(j,1000)data[i][j]=false;\n rep(i,n){\n int a,b;\n cin>>a>>b;\n data[a][b]=true;\n }\n cin>>m;\n rep(i,m){\n int a,b;\n cin>>a>>b;\n data[a][b]=true;\n }\n \n \n int dp[1002][1002];\n rep(i,1002)rep(j,1002)dp[i][j]=0;\n \n \n int maxi = 0;\n for(int i=999;i>=0;i--){\n for(int j=999;j>=0;j--){\n dp[i][j] = max({dp[i][j+1],dp[i+1][j],dp[i+1][j+1]+data[i][j],dp[i][j]});\n // cout<<dp[i][j]<<endl;\n maxi = max(maxi,dp[i][j]);\n }\n }\n cout<<maxi<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 7980,
"score_of_the_acc": -1.1355,
"final_rank": 15
},
{
"submission_id": "aoj_0157_1523714",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <cmath>\n#include <ctype.h>\n#include <string> \n#include <sstream>\n#include <iostream>\n#include <algorithm>\n#include <cstdlib>\n#include <map>\n#include <queue>\n#include <utility>\n#include <vector>\n#include <set>\n#include <iomanip>\n \nusing namespace std;\n\n#define pi 3.141592653589793\n\nint main()\n{\n\tint n, m;\n\twhile(1){\n\t\tcin >> n;\n\t\tif(n == 0) break;\n\t\tint h, r;\n\t\tint mato[1001][1001] = {};\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tcin >> h >> r;\n\t\t\tmato[h][r] = 1;\n\t\t}\n\t\tcin >> m;\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tcin >> h >> r;\n\t\t\tmato[h][r] = 1;\n\t\t}\n\t\tint result[1001][1001] = {};\n\t\tint ans = 0;\n\t\tfor(int i = 1; i < 1001; i++){\n\t\t\tfor(int j = 1; j < 1001; j++){\n\t\t\t\tresult[i][j] = max(result[i - 1][j - 1] + mato[i][j], max(result[i - 1][j], result[i][j - 1]));\n\t\t\t\tans = max(ans, result[i][j]);\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": 8992,
"score_of_the_acc": -0.9432,
"final_rank": 11
},
{
"submission_id": "aoj_0157_1362310",
"code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n\tint n;\n\twhile ( cin >> n, n ) {\n\t\tvector<int> h(n), r(n);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tcin >> h[i] >> r[i];\n\t\t}\n\t\tint M; cin >> M;\n\t\th.resize(n+M);\n\t\tr.resize(n+M);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tcin >> h[n+i] >> r[n+i];\n\t\t}\n\t\tn += M;\n\n\t\tint m[200][200] = {0};\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = 0; j < n; ++j) {\n\t\t\t\tif (h[i] < h[j] && r[i] < r[j]) {\n\t\t\t\t\tm[i][j] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int k = 0; k < n; ++k) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {\n\t\t\tif (m[i][k] && m[k][j]) {\n\t\t\t\tm[i][j] = min(m[i][j], m[i][k] + m[k][j]);\n\t\t\t}\n\t\t\tans = min(ans, m[i][j]);\n\t\t}\n\t\tcout << (-ans + 1) << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1376,
"score_of_the_acc": -0.2589,
"final_rank": 9
},
{
"submission_id": "aoj_0157_1087352",
"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 main() {\n while(1){\n int n,m;\n vector<vector<int>> a(1000);\n cin >> n;\n if(!n) break;\n for (int i = 0; i < n; ++i) {\n int h,r;\n cin >> h >> r;\n a[h].emplace_back(r);\n }\n cin >> m;\n for (int i = 0; i < m; ++i) {\n int h,r;\n cin >> h >> r;\n a[h].emplace_back(r);\n }\n vector<vector<int>> dp(1000,vector<int>(1000));\n for (int i = 1; i < 1000; ++i) {\n for (int j = 0; j < 1000; ++j) {\n dp[i][j] = dp[i-1][j];\n for (int r : a[i]) {\n if (r > j) continue;\n dp[i][j] = max(dp[i][j],dp[i-1][r-1]+1);\n }\n }\n }\n cout << dp[999][999] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5052,
"score_of_the_acc": -0.2185,
"final_rank": 6
},
{
"submission_id": "aoj_0157_997517",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<cstring>\n#include<map>\nusing namespace std;\nvector<pair<int,int> >data;\nmap<pair<int,int>,int> dp[201];\n\nint check(int i,pair<int,int> last)\n{\n // cout<<i<<\" \"<<endl;\n if(i<0)\n return 0;\n\n if(dp[i].count(last)!=0)\n return dp[i][last];\n\n\n int ans=0;\n if(last.first>data[i].first &&\n last.second>data[i].second )\n ans=check(i-1,data[i])+1;\n\n ans=max(ans,check(i-1,last));\n dp[i][last]=ans;\n return ans;\n}\n\nint main()\n{\n int n;\n for(;cin>>n,n;)\n {\n data.clear();\n for(int i=0;i<n;i++)\n\t{\n\t int h,r;\n\t cin>>h>>r;\n\t data.push_back(make_pair(h,r));\n\t}\n int m;\n cin>>m;\n for(int i=0;i<m;i++)\n\t{\n\t int h,r;\n\t cin>>h>>r;\n\t data.push_back(make_pair(h,r));\n\t}\n sort(data.begin(),data.end());\n // memset(dp,-1,sizeof(dp));\n //int ans=;\n for(int i=0;i<201;i++)\n\tdp[i].clear();\n\n cout<<check(data.size()-1,make_pair(9999,9999))<<endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2144,
"score_of_the_acc": -0.0527,
"final_rank": 2
},
{
"submission_id": "aoj_0157_970314",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <functional>\nusing namespace std;\nvoid print(vector<vector<int> > dp){\n cout << \"---------------\" << endl;\n for(int i = 0;i < dp.size();i++){\n\tfor(int j = 0;j < dp.size();j++){\n\t cout << dp[i][j] << \" \";\n\t}\n\tcout << endl;\n }\n}\nint cal(vector<pair<int,int> > vec){\n vector<vector<int> > dp(vec.size(),vector<int>(vec.size(),0)); \n for(int i = 0;i < vec.size()-1;i++){\n\tfor(int j = 0;j < vec.size();j++){\n\t for(int k = j+1;k < vec.size();k++){\n\t\tif(vec[j].first > vec[k].first && vec[j].second > vec[k].second){\n\t\t dp[i+1][k] = max(dp[i][j]+1,dp[i+1][k]);\n\n\t\t}\n\t }\n\t}\n }\n int ans = 0;\n for(int i = 0;i < vec.size();i++){\n\tans = max(ans,dp[vec.size()-1][i]);\n }\n return ans;\n}\nvoid print2(vector<int> vec){\n for(int i = 0;i < vec.size();i++)\n\tcout << vec[i] << \" \";\n cout << endl;\n\n}\nint cal2(vector<pair<int,int> > vec){\n vector<int> dp(vec.size(),0);\n for(int i = 0;i < vec.size();i++){\n\tfor(int j =i+1;j < vec.size();j++){\n\t if(vec[i].first > vec[j].first && vec[i].second > vec[j].second){\n\t\tdp[j] = max(dp[i]+1,dp[j]);\n\t }\n\t}\n//\tprint2(dp);\n }\n int ans = 0;\n for(int i = 0;i < dp.size();i++){\n\tans = max(ans,dp[i]);\n }\n return ans;\n}\nint main(){\n int n;\n\n while(cin >> n && n!=0){\n\tvector<pair<int,int> > vec;\n\tvec.emplace_back(10000,10000);\n\tfor(int i = 0;i < n;i++){\n\t int h,r;\n\t cin >> h >> r;\n\t vec.emplace_back(h,r); \n\t}\n\tcin >> n;\n\tfor(int i = 0;i < n;i++){\n\t int h,r;\n\t cin >> h >> r;\n\t vec.emplace_back(h,r);\n\t}\n\tsort(vec.begin(),vec.end(),greater<pair<int,int> >());\n\tcout << cal(vec) << endl;\n//\tcout << cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1348,
"score_of_the_acc": -0.2573,
"final_rank": 8
}
] |
aoj_0160_cpp
|
宅配料金
ある宅配業者の宅配料金は大きさと重量で下表のように料金が設定されています。
A サイズ
B サイズ
C サイズ
D サイズ
E サイズ
F サイズ
大きさ
60cm以内
80cm以内
100cm以内
120cm以内
140cm以内
160cm以内
重さ
2kg以内
5kg以内
10kg以内
15kg以内
20kg以内
25kg以内
料金
600円
800円
1000円
1200円
1400円
1600円
大きさは三辺（縦、横、高さ）の和です。例えば大きさが120cmで、重さが15kg以内の荷物はＤサイズ（1,200円）となります。大きさが120cm以内でも、重さが15kgを超え、20kg以内ならばＥサイズとなります。
1日に持ち込まれた荷物の情報を入力とし、料金の総計を出力するプログラムを作成してください。なお、Ｆサイズを超えた荷物は対象外とし料金の総計には含みません。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
x
1
y
1
h
1
w
1
x
2
y
2
h
2
w
2
:
x
n
y
n
h
n
w
n
１行目に荷物の個数
n
(1 ≤
n
≤ 10000)、続く
n
行に
i
番目の荷物の縦の長さ
x
i
、横の長さ
y
i
、高さ
h
i
、重さ
w
i
(1 ≤
x
i
,
y
i
,
h
i
,
w
i
≤ 200) が空白区切りで１行に与えられます。
データセットの数は 20 を超えません。
Output
データセットごとに荷物の料金の総計を１行に出力します。
Sample Input
2
50 25 5 5
80 60 10 30
3
10 15 25 24
5 8 12 5
30 30 30 18
0
Output for the Sample Input
800
3800
|
[
{
"submission_id": "aoj_0160_6928654",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, u, v;\ndouble x, y, h, w;\n\nint main() {\n\tcin >> n;\n\n\twhile (n) {\n\t\tu = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> x >> y >> h >> w;\n\n\t\t\tint t = x + y + h;\n\t\t\tv = 0;\n\n\t\t\tif (t <= 160 && w <= 25) {\n\t\t\t\tif (t <= 60)\n\t\t\t\t\tv = 0;\n\t\t\t\telse if (t <= 80)\n\t\t\t\t\tv = 1;\n\t\t\t\telse if (t <= 100)\n\t\t\t\t\tv = 2;\n\t\t\t\telse if (t <= 120)\n\t\t\t\t\tv = 3;\n\t\t\t\telse if (t <= 140)\n\t\t\t\t\tv = 4;\n\t\t\t\telse\n\t\t\t\t\tv = 5;\n\n\t\t\t\tif (w <= 2) {\n\t\t\t\t}\t\t\t\t\t\n\t\t\t\telse if (w <= 5) {\n\t\t\t\t\tif (v < 1)\n\t\t\t\t\t\tv = 1;\n\t\t\t\t}\n\t\t\t\telse if (w <= 10) {\n\t\t\t\t\tif (v < 2)\n\t\t\t\t\t\tv = 2;\n\t\t\t\t}\n\t\t\t\telse if (w <= 15) {\n\t\t\t\t\tif (v < 3)\n\t\t\t\t\t\tv = 3;\n\t\t\t\t}\n\t\t\t\telse if (w <= 20) {\n\t\t\t\t\tif (v < 4)\n\t\t\t\t\t\tv = 4;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (v < 5)\n\t\t\t\t\t\tv = 5;\n\t\t\t\t}\n\n\t\t\t\tu += 600 + 200 * v;\n\t\t\t}\n\t\t}\n\n\t\tcout << u << endl;\n\t\tcin >> n;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3168,
"score_of_the_acc": -1,
"final_rank": 20
},
{
"submission_id": "aoj_0160_1948954",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\n//#define int long long\nusing namespace std;\n\nsigned main()\n{\n\tint n;\n\tint x, y, h, w;\n\n\twhile (true)\n\t{\n\t\tcin >> n;\n\t\tif (n == 0) break;\n\t\tint ans = 0;\n\t\trep(i,n)\n\t\t{\n\t\t\tcin >> x >> y >> h >> w;\n\t\t\tint len = x + y + h;\n\n\t\t\tif (len <= 60 && w <= 2)\n\t\t\t{\n\t\t\t\tans += 600;\n\t\t\t}\n\t\t\telse if (len <= 80 && w <= 5)\n\t\t\t{\n\t\t\t\tans += 800;\n\t\t\t}\n\t\t\telse if (len <= 100 && w <= 10)\n\t\t\t{\n\t\t\t\tans += 1000;\n\t\t\t}\n\t\t\telse if (len <= 120 && w <= 15)\n\t\t\t{\n\t\t\t\tans += 1200;\n\t\t\t}\n\t\t\telse if (len <= 140 && w <= 20)\n\t\t\t{\n\t\t\t\tans += 1400;\n\t\t\t}\n\t\t\telse if (len <= 160 && w <= 25)\n\t\t\t{\n\t\t\t\tans += 1600;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\", ans);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1144,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0160_1853723",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n;\n while(cin>>n,n){\n int ans=0;\n for(int i=0,x,y,h,w;i<n;i++){\n cin>>x>>y>>h>>w;\n x+=y+h;\n if(x<=60&&w<=2)ans+=600;\n else if(x<=80&&w<=5)ans+=800;\n else if(x<=100&&w<=10)ans+=1000;\n else if(x<=120&&w<=15)ans+=1200;\n else if(x<=140&&w<=20)ans+=1400;\n else if(x<=160&&w<=25) ans+=1600;\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0059,
"final_rank": 2
},
{
"submission_id": "aoj_0160_1832844",
"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\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 1000000007\n#define EPS 1e-10\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;\nint x, y, h, w;\n\nint main(){\n\twhile (cin >> n&&n){\n\t\tint ans = 0;\n\t\tREP(i, n){\n\t\t\tcin >> x >> y >> h >> w;\n\t\t\tint size = x + y + h;\n\t\t\tif (size <= 60 && w <= 2) ans += 600;\n\t\t\telse if (size <= 80 && w <= 5) ans += 800;\n\t\t\telse if (size <= 100 && w <= 10) ans += 1000;\n\t\t\telse if (size <= 120 && w <= 15) ans += 1200;\n\t\t\telse if (size <= 140 && w <= 20) ans += 1400;\n\t\t\telse if (size <= 160 && w <= 25)ans += 1600;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1796935",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n\tint n;\n\twhile(true){\n\tcin>>n;\n\tif(n==0)\n\t\tbreak;\n\tint x,y,h,w;\n\tint ans=0;\n\tfor(int u=0;u<n;u++){\n\t\tcin>>x>>y>>h>>w;\n\t\tint count=0;\n\t\tif(x+y+h<=160&&w<=25)\n\t\t\tcount=1600;\n\t\tif(x+y+h<=140&&w<=20)\n\t\t\tcount=1400;\n\t\tif(x+y+h<=120&&w<=15)\n\t\t\tcount=1200;\n\t\tif(x+y+h<=100&&w<=10)\n\t\t\tcount=1000;\n\t\tif(x+y+h<=80&&w<=5)\n\t\t\tcount=800;\n\t\tif(x+y+h<=60&&w<=2)\n\t\t\tcount=600;\n\t\tans+=count;\n\t}\n\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0059,
"final_rank": 2
},
{
"submission_id": "aoj_0160_1769332",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int n;\n while( cin >> n, n ) {\n int a, b, c, d;\n int sum = 0;\n\n while( n-- ) {\n int size = 0;\n cin >> a >> b >> c >> d;\n size += a + b + c;\n \n if( size <= 60 && d <= 2 ) {\n\tsum += 600;\n } \n else if( size <= 80 && d <= 5 ) {\n\tsum += 800;\n }\n else if( size <= 100 && d <= 10 ) {\n\tsum += 1000;\n }\n else if( size <= 120 && d <= 15 ) {\n\tsum += 1200;\n }\n else if( size <= 140 && d <= 20 ) {\n\tsum += 1400;\n }\n else if( size <= 160 && d <= 25 ) {\n\tsum += 1600;\n }\n }\n\n cout << sum << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1763970",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n int S[]={60,80,100,120,140,160};\n int W[]={2,5,10,15,20,25};\n int M[]={600,800,1000,1200,1400,1600};\n while(cin >> n , n){\n int sum = 0;\n for(int i=0;i<n;i++){\n int x,y,h,w;\n cin >> x >> y >> h >> w;\n int size = x + y + h;\n if(size > 160 || w > 25) continue;\n for(int i=0;i<6;i++){\n\tif(size <= S[i] && w <= W[i]){\n\t sum += M[i];\n\t break;\n\t}\n }\n }\n cout << sum << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1740587",
"code_snippet": "// 0160\n#include <iostream>\nusing namespace std;\n\nint delivery_fee(int x, int y, int h, int w){\n\tif((x+y+h <= 60) && (w <= 2))\n\t\treturn 600;\n\telse if((x+y+h <= 80) && (w <= 5))\n\t\treturn 800;\n\telse if((x+y+h <= 100) && (w <= 10))\n\t\treturn 1000;\n\telse if((x+y+h <= 120) && (w <= 15))\n\t\treturn 1200;\n\telse if((x+y+h <= 140) && (w <= 20))\n\t\treturn 1400;\n\telse if((x+y+h <= 160) && (w <= 25))\n\t\treturn 1600;\n\telse\n\t\treturn 0;\n}\n\nint main(){\n\twhile(1){\n\t\tint n, x, y, h, w, price = 0;\n\t\tcin>>n;\n\n\t\tif(n == 0)\n\t\t\tbreak;\n\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>x>>y>>h>>w;\n\t\t\tprice += delivery_fee(x, y, h, w);\n\t\t}\n\n\t\tcout<<price<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1651564",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n,x,y,h,w;\n\tlong long int cnt;\n\twhile(cin >> n,n){\n\t\tcnt = 0ll;\n\t\tfor(int i = 0;i < n;i++){\n\t\tcin >> x >> y >> h >> w;\n\t\tif(x + y + h <= 60 && w <= 2) cnt += 600ll;\n\t\telse if(x + y + h <= 80 && w <= 5) cnt += 800ll;\n\t\telse if(x + y + h <= 100 && w <= 10) cnt += 1000ll;\n\t\telse if(x + y + h <= 120 && w <= 15) cnt += 1200ll;\n\t\telse if(x + y + h <= 140 && w <= 20) cnt += 1400ll;\n\t\telse if(x + y + h <= 160 && w <= 25) cnt += 1600ll;\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0059,
"final_rank": 2
},
{
"submission_id": "aoj_0160_1630299",
"code_snippet": "#include<iostream>\nusing namespace std;\nint x, y, h, w, n, sum, z;\nint a[7] = { 60,80,100,120,140,160,1000000000 };\nint b[7] = { 2,5,10,15,20,25,1000000000 };\nint c[7] = { 600,800,1000,1200,1400,1600,0 };\nint main() {\n\twhile (true) {\n\t\tcin >> n;\n\t\tif (n == 0) { break; }\n\t\tsum = 0;\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tcin >> x >> y >> h >> w;\n\t\t\tz = x + y + h;\n\t\t\tfor (int j = 0; j < 7; j++) {\n\t\t\t\tif (z <= a[j] && w <= b[j]) { sum += c[j]; break; }\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1556037",
"code_snippet": "#include<iostream>\n#include<string.h>\n#include<vector>\n#include<list>\n#include<stdio.h>\n#include<math.h>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<algorithm>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) range(i,0,b)\n#define debug(x) cout << \"debug \" << x << endl;\nusing namespace std;\n\nint main(){\n int n;\n while(cin >> n, n){\n int ans = 0;\n rep(i,n){\n int x, y, h, w;\n int size = 100, hevy = 100;\n cin >> x >> y >> h >> w;\n rep(i,6){\n int cm = 60 + 20 * i;\n if(x + y + h <= cm){\n size = i;\n break;\n }\n }\n rep(i,6){\n if(w <= 2){\n hevy = 0;\n break;\n }else if(w <= i * 5){\n hevy = i;\n break;\n }\n }\n int money = max(size, hevy) ;\n rep(i,6){\n if(money == 100) break;\n if(money == i){\n ans+= 600 + 200 * i;\n break;\n }\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1478236",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <map>\n#include <set>\n#include <queue>\n \nusing namespace std;\n \n#define pb(n)\tpush_back(n)\n#define mp(n,m) make_pair(n,m)\n#define fi \tfirst\n#define se \tsecond\n#define all(r) (r).begin(),(r).end()\n\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define repc(i,a,b) for(int i=(a); i<(b); i++)\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n \nconst int IMAX=((1<<30)-1)*2+1;\nconst double EPS=1e-10;\n//int mod=1000000007;\n\n\nint p[3][7]={{160,140,120,100,80,60,0},\n\t\t\t{25,20,15,10,5,2,0},\n\t\t\t{0,1600,1400,1200,1000,800,600}\n\t\t};\n\nint main(){\n\tint n,x,y,h,w;\n\tint b;\n\tint ans;\n\twhile(cin>>n &&n>0){\n\t\tans=0;\n\t\trep(i,n){\n\t\t\tcin>>x>>y>>h>>w;\n\t\t\tb=x+y+h;\n\t\t\trep(j,7){\n\t\t\t\tif(b>p[0][j]||w>p[1][j]){\n\t\t\t\t\tans+=p[2][j];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1395969",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n\n int n;\n int x,y,h,w;\n int r1[6] = {60,80,100,120,140,160};\n int r2[6] = {2,5,10,15,20,25};\n int r3[6] = {600,800,1000,1200,1400,1600};\n \n while(1){ \n cin >> n;\n if(n == 0) break;\n int sum = 0;\n \n for(int i=0;i<n;i++) { \n\n cin >> x >> y >> h >> w;\n int size = x + y + h;\n \n for(int j=0;j<6;j++) {\n\tif(size <= r1[j] && w <= r2[j]){\n\t sum += r3[j];\n\t break;\n\t}\n }\n \n }\n\n cout << sum << endl;\n\n }\n\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1395011",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n\n\nint f(int x,int y,int z){\n\tint w=x+y+z;\n\tif(w<=60)return 600;\n\tif(w<=80)return 800;\n\tif(w<=100)return 1000;\n\tif(w<=120)return 1200;\n\tif(w<=140)return 1400;\n\tif(w<=160)return 1600;\n\treturn 0;\n\n}\n\nint g(int w){\n\tif(w<=2)return 600;\n\tif(w<=5)return 800;\n\tif(w<=10)return 1000;\n\tif(w<=15)return 1200;\n\tif(w<=20)return 1400;\n\tif(w<=25)return 1600;\n\treturn 0;\n}\n\nint main(){\n\tint n;\n\twhile(cin>>n){\n\t\tif(n==0)break;\n\t\tint sum=0;\n\t\trep(i,n){\n\t\t\tint x,y,z,w;\n\t\t\tcin>>x>>y>>z>>w;\n\t\t\tint F=f(x,y,z),G=g(w);\n\t\t\tif(F==0 || G==0)sum+=0;\n\t\t\telse sum+=max(F,G);\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1394652",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n#define loop(i,a,b) for(int i=(a);i<ull(b);++i)\n#define rep(i,n) loop(i,0,n)\n#define all(a) (a).begin(), (a).end()\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst double inf = (int)1e8;\n\nint main(){\n\tint n;\n\twhile(cin >> n, n){\n\t\tint ret = 0;\n\t\tfor(int i=0; i < n; i++){\n\t\t\tint a, b, c, w;\n\t\t\tcin >> a >> b >> c >> w;\n\t\t\tint h = a + b + c;\n\t\t\tif(h <= 60 && w <= 2) ret += 600;\n\t\t\telse if(h <= 80 && w <= 5) ret += 800;\n\t\t\telse if(h <= 100 && w <= 10) ret += 1000;\n\t\t\telse if(h <= 120 && w <= 15) ret += 1200;\n\t\t\telse if(h <= 140 && w <= 20) ret += 1400;\n\t\t\telse if(h <= 160 && w <= 25) ret += 1600;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1379527",
"code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<vector>\n#include<cmath>\n#include<cstring>\n#include<cstdio>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define rp(a) while(a--)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\nint O[6]={60,80,100,120,140,160};\nint W[6]={2,5,10,15,20,25};\nint R[6]={600,800,1000,1200,1400,1600};\nint main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tint sum=0;\n\t\trep(i,n){\n\t\t\tint a,b,c,w;\n\t\t\tcin>>a>>b>>c>>w;\n\t\t\tint o=a+b+c;\n\t\t\trep(i,6)if(o<=O[i]&&w<=W[i]){sum+=R[i];break;}\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1376976",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n while(true) {\n int n;\n cin >> n;\n if(n == 0) break;\n int result = 0;\n for(int i = 0; i < n; ++i) {\n int x, y, h, weight;\n cin >> x >> y >> h >> weight;\n int size;\n size = x + y + h;\n vector<int> resultCandidits(2);\n resultCandidits[0] = (\n (size <= 60) ? 0 :\n (size <= 80) ? 1 :\n (size <= 100) ? 2 :\n (size <= 120) ? 3 :\n (size <= 140) ? 4 :\n (size <= 160) ? 5 :\n 6\n );\n resultCandidits[1] = (\n (weight <= 2) ? 0 :\n (weight <= 5) ? 1 :\n (weight <= 10) ? 2 :\n (weight <= 15) ? 3 :\n (weight <= 20) ? 4 :\n (weight <= 25) ? 5 :\n 6\n );\n int answers[] = {600, 800, 1000, 1200, 1400, 1600, 0};\n result += answers[max(resultCandidits[0], resultCandidits[1])];\n }\n cout << result << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0217,
"final_rank": 18
},
{
"submission_id": "aoj_0160_1323413",
"code_snippet": "#include <iostream>\nusing namespace std;\n#define rep2(x,from,to) for(int x=(from);x<(to);++(x))\n#define rep(x,to) rep2(x,0,to)\n\nint main(){\n int n;\n\tint size[] = {0, 60, 80, 100, 120, 140, 160};\n\tint weight[] = {0, 2, 5, 10, 15, 20, 25};\n\tint cost[] = {600, 800, 1000, 1200,\t1400, 1600, 0};\n\twhile(cin >> n, n) {\n\t\tint ret = 0;\n\t\trep(i,n) {\n\t\t\tint x, w, a = 0;\n\t\t\trep(j,3) {\n\t\t\t\tcin >> x;\n\t\t\t\ta += x;\n\t\t\t}\n\t\t\tcin >> w;\n\t\t\tfor(int j = 6; j >= 0; --j) { \n\t\t\t\tif(size[j] < a) {\n\t\t\t\t\tret += cost[j];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(weight[j] < w) {\n\t\t\t\t\tret += cost[j];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ret << endl;\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
},
{
"submission_id": "aoj_0160_1319987",
"code_snippet": "#include<iostream>\n#include<vector>\n#define loop(i,a,b) for(long long i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\nusing namespace std;\n\nint main(){\n\tvector<int> weight,length;\n\tlong long n;\n\twhile(1){\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\trep(i,n){\n\t\t\tint x,y,h,w;\n\t\t\tcin>>x>>y>>h>>w;\n\t\t\tlength.push_back(x+y+h);\n\t\t\tweight.push_back(w);\n\t\t}\n\t\tlong long price=0;\n\t\trep(i,weight.size()){\n\t\t\tint nl=length[i],nw=weight[i];\n\t\t\tif(nl>160 || nw>25){}\n\t\t\telse if(nl>140 || nw>20) price+=1600;\n\t\t\telse if(nl>120 || nw>15) price+=1400;\n\t\t\telse if(nl>100 || nw>10) price+=1200;\n\t\t\telse if(nl>80 || nw>5) price+=1000;\n\t\t\telse if(nl>60 || nw>2) price+=800;\n\t\t\telse price+=600;\n\t\t}\n\t\tcout<<price<<endl;\n\t\twhile(!weight.empty()){\n\t\t\tweight.pop_back();\n\t\t\tlength.pop_back();\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1348,
"score_of_the_acc": -0.1008,
"final_rank": 19
},
{
"submission_id": "aoj_0160_1268846",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(void){\n int n;\n while(cin >> n && n != 0){\n int x, y, h, w, fee = 0;\n for(int i = 0; i < n; i++){\n cin >> x >> y >> h >> w;\n int size = x + y + h;\n if(size <= 60 && w <= 2) fee += 600;\n else if(size <= 80 && w <= 5) fee += 800;\n else if(size <= 100 && w <= 10) fee += 1000;\n else if(size <= 120 && w <= 15) fee += 1200;\n else if(size <= 140 && w <= 20) fee += 1400;\n else if(size <= 160 && w <= 25) fee += 1600;\n }\n cout << fee << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0079,
"final_rank": 5
}
] |
aoj_0161_cpp
|
体育祭Sport Meet
秋の体育祭が行われます。種目は徒競走、ボール運び、障害物競走、リレーの4種目です。参加チームは
n
チームで、この4種目の合計タイムが最も小さいチームが「優勝」、次に小さいチームが「準優勝」、そして、最下位より2番目のチームを「ブービー賞」として表彰したいと思います。
各チームの成績を入力として、「優勝」、「準優勝」、「ブービー賞」のチームを出力するプログラムを作成してください。
ただし、チームにはそれぞれ 1 から
n
のチーム番号が割り当てられています。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
record
1
record
2
:
record
n
１行目に対象となるチームの数
n
(4 ≤
n
≤ 100000)、続く
n
行に
i
番目のチームの情報が与えられます。各チームの情報は以下の形式で与えられます。
id
m1
s1
m2
s2
m3
s3
m4
s4
id
(1 ≤
id
≤
n
)はチーム番号、
m1
,
s1
はそれぞれ徒競走のタイムの分と秒、
m2
,
s2
はそれぞれボール運びのタイムの分と秒、
m3
,
s3
はそれぞれ障害物競走のタイムの分と秒、
m4
,
s4
はそれぞれリレーのタイムの分と秒を表します。分と秒はともに0 以上 59 以下の整数です。また、合計タイムが複数のチームで同じになるような入力はないものとします。
Output
入力データセットごとに以下の形式でチーム番号を出力します。
1 行目 優勝のチーム番号
2 行目 準優勝のチーム番号
3 行目 ブービー賞のチーム番号
Sample Input
8
34001 3 20 3 8 6 27 2 25
20941 3 5 2 41 7 19 2 42
90585 4 8 3 12 6 46 2 34
92201 3 28 2 47 6 37 2 58
10001 3 50 2 42 7 12 2 54
63812 4 11 3 11 6 53 2 22
54092 3 33 2 54 6 18 2 19
25012 3 44 2 58 6 45 2 46
4
1 3 23 1 23 1 34 4 44
2 5 12 2 12 3 41 2 29
3 5 24 1 24 2 0 3 35
4 4 49 2 22 4 41 4 23
0
Output for the Sample Input
54092
34001
10001
1
3
2
|
[
{
"submission_id": "aoj_0161_9164398",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main()\n{\n int m,s,n,id[100005],timeteam[100005],ranking[100005],temp;\n \n while(true)\n {\n cin >> n;\n if(n==0){break;}\n for(int i = 1;i <= n;i++)\n {\n cin >> id[i];\n timeteam[i]=0;\n for(int j = 1;j <= 4;j++)\n {\n cin >> m >> s;\n timeteam[i]+=m*60;\n timeteam[i]+=s;\n }\n }\n temp=1;\n for(int j = 1;j <= 100000;j++)\n {\n for(int i = 1;i <= n;i++)\n {\n if(timeteam[i]==j)\n {\n if(temp==1||temp==2||temp==(n-1)){cout << id[i] << endl;}\n temp++;\n }\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 3140,
"score_of_the_acc": -1.1623,
"final_rank": 20
},
{
"submission_id": "aoj_0161_7401708",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int, int> PI;\nint main(){\n int n, m1, s1, m2, s2, m3, s3, m4, s4;\n PI id[100010];\n while(cin >> n, n!=0){\n for(int i=0;i<n;i++){\n cin >> id[i].second >> m1 >> s1 >> m2 >> s2 >> m3 >> s3 >> m4 >> s4;\n id[i].first = m1*60+s1 + m2*60+s2 + m3*60+s3 + m4*60+s4;\n }\n sort(id, id+n);\n cout << id[0].second << endl << id[1].second << endl << id[n-2].second << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3780,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_0161_6931157",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, id, m, s, u;\n\nint main() {\n\tcin >> n;\n\n\twhile (n) {\n\t\tvector<pair<int, int> > p(n);\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tu = 0;\n\t\t\tcin >> id;\n\n\t\t\tfor (int j = 0; j < 4; j++) {\n\t\t\t\tcin >> m >> s;\n\n\t\t\t\tu += m * 100;\n\n\t\t\t\tif (u % 100 + s >= 60) {\n\t\t\t\t\tu += s + 40;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tu += s;\n\t\t\t}\n\n\t\t\tp[i] = { u, id };\n\t\t}\n\n\t\tsort(p.begin(), p.end());\n\n\t\tcout << p[0].second << endl << p[1].second << endl\n\t\t\t<< p[n - 2].second << endl;\n\n\t\tcin >> n;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3116,
"score_of_the_acc": -0.1309,
"final_rank": 5
},
{
"submission_id": "aoj_0161_5842488",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<set>\n#include<bitset>\n#include<vector>\n#include<string>\n#include <iomanip>\n#include <deque>\n#include<list>\n#include<cmath>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\nusing ll=long long;\nusing P=pair<int,int>;\nusing P_S=pair<int,string>;\nusing P_D=pair<double,int>;\nusing T=tuple<int,int,char,ll,string>;\n\nint main(){\n while(1){\n int n;\n cin>>n;\n if(n==0) break;\n vector<P> time(n);\n rep(i,n){\n int id,m1,s1,m2,s2,m3,s3,m4,s4;\n cin>>id>>m1>>s1>>m2>>s2>>m3>>s3>>m4>>s4;\n int ans=m1*60+s1+m2*60+s2+m3*60+s3+m4*60+s4;\n time[i].first=ans;\n time[i].second=id;\n }\n sort(time.begin(),time.end());\n cout<<time[0].second<<endl;\n cout<<time[1].second<<endl;\n cout<<time[n-2].second<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3052,
"score_of_the_acc": -0.0471,
"final_rank": 3
},
{
"submission_id": "aoj_0161_5151757",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<vector<int>> a(n);\n for(int i=0; i<n; i++){\n int id;\n cin >> id;\n int time = 0;\n for(int j=0; j<4; j++){\n int m,s;\n cin >> m >> s;\n time += 60*m +s;\n }\n a[i] = {time, id};\n }\n sort(a.begin(), a.end());\n cout << a[0][1] << endl;\n cout << a[1][1] << endl;\n cout << a[n-2][1] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3412,
"score_of_the_acc": -0.5183,
"final_rank": 16
},
{
"submission_id": "aoj_0161_4613988",
"code_snippet": "#include <iostream>\n#include <algorithm>\n\nstruct Team {\n\tint id;\n\tint time;\n};\nbool operator < (const Team& t1, const Team& t2) { return t1.time < t2.time; }\n\nint main()\n{\n\tint n;\n\twhile (true) {\n\t\tstd::cin >> n;\n\t\tif (n==0) break;\n\t\tTeam* teams = new Team[n];\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tint id, m1, s1, m2, s2, m3, s3, m4, s4;\n\t\t\tstd::cin >> id >> m1 >> s1 >> m2 >> s2 >> m3 >> s3 >> m4 >> s4;\n\t\t\tteams[i].id = id;\n\t\t\tteams[i].time = 60*(m1+m2+m3+m4) + s1+s2+s3+s4; \n\t\t}\n\t\tstd::sort(teams, teams + n);\n\t\tstd::cout << teams[0].id << std::endl;\n\t\tstd::cout << teams[1].id << std::endl;\n\t\tstd::cout << teams[n-2].id << std::endl;\n\t\tdelete[] teams;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3192,
"score_of_the_acc": -0.2304,
"final_rank": 10
},
{
"submission_id": "aoj_0161_4230023",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\nusing namespace std;\n\nint main(void){\n int n;\n int id,m1,s1,m2,s2,m3,s3,m4,s4;\n int t;\n while(1){\n cin>>n;\n if(n==0)break;\n map<int,int> d;\n vector<int> v;\n for(int i=0;i<n;i++){\n cin>>id>>m1>>s1>>m2>>s2>>m3>>s3>>m4>>s4;\n t=60*(m1+m2+m3+m4)+s1+s2+s3+s4;\n v.push_back(t);\n d[t]=id;\n }\n sort(v.begin(),v.end());\n cout<<d[v[0]]<<endl;\n cout<<d[v[1]]<<endl;\n cout<<d[v[v.size()-2]]<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3344,
"score_of_the_acc": -0.4293,
"final_rank": 13
},
{
"submission_id": "aoj_0161_4098703",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int n;\n while (cin>>n) {\n if (n==0) {\n break;\n } else {\n int id,m,s;\n std::map<int, int> map;\n for (int i=0;i<n;i++) {\n cin>>id;\n int sum=0;\n for (int j=0;j<4;j++) {\n cin>>m>>s;\n sum+=60*m+s;\n }\n map.insert(make_pair(sum,id));\n }\n auto itr=map.begin();\n for (int k=0;k<n;k++) {\n if (k==0||k==1||k==n-2) {\n cout<<(itr->second)<<endl;\n itr=next(itr,1);\n } else {\n itr=next(itr,1);\n }\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3336,
"score_of_the_acc": -0.4188,
"final_rank": 12
},
{
"submission_id": "aoj_0161_4017970",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass Team {\npublic:\n\tint id;\n\tint time;\n};\n\nTeam TeamData[10000];\n\nbool cmp(const Team& t1, const Team& t2) {\n\treturn t1.time < t2.time;\n}\n\nint main(void) {\n\tint n, m, s, sum;\n\n\twhile (cin >> n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> TeamData[i].id;\n\t\t\tsum = 0;\n\t\t\tfor (int j = 0; j < 4; j++) {\n\t\t\t\tcin >> m >> s;\n\t\t\t\tsum += m * 60 + s;\n\t\t\t}\n\t\t\tTeamData[i].time = sum;\n\t\t}\n\n\t\tsort(TeamData, TeamData + n,cmp);\n\t\tcout << TeamData[0].id << endl << TeamData[1].id << endl << TeamData[n - 2].id << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3164,
"score_of_the_acc": -0.1937,
"final_rank": 6
},
{
"submission_id": "aoj_0161_3693443",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n\nint solve_testcase() {\n int N; cin >> N;\n if(N == 0) return 1;\n\n vector< pair<int, int> > info;\n for(int i=0; i<N; i++) {\n int id; cin >> id;\n int sum = 0;\n for(int k=0; k<4; k++) {\n int m, s; cin >> m >> s;\n int total_time = m * 60 + s;\n sum += total_time;\n }\n info.emplace_back(sum, id);\n }\n\n sort(info.begin(), info.end());\n cout << info[0].second << endl;\n cout << info[1].second << endl;\n cout << info[N-2].second << endl;\n return 0;\n}\n\nint main() {\n while(!solve_testcase());\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3092,
"score_of_the_acc": -0.0995,
"final_rank": 4
},
{
"submission_id": "aoj_0161_3692792",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define pp pair<int,int>\n#define ll long long\nint inf=100000000;\nll INF=100000000000000000;\nll are=1000000007;\n\nint main() {\n while (true){\n int n;\n cin >> n;\n if (n==0) break;\n vector<pp> a(n);\n rep(i,n){\n a.at(i).first=0;\n int u=0,y=0;\n cin >> a.at(i).second;\n rep(j,4){\n cin >> u >> y;\n a.at(i).first+=u*60+y;\n }\n }\n sort(a.begin(),a.end());\n cout << a.at(0).second << endl << a.at(1).second << endl << a.at(n-2).second << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3016,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0161_3692780",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing pii = pair<int, int>;\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<pii> scores;\n for(int i = 0; i < n; ++i) {\n int id; cin >> id;\n int t = 0;\n for(int j = 0; j < 4; ++j) {\n int m, s; cin >> m >> s;\n t += m * 60 + s;\n }\n scores.emplace_back(t, id);\n }\n sort(begin(scores), end(scores));\n\n cout << scores[0].second << endl;\n cout << scores[1].second << endl;\n cout << scores[n - 2].second << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3184,
"score_of_the_acc": -0.2199,
"final_rank": 8
},
{
"submission_id": "aoj_0161_3692769",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n\n#define int long long\n\nusing namespace std;\n\n\nclass Solver {\n\n};\n\nsigned main() {\n\twhile (true) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0)break;\n\n\t\tmap<int, int> vals;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint id, m1, s1, m2, s2, m3, s3, m4, s4;\n\t\t\tcin >> id >> m1 >> s1 >> m2 >> s2 >> m3 >> s3 >> m4 >> s4;\n\t\t\tint val = m1 * 60 + s1 + m2 * 60 + s2 + m3 * 60 + s3 + m4 * 60 + s4;\n\t\t\tvals.emplace(val,id);\n\t\t}\n\n\t\tint itr = 0;\n\t\tfor (auto val : vals) {\n\t\t\tif (itr == 0 || itr == 1 || itr == vals.size() - 2) {\n\t\t\t\tcout << val.second << endl;\n\t\t\t}\n\t\t\titr++;\n\t\t}\n\t}\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3388,
"score_of_the_acc": -0.4869,
"final_rank": 14
},
{
"submission_id": "aoj_0161_3692731",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst double eps=1e-9;\ntypedef vector<int> vi;\ntypedef long long ll;\nint A[5],B[5];\nstring rule[5][5];\n#define pb push_back\nstring s;\nint main(void)\n{\n int n;\n while(cin >> n && n)\n {\n vector<pair<int,int>> teams;\n for(int i=0;i<n;i++)\n\t{\n\t int id,m1,s1,m2,s2,m3,s3,m4,s4;\n\t cin >> id >> m1 >> s1 >> m2 >> s2 >> m3 >> s3 >> m4 >> s4;\n\t teams.push_back(make_pair(60*(m1+m2+m3+m4)+(s1+s2+s3+s4),id));\n\t}\n sort(teams.begin(),teams.end());\n for(int i=0;i<n;i++)\n\t{\n\t if(i==0 || i==1 || i==n-2)\n\t {\n\t cout << teams[i].second << endl;\n\t }\n\t}\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.2251,
"final_rank": 9
},
{
"submission_id": "aoj_0161_3692713",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <utility>\nusing namespace std;\nint main(){\n int n;\n while(cin >> n, n){\n vector<pair<int,string>> V;\n for(int i = 0; i < n; ++i){\n string id;\n cin >> id;\n int t = 0;\n for(int i = 0; i < 4; ++i){\n int m, s;\n cin >> m >> s;\n t += m*60 + s;\n }\n V.emplace_back(t,id);\n }\n sort(V.begin(),V.end());\n cout << V[0].second << endl;\n cout << V[1].second << endl;\n cout << V[n-2].second << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3404,
"score_of_the_acc": -0.5079,
"final_rank": 15
},
{
"submission_id": "aoj_0161_3435985",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i, n) for(int i=0; i<(n); ++i)\n#define FOR(i, m, n) for(int i=(m); i<(n); ++i)\n#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define Cout(x) cout << (x) << endl\n#define Cout2(x, y) cout << (x) << \" \" << (y) << endl\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define forauto(i, a) for(auto i : a)cout << i << \" \"; puts(\"\");\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef vector<LL> VL;\ntypedef vector<string> VS;\ntypedef vector<bool> VB;\ntypedef vector<vector<int>> VVI;\ntypedef pair<int, int> PII;\nconst int inf = 1e9;\nconst double pi = acos(-1.0);\n\nint main() {\n\tint n;\n\twhile (cin >> n && n) {\n\n\t\tvector<PII> data(n);\n\t\trep(i, n) {\n\t\t\tint id; cin >> id;\n\t\t\tint sec = 0;\n\t\t\trep(i, 4) {\n\t\t\t\tint m, s; cin >> m >> s; sec += m * 60 + s;\n\t\t\t}\n\t\t\tdata[i] = mp(sec, id);\n\t\t}\n\n\t\tsort(all(data));\n\t\tcout << data[0].second << endl << data[1].second << endl << data[sz(data) - 2].second << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3044,
"score_of_the_acc": -0.0366,
"final_rank": 2
},
{
"submission_id": "aoj_0161_3361080",
"code_snippet": "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nstruct Team {\n\tint num;\n\tint min[4];\n\tint s[4];\n\tint total;\n};\n\nint compute(Team group);\nbool compare(Team i, Team j) {\n\treturn (i.total < j.total);\n}\n\nint main() {\n\n\tint n;\n\twhile (cin >> n && n != 0) {\n\n\t\tTeam *group = new Team[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\n\t\t\tcin >> group[i].num;\n\n\t\t\tfor (int j = 0; j < 4; j++)\n\t\t\t\tcin >> group[i].min[j] >> group[i].s[j];\n\n\t\t\tgroup[i].total = compute(group[i]);\n\t\t}\n\n\t\tsort(group, group + n, compare);\n\t\tcout << group[0].num << \"\\n\"\n\t\t\t << group[1].num << \"\\n\"\n\t\t\t << group[n - 2].num<< \"\\n\";\n\t}\n\n\t\n\n\treturn 0;\n\n}\n\nint compute(Team group) {\n\n\tint total = 0;\n\tfor (int i = 0; i < 4; i++)\n\t\ttotal += (group.min[i] * 60 + group.s[i]);\n\n\treturn total;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3460,
"score_of_the_acc": -0.5812,
"final_rank": 17
},
{
"submission_id": "aoj_0161_3334673",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int a[100000], sum[100000], b, c, n;\n\n while( cin >> n )\n {\n if( n == 0 )\n break;\n\n for( int i = 0; i < 100000; i++ )\n sum[i] = 0;\n\n for( int i = 0; i < n; i++ )\n {\n cin >> a[i];\n for( int j = 0; j < 4; j++ )\n {\n cin >> b >> c;\n sum[i] += b * 60 + c;\n }\n }\n\n for( int j = 0; j < 2; j++ )\n {\n int min = 1000000, max = 0, s = 0, t = 0;\n for( int i = 0; i < n; i++ )\n {\n if( a[i] != -1 && min > sum[i] )\n {\n min = sum[i];\n s = i;\n }\n if( a[i] != -1 && max < sum[i] )\n {\n max = sum[i];\n t = i;\n }\n }\n cout << a[s] << endl;\n if( j == 1 )\n cout << a[t] << endl;\n a[s] = -1;\n a[t] = -1;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3512,
"score_of_the_acc": -0.6492,
"final_rank": 18
},
{
"submission_id": "aoj_0161_3152031",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cctype>\n#include<utility>\n#include<string>\n#include<cmath>\n#include <numeric>\n#include<map>\n#include<cstdio>\n \n \n#define REP(i, n) for(int i = 0;i < n;i++)\n#define REPR(i, n) for(int i = n;i >= 0;i--)\n#define FOR(i, m, n) for(int i = m;i < n;i++)\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\n#define SORT(v, n) sort(v, v+n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define llong long long\n#define pb(a) push_back(a)\n#define INF 1e13\nusing namespace std;\ntypedef pair<int, int> P;\ntypedef pair<llong, llong> LP;\ntypedef pair<int, P> PP;\ntypedef pair<llong, LP> LPP;\n \ntypedef long long int ll;\n#define MOD 1000000007\n\nbool comp(const pair<string,int>& p,const pair<string,int>& q){\n return p.second > q.second;\n }\n\nint main(){\n\n int n;\n while(cin >> n,n){\n\n \n vector<P> arr;\n int id,m1,s1,m2,s2,m3,s3,m4,s4;\n REP(i,n){\n int tmp = 0;\n cin >> id >> m1 >> s1 >> m2 >> s2 >> m3 >> s3 >> m4 >> s4;\n tmp = 60*m1 + s1 + 60*m2 + s2 +60*m3 + s3 +60*m4 + s4;\n arr.pb(make_pair(tmp,id));\n }\n VSORT(arr);\n cout << arr[0].second << endl;\n cout << arr[1].second << endl;\n cout << arr[arr.size()-2].second << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3172,
"score_of_the_acc": -0.2042,
"final_rank": 7
},
{
"submission_id": "aoj_0161_3059257",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nstruct hoge{\n ll s, n;\n hoge(ll s, ll n) : s(s), n(n) { }\n};\nbool operator < (const hoge &a, const hoge &b){\n return a.n != b.n ? a.n < b.n : a.s < b.s;\n}\n\nint main(void){\n while(true){\n ll n;\n cin >> n;\n if(n==0) break;\n vector<hoge> v;\n ll id, m1, s1, m2, s2, m3, s3, m4, s4;\n \n for(ll i=0; i<n; i++){\n cin >> id >> m1 >> s1 >> m2 >> s2 >> m3 >> s3 >> m4 >> s4;\n ll sum=60*m1+s1+60*m2+s2+60*m3+s3+60*m4+s4;\n v.push_back(hoge(id, sum));\n }\n sort(v.begin(), v.end());\n \n cout << v[0].s << \"\\n\";\n cout << v[1].s << \"\\n\";\n cout << v[n-2].s << \"\\n\";\n \n }\n \n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3204,
"score_of_the_acc": -0.2461,
"final_rank": 11
}
] |
aoj_0150_cpp
|
Twin Prime
Prime numbers are widely applied for cryptographic and communication technology.
A twin prime is a prime number that differs from another prime number by 2.
For example, (5, 7) and (11, 13) are twin prime pairs.
In this problem, we call the greater number of a twin prime "size of the twin prime."
Your task is to create a program which reads an integer
n
and prints a twin prime which has the maximum size among twin primes less than or equals to
n
You may assume that 5 ≤
n
≤ 10000.
Input
The input is a sequence of datasets. The end of the input is indicated by a line containing one zero. Each dataset is formatted as follows:
n
(integer)
Output
For each dataset, print the twin prime
p
and
q
(
p
<
q
).
p
and
q
should be separated by a single space.
Sample Input
12
100
200
300
0
Output for the Sample Input
5 7
71 73
197 199
281 283
|
[
{
"submission_id": "aoj_0150_10986470",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nbool is_prime(int n) {\n if (n <= 1) return false;\n for (int i = 2; i <= sqrt(n); i++){\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n}\n\nint main() {\n int n;\n while(true) {\n cin >> n;\n if (n==0) break;\n for(int i=n; i>=3; i--) {\n if (is_prime(i) && is_prime(i-2)) {\n cout << i-2 << \" \" << i << endl;\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3124,
"score_of_the_acc": -0.2951,
"final_rank": 11
},
{
"submission_id": "aoj_0150_10986468",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nbool is_prime(int n) {\n if (n < 2) return false;\n for (int i = 2; i * i <= n; i++) {\n if (n % i == 0) return false;\n }\n return true;\n}\n\nint main() {\n int n;\n while (true) {\n cin >> n;\n if (n == 0) break;\n for (int i = n; i >= 3; i--) {\n if (is_prime(i) && is_prime(i - 2)) {\n cout << i - 2 << \" \" << i << endl;\n break;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3336,
"score_of_the_acc": -0.7425,
"final_rank": 17
},
{
"submission_id": "aoj_0150_10986423",
"code_snippet": "#include <bits/stdc++.h>\n#define ll long long\n#define fi first\n#define se second\n#define si size()\nusing namespace std;\n\nbool is_prime(int n) {\n if (n == 1) {return 0;} if (n == 2) {return 1;} if (n % 2 == 0) {return 0;}\n for (int i = 3; i <= sqrt(n); i++) {\n if (n % i == 0) {return 0;}\n } return 1;\n}\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(nullptr);\n int n;\n while(true) {\n cin >> n;\n if (n==0) break;\n for(int i=n; i>=3; i--) {\n if (is_prime(i) && is_prime(i-2)) {\n cout << i-2 << \" \" << i << endl;\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3136,
"score_of_the_acc": -0.3197,
"final_rank": 13
},
{
"submission_id": "aoj_0150_10848291",
"code_snippet": "#include<bits/stdc++.h>\n#define N ((int) (1e4+8))\nusing namespace std;\nbool mark[N];\n\n\n\n\nint main()\n{\n int n;\n\n while(cin>>n && n!=0)\n {\n\n\nfor(int i=1;i<=n;i++)\n{\n mark[i]=0;\n}\n for(int i=3;i*i<=n;i+=2)\n {\n if(mark[i]==0)\n {\n for(int j=i*i;j<=n;j+=i+i)\n {\n mark[j]=1;\n }\n }\n }\n\n vector<int>prime;\n prime.push_back(2);\n\n\n\n for(int i=3;i<=n;i+=2)\n {\n if(mark[i]==0)\n {\n\n prime.push_back(i);\n\n\n }\n }\nint k,x,y,j;\n //for(k=0;k<prime.size();k++)\n //{\n j=prime.size()-1 ;\n do\n {\n\n\n if((prime[j]-prime[j-1])==2)\n {\n x=prime[j];\n y=prime[j-1];\n break;\n }\n\n }\nwhile( j--);\n\n\n //}\ncout<<y<<\" \"<<x<<endl;\nprime.clear();\n}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3468,
"score_of_the_acc": -1.039,
"final_rank": 18
},
{
"submission_id": "aoj_0150_9946963",
"code_snippet": "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nll p1=0,p2=0;\n\nbool prima(ll x) {\n for(ll i = 2; i*i <= x; i++) {\n if(x%i==0) return false;\n }\n return true;\n}\n\nint main() {\n ll n; cin >> n;\n while(n != 0) {\n for(ll i=n; i>2; i--) {\n if(prima(i)) {\n p1 = p2;\n p2 = i;\n if(p1-p2==2) {\n cout << p2 << \" \" << p1 << endl;\n break;\n }\n }\n }\n cin >> n;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3120,
"score_of_the_acc": -0.3258,
"final_rank": 14
},
{
"submission_id": "aoj_0150_9946533",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n// Function to generate all primes up to max_n using the Sieve of Eratosthenes\nvector<bool> generatePrimes(int max_n) {\n vector<bool> is_prime(max_n + 1, true);\n is_prime[0] = is_prime[1] = false; // 0 and 1 are not primes\n for (int i = 2; i * i <= max_n; ++i) {\n if (is_prime[i]) {\n for (int j = i * i; j <= max_n; j += i) {\n is_prime[j] = false;\n }\n }\n }\n return is_prime;\n}\n\nint main() {\n const int MAX_N = 10000;\n vector<bool> is_prime = generatePrimes(MAX_N);\n\n int n;\n while (cin >> n && n != 0) {\n int max_p = 0, max_q = 0;\n for (int i = 2; i <= n - 2; ++i) {\n if (is_prime[i] && is_prime[i + 2]) {\n max_p = i;\n max_q = i + 2;\n }\n }\n if (max_p && max_q) {\n cout << max_p << \" \" << max_q << endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3072,
"score_of_the_acc": -0.2924,
"final_rank": 10
},
{
"submission_id": "aoj_0150_9605755",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\n\n/*\n untuk mengecek apakah nbilangan prima\n kita coba bagi dengan 2, 3, 4, .. akar(n)\n jika habis dibagi, maka dapat disimpulkan n bukan prima\n\n jika sampai selesai tidak ada yg habis dibagi, maka n prima\n\n*/\n\n\nbool is_prime(int n){\n for (int i = 2; i*i <= n; i++){\n if ( n % i == 0 ){\n return false;\n }\n }\n return true;\n}\n\nint main (){\n while(true) { // true == sebuah nilai, bakal diulang2 terus\n cin >> n;\n if (n==0) break;\n for (int i=n; i>=0; i--){ // 5 <= n <= 10000\n if (is_prime(i) && is_prime(i-2)){\n cout << i-2 << \" \" << i << endl;\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3052,
"score_of_the_acc": -0.1475,
"final_rank": 5
},
{
"submission_id": "aoj_0150_6875741",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n vector<bool> tb(100001, true);\n tb[0] = tb[1] = false;\n for(int i = 2; i <= 100000; i++){\n if(!tb[i])continue;\n for(int j = 2 * i; j <= 100000; j += i){\n tb[j] = false;\n }\n }\n int n;\n while(cin >> n, n){\n int ans1, ans2;\n for(int j = 3; j + 2 <= n; j += 2){\n if(tb[j] && tb[j + 2]){\n ans1 = j;\n ans2 = j + 2;\n }\n }\n cout << ans1 << \" \" << ans2 << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3064,
"score_of_the_acc": -0.2111,
"final_rank": 7
},
{
"submission_id": "aoj_0150_6752422",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n(1);\nint prime(int a) {\n\tif(a%10 == 1 || a%10 == 3 || a%10 == 5 || a%10 == 7 || a%10 == 9 ){\n\t\tfor(int i=2; i<=a/2; i++) {\n\t\t\tif(a%i == 0 || (a-2)%i == 0) {\n\t\t\t\treturn prime(a-1);\n\t\t\t}\n\t\t}\n\t return a; \n\t}\n\telse {\n\t\treturn prime(a-1);\n\t}\n}\nint main() {\n\twhile(n != 0) {\n\t cin >> n;\n\t if(n != 0) {\n\t \tcout << prime(n) - 2 << \" \" << prime(n) << endl;\n\t\t}\t\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 2980,
"score_of_the_acc": -0.1299,
"final_rank": 4
},
{
"submission_id": "aoj_0150_6422480",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nbool cek(int x){\n\tbool prime = true;\n\tfor(int i=2; i*i<=x; i++){\n\t\tif(x%i == 0){\n\t\t\tprime = false;\n\t\t\tbreak;\n\t\t}\t\n\t}\n\tif(x == 1){\n\t\treturn false;\n\t} else if(x == 2){\n\t\treturn true;\n\t} else if(prime == true){\n\t\treturn true;\n\t} else if(prime == false){\n\t\treturn false;\n\t}\n}\nint n; \n\nint main(){\n\twhile(cin >> n && n!=0){\n\t\tfor(int i=n; i>=1; i--){\n\t\t\tif(cek(n) && cek(n-2)){\n\t\t\t\tcout << n-2 << \" \" << n << endl;\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tn--;\n\t\t\t}\n\t\t}\n\t}\n\t\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3068,
"score_of_the_acc": -0.1803,
"final_rank": 6
},
{
"submission_id": "aoj_0150_5943464",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(void){\n while(1){\n int n;\n cin>>n;\n if(n==0){\n return 0;\n }\n vector<bool> is_prime;\n is_prime.resize(n+1,true);\n is_prime[0]=false;\n is_prime[1]=false;\n for(int i=2;i<=n;i++){\n if(is_prime[i]==true){\n for(int j=2;i*j<=n;j++){\n is_prime[i*j]=false;\n }\n }\n }\n int m=-1;\n for(int i=0;i<=n;i++){\n if(i+2<=n && (is_prime[i] && is_prime[i+2])){\n m=max(m,i+2);\n }\n }\n cout<<m-2<<\" \"<<m<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 3096,
"score_of_the_acc": -0.6013,
"final_rank": 16
},
{
"submission_id": "aoj_0150_5425546",
"code_snippet": "#include <iostream>\n#include <math.h>\n#include <vector>\n\nbool IsPrime(int num){\n if(num < 2) return false;\n else if (num == 2) return true;\n else if (num % 2 == 0) return false;\n\n double sqrtNum = sqrt(num);\n for(int i = 3; i <= sqrtNum; i += 2){\n if(num % i == 0){\n return false;\n }\n }\n\n return true;\n\n} \n\nbool TwinPrime(int num){\n int count = 0;\n int twiprime1, twiprime2;\n std::vector<int> prime;\n\n prime.resize(num);\n\n for(int i = 1; i <= num; i++){\n if(IsPrime(i) == 1){\n prime[count] = i;\n count++;\n }\n }\n\n for(int i = 0; i < count; i++){\n if(prime[i+1] - prime[i] == 2){\n twiprime1 = prime[i];\n twiprime2 = prime[i+1];\n }\n }\n\n std::cout << twiprime1 << \" \" << twiprime2 << std::endl;\n}\n\nint main(){\n\n\n int n;\n //std::vector<int> v;\n //v.resize(10000);\n\n for(int i = 0; i <= 10000; i++){\n std::cin >> n;\n if(n == 0){return 0;}\n TwinPrime(n);\n }\n\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 780,
"memory_kb": 3104,
"score_of_the_acc": -1.2541,
"final_rank": 20
},
{
"submission_id": "aoj_0150_5401588",
"code_snippet": "#include <iostream>\n#include <vector>\nint is_prime(unsigned int a){\n if(a < 2)\n return 0;\n for(int i = 2; i * i <= a; i++){\n if(a % i == 0)\n return 0;\n }\n return 1;\n}\n\nint main(){\n int n = 0;\n unsigned int a;\n std::vector<unsigned int> v;\n v.resize(10000);\n\n for(int i = 0; i < 10000; i++){\n std::cin >> v[i];\n if(v[i] == 0){\n n = i;\n break;\n }\n }\n for(int i = 0; i < n; i++){\n a = v[i];\n for(unsigned int j = a; j > 4; j--){\n if( is_prime(j) ){\n if(is_prime(j - 2)){\n std::cout << j - 2 << \" \" << j << std::endl;\n break;\n }\n }\n }\n \n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3036,
"score_of_the_acc": -0.1277,
"final_rank": 3
},
{
"submission_id": "aoj_0150_5223244",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define d double\n\nbool prime(int n){\n int m = sqrt(n);\n for(int i=2; i<=m; i++){\n if(n%i==0){\n return false;\n }\n }\n return true;\n}\n\nint main() {\n int n;\n while(cin >> n) {\n if (n==0) {\n break;\n }\n for(int i=n; i>=1; i--){\n if(prime(i)==true && prime(i-2)==true){\n cout << i-2 << \" \" << i << endl;\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3080,
"score_of_the_acc": -0.2179,
"final_rank": 8
},
{
"submission_id": "aoj_0150_4730517",
"code_snippet": "#include<iostream>\nusing namespace std;\nint n;\nbool isP(int x){\n if(x==0||x==1)return false;\n for(int i=2;i*i<=x;i++){\n if(x%i==0)return false;\n }\n return true;\n}\nint main(){\n while(cin>>n&&n){\n for(int i=n;i-2>=1;i--){\n if(isP(i)&&isP(i-2)){\n\tcout<<i-2<<' '<<i<<endl;\n\tbreak;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3088,
"score_of_the_acc": -0.2213,
"final_rank": 9
},
{
"submission_id": "aoj_0150_4650531",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint prime(int z)\n{\n for(int i=2;i<z;i++) if(z%i==0) return 0;\n return 1;\n}\nint main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n\n while(1)\n {\n int n,i;\n cin >> n;\n if(n==0) break;\n if(n%2 == 0)n-=1;\n for(i=n;i>=2;i-=2)\n {\n if(prime(i) && prime(i-2))\n {\n cout << i-2 << \" \" << i << \"\\n\";\n break;\n }\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 700,
"memory_kb": 3136,
"score_of_the_acc": -1.2158,
"final_rank": 19
},
{
"submission_id": "aoj_0150_4606160",
"code_snippet": "#include <iostream>\n#include <cmath>\n\nbool isPrime(int n)\n{\n\tint ub = (int)std::sqrt((float)n);\n\tfor (int i=2; i<=ub; i++) {\n\t\tif (n%i == 0) return false;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint n;\n\twhile (std::cin >> n) {\n\t\tfor (int p=n; p>=2; p--) {\n\t\t\tif (isPrime(p) && isPrime(p-2)) { std::cout << p-2 << \" \" << p << std::endl; break; }\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2992,
"score_of_the_acc": -0.0376,
"final_rank": 1
},
{
"submission_id": "aoj_0150_4362677",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nvector<int> get_prime(int n){\n if(n <= 1) return vector<int>();\n vector<bool> is_prime(n+1, true);\n vector<int> prime;\n is_prime[0] = is_prime[1] = 0;\n for (int i = 2; i <= n; ++i) {\n if(is_prime[i]) prime.emplace_back(i);\n for (auto &&j : prime){\n if(i*j > n) break;\n is_prime[i*j] = false;\n if(i % j == 0) break;\n }\n }\n return prime;\n}\n\nint main() {\n auto v = get_prime(10000);\n vector<int> ans;\n for (int i = 0; i+1 < v.size(); ++i) {\n if(v[i+1] - v[i] == 2){\n ans.emplace_back(v[i]+2);\n }\n }\n int n;\n while(cin >> n, n){\n auto x = *--upper_bound(ans.begin(),ans.end(), n);\n printf(\"%d %d\\n\", x-2, x);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3216,
"score_of_the_acc": -0.4836,
"final_rank": 15
},
{
"submission_id": "aoj_0150_4160988",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n\n\nbool isprime(int n);\n\nint main(void){\n int n;\n while(1){\n cin>>n;\n if(n==0)break;\n\n for(int j=n;j>0;j--){\n if(isprime(j) && isprime(j-2)){\n cout<<j-2<<\" \"<<j<<endl;\n break;\n }\n }\n }\n return 0;\n}\n\nbool isprime(int n){\n for(int i=2;i<min((int)sqrt(n)+1,n);i++){\n if(n%i==0){\n return false;\n }\n }\n return true;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3016,
"score_of_the_acc": -0.0997,
"final_rank": 2
},
{
"submission_id": "aoj_0150_4097385",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n std::deque<int> arr(10001,1);\n std::deque<int> prime;\n arr[0]=0;\n arr[1]=1;\n for (int i=2;i*i<10000;i++) {\n if (arr[i]==1) {\n for (int j=i*i;j<10000;j+=i) {\n arr[j]=0;\n }\n }\n }\n for (int k=2;k<=10000;k++) {\n if (arr[k]==1) {\n prime.emplace_back(k);\n }\n }\n int n;\n while (cin>>n) {\n if (n==0) {\n break;\n } else {\n auto itr=upper_bound(prime.begin(),prime.end(),n);\n int dis=distance(prime.begin(),itr);\n dis--;\n for (int l=dis;l>0;l--) {\n if (prime[l]-prime[l-1]==2) {\n cout<<prime[l-1]<<\" \"<<prime[l]<<endl;\n break;\n }\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3128,
"score_of_the_acc": -0.3033,
"final_rank": 12
}
] |
aoj_0162_cpp
|
ハミング数
1 に 2, 3, 5 を何回か (0 回以上) かけ算して得られる数をハミング数 (Hamming numbers) と呼びます。例えば、
1
1 × 2 × 2 = 4
1 × 2 × 2 × 3 × 5 × 5 = 300
などはハミング数ですが、11, 13, 14 などはハミング数ではありません。
ハミング数はどれも 60 のべき乗を割り切る(例えば、54 は 60
3
= 21600 を割り切る) ので、時刻など 60 進法の計算には都合の良い数として昔から知られていました。また、楽器の調律に用いる音階の一つである純正律では、音の周波数の比が 24, 27, 30, 32, 36, 40, 45, 48 というハミング数からなる数列になります。
整数
m
、
n
を入力とし、
m
以上
n
以下のハミング数の個数を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットとして、２つの整数
m
と
n
(1 ≤
m
,
n
≤ 1000000,
m
≤
n
) が空白区切りで１行に与えられます。
データセットの数は 20 を超えません。
Output
データセットごとに
m
以上
n
以下のハミング数の個数を１行に出力します。
Sample Input
3 8
1 27
1 86
0
Output for the Sample Input
5
17
31
|
[
{
"submission_id": "aoj_0162_7939406",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int n, m;\n while (cin >> m, m) {\n cin >> n;\n int ans = 0;\n for (; m <= n; m++) {\n int tmp = m;\n while (!(tmp % 2))\n tmp /= 2;\n while (!(tmp % 3))\n tmp /= 3;\n while (!(tmp % 5))\n tmp /= 5;\n if (tmp == 1)\n ans++;\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3052,
"score_of_the_acc": -0.0085,
"final_rank": 3
},
{
"submission_id": "aoj_0162_7939337",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int n, m, ret;\n while (cin >> n && n) {\n cin >> m;\n ret = 0;\n for (int i = n; i <= m; i++) {\n int c = i;\n while (c % 2 == 0) {\n c /= 2;\n }\n while (c % 3 == 0) {\n c /= 3;\n }\n while (c % 5 == 0) {\n c /= 5;\n }\n if (c == 1)\n ret++;\n }\n cout << ret << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3076,
"score_of_the_acc": -0.0091,
"final_rank": 8
},
{
"submission_id": "aoj_0162_7939334",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int n, m, ret, c;\n while (cin >> n && n) {\n cin >> m;\n ret = 0;\n for (int i = n; i <= m; i++) {\n c = i;\n while (c % 2 == 0) {\n c /= 2;\n }\n while (c % 3 == 0) {\n c /= 3;\n }\n while (c % 5 == 0) {\n c /= 5;\n }\n if (c == 1)\n ret++;\n }\n cout << ret << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3076,
"score_of_the_acc": -0.0414,
"final_rank": 11
},
{
"submission_id": "aoj_0162_7939251",
"code_snippet": "#include <iostream>\nusing namespace std;\nconst int MAX = 1000000;\nbool hamming[MAX];\nint main() {\n int ps[3] = {2, 3, 5};\n int n, m;\n for (int i = 0; i < MAX; ++i) {\n n = i + 1;\n for (int j = 0; j < 3; ++j) {\n while (n % ps[j] == 0)\n n /= ps[j];\n }\n hamming[i] = n == 1 ? true : false;\n }\n while (cin >> m, m) {\n cin >> n;\n int c = 0;\n --m;\n for (int i = m; i < n; ++i) {\n if (hamming[i])\n ++c;\n }\n cout << c << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4052,
"score_of_the_acc": -0.0642,
"final_rank": 12
},
{
"submission_id": "aoj_0162_5807087",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <map>\n\nusing namespace std;\n\ntemplate<class T, class Func = function<T(T, T)>>\nclass segtree {\n vector<T> obj;\n int offset;\n Func updater;\n T e;\n int bufsize(int num) {\n int i = 1;\n for (; num + 1 > i; i <<= 1);\n offset = i - 1;\n return (i << 1) - 1;\n }\n T query(int a, int b, int k, int l, int r) {\n if (r <= a || b <= l)return e;\n if (a <= l && r <= b)return obj[k];\n else return updater(query(a, b, k * 2 + 1, l, (l + r) / 2), query(a, b, k * 2 + 2, (l + r) / 2, r));\n }\n int find_maximum_index_sub(int a, int b, T x, int k,int l, int r,const Func& f){\n if(!f(obj[k],x) || r <= a || b <= l) return -1;\n if(k >= offset) return k - offset;\n /* search * right * subtree to find x*/\n int rv = find_maximum_index_sub(a,b,x,2 * k + 2, (l + r) / 2,r,f);\n if(rv != -1) return rv;\n /* find maximum ( right ) index, so that left subtree will be searched only if there is no elem in right subtree*/\n return find_maximum_index_sub(a,b,x, 2 * k + 1, l, (l + r) / 2,f);\n }\n int find_minimum_index_sub(int a, int b, T x, int k, int l, int r,const Func& f){\n if(!f(obj[k],x) || r <= a || b <= l) return -1;\n if(k >= offset) return k - offset;\n /* search * right * subtree to find x*/\n int lv = find_minimum_index_sub(a,b,x, 2 * k + 1, l, (l + r) / 2,f);\n if(lv != -1) return lv;\n /* find maximum ( right ) index, so that left subtree will be searched only if there is no elem in right subtree*/\n return find_minimum_index_sub(a,b,x,2 * k + 2, (l + r) / 2,r,f);\n }\npublic:\n T query(int a, int b) {//[a,b)\n return query(a, b, 0, 0, offset + 1);\n }\n void updateall(int l = 0, int r = -1) {\n if (r < 0)r = offset + 1;\n l += offset, r += offset;\n do {\n l = (l - 1) >> 1, r = (r - 1) >> 1;\n for (int i = l; i < r; i++)obj[i] = updater(obj[i * 2 + 1], obj[i * 2 + 2]);\n } while (l);\n }\n void update(int k, T a) {\n k += offset;\n obj[k] = a;\n while (k) {\n k = (k - 1) >> 1;\n obj[k] = updater(obj[k * 2 + 1], obj[k * 2 + 2]);\n }\n }\n //[l,r)\n int find_maximum_index(int l, int r, T x,const Func& f) {\n return find_maximum_index_sub(l,r,x,0,0,offset + 1,f);\n }\n // (l,r]\n int find_minimum_index(int l, int r, T x,const Func& f){\n return find_minimum_index_sub(l,r,x,0,0,offset + 1,f);\n }\n void print_tree(){\n int id = 0;\n int sum = obj.size();\n for(int i = 0;sum > 0 ; ++i){\n for(int j = 0; j < (1 << i); ++j){\n cout << obj[id++] << \" \";\n --sum;\n }\n cout << endl;\n }\n }\n \n segtree(int n, T e, const Func &updater = Func()) :obj(bufsize(n), e), e(e), updater(updater) {}\n segtree(vector<T> &vec, T e, const Func &updater = Func()) :obj(bufsize(vec.size()), e), e(e), updater(updater) {\n copy(vec.begin(), vec.end(), obj.begin() + offset);\n updateall();\n }\n typename vector<T>::reference operator[](int n) {\n return obj[n + offset];\n }\n void set(int id, T x){\n update(id,x);\n }\n};\nusing Int = short;\nint maxim = 1e6 + 1;\nint main(){\n vector<Int>dp(5 * maxim + 1,0);\n dp[1] = 1;\n for(int i = 1; i < maxim; ++i){\n if(dp[i] == 0)continue;\n dp[i * 2] = dp[i * 3] = dp[i * 5] = 1;\n }\n auto sgt = segtree<Int>(dp,0LL,plus<>());\n while(true){\n int l,r;cin >> l;\n if(l == 0) break;\n cin >> r;\n cout << sgt.query(0,r + 1) - sgt.query(0,l) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 45332,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_0162_5804074",
"code_snippet": "#include <cassert>\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#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n//#include <boost/foreach.hpp>\n//#include <boost/range/algorithm.hpp>\n//#include <boost/multiprecision/cpp_int.hpp>\n#define ll long long\n#define Sort(v) sort(all(v))\n#define INF 1e9\n#define LINF (1LL<<40)\n#define END return 0\n#define pb push_back\n#define se second\n#define fi first\n#define pb push_back\n#define all(v) (v).begin(), (v).end()\n#define MP make_pair\n#define int long long\n#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)\n#define umap unordered_map \n#define re0 return 0\nusing namespace std;\nint day[12]={31,28,31,30,31,30,31,31,30,31,30,31};\n int dx[]={0,1,0,-1};\n int dy[]={1,0,-1,0};\n//typedef pair<int,int> P;\nconst string SP = \" \";\nconst string TAB = \"\\t\"; \nconst long long MOD=1000000007LL;\nbool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}\nbool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}\nbool isnumber(char c){return ('0'<=c&&c<='9');}\nbool isalpha(char c){return (isupper(c)||islower(c));}\nbool is_kaibun(string s){string rs = s;reverse(all(rs));if(s == rs)return true;else return false;}\nstd::random_device rnd;\nstd::mt19937 mt(rnd());\nconst int RAND_LIMIT = 1000000;\nstd::uniform_int_distribution<> rand_mt(0, RAND_LIMIT); // rand_mt(mt);\n\ninline double getTime() {\n using namespace std::chrono;\n return duration_cast<milliseconds>(system_clock::now().time_since_epoch()).count();\n}\ntemplate<typename T> bool chmax(T &m, const T q) {\n if (m < q) {m = q; return true;} else return false; }\ntemplate<typename T> bool chmin(T &m, const T q) {\n if (m > q) {m = q; return true;} else return false; }\n\n\ntemplate<typename T> \nvoid printv(vector<T> v, bool is_endl=true){\n for(int i=0;i<v.size();i++){\n if(i)cout<<\" \";\n cout<<v[i];\n }\n if(is_endl)cout<<endl;\n}\n//int INF=1e18;\n\ntemplate<typename T>\nvoid printendl(vector<T> v){\n for(auto date:v)cout<<date<<endl;\n}\n\ntemplate<typename T>\nvoid printvv(vector<vector<T>> v){\n for(int i=0;i<v.size();i++){\n for(int j=0;j<v[i].size();j++){\n if(j)cout<<\" \";\n cout<<v[i][j];\n }\n cout<<endl;\n }\n}\n// struct Point{\n// int x,y,num;\n\n// double e_dis(Point other){\n// return sqrt((x-other.x)*(x-other.x)+(y-other.y)*(y-other.y));\n// }\n// };\n\nint gcd(int a,int b){\n if(b==0)return a;\n else return gcd(b,a%b);\n}\n\nbool is_prime(int x){\n if(x==1)return 0;\n if(x==2)return 1;\n for(int i=2;i*i<=x;i++)if(x%i==0)return 0;\n return 1;\n}\n\n//スプリット関数\n//split(文字列変数,区切りたい文字);\nvector<string> split(string s, char c){\n if(s[s.size()-1]!=c)s+=c;\n vector<string> v;\n int pos=0;\n rep(i,0,s.size()){\n if(s[i]==c){\n v.push_back(s.substr(pos,i-pos));\n pos=i+1;\n }\n if(i==s.size()-1 && s.substr(pos,i-pos)!=\"\")v.push_back(s.substr(pos,i-pos));\n }\n return v;\n}\n\nmap<int,int> prime_factor(int n){\n map<int,int> ret;\n if(n==1){\n ret[1]=1;\n return ret;\n }\n for(int i=2;i*i<=n;i++){\n while(n%i==0){\n ret[i]++;\n n/=i; \n }\n }\n if(n!=1)ret[n]=1;\n return ret;\n}\n\nstruct UnionFind{\n vector<int> par;\n UnionFind(int n){\n par.assign(n,-1);\n }\n int root(int x){\n if(par[x]<0)return x;\n else return par[x]=root(par[x]);\n }\n\n bool same(int a,int b){\n return root(a)==root(b);\n }\n\n bool merge(int a,int b){\n a=root(a);\n b=root(b);\n if(a==b)return false;\n\n if(par[a]>par[b])swap(a,b);\n par[a]+=par[b];\n par[b]=a;\n return true;\n }\n\n int size(int x){\n return -par[root(x)];\n }\n};\n\nvector<bool> eratos(int n){\n vector<bool> prime(n,true);\n prime[0]=false;\n prime[1]=false;\n for(int i=2;i<=n;i++){\n if(prime[i]){\n for(int j=i+i;j<=n;j+=i){\n prime[j]=false;\n }\n }\n }\n return prime;\n}\n\nint n,m;\nmap<int,int> mp;\nvoid dfs(int x){\n if(m <= x && x <= n) mp[x] = 1;\n if(2*x <= n)dfs(2*x);\n if(3*x <= n)dfs(3*x);\n if(5*x <= n)dfs(5*x);\n return;\n}\n\n\nsigned main(){\n while(cin>>m>>n){\n if(n+m==0)break;\n mp.clear();\n dfs(1);\n cout<<mp.size()<<endl;\n }\n}\n/*\n\n*/",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3380,
"score_of_the_acc": -0.1453,
"final_rank": 14
},
{
"submission_id": "aoj_0162_5728052",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint m,n;\n\twhile(cin>>m>>n){\n\t\tint cnt=0;\n\t\tfor(int i=m;i<=n;i++){\n\t\t\tint ii=i;\n\t\t\tfor(int j=2;j<=5;j++)\n\t\t\t\twhile(ii%j==0)\n\t\t\t\t\tii/=j;\n\t\t\tif(ii==1)\n\t\t\t\tcnt++;\n\t\t}\n\t\tcout<<cnt<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3360,
"score_of_the_acc": -0.4996,
"final_rank": 18
},
{
"submission_id": "aoj_0162_5457785",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)\n#define all(x) (x).begin(),(x).end()\nusing ll = long long;\nusing P = pair<ll, ll>;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, -1, 0, 1};\nstring char_to_string(char val) {\n return string(1, val);\n}\nint char_to_int(char val) {\n return val - '0';\n}\nchar inverse_char(char c) {\n if(isupper(c)) return tolower(c);\n else return toupper(c);\n}\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\nstruct edge {\n ll to, cost;\n};\n\nstruct SieveOfEratosthenes : std::vector<int> {\n std::vector<int> primes;\n SieveOfEratosthenes(int MAXN) : std::vector<int>(MAXN + 1) {\n std::iota(begin(), end(), 0);\n for (int i = 2; i <= MAXN; i++) {\n if ((*this)[i] == i) {\n primes.push_back(i);\n for (int j = i; j <= MAXN; j += i) (*this)[j] = i;\n }\n }\n }\n using T = long long int;\n // Prime factorization for x <= MAXN^2\n // Complexity: O(log x) (x <= MAXN)\n // O(MAXN / logMAXN) (MAXN < x <= MAXN^2)\n std::map<T, int> Factorize(T x) {\n assert(x <= 1LL * (int(size()) - 1) * (int(size()) - 1));\n std::map<T, int> ret;\n if (x < int(size())) {\n while (x > 1) {\n ret[(*this)[x]]++;\n x /= (*this)[x];\n }\n }\n else {\n for (auto p : primes) {\n while (!(x % p)) x /= p, ret[p]++;\n if (x == 1) break;\n }\n if (x > 1) ret[x]++;\n }\n return ret;\n }\n std::vector<T> Divisors(T x) {\n std::vector<T> ret{1};\n for (auto p : Factorize(x)) {\n int n = ret.size();\n for (int i = 0; i < n; i++) {\n for (T a = 1, d = 1; d <= p.second; d++) {\n a *= p.first;\n ret.push_back(ret[i] * a);\n }\n }\n }\n return ret; // Not sorted\n }\n // Moebius function Table\n // return: [0=>0, 1=>1, 2=>-1, 3=>-1, 4=>0, 5=>-1, 6=>1, 7=>-1, 8=>0, ...]\n std::vector<int> GenerateMoebiusFunctionTable() {\n std::vector<int> ret(size());\n for (int i = 1; i < int(size()); i++) {\n if (i == 1) ret[i] = 1;\n else if ((i / (*this)[i]) % (*this)[i] == 0) ret[i] = 0;\n else ret[i] = -ret[i / (*this)[i]];\n }\n return ret;\n }\n};\nSieveOfEratosthenes sieve(1000000);\n\nll ham(ll a) {\n ll ans = 0;\n for(int i = 1; i <= a; ++i) {\n bool f = false;\n auto x = sieve.Factorize(i);\n for(auto p : x) { // 素因数分解したい値をかっこの中へ。\n if(p.first != 2 && p.first != 3 && p.first != 5) f = true;\n }\n if(f == false) ans++;\n }\n return ans;\n}\n\nint main() {\n while(true) {\n int m, n; cin >> m;\n if(m == 0) {\n return 0;\n }\n cin >> n;\n cout << ham(n) - ham(m - 1) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 7428,
"score_of_the_acc": -1.1112,
"final_rank": 20
},
{
"submission_id": "aoj_0162_4995576",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n\n#define MAX_n 1'000'000\n\nusing namespace std;\n\nint m, n;\nint cnt[MAX_n + 1];\nint fct[] = {2, 3, 5};\n\nint main() {\n cnt[0] = 0;\n cnt[1] = 1;\n for (int i = 2; i <= MAX_n; ++i) {\n int t = i;\n for (int j = 0; j < 3; ++j) {\n while (t % fct[j] == 0) {\n t /= fct[j];\n }\n }\n if (t == 1) {\n cnt[i] = cnt[i - 1] + 1;\n } else {\n cnt[i] = cnt[i - 1];\n }\n }\n\n for (;;) {\n cin >> m;\n if (m == 0) {\n break;\n }\n cin >> n;\n printf(\"%d\\n\", cnt[n] - cnt[m - 1]);\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 6996,
"score_of_the_acc": -0.1333,
"final_rank": 13
},
{
"submission_id": "aoj_0162_4979346",
"code_snippet": "#include<iostream>\nusing namespace std;\nbool f(int a){\n\twhile(a%3<1)a/=3;\n\twhile(a%5<1)a/=5;\n\treturn __builtin_popcount(a)==1;\n}\nmain(){\n\tint m,n;\n\twhile(cin>>m,m){\n\t\tcin>>n;int cnt=0;\n\t\tfor(;m<=n;m++)cnt+=f(m);\n\t\tcout<<cnt<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3068,
"score_of_the_acc": -0.0089,
"final_rank": 6
},
{
"submission_id": "aoj_0162_4614009",
"code_snippet": "#include <iostream>\n\nint isHamming(int n)\n{\n\twhile (n%2==0) n/=2;\n\twhile (n%3==0) n/=3;\n\twhile (n%5==0) n/=5;\n\treturn (n==1) ? 1 : 0;\n}\n\nint main()\n{\n\tint m, n;\n\twhile (true) {\n\t\tstd::cin >> m;\n\t\tif (m==0) break;\n\t\tstd::cin >> n;\n\t\tint res = 0;\n\t\tfor (int i=m; i<=n; i++) {\n\t\t\tres += isHamming(i);\n\t\t}\n\t\tstd::cout << res << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3060,
"score_of_the_acc": -0.0087,
"final_rank": 5
},
{
"submission_id": "aoj_0162_4099021",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int m,n;\n while (cin>>m>>n) {\n if (m==0) {\n break;\n } else {\n int count=0;\n for (int i=m;i<=n;i++) {\n int tmp=i;\n if (tmp%2==0) {\n while (tmp%2==0) {\n tmp=tmp/2;\n }\n while (tmp%3==0) {\n tmp=tmp/3;\n }\n while (tmp%5==0) {\n tmp=tmp/5;\n }\n if (tmp==1) {\n count++;\n }\n } else {\n while (tmp%3==0) {\n tmp=tmp/3;\n }\n while (tmp%5==0) {\n tmp=tmp/5;\n }\n if (tmp==1) {\n count++;\n }\n }\n }\n cout<<count<<endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3056,
"score_of_the_acc": -0.0086,
"final_rank": 4
},
{
"submission_id": "aoj_0162_3957014",
"code_snippet": "#include <cstdio>\nusing namespace std;\n\nbool is_valid(int num) {\n while(num % 2 == 0) num /= 2;\n while(num % 3 == 0) num /= 3;\n while(num % 5 == 0) num /= 5;\n return num == 1;\n}\n\nint solve_testcase() {\n int L; scanf(\"%d\", &L);\n if(L == 0) return 1;\n int R; scanf(\"%d\", &R);\n\n int ans = 0;\n for(int i=L; i<=R; i++) ans += is_valid(i);\n printf(\"%d\\n\", ans);\n \n return 0;\n}\n\nint main() {\n while(!solve_testcase());\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2688,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0162_3957013",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main(){\n int n,m;\n while(cin >> n,n){\n cin >> m;\n int ans = 0;\n for(int i = n; i <= m; i++){\n int t = i;\n while(t % 2 == 0)t /= 2;\n while(t % 3 == 0)t /= 3;\n while(t % 5 == 0)t /= 5;\n if(t == 1)ans++;\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3092,
"score_of_the_acc": -0.0095,
"final_rank": 9
},
{
"submission_id": "aoj_0162_3720283",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define pp pair<int,int>\n#define ll long long\n#define ld long double\nint inf=100000000;\nll INF=5000000000000000000;\nll MOD=1000000007;\n\n\nint main() {\n vector<int> dp(1000001),s(1000001);\n s.at(0)=0;\n queue<int> q;\n q.push(1);\n while (!q.empty()){\n int a=q.front();\n q.pop();\n if (a>1000000) continue;\n dp[a]=1;\n q.push(a*2);\n q.push(a*3);\n q.push(a*5);\n }\n for (int i=1;i<1000001;i++){\n s.at(i)=s.at(i-1)+dp.at(i);\n }\n while (true){\n int t,y;\n cin >> t;\n if (t==0) return 0;\n cin >>y;\n cout << s.at(y)-s.at(t-1) << endl;\n}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 15980,
"score_of_the_acc": -0.344,
"final_rank": 17
},
{
"submission_id": "aoj_0162_3335411",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int m, n;\n\n while( cin >> m )\n {\n if( m == 0 )\n break;\n \n cin >> n;\n \n int cnt = 0;\n\n for( int i = m; i <= n; i++ )\n {\n int j = i;\n while( j % 2 == 0 )\n j /= 2;\n while( j % 3 == 0 )\n j /= 3;\n while( j % 5 == 0 )\n j /= 5;\n if( j == 1 )\n cnt++;\n }\n cout << cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3048,
"score_of_the_acc": -0.0084,
"final_rank": 2
},
{
"submission_id": "aoj_0162_3132172",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n//define\n#define int long long\n#define UNIQUE(v) v.erase(unique(all(v)), v.end());\n#define ZIP(v) sort(all(v)),UNIQUE(v)\n#define ADD(a, b) a = (a + b) % mod\n#define SUB(a, b) a = (a+mod-b)%mod\n#define MUL(a, b) a = (a * b) % mod\n#define repi(i,m,n) for(int i = m;i < n;i++)\n#define drep(i,n,m) for(int i = n;i >= m;i--)\n#define rep(i,n) repi(i,0,n)\n#define rrep(i,n) repi(i,1,n+1)\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define all(v) v.begin(),v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define dmp(x,y) make_pair(x,y)\n#define pb(x) push_back(x)\n#define pf(x) push_front(x)\n#define fi first\n#define se second\n// 許容する誤差ε\n#define EPS (1e-10)\n// 2つのスカラーが等しいかどうか\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n// 2つのベクトルが等しいかどうか\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n//template\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p){\n os << \"(\" << p.first << \",\" << p.second << \")\";return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v){\n for (auto it = v.begin();it != v.end();++it){\n if(it != v.begin())os << \" \";os << *it;\n }return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &mp){\n for(auto x: mp)os << \"(\" << x.first << \",\" << x.second << \")\" << endl;\n return os;\n}\ntemplate<typename T, int SIZE>\nint array_length(const T (&)[SIZE]){return SIZE;}\ntemplate<typename T, int N>\nvoid PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true){\n\tif(t == -1){rep(i,s){if(i)cout << \" \";cout << a[i];}}\n\telse repi(i,s,t){if(i!=s)cout << \" \";cout << a[i];}\n\tif(f)cout << \"\\n\";\n}\ntemplate<typename T, int N1, int N2>\nvoid PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2){\n\trep(i,h){rep(j,w){cout << a[i][j] << \" \\n\"[j==w-1];}}\n}\n//typedef\ntypedef complex<double> Point;\ntypedef pair<int,int> P;\ntypedef pair<int, P> PP;\ntypedef pair<P, int> Pi;\ntypedef vector<int> vi;\ntypedef deque<int> dq;\nconst int inf = 1e9+7;\nconst int INF = 1e18+7;\n\n\nconst int MAX = 1e6;\nint dp[MAX+1], s[3] = {2, 3, 5};\nsigned main(){\n dp[1] = 1;\n repi(i,2,MAX+1){\n rep(j,3)if(i%s[j] == 0){\n chmax(dp[i], dp[i/s[j]]);\n }\n }\n rrep(i,MAX)dp[i] += dp[i-1];\n while(1){\n int l, r;\n scanf(\"%lld\", &l);\n if(l == 0)break;\n scanf(\"%lld\", &r);\n printf(\"%lld\\n\", dp[r]-dp[l-1]);\n }\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 11040,
"score_of_the_acc": -0.2281,
"final_rank": 16
},
{
"submission_id": "aoj_0162_3132170",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n//define\n#define int long long\n#define UNIQUE(v) v.erase(unique(all(v)), v.end());\n#define ZIP(v) sort(all(v)),UNIQUE(v)\n#define ADD(a, b) a = (a + b) % mod\n#define SUB(a, b) a = (a+mod-b)%mod\n#define MUL(a, b) a = (a * b) % mod\n#define repi(i,m,n) for(int i = m;i < n;i++)\n#define drep(i,n,m) for(int i = n;i >= m;i--)\n#define rep(i,n) repi(i,0,n)\n#define rrep(i,n) repi(i,1,n+1)\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define all(v) v.begin(),v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define dmp(x,y) make_pair(x,y)\n#define pb(x) push_back(x)\n#define pf(x) push_front(x)\n#define fi first\n#define se second\n// 許容する誤差ε\n#define EPS (1e-10)\n// 2つのスカラーが等しいかどうか\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n// 2つのベクトルが等しいかどうか\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n//template\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p){\n os << \"(\" << p.first << \",\" << p.second << \")\";return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v){\n for (auto it = v.begin();it != v.end();++it){\n if(it != v.begin())os << \" \";os << *it;\n }return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &mp){\n for(auto x: mp)os << \"(\" << x.first << \",\" << x.second << \")\" << endl;\n return os;\n}\ntemplate<typename T, int SIZE>\nint array_length(const T (&)[SIZE]){return SIZE;}\ntemplate<typename T, int N>\nvoid PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true){\n\tif(t == -1){rep(i,s){if(i)cout << \" \";cout << a[i];}}\n\telse repi(i,s,t){if(i!=s)cout << \" \";cout << a[i];}\n\tif(f)cout << \"\\n\";\n}\ntemplate<typename T, int N1, int N2>\nvoid PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2){\n\trep(i,h){rep(j,w){cout << a[i][j] << \" \\n\"[j==w-1];}}\n}\n//typedef\ntypedef complex<double> Point;\ntypedef pair<int,int> P;\ntypedef pair<int, P> PP;\ntypedef pair<P, int> Pi;\ntypedef vector<int> vi;\ntypedef deque<int> dq;\nconst int inf = 1e9+7;\nconst int INF = 1e18+7;\n\n\nconst int MAX = 1000000;\nint dp[MAX+1], s[3] = {2, 3, 5};\nsigned main(){\n dp[1] = 1;\n repi(i,2,MAX+1){\n rep(j,3)if(i%s[j] == 0){\n chmax(dp[i], dp[i/s[j]]);\n }\n }\n rrep(i,MAX)dp[i] += dp[i-1];\n while(1){\n int l, r;\n scanf(\"%lld\", &l);\n if(l == 0)break;\n scanf(\"%lld\", &r);\n printf(\"%lld\\n\", dp[r]-dp[l-1]);\n }\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 10940,
"score_of_the_acc": -0.2258,
"final_rank": 15
},
{
"submission_id": "aoj_0162_2882483",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int m;\n int n,a,cnt;\n m =0 , n=0, a=0, cnt =0;\n while(1){\n cin >> m;\n if(m == 0) break;\n cin >> n;\n \n for(int i=m;i<=n;i++){\n a = i;\n \n while(a % 2 ==0) a = a / 2;\n while(a % 3 ==0) a = a / 3;\n while(a % 5 ==0) a = a / 5;\n\n if(a == 1) cnt++;\n }\n\n\n cout << cnt << endl;\n cnt =0;\n\n }\n\n\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3072,
"score_of_the_acc": -0.009,
"final_rank": 7
},
{
"submission_id": "aoj_0162_2879636",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nbool check(int n){\n while(n%2==0){\n n/=2;\n }\n while(n%3==0){\n n/=3;\n }\n while(n%5==0){\n n/=5;\n }\n if(n==1){\n return true;\n }else{\n return false;\n }\n}\n\nint main(){\n int m,n;\n while(1){\n cin>>m;\n if(m==0)break;\n cin>>n;\n int ans=0;\n for(int i=m;i<=n;i++){\n if( check(i) ){\n ans++;\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3092,
"score_of_the_acc": -0.0095,
"final_rank": 9
}
] |
aoj_0171_cpp
|
サイコロパズル
各面にアルファベット一文字(a 〜 z、A 〜 Z)が描かれたサイコロがあります。
このようなサイコロを8つ組み合わせて 2 × 2 × 2 の立方体を作ることを考えます。
組み合わせ方には条件があり、各サイコロの向き合う面は同じアルファベットでかつ一方が小文字、も
う一方が大文字でなければなりません。例えば、a と描かれた面に接することができるのは A と描か
れた面です。ただし、接するときの文字の向きは問いません。
このルールに従い、８つのサイコロの情報を入力とし、立方体を作れるか否かを判定するプログラムを作成してください。立方体を作れる場合は YES（半角英大文字）、作れない場合は NO（半角英大文字）と出力してください。
なお、サイコロの各面の文字を次の図にあるように
c1
〜
c6
と表すことにします。
また、1つのサイコロに同じ文字が複数回描かれていることは無いものとします（同じアルファベットの大文字と小文字はその限りではありません）。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
s
1
s
2
:
s
8
i
行目に
i
個目のサイコロの情報
s
i
が与えられます。
s
i
は長さ 6 の文字列であり
j
文字目がサイコロの各面
cj
に対応します。
データセットの数は 50 を超えません。
Output
データセットごとに判定結果（半角英大文字）を１行に出力します。
Sample Input
zabZNq
BCxmAi
ZcbBCj
aizXCm
QgmABC
JHzMop
ImoXGz
MZTOhp
zabZnQ
BCxmAi
ZcbBCj
aizXCm
QgmABC
JHzMop
ImoXGz
MZTOhp
abcdef
ABDCFE
FBDCAE
abcdef
BEACDF
bfcaed
fabcde
DEABCF
UnivOf
AizuaH
zTXZYW
piglIt
GRULNP
higGtH
uAzIXZ
FizmKZ
UnivOf
AizuaH
piglIt
higGtH
GRULNP
uAzIXZ
FizmKZ
ZTXzYW
0
Output for the Sample Input
YES
NO
YES
YES
NO
|
[
{
"submission_id": "aoj_0171_5620733",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nconst int num_alphabets = 27;\nconst int num_dices = 8;\nconst int num_coordinates = 8;\nconst int num_states = 24;\nstring puzzle[2][2][2];\nstring dice_states[num_dices][num_states];\nbool is_used[num_dices];\nunordered_map<char, char> face_to_face_map;\n\nstring roll_west(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[3];\n\t\tdice_str[3] = dice_str[0];\n\t\tdice_str[0] = dice_str[2];\n\t\tdice_str[2] = dice_str[5];\n\t\tdice_str[5] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring roll_north(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[5];\n\t\tdice_str[5] = dice_str[4];\n\t\tdice_str[4] = dice_str[0];\n\t\tdice_str[0] = dice_str[1];\n\t\tdice_str[1] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring rotate_right(string dice_str, int num_rotates) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rotates; i++) {\n\t\ttmp = dice_str[1];\n\t\tdice_str[1] = dice_str[2];\n\t\tdice_str[2] = dice_str[4];\n\t\tdice_str[4] = dice_str[3];\n\t\tdice_str[3] = tmp;\n\t}\n\treturn dice_str;\n}\n\nbool input() {\n\tstring buf, str0, str1;\n\tfor (int i = 0; i < num_dices; i++) {\n\t\tcin >> buf;\n\t\tif (buf == \"0\") {\n\t\t\treturn false;\n\t\t}\n\t\tint state_idx = 0;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4) {\n\t\t\t\tstr0 = roll_west(buf, j);\n\t\t\t} else if (j == 4) {\n\t\t\t\tstr0 = roll_north(buf, 1);\n\t\t\t} else {\n\t\t\t\tstr0 = roll_north(buf, 3);\n\t\t\t}\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr1 = rotate_right(str0, k);\n\t\t\t\tdice_states[i][state_idx++] = str1;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool backtrack(int coordinate_idx) {\n\tif (coordinate_idx == num_coordinates) {\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\tfor (int dice_idx = 0; dice_idx < num_dices; dice_idx++) {\n\t\tif (is_used[dice_idx]) {\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int state_idx = 0; state_idx < num_states; state_idx++) {\n\t\t\tif (x > 0) {\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][3];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0) {\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][0];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0) {\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][1];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[dice_idx] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[dice_idx][state_idx];\n\t\t\tif (backtrack(coordinate_idx + 1)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[dice_idx] = false;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor (int i = 0; i < num_alphabets; i++) {\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++) {\n\t\t\tis_used[i] = false;\n\t\t}\n\n\t\tif (backtrack(0)) {\n\t\t\tcout << \"YES\" << endl;\n\t\t} else {\n\t\t\tcout << \"NO\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 780,
"memory_kb": 3104,
"score_of_the_acc": -0.3845,
"final_rank": 7
},
{
"submission_id": "aoj_0171_5620728",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nconst int num_alphabets = 27;\nconst int num_dices = 8;\nconst int num_coordinates = 8;\nconst int num_states = 24;\nstring puzzle[2][2][2];\nstring dice_states[num_dices][num_states];\nbool is_used[num_dices];\nunordered_map<char, char> face_to_face_map;\n\nstring roll_west(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[3];\n\t\tdice_str[3] = dice_str[0];\n\t\tdice_str[0] = dice_str[2];\n\t\tdice_str[2] = dice_str[5];\n\t\tdice_str[5] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring roll_north(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[5];\n\t\tdice_str[5] = dice_str[4];\n\t\tdice_str[4] = dice_str[0];\n\t\tdice_str[0] = dice_str[1];\n\t\tdice_str[1] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring rotate_right(string dice_str, int num_rotates) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rotates; i++) {\n\t\ttmp = dice_str[1];\n\t\tdice_str[1] = dice_str[2];\n\t\tdice_str[2] = dice_str[4];\n\t\tdice_str[4] = dice_str[3];\n\t\tdice_str[3] = tmp;\n\t}\n\treturn dice_str;\n}\n\nbool input() {\n\tstring buf, str0, str1;\n\tfor (int i = 0; i < num_dices; i++) {\n\t\tcin >> buf;\n\t\tif (buf == \"0\")\n\t\t\treturn false;\n\t\tint state_idx = 0;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr0 = roll_west(buf, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr0 = roll_north(buf, 1);\n\t\t\telse\n\t\t\t\tstr0 = roll_north(buf, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr1 = rotate_right(str0, k);\n\t\t\t\tdice_states[i][state_idx++] = str1;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool backtrack(int coordinate_idx){\n\tif(coordinate_idx == num_coordinates){\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\tfor(int dice_idx = 0; dice_idx < num_dices; dice_idx++){\n\t\tif(is_used[dice_idx]){\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int state_idx = 0; state_idx < num_states; state_idx++){\n\t\t\tif(x > 0){\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][3];\n\t\t\t\tif(face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(y > 0){\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][0];\n\t\t\t\tif(face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(z > 0){\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][1];\n\t\t\t\tif(face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[dice_idx] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[dice_idx][state_idx];\n\t\t\tif(backtrack(coordinate_idx + 1)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[dice_idx] = false;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool dfs(int coordinate_idx) {\n\tif (coordinate_idx == num_coordinates) {\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\tfor (int dice_idx = 0; dice_idx < num_dices; dice_idx++) {\n\t\tif (is_used[dice_idx])\n\t\t\tcontinue;\n\t\tfor (int state_idx = 0; state_idx < num_states; state_idx++) {\n\t\t\tif (x > 0) {\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][3];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0) {\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][0];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0) {\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][1];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[dice_idx] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[dice_idx][state_idx];\n\t\t\tif (dfs(coordinate_idx + 1)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[dice_idx] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor (int i = 0; i < num_alphabets; i++) {\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (backtrack(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 760,
"memory_kb": 3220,
"score_of_the_acc": -0.7366,
"final_rank": 15
},
{
"submission_id": "aoj_0171_5620712",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nconst int num_alphabets = 27;\nconst int num_dices = 8;\nconst int num_coordinates = 8;\nconst int num_states = 24;\nstring puzzle[2][2][2];\nstring dice_states[num_dices][num_states];\nbool is_used[num_dices];\nunordered_map<char, char> face_to_face_map;\n\nstring roll_west(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[3];\n\t\tdice_str[3] = dice_str[0];\n\t\tdice_str[0] = dice_str[2];\n\t\tdice_str[2] = dice_str[5];\n\t\tdice_str[5] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring roll_north(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[5];\n\t\tdice_str[5] = dice_str[4];\n\t\tdice_str[4] = dice_str[0];\n\t\tdice_str[0] = dice_str[1];\n\t\tdice_str[1] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring rotate_right(string dice_str, int num_rotates) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rotates; i++) {\n\t\ttmp = dice_str[1];\n\t\tdice_str[1] = dice_str[2];\n\t\tdice_str[2] = dice_str[4];\n\t\tdice_str[4] = dice_str[3];\n\t\tdice_str[3] = tmp;\n\t}\n\treturn dice_str;\n}\n\nbool input() {\n\tstring buf, str0, str1;\n\tfor (int i = 0; i < num_dices; i++) {\n\t\tcin >> buf;\n\t\tif (buf == \"0\")\n\t\t\treturn false;\n\t\tint state_idx = 0;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr0 = roll_west(buf, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr0 = roll_north(buf, 1);\n\t\t\telse\n\t\t\t\tstr0 = roll_north(buf, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr1 = rotate_right(str0, k);\n\t\t\t\tdice_states[i][state_idx++] = str1;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool backtrack(int coordinate_idx){\n\tif(coordinate_idx == num_coordinates){\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\tfor(int dice_idx = 0; dice_idx < num_dices; dice_idx++){\n\t\tif(is_used[dice_idx]){\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int state_idx = 0; state_idx < num_states; state_idx++){\n\t\t\tstd::string dice1 = dice_states[dice_idx][state_idx];\n\n\t\t\tif(x > 0){\n\t\t\t\tstd::string dice0 = puzzle[x - 1][y][z];\n\t\t\t\tint face0 = 2;\n\t\t\t\tint face1 = 3;\n\t\t\t\tchar str_face0 = dice0[face0];\n\t\t\t\tchar str_face1 = dice1[face1];\n\t\t\t\tif(face_to_face_map[str_face0] != str_face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(y > 0){\n\t\t\t\tstd::string dice0 = puzzle[x][y - 1][z];\n\t\t\t\tint face0 = 5;\n\t\t\t\tint face1 = 0;\n\t\t\t\tchar str_face0 = dice0[face0];\n\t\t\t\tchar str_face1 = dice1[face1];\n\t\t\t\tif(face_to_face_map[str_face0] != str_face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(z > 0){\n\t\t\t\tstd::string dice0 = puzzle[x][y][z - 1];\n\t\t\t\tint face0 = 4;\n\t\t\t\tint face1 = 1;\n\t\t\t\tchar str_face0 = dice0[face0];\n\t\t\t\tchar str_face1 = dice1[face1];\n\t\t\t\tif(face_to_face_map[str_face0] != str_face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tpuzzle[x][y][z] = dice1;\n\t\t\tis_used[dice_idx] = true;\n\t\t\tif(backtrack(coordinate_idx + 1)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[dice_idx] = false;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool dfs(int coordinate_idx) {\n\tif (coordinate_idx == num_coordinates) {\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\tfor (int dice_idx = 0; dice_idx < num_dices; dice_idx++) {\n\t\tif (is_used[dice_idx])\n\t\t\tcontinue;\n\t\tfor (int state_idx = 0; state_idx < num_states; state_idx++) {\n\t\t\tif (x > 0) {\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][3];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0) {\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][0];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0) {\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][1];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[dice_idx] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[dice_idx][state_idx];\n\t\t\tif (dfs(coordinate_idx + 1)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[dice_idx] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor (int i = 0; i < num_alphabets; i++) {\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 780,
"memory_kb": 3056,
"score_of_the_acc": -0.2363,
"final_rank": 4
},
{
"submission_id": "aoj_0171_5620593",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nconst int num_alphabets = 27;\nconst int num_dices = 8;\nconst int num_coordinates = 8;\nconst int num_states = 24;\nstring puzzle[2][2][2];\nstring dice_states[num_dices][num_states];\nbool is_used[8];\nunordered_map<char, char> face_to_face_map;\n\nstring roll_west(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[3];\n\t\tdice_str[3] = dice_str[0];\n\t\tdice_str[0] = dice_str[2];\n\t\tdice_str[2] = dice_str[5];\n\t\tdice_str[5] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring roll_north(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[5];\n\t\tdice_str[5] = dice_str[4];\n\t\tdice_str[4] = dice_str[0];\n\t\tdice_str[0] = dice_str[1];\n\t\tdice_str[1] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring rotate_right(string dice_str, int num_rotates) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rotates; i++) {\n\t\ttmp = dice_str[1];\n\t\tdice_str[1] = dice_str[2];\n\t\tdice_str[2] = dice_str[4];\n\t\tdice_str[4] = dice_str[3];\n\t\tdice_str[3] = tmp;\n\t}\n\treturn dice_str;\n}\n\nbool input() {\n\tstring buf, str0, str1;\n\tfor (int i = 0; i < num_dices; i++) {\n\t\tcin >> buf;\n\t\tif (buf == \"0\")\n\t\t\treturn false;\n\t\tint state_idx = 0;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr0 = roll_west(buf, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr0 = roll_north(buf, 1);\n\t\t\telse\n\t\t\t\tstr0 = roll_north(buf, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr1 = rotate_right(str0, k);\n\t\t\t\tdice_states[i][state_idx++] = str1;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool dfs(int coordinate_idx) {\n\tif (coordinate_idx == num_coordinates) {\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\tfor (int dice_idx = 0; dice_idx < num_dices; dice_idx++) {\n\t\tif (is_used[dice_idx])\n\t\t\tcontinue;\n\t\tfor (int state_idx = 0; state_idx < num_states; state_idx++) {\n\t\t\tif (x > 0) {\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][3];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0) {\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][0];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0) {\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][1];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[dice_idx] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[dice_idx][state_idx];\n\t\t\tif (dfs(coordinate_idx + 1)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[dice_idx] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor (int i = 0; i < num_alphabets; i++) {\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 780,
"memory_kb": 3236,
"score_of_the_acc": -0.7919,
"final_rank": 16
},
{
"submission_id": "aoj_0171_5620574",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nconst int num_alphabets = 27;\nconst int num_dices = 8;\nconst int num_coordinates = 8;\nconst int num_states_per_dice = 24;\nstring puzzle[2][2][2];\nstring dice_states[num_dices][num_states_per_dice];\nbool is_used[8];\nunordered_map<char, char> face_to_face_map;\n\nstring roll_west(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[3];\n\t\tdice_str[3] = dice_str[0];\n\t\tdice_str[0] = dice_str[2];\n\t\tdice_str[2] = dice_str[5];\n\t\tdice_str[5] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring roll_north(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[5];\n\t\tdice_str[5] = dice_str[4];\n\t\tdice_str[4] = dice_str[0];\n\t\tdice_str[0] = dice_str[1];\n\t\tdice_str[1] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring rotate_right(string dice_str, int num_rotates) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rotates; i++) {\n\t\ttmp = dice_str[1];\n\t\tdice_str[1] = dice_str[2];\n\t\tdice_str[2] = dice_str[4];\n\t\tdice_str[4] = dice_str[3];\n\t\tdice_str[3] = tmp;\n\t}\n\treturn dice_str;\n}\n\nbool input() {\n\tstring buf, str0, str1;\n\tfor (int i = 0; i < num_dices; i++) {\n\t\tcin >> buf;\n\t\tif (buf == \"0\")\n\t\t\treturn false;\n\t\tint state_idx = 0;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr0 = roll_west(buf, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr0 = roll_north(buf, 1);\n\t\t\telse\n\t\t\t\tstr0 = roll_north(buf, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr1 = rotate_right(str0, k);\n\t\t\t\tdice_states[i][state_idx++] = str1;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool dfs(int coordinate_idx) {\n\tif (coordinate_idx == num_coordinates) {\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\tfor (int dice_idx = 0; dice_idx < num_dices; dice_idx++) {\n\t\tif (is_used[dice_idx])\n\t\t\tcontinue;\n\t\tfor (int state_idx = 0; state_idx < num_states_per_dice; state_idx++) {\n\t\t\tif (x > 0) {\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][3];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0) {\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][0];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0) {\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][1];\n\t\t\t\tif (face_to_face_map[face0] != face1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[dice_idx] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[dice_idx][state_idx];\n\t\t\tif (dfs(coordinate_idx + 1)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[dice_idx] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor (int i = 0; i < num_alphabets; i++) {\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 780,
"memory_kb": 3104,
"score_of_the_acc": -0.3845,
"final_rank": 7
},
{
"submission_id": "aoj_0171_5620552",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nconst int num_alphabets = 27;\nconst int num_dices = 8;\nconst int num_coordinates = 8;\nconst int num_states_per_dice = 24;\nstring puzzle[2][2][2];\nstring dice_states[num_dices][num_states_per_dice];\nbool is_used[8];\nunordered_map<char, char> face_to_face_map;\n\n\nstring roll_west(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[3];\n\t\tdice_str[3] = dice_str[0];\n\t\tdice_str[0] = dice_str[2];\n\t\tdice_str[2] = dice_str[5];\n\t\tdice_str[5] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring roll_north(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[5];\n\t\tdice_str[5] = dice_str[4];\n\t\tdice_str[4] = dice_str[0];\n\t\tdice_str[0] = dice_str[1];\n\t\tdice_str[1] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring rotate_right(string dice_str, int num_rotates) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rotates; i++) {\n\t\ttmp = dice_str[1];\n\t\tdice_str[1] = dice_str[2];\n\t\tdice_str[2] = dice_str[4];\n\t\tdice_str[4] = dice_str[3];\n\t\tdice_str[3] = tmp;\n\t}\n\treturn dice_str;\n}\n\nbool input() {\n\tstring in, str, str2;\n\tfor (int i = 0; i < num_dices; i++) {\n\t\tcin >> in;\n\t\tif (in == \"0\")\n\t\t\treturn false;\n\t\tint n = 0;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr = roll_west(in, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr = roll_north(in, 1);\n\t\t\telse\n\t\t\t\tstr = roll_north(in, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr2 = rotate_right(str, k);\n\t\t\t\tdice_states[i][n++] = str2;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool dfs(int coordinate_idx) {\n\tif(coordinate_idx == num_coordinates){\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\n\tfor (int dice_idx = 0; dice_idx < num_dices; dice_idx++) {\n\t\tif (is_used[dice_idx])\n\t\t\tcontinue;\n\t\tfor (int state_idx = 0; state_idx < num_states_per_dice; state_idx++) {\n\t\t\tif (x > 0){\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][3];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0){\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][0];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0){\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[dice_idx][state_idx][1];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[dice_idx] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[dice_idx][state_idx];\n\t\t\tif(dfs(coordinate_idx + 1)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[dice_idx] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor(int i = 0; i < num_alphabets; i++){\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 780,
"memory_kb": 3256,
"score_of_the_acc": -0.8536,
"final_rank": 17
},
{
"submission_id": "aoj_0171_5620528",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nconst int num_alphabets = 27;\nconst int num_dices = 8;\nconst int num_coordinates = 8;\nconst int num_states_per_dice = 24;\nstring puzzle[2][2][2];\nstring dice_states[192];\nbool is_used[8];\nunordered_map<char, char> face_to_face_map;\n\n\nstring roll_west(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[3];\n\t\tdice_str[3] = dice_str[0];\n\t\tdice_str[0] = dice_str[2];\n\t\tdice_str[2] = dice_str[5];\n\t\tdice_str[5] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring roll_north(string dice_str, int num_rolls) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rolls; i++) {\n\t\ttmp = dice_str[5];\n\t\tdice_str[5] = dice_str[4];\n\t\tdice_str[4] = dice_str[0];\n\t\tdice_str[0] = dice_str[1];\n\t\tdice_str[1] = tmp;\n\t}\n\treturn dice_str;\n}\n\nstring rotate_right(string dice_str, int num_rotates) {\n\tchar tmp;\n\tfor (int i = 0; i < num_rotates; i++) {\n\t\ttmp = dice_str[1];\n\t\tdice_str[1] = dice_str[2];\n\t\tdice_str[2] = dice_str[4];\n\t\tdice_str[4] = dice_str[3];\n\t\tdice_str[3] = tmp;\n\t}\n\treturn dice_str;\n}\n\nbool input() {\n\tstring in, str, str2;\n\tint n = 0;\n\tfor (int i = 0; i < num_dices; i++) {\n\t\tcin >> in;\n\t\tif (in == \"0\")\n\t\t\treturn false;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr = roll_west(in, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr = roll_north(in, 1);\n\t\t\telse\n\t\t\t\tstr = roll_north(in, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr2 = rotate_right(str, k);\n\t\t\t\tdice_states[n++] = str2;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool dfs(int coordinate_idx) {\n\tif(coordinate_idx == num_coordinates){\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\n\tfor (int j = 0; j < num_dices; j++) {\n\t\tif (is_used[j])\n\t\t\tcontinue;\n\t\tfor (int i = j * num_states_per_dice; i < j * num_states_per_dice + num_states_per_dice; i++) {\n\t\t\tif (x > 0){\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[i][3];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0){\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[i][0];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0){\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[i][1];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[j] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[i];\n\t\t\tif(dfs(coordinate_idx + 1)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[j] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor(int i = 0; i < num_alphabets; i++){\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 810,
"memory_kb": 3188,
"score_of_the_acc": -0.6526,
"final_rank": 12
},
{
"submission_id": "aoj_0171_5620504",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nconst int num_alphabets = 27;\nconst int num_dices = 8;\nconst int num_coordinates = 8;\nconst int num_states_per_dice = 24;\nstring puzzle[2][2][2];\nstring dice_states[192];\nbool is_used[8];\nunordered_map<char, char> face_to_face_map;\n\nbool input();\nstring roll_west(string, int);\nstring roll_north(string, int);\nstring rotate_right(string, int);\nbool dfs(int);\n\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor(int i = 0; i < num_alphabets; i++){\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}\n\nbool dfs(int coordinate_idx) {\n\tif(coordinate_idx == num_coordinates){\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\n\tfor (int j = 0; j < num_dices; j++) {\n\t\tif (is_used[j])\n\t\t\tcontinue;\n\t\tfor (int i = j * num_states_per_dice; i < j * num_states_per_dice + num_states_per_dice; i++) {\n\t\t\tif (x > 0){\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[i][3];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0){\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[i][0];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0){\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[i][1];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[j] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[i];\n\t\t\tif(dfs(coordinate_idx + 1)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[j] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool input() {\n\tstring in, str, str2;\n\tint n = 0;\n\tfor (int i = 0; i < num_dices; i++) {\n\t\tcin >> in;\n\t\tif (in == \"0\")\n\t\t\treturn false;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr = roll_west(in, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr = roll_north(in, 1);\n\t\t\telse\n\t\t\t\tstr = roll_north(in, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr2 = rotate_right(str, k);\n\t\t\t\tdice_states[n++] = str2;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nstring roll_west(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[3];\n\t\tstr[3] = str[0];\n\t\tstr[0] = str[2];\n\t\tstr[2] = str[5];\n\t\tstr[5] = tmp;\n\t}\n\treturn str;\n}\nstring roll_north(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[5];\n\t\tstr[5] = str[4];\n\t\tstr[4] = str[0];\n\t\tstr[0] = str[1];\n\t\tstr[1] = tmp;\n\t}\n\treturn str;\n}\nstring rotate_right(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[1];\n\t\tstr[1] = str[2];\n\t\tstr[2] = str[4];\n\t\tstr[4] = str[3];\n\t\tstr[3] = tmp;\n\t}\n\treturn str;\n}",
"accuracy": 1,
"time_ms": 810,
"memory_kb": 3144,
"score_of_the_acc": -0.5168,
"final_rank": 11
},
{
"submission_id": "aoj_0171_5620488",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nstring puzzle[2][2][2];\nstring dice_states[192];\nbool is_used[8];\nunordered_map<char, char> face_to_face_map;\n\nconst int num_alphabet = 27;\nint checkch = 'A' - 'a';\n\nbool input();\nstring roll_west(string, int);\nstring roll_north(string, int);\nstring rotate_right(string, int);\nbool dfs(int);\n\ninline bool check_ch(char x, char y) {\n\treturn (x + checkch == y || x - checkch == y);\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor(int i = 0; i < num_alphabet; i++){\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}\n\nbool dfs(int coordinate_idx) {\n\tif(coordinate_idx == 8){\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\n\tfor (int j = 0; j < 8; j++) {\n\t\tif (is_used[j])\n\t\t\tcontinue;\n\t\tfor (int i = j * 24; i < j * 24 + 24; i++) {\n\t\t\tif (x > 0){\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[i][3];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0){\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][5];\n\t\t\t\tchar face1 = dice_states[i][0];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0){\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][4];\n\t\t\t\tchar face1 = dice_states[i][1];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[j] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[i];\n\t\t\tif(dfs(coordinate_idx + 1)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[j] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool input() {\n\tstring in, str, str2;\n\tint n = 0;\n\tfor (int i = 0; i < 8; i++) {\n\t\tcin >> in;\n\t\tif (in == \"0\")\n\t\t\treturn false;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr = roll_west(in, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr = roll_north(in, 1);\n\t\t\telse\n\t\t\t\tstr = roll_north(in, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr2 = rotate_right(str, k);\n\t\t\t\tdice_states[n++] = str2;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nstring roll_west(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[3];\n\t\tstr[3] = str[0];\n\t\tstr[0] = str[2];\n\t\tstr[2] = str[5];\n\t\tstr[5] = tmp;\n\t}\n\treturn str;\n}\nstring roll_north(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[5];\n\t\tstr[5] = str[4];\n\t\tstr[4] = str[0];\n\t\tstr[0] = str[1];\n\t\tstr[1] = tmp;\n\t}\n\treturn str;\n}\nstring rotate_right(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[1];\n\t\tstr[1] = str[2];\n\t\tstr[2] = str[4];\n\t\tstr[4] = str[3];\n\t\tstr[3] = tmp;\n\t}\n\treturn str;\n}",
"accuracy": 1,
"time_ms": 810,
"memory_kb": 3052,
"score_of_the_acc": -0.2329,
"final_rank": 3
},
{
"submission_id": "aoj_0171_5620472",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nstring puzzle[2][2][2];\nstring dice_states[192];\nbool is_used[8];\nunordered_map<char, char> face_to_face_map;\n\nconst int num_alphabet = 27;\nint checkch = 'A' - 'a';\n\nbool input();\nstring roll_west(string, int);\nstring roll_north(string, int);\nstring rotate_right(string, int);\nbool dfs(int);\n\ninline bool check_ch(char x, char y) {\n\treturn (x + checkch == y || x - checkch == y);\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor(int i = 0; i < num_alphabet; i++){\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}\n\nbool dfs(int coordinate_idx) {\n\tif(coordinate_idx == 8){\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\n\tfor (int j = 0; j < 8; j++) {\n\t\tif (is_used[j])\n\t\t\tcontinue;\n\t\tfor (int i = j * 24; i < j * 24 + 24; i++) {\n\t\t\tif (x > 0){\n\t\t\t\tchar face0 = puzzle[x - 1][y][z][2];\n\t\t\t\tchar face1 = dice_states[i][3];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0){\n\t\t\t\tchar face0 = puzzle[x][y - 1][z][4];\n\t\t\t\tchar face1 = dice_states[i][1];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0){\n\t\t\t\tchar face0 = puzzle[x][y][z - 1][0];\n\t\t\t\tchar face1 = dice_states[i][5];\n\t\t\t\tif (face_to_face_map[face0] != face1){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[j] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[i];\n\t\t\tif(dfs(coordinate_idx + 1)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[j] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool input() {\n\tstring in, str, str2;\n\tint n = 0;\n\tfor (int i = 0; i < 8; i++) {\n\t\tcin >> in;\n\t\tif (in == \"0\")\n\t\t\treturn false;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr = roll_west(in, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr = roll_north(in, 1);\n\t\t\telse\n\t\t\t\tstr = roll_north(in, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr2 = rotate_right(str, k);\n\t\t\t\tdice_states[n++] = str2;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nstring roll_west(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[3];\n\t\tstr[3] = str[0];\n\t\tstr[0] = str[2];\n\t\tstr[2] = str[5];\n\t\tstr[5] = tmp;\n\t}\n\treturn str;\n}\nstring roll_north(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[5];\n\t\tstr[5] = str[4];\n\t\tstr[4] = str[0];\n\t\tstr[0] = str[1];\n\t\tstr[1] = tmp;\n\t}\n\treturn str;\n}\nstring rotate_right(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[1];\n\t\tstr[1] = str[2];\n\t\tstr[2] = str[4];\n\t\tstr[4] = str[3];\n\t\tstr[3] = tmp;\n\t}\n\treturn str;\n}",
"accuracy": 1,
"time_ms": 810,
"memory_kb": 3088,
"score_of_the_acc": -0.344,
"final_rank": 5
},
{
"submission_id": "aoj_0171_5620462",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nstring puzzle[2][2][2];\nstring dice_states[192];\nbool is_used[8];\nunordered_map<char, char> face_to_face_map;\n\nconst int num_alphabet = 27;\nint checkch = 'A' - 'a';\n\nbool input();\nstring roll_west(string, int);\nstring roll_north(string, int);\nstring rotate_right(string, int);\nbool dfs(int);\n\ninline bool check_ch(char x, char y) {\n\treturn (x + checkch == y || x - checkch == y);\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\tfor(int i = 0; i < num_alphabet; i++){\n\t\tface_to_face_map[i + 'a'] = i + 'A';\n\t\tface_to_face_map[i + 'A'] = i + 'a';\n\t}\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tif (dfs(0))\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}\n\nbool dfs(int coordinate_idx) {\n\tif(coordinate_idx == 8){\n\t\treturn true;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\n\tfor (int j = 0; j < 8; j++) {\n\t\tif (is_used[j])\n\t\t\tcontinue;\n\t\tfor (int i = j * 24; i < j * 24 + 24; i++) {\n\t\t\tif (x > 0){\n\t\t\t\tif (check_ch(puzzle[x - 1][y][z][2], dice_states[i][3]) == false){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (y > 0){\n\t\t\t\tif (check_ch(puzzle[x][y - 1][z][4], dice_states[i][1]) == false){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (z > 0){\n\t\t\t\tif (check_ch(puzzle[x][y][z - 1][0], dice_states[i][5]) == false){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tis_used[j] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[i];\n\t\t\tif(dfs(coordinate_idx + 1)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tis_used[j] = false;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool input() {\n\tstring in, str, str2;\n\tint n = 0;\n\tfor (int i = 0; i < 8; i++) {\n\t\tcin >> in;\n\t\tif (in == \"0\")\n\t\t\treturn false;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr = roll_west(in, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr = roll_north(in, 1);\n\t\t\telse\n\t\t\t\tstr = roll_north(in, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr2 = rotate_right(str, k);\n\t\t\t\tdice_states[n++] = str2;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nstring roll_west(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[3];\n\t\tstr[3] = str[0];\n\t\tstr[0] = str[2];\n\t\tstr[2] = str[5];\n\t\tstr[5] = tmp;\n\t}\n\treturn str;\n}\nstring roll_north(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[5];\n\t\tstr[5] = str[4];\n\t\tstr[4] = str[0];\n\t\tstr[0] = str[1];\n\t\tstr[1] = tmp;\n\t}\n\treturn str;\n}\nstring rotate_right(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[1];\n\t\tstr[1] = str[2];\n\t\tstr[2] = str[4];\n\t\tstr[4] = str[3];\n\t\tstr[3] = tmp;\n\t}\n\treturn str;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 3176,
"score_of_the_acc": -0.4376,
"final_rank": 9
},
{
"submission_id": "aoj_0171_5620453",
"code_snippet": "#include <iostream>\n#include <algorithm>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nstring puzzle[2][2][2];\nstring dice_states[192];\nbool is_used[8];\nint n, flg;\n\nint checkch = 'A' - 'a';\n\nbool input();\nstring roll_west(string, int);\nstring roll_north(string, int);\nstring rotate_right(string, int);\nvoid dfs(int);\n\ninline bool check_ch(char x, char y) {\n\treturn (x + checkch == y || x - checkch == y);\n}\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (input()) {\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tis_used[i] = false;\n\n\t\tflg = 0;\n\t\tdfs(0);\n\t\tif (flg)\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n\treturn 0;\n}\n\nvoid dfs(int coordinate_idx) {\n\tif(coordinate_idx == 8){\n\t\tflg = 1;\n\t\treturn;\n\t}\n\tint z = coordinate_idx / 4;\n\tint y = (coordinate_idx % 4) / 2;\n\tint x = (coordinate_idx % 4) % 2;\n\n\n\tfor (int j = 0; j < 8; j++) {\n\t\tif (is_used[j])\n\t\t\tcontinue;\n\t\tfor (int i = j * 24; i < j * 24 + 24; i++) {\n\t\t\tif (flg)\n\t\t\t\treturn;\n\t\t\tif (x > 0)\n\t\t\t\tif (check_ch(puzzle[x - 1][y][z][2], dice_states[i][3]) == false)\n\t\t\t\t\tcontinue;\n\t\t\tif (y > 0)\n\t\t\t\tif (check_ch(puzzle[x][y - 1][z][4], dice_states[i][1]) == false)\n\t\t\t\t\tcontinue;\n\t\t\tif (z > 0)\n\t\t\t\tif (check_ch(puzzle[x][y][z - 1][0], dice_states[i][5]) == false)\n\t\t\t\t\tcontinue;\n\n\t\t\tis_used[j] = true;\n\t\t\tpuzzle[x][y][z] = dice_states[i];\n\t\t\tdfs(coordinate_idx + 1);\n\t\t\tis_used[j] = false;\n\t\t}\n\t}\n}\n\nbool input() {\n\tstring in, str, str2;\n\tn = 0;\n\tfor (int i = 0; i < 8; i++) {\n\t\tcin >> in;\n\t\tif (in == \"0\")\n\t\t\treturn false;\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (j < 4)\n\t\t\t\tstr = roll_west(in, j);\n\t\t\telse if (j == 4)\n\t\t\t\tstr = roll_north(in, 1);\n\t\t\telse\n\t\t\t\tstr = roll_north(in, 3);\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tstr2 = rotate_right(str, k);\n\t\t\t\tdice_states[n++] = str2;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nstring roll_west(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[3];\n\t\tstr[3] = str[0];\n\t\tstr[0] = str[2];\n\t\tstr[2] = str[5];\n\t\tstr[5] = tmp;\n\t}\n\treturn str;\n}\nstring roll_north(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[5];\n\t\tstr[5] = str[4];\n\t\tstr[4] = str[0];\n\t\tstr[0] = str[1];\n\t\tstr[1] = tmp;\n\t}\n\treturn str;\n}\nstring rotate_right(string str, int x) {\n\tchar tmp;\n\tfor (int i = 0; i < x; i++) {\n\t\ttmp = str[1];\n\t\tstr[1] = str[2];\n\t\tstr[2] = str[4];\n\t\tstr[4] = str[3];\n\t\tstr[3] = tmp;\n\t}\n\treturn str;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 3184,
"score_of_the_acc": -0.4622,
"final_rank": 10
},
{
"submission_id": "aoj_0171_5620358",
"code_snippet": "#include<iostream>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\nstring t[2][2][2];\nstring u[192];\nbool used[8];\nint n,flg;\n\nint checkch='A'-'a';\n\nbool input();\nstring ra(string,int);\nstring rb(string,int);\nstring rc(string,int);\nvoid dfs(int,int,int);\n\ninline bool check_ch(char x,char y){\n return (x+checkch==y||x-checkch==y);\n}\n\nint main(){\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n while(input()){\n for(int i=0;i<8;i++)used[i]=false;\n\n flg=0;\n dfs(0,0,0);\n if(flg)cout<<\"YES\"<<endl;\n else cout<<\"NO\"<<endl;\n }\n return 0;\n}\n\nvoid dfs(int x,int y,int z){\n //cout<<x<<' '<<y<<' '<<z<<endl;\n if(x==2){x=0;y++;}\n if(y==2){y=0;z++;}\n if(x==0&&y==0&&z==2)flg=1;\n\n for(int j=0;j<8;j++){\n if(used[j])continue;\n for(int i=j*24;i<j*24+24;i++){\n if(flg)return;\n if(x>0)if(check_ch(t[x-1][y][z][2],u[i][3])==false)continue;\n if(y>0)if(check_ch(t[x][y-1][z][4],u[i][1])==false)continue;\n if(z>0)if(check_ch(t[x][y][z-1][0],u[i][5])==false)continue;\n\n used[j]=true;\n t[x][y][z]=u[i];\n dfs(x+1,y,z);\n used[j]=false;\n }\n }\n}\n\nbool input(){\n string in,str,str2;\n n=0;\n for(int i=0;i<8;i++){\n cin>>in;if(in==\"0\")return false;\n for(int j=0;j<6;j++){\n if(j<4)str=ra(in,j);\n else if(j==4)str=rb(in,1);\n else str=rb(in,3);\n for(int k=0;k<4;k++){\n\tstr2=rc(str,k);\n\tu[n++]=str2;\n }\n }\n }\n return true;\n}\n\nstring ra(string str,int x){\n char tmp;\n for(int i=0;i<x;i++){\n tmp=str[3];\n str[3]=str[0];\n str[0]=str[2];\n str[2]=str[5];\n str[5]=tmp;\n }\n return str;\n}\nstring rb(string str,int x){\n char tmp;\n for(int i=0;i<x;i++){\n tmp=str[5];\n str[5]=str[4];\n str[4]=str[0];\n str[0]=str[1];\n str[1]=tmp;\n }\n return str;\n}\nstring rc(string str,int x){\n char tmp;\n for(int i=0;i<x;i++){\n tmp=str[1];\n str[1]=str[2];\n str[2]=str[4];\n str[4]=str[3];\n str[3]=tmp;\n }\n return str;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3092,
"score_of_the_acc": -0.1872,
"final_rank": 2
},
{
"submission_id": "aoj_0171_5235877",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nvoid rot(vector<int> &v, int a, int b, int c, int d){\n swap(v[d], v[c]);\n swap(v[c], v[b]);\n swap(v[b], v[a]);\n}\nvoid turn(vector<int> &v, string s){\n if(s == \"North\") rot(v, 0, 3, 5, 1);\n if(s == \"East\") rot(v, 0, 2, 5, 4);\n if(s == \"South\") rot(v, 0, 1, 5, 3);\n if(s == \"West\") rot(v, 0, 4, 5, 2);\n if(s == \"Right\") rot(v, 1, 4, 3, 2);\n if(s == \"Left\") rot(v, 1, 2, 3, 4);\n}\nvector<vector<int>> rot24(vector<int> v){\n vector<vector<int>> res;\n for(int i=0; i<6; i++){\n for(int j=0; j<4; j++){\n res.push_back(v);\n turn(v, \"Left\"s);\n }\n if(i%2 == 0){\n turn(v, \"North\"s);\n }else{\n turn(v, \"East\"s);\n }\n }\n return res;\n}\n\nbool same_face(int a, int b){\n if(abs(a-b) == abs('A'-'a')) return true;\n if(a==0 or b==0) return true;\n return false;\n}\nbool check(vector<vector<int>> &a){\n int from[3][4] = {{0,2,4,6}, {0,1,4,5}, {0,1,2,3}};\n int diff[3] = {1,2,4};\n int face[3][2] = {{2,4}, {1,3}, {5,0}};\n for(int i=0; i<3; i++){\n for(int j=0; j<4; j++){\n if(!same_face(a[from[i][j]][face[i][0]], a[from[i][j]+diff[i]][face[i][1]])){\n return false;\n }\n }\n }\n return true;\n}\n\nbool dfs(int step, vector<bool> &used, vector<vector<int>> &state, vector<vector<vector<int>>> &dice){\n if(step == 8) return true;\n for(int i=0; i<8; i++){\n if(step==0 and i>0) break;\n if(used[i]) continue;\n used[i] = true;\n for(int j=0; j<24; j++){\n state[step] = dice[i][j];\n if(!check(state)) continue;\n bool ret = dfs(step+1, used, state, dice);\n if(ret) return true;\n }\n state[step] = vector<int>(6, 0);\n used[i] = false;\n }\n return false;\n}\n\nint main(){\n while(1){\n vector<string> s(8);\n cin >> s[0];\n if(s[0] == \"0\") break;\n\n for(int i=1; i<8; i++){\n cin >> s[i];\n }\n vector<vector<vector<int>>> dice;\n for(int i=0; i<8; i++){\n vector<int> a(6);\n for(int j=0; j<6; j++){\n a[j] = (int)s[i][j];\n }\n swap(a[3], a[4]);\n dice.push_back(rot24(a));\n }\n vector<vector<int>> state(8, vector<int>(6, 0));\n vector<bool> used(8, false);\n if(dfs(0, used, state, dice)){\n cout << \"YES\" << endl;\n }else{\n cout << \"NO\" << endl;\n }\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 3364,
"score_of_the_acc": -1,
"final_rank": 18
},
{
"submission_id": "aoj_0171_4971536",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define reps(i, s, n) for(ll i = (s); i < n; ++i)\n#define rep(i, n) reps(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n\nusing ll = long long;\nusing vec = vector<ll>;\nusing mat = vector<vec>;\n\nstruct Dice{\n int l, r, u, d, f, b;\n vector<int> val;\n\n void vtoi(){\n u = val[0]; f = val[1];\n r = val[2]; l = val[3];\n b = val[4]; d = val[5];\n }\n\n void itov(){\n val = {u, f, r, l, b, d};\n }\n\n void init(vector<int> v){\n rep(i, 6) val[i] = v[i];\n vtoi();\n }\n\n Dice(vector<int> v = {}) \n : val(6), l(0), r(0), f(0), b(0), u(0), d(0){\n if(v.size() == 6) init(v);\n }\n\n void RollN(){\n int temp = u;\n u = f; f = d; d = b; b = temp;\n //itov();\n }\n\n void RollE(){\n int temp = u;\n u = l; l = d; d = r; r = temp;\n //itov();\n }\n\n void RollS(){RollN(); RollN(); RollN(); }\n void RollW(){RollE(); RollE(); RollE(); }\n void RollL(){RollN(); RollE(); RollS(); }\n void RollR(){RollS(); RollE(); RollN(); }\n\n void print(){\n cout<<\"dice\\n\";\n cout<<l<<' '<<r<<' '<<u<<' '<<d<<' '<<f<<' '<<b<<endl;\n rep(i, 6) cout<<val[i]<<\" \\n\"[i == 5];\n }\n\n};\n\nbool judge(Dice &low, Dice &high, int i){\n if(i == 0) return low.r + high.l == 52;\n if(i == 1) return low.b + high.f == 52;\n return low.u + high.d == 52;\n}\n\nbool dfs(int n, vector<Dice> &ds){\n if(n == 8) return true;\n Dice &mine = ds[n];\n rep(_, 4){\n rep(__, 4){\n bool dfs_do = true;\n rep(i, 3){\n if((n>>i)&1){\n int last = n ^ (1<<i);\n if(!judge(ds[last], ds[n], i)) {\n dfs_do = false;\n break;\n }\n }\n }\n if(dfs_do) if(dfs(n + 1, ds)) return true;\n mine.RollL();\n }\n mine.RollN();\n }\n rep(_, 2){\n rep(__, 4){\n bool dfs_do = true;\n rep(i, 3){\n if((n>>i)&1){\n int last = n ^ (1<<i);\n if(!judge(ds[last], ds[n], i)) {\n dfs_do = false;\n break;\n }\n }\n }\n if(dfs_do) if(dfs(n + 1, ds)) return true;\n mine.RollE();\n }\n mine.RollN(); mine.RollN();\n }\n return false;\n}\n\nbool solve(vector<Dice> ds){\n vector<int> ord(8); \n iota(ALL(ord), 0);\n do{\n vector<Dice> sorted(0);\n rep(i, 8) sorted.push_back(ds[ord[i]]);\n if(dfs(0, sorted)) return true;\n }while(next_permutation(ALL(ord)));\n return false;\n}\n\nint main(){\n string S;\n while(cin>>S, S[0] != '0'){\n vector<Dice> ds(8);\n rep(i, 8){\n if(i) cin>>S;\n vector<int> state(6);\n rep(j, 6){\n state[j] = S[j] - 'A';\n if(state[j] < 0 || state[j] >= 26) state[j] = 52 - (S[j] - 'a');\n }\n ds[i].init(state);\n }\n cout<<(solve(ds) ? \"YES\" : \"NO\")<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 3520,
"memory_kb": 3332,
"score_of_the_acc": -1.9012,
"final_rank": 20
},
{
"submission_id": "aoj_0171_4439496",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n using P = array<int, 6>;\n vector<P> ps{{0,1,2,3,4,5},{0,2,4,1,3,5},{0,3,1,4,2,5},{0,4,3,2,1,5},{1,0,3,2,5,4},{1,2,0,5,3,4},{1,3,5,0,2,4},{1,5,2,3,0,4},{2,0,1,4,5,3},{2,1,5,0,4,3},{2,4,0,5,1,3},{2,5,4,1,0,3},{3,0,4,1,5,2},{3,1,0,5,4,2},{3,4,5,0,1,2},{3,5,1,4,0,2},{4,0,2,3,5,1},{4,2,5,0,3,1},{4,3,0,5,2,1},{4,5,3,2,0,1},{5,1,3,2,4,0},{5,2,1,4,3,0},{5,3,4,1,2,0},{5,4,2,3,1,0}};\n vector<string> v(8);\n while(cin >> v[0], v[0] != \"0\") {\n for (int i = 1; i < 8; ++i) cin >> v[i];\n vector<vector<string>> vv(8);\n array<char, 256> p;\n for (int i = 'a'; i <= 'z'; ++i) {\n p[i] = i-'a'+'A';\n p[i-'a'+'A'] = i;\n }\n for (int i = 0; i < 8; ++i) {\n for (int j = 0; j < ps.size(); ++j) {\n string a(6, ' ');\n for (int k = 0; k < 6; ++k) {\n a[k] = v[i][ps[j][k]];\n }\n vv[i].emplace_back(a);\n }\n }\n vector<string> ans;\n vector<int> selected(8, 0);\n\n auto f = [&](int cur, auto &&f) -> bool {\n if (cur == 8) return true;\n for (int i = 0; i < 8; ++i) {\n if (!selected[i]){\n selected[i] = 1;\n for (int j = 0; j < ps.size(); ++j) {\n int ok = 1;\n if(cur&1){\n if(p[ans[cur^1][1]] != vv[i][j][4]) ok = 0;\n }\n if(cur & 2){\n if(p[ans[cur^2][3]] != vv[i][j][2]) ok = 0;\n }\n if(cur & 4){\n if(p[ans[cur^4][0]] != vv[i][j][5]) ok = 0;\n }\n if(ok){\n ans.emplace_back(vv[i][j]);\n if(f(cur+1, f)) return true;\n ans.pop_back();\n }\n }\n selected[i] = 0;\n }\n }\n return false;\n };\n puts(f(0, f) ? \"YES\" : \"NO\");\n }\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 3228,
"score_of_the_acc": -0.6871,
"final_rank": 13
},
{
"submission_id": "aoj_0171_4302951",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nstring CubeInfo[8];\npair<int, int*> Selected[8];\nbool Used[8];\n//top front right left back bottom\nint RotateBase[24][6] = {\n\t{ 0,1,2,3,4,5 },{},{},{},\n\t{ 1,5,2,3,0,4 },{},{},{},\n\t{ 2,1,5,0,4,3 },{},{},{},\n\t{ 3,1,0,5,4,2 },{},{},{},\n\t{ 4,0,2,3,5,1 },{},{},{},\n\t{ 5,4,2,3,1,0 },{},{},{},\n};\n\n\nvoid fullRotateBase() {\n\tint tmp[6], num;\n\n\tfor (int i = 0; i < 21; i += 4) {\n\t\tfor (int j = 0; j < 6; ++j) {\n\t\t\ttmp[j] = RotateBase[i][j];\n\t\t}\n\t\tfor (int k = 1; k < 4; ++k) {\n\t\t\tnum = tmp[1];\n\t\t\ttmp[1] = tmp[3];\n\t\t\ttmp[3] = tmp[4];\n\t\t\ttmp[4] = tmp[2];\n\t\t\ttmp[2] = num;\n\t\t\tfor (int j = 0; j < 6; ++j) {\n\t\t\t\tRotateBase[i + k][j] = tmp[j];\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool checkSame(int dice1, int pos1, int dice2, int id, int pos2) {\n\tchar c1, c2;\n\n\tc1 = CubeInfo[Selected[dice1].first][Selected[dice1].second[pos1]];\n\tc2 = CubeInfo[dice2][RotateBase[id][pos2]];\n\n\tif (abs(c1 - c2) == 32) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint solve(int currentId) {\n\tbool flag;\n\n\tif (currentId == 8) {\n\t\treturn true;\n\t}\n\n\tfor (int i = 0; i < 8; ++i) {\n\t\tif (Used[i]) {\n\t\t\tcontinue;\n\t\t}\n\t\tUsed[i] = true;\n\t\tfor (int id = 0; id < 24; ++id) {\n\t\t\tflag = false;\n\t\t\t//cout << \"pos:\" << currentId << \" =(now_\" << i + 1 << \")_pattern:\" << setw(2) << id+1 << \" = \" << StrTmp[currentId] << endl;\n\t\t\tswitch (currentId)\n\t\t\t{\n\t\t\tcase 0:flag = true; break;\n\t\t\tcase 1:\n\t\t\t\tif (checkSame(0, 2, i, id, 3)) {\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tif (checkSame(0, 1, i, id, 4)) {\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tif (checkSame(1, 1, i, id, 4) && checkSame(2, 2, i, id, 3)) {\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tif (checkSame(0, 5, i, id, 0)) {\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 5:\n\t\t\t\tif (checkSame(1, 5, i, id, 0) && checkSame(4, 2, i, id, 3)) {\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 6:\n\t\t\t\tif (checkSame(2, 5, i, id, 0) && checkSame(4, 1, i, id, 4)) {\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 7:\n\t\t\t\tif (checkSame(3, 5, i, id, 0) && checkSame(5, 1, i, id, 4) && checkSame(6, 2, i, id, 3)) {\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tSelected[currentId] = make_pair(i, RotateBase[id]);\n\t\t\tif (flag && solve(currentId + 1)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tUsed[i] = false;\n\t}\n\treturn false;\n}\n\nint main() {\n\tint cnt;\n\tstring str;\n\n\tfullRotateBase();\n\tcnt = 0;\n\twhile (cin >> str, str[0] != '0') {\n\t\tCubeInfo[cnt] = str;\n\t\t++cnt;\n\t\twhile (cnt != 8) {\n\t\t\tcin >> str;\n\t\t\tCubeInfo[cnt] = str;\n\t\t\t++cnt;\n\t\t}\n\t\t//show:\n\t\t/*for (int i = 0; i < cnt; ++i) {\n\t\tcout << CubeInfo[i] << endl;\n\t\t}*/\n\t\tmemset(Used, false, sizeof(Used));\n\t\tmemset(Selected, 0, sizeof(Selected));\n\t\tif (solve(0)) {\n\t\t\tcout << \"YES\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"NO\" << endl;\n\t\t}\n\t\tcnt = 0;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 3140,
"score_of_the_acc": -0.365,
"final_rank": 6
},
{
"submission_id": "aoj_0171_3897647",
"code_snippet": "#include<iostream>\nusing namespace std;\nbool used[8];\nstring s[8];\nint A[8];\nbool ok(char a,char b){return (a^b)==32;}\nbool dfs(int id)\n{\n\tif(id==8)return true;\n\tfor(int i=0;i<8;i++)\n\t{\n\t\tif(used[i])continue;\n\t\tused[i]=true;\n\t\tA[id]=i;\n\t\tfor(int r=0;r<8;r++)\n\t\t{\n\t\t\tfor(int rr=0;rr<4;rr++)\n\t\t\t{\n\t\t\t\tbool check=true;\n\t\t\t\tif(id==0);\n\t\t\t\telse if(id==1)check=ok(s[A[0]][4],s[i][1]);\n\t\t\t\telse if(id==2)check=ok(s[A[0]][2],s[i][3]);\n\t\t\t\telse if(id==3)check=ok(s[A[1]][2],s[i][3])&&ok(s[A[2]][4],s[i][1]);\n\t\t\t\telse if(id==4)check=ok(s[A[0]][5],s[i][0]);\n\t\t\t\telse if(id==5)check=ok(s[A[1]][5],s[i][0])&&ok(s[A[4]][4],s[i][1]);\n\t\t\t\telse if(id==6)check=ok(s[A[2]][5],s[i][0])&&ok(s[A[4]][2],s[i][3]);\n\t\t\t\telse if(id==7)check=ok(s[A[3]][5],s[i][0])&&ok(s[A[5]][2],s[i][3])&&ok(s[A[6]][4],s[i][1]);\n\t\t\t\tif(check)\n\t\t\t\t{\n\t\t\t\t\tif(dfs(id+1))return true;\n\t\t\t\t}\n\t\t\t\tchar tmp=s[i][1];\n\t\t\t\ts[i][1]=s[i][2];\n\t\t\t\ts[i][2]=s[i][4];\n\t\t\t\ts[i][4]=s[i][3];\n\t\t\t\ts[i][3]=tmp;\n\t\t\t}\n\t\t\tif(r<4)\n\t\t\t{\n\t\t\t\tchar tmp=s[i][0];\n\t\t\t\ts[i][0]=s[i][1];\n\t\t\t\ts[i][1]=s[i][5];\n\t\t\t\ts[i][5]=s[i][4];\n\t\t\t\ts[i][4]=tmp;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tchar tmp=s[i][0];\n\t\t\t\ts[i][0]=s[i][2];\n\t\t\t\ts[i][2]=s[i][5];\n\t\t\t\ts[i][5]=s[i][3];\n\t\t\t\ts[i][3]=tmp;\n\t\t\t}\n\t\t}\n\t\tused[i]=false;\n\t\tA[id]=0;\n\t\tif(id==0)return false;\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>s[0])\n\t{\n\t\tif(s[0]==\"0\")break;\n\t\tfor(int i=1;i<8;i++)cin>>s[i];\n\t\tfor(int i=0;i<8;i++)used[i]=false;\n\t\tcout<<(dfs(0)?\"YES\":\"NO\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 3040,
"score_of_the_acc": -0.0415,
"final_rank": 1
},
{
"submission_id": "aoj_0171_3897645",
"code_snippet": "#include<iostream>\nusing namespace std;\nbool used[8];\nstring s[8];\nint A[8];\nbool ok(char a,char b){return (a^b)==32;}\nbool dfs(int id)\n{\n\tif(id==8)return true;\n\tfor(int i=0;i<8;i++)\n\t{\n\t\tif(used[i])continue;\n\t\tused[i]=true;\n\t\tA[id]=i;\n\t\tfor(int r=0;r<8;r++)\n\t\t{\n\t\t\tfor(int rr=0;rr<4;rr++)\n\t\t\t{\n\t\t\t\tbool check=true;\n\t\t\t\tif(id==0);\n\t\t\t\telse if(id==1)check=ok(s[A[0]][4],s[i][1]);\n\t\t\t\telse if(id==2)check=ok(s[A[0]][2],s[i][3]);\n\t\t\t\telse if(id==3)check=ok(s[A[1]][2],s[i][3])&&ok(s[A[2]][4],s[i][1]);\n\t\t\t\telse if(id==4)check=ok(s[A[0]][5],s[i][0]);\n\t\t\t\telse if(id==5)check=ok(s[A[1]][5],s[i][0])&&ok(s[A[4]][4],s[i][1]);\n\t\t\t\telse if(id==6)check=ok(s[A[2]][5],s[i][0])&&ok(s[A[4]][2],s[i][3]);\n\t\t\t\telse if(id==7)check=ok(s[A[3]][5],s[i][0])&&ok(s[A[5]][2],s[i][3])&&ok(s[A[6]][4],s[i][1]);\n\t\t\t\tif(check)\n\t\t\t\t{\n\t\t\t\t\tif(dfs(id+1))return true;\n\t\t\t\t}\n\t\t\t\tchar tmp=s[i][1];\n\t\t\t\ts[i][1]=s[i][2];\n\t\t\t\ts[i][2]=s[i][4];\n\t\t\t\ts[i][4]=s[i][3];\n\t\t\t\ts[i][3]=tmp;\n\t\t\t}\n\t\t\tif(r<4)\n\t\t\t{\n\t\t\t\tchar tmp=s[i][0];\n\t\t\t\ts[i][0]=s[i][1];\n\t\t\t\ts[i][1]=s[i][5];\n\t\t\t\ts[i][5]=s[i][4];\n\t\t\t\ts[i][4]=tmp;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tchar tmp=s[i][0];\n\t\t\t\ts[i][0]=s[i][2];\n\t\t\t\ts[i][2]=s[i][5];\n\t\t\t\ts[i][5]=s[i][3];\n\t\t\t\ts[i][3]=tmp;\n\t\t\t}\n\t\t}\n\t\tused[i]=false;\n\t\tA[id]=0;\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>s[0])\n\t{\n\t\tif(s[0]==\"0\")break;\n\t\tfor(int i=1;i<8;i++)cin>>s[i];\n\t\tfor(int i=0;i<8;i++)used[i]=false;\n\t\tcout<<(dfs(0)?\"YES\":\"NO\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 1730,
"memory_kb": 3112,
"score_of_the_acc": -0.6911,
"final_rank": 14
},
{
"submission_id": "aoj_0171_2557174",
"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\nclass Dice{\npublic:\n\n\n\n\tvoid setPos(int num){\n\n\t\tfor(int i = 0; i < 6; i++)work[i] = words[i];\n\n\t\tswitch(num){\n\t\tcase 0:\n\t\t\tsetWords(work[4],work[0],work[2],work[3],work[5],work[1]);\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tsetWords(work[5],work[4],work[2],work[3],work[1],work[0]);\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tsetWords(work[1],work[5],work[2],work[3],work[0],work[4]);\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tsetWords(work[0],work[1],work[2],work[3],work[4],work[5]);\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tsetWords(work[2],work[1],work[5],work[0],work[4],work[3]);\n\t\t\tbreak;\n\t\tcase 5:\n\t\t\tsetWords(work[4],work[2],work[5],work[0],work[3],work[1]);\n\t\t\tbreak;\n\t\tcase 6:\n\t\t\tsetWords(work[3],work[4],work[5],work[0],work[1],work[2]);\n\t\t\tbreak;\n\t\tcase 7:\n\t\t\tsetWords(work[1],work[3],work[5],work[0],work[2],work[4]);\n\t\t\tbreak;\n\t\tcase 8:\n\t\t\tsetWords(work[5],work[3],work[4],work[1],work[2],work[0]);\n\t\t\tbreak;\n\t\tcase 9:\n\t\t\tsetWords(work[2],work[5],work[4],work[1],work[0],work[3]);\n\t\t\tbreak;\n\t\tcase 10:\n\t\t\tsetWords(work[0],work[2],work[4],work[1],work[3],work[5]);\n\t\t\tbreak;\n\t\tcase 11:\n\t\t\tsetWords(work[3],work[0],work[4],work[1],work[5],work[2]);\n\t\t\tbreak;\n\t\tcase 12:\n\t\t\tsetWords(work[1],work[0],work[3],work[2],work[5],work[4]);\n\t\t\tbreak;\n\t\tcase 13:\n\t\t\tsetWords(work[5],work[1],work[3],work[2],work[4],work[0]);\n\t\t\tbreak;\n\t\tcase 14:\n\t\t\tsetWords(work[4],work[5],work[3],work[2],work[0],work[1]);\n\t\t\tbreak;\n\t\tcase 15:\n\t\t\tsetWords(work[0],work[4],work[3],work[2],work[1],work[5]);\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\tsetWords(work[2],work[4],work[0],work[5],work[1],work[3]);\n\t\t\tbreak;\n\t\tcase 17:\n\t\t\tsetWords(work[1],work[2],work[0],work[5],work[3],work[4]);\n\t\t\tbreak;\n\t\tcase 18:\n\t\t\tsetWords(work[3],work[1],work[0],work[5],work[4],work[2]);\n\t\t\tbreak;\n\t\tcase 19:\n\t\t\tsetWords(work[4],work[3],work[0],work[5],work[2],work[1]);\n\t\t\tbreak;\n\t\tcase 20:\n\t\t\tsetWords(work[0],work[3],work[1],work[4],work[2],work[5]);\n\t\t\tbreak;\n\t\tcase 21:\n\t\t\tsetWords(work[2],work[0],work[1],work[4],work[5],work[3]);\n\t\t\tbreak;\n\t\tcase 22:\n\t\t\tsetWords(work[5],work[2],work[1],work[4],work[3],work[0]);\n\t\t\tbreak;\n\t\tcase 23:\n\t\t\tsetWords(work[3],work[5],work[1],work[4],work[0],work[2]);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\n\tchar getTop(){\n\t\treturn words[0];\n\t}\n\n\tchar getEast(){\n\t\treturn words[2];\n\t}\n\n\tchar getNorth(){\n\t\treturn words[1];\n\t}\n\n\tchar getWest(){\n\t\treturn words[3];\n\t}\n\n\tchar getBottom(){\n\t\treturn words[5];\n\t}\n\n\tchar getSouth(){\n\t\treturn words[4];\n\t}\n\n\tvoid setWords(char w0,char w1,char w2,char w3,char w4,char w5){\n\t\twords[0] = w0;\n\t\twords[1] = w1;\n\t\twords[2] = w2;\n\t\twords[3] = w3;\n\t\twords[4] = w4;\n\t\twords[5] = w5;\n\t}\n\n\tvoid setFirst(char c1,char c2,char c3,char c4,char c5,char c6){\n\t\twords[0] = c1;\n\t\twords[1] = c5;\n\t\twords[2] = c3;\n\t\twords[3] = c4;\n\t\twords[4] = c2;\n\t\twords[5] = c6;\n\t}\n\n\tvoid set(Dice arg){\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\twords[i] = arg.words[i];\n\t\t}\n\t}\n\n\tchar words[6];\n\tchar work[6];\n};\n\nstruct Puzzle{\n\tDice dice[2][2][2];\n\tint num;\n};\n\nchar buf[8][7];\nint calc_array[5040][7];\nint array_index = 0;\n\nbool clearFLG;\n\n\nvoid copyPuzzle(Puzzle& to, Puzzle from){\n\n\tfor(int h = 0; h < 2; h++){\n\t\tfor(int row = 0; row < 2; row++){\n\t\t\tfor(int col = 0; col < 2; col++){\n\t\t\t\tto.dice[h][row][col].set(from.dice[h][row][col]);\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool is_adj(char left,char right){\n\n\tif(left > right){\n\t\tswap(left,right);\n\t}\n\n\treturn left+32 == right;\n}\n\nvoid puzzle_calc(Puzzle puzzle){\n\n\tif(puzzle.num == 8){\n\t\tclearFLG = true;\n\t\treturn;\n\t}\n\n\tswitch(puzzle.num){\n\tcase 1:\n\n\t\tfor(int i = 0; i <= 23; i++){\n\n\t\t\tDice tmp_dice;\n\t\t\ttmp_dice.set(puzzle.dice[1][0][0]);\n\t\t\ttmp_dice.setPos(i);\n\n\t\t\tif(is_adj(puzzle.dice[1][1][0].getNorth(),tmp_dice.getSouth()) == false)continue;\n\n\t\t\tPuzzle new_puzzle;\n\t\t\tcopyPuzzle(new_puzzle,puzzle);\n\n\t\t\tnew_puzzle.dice[1][0][0].setPos(i);\n\n\t\t\tnew_puzzle.num = puzzle.num+1;\n\t\t\tpuzzle_calc(new_puzzle);\n\t\t}\n\t\tbreak;\n\tcase 2:\n\t\tfor(int i = 0; i <= 23; i++){\n\t\t\tDice tmp_dice;\n\t\t\ttmp_dice.set(puzzle.dice[1][0][1]);\n\t\t\ttmp_dice.setPos(i);\n\n\t\t\tif(is_adj(puzzle.dice[1][0][0].getEast(),tmp_dice.getWest()) == false)continue;\n\n\t\t\tPuzzle new_puzzle;\n\t\t\tcopyPuzzle(new_puzzle,puzzle);\n\n\t\t\tnew_puzzle.dice[1][0][1].setPos(i);\n\n\t\t\tnew_puzzle.num = puzzle.num+1;\n\t\t\tpuzzle_calc(new_puzzle);\n\t\t}\n\t\tbreak;\n\tcase 3:\n\t\tfor(int i = 0; i <= 23; i++){\n\t\t\tDice tmp_dice;\n\t\t\ttmp_dice.set(puzzle.dice[1][1][1]);\n\t\t\ttmp_dice.setPos(i);\n\n\t\t\tif(is_adj(puzzle.dice[1][0][1].getSouth(),tmp_dice.getNorth()) == false ||\n\t\t\t\t\tis_adj(puzzle.dice[1][1][0].getEast(),tmp_dice.getWest()) == false)continue;\n\n\t\t\tPuzzle new_puzzle;\n\t\t\tcopyPuzzle(new_puzzle,puzzle);\n\n\t\t\tnew_puzzle.dice[1][1][1].setPos(i);\n\n\t\t\tnew_puzzle.num = puzzle.num+1;\n\t\t\tpuzzle_calc(new_puzzle);\n\t\t}\n\t\tbreak;\n\tcase 4:\n\t\tfor(int i = 0; i <= 23; i++){\n\n\t\t\tDice tmp_dice;\n\t\t\ttmp_dice.set(puzzle.dice[0][1][0]);\n\t\t\ttmp_dice.setPos(i);\n\n\t\t\tif(is_adj(puzzle.dice[1][1][0].getBottom(),tmp_dice.getTop()) == false)continue;\n\n\t\t\tPuzzle new_puzzle;\n\t\t\tcopyPuzzle(new_puzzle,puzzle);\n\n\t\t\tnew_puzzle.dice[0][1][0].setPos(i);\n\n\t\t\tnew_puzzle.num = puzzle.num+1;\n\t\t\tpuzzle_calc(new_puzzle);\n\t\t}\n\t\tbreak;\n\tcase 5:\n\t\tfor(int i = 0; i <= 23; i++){\n\n\t\t\tDice tmp_dice;\n\t\t\ttmp_dice.set(puzzle.dice[0][0][0]);\n\t\t\ttmp_dice.setPos(i);\n\n\t\t\tif(is_adj(puzzle.dice[1][0][0].getBottom(),tmp_dice.getTop()) == false ||\n\t\t\t\t\tis_adj(puzzle.dice[0][1][0].getNorth(),tmp_dice.getSouth()) == false)continue;\n\n\t\t\tPuzzle new_puzzle;\n\t\t\tcopyPuzzle(new_puzzle,puzzle);\n\n\t\t\tnew_puzzle.dice[0][0][0].setPos(i);\n\n\t\t\tnew_puzzle.num = puzzle.num+1;\n\t\t\tpuzzle_calc(new_puzzle);\n\t\t}\n\t\tbreak;\n\tcase 6:\n\t\tfor(int i = 0; i <= 23; i++){\n\n\t\t\tDice tmp_dice;\n\t\t\ttmp_dice.set(puzzle.dice[0][0][1]);\n\t\t\ttmp_dice.setPos(i);\n\n\t\t\tif(is_adj(puzzle.dice[1][0][1].getBottom(),tmp_dice.getTop()) == false ||\n\t\t\t\t\tis_adj(puzzle.dice[0][0][0].getEast(),tmp_dice.getWest()) == false)continue;\n\n\t\t\tPuzzle new_puzzle;\n\t\t\tcopyPuzzle(new_puzzle,puzzle);\n\n\t\t\tnew_puzzle.dice[0][0][1].setPos(i);\n\n\t\t\tnew_puzzle.num = puzzle.num+1;\n\t\t\tpuzzle_calc(new_puzzle);\n\t\t}\n\t\tbreak;\n\tcase 7:\n\t\tfor(int i = 0; i <= 23; i++){\n\n\t\t\tDice tmp_dice;\n\t\t\ttmp_dice.set(puzzle.dice[0][1][1]);\n\t\t\ttmp_dice.setPos(i);\n\n\t\t\tif(is_adj(puzzle.dice[1][1][1].getBottom(),tmp_dice.getTop()) == false ||\n\t\t\t\t\tis_adj(puzzle.dice[0][1][0].getEast(),tmp_dice.getWest()) == false ||\n\t\t\t\t\tis_adj(puzzle.dice[0][0][1].getSouth(),tmp_dice.getNorth()) == false)continue;\n\n\t\t\tPuzzle new_puzzle;\n\t\t\tcopyPuzzle(new_puzzle,puzzle);\n\n\t\t\tnew_puzzle.dice[0][1][1].setPos(i);\n\n\t\t\tnew_puzzle.num = puzzle.num+1;\n\t\t\tpuzzle_calc(new_puzzle);\n\t\t}\n\t\tbreak;\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 1; i <= 7; i++){\n\t\tscanf(\"%s\",buf[i]);\n\t}\n\n\tclearFLG = false;\n\tint calc_index = 0;\n\n\twhile(clearFLG == false && calc_index < 5040){\n\n\t\tPuzzle new_puzzle;\n\t\tnew_puzzle.dice[1][1][0].setFirst(buf[0][0],buf[0][1],buf[0][2],buf[0][3],buf[0][4],buf[0][5]); //?????????S1?????????(1,1,0)????¨????\n\n\t\tfor(int i = 0; i < 7; i++){\n\n\t\t\tint num = calc_array[calc_index][i];\n\n\t\t\tswitch(i){\n\t\t\tcase 0:\n\t\t\t\tnew_puzzle.dice[1][0][0].setFirst(buf[num][0],buf[num][1],buf[num][2],buf[num][3],buf[num][4],buf[num][5]);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tnew_puzzle.dice[1][0][1].setFirst(buf[num][0],buf[num][1],buf[num][2],buf[num][3],buf[num][4],buf[num][5]);\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tnew_puzzle.dice[1][1][1].setFirst(buf[num][0],buf[num][1],buf[num][2],buf[num][3],buf[num][4],buf[num][5]);\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tnew_puzzle.dice[0][1][0].setFirst(buf[num][0],buf[num][1],buf[num][2],buf[num][3],buf[num][4],buf[num][5]);\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tnew_puzzle.dice[0][0][0].setFirst(buf[num][0],buf[num][1],buf[num][2],buf[num][3],buf[num][4],buf[num][5]);\n\t\t\t\tbreak;\n\t\t\tcase 5:\n\t\t\t\tnew_puzzle.dice[0][0][1].setFirst(buf[num][0],buf[num][1],buf[num][2],buf[num][3],buf[num][4],buf[num][5]);\n\t\t\t\tbreak;\n\t\t\tcase 6:\n\t\t\t\tnew_puzzle.dice[0][1][1].setFirst(buf[num][0],buf[num][1],buf[num][2],buf[num][3],buf[num][4],buf[num][5]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i <= 23; i++){\n\t\t\tPuzzle next_puzzle;\n\t\t\tcopyPuzzle(next_puzzle,new_puzzle);\n\t\t\tnext_puzzle.dice[1][1][0].setPos(i);\n\t\t\tnext_puzzle.num = 1;\n\t\t\tpuzzle_calc(next_puzzle);\n\t\t}\n\n\t\tcalc_index++;\n\t}\n\n\tif(clearFLG){\n\t\tprintf(\"YES\\n\");\n\t}else{\n\t\tprintf(\"NO\\n\");\n\t}\n}\n\n\nvoid recursive(bool check[8],int jyunretsu[7],int num){\n\n\tif(num == 7){\n\t\tfor(int k = 0; k < 7; k++){\n\t\t\tcalc_array[array_index][k] = jyunretsu[k];\n\t\t}\n\t\tarray_index++;\n\t\treturn;\n\t}\n\n\tfor(int i = 1; i <= 7; i++){\n\t\tif(check[i] == false){\n\t\t\tint next_jyunretsu[7];\n\t\t\tfor(int k = 0; k < num; k++)next_jyunretsu[k] = jyunretsu[k];\n\t\t\tnext_jyunretsu[num] = i;\n\n\t\t\tbool next_check[8];\n\t\t\tfor(int k = 1; k <= 7; k++)next_check[k] = check[k];\n\t\t\tnext_check[i] = true;\n\n\t\t\trecursive(next_check,next_jyunretsu,num+1);\n\t\t}\n\t}\n}\n\nint main(){\n\n\tbool check[8];\n\tfor(int i = 1; i <= 7; i++){\n\t\tcheck[i] = false;\n\t}\n\tint jyunretsu[7];\n\n\trecursive(check,jyunretsu,0);\n\n\twhile(true){\n\t\tscanf(\"%s\",buf[0]);\n\t\tif(buf[0][0] == '0')break;\n\n\t\tfunc();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 2270,
"memory_kb": 3288,
"score_of_the_acc": -1.3945,
"final_rank": 19
}
] |
aoj_0176_cpp
|
何色？
ウェブデザイナーを目指す太郎君はただいま修行中。事務所の先輩から「このページの背景色は#ffe085で」と、ウェブデザイン特有の色番号で指示されるのですが、それがどんな色かパッと思い浮かべることができません。
この色番号は光の三原色である赤、緑、青それぞれの強さを表わしています。具体的には2 桁の 16 進数を3 つ組み合わせたもので、色番号を“#RGB”とするとき、R は赤の強さ、G は緑の強さ、は青の強さを表します。それぞれ 00 から ff までの値になります。
色番号にまだ不慣れな太郎君のために、色番号を入力とし、色の表の中からもっとも近い色の名前
を出力するプログラムを作成してください。使用する色の表は以下の通りです。
色の名前
赤の強さ
緑の強さ
青の強さ
black
00
00
00
blue
00
00
ff
lime
00
ff
00
aqua
00
ff
ff
red
ff
00
00
fuchsia
ff
00
ff
yellow
ff
ff
00
white
ff
ff
ff
「もっとも近い色」とは、以下のように定義します。与えられた色番号での赤、緑、青の強さをそれぞれ
R
、
G
、
B
とし、表の
k
番目の色の赤、緑、青の強さをそれぞれ
R
k
、
G
k
、
B
k
とするとき、次の式で計算する
d
k
の値が最も小さい色がもっとも近い色とします。
なお、
d
k
の値が同じになる色が複数存在する場合は表の中でより上にある色がもっとも近い色になり
ます。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットとして、色番号を表す文字列が、
#
RGB
形式で１行に与えられます。
データセットの数は 1000 を超えません。
Output
データセット毎に最も近い色の名前を１行に出力します。
Sample Input
#ffe085
#787878
#decade
#ff55ff
0
Output for the Sample Input
white
black
white
fuchsia
|
[
{
"submission_id": "aoj_0176_1537822",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF 999999999\n\nint btoh(string s){\n if(s.size()!=2)cout<<\"error\"<<endl;\n int ret=0;\n if('0'<=s[1]&&s[1]<='9')ret+=(s[1]-'0');\n else{\n ret+=10+(int)(s[1]-'a');\n }\n if('0'<=s[0]&&s[0]<='9')ret+=(s[0]-'0')*16;\n else{\n ret+=(10+(int)(s[0]-'a'))*16;\n }\n return ret;\n}\n\ndouble solve(string a,string b,string c,string d,string e,string f){\n int x,y,z;\n// cout<<btoh(a)<<\" \"<<btoh(b)<<\" \"<<btoh(c)<<\" \"<<btoh(d)<<\" \"<<btoh(e)<<\" \"<<btoh(f)<<endl;\n x=(btoh(a)-btoh(d)) * (btoh(a)-btoh(d));\n y=(btoh(b)-btoh(e)) * (btoh(b)-btoh(e));\n z=(btoh(c)-btoh(f)) * (btoh(c)-btoh(f));\n \n return sqrt(x+y+z);\n}\n\nint main(){\n// string color = {\"black\",\"blue\",}\n string s;\n while(cin>>s){\n if(s==\"0\")break;\n string a,b,c;\n a=s.substr(1,2);\n b=s.substr(3,2);\n c=s.substr(5,2);\n string ans=\"\";\n double d=INF;\n \n double t=solve(a,b,c,\"00\",\"00\",\"00\");\n if(t<d){\n d=t;\n ans=\"black\";\n }\n \n t=solve(a,b,c,\"00\",\"00\",\"ff\");\n if(t<d){\n d=t;\n ans=\"blue\";\n }\n \n t=solve(a,b,c,\"00\",\"ff\",\"00\");\n if(t<d){\n d=t;\n ans=\"lime\";\n }\n \n t=solve(a,b,c,\"00\",\"ff\",\"ff\");\n if(t<d){\n d=t;\n ans=\"aqua\";\n }\n \n t=solve(a,b,c,\"ff\",\"00\",\"00\");\n if(t<d){\n d=t;\n ans=\"red\";\n }\n \n t=solve(a,b,c,\"ff\",\"00\",\"ff\");\n if(t<d){\n d=t;\n ans=\"fuchsia\";\n }\n \n t=solve(a,b,c,\"ff\",\"ff\",\"00\");\n if(t<d){\n d=t;\n ans=\"yellow\";\n }\n \n t=solve(a,b,c,\"ff\",\"ff\",\"ff\");\n if(t<d){\n d=t;\n ans=\"white\";\n }\n cout<<ans<<endl;\n }\n}\n\n/*\n black\t00\t00\t00\n blue\t00\t00\tff\n lime\t00\tff\t00\n aqua\t00\tff\tff\n red\tff\t00\t00\n fuchsiaff\t00\tff\n yellow\tff\tff\t00\n white\tff\tff\tff\n\n */",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.9868,
"final_rank": 7
},
{
"submission_id": "aoj_0176_1113100",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\ntypedef vector<int> vi;\ntypedef vector<vi> vii;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<vb> vbb;\ntypedef pair<int, int> pii;\ntypedef long long ll;\ntypedef unsigned long long ull;\n\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define pb push_back\n#define mp make_pair\n\n#define loop(i,a,b) for(int i=(a);i<ull(b);++i)\n#define rep(i,n) loop(i,0,n)\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst double inf = (int)1e8;\n\nstring color[8] = {\"black\", \"blue\", \"lime\", \"aqua\", \"red\", \"fuchsia\", \"yellow\", \"white\"};\nstring strength[8] = {\"000000\", \"0000ff\", \"00ff00\", \"00ffff\", \"ff0000\", \"ff00ff\", \"ffff00\", \"ffffff\"};\n\nint toi(string s){\n int ret = 0;\n rep(i, s.size()){\n string t = s.substr(i, 1);\n if('0' <= t[0] && t[0] <= '9') ret += stoi(t);\n else ret += t[0]-'a'+10;\n if(i != s.size()-1) ret *= 16;\n }\n return ret;\n}\n\nvector<int> rgb(string s){\n vi ret;\n rep(i, 3){\n string t = s.substr(i*2, 2);\n ret.pb(toi(t));\n }\n return ret;\n}\n\nint main(){\n string s;\n while(cin >> s, s!=\"0\"){\n s = s.substr(1);\n vi c = rgb(s);\n double m = inf;\n int ans = 0;\n rep(i, 8){\n vi d = rgb(strength[i]);\n double ret = sqrt(pow(c[0]-d[0], 2)+pow(c[1]-d[1], 2)+pow(c[2]-d[2], 2));\n if(m > ret){ans = i; m = ret;}\n }\n cout << color[ans] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1212,
"score_of_the_acc": -1,
"final_rank": 8
},
{
"submission_id": "aoj_0176_1074935",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\nusing namespace std;\n\ntemplate<class T>\nT sqr(T obj) {return obj * obj;}\n\nstruct color {\n\tstring name;\n\tint R, G, B;\n\n\tcolor(string n, int r, int g, int b) {\n\t\tname = n;\n\t\tR = r;\n\t\tG = g;\n\t\tB = b;\n\t}\n};\n\ncolor color_list[] = {\n\tcolor(\"black\", 0x00, 0x00, 0x00),\n\tcolor(\"blue\", 0x00, 0x00, 0xff),\n\tcolor(\"lime\", 0x00, 0xff, 0x00),\n\tcolor(\"aqua\", 0x00, 0xff, 0xff),\n\tcolor(\"red\", 0xff, 0x00, 0x00),\n\tcolor(\"fuchsia\", 0xff, 0x00, 0xff),\n\tcolor(\"yellow\", 0xff, 0xff, 0x00),\n\tcolor(\"white\", 0xff, 0xff, 0xff),\n};\n\nint main() {\n\tstring s;\n\twhile(cin >> s) {\n\t\tif(s[0] == '0')\n\t\t\tbreak;\n\n\t\tint mind, indx;\n\t\tindx = 0;\n\t\tmind = 1e8;\n\n\t\tint a[3];\n\t\tfor(int j = 0; j < 3; j++) {\n\t\t\tint tmp = 0;\n\t\t\tif('0' <= s[1 + 2 * j] && s[1 + 2 * j] <= '9')\n\t\t\t\ttmp += (s[1 + 2 * j] - '0') * 16;\n\t\t\telse\n\t\t\t\ttmp += (s[1 + 2 * j] - 'a' + 10) * 16;\n\n\t\t\tif('0' <= s[2 + 2 * j] && s[2 + 2 * j] <= '9')\n\t\t\t\ttmp += (s[2 + 2 * j] - '0');\n\t\t\telse\n\t\t\t\ttmp += (s[2 + 2 * j] - 'a' + 10);\n\t\t\ta[j] = tmp;\n\t\t}\n\n\t\tfor(int i = 0; i < 8; i++) {\n\t\t\tint d = 0;\n\n\t\t\td += sqr(color_list[i].R - a[0]);\n\t\t\td += sqr(color_list[i].G - a[1]);\n\t\t\td += sqr(color_list[i].B - a[2]);\n\t\t\tif(d < mind) {\n\t\t\t\tindx = i;\n\t\t\t\tmind = d;\n\t\t\t}\n\t\t}\n\t\tcout << color_list[indx].name << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1184,
"score_of_the_acc": -0.9769,
"final_rank": 3
},
{
"submission_id": "aoj_0176_1038436",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define all(c) (c).begin(),(c).end()\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 REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)\n#define iter(c) __typeof((c).begin())\n#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)\n#define pb(a) push_back(a)\n#define pr(a) cout << (a) << endl\n#define PR(a,b) cout << (a) << \" \" << (b) << endl\n#define F first\n#define S second\ntypedef long long ll;\ntypedef pair<int,int> P;\nconst int MAX=1000000001;\nconst ll MAXL=1000000000000000001LL;\nconst ll mod=1000000007;\nint dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};\n\ndouble x(string s) {\n double a=1,ans=0;\n rrep(i,2) {\n if(isdigit(s[i])) ans+=(int)(s[i]-'0')*a;\n else ans+=((int)(s[i]-'a')+10)*a;\n a*=16;\n }\n return ans;\n}\n\nint main() {\n double d[8][3]={{0,0,0},{0,0,255},{0,255,0},{0,255,255},{255,0,0},{255,0,255},{255,255,0},{255,255,255}};\n string c[8]={\"black\",\"blue\",\"lime\",\"aqua\",\"red\",\"fuchsia\",\"yellow\",\"white\"};\n string s;\n while(cin >> s && s!=\"0\") {\n int ans=0;\n double min=MAX;\n double z[3];\n s=s.substr(1);\n rep(i,3) z[i]=x(s.substr(i*2,2));\n rep(i,8) {\n double v=sqrt((z[0]-d[i][0])*(z[0]-d[i][0])+(z[1]-d[i][1])*(z[1]-d[i][1])+(z[2]-d[i][2])*(z[2]-d[i][2]));\n if(v<min) {\n\tans=i;\n\tmin=v;\n }\n }\n pr(c[ans]);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.9802,
"final_rank": 4
},
{
"submission_id": "aoj_0176_990505",
"code_snippet": "#include <iostream>\n#include <string>\n#include <climits>\nusing namespace std;\n\nint conv(char a) {\n if (a >= '0' && a <= '9') {\n return a - '0';\n } else {\n return a - 'a' + 10;\n }\n}\n\nint conv(char a, char b) {\n return conv(a)*16 + conv(b);\n}\n\nint main() {\n string str;\n int c[3], d, m, ans;\n int cc[8][3] = {{0, 0, 0}, {0, 0, 0xff}, {0, 0xff, 0}, {0, 0xff, 0xff},\n {0xff, 0, 0}, {0xff, 0, 0xff}, {0xff, 0xff, 0}, {0xff, 0xff, 0xff}};\n const char *label[8] = {\"black\", \"blue\", \"lime\", \"aqua\", \"red\", \"fuchsia\", \"yellow\", \"white\"};\n\n while (1) {\n cin >> str;\n if (str == \"0\") break;\n for (int i=0; i<3; i++) {\n c[i] = conv(str.at(2*i+1), str.at(2*i+2));\n }\n m = INT_MAX;\n ans = -1;\n for (int i=0; i<8; i++) {\n d = 0;\n for (int j=0; j<3; j++) {\n d += (c[j]-cc[i][j])*(c[j]-cc[i][j]);\n }\n if (m > d) {\n m = d;\n ans = i;\n }\n }\n cout << label[ans] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1180,
"score_of_the_acc": -0.9736,
"final_rank": 2
},
{
"submission_id": "aoj_0176_905039",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nstring str;\n\nstring t[8][4]={\n {\"black\",\"00\",\"00\",\"00\"},\n {\"blue\",\"00\",\"00\",\"ff\"},\n {\"lime\",\"00\",\"ff\",\"00\"},\n {\"aqua\",\"00\",\"ff\",\"ff\"},\n {\"red\",\"ff\",\"00\",\"00\"},\n {\"fuchsia\",\"ff\",\"00\",\"ff\"},\n {\"yellow\",\"ff\",\"ff\",\"00\"},\n {\"white\",\"ff\",\"ff\",\"ff\"}\n};\n\n\n\nint c2i(char ch){\n if('0'<=ch&&ch<='9')return ch-'0';\n return 10+ch-'a';\n}\n\nint cc2i(char ch,char ch2){\n return c2i(ch)*16+c2i(ch2);\n}\n\nint s2i(string str){\n return cc2i(str[0],str[1]);\n}\n\nint pow(int x){\n return x*x;\n}\n\nint main(){\n int a,mini,mini_no;\n while(cin>>str){\n if(str==\"0\")break;\n mini=9999999;\n for(int i=0;i<8;i++){\n a=pow( cc2i(str[1],str[2]) - s2i(t[i][1]) ); \n a+=pow(cc2i(str[3],str[4]) - s2i(t[i][2]) );\n a+=pow(cc2i(str[5],str[6]) - s2i(t[i][3]) ); \n if(a<mini){\n\tmini=a;\n\tmini_no=i;\n }\n }\n cout<<t[mini_no][0]<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.9802,
"final_rank": 4
},
{
"submission_id": "aoj_0176_644306",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nconst int rgb[8][3] = {{0, 0, 0},\n {0, 0, 255},\n {0, 255, 0},\n {0, 255, 255},\n {255, 0, 0},\n {255, 0, 255},\n {255, 255, 0},\n {255, 255, 255}};\nconst string name[8] = {\"black\", \"blue\", \"lime\",\n \"aqua\", \"red\", \"fuchsia\",\n \"yellow\", \"white\"};\n\nint to_decimal(string s) \n{\n int d[2];\n int ret = 0;\n\n for (int i = 0; i < 2; i++) {\n if ('a' <= s[i] && s[i] <= 'f') \n d[i] = s[i] - 'a' + 10;\n else\n d[i] = s[i] - '0';\n }\n\n return d[0] * 16 + d[1];\n}\n\nint main()\n{\n string inp;\n\n while (cin >> inp, inp != \"0\") {\n int r, g, b;\n int d = 200000;\n int idx = 0;\n \n r = to_decimal(inp.substr(1, 2));\n g = to_decimal(inp.substr(3, 2));\n b = to_decimal(inp.substr(5, 2));\n\n for (int i = 0; i < 8; i++) {\n int tmp;\n tmp = (r - rgb[i][0]) * (r - rgb[i][0]) + \n (g - rgb[i][1]) * (g - rgb[i][1]) +\n (b - rgb[i][2]) * (b - rgb[i][2]);\n\n if (tmp < d) {\n d = tmp;\n idx = i;\n }\n }\n cout << name[idx] << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.9802,
"final_rank": 4
},
{
"submission_id": "aoj_0176_113753",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cctype>\n\nusing namespace std;\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\nint charToInt(char c) {\n return (int)c - (int)'0';\n}\n\nint _16to10(char c) {\n int ans = charToInt(c);\n if(ans >= 0 && ans <= 9) return ans;\n else return (int)tolower(c) - (int)'a' + 10;\n}\n\nint _16to10(string str) {\n int ans = 0;\n for(int i = 0; i < str.length(); i++) {\n ans += _16to10(str[i])*pow(16, str.length()-i-1);\n }\n return ans;\n}\n\nint d2(string a, string b) {\n int ans = 0;\n for(int i = 0; i < 3; i++) {\n int p = i*2;\n ans += pow(_16to10(a.substr(p,2))-_16to10(b.substr(p,2)), 2);\n }\n return ans;\n}\n\nint main() {\n string colors[8][2] = {{\"black\", \"000000\"},\n\t\t\t {\"blue\", \"0000ff\"},\n\t\t\t {\"lime\", \"00ff00\"},\n\t\t\t {\"aqua\", \"00ffff\"},\n\t\t\t {\"red\", \"ff0000\"},\n\t\t\t {\"fuchsia\", \"ff00ff\"},\n\t\t\t {\"yellow\", \"ffff00\"},\n\t\t\t {\"white\", \"ffffff\"}};\n while(1) {\n string str;\n cin >> str;\n if(str == \"0\") break;\n\n int min = 999999;\n int k;\n for(int i = 0; i < 8; i++) {\n int temp = d2(str.substr(1, 6), colors[i][1]);\n if(temp < min) {\n\tmin = temp;\n\tk = i;\n }\n }\n cout << colors[k][0] << 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_0176_98786",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cmath>\n\nusing namespace std;\n\nint h(string s){\n\tint ret = 0;\n\tint src = 1;\n\tfor(int i=s.length()-1;i>=0;i--){\n\t\tret += (s[i]>'9'?s[i]-'a'+10:s[i]-'0')*src;\n\t\tsrc *= 16;\n\t}\n\treturn ret;\n}\n\ndouble f(string a,string b){\t\n\tstring tr,tg,tb;\n\tstring tr2,tg2,tb2;\n\ttr = a.substr(1,2);\n\ttg = a.substr(3,2);\n\ttb = a.substr(5,2);\n\ttr2 = b.substr(1,2);\n\ttg2 = b.substr(3,2);\n\ttb2 = b.substr(5,2);\n\treturn sqrt(\n\t\t(h(tr)-h(tr2))*(h(tr)-h(tr2)) +\n\t\t(h(tg)-h(tg2))*(h(tg)-h(tg2)) +\n\t\t(h(tb)-h(tb2))*(h(tb)-h(tb2))\n\t);\n}\nint main(){\n\tdouble MIN;\n\tstring ret;\n\t\n\tstring rgb;\n\twhile(cin >> rgb && rgb[0] != '0'){\n\t\tMIN = (1<<21);\n\t\tif(MIN > f(rgb,\"#000000\")){\n\t\t\tMIN = f(rgb,\"#000000\");\n\t\t\tret = \"black\";\n\t\t}\n\t\tif(MIN > f(rgb,\"#0000ff\")){\n\t\t\tMIN = f(rgb,\"#0000ff\");\n\t\t\tret = \"blue\";\n\t\t}\n\t\tif(MIN > f(rgb,\"#00ff00\")){\n\t\t\tMIN = f(rgb,\"#00ff00\");\n\t\t\tret = \"lime\";\n\t\t}\n\t\tif(MIN > f(rgb,\"#00ffff\")){\n\t\t\tMIN = f(rgb,\"#00ffff\");\n\t\t\tret = \"aqua\";\n\t\t}\n\t\tif(MIN > f(rgb,\"#ff0000\")){\n\t\t\tMIN = f(rgb,\"#ff0000\");\n\t\t\tret = \"red\";\n\t\t}\n\t\tif(MIN > f(rgb,\"#ff00ff\")){\n\t\t\tMIN = f(rgb,\"#ff00ff\");\n\t\t\tret = \"fuchsia\";\n\t\t}\n\t\tif(MIN > f(rgb,\"#ffff00\")){\n\t\t\tMIN = f(rgb,\"#ffff00\");\n\t\t\tret = \"yellow\";\n\t\t}\n\t\tif(MIN > f(rgb,\"#ffffff\")){\n\t\t\tMIN = f(rgb,\"#ffffff\");\n\t\t\tret = \"white\";\n\t\t}\n\t\tcout << ret << endl;\n\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 908,
"score_of_the_acc": -1.7492,
"final_rank": 9
}
] |
aoj_0170_cpp
|
ランチ
お昼に食べるお弁当を作るために、お店で食べ物を買いました。お店では、食べ物を入れるのに細長い袋しかもらえなかったので、すべての食べ物を縦に積んで袋に入れる必要があります。袋が倒れにくいように、できるだけ重い物を下にして詰めたいのですが、食べ物の中にはやわらかい物もあって、上に重い物を乗せるとつぶれてしまいます。
そこで、食べ物の情報を入力とし、全ての食べ物がつぶれず、かつ全体の重心が最も低くなるような積み方を出力するプログラムを作成してください。それぞれの食べ物ごとに、名前
f
、重さ
w
、上に載せて耐えられる重さ
s
が指定されます。
「全ての食べ物がつぶれない」というのは、下から順に、（
f
1
、
f
2
、... 、
f
n
）と
n
個の食べ物を積んだ時、すべての
f
について、
s
f
i
≥ w
f
i+1
+ w
f
i+2
+
...
+ w
f
n
であることを意味します。また、全体の重心
G
は、
G = (1 × w
f
1
+ 2 × w
f
2
+
...
+ n × w
f
n
)
/
(w
f
1
+ w
f
2
+
...
+w
f
n
)
とします。ただし、解はちょうど1つだけ存在するものとします。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
n
f
1
w
1
s
1
f
2
w
2
s
2
:
f
n
w
n
s
n
１行目に食べ物の個数
n
(1 ≤
n
≤ 10)、続く
n
行に
i
番目の食べ物の名前
f
i
(20 文字以内の半角英文字列)、重さ
w
i
(1 ≤
w
i
≤ 1000)、耐えられる重さ
s
i
(1 ≤
s
i
≤ 1000) が空白区切りで与えられます。
データセットの数は 20 を超えません。
Output
データセットごとに、次の形式で食べ物の名前を下から積み上げる順に出力します。
1 行目: 1 番下の食べ物の名前（半角英文字列）
2 行目: 下から2 番目の食べ物の名前
：
n
行目: 1 番上の食べ物の名前
Sample Input
4
sandwich 80 120
apple 50 200
cheese 20 40
cake 100 100
9
onigiri 80 300
onigiri 80 300
anpan 70 280
mikan 50 80
kanzume 100 500
chocolate 50 350
cookie 30 80
purin 40 400
cracker 40 160
0
Output for the Sample Input
apple
cake
sandwich
cheese
kanzume
purin
chocolate
onigiri
onigiri
anpan
mikan
cracker
cookie
|
[
{
"submission_id": "aoj_0170_10850451",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<math.h>\n#include<vector>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<queue>\n#include<stack>\n#include<string>\n#include<time.h>\n#define INF 1000000000ll\n#define MOD 1000000007ll\n#define EPS 1e-10\n#define REP(i,m) for(long long i=0; i<m; i++)\n#define FOR(i,n,m) for(long long i=n; i<m; i++)\n#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=n-1) cout<<\" \"; else cout<<endl; }\n#define ALL(v) v.begin(),v.end()\n#define pb push_back\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef long double ld;\n\n/*\n 貪欲\n ①決定問題 必ず解に含まれる(含むように変換できる)ものから決めていく みんプロ本選B\n ②最適化問題 任意の解から評価を落とさず解に含められるようなものから決めていく 区間スケジューリングとか\n ③\n */\n\n/*\n DP\n ①DPはある程度決め打ちをするべき(解を帰納的に構成できないか？)\n */\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\twhile(1) {\n\tll n;\n\tcin>>n;\n\tif(n==0) break;\n\tvector<string> name(n);\n\tvector<P> ws(n);\n\tREP(i,n) {\n\t\tcin>>name[i];\n\t\tcin>>ws[i].first>>ws[i].second;\n\t}\n\tvector<ll> perm(n);\n\tREP(i,n) perm[i]=i;\n\tvector<ll> ret_perm(n,-1);\n\tll buf=INF;\n\tdo {\n\t\tll sum=0;\n\t\tbool d=true;\n\t\tREP(i,n) {\n\t\t\tif(ws[perm[n-1-i]].second<sum) {\n\t\t\t\td=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsum+=ws[perm[n-1-i]].first;\n\t\t}\n\t\tif(d) {\n\t\t\tll g=0;\n\t\t\tREP(i,n) g+=(i+1)*ws[perm[i]].first;\n\t\t\tif(g<buf) {\n\t\t\t\tbuf=g;\n\t\t\t\tREP(i,n) ret_perm[i]=perm[i];\n\t\t\t}\n\t\t}\n\t} while(next_permutation(ALL(perm)));\n\tREP(i,n) {\n\t\tcout<<name[ret_perm[i]]<<endl;\n\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3224,
"score_of_the_acc": -0.5755,
"final_rank": 16
},
{
"submission_id": "aoj_0170_6955503",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n while(cin >> n, n){\n string s;\n int v1, v2, minv = 1 << 30;\n vector<tuple<string,int,int>> a(n);\n for(int i = 0; i < n; i++){\n cin >> s >> v1 >> v2;\n a[i] = {s, v1, v2};\n }\n sort(a.begin(), a.end());\n vector<string> ans;\n do{\n bool flag = true;\n int G = 0;\n for(int j = n - 1, W = 0; j >= 0; j--){\n if(W > get<2>(a[j]))flag = false;\n G += (j + 1) * get<1>(a[j]);\n W += get<1>(a[j]);\n }\n if(flag && G < minv){\n minv = G;\n ans.clear();\n for(int i = 0; i < n; i++)ans.push_back(get<0>(a[i]));\n }\n }while(next_permutation(a.begin(), a.end()));\n for(int i = 0; i < n; i++){\n cout << ans[i] << '\\n';\n }\n }\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 3424,
"score_of_the_acc": -1.7143,
"final_rank": 20
},
{
"submission_id": "aoj_0170_5187527",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct stuff{\n string name;\n int w;\n int s;\n int idx;\n bool operator <(const stuff& a) const{\n return idx < a.idx;\n }\n};\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<stuff> a(n);\n for(int i=0; i<n; i++){\n cin >> a[i].name >> a[i].w >> a[i].s;\n a[i].idx = i;\n }\n vector<stuff> ans;\n double g = 1e9;\n do{\n int sum = 0;\n int weighted_sum = 0;\n bool ok = true;\n for(int i=0; i<n; i++){\n if(sum > a[i].s){\n ok = false;\n break;\n }\n sum += a[i].w;\n weighted_sum += a[i].w *(n-i);\n }\n if(!ok) continue;\n double newg = (double)weighted_sum/sum;\n if(newg < g){\n g = newg;\n ans = a;\n }\n }while(next_permutation(a.begin(), a.end()));\n for(int i=n-1; i>=0; i--){\n cout << ans[i].name << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3332,
"score_of_the_acc": -1.3082,
"final_rank": 18
},
{
"submission_id": "aoj_0170_4361816",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n\nusing namespace std;\n\nvector<int> foods;\nvector<int> solution;\nstring f[10];\nint w[10];\nint s[10];\nbool flags[10];\nint crG;\nint crW;\nint minG;\n\nbool IsValid()\n{\n\tint temp = crW;\n\tfor (int i : foods)\n\t{\n\t\ttemp -= w[i];\n\t\tif (s[i] < temp)\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nvoid Backtrace(int n, int floor)\n{\n\tif (floor == n + 1)\n\t{\n\t\tif (crG < minG)\n\t\t{\n\t\t\tminG = crG;\n\t\t\tcopy(foods.begin(), foods.end(), solution.begin());\n\t\t}\n\t\treturn;\n\t}\n\tfor (size_t i = 0; i < n; i++)\n\t{\n\t\tif (!flags[i] && crG < minG)\n\t\t{\n\t\t\tflags[i] = true;\n\t\t\tcrW += w[i];\n\t\t\tcrG += floor * w[i];\n\t\t\tfoods.push_back(i);\n\t\t\tif(IsValid())\n\t\t\t Backtrace(n, floor + 1);\n\t\t\tfoods.erase(foods.end() - 1);\n\t\t\tcrG -= floor * w[i];\n\t\t\tcrW -= w[i];\n\t\t\tflags[i] = false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\twhile (n)\n\t{\n\t\tfor (size_t i = 0; i < n; i++)\n\t\t{\n\t\t\tcin >> f[i] >> w[i] >> s[i];\n\t\t}\n\t\tfill(flags, flags + n, false);\n\t\tsolution.resize(n);\n\t\tminG = 100001;\n\t\tcrG = 0;\n\t\tcrW = 0;\n\t\tBacktrace(n, 1);\n\t\tfor (int i : solution)\n\t\t\tcout << f[i] << endl;\n\t\tcin >> n;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3160,
"score_of_the_acc": -0.3265,
"final_rank": 9
},
{
"submission_id": "aoj_0170_4047554",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n#if 0\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n#else\n\tfor (int i = 0; i < n - 1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n#endif\n\t\n\treturn true;\n}\n\nint getG(int n) {\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (n-i);\n\t}\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (cin>>n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> FoodData[i].name >> FoodData[i].weight >> FoodData[i].limit;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\t//copy(TableIndex, TableIndex + n, Result);\t//OK\n\t\t\t\t//memmove(Result, TableIndex, n);\t\t\t//NG\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tResult[i] = TableIndex[i];\n\t\t\t\t}\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout << FoodData[Result[n-1-i]].name << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3148,
"score_of_the_acc": -0.3531,
"final_rank": 10
},
{
"submission_id": "aoj_0170_4044648",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n#if 1\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n#else\n\tfor (int i = 0; i < n - 1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n#endif\n\t\n\treturn true;\n}\n\nint getG(int n) {\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (cin>>n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> FoodData[i].name >> FoodData[i].weight >> FoodData[i].limit;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\t//copy(TableIndex, TableIndex + n, Result);\t//OK\n\t\t\t\t//memmove(Result, TableIndex, n);\t\t\t//NG\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tResult[i] = TableIndex[i];\n\t\t\t\t}\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout << FoodData[Result[i]].name << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3168,
"score_of_the_acc": -0.4327,
"final_rank": 13
},
{
"submission_id": "aoj_0170_4044641",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n\t/*for (int i = 0; i < n - 1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}*/\n\t\n\treturn true;\n}\n\nint getG(int n) {\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (cin>>n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> FoodData[i].name >> FoodData[i].weight >> FoodData[i].limit;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\t//copy(TableIndex, TableIndex + n, Result);\t//OK\n\t\t\t\t//memmove(Result, TableIndex, n);\t\t\t//NG\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tResult[i] = TableIndex[i];\n\t\t\t\t}\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout << FoodData[Result[i]].name << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3192,
"score_of_the_acc": -0.4939,
"final_rank": 15
},
{
"submission_id": "aoj_0170_4044605",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/*for (int i = 0; i < n-1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}*/\n\n\treturn true;\n}\n\nint getG(int n) {\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (cin>>n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> FoodData[i].name >> FoodData[i].weight >> FoodData[i].limit;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\t//copy(TableIndex, TableIndex + n, Result);\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tResult[i] = TableIndex[i];\n\t\t\t\t}\n\t\t\t\t//memmove(Result, TableIndex, n);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout << FoodData[Result[i]].name << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3044,
"score_of_the_acc": -0.1163,
"final_rank": 1
},
{
"submission_id": "aoj_0170_4044603",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/*for (int i = 0; i < n-1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}*/\n\n\treturn true;\n}\n\nint getG(int n) {\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (cin>>n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> FoodData[i].name >> FoodData[i].weight >> FoodData[i].limit;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, Result);\n\t\t\t\t//memmove(Result, TableIndex, n);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout << FoodData[Result[i]].name << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3044,
"score_of_the_acc": -0.1449,
"final_rank": 3
},
{
"submission_id": "aoj_0170_4044584",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/*for (int i = 0; i < n-1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}*/\n\n\treturn true;\n}\n\nint getG(int n) {\n\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (cin>>n, n) {\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\t/*char buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;*/\n\t\t\tcin >> FoodData[i].name >> FoodData[i].weight >> FoodData[i].limit;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, Result);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\t//printf(\"%s\\n\", FoodData[Result[i]].name.c_str());\n\t\t\tcout << FoodData[Result[i]].name << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3052,
"score_of_the_acc": -0.1653,
"final_rank": 5
},
{
"submission_id": "aoj_0170_4044583",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/*for (int i = 0; i < n-1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}*/\n\n\treturn true;\n}\n\nint getG(int n) {\n\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (cin>>n, n) {\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\t/*char buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;*/\n\t\t\tcin >> FoodData[i].name >> FoodData[i].weight >> FoodData[i].limit;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, Result);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tprintf(\"%s\\n\", FoodData[Result[i]].name.c_str());\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3056,
"score_of_the_acc": -0.1469,
"final_rank": 4
},
{
"submission_id": "aoj_0170_4044582",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/*for (int i = 0; i < n-1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}*/\n\n\treturn true;\n}\n\nint getG(int n) {\n\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (~scanf(\"%d\", &n), n) {\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\t/*char buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;*/\n\t\t\tcin >> FoodData[i].name >> FoodData[i].weight >> FoodData[i].limit;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, Result);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tprintf(\"%s\\n\", FoodData[Result[i]].name.c_str());\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3164,
"score_of_the_acc": -0.4224,
"final_rank": 12
},
{
"submission_id": "aoj_0170_4044579",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i - 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/*for (int i = 0; i < n-1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}*/\n\n\treturn true;\n}\n\nint getG(int n) {\n\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG, minG;\n\n\twhile (~scanf(\"%d\", &n), n) {\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tchar buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tminG = INT_MAX;\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, Result);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tprintf(\"%s\\n\", FoodData[Result[i]].name.c_str());\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3108,
"score_of_the_acc": -0.2796,
"final_rank": 8
},
{
"submission_id": "aoj_0170_4044569",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\tint sum = 0;\n\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (FoodData[TableIndex[i - 1]].limit < sum) {\n\t\t\treturn false;\n\t\t}\n\t}\n\t/*for (int i = 0; i < n-1; i++) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (sum > FoodData[TableIndex[i + 1]].limit) {\n\t\t\treturn false;\n\t\t}\n\t}*/\n\n\treturn true;\n}\n\nint getG(int n) {\n\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG;\n\n\twhile (~scanf(\"%d\", &n), n) {\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tchar buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tint minG = 1000000;\n\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n))) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, Result);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tprintf(\"%s\\n\", FoodData[Result[i]].name.c_str());\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3148,
"score_of_the_acc": -0.3816,
"final_rank": 11
},
{
"submission_id": "aoj_0170_4033481",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\n\nbool checkWeight(int n) {\n\n\tint sum = 0;\n\t/*for (int i = n - 1, j = n - 2; i >= 1, j >= 0; i--, j--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (FoodData[TableIndex[j]].limit < sum) return false;\n\t}*/\n\tfor (int i = n-1; i > 0; i--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (FoodData[TableIndex[i - 1]].limit < sum) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nint getG(int n) {\n\n\tint G = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tG += FoodData[TableIndex[i]].weight * (i + 1);\n\t}\n\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG;\n\n\twhile (~scanf(\"%d\", &n)) {\n\t\tif (n == 0) break;\n\n\t\tfor (int i = 0; i<n; i++) {\n\t\t\tchar buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tint minG = 1000000;\n\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n)) ) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, Result);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i<n; i++) {\n\t\t\tprintf(\"%s\\n\", FoodData[Result[i]].name.c_str());\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3160,
"score_of_the_acc": -0.4408,
"final_rank": 14
},
{
"submission_id": "aoj_0170_4033454",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10], Result[10];\n\nbool checkWeight(int n) {\n\n\tint sum = 0;\n\tfor (int i = n - 1, j = n - 2; i >= 1, j >= 0; i--, j--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (FoodData[TableIndex[j]].limit < sum) return false;\n\t}\n\n\treturn true;\n}\n\nint getG(int n) {\n\n\tint G = 0;\n\t//double sum = 0;\n\tfor (int i = 0; i<n; i++) {\n\t\tG += (double)FoodData[TableIndex[i]].weight * (i + 1);\n\t\t//sum += (double)FoodData[TableIndex[i]].weight;\n\t}\n\treturn G;\n}\n\nint main() {\n\tint n, tmpG;\n\n\twhile (~scanf(\"%d\", &n)) {\n\t\tif (n == 0) break;\n\n\t\t//struct FoodData* FoodData = new struct FoodData[n];\n\n\t\tfor (int i = 0; i<n; i++) {\n\t\t\tchar buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tint minG = 1000000;\n\n\t\tdo {\n\t\t\tif (checkWeight(n) && minG > (tmpG = getG(n)) ) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, Result);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i<n; i++) {\n\t\t\tprintf(\"%s\\n\", FoodData[Result[i]].name.c_str());\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3256,
"score_of_the_acc": -0.6857,
"final_rank": 17
},
{
"submission_id": "aoj_0170_4033440",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10];\n\nbool checkWeight(int n) {\n\n\tint sum = 0;\n\tfor (int i = n - 1, j = n - 2; i >= 1, j >= 0; i--, j--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (FoodData[TableIndex[j]].limit < sum) return false;\n\t}\n\n\treturn true;\n}\n\nint getG(int n) {\n\n\tint G = 0;\n\t//double sum = 0;\n\tfor (int i = 0; i<n; i++) {\n\t\tG += (double)FoodData[TableIndex[i]].weight * (i + 1);\n\t\t//sum += (double)FoodData[TableIndex[i]].weight;\n\t}\n\treturn G;\n}\n\nint main() {\n\tint n;\n\twhile (~scanf(\"%d\", &n)) {\n\t\tif (n == 0) break;\n\n\t\t//struct FoodData* FoodData = new struct FoodData[n];\n\n\t\tfor (int i = 0; i<n; i++) {\n\t\t\tchar buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tint res[10];\n\t\tint minG = 1000000;\n\n\t\tdo {\n\t\t\tdouble tmpG;\n\t\t\tif (checkWeight(n) &&\n\t\t\t\tminG >(tmpG = getG(n))) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, res);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i<n; i++) {\n\t\t\tprintf(\"%s\\n\", FoodData[res[i]].name.c_str());\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3096,
"score_of_the_acc": -0.2776,
"final_rank": 7
},
{
"submission_id": "aoj_0170_4033433",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nstatic const double eps = 1e-8;\n\nclass FoodInfor {\npublic:\n\tstring name;\n\tint weight;\n\tint limit;\n};\n\nFoodInfor FoodData[10];\nint TableIndex[10];\n\nbool checkWeight(int n) {\n\n\tint sum = 0;\n\tfor (int i = n - 1, j = n - 2; i >= 1, j >= 0; i--, j--) {\n\t\tsum += FoodData[TableIndex[i]].weight;\n\t\tif (FoodData[TableIndex[j]].limit < sum) return false;\n\t}\n\n\treturn true;\n}\n\ndouble getG(int n) {\n\n\tdouble G = 0;\n\tdouble sum = 0;\n\tfor (int i = 0; i<n; i++) {\n\t\tG += (double)FoodData[TableIndex[i]].weight * (i + 1);\n\t\tsum += (double)FoodData[TableIndex[i]].weight;\n\t}\n\treturn G / sum;\n}\n\nint main() {\n\tint n;\n\twhile (~scanf(\"%d\", &n)) {\n\t\tif (n == 0) break;\n\n\t\t//struct FoodData* FoodData = new struct FoodData[n];\n\n\t\tfor (int i = 0; i<n; i++) {\n\t\t\tchar buf[64];\n\t\t\tint w, s;\n\t\t\tscanf(\"%s %d %d\", buf, &w, &s);\n\t\t\tFoodData[i].name = buf;\n\t\t\tFoodData[i].limit = s;\n\t\t\tFoodData[i].weight = w;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tTableIndex[i] = i;\n\t\t}\n\n\t\tint* res = new int[n]();\n\t\tdouble minG = 1000000.0;\n\n\t\tdo {\n\t\t\tdouble tmpG;\n\t\t\tif (checkWeight(n) &&\n\t\t\t\tminG >(tmpG = getG(n))) {\n\t\t\t\tcopy(TableIndex, TableIndex + n, res);\n\t\t\t\tminG = tmpG;\n\t\t\t}\n\t\t} while (next_permutation(TableIndex, TableIndex + n));\n\n\t\tfor (int i = 0; i<n; i++) {\n\t\t\tprintf(\"%s\\n\", FoodData[res[i]].name.c_str());\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3100,
"score_of_the_acc": -0.2592,
"final_rank": 6
},
{
"submission_id": "aoj_0170_3986607",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <list>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <cassert>\n#include <random>\n#include<iostream>\n#include<cmath>\n\nstruct Lunch {\n\tint id, weight, strongth;\n\tbool operator<(const Lunch that) const { return id < that.id; }\n};\n\nbool is_not_crash(const std::vector<Lunch>& lunch) {\n\tint sum_weight = 0;\n\tfor (auto r = lunch.rbegin(); r != lunch.rend(); ++r) {\n\t\tif (sum_weight > r->strongth) return false;\n\t\tsum_weight += r->weight;\n\t}\n\treturn true;\n}\ndouble cal_center(const std::vector<Lunch>& lunch) {\n\tdouble denominator = 0, numerator = 0;\n\tfor (auto i = 0; i < lunch.size(); ++i) {\n\t\tdenominator += lunch[i].weight;\n\t\tnumerator += lunch[i].weight * (i + 1.0);\n\t}\n\treturn numerator / denominator;\n}\nint factorial(const int n) {\n\tint result = 1;\n\tfor (auto i = 2; i <= n; ++i) {\n\t\tresult *= i;\n\t}\n\treturn result;\n}\nint main() {\n\twhile (true) {\n\t\tint n; std::cin >> n; if (n == 0) break;\n\t\tstd::vector<std::string> names(n);\n\t\tstd::vector<Lunch> lunches(n), result; \n\t\tfor (auto i = 0; i < n; ++i) {\n\t\t\tlunches[i].id = i;\n\t\t\tstd::cin >> names[i] >> lunches[i].weight >> lunches[i].strongth;\n\t\t}\n\t\tdouble min_center = DBL_MAX;\n\t\tfor (auto i = factorial(n); i > 0; --i) {\n\t\t\tif (is_not_crash(lunches)) {\n\t\t\t\tauto temp = cal_center(lunches);\n\t\t\t\tif (temp < min_center) {\n\t\t\t\t\tmin_center = temp;\n\t\t\t\t\tresult = lunches;\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::next_permutation(lunches.begin(), lunches.end());\n\t\t}\n\t\tfor (const auto i : result) {\n\t\t\tstd::cout << names[i.id] << '\\n';\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3032,
"score_of_the_acc": -0.1429,
"final_rank": 2
},
{
"submission_id": "aoj_0170_3897626",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nmain()\n{\n\tint N;\n\twhile(cin>>N,N)\n\t{\n\t\tvector<pair<string,pair<int,int> > >A;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tstring f;int w,s;cin>>f>>w>>s;\n\t\t\tA.push_back(make_pair(f,make_pair(w,s)));\n\t\t}\n\t\tsort(A.begin(),A.end());\n\t\tvector<string>ans;\n\t\tdouble mG=1e150;\n\t\tdo{\n\t\t\tbool flag=true;\n\t\t\tint T=0;\n\t\t\tfor(int i=0;i<N;i++)\n\t\t\t{\n\t\t\t\tif(T>A[i].second.second)\n\t\t\t\t{\n\t\t\t\t\tflag=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tT+=A[i].second.first;\n\t\t\t}\n\t\t\tif(flag)\n\t\t\t{\n\t\t\t\tdouble G=0;\n\t\t\t\tfor(int i=0;i<N;i++)G+=A[i].second.first*(N-i);\n\t\t\t\tG/=T;\n\t\t\t\tif(mG>G)\n\t\t\t\t{\n\t\t\t\t\tmG=G;\n\t\t\t\t\tans.clear();\n\t\t\t\t\tfor(int i=N;i--;)ans.push_back(A[i].first);\n\t\t\t\t}\n\t\t\t}\n\t\t}while(next_permutation(A.begin(),A.end()));\n\t\tfor(int i=0;i<N;i++)cout<<ans[i]<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 400,
"memory_kb": 3180,
"score_of_the_acc": -1.3776,
"final_rank": 19
}
] |
aoj_0175_cpp
|
４進数
10 進数は現在使われている一般的な記数法で、0、1、2、3、4、5、6、7、8、9 の10 個の記号を用いて全ての数字を表します。
2 進数はコンピュータの世界でよく使われる記数法で、0 と1 の二つの記号を用いて全ての数字を表します。
4 進数で用いられるのは 0、1、2、3 の 4 つの数字だけです。4 進数では 0 から順に数を増やしていったときに 4 まで来たら次の位に桁上がりします。そのため、10 進数の 4 は桁上がりして「10」という表現になります。
10 進数
0
1
2
3
4
5
6
7
8
9
10
...
2 進数
0
1
10
11
100
101
110
111
1000
101
1010
...
4 進数
0
1
2
3
10
11
12
13
20
21
22
...
昔ハワイでは魚やタロイモを指にはさんで数えていたので、10 進数ではなく4 進数を使っていたそうです。
10 進数で入力される整数
n
を 4 進数に変換し出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりは -1 ひとつの行で示されます。各データセットとして１つの整数
n
(0 ≤
n
≤ 1000000) が１行に与えられます。
データセットの数は 2000 を超えません。
Output
入力データセット毎に 4 進数に変換した結果を１行に出力します。
Sample Input
7
4
0
12
10
10000
-1
Output for the Sample Input
13
10
0
30
22
2130100
|
[
{
"submission_id": "aoj_0175_1785421",
"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\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 1000000007\n#define EPS 1e-10\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\n\nstring ans;\nint n;\n\nstring changes(int n){\n\tstringstream ss;\n\tstring res;\n\tss << n;\n\tss >> res;\n\treturn res;\n}\n\nint main(){\n\n\twhile (cin >> n&&n!=-1){\n\t\tif (n == 0){\n\t\t\tcout << 0 << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tbool f = 0;\n\t\tif (n == -1)break;\n\t\tfor (int i = 9; i >= 0; i--){\n\t\t\tint a = 0;\n\t\t\tif (n >= pow(4, i)){\n\t\t\t\ta = n / pow(4, i);\n\t\t\t}\n\t\t\tif (a != 0)f = 1;\n\t\t\tif (f){\n\t\t\t\tans += changes(a);\n\t\t\t\tn -= a*pow(4, i);\n\t\t\t}\n\t\t\t//cout << n << \" \" << a << endl;\n\t\t}\n\t\tcout << ans << endl;\n\t\tans.clear();\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1264,
"score_of_the_acc": -0.2857,
"final_rank": 10
},
{
"submission_id": "aoj_0175_1631555",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int lli;\n\nint main(){\n lli n;\n const int maxi = 1e5;\n while(std::cin >> n, n != -1){\n vector<int> digit(100000, 0);\n for (int i = 0; i < n; i++) {\n int p = 0;\n digit[0]++;\n while(digit[p] == 4){\n digit[p] = 0;\n digit[p + 1]++;\n p++;\n }\n }\n bool flag = true;\n for (int i = maxi - 1; i >= 0; i--) {\n if(digit[i] == 0 and flag)continue;\n flag = false;\n std::cout << digit[i];\n }\n if(flag == true)std::cout << 0 << std::endl;\n else std::cout << std::endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 1584,
"score_of_the_acc": -2,
"final_rank": 11
},
{
"submission_id": "aoj_0175_1244773",
"code_snippet": "#include<iostream>\n#include<cstdio>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n\tint N;\n\twhile(cin>>N,~N){\n\t\tll ans=0;\n\t\tfor(int i=0;i<N;i++){\n\t\t\tans++;\n\t\t\tfor(ll j=1; ans/j%10==4; j*=10) ans += j*6;\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1136,
"score_of_the_acc": -0.0833,
"final_rank": 3
},
{
"submission_id": "aoj_0175_1244771",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<climits>\n#include<string>\n#include<vector>\n#include<list>\n#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cstring>\n#include<stack>\n#include<functional>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n\tint N;\n\twhile(cin>>N,~N){\n\t\tll ans=0;\n\t\tfor(int i=0;i<N;i++){\n\t\t\tans++;\n\t\t\tfor(ll j=1; ans/j%10==4; j*=10) ans += j*6;\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1136,
"score_of_the_acc": -0.0833,
"final_rank": 3
},
{
"submission_id": "aoj_0175_1154751",
"code_snippet": "// #define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <map>\n#include <set>\n#include <stack>\n#include <cmath>\n#include <cstdlib>\n#include <functional>\n#include <locale>\n#include <cctype>\n#include <sstream>\nusing namespace std;\n\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef map<int, int> MAPII;\ntypedef map<double, int> MAPDI;\ntypedef vector<pair<int, int> > VPII;\ntypedef multimap<int, string, greater<int> > MuMAPIS;\n\n#define MP make_pair\n#define fastIO\tcin.tie(0); ios::sync_with_stdio(false);\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n//for gcc (未test)\n// #define FOREACH_IT(it,c)\tfor(typeof(c)::iterator it=(c).begin(); it!=(c).end(); ++it)\n//for Visual Studio\n#define foreach_it(type,it,c) for(type::iterator it=c.begin(), c_end=c.end(); it!=c_end; ++it)\n\n// ------------------- include, typedef, define END. -------------------\n\nvoid Output(stack<int> &ans){\n\twhile (!ans.empty()){\n\t\tcout << ans.top();\n\t\tans.pop();\n\t}\n\tcout << endl;\n}\n\nint main(){\n\tint n=4;\n\tint in;\n\twhile (cin >> in, in>=0){\n\t\tstack<int> ans;\n\t\twhile (in >= n){\n\t\t\t// nで割り切れる限りループ\n\t\t\tans.push(in%n);\n\t\t\tin /= n;\n\t\t}\n\t\tans.push(in);\n\t\tOutput(ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.1429,
"final_rank": 6
},
{
"submission_id": "aoj_0175_842911",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n int n;\n while(cin >> n && (n>=0)) {\n string s;\n while(n>0) {\n s=(char)('0'+n%4)+s;\n n/=4;\n }\n if(s==\"\")s=\"0\";\n cout << s << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1204,
"score_of_the_acc": -0.1518,
"final_rank": 8
},
{
"submission_id": "aoj_0175_743386",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<stack>\n#include<cstdio>\n#include<map>\n#include<functional>\n#include <sstream>\n\nusing namespace std;\n\nstring ans;\n\nstring IntToString(int number)\n{\n stringstream ss;\n ss << number;\n return ss.str();\n}\n\n\nstring sinsuu(int n){\n ans += IntToString(n%4);\n if (n==0){\n ans=\"0\";\n return ans;\n }\n else if( (n/4) < 4 ){\n if ( (n/4) > 0 ) {\n ans += IntToString(n/4);\n }\n reverse( ans.begin(), ans.end());\n return ans;\n }\n else{\n n = n/4;\n return sinsuu(n);\n }\n}\n\nint main(){\n\tint n;\n while (1)\n {\n cin>>n;\n if(n<0)break;\n cout<<sinsuu(n)<<endl;\n ans.clear();\n \n }\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -0.1875,
"final_rank": 9
},
{
"submission_id": "aoj_0175_728142",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nlong int pow(int x, int y)\n{\n long int result = 1;\n for (int i=0; i<y; i++)\n {\n result *= x;\n }\n return result;\n}\n\nlong int dec_to_4(int x)\n{\n long int result = 0;\n for (int i=0; x != 0 ;i++)\n {\n result += (x % 4) * pow(10, i);\n x /= 4;\n }\n return result;\n}\n\nint main()\n{\n while(true)\n {\n int num;\n cin >> num;\n if ( num == -1 ) break;\n\n cout << dec_to_4(num) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0446,
"final_rank": 1
},
{
"submission_id": "aoj_0175_644285",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nvoid dfs(int n) \n{\n if (n != 0) {\n dfs(n / 4);\n cout << n % 4;\n } \n}\n\nint main()\n{\n int n;\n\n while (cin >> n, n != -1) {\n if (n == 0)\n cout << 0;\n else\n dfs(n);\n cout << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0536,
"final_rank": 2
},
{
"submission_id": "aoj_0175_560121",
"code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n\n int n;\n\n while(1){\n\n cin >> n;\n if(n < 0) break;\n\n string s;\n\n while(1){\n s += (n%4 + 48);\n\n n /= 4;\n if(n == 0) break;\n }\n\n for(int i=s.size()-1;i >= 0;i--) cout << s[i];\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1192,
"score_of_the_acc": -0.125,
"final_rank": 5
},
{
"submission_id": "aoj_0175_533602",
"code_snippet": "#include <iostream>\n#include <stack>\nusing namespace std;\n\nint main(void)\n{\n\tint n;\n\n\twhile(cin >> n, n >= 0){\n\t\tif(!n){\n\t\t\tcout << n << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tstack<int> sta;\n\t\twhile(n > 0){\n\t\t\tsta.push(n%4);\n\t\t\tn /= 4;\n\t\t}\n\t\twhile(sta.size()){\n\t\t\tcout << sta.top();\n\t\t\tsta.pop();\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.1429,
"final_rank": 6
}
] |
aoj_0165_cpp
|
宝くじ
ある国の王様は素数とギャンブルが大好きです。この国の通貨の単位はプライムといいます。2007 年 11 月 1 日現在のプライムのクロス円レートは 9973 とちょうど素数になっていたので、王様は大喜びです。この国では 1/101 プライムを1サブプライムとする補助貨幣が使われています。
この国の政府は、国家財政の安定、国民の娯楽、王様の趣味を同時に満足させることを目的に宝くじ振興公社を設立し、宝くじ事業を始めることにしました。素数が大好きな王様は、素数が話題になればそれだけで満足して、賞金をあげたくなります。そこで振興公社は次のような宝くじを考えました。
くじには 0 から
MP
までの一連の番号がつけられている。
MP
はこの国で知られている最大の素数で、毎月一日に官報で告示される。同時に、
MP
以下のすべての素数も発表される。それ以上大きな素数が発見されても、その月の間は、宝くじ振興公社を含む全ての公的な機関では、一日に発表された
MP
を最大の素数として扱う。2007 年 11 月 1 日 には
MP
= 999983 (1000000 以下の最大の素数) が発表された。
宝くじの販売価格は 1 サブプライム。
宝くじの抽選では、当たりくじの番号
p
と賞金算出のための数
m
の組(
p
,
m
) が何組か選ばれる。
p
,
m
はそれぞれ0 以上
MP
以下の整数。
この国で知られている素数の中で
p
-
m
以上
p
+
m
以下のものが
X
個あるとすると、抽選結果(
p
,
m
) の賞金は、
X
プライムとなる。
抽選結果 (
p
,
m
) の賞金
X
プライムは番号
p
の宝くじを持っている当選者に支払われるが、
X
= 0 の場合もあり、この場合には当選者には賞金は支払われない。
賞金のうち 1 プライムは宝くじの売り上げから支出され、
X
- 1 プライムは王様の内廷費から支出される（王様が払ってくれる）。
X
= 0 ならば宝くじの売り上げから 1 プライムが内廷費に繰り入れられる。（王様に対し支払われる）
ひとつの番号
p
が複数の当たりくじになることもある。この場合にはそれぞれの抽選結果(
p
,
m
) から算出される賞金の合計が当選者に支払われる。
このくじでは当たりくじを買った人は抽選結果から関係する素数を探し、その個数を数えるので、国民の話題に素数がよく出てきて王様はとてもご満悦です。宝くじ振興公社としては当たりくじ1本当たり公社負担が 1 プライム、販売価格が 1 サブプライムだから、当たりくじの本数
n
を、販売した宝くじ 101 本あたり 1 本以下となるようにすれば (すなわち、
n
≤ (販売した本数)/101 とすれば) 赤字にはなりません。
問題は内廷費からの支出額です。あなたの仕事は、抽選結果を入力として、2007 年 11 月における宝くじ振興公社が王様に請求する賞金の額を出力するプログラムを作成することです。ただし、請求する賞金の額が負になることはないものとします。
注意
この国における素数の定義も日本の学校教育で学習する内容と同じです。即ち、素数とは 1 と自分自身以外の約数を持たない自然数をいいます（なお、1 は素数ではありません）。
我々は 1000003 が素数であることを知っていますが、この国では 2007 年 11 月段階では知られていません。そのため、999963 以上 1000003 以下の範囲にあるこの国で知られている素数は 999983 と 999979 の 2 個しかありません。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
p
1
m
1
p
2
m
2
:
p
n
m
n
１行目に抽選結果の数
n
(1 ≤
n
≤ 1000000)、続く
n
行に
i
番目の抽選結果の情報
p
i
,
m
i
が空白区切りで与えられます。
データセットの数は 20 を超えません。
Output
データセットごとに王様への請求額をプライム単位（整数）で１行に出力します。
Sample Input
4
5 0
9 1
3 10
11 3
1
999983 20
0
Output for the Sample Input
5
1
|
[
{
"submission_id": "aoj_0165_4265032",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MaxLimit = 1000001;\nbool PrimeNumber[MaxLimit] = { false,false, true,true,false };\nint Total[MaxLimit] = { 0,0,1,2,2 };\n\nvoid findPrimeNumber() {\n\tint limit;\n\tbool flag;\n\n\tfor (int i = 5; i < MaxLimit; i++) {\n\t\tif (i % 2 == 0) {\n\t\t\tPrimeNumber[i] = false;\n\t\t\tTotal[i] = Total[i - 1];\n\t\t\tcontinue;\n\t\t}\n\n\t\tlimit = sqrt(i) + 1;\n\t\tfor (int j = 2; j < limit; j++) {\n\t\t\tif (i%j == 0) {\n\t\t\t\tflag = false;\n\t\t\t\tPrimeNumber[i] = false;\n\t\t\t\tTotal[i] = Total[i - 1];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tflag = true;\n\t\t}\n\t\tif (flag) {\n\t\t\tPrimeNumber[i] = true;\n\t\t\tTotal[i] = Total[i - 1] + 1;\n\t\t}\n\t}\n}\n\nint main() {\n\tint n, p, m, minLimt, maxLimt, cnt, sum;\n\n\tfindPrimeNumber();\n\twhile (cin >> n, n) {\n\t\tsum = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcnt = 0;\n\t\t\tcin >> p >> m;\n\t\t\tminLimt = max(1, p - m);\n\t\t\tmaxLimt = min(MaxLimit-1, p + m);\n\t\t\tcnt = Total[maxLimt] - Total[minLimt-1];\n\t\t\t//cout << p << \":\" << m << \" = \" << cnt << endl;\n\t\t\tif (cnt == 0) {\n\t\t\t\t--sum;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tsum += cnt - 1;\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 7956,
"score_of_the_acc": -0.3309,
"final_rank": 14
},
{
"submission_id": "aoj_0165_4265023",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MaxLimit = 1000001;\nbool PrimeNumber[MaxLimit] = { false,false, true,true,false };\nint Total[MaxLimit] = { 0,0,1,2,2 };\n\nvoid findPrimeNumber() {\n\tint limit;\n\tbool flag;\n\n\tfor (int i = 5; i < MaxLimit; i++) {\n\t\tif (i % 2 == 0) {\n\t\t\tPrimeNumber[i] = false;\n\t\t\tTotal[i] = Total[i - 1];\n\t\t\tcontinue;\n\t\t}\n\n\t\tlimit = sqrt(i) + 1;\n\t\tfor (int j = 2; j < limit; j++) {\n\t\t\tif (i%j == 0) {\n\t\t\t\tflag = false;\n\t\t\t\tPrimeNumber[i] = false;\n\t\t\t\tTotal[i] = Total[i - 1];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tflag = true;\n\t\t}\n\t\tif (flag) {\n\t\t\tPrimeNumber[i] = true;\n\t\t\tTotal[i] = Total[i - 1] + 1;\n\t\t}\n\t}\n}\n\nint main() {\n\tint n, p, m, minLimt, maxLimt, cnt, sumToking, sumToPerson;\n\n\tfindPrimeNumber();\n\twhile (cin >> n, n) {\n\t\tsumToking = sumToPerson = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcnt = 0;\n\t\t\tcin >> p >> m;\n\t\t\tminLimt = max(1, p - m);\n\t\t\tmaxLimt = min(MaxLimit-1, p + m);\n\t\t\tcnt = Total[maxLimt] - Total[minLimt-1];\n\t\t\t/*if (PrimeNumber[minLimt] || PrimeNumber[maxLimt]) {\n\t\t\t\t++cnt;\n\t\t\t}*/\n\t\t\t//cout << p << \":\" << m << \" = \" << cnt << endl;\n\t\t\tif (cnt == 0) {\n\t\t\t\t++sumToking;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tsumToPerson += cnt - 1;\n\t\t\t}\n\t\t}\n\t\tcout << sumToPerson - sumToking << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 7864,
"score_of_the_acc": -0.3281,
"final_rank": 13
},
{
"submission_id": "aoj_0165_4020969",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(int i=0;i<(num);++i)\n#define ALL(c) c.begin(),c.end()\n#define LOOP(i) while(i--)\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=int>\nT in(){T x; cin >> x; return (x);}\ntemplate<typename T=int,typename C=vector<T>>\nC vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}\n\nvoid vout(){cout << endl;}\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}\nvoid out(){cout << endl;}\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}\n\nvector<ll> enum_prime(ll N){\n\tdeque<bool> is_prime(N+1,true);\n\tvector<ll> P;\n\tfor(ll i=2;i<=N;i++){\n\t\tif(is_prime[i]){\n\t\t\tfor(ll j=i*i;j<=N;j+=i){\n\t\t\t\tis_prime[j] = false;\n\t\t\t}\n\t\t\tP.emplace_back(i);\n\t\t}\n\t}\n\treturn P;\n}\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tauto P=enum_prime(1000000);\n\tvector<ll> H(2000000,0),S(2000001,0);\n\tfor(auto& x:P) H[x]=1;\n\tfor(int i=0;i<2000000;i++){\n\t\tS[i+1]=S[i]+H[i];\n\t}\n\n\twhile(true){\n\t\tll N=in();\n\t\tif(!N) break;\n\n\t\tll sum=0;\n\t\tREP(i,N){\n\t\t\tll A=in(),B=in();\n\t\t\tll L=max(A-B,1LL),R=A+B;\n\t\t\tsum += (S[R+1]-S[L])?S[R+1]-S[L]-1:-1;\n\t\t}\n\t\tout(sum);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 34664,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_0165_3596131",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <bitset>\n#include <cstdio>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cassert>\n#include <numeric>\n#define rep(i,n) Rep(i,0,n)\n#define Rep(i,k,n) for(int i=k ; i<n ; i++)\n#define rep1(i,n) for(int i=1 ; i<=n ; i++)\n#define Rep1(i,k,n) for(int i=k ; i<=n ; i++)\n#define rrep(i,n) for(int i=n ; i>=0 ; i--)\n#define vi vector<int>\n#define vii vector<vector<int>>\n#define mii map<int,int>\n#define Sort(v) sort(v.begin(),v.end())\n#define Reverse(v) reverse(v.begin(),v.end())\n#define ALL(a) (a).begin(),(a).end()\n#define pb push_back\n#define mp make_pair\n//#define int ll\ntypedef long long ll;\n\nconst int md = 1000000007;\nconst int INF = 1<<30;\nusing namespace std;\n\n//vi prime(1000000,0);\nvector<bool> isp;\n\nvoid makePrime(int n){\n isp.assign(n+1,true);\n int id = 0;\n for(int i=2 ; i <= n ; i++){\n if(!isp[i]) continue;\n\n for(int k = i*2 ; k <= n ; k += i){\n isp[k] = false;\n }\n /*\n prime[id] = i;\n id++;\n */\n \n //prime.pb(i);\n }\n //Sort(prime);\n}\n\nll check(int a, int b){\n ll ans = 0;\n if(a-b <= 2) ans++;\n int s;\n if((a-b)%2 == 0) s = a-b+1;\n else s = a - b;\n\n for(int i = max(s,3); i <= min(a+b,999983) ; i += 2) {\n if(isp[i]) ans++;\n }\n return ans;\n}\nint main(){\n makePrime(999983);\n //cout << prime.size() << endl;\n //cout << binary_search(ALL(prime),2) << endl;\n int n; \n while(true){\n cin >> n;\n if(n == 0) break;\n ll ans = 0;\n rep(i,n){\n int a,b; cin >> a >> b;\n //cout << check(a,b) << endl;\n int tmp = check(a,b);\n //cout << \"check: \" << tmp << endl;\n ans += check(a,b)-1;\n \n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 900,
"memory_kb": 3220,
"score_of_the_acc": -0.9448,
"final_rank": 17
},
{
"submission_id": "aoj_0165_3006345",
"code_snippet": "#include<iostream>\n#include<set>\nusing namespace std;\n\nbool nonprime[1000001] = {};\nint accum[1000001] = {};\nint scoresheet[1000001];\n\nint main(){\n nonprime[0] = nonprime[1] = true;\n for(int i = 2; i <= 1000000; i++){\n if(!nonprime[i]){\n for(int j = i+i; j <= 1000000; j+=i){\n nonprime[j] = true;\n }\n }\n }\n\n for(int i = 2; i <= 1000000; i++){\n if(nonprime[i-1]){\n accum[i] = accum[i-1];\n }else{\n accum[i] = accum[i-1] + 1;\n }\n }\n\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n for(int i = 0; i <= 1000000; i++) scoresheet[i] = 0;\n\n set<int> result;\n int ans = 0;\n\n for(int i = 0; i < n; i++){\n int p, m;\n cin >> p >> m;\n\n int cnt = accum[min(p+m, 1000000)] - accum[max(0, p-m)];\n if(p+m <= 1000000 && !nonprime[p+m]) cnt++;\n\n result.insert(p);\n scoresheet[p] += cnt;\n\n if(cnt == 0) ans--;\n else ans += cnt-1;\n }\n/*\n for(set<int>::iterator it = result.begin(); it != result.end(); it++){\n int x = scoresheet[*it];\n if(x == 0) ans--;\n else ans += x-1;\n }\n*/\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11936,
"score_of_the_acc": -0.3103,
"final_rank": 12
},
{
"submission_id": "aoj_0165_2192310",
"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#include <bitset>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e9 + 7;\nconst ll MOD = 1e9 + 7;\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 EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n\nint n;\n\nbool is_prime[2000100];\nint cnt[2000100];\n\nint main(){\n\tfill(is_prime, is_prime + 1000000, 1);\n\tis_prime[0] = 0;\n\tis_prime[1] = 0;\n\tfor (int i = 2; i <= (int)1e6; i++){\n\t\tif (is_prime[i]){\n\t\t\tfor (int j = i * 2; j <= (int)1e6; j += i){\n\t\t\t\tis_prime[j] = 0;\n\t\t\t}\n\t\t}\n\t}\n\tFOR(i, 1, 2000000+10){\n\t\tif (is_prime[i])cnt[i]++;\n\t\tcnt[i] += cnt[i - 1];\n\t}\n\t//REP(i, 10){\n\t//\tcout << i << \" \" << cnt[i] << endl;\n\t//}\n\t//for (int i = 999983 - 20; i <= 999983 + 20; i++){\n\t//\tcout << i << \" \" << cnt[i] << endl;\n\t//}\n\twhile (cin >> n&&n){\n\t\tint ans = 0;\n\t\tREP(i, n){\n\t\t\tint p, m;\n\t\t\tcin >> p >> m;\n\t\t\tint x = cnt[p + m];\n\t\t\tif (p - m - 1 >= 0)x -= cnt[p - m - 1];\n\t\t\tans += (x - 1);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11784,
"score_of_the_acc": -0.3057,
"final_rank": 11
},
{
"submission_id": "aoj_0165_2112206",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\nint N;\nint BIT[6000000];\n\nvoid add(int a, int w){\n\t\n\t// a?????????????´????w????¶???? O(log N)\n\t\n\tfor(int x = a; x <= N; x += x & -x){\n\t\tBIT[x] += w;\n\t}\n}\n\nint sum(int a){\n\t\n\t// 1??????a?????§???????´????????¨?????????? O(log N)\n\t\n\tint ret = 0;\n\tfor(int x = a; x > 0; x -= x & -x){\n\t\tret += BIT[x];\n\t}\n\treturn ret;\n}\n\nint main(){\n\t\n\tN = 2000000;\n\tint num_max = 1000000;\n\t\n\tbool a[1000000];\n\t\n\tfor(int i = 0; i < num_max; i++){\n\t\ta[i] = true;\n\t}\n\t\n\ta[0] = false;\n\ta[1] = false;\n\t\n\tfor(int i = 2; i < num_max; i++){\n\t\tif(a[i]){\n\t\t\tfor(int j = i * 2; j < num_max; j += i){\n\t\t\t\ta[j] = false;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tfor(int i = 0; i < 6000000; i++){\n\t\tBIT[i] = 0;\n\t}\n\t\n\tfor(int i = 0; i < num_max; i++){\n\t\tif(a[i]){\n\t\t\tadd(i, 1);\n\t\t}\n\t}\n\t\n\twhile(true){\n\t\t\n\t\tint n;\n\t\t\n\t\tcin >> n;\n\t\t\n\t\tif(n == 0){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tint p, m, hit_num;\n\t\t\tcin >> p >> m;\n\t\t\tif(p - m <= 2){\n\t\t\t\thit_num = sum(p + m);\n\t\t\t}else{\n\t\t\t\thit_num = sum(p + m) - sum(p - m - 1);\n\t\t\t}\n\t\t\t\n\t\t\t//cout << hit_num << endl;\n\t\t\t\n\t\t\tans = ans + hit_num - 1;\n\t\t\t\n\t\t}\n\t\t\n\t\tif(ans < 0){\n\t\t\tans = 0;\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t\t\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 27396,
"score_of_the_acc": -0.7794,
"final_rank": 16
},
{
"submission_id": "aoj_0165_2077371",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nvector<int>primes(1e6+1);\nvector<int>sums(1e6 + 1);\nvoid hurui(const int amax) {\n\tstatic bool flag = false;\n\tif (flag)return;\n\tvector<int>sos;\n\tsos = vector<int>(amax + 1, true);\n\tsos[0] = false; sos[1] = false;\n\tfor (int i = 2; i <= amax; ++i) {\n\t\tif (sos[i]) {\n\t\t\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\n\t\t}\n\t}\n\tfor (int i = 0; i <= amax; ++i) {\n\t\tif (sos[i]) {\n\t\t\tprimes[i] = true;\n\t\t}\n\t}\n\tflag = true;\n}\n\n\nint main() {\n\thurui(999983);\n\tfor (int i = 0; i <1e6; ++i) {\n\t\tsums[i + 1] = sums[i] + primes[i + 1];\n\t}\n\twhile (1) {\n\t\tint N; cin >> N;\n\t\tif (!N)break;\n\t\tlong long int prize = 0;\n\t\twhile (N--) {\n\t\t\tlong long int p, m; cin >> p >> m;\n\t\t\tint amax = min(999983ll, p + m);\n\t\t\tint amin = max(0ll, p - m-1);\n\t\t\tconst int aprize = sums[amax] - sums[amin];\n\t\t\tprize += aprize - 1;\n\t\t}\n\t\tcout << max(0ll,prize )<< endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 14180,
"score_of_the_acc": -0.3784,
"final_rank": 15
},
{
"submission_id": "aoj_0165_1965347",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define INF (1<<29)\n\nvector<bool> used;\nlong long sum[1000001];\n\nint main() {\n\tused.resize(1000001, false);\n\tused[0] = used[1] = true;\n\tfor (int i = 2; i * i <= 1000001; i++) {\n\t\tif (!used[i]) {\n\t\t\tsum[i]++;;\n\t\t\tfor (int j = i; j <= 1000001; j += i) used[j] = true;\n\t\t}\n\t}\n\tREP(i, 1000001) if (!used[i]) sum[i]++;\n\t\n\tFOR(i, 1, 1000001) sum[i] += sum[i - 1];\n\t\n\tint n;\n\twhile (cin >> n, n) {\n\t\tlong long ans = 0;\n\t\tREP(i, n) {\n\t\t\tint p, m;\n\t\t\tscanf(\"%d %d\", &p, &m);\n\t\t\t\n\t\t\tint a = p - m < 0 ? 0 : p - m - 1;\n\t\t\tint b = p + m > 1000001 ? 1000000 : p + m;\n\t\t\t\n\t\t\tint cnt = sum[b] - sum[a];\n\t\t\tif (cnt == 0) ans--;\n\t\t\telse ans += cnt - 1;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 9176,
"score_of_the_acc": -0.2265,
"final_rank": 10
},
{
"submission_id": "aoj_0165_1965307",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define INF (1<<29)\n\nvector<int> prime;\nvector<bool> used;\n\nint main() {\n\tused.resize(1000001, false);\n\tused[0] = used[1] = true;\n\tprime.push_back(-INF);\n\tfor (int i = 2; i * i <= 1000001; i++) {\n\t\tif (!used[i]) {\n\t\t\tprime.push_back(i);\n\t\t\tfor (int j = i; j <= 1000001; j += i) used[j] = true;\n\t\t}\n\t}\n\tREP(i, 1000001) if (!used[i]) prime.push_back(i);\n\t\n\tint n;\n\twhile (cin >> n, n) {\n\t\tlong long ans = 0;\n\t\tREP(i, n) {\n\t\t\tint p, m;\n\t\t\tscanf(\"%d %d\", &p, &m);\n\t\t\tvector<int>::iterator it1 = upper_bound(prime.begin(), prime.end(), p + m) - 1;\n\t\t\tvector<int>::iterator it2 = upper_bound(prime.begin(), prime.end(), p - m) - 1;\n\t\t\tint cnt;\n\t\t\t\n\t\t\tif (*it1 < p - m) {\n\t\t\t\tif (*(it1 + 1) > p + m) it1 = prime.end();\n\t\t\t\telse it1++;\n\t\t\t}\n\t\t\tif (*it2 < p - m) {\n\t\t\t\tif (*(it2 + 1) > p + m) it2 = prime.end();\n\t\t\t\telse it2++;\n\t\t\t}\n\t\t\t\n\t\t\tif (it1 == prime.end() || it2 == prime.end())\n\t\t\t\tcnt = 2 - (it1 == prime.end()) - (it2 == prime.end()); \n\t\t\telse\n\t\t\t\tcnt = it1 - it2 + 1;\n\t\t\t\n\t\t\tif (cnt == 0) ans--;\n\t\t\telse ans += cnt - 1;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1712,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0165_1950965",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nbool p[1000000];\nint prime[80000];\nint top;\nint F(int p,int m){\n\tint left,right,midl,midr;\n\tleft=0,right=top;\n\twhile(true){\n\t\tif(left>=right-1)break;\n\t\tmidl=(left+right)/2;\n\t\tif(prime[midl]<p-m)left=midl;\n\t\telse right=midl;\n\t}\n\tif(prime[midl]>=p-m)midl--;\n\tif(p-m<=2)midl=-1;\n\tleft=0,right=top;\n\twhile(true){\n\t\tif(left>=right-1)break;\n\t\tmidr=(left+right)/2;\n\t\tif(prime[midr]==p+m)break;\n\t\tif(prime[midr]<p+m)left=midr;\n\t\telse right=midr;\n\t}\n\tif(prime[midr]>p+m)midr--;\n\t//cout<<\"%\"<<prime[midl]<<\" \"<<prime[midr]<<endl;\n\treturn midr-midl;\n}\nint main(){\n\tfor(int i=0;i<1000000;i++)p[i]=true;\n\tfor(int i=2;i<1000;i++)if(p[i])for(int j=i*i;j<1000000;j+=i)p[j]=false;\n\ttop=0;\n\tfor(int i=2;i<1000000;i++)if(p[i]){prime[top]=i;top++;}\n\tint n,p,m,ans;\n\twhile(true){\n\tcin>>n;\n\tif(n==0)break;\n\tans=0;\n\tfor(int u=0;u<n;u++){\n\t\tcin>>p>>m;\n\t\tans+=F(p,m)-1;\n\t\t//cout<<\"#\"<<F(p,m)<<endl;\n\t}\n\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2444,
"score_of_the_acc": -0.0222,
"final_rank": 2
},
{
"submission_id": "aoj_0165_1630403",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint x[2000000];\n\nvoid prime(int p) {\n\tx[2] = 1;\n\tfor (int i = 3; i < p; i += 2) {\n\t\tfor (int j = 3; j * j <= i; j += 2) {\n\t\t\tif (i%j == 0) { goto E; }\n\t\t}\n\t\tx[i] = 1;\n\tE:;\n\t}\n}\n\nint n, m, c, sum;\n\nint main() {\n\tprime(1000000);\n\twhile (true) {\n\t\tsum = 0;\n\t\tcin >> n;\n\t\tif (n == 0) { break; }\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> m >> c;\n\t\t\tfor (int j = max(0, m - c); j <= min(1000000, m + c); j++) {\n\t\t\t\tsum += x[j];\n\t\t\t}\n\t\t\tsum -= 1;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 820,
"memory_kb": 7016,
"score_of_the_acc": -0.9791,
"final_rank": 18
},
{
"submission_id": "aoj_0165_1525083",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n#define MP 999983\n\nint main() {\n\tvector<int> data(MP+1, 0);\n\tdata[0] = data[1] = 1;\n\tvector<int> data2;\n\tfor (int i = 2; i*i <= MP; i++) {\n\t\tif (data[i] == 0) {\n\t\t\tfor (int j = 2; i*j <= MP; j++) {\n\t\t\t\tdata[i*j] = 1;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <= MP; i++) {\n\t\tif (data[i] == 0) {\n\t\t\tdata2.push_back(i);\n\t\t}\n\t}\n\tint n;\n\twhile (cin >> n) {\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tint p, m;\n\t\tint counter2 = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> p >> m;\n\t\t\tint ma, mi;\n\t\t\tma = min(p+m, MP);\n\t\t\tmi = max(p-m, 0);\n\t\t\tvector<int>::iterator ite = lower_bound(data2.begin(), data2.end(), mi);\n\t\t\tvector<int>::iterator ite2 = upper_bound(data2.begin(), data2.end(), ma);\n\t\t\t//cout << ite2-ite << endl;\n\t\t\tcounter2 += ite2-ite-1;\n\t\t}\n\t\tcout << counter2 << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5500,
"score_of_the_acc": -0.115,
"final_rank": 6
},
{
"submission_id": "aoj_0165_1525080",
"code_snippet": "#include <iostream>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n \nusing namespace std;\n \n#define pb(n)\tpush_back(n)\n#define mp(n,m) make_pair(n,m)\n#define fi \tfirst\n#define se \tsecond\n#define all(r) (r).begin(),(r).end()\n \n#define REP(i,s,e)\tfor(int i=(s); i<(e); i++)\n#define rep(i,n)\tREP(i,0,n)\n#define REPE(i,s,e)\tfor(int i=s; i>e; i--)\n#define repe(i,n)\tREPE(i,n,-1)\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n \ntypedef vector<vi> vii;\n \nconst int IMAX=((1<<30)-1)*2+1;\nconst int INF=100000000;\nconst double EPS=1e-10;\n//int mod=1000000007\n \n\n \n\nint MP=999983;\n\nvi is_prime(MP+1,1);\nvi sum_prime(MP+1,0);\n\n\nvoid set_prime(){\n\tis_prime[0]=is_prime[1]=0;\n\tfor(int i=2; i<=MP; i++){\n\t\tif(is_prime[i]){\n\t\t\tfor(int j=i*2; j<MP; j+=i){\n\t\t\t\tis_prime[j]=0;\n\t\t\t}\n\t\t}\n\t\tsum_prime[i]=sum_prime[i-1]+is_prime[i];\n\t}\n}\n\nint main(){\n\tset_prime();\n\tint n,p,m;\n\tint x;\n\twhile(cin>>n && n>0){\n\t\tint ans=0;\n\n\t\trep(i,n){\n\t\t\tcin>>p>>m;\n\t\t\tx=(p+m>MP?sum_prime[MP]:sum_prime[p+m])-(p-m-1>0?sum_prime[p-m-1]:0);\n\t\t\tif(x==0) ans--;\n\t\t\telse{\n\t\t\t\tans+=x-1;\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 8796,
"score_of_the_acc": -0.215,
"final_rank": 9
},
{
"submission_id": "aoj_0165_1525076",
"code_snippet": "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\n#define maxs(x,y) x=max(x,y)\n#define mins(x,y) x=min(x,y)\nbool prime[1000000];\nint a[1000000];\nvoid mainmain(){\n int n;\n rep(i,1000000){\n prime[i]=true;\n }\n prime[0]=prime[1]=false;\n for(int i=2;i*i<=1000000;i++){\n if(prime[i]){\n for(int j=i*i;j<1000000;j+=i){\n prime[j]=false;\n }\n }\n }\n rep(i,1000000){\n if(!i) continue;\n a[i]=a[i-1];\n if(prime[i]) a[i]++;\n }\n while(cin>>n){\n if(!n) return;\n ll ans=0;\n rep(i,n){\n int x,y;\n cin>>x>>y;\n int l=max(1,x-y);\n int r=min(1000000-1,x+y);\n int t=a[r]-a[l-1]-1;\n // cout<<x<<\" \"<<y<<\" \"<<t<<\" \"<<l<<\" \"<<r<<endl;\n ans+=t;\n }\n cout<<ans<<endl;\n }\n}\n\n\nsigned main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout<<fixed<<setprecision(20);\n mainmain();\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6076,
"score_of_the_acc": -0.1324,
"final_rank": 8
},
{
"submission_id": "aoj_0165_1499687",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint prime[999985];\nint main()\n{\n fill_n(prime, 999985, 1);\n prime[1] = 0;\n for(int i = 2; i * i <= 999985; i++) {\n if(prime[i]) {\n for(int j = i + i; j <= 999985; j += i) {\n prime[j] = 0;\n }\n }\n }\n for(int i = 1; i <= 999985; i++) {\n prime[i] += prime[i - 1];\n }\n\n int n;\n while(scanf(\"%d\", &n), n) {\n long long ret = 0LL;\n for(int i = 0; i < n; i++) {\n int p, m;\n scanf(\"%d %d\", &p, &m);\n int low = max(1, p - m);\n int high = min(999984, p + m);\n ret += prime[high] - prime[low - 1] - 1;\n }\n printf(\"%d\\n\", ret);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5092,
"score_of_the_acc": -0.1026,
"final_rank": 4
},
{
"submission_id": "aoj_0165_1476568",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst int S=1000001;\n\nbool f[S];\nint im[S];\n\nint main(){\n\n fill_n(f,S,true);\n f[0]=f[1]=false;\n\n for(int i=2;i<S;i++){\n if(f[i])im[i]++;\n im[i]+=im[i-1];\n if(!f[i])continue;\n for(int j=2;i*j<S;j++)f[i*j]=false;\n }\n\n int n;\n while(cin>>n,n){\n int ans=0;\n while(n--){\n int p,m;\n cin>>p>>m;\n int v=im[min(S-1,p+m)]-im[max(0,p-m-1)];\n ans+=v-1;\n }\n\n cout<<max(0,ans)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6044,
"score_of_the_acc": -0.1315,
"final_rank": 7
},
{
"submission_id": "aoj_0165_1259764",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MAX = 999984;\nvector<int> v;\nbool prime[MAX];\n\nvoid sieve(){\n fill(prime, prime+MAX, true);\n prime[0] = prime[1] = false;\n\n for(int i=0; i < MAX; i++){\n if(!prime[i]) continue;\n v.push_back(i);\n for(int j=i+i; j < MAX; j += i){\n prime[j] = false;\n }\n }\n}\n\nint main(){\n sieve();\n int n;\n while(cin >> n, n){\n int ans = 0;\n for(int i=0; i< n; i++){\n int a, b;\n cin >> a >> b;\n int p = lower_bound(v.begin(), v.end(), a+b+1) - lower_bound(v.begin(), v.end(), a-b);\n ans += p;\n }\n ans -= n;\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2564,
"score_of_the_acc": -0.0259,
"final_rank": 3
},
{
"submission_id": "aoj_0165_1249662",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint prime[1000001];\n\nint main()\n{\n\tfor (int i = 2; i <= 1000000; i++){\n\t\tprime[i] = 1;\n\t}\n\tfor (int i = 2; i * i <= 1000000; i++){\n\t\tfor (int j = i * i; j <= 1000000; j += i){\n\t\t\tprime[j] = 0;\n\t\t}\n\t}\n\tfor (int i = 1; i <= 1000000; i++){\n\t\tprime[i] += prime[i - 1];\n\t}\n\t\n\tint n;\n\twhile (scanf(\"%d\", &n), n){\n\t\tint res = 0;\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tint p, m;\n\t\t\tscanf(\"%d %d\", &p, &m);\n\t\t\tint x = prime[min(p + m, 1000000)] - prime[max(p - m - 1, 0)];\n\t\t\tres += x ? x - 1 : -1;\n\t\t}\n\t\tprintf(\"%d\\n\", res);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5092,
"score_of_the_acc": -0.1026,
"final_rank": 4
},
{
"submission_id": "aoj_0165_1215221",
"code_snippet": "#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nconst long N=1000000;\n\nint main(){\n\tbool prime[N+1];\n\t\n\tfor(long i=0; i<=N; ++i) prime[i]=true;\n\tprime[0]=prime[1]=false;\n\tfor(long i=2; i<=N; ++i){\n\t\tif(prime[i]) for(long j=2; i*j<=N; ++j) prime[i*j]=false;\n\t}\n\t\n\twhile(1){\n\t\tint n;\n\t\tscanf(\" %d\", &n);\n\t\tif(n==0) break;\n\t\t\n\t\tlong ans=0;\n\t\tfor(int i=0; i<n; ++i){\n\t\t\tlong p, m;\n\t\t\tscanf(\" %ld %ld\", &p, &m);\t\n\t\t\t\n\t\t\tlong x=0;\n\t\t\tint y=0;\n\t\t\tif((p+m)%2==0) y=1;\n\t\t\t\n\t\t\tif(p-m<=2) ++x;\n\t\t\t\n\t\t\tfor(long j=p-m+y; j<=p+m-y; j+=2){\n\t\t\t\t//printf(\"j=%ld\\n\", j);\n\t\t\t\tif(j<2) continue;\n\t\t\t\tif(j>N) break;\n\t\t\t\t\n\t\t\t\tif(prime[j]) x++;\n\t\t\t}\n\t\t\t\n\t\t\tans+=x-1;\n\t\t\t//printf(\"%ld\\n\", ans);\n\t\t}\t\n\t\t\n\t\tprintf(\"%ld\\n\", ans);\n\t}\n}",
"accuracy": 1,
"time_ms": 1000,
"memory_kb": 2160,
"score_of_the_acc": -1.0136,
"final_rank": 20
}
] |
aoj_0172_cpp
|
博士の研究室
会津大学の鶴賀博士はとても研究熱心なことで有名です。彼の研究室には複数の学生がいますが、彼は毎日夜遅くまで研究をするので必ず最後に帰宅します。彼の研究室にはドアでつながった複数の部屋があり、最後に研究室を出る人がすべての部屋の明かりを消して帰宅することになっています。
最近、大学では省エネに力を入れているため、すべての明かりが消えているか厳しくチェックされます。困ったことに彼は誰もが認める極度の臆病者で、明かりの消えた部屋には決して入ることができません。そこで、彼はある部屋の照明のON/OFFを他の部屋から操作できるように研究室の照明設備を改造しました。
ところが、予算の都合で１つの部屋からコントロールできる部屋が限られています。その上、帰宅時の各部屋の明かりの状態も日によって異なるため、全ての明かりを消して出口までたどりつくのに毎日かなりの時間が掛かっています。そこで、研究員のあなたが博士を助けるためにプログラムを作成することになりました。
研究室の部屋情報、各部屋の明かりの点灯情報、各部屋の照明スイッチの情報を入力とし、博士がすべての明かりを消して帰宅できるかどうかを出力するプログラムを作成してください。ただし、部屋の数
n
は 1 以上 15 以下の整数、ドアの数
m
は 1 以上 30 以下の整数、照明の点灯情報
l
は 0 または 1 の整数でそれぞれ消灯と点灯を表し、各部屋には 1 以上
n
以下の整数で番号が付与されているものとします。出口は番号
n
の部屋に存在し、博士は常に部屋 1 からスタートするものとします。
なお、出力は、博士の取るべき行動に応じて以下の 3 通りに分けて出力します。
ケース１
.
出口以外の全ての明かりを消して出口にたどりつける場合（経路の過程で出口を通ってもよい）。
You can go home in X steps.
と出力します。ここで X は部屋の移動、スイッチのON/OFF をそれぞれ１ステップとした場合の、博士の部屋から出口にたどり着くまでの最短のステップ数です。さらに、以下の文字列に従い博士の部屋から出口までの経路（博士のとるべき行動）を X 行で出力します。
部屋 R へ移動する場合
Move to room R.
部屋 R の照明を消す場合
Switch off room R.
部屋 R の照明を点灯する場合
Switch on room R.
ここで、R は部屋の番号を表します。博士がある部屋に移動した直後、複数のスイッチを操作して次の部屋に移動する場合は操作する部屋番号が小さいほうから出力してください。この条件を満たす限り、複数の解がある場合は、どれを出力してもかまいません。この情報をもとに、博士は無事帰宅することができます。
ケース2
. 出口にたどり着くことはできるが、出口のある部屋以外の全ての明かりを消すことが
できない場合。
You can not switch off all lights.
と出力する。この場合、博士は省エネを守らなかったとして大学に罰せられます。
ケース3
. どうあがいても出口にたどり着けない場合。
Help me!
と出力する。この場合、博士は警備員に緊急救助を求めます。
簡単な例を示します。この例では、研究室は 4 つの部屋で構成され、部屋 1 と 2、2 と 3、2 と 4 がそれぞれ繋がっています。また、部屋 1 及び 4 から部屋 2、3 の照明を操作することができ、部屋 3 から部屋 1、2、4 の照明を操作することができます。最初、部屋 2、3、4 の照明が消えた状態で、博士が部屋 1 にいます。
この状況では、博士が取るべき行動は次のようになります。
部屋2と3の照明をonにする。
部屋2に移動する。
部屋3に移動する。
部屋1の照明をoffにし、部屋4の照明をonにする。
部屋2に移動する。
部屋4に移動する。
部屋2と3の照明をoffにする。
これで博士は部屋 4 以外の照明を消すことができ、帰宅することができます。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロ2つの行で示されます。
各データセットは以下の形式で与えられます。
n
m
s
1
t
1
s
2
t
2
:
s
m
t
m
l
1
l
2
...
l
n
k
1
r
1
r
2
...
r
k
1
k
2
r
1
r
2
...
r
k
2
:
k
n
r
1
r
2
...
r
k
n
１行目に部屋の数
n
(1 ≤
n
≤ 15) とドアの数
m
(1 ≤
m
≤ 30) が空白区切りで与えられます。続く
m
行に
i
個目のドアの情報が与えられます。
s
i
t
i
は部屋
s
i
と部屋
t
i
がドアで繋がっていることを表します。
続く１行に、部屋
i
の照明の点灯情報
l
i
(0 または 1) が空白区切りで与えられます。
続く
n
行に部屋
i
のスイッチ情報が与えられます。
k
i
(0 ≤
k
i
≤ 12) は部屋
i
のスイッチの数、
r
1
...
r
k
i
は照明を操作できる部屋の番号を表します。
データセットの数は100 を超えません。
Output
データセットごとに、上記の 3 通りの結果に応じて以下の形式で出力します。
ケース 1 の場合
1行目: You can go home in X steps.
2行目: 1つ目の博士が取るべき行動
3行目: 2つ目の博士が取るべき行動
:
X+1 行目: X 個目の博士が取るべき行動
ケース 2 の場合
1 行目: You can not switch off all lights.
ケース 3 の場合
1 行目: Help me!
Sample Input
4 3
1 2
2 3
2 4
1 0 0 0
2 2 3
0
3 1 2 4
2 2 3
4 3
1 2
2 3
2 4
1 0 0 0
2 2 3
0
3 1 2 4
1 3
4 3
1 2
2 3
2 4
1 0 0 0
2 2 3
0
2 1 2
2 2 3
0 0
Output for the Sample Input
You can go home in 10 steps.
Switch on room 2.
Switch on room 3.
Move to room 2.
Move to room 3.
Switch off room 1.
Switch on room 4.
Move to room 2.
Move to room 4.
Switch off room 2.
Switch off room 3.
You can not switch off all lights.
Help me!
|
[
{
"submission_id": "aoj_0172_3973258",
"code_snippet": "#include <queue>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint main() {\n\tint N, M;\n\twhile (cin >> N >> M, N) {\n\t\tvector<vector<int> > G(N);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tint a, b;\n\t\t\tcin >> a >> b; --a, --b;\n\t\t\tG[a].push_back(b);\n\t\t\tG[b].push_back(a);\n\t\t}\n\t\tint inibit = 0;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint x;\n\t\t\tcin >> x;\n\t\t\tinibit |= x << i;\n\t\t}\n\t\tvector<int> op(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint c;\n\t\t\tcin >> c;\n\t\t\tfor (int j = 0; j < c; ++j) {\n\t\t\t\tint x;\n\t\t\t\tcin >> x; --x;\n\t\t\t\tif (x != i) op[i] |= 1 << x;\n\t\t\t}\n\t\t}\n\t\tvector<vector<int> > dist(1 << N, vector<int>(N, -1));\n\t\tvector<vector<pair<int, int> > > pre(1 << N, vector<pair<int, int> >(N));\n\t\tqueue<pair<int, int> > que;\n\t\tif (inibit & 1) {\n\t\t\tdist[inibit][0] = 0;\n\t\t\tque.push(make_pair(inibit, 0));\n\t\t}\n\t\twhile (!que.empty()) {\n\t\t\tpair<int, int> u = que.front(); que.pop();\n\t\t\tint bit = u.first, pos = u.second;\n\t\t\tfor (int i : G[pos]) {\n\t\t\t\tif (((bit >> i) & 1) && dist[bit][i] == -1) {\n\t\t\t\t\tdist[bit][i] = dist[bit][pos] + 1;\n\t\t\t\t\tpre[bit][i] = make_pair(bit, pos);\n\t\t\t\t\tque.push(make_pair(bit, i));\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tif (((op[pos] >> i) & 1) && dist[bit ^ (1 << i)][pos] == -1) {\n\t\t\t\t\tdist[bit ^ (1 << i)][pos] = dist[bit][pos] + 1;\n\t\t\t\t\tpre[bit ^ (1 << i)][pos] = make_pair(bit, pos);\n\t\t\t\t\tque.push(make_pair(bit ^ (1 << i), pos));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[1 << (N - 1)][N - 1] == -1) {\n\t\t\tbool escape = false;\n\t\t\tfor (int i = 0; i < 1 << N; ++i) {\n\t\t\t\tif (dist[i][N - 1] != -1) {\n\t\t\t\t\tescape = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << (escape ? \"You can not switch off all lights.\" : \"Help me!\") << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"You can go home in \" << dist[1 << (N - 1)][N - 1] << \" steps.\" << endl;\n\t\t\tpair<int, int> cur = make_pair(1 << (N - 1), N - 1);\n\t\t\tvector<pair<int, int> > path = { cur };\n\t\t\twhile (cur != make_pair(inibit, 0)) {\n\t\t\t\tcur = pre[cur.first][cur.second];\n\t\t\t\tpath.push_back(cur);\n\t\t\t}\n\t\t\treverse(path.begin(), path.end());\n\t\t\tvector<pair<string, int> > ans;\n\t\t\tfor (int i = 1; i < path.size(); ++i) {\n\t\t\t\tif (path[i - 1].second != path[i].second) {\n\t\t\t\t\tans.push_back(make_pair(\"move\", path[i].second));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tint diff = -1;\n\t\t\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\t\t\tif (((path[i - 1].first >> j) & 1) != ((path[i].first >> j) & 1)) {\n\t\t\t\t\t\t\tdiff = j;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif ((path[i - 1].first >> diff) & 1) {\n\t\t\t\t\t\tans.push_back(make_pair(\"off\", diff));\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tans.push_back(make_pair(\"on\", diff));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < ans.size(); ++i) {\n\t\t\t\tfor (int j = 1; j < ans.size(); ++j) {\n\t\t\t\t\tif (ans[j - 1].first != \"move\" && ans[j].first != \"move\" && ans[j - 1].second > ans[j].second) {\n\t\t\t\t\t\tswap(ans[j - 1], ans[j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (pair<string, int> i : ans) {\n\t\t\t\tif (i.first == \"move\") {\n\t\t\t\t\tcout << \"Move to room \" << i.second + 1 << \".\" << endl;\n\t\t\t\t}\n\t\t\t\telse if (i.first == \"off\") {\n\t\t\t\t\tcout << \"Switch off room \" << i.second + 1 << \".\" << endl;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcout << \"Switch on room \" << i.second + 1 << \".\" << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 10980,
"score_of_the_acc": -0.2128,
"final_rank": 6
},
{
"submission_id": "aoj_0172_3897789",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<map>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,M;\nstruct state{\n\tint now,L;\n\tbool operator<(const state&a)const{\n\t\treturn L*15+now<a.L*15+a.now;\n\t}\n};\nmain()\n{\n\twhile(cin>>N>>M,N)\n\t{\n\t\tmap<state,int>A;\n\t\tvector<int>G[15];\n\t\tvector<int>L[15];\n\t\tfor(int i=0;i<M;i++)\n\t\t{\n\t\t\tint u,v;cin>>u>>v;\n\t\t\tu--,v--;\n\t\t\tG[u].push_back(v);\n\t\t\tG[v].push_back(u);\n\t\t}\n\t\tqueue<state>P;\n\t\tstate start;\n\t\tstart.now=start.L=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint l;cin>>l;\n\t\t\tstart.L|=l<<i;\n\t\t}\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint k;cin>>k;\n\t\t\tfor(;k--;)\n\t\t\t{\n\t\t\t\tint id;cin>>id;id--;\n\t\t\t\tL[i].push_back(id);\n\t\t\t}\n\t\t\tsort(L[i].rbegin(),L[i].rend());\n\t\t}\n\t\tP.push(start);\n\t\tA[start]=0;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tstate now=P.front();P.pop();\n\t\t\tint turn=A[now];\n\t\t\tfor(int id:L[now.now])\n\t\t\t{\n\t\t\t if(id==now.now)continue;\n\t\t\t\tnow.L^=1<<id;\n\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t{\n\t\t\t\t\tP.push(now);\n\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t}\n\t\t\t\tnow.L^=1<<id;\n\t\t\t}\n\t\t\tfor(int v:G[now.now])\n\t\t\t{\n\t\t\t\tif(now.L>>v&1)\n\t\t\t\t{\n\t\t\t\t\tint tmp=now.now;\n\t\t\t\t\tnow.now=v;\n\t\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tP.push(now);\n\t\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t\t}\n\t\t\t\t\tnow.now=tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstate goal;\n\t\tgoal.now=N-1;\n\t\tgoal.L=1<<N-1;\n\t\tif(A.find(goal)!=A.end())\n\t\t{\n\t\t\tint X=A[goal];\n\t\t\tcout<<\"You can go home in \"<<X<<\" steps.\"<<endl;\n\t\t\tvector<string>ans(X);\n\t\t\tfor(;X--;)\n\t\t\t{\n\t\t\t\tfor(int id:L[goal.now])\n\t\t\t\t{\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(goal.L>>id&1)ans[X]=\"Switch off room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\telse ans[X]=\"Switch on room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t}\n\t\t\t\tif(ans[X]==\"\")\n\t\t\t\t{\n\t\t\t\t\tfor(int v:G[goal.now])\n\t\t\t\t\t{\n\t\t\t\t\t\tint tmp=goal.now;\n\t\t\t\t\t\tgoal.now=v;\n\t\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans[X]=\"Move to room \"+to_string(tmp+1)+\".\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoal.now=tmp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(const string&s:ans)cout<<s<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tbool flag=false;\n\t\t\tfor(map<state,int>::iterator it=A.begin();it!=A.end();it++)\n\t\t\t{\n\t\t\t\tflag|=it->first.now==N-1;\n\t\t\t\tif(flag)break;\n\t\t\t}\n\t\t\tcout<<(flag?\"You can not switch off all lights.\":\"Help me!\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 5908,
"score_of_the_acc": -0.2203,
"final_rank": 7
},
{
"submission_id": "aoj_0172_3897788",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<map>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,M;\nstruct state{\n\tint now,L;\n\tbool operator<(const state&a)const{\n\t\treturn L*15+now<a.L*15+a.now;\n\t}\n};\nmain()\n{\n\twhile(cin>>N>>M,N)\n\t{\n\t\tmap<state,int>A;\n\t\tvector<int>G[15];\n\t\tvector<int>L[15];\n\t\tfor(int i=0;i<M;i++)\n\t\t{\n\t\t\tint u,v;cin>>u>>v;\n\t\t\tu--,v--;\n\t\t\tG[u].push_back(v);\n\t\t\tG[v].push_back(u);\n\t\t}\n\t\tqueue<state>P;\n\t\tstate start;\n\t\tstart.now=start.L=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint l;cin>>l;\n\t\t\tstart.L|=l<<i;\n\t\t}\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint k;cin>>k;\n\t\t\tfor(;k--;)\n\t\t\t{\n\t\t\t\tint id;cin>>id;id--;\n\t\t\t\tL[i].push_back(id);\n\t\t\t}\n\t\t\tsort(L[i].rbegin(),L[i].rend());\n\t\t}\n\t\tP.push(start);\n\t\tA[start]=0;\n\t\tstate goal;\n\t\tgoal.now=N-1;\n\t\tgoal.L=1<<N-1;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tstate now=P.front();P.pop();\n\t\t\tint turn=A[now];\n\t\t\tfor(int id:L[now.now])\n\t\t\t{\n\t\t\t if(id==now.now)continue;\n\t\t\t\tnow.L^=1<<id;\n\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t{\n\t\t\t\t\tP.push(now);\n\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t}\n\t\t\t\tnow.L^=1<<id;\n\t\t\t}\n\t\t\tfor(int v:G[now.now])\n\t\t\t{\n\t\t\t\tif(now.L>>v&1)\n\t\t\t\t{\n\t\t\t\t\tint tmp=now.now;\n\t\t\t\t\tnow.now=v;\n\t\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tP.push(now);\n\t\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t\t}\n\t\t\t\t\tnow.now=tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(A.find(goal)!=A.end())\n\t\t{\n\t\t\tint X=A[goal];\n\t\t\tcout<<\"You can go home in \"<<X<<\" steps.\"<<endl;\n\t\t\tvector<string>ans(X);\n\t\t\tfor(;X--;)\n\t\t\t{\n\t\t\t\tfor(int id:L[goal.now])\n\t\t\t\t{\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(goal.L>>id&1)ans[X]=\"Switch off room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\telse ans[X]=\"Switch on room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t}\n\t\t\t\tif(ans[X]==\"\")\n\t\t\t\t{\n\t\t\t\t\tfor(int v:G[goal.now])\n\t\t\t\t\t{\n\t\t\t\t\t\tint tmp=goal.now;\n\t\t\t\t\t\tgoal.now=v;\n\t\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans[X]=\"Move to room \"+to_string(tmp+1)+\".\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoal.now=tmp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(const string&s:ans)cout<<s<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tbool flag=false;\n\t\t\tfor(map<state,int>::iterator it=A.begin();it!=A.end();it++)\n\t\t\t{\n\t\t\t\tflag|=it->first.now==N-1;\n\t\t\t\tif(flag)break;\n\t\t\t}\n\t\t\tcout<<(flag?\"You can not switch off all lights.\":\"Help me!\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 5980,
"score_of_the_acc": -0.2231,
"final_rank": 8
},
{
"submission_id": "aoj_0172_3897781",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<map>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,M;\nstruct state{\n\tint now,L;\n\tbool operator<(const state&a)const{\n\t\treturn L*15+now<a.L*15+a.now;\n\t}\n};\nmain()\n{\n\twhile(cin>>N>>M,N)\n\t{\n\t\tmap<state,int>A;\n\t\tvector<int>G[15];\n\t\tvector<int>L[15];\n\t\tfor(int i=0;i<M;i++)\n\t\t{\n\t\t\tint u,v;cin>>u>>v;\n\t\t\tu--,v--;\n\t\t\tG[u].push_back(v);\n\t\t\tG[v].push_back(u);\n\t\t}\n\t\tqueue<state>P;\n\t\tstate start;\n\t\tstart.now=start.L=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint l;cin>>l;\n\t\t\tstart.L|=l<<i;\n\t\t}\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint k;cin>>k;\n\t\t\tfor(;k--;)\n\t\t\t{\n\t\t\t\tint id;cin>>id;id--;\n\t\t\t\tL[i].push_back(id);\n\t\t\t}\n\t\t\tsort(L[i].begin(),L[i].end());\n\t\t}\n\t\tP.push(start);\n\t\tA[start]=0;\n\t\tstate goal;\n\t\tgoal.now=N-1;\n\t\tgoal.L=1<<N-1;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tstate now=P.front();P.pop();\n\t\t\tint turn=A[now];\n\t\t\tfor(int id:L[now.now])\n\t\t\t{\n\t\t\t if(id==now.now)continue;\n\t\t\t\tnow.L^=1<<id;\n\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t{\n\t\t\t\t\tP.push(now);\n\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t}\n\t\t\t\tnow.L^=1<<id;\n\t\t\t}\n\t\t\tfor(int v:G[now.now])\n\t\t\t{\n\t\t\t\tif(now.L>>v&1)\n\t\t\t\t{\n\t\t\t\t\tint tmp=now.now;\n\t\t\t\t\tnow.now=v;\n\t\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tP.push(now);\n\t\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t\t}\n\t\t\t\t\tnow.now=tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(A.find(goal)!=A.end())\n\t\t{\n\t\t\tint X=A[goal];\n\t\t\tcout<<\"You can go home in \"<<X<<\" steps.\"<<endl;\n\t\t\tvector<string>ans(X);\n\t\t\tint tmpX=X;\n\t\t\tfor(;X--;)\n\t\t\t{\n\t\t\t\tfor(int id:L[goal.now])\n\t\t\t\t{\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(goal.L>>id&1)ans[X]=\"Switch off room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\telse ans[X]=\"Switch on room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t}\n\t\t\t\tif(ans[X]==\"\")\n\t\t\t\t{\n\t\t\t\t\tfor(int v:G[goal.now])\n\t\t\t\t\t{\n\t\t\t\t\t\tint tmp=goal.now;\n\t\t\t\t\t\tgoal.now=v;\n\t\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans[X]=\"Move to room \"+to_string(tmp+1)+\".\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoal.now=tmp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tX=tmpX;\n\t\t\tfor(int i=1;i<X;i++)\n\t\t\t{\n\t\t\t\tfor(int j=i-1;j>=0;j--)\n\t\t\t\t{\n\t\t\t\t\tif(ans[j][0]=='S'&&ans[j+1][0]=='S')\n\t\t\t\t\t{\n\t\t\t\t\t\tbool flag=false;\n\t\t\t\t\t\tint id=0,scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint A,B;\n\t\t\t\t\t\tA=ans[j][id]-'0';\n\t\t\t\t\t\tif(ans[j][id+1]!='.')A=A*10+ans[j][id+1]-'0';\n\t\t\t\t\t\tid=scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j+1][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tB=ans[j+1][id]-'0';\n\t\t\t\t\t\tif(ans[j+1][id+1]!='.')B=B*10+ans[j+1][id+1]-'0';\n\t\t\t\t\t\tif(A>B)swap(ans[j],ans[j+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(const string&s:ans)cout<<s<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tbool flag=false;\n\t\t\tfor(map<state,int>::iterator it=A.begin();it!=A.end();it++)\n\t\t\t{\n\t\t\t\tflag|=it->first.now==N-1;\n\t\t\t\tif(flag)break;\n\t\t\t}\n\t\t\tcout<<(flag?\"You can not switch off all lights.\":\"Help me!\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 5868,
"score_of_the_acc": -0.2855,
"final_rank": 13
},
{
"submission_id": "aoj_0172_3897778",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<map>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,M;\nstruct state{\n\tint now,L;\n\tstate(){now=L=0;}\n\tbool operator<(const state&a)const{\n\t\treturn L*15+now<a.L*15+a.now;\n\t}\n\tbool operator==(const state&a)const{\n\t\treturn !(*this<a||a<*this);\n\t}\n};\nmain()\n{\n\twhile(cin>>N>>M,N)\n\t{\n\t\tmap<state,int>A;\n\t\tvector<int>G[15];\n\t\tvector<int>L[15];\n\t\tfor(int i=0;i<M;i++)\n\t\t{\n\t\t\tint u,v;cin>>u>>v;\n\t\t\tu--,v--;\n\t\t\tG[u].push_back(v);\n\t\t\tG[v].push_back(u);\n\t\t}\n\t\tqueue<state>P;\n\t\tstate start;\n\t\tstart.now=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint l;cin>>l;\n\t\t\tstart.L|=l<<i;\n\t\t}\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint k;cin>>k;\n\t\t\tfor(;k--;)\n\t\t\t{\n\t\t\t\tint id;cin>>id;id--;\n\t\t\t\tL[i].push_back(id);\n\t\t\t}\n\t\t\tsort(L[i].begin(),L[i].end());\n\t\t}\n\t\tP.push(start);\n\t\tA[start]=0;\n\t\tstate goal;\n\t\tgoal.now=N-1;\n\t\tgoal.L=1<<N-1;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tstate now=P.front();P.pop();\n\t\t\tint turn=A[now];\n\t\t\tfor(int id:L[now.now])\n\t\t\t{\n\t\t\t if(id==now.now)continue;\n\t\t\t\tnow.L^=1<<id;\n\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t{\n\t\t\t\t\tP.push(now);\n\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t}\n\t\t\t\tnow.L^=1<<id;\n\t\t\t}\n\t\t\tfor(int v:G[now.now])\n\t\t\t{\n\t\t\t\tif(now.L>>v&1)\n\t\t\t\t{\n\t\t\t\t\tint tmp=now.now;\n\t\t\t\t\tnow.now=v;\n\t\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tP.push(now);\n\t\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t\t}\n\t\t\t\t\tnow.now=tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(A.find(goal)!=A.end())\n\t\t{\n\t\t\tint X=A[goal];\n\t\t\tcout<<\"You can go home in \"<<X<<\" steps.\"<<endl;\n\t\t\tvector<string>ans(X);\n\t\t\tint tmpX=X;\n\t\t\tfor(;X--;)\n\t\t\t{\n\t\t\t\tfor(int id:L[goal.now])\n\t\t\t\t{\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(goal.L>>id&1)ans[X]=\"Switch off room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\telse ans[X]=\"Switch on room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t}\n\t\t\t\tif(ans[X]==\"\")\n\t\t\t\t{\n\t\t\t\t\tfor(int v:G[goal.now])\n\t\t\t\t\t{\n\t\t\t\t\t\tint tmp=goal.now;\n\t\t\t\t\t\tgoal.now=v;\n\t\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans[X]=\"Move to room \"+to_string(tmp+1)+\".\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoal.now=tmp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!(goal==start))return 1;\n\t\t\tX=tmpX;\n\t\t\tfor(int i=1;i<X;i++)\n\t\t\t{\n\t\t\t\tfor(int j=i-1;j>=0;j--)\n\t\t\t\t{\n\t\t\t\t\tif(ans[j][0]=='S'&&ans[j+1][0]=='S')\n\t\t\t\t\t{\n\t\t\t\t\t\tbool flag=false;\n\t\t\t\t\t\tint id=0,scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint A,B;\n\t\t\t\t\t\tA=ans[j][id]-'0';\n\t\t\t\t\t\tif(ans[j][id+1]!='.')A=A*10+ans[j][id+1]-'0';\n\t\t\t\t\t\tid=scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j+1][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tB=ans[j+1][id]-'0';\n\t\t\t\t\t\tif(ans[j+1][id+1]!='.')B=B*10+ans[j+1][id+1]-'0';\n\t\t\t\t\t\tif(A>B)swap(ans[j],ans[j+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(const string&s:ans)cout<<s<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tbool flag=false;\n\t\t\tfor(map<state,int>::iterator it=A.begin();it!=A.end();it++)\n\t\t\t{\n\t\t\t\tflag|=it->first.now==N-1;\n\t\t\t\tif(flag)break;\n\t\t\t}\n\t\t\tcout<<(flag?\"You can not switch off all lights.\":\"Help me!\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 5932,
"score_of_the_acc": -0.2879,
"final_rank": 15
},
{
"submission_id": "aoj_0172_3897776",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<map>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,M;\nstruct state{\n\tint now,L;\n\tstate(){now=L=0;}\n\tbool operator<(const state&a)const{\n\t\treturn L*15+now<a.L*15+a.now;\n\t}\n\tbool operator==(const state&a)const{\n\t\treturn !(*this<a||a<*this);\n\t}\n};\nmain()\n{\n\twhile(cin>>N>>M,N)\n\t{\n\t\tmap<state,int>A;\n\t\tvector<int>G[15];\n\t\tvector<int>L[15];\n\t\tfor(int i=0;i<M;i++)\n\t\t{\n\t\t\tint u,v;cin>>u>>v;\n\t\t\tu--,v--;\n\t\t\tG[u].push_back(v);\n\t\t\tG[v].push_back(u);\n\t\t}\n\t\tqueue<state>P;\n\t\tstate start;\n\t\tstart.now=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint l;cin>>l;\n\t\t\tstart.L|=l<<i;\n\t\t}\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint k;cin>>k;\n\t\t\tfor(;k--;)\n\t\t\t{\n\t\t\t\tint id;cin>>id;id--;\n\t\t\t\tL[i].push_back(id);\n\t\t\t}\n\t\t\tsort(L[i].begin(),L[i].end());\n\t\t}\n\t\tP.push(start);\n\t\tA[start]=0;\n\t\tstate goal;\n\t\tgoal.now=N-1;\n\t\tgoal.L=1<<N-1;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tstate now=P.front();P.pop();\n\t\t\tint turn=A[now];\n\t\t\tfor(int id:L[now.now])\n\t\t\t{\n\t\t\t if(id==now.now)continue;\n\t\t\t\tnow.L^=1<<id;\n\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t{\n\t\t\t\t\tP.push(now);\n\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t}\n\t\t\t\tnow.L^=1<<id;\n\t\t\t}\n\t\t\tfor(int v:G[now.now])\n\t\t\t{\n\t\t\t\tif(now.L>>v&1)\n\t\t\t\t{\n\t\t\t\t state X=now;\n\t\t\t\t X.now=v;\n\t\t\t\t\tif(X.L>>X.now&1&&A.find(X)==A.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tP.push(X);\n\t\t\t\t\t\tA[X]=turn+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(A.find(goal)!=A.end())\n\t\t{\n\t\t\tint X=A[goal];\n\t\t\tcout<<\"You can go home in \"<<X<<\" steps.\"<<endl;\n\t\t\tvector<string>ans(X);\n\t\t\tint tmpX=X;\n\t\t\tfor(;X--;)\n\t\t\t{\n\t\t\t\tfor(int id:L[goal.now])\n\t\t\t\t{\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(goal.L>>id&1)ans[X]=\"Switch off room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\telse ans[X]=\"Switch on room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t}\n\t\t\t\tif(ans[X]==\"\")\n\t\t\t\t{\n\t\t\t\t\tfor(int v:G[goal.now])\n\t\t\t\t\t{\n\t\t\t\t\t\tint tmp=goal.now;\n\t\t\t\t\t\tgoal.now=v;\n\t\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans[X]=\"Move to room \"+to_string(tmp+1)+\".\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoal.now=tmp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!(goal==start))return 1;\n\t\t\tX=tmpX;\n\t\t\tfor(int i=1;i<X;i++)\n\t\t\t{\n\t\t\t\tfor(int j=i-1;j>=0;j--)\n\t\t\t\t{\n\t\t\t\t\tif(ans[j][0]=='S'&&ans[j+1][0]=='S')\n\t\t\t\t\t{\n\t\t\t\t\t\tbool flag=false;\n\t\t\t\t\t\tint id=0,scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint A,B;\n\t\t\t\t\t\tA=ans[j][id]-'0';\n\t\t\t\t\t\tif(ans[j][id+1]!='.')A=A*10+ans[j][id+1]-'0';\n\t\t\t\t\t\tid=scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j+1][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tB=ans[j+1][id]-'0';\n\t\t\t\t\t\tif(ans[j+1][id+1]!='.')B=B*10+ans[j+1][id+1]-'0';\n\t\t\t\t\t\tif(A>B)swap(ans[j],ans[j+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(const string&s:ans)cout<<s<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tbool flag=false;\n\t\t\tfor(map<state,int>::iterator it=A.begin();it!=A.end();it++)\n\t\t\t{\n\t\t\t\tflag|=it->first.now==N-1;\n\t\t\t\tif(flag)break;\n\t\t\t}\n\t\t\tcout<<(flag?\"You can not switch off all lights.\":\"Help me!\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 5904,
"score_of_the_acc": -0.2869,
"final_rank": 14
},
{
"submission_id": "aoj_0172_3897774",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<map>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,M;\nstruct state{\n\tint now,L;\n\tstate(){now=L=0;}\n\tbool operator<(const state&a)const{\n\t\treturn L*15+now<a.L*15+a.now;\n\t}\n\tbool operator==(const state&a)const{\n\t\treturn !(*this<a||a<*this);\n\t}\n};\nmain()\n{\n\twhile(cin>>N>>M,N)\n\t{\n\t\tmap<state,int>A;\n\t\tvector<vector<int> >G(N),L(N);\n\t\tfor(int i=0;i<M;i++)\n\t\t{\n\t\t\tint u,v;cin>>u>>v;\n\t\t\tu--,v--;\n\t\t\tG[u].push_back(v);\n\t\t\tG[v].push_back(u);\n\t\t}\n\t\tqueue<state>P;\n\t\tstate start;\n\t\tstart.now=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint l;cin>>l;\n\t\t\tstart.L|=l<<i;\n\t\t}\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint k;cin>>k;\n\t\t\tfor(;k--;)\n\t\t\t{\n\t\t\t\tint id;cin>>id;id--;\n\t\t\t\tL[i].push_back(id);\n\t\t\t}\n\t\t\tsort(L[i].begin(),L[i].end());\n\t\t}\n\t\tP.push(start);\n\t\tA[start]=0;\n\t\tstate goal;\n\t\tgoal.now=N-1;\n\t\tgoal.L=1<<N-1;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tstate now=P.front();P.pop();\n\t\t\tint turn=A[now];\n\t\t\tif(!(now.L>>now.now&1))return turn;\n\t\t\tif(now==goal)break;\n\t\t\tfor(int id:L[now.now])\n\t\t\t{\n\t\t\t if(id==now.now)continue;\n\t\t\t\tnow.L^=1<<id;\n\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t{\n\t\t\t\t\tP.push(now);\n\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t}\n\t\t\t\tnow.L^=1<<id;\n\t\t\t}\n\t\t\tfor(int v:G[now.now])\n\t\t\t{\n\t\t\t\tif(now.L>>v&1)\n\t\t\t\t{\n\t\t\t\t state X=now;\n\t\t\t\t X.now=v;\n\t\t\t\t\tif(X.L>>X.now&1&&A.find(X)==A.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tP.push(X);\n\t\t\t\t\t\tA[X]=turn+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(A.find(goal)!=A.end())\n\t\t{\n\t\t\tint X=A[goal];\n\t\t\tcout<<\"You can go home in \"<<X<<\" steps.\"<<endl;\n\t\t\tvector<string>ans(X);\n\t\t\tint tmpX=X;\n\t\t\tfor(;X--;)\n\t\t\t{\n\t\t\t\tfor(int id:L[goal.now])\n\t\t\t\t{\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(goal.L>>id&1)ans[X]=\"Switch off room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\telse ans[X]=\"Switch on room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t}\n\t\t\t\tif(ans[X]==\"\")\n\t\t\t\t{\n\t\t\t\t\tfor(int v:G[goal.now])\n\t\t\t\t\t{\n\t\t\t\t\t\tint tmp=goal.now;\n\t\t\t\t\t\tgoal.now=v;\n\t\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans[X]=\"Move to room \"+to_string(tmp+1)+\".\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoal.now=tmp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!(goal==start))return 1;\n\t\t\tX=tmpX;\n\t\t\tfor(int i=1;i<X;i++)\n\t\t\t{\n\t\t\t\tfor(int j=i-1;j>=0;j--)\n\t\t\t\t{\n\t\t\t\t\tif(ans[j][0]=='S'&&ans[j+1][0]=='S')\n\t\t\t\t\t{\n\t\t\t\t\t\tbool flag=false;\n\t\t\t\t\t\tint id=0,scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint A,B;\n\t\t\t\t\t\tA=ans[j][id]-'0';\n\t\t\t\t\t\tif(ans[j][id+1]!='.')A=A*10+ans[j][id+1]-'0';\n\t\t\t\t\t\tid=scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j+1][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tB=ans[j+1][id]-'0';\n\t\t\t\t\t\tif(ans[j+1][id+1]!='.')B=B*10+ans[j+1][id+1]-'0';\n\t\t\t\t\t\tif(A>B)swap(ans[j],ans[j+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(const string&s:ans)cout<<s<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tbool flag=false;\n\t\t\tfor(map<state,int>::iterator it=A.begin();it!=A.end();it++)\n\t\t\t{\n\t\t\t\tflag|=it->first.now==N-1;\n\t\t\t\tif(flag)break;\n\t\t\t}\n\t\t\tcout<<(flag?\"You can not switch off all lights.\":\"Help me!\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 5796,
"score_of_the_acc": -0.2828,
"final_rank": 12
},
{
"submission_id": "aoj_0172_3897760",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<map>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,M;\nstruct state{\n\tint now,L;\n\tstate(){now=L=0;}\n\tbool operator<(const state&a)const{\n\t\treturn L*15+now<a.L*15+a.now;\n\t}\n\tbool operator==(const state&a)const{\n\t\treturn !(*this<a||a<*this);\n\t}\n};\nmain()\n{\n\twhile(cin>>N>>M,N)\n\t{\n\t\tmap<state,int>A;\n\t\tvector<vector<int> >G(N),L(N);\n\t\tfor(int i=0;i<M;i++)\n\t\t{\n\t\t\tint u,v;cin>>u>>v;\n\t\t\tu--,v--;\n\t\t\tG[u].push_back(v);\n\t\t\tG[v].push_back(u);\n\t\t}\n\t\tqueue<state>P;\n\t\tstate start;\n\t\tstart.now=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint l;cin>>l;\n\t\t\tstart.L|=l<<i;\n\t\t}\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint k;cin>>k;\n\t\t\tfor(;k--;)\n\t\t\t{\n\t\t\t\tint id;cin>>id;id--;\n\t\t\t\tL[i].push_back(id);\n\t\t\t}\n\t\t\tsort(L[i].begin(),L[i].end());\n\t\t}\n\t\tP.push(start);\n\t\tA[start]=0;\n\t\tstate goal;\n\t\tgoal.now=N-1;\n\t\tgoal.L=1<<N-1;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tstate now=P.front();P.pop();\n\t\t\tint turn=A[now];\n\t\t\tif(!(now.L>>now.now&1))return turn;\n\t\t\tif(now==goal)break;\n\t\t\tfor(int id:L[now.now])\n\t\t\t{\n\t\t\t if(id==now.now)continue;\n\t\t\t\tnow.L^=1<<id;\n\t\t\t\tif(A.find(now)==A.end())\n\t\t\t\t{\n\t\t\t\t\tP.push(now);\n\t\t\t\t\tA[now]=turn+1;\n\t\t\t\t}\n\t\t\t\tnow.L^=1<<id;\n\t\t\t}\n\t\t\tfor(int v:G[now.now])\n\t\t\t{\n\t\t\t\tif(now.L>>v&1)\n\t\t\t\t{\n\t\t\t\t state X=now;\n\t\t\t\t X.now=v;\n\t\t\t\t\tif(X.L>>X.now&1&&A.find(X)==A.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tP.push(X);\n\t\t\t\t\t\tA[X]=turn+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(A.find(goal)!=A.end())\n\t\t{\n\t\t\tint X=A[goal];\n\t\t\tcout<<\"You can go home in \"<<X<<\" steps.\"<<endl;\n\t\t\tvector<string>ans(X);\n\t\t\tint tmpX=X;\n\t\t\tfor(;X--;)\n\t\t\t{\n\t\t\t\tfor(int id:L[goal.now])\n\t\t\t\t{\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(goal.L>>id&1)ans[X]=\"Switch off room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\telse ans[X]=\"Switch on room \"+to_string(id+1)+\".\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tgoal.L^=1<<id;\n\t\t\t\t}\n\t\t\t\tif(ans[X]==\"\")\n\t\t\t\t{\n\t\t\t\t\tfor(int v:G[goal.now])\n\t\t\t\t\t{\n\t\t\t\t\t\tint tmp=goal.now;\n\t\t\t\t\t\tgoal.now=v;\n\t\t\t\t\t\tif(A.find(goal)!=A.end()&&A[goal]==X)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans[X]=\"Move to room \"+to_string(tmp+1)+\".\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tgoal.now=tmp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!(goal==start))return 1;\n\t\t\tX=tmpX;\n\t\t\tfor(int i=1;i<X;i++)\n\t\t\t{\n\t\t\t\tfor(int j=i-1;j>=0;j--)\n\t\t\t\t{\n\t\t\t\t\tif(ans[j][0]=='S'&&ans[j+1][0]=='S')\n\t\t\t\t\t{\n\t\t\t\t\t\tbool flag=false;\n\t\t\t\t\t\tint id=0,scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint A,B;\n\t\t\t\t\t\tA=ans[j][id]-'0';\n\t\t\t\t\t\tif(ans[j][id+1]!='.')A=A*10+ans[j][id+1]-'0';\n\t\t\t\t\t\tid=scnt=0;\n\t\t\t\t\t\twhile(scnt<3)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tscnt+=ans[j+1][id]==' ';\n\t\t\t\t\t\t\tid++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tB=ans[j+1][id]-'0';\n\t\t\t\t\t\tif(ans[j+1][id+1]!='.')B=B*10+ans[j+1][id+1]-'0';\n\t\t\t\t\t\tif(A>B)swap(ans[j],ans[j+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(const string&s:ans)cout<<s<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tbool flag=false;\n\t\t\tfor(map<state,int>::iterator it=A.begin();it!=A.end();it++)\n\t\t\t{\n\t\t\t\tflag|=it->first.now==N-1;\n\t\t\t\tif(flag)break;\n\t\t\t}\n\t\t\tcout<<(flag?\"You can not switch off all lights.\":\"Help me!\")<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 5784,
"score_of_the_acc": -0.2823,
"final_rank": 11
},
{
"submission_id": "aoj_0172_2676035",
"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\nenum Type{\n\tMove,\n\tOn,\n\tOff,\n};\n\n\nstruct Data{\n\tData(Type arg_type,int arg_room_id){\n\t\ttype = arg_type;\n\t\troom_id = arg_room_id;\n\t}\n\tType type;\n\tint room_id;\n};\n\nstruct Info{\n\tvoid set(int arg_current_room,int arg_num_step,int arg_state){\n\t\tcurrent_room = arg_current_room;\n\t\tnum_step = arg_num_step;\n\t\tstate = arg_state;\n\t}\n\tint current_room,num_step,state;\n\tvector<Data> history;\n};\n\n\nint N,M,start = 0,goal;\nint POW[16];\nint min_cost[32768][15];\nvector<int> G[15],button[15];\n\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\t\tG[i].clear();\n\t\tbutton[i].clear();\n\t}\n\n\tgoal = N-1;\n\n\tint from,to;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tint first_state = 0,tmp;\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&tmp);\n\t\tif(tmp == 1){\n\t\t\tfirst_state += POW[i];\n\t\t}\n\t}\n\n\tint num;\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&num);\n\t\tfor(int k = 0; k < num; k++){\n\t\t\tscanf(\"%d\",&tmp);\n\t\t\ttmp--;\n\t\t\tbutton[i].push_back(tmp);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tsort(button[i].begin(),button[i].end());\n\t}\n\n\tqueue<Info> Q;\n\tInfo first;\n\tfirst.set(start,0,first_state);\n\tQ.push(first);\n\n\tbool finished = false;\n\tint target_room,next_room,next_state;\n\n\tfor(int state = 0; state < POW[N]; state++){\n\t\tfor(int room = 0; room < N; room++){\n\t\t\tmin_cost[state][room] = BIG_NUM;\n\t\t}\n\t}\n\n\tmin_cost[first_state][start] = 0;\n\n\tType next_type;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.front().current_room == goal){\n\t\t\tfinished = true;\n\t\t\tif(Q.front().state == POW[goal]){\n\n\t\t\t\tprintf(\"You can go home in %d steps.\\n\",Q.front().num_step);\n\t\t\t\tfor(int i = 0; i < Q.front().num_step; i++){\n\t\t\t\t\tswitch(Q.front().history[i].type){\n\t\t\t\t\tcase Move:\n\t\t\t\t\t\tprintf(\"Move to room \");\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase On:\n\t\t\t\t\t\tprintf(\"Switch on room \");\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase Off:\n\t\t\t\t\t\tprintf(\"Switch off room \");\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tprintf(\"%d.\\n\",Q.front().history[i].room_id+1);\n\t\t\t\t}\n\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tif(Q.front().num_step > min_cost[Q.front().state][Q.front().current_room]){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < button[Q.front().current_room].size(); i++){\n\t\t\t\ttarget_room = button[Q.front().current_room][i];\n\n\t\t\t\tif(target_room == Q.front().current_room)continue;\n\n\t\t\t\tif(Q.front().state & (1 << target_room)){\n\t\t\t\t\tnext_state = Q.front().state-POW[target_room];\n\t\t\t\t\tnext_type = Off;\n\t\t\t\t}else{\n\t\t\t\t\tnext_state = Q.front().state+POW[target_room];\n\t\t\t\t\tnext_type = On;\n\t\t\t\t}\n\n\t\t\t\tif(min_cost[next_state][Q.front().current_room] > Q.front().num_step+1){\n\t\t\t\t\tmin_cost[next_state][Q.front().current_room] = Q.front().num_step+1;\n\t\t\t\t\tInfo next_info;\n\t\t\t\t\tnext_info.set(Q.front().current_room,Q.front().num_step+1,next_state);\n\t\t\t\t\tfor(int k = 0; k < Q.front().num_step; k++){\n\t\t\t\t\t\tnext_info.history.push_back(Q.front().history[k]);\n\t\t\t\t\t}\n\t\t\t\t\tnext_info.history.push_back(Data(next_type,target_room));\n\t\t\t\t\tQ.push(next_info);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//移動する場合\n\t\t\tfor(int i = 0; i < G[Q.front().current_room].size(); i++){\n\t\t\t\tnext_room = G[Q.front().current_room][i];\n\n\t\t\t\tif(Q.front().state & (1 << next_room)){\n\t\t\t\t\tif(min_cost[Q.front().state][next_room] > Q.front().num_step+1){\n\t\t\t\t\t\tmin_cost[Q.front().state][next_room] = Q.front().num_step+1;\n\t\t\t\t\t\tInfo next_info;\n\t\t\t\t\t\tnext_info.set(next_room,Q.front().num_step+1,Q.front().state);\n\t\t\t\t\t\tfor(int k = 0; k < Q.front().num_step; k++){\n\t\t\t\t\t\t\tnext_info.history.push_back(Q.front().history[k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tnext_info.history.push_back(Data(Move,next_room));\n\t\t\t\t\t\tQ.push(next_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\tif(finished){\n\t\tprintf(\"You can not switch off all lights.\\n\");\n\t}else{\n\t\tprintf(\"Help me!\\n\");\n\t}\n}\n\n\nint main(){\n\n\tfor(int i = 0; i < 16; i++)POW[i] = pow(2,i);\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": 30,
"memory_kb": 7328,
"score_of_the_acc": -0.2076,
"final_rank": 5
},
{
"submission_id": "aoj_0172_2377565",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\n#define f first\n#define s second\n#define mp make_pair\ntypedef pair<int, int> P;\nstatic const int INF = (1 <<29);\n\nstruct State{\n int pos;\n int light;\n vector<P> step;\n\n State(){}\n State(int p, int l, vector<P> s):pos(p),light(l),step(s){}\n};\n\n//light : 1 = ON, 0 = OFF\nint n,m;\nint initLight;\nvector<int> edge[16], room[16];\nint minStep[15][(1 << 15)];\nbool exitFlag;\nstring table[3][16];//0 = ON, 1 = OFF, 2 = MOVE\n\nvoid makeTable(){\n char tmp[50];\n for(int j = 1 ; j <= 15 ; j++){\n sprintf(tmp, \"Switch on room %d.\",j);\n table[0][j] = string(tmp);\n sprintf(tmp, \"Switch off room %d.\",j);\n table[1][j] = string(tmp);\n sprintf(tmp, \"Move to room %d.\",j);\n table[2][j] = string(tmp);\n }\n}\n\nvoid bfs(){\n rep(i,15)rep(j,(1 << 15))minStep[i][j] = INF;\n exitFlag = false;\n int goal = (1 << (n-1)) ;\n queue<State> q;\n q.push(State(0, initLight, vector<P>()));\n\n while(!q.empty()){\n State p = q.front();\n q.pop();\n\n if(p.pos==n){\n\t // Case 1\n\t if(p.light == goal){\n\t cout << \"You can go home in \" << p.step.size() << \" steps.\" << endl;\n\t for(int i = 0 ; i < p.step.size() ; i++){\n\t cout << table[p.step[i].f][p.step[i].s] << endl;\n \t }\n\t return;\n\t }\n\t // Case 2\n\t else{\n\t exitFlag = true;\n\t continue;\n\t }\n }\n\n if(minStep[p.pos][p.light] <= p.step.size())continue;\n minStep[p.pos][p.light] = p.step.size();\n\n for(int j = 0 ; j < room[p.pos].size() ; j++){\n\t int tmpLight = p.light;\n\t vector<P> tmpStep = p.step;\n\n //??§??????????????????????????§????¶???????\n\t if(((p.light >> room[p.pos][j]) & 1) && p.pos != room[p.pos][j]){\n\t tmpLight -= (1 << room[p.pos][j]);\n\t tmpStep.push_back(mp(1, room[p.pos][j]+1));\n\t }\n\n\t //??§?????????????????????????????§???????????????\n\t if(((p.light >> room[p.pos][j]) & 1)==0){\n\t tmpLight += (1 << room[p.pos][j]);\n\t tmpStep.push_back(mp(0, room[p.pos][j]+1));\n\t }\n\n\t if(minStep[p.pos][tmpLight] > tmpStep.size()) q.push(State(p.pos, tmpLight, tmpStep));\n }\n\n for(int to = 0 ; to < edge[p.pos].size() ; to++){\n\t if(p.pos==n-1){\n\t q.push(State(edge[p.pos][to], p.light, p.step));\n\t }\n //?¬??????¨?±??????§??????????????????????????§???????????¨?????§?????????\n\t if((p.light >> edge[p.pos][to]) & 1){\n\t vector<P> tmpStep = p.step;\n\t tmpStep.push_back(mp(2, edge[p.pos][to]+1));\n\t if(minStep[edge[p.pos][to]][p.light] > tmpStep.size()) q.push(State(edge[p.pos][to], p.light, tmpStep));\n\t }\n }\n }\n\n // Case 2\n if(exitFlag) cout << \"You can not switch off all lights.\" << endl;\n // Case 3\n else cout << \"Help me!\" << endl;\n}\n\nvoid init(){\n initLight = 0;\n\n for(int i = 0 ; i < 16 ; i++){\n edge[i].clear();\n room[i].clear();\n }\n\n edge[n-1].push_back(n);\n}\n\nint main(){\n makeTable();\n while(cin >> n >> m){\n if(n==0 && m==0)break;\n\n init();\n\n //input\n for(int i = 0 ; i < m ; i++){\n\t int s,t;\n\t cin >> s >> t;\n\t s--; t--;\n\t edge[s].push_back(t);\n\t edge[t].push_back(s);\n }\n\n for(int i = 0 ; i < n ; i++){\n\t int v;\n\t cin >> v;\n\t if(v==1) initLight |= (1 << i);\n }\n\n for(int i = 0 ; i < n ; i++){\n\t int k;\n\t cin >> k;\n\t for(int j = 0 ; j < k ; j++){\n\t int v;\n\t cin >> v;\n\t v--;\n\t room[i].push_back(v);\n\t }\n\t sort(room[i].begin(), room[i].end());\n }\n\n bfs();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 15336,
"score_of_the_acc": -1.3781,
"final_rank": 20
},
{
"submission_id": "aoj_0172_2077925",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nstruct action {\n\tint type;\n\tint num;\n};\nstruct room {\n\tvector<int>edges;\n\tvector<int>switches;\n\troom():edges(), switches(){\n\t}\n};\nvector<action> memo[1 << 15][15];\nint N, M;\nbool cangoal = false;\n\nstruct aa {\n\tint now;\n\tbitset<15>lights;\n\tint time;\n};\nclass Compare {\npublic:\n\tbool operator ()(const aa&l, const aa&r) {\n\t\treturn l.time > r.time;\n\t}\n};\n\nint main() {\n\twhile (1) {\n\t\t\n\t\tqueue<aa>que;\n\t\tcin >> N >> M;\n\t\tif (!N)break;\n\t\tvector<room>rooms(N);\n\t\t{\n\t\t\tcangoal = false;\n\t\t\tfor (int i = 0; i < (1 << 15); ++i) {\n\t\t\t\tfor (int j = 0; j < 15; ++j) {\n\t\t\t\t\tmemo[i][j] = vector<action>();\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\tint s, t; cin >> s >> t;\n\t\t\t\ts--; t--;\n\t\t\t\trooms[s].edges.push_back(t);\n\t\t\t\trooms[t].edges.push_back(s);\n\t\t\t}\n\t\t\tbitset<15>lights;\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tint l; cin >> l;\n\t\t\t\tlights[i] = l;\n\t\t\t\tassert(lights[0] == 1);\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tint k; cin >> k;\n\t\t\t\tfor (int j = 0; j < k; ++j) {\n\t\t\t\t\tint r; cin >> r;\n\t\t\t\t\tr--;\n\t\t\t\t\trooms[i].switches.push_back(r);\n\t\t\t\t}\n\t\t\t\tsort(rooms[i].switches.begin(), rooms[i].switches.end());\n\t\t\t}\n\t\t\tque.push(aa{ 0,lights,0 });\n\t\t}\n\t\tvector<action>ans;\n\t\twhile (!que.empty()) {\n\t\t\taa atop(que.front());\n\t\t\tque.pop();\n\t\t\tif (atop.now == N - 1) {\n\t\t\t\tcangoal = true;\n\t\t\t\tif (atop.lights.count() == 1) {\n\t\t\t\t\tans = memo[atop.lights.to_ulong()][atop.now];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (auto next : rooms[atop.now].edges) {\n\t\t\t\tif (atop.lights[next]) {\n\t\t\t\t\tif (memo[atop.lights.to_ulong()][next].empty()) {\n\t\t\t\t\t\tmemo[atop.lights.to_ulong()][next] = memo[atop.lights.to_ulong()][atop.now];\n\t\t\t\t\t\tmemo[atop.lights.to_ulong()][next].push_back(action{ 2,1 + next });\n\t\t\t\t\t\tque.push(aa{ next,atop.lights,atop.time+1 });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (auto sw : rooms[atop.now].switches) {\n\t\t\t\tif (sw == atop.now)continue;\n\t\t\t\tbitset<15>nextlights(atop.lights);\n\t\t\t\tnextlights[sw] = !atop.lights[sw];\n\t\t\t\tif (memo[nextlights.to_ulong()][atop.now].empty()) {\n\t\t\t\t\tmemo[nextlights.to_ulong()][atop.now] = memo[atop.lights.to_ulong()][atop.now];\n\t\t\t\t\tmemo[nextlights.to_ulong()][atop.now].push_back(action{ !nextlights[sw],sw+1 });\n\t\t\t\t\tque.push(aa{ atop.now,nextlights,atop.time + 1 });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (ans.empty()) {\n\t\t\tif (cangoal) {\n\t\t\t\tcout << \"You can not switch off all lights.\" << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << \"Help me!\" << endl;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcout << \"You can go home in \" <<ans.size() << \" steps.\" << endl;\n\t\t\tfor (auto a : ans) {\n\t\t\t\tif (a.type == 0) {\n\t\t\t\t\tcout << \"Switch on room \" << a.num << \".\" << endl;\n\t\t\t\t}\n\t\t\t\telse if (a.type == 1) {\n\t\t\t\t\tcout << \"Switch off room \" << a.num <<\".\" << endl;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcout << \"Move to room \" << a.num << \".\" << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 31724,
"score_of_the_acc": -1.2667,
"final_rank": 19
},
{
"submission_id": "aoj_0172_1975028",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define INF (1<<29)\n\ntypedef pair<int, int> pii;\n\nint n, m;\nint startBit;\nint dp[1<<15][15];\nint prevBit[1<<15][15];\nint prevPos[1<<15][15];\nvector<int> graph[15];\nvector<int> swit[15];\n\n\nint main() {\n\twhile (cin >> n >> m, n || m) {\n\t\tstartBit = 0;\n\t\tfill(dp[0], dp[1<<15], INF);\n\t\tfill(prevBit[0], prevBit[1<<15], INF);\n\t\tfill(prevPos[0], prevBit[1<<15], INF);\n\t\tREP(i, n) graph[i].clear();\n\t\tREP(i, n) swit[i].clear();\n\t\t\t\t\n\t\tREP(i, m) {\n\t\t\tint a, b;\n\t\t\tscanf(\"%d %d\", &a, &b);\n\t\t\ta--; b--;\n\t\t\tgraph[a].push_back(b);\n\t\t\tgraph[b].push_back(a);\n\t\t}\n\t\tREP(i, n) {\n\t\t\tint a;\n\t\t\tscanf(\"%d\", &a);\n\t\t\tstartBit |= (a<<i);\n\t\t}\n\t\tREP(i, n) {\n\t\t\tint c;\n\t\t\tscanf(\"%d\", &c);\n\t\t\tREP(j, c) {\n\t\t\t\tint a;\n\t\t\t\tscanf(\"%d\", &a);\n\t\t\t\ta--;\n\t\t\t\tswit[i].push_back(a);\n\t\t\t}\n\t\t}\n\t\t\n\t\tqueue<pii> que;\n\t\tque.push(pii(startBit, 0));\n\t\tdp[startBit][0] = 0;\n\t\t\n\t\twhile (!que.empty()) {\n\t\t\tint nowBit = que.front().first;\n\t\t\tint nowPos = que.front().second;\n\t\t\tque.pop();\n\t\t\t\n\t\t\tif ((nowBit & (1<<nowPos) == 0)) continue;\n\t\t\t\n\t\t\tREP(i, graph[nowPos].size()) {\n\t\t\t\tint nextPos = graph[nowPos][i];\n\t\t\t\t\n\t\t\t\tif ((nowBit & (1<<nextPos)) > 0\n\t\t\t\t\t&& dp[nowBit][nextPos] > dp[nowBit][nowPos] + 1) {\n\t\t\t\t\t\n\t\t\t\t\tprevBit[nowBit][nextPos] = nowBit;\n\t\t\t\t\tprevPos[nowBit][nextPos] = nowPos;\n\t\t\t\t\tdp[nowBit][nextPos] = dp[nowBit][nowPos] + 1;\n\t\t\t\t\tque.push(pii(nowBit, nextPos));\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tREP(i, swit[nowPos].size()) {\n\t\t\t\tint nextBit = nowBit ^ (1<<swit[nowPos][i]);\n\t\t\t\t\n\t\t\t\tif (swit[nowPos][i] == nowPos) continue;\n\t\t\t\tif (dp[nextBit][nowPos] > dp[nowBit][nowPos] + 1) {\n\t\t\t\t\tprevBit[nextBit][nowPos] = nowBit;\n\t\t\t\t\tprevPos[nextBit][nowPos] = nowPos;\n\t\t\t\t\tdp[nextBit][nowPos] = dp[nowBit][nowPos] + 1;\n\t\t\t\t\tque.push(pii(nextBit, nowPos));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (dp[1<<(n - 1)][n - 1] != INF) {\n\t\t\t printf(\"You can go home in %d steps.\\n\", dp[1<<(n - 1)][n - 1]);\n\t\t\t vector<pii> ans; // first: 1move 2switch on 3switch off\tsecond: number\n\t\t\t \n\t\t\t int nowBit = 1<<(n - 1);\n\t\t\t int nowPos = n - 1;\n\t\t\t \n\t\t\t while (dp[nowBit][nowPos] != 0) {\n\t\t\t\tint nextBit = prevBit[nowBit][nowPos];\n\t\t\t\tint nextPos = prevPos[nowBit][nowPos];\n\t\t\t \t\n\t\t\t \tif (nextBit == nowBit) ans.push_back(pii(1, nowPos + 1));\n\t\t\t \telse {\n\t\t\t \t\tint tmp, pat;\n\t\t\t \t\tif (nextBit > nowBit) {\n\t\t\t \t\t\tpat = 3;\n\t\t\t \t\t\ttmp = nextBit & ~nowBit;\n\t\t\t \t\t}\n\t\t\t \t\telse {\n\t\t\t \t\t\tpat = 2;\n\t\t\t \t\t\ttmp = nowBit & ~nextBit;\n\t\t\t \t\t}\n\t\t\t \t\t\n\t\t\t \t\tint c = 0;\n\t\t\t \t\twhile (tmp > 0) {\n\t\t\t \t\t\ttmp >>= 1;\n\t\t\t \t\t\tc++;\n\t\t\t \t\t}\n\t\t\t \t\tans.push_back(pii(pat, c));\n\t\t\t \t}\n\t\t\t \t\n\t\t\t \tnowBit = nextBit;\n\t\t\t \tnowPos = nextPos;\n\t\t\t }\n\t\t\t reverse(ans.begin(), ans.end());\n\t\t\t REP(i, ans.size()) {\n\t\t\t \tif (ans[i].first == 1) {\n\t\t\t \t\tprintf(\"Move to room %d.\\n\", ans[i].second);\n\t\t\t \t}\n\t\t\t \telse {\n\t\t\t \t\tvector<pii> tmp;\n\t\t\t \t\twhile (i < ans.size() && ans[i].first != 1) {\n\t\t\t \t\t\ttmp.push_back(pii(ans[i].second, ans[i].first));\n\t\t\t \t\t\ti++;\n\t\t\t \t\t}\n\t\t\t \t\ti--;\n\t\t\t \t\tsort(tmp.begin(), tmp.end());\n\t\t\t \t\tREP(j, tmp.size()) {\n\t\t\t \t\t\tif (tmp[j].second == 2) printf(\"Switch on room %d.\\n\", tmp[j].first);\n\t\t\t \t\t\telse printf(\"Switch off room %d.\\n\", tmp[j].first);\n\t\t\t \t\t}\n\t\t\t \t}\n\t\t\t }\n\t\t}\n\t\telse {\n\t\t\tbool flag = false;\n\t\t\tREP(i, 1<<n) if (dp[i][n - 1] != INF) flag = true;\n\t\t\tif (flag) puts(\"You can not switch off all lights.\");\n\t\t\telse puts(\"Help me!\");\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7088,
"score_of_the_acc": -0.0651,
"final_rank": 3
},
{
"submission_id": "aoj_0172_1975026",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define INF (1<<29)\n\ntypedef pair<int, int> pii;\n\nint n, m;\nint startBit;\nint dp[1<<16][15];\nint prevBit[1<<16][15];\nint prevPos[1<<16][15];\nvector<int> graph[15];\nvector<int> swit[15];\n\n\nint main() {\n\twhile (cin >> n >> m, n || m) {\n\t\tstartBit = 0;\n\t\tfill(dp[0], dp[1<<16], INF);\n\t\tfill(prevBit[0], prevBit[1<<16], INF);\n\t\tfill(prevPos[0], prevBit[1<<16], INF);\n\t\tREP(i, n) graph[i].clear();\n\t\tREP(i, n) swit[i].clear();\n\t\t\t\t\n\t\tREP(i, m) {\n\t\t\tint a, b;\n\t\t\tscanf(\"%d %d\", &a, &b);\n\t\t\ta--; b--;\n\t\t\tgraph[a].push_back(b);\n\t\t\tgraph[b].push_back(a);\n\t\t}\n\t\tREP(i, n) {\n\t\t\tint a;\n\t\t\tscanf(\"%d\", &a);\n\t\t\tstartBit |= (a<<i);\n\t\t}\n\t\tREP(i, n) {\n\t\t\tint c;\n\t\t\tscanf(\"%d\", &c);\n\t\t\tREP(j, c) {\n\t\t\t\tint a;\n\t\t\t\tscanf(\"%d\", &a);\n\t\t\t\ta--;\n\t\t\t\tswit[i].push_back(a);\n\t\t\t}\n\t\t}\n\t\t\n\t\tqueue<pii> que;\n\t\tque.push(pii(startBit, 0));\n\t\tdp[startBit][0] = 0;\n\t\t\n\t\twhile (!que.empty()) {\n\t\t\tint nowBit = que.front().first;\n\t\t\tint nowPos = que.front().second;\n\t\t\tque.pop();\n\t\t\t\n\t\t\tif ((nowBit & (1<<nowPos) == 0)) continue;\n\t\t\t\n\t\t\tREP(i, graph[nowPos].size()) {\n\t\t\t\tint nextPos = graph[nowPos][i];\n\t\t\t\t\n\t\t\t\tif ((nowBit & (1<<nextPos)) > 0\n\t\t\t\t\t&& dp[nowBit][nextPos] > dp[nowBit][nowPos] + 1) {\n\t\t\t\t\t\n\t\t\t\t\tprevBit[nowBit][nextPos] = nowBit;\n\t\t\t\t\tprevPos[nowBit][nextPos] = nowPos;\n\t\t\t\t\tdp[nowBit][nextPos] = dp[nowBit][nowPos] + 1;\n\t\t\t\t\tque.push(pii(nowBit, nextPos));\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tREP(i, swit[nowPos].size()) {\n\t\t\t\tint nextBit = nowBit ^ (1<<swit[nowPos][i]);\n\t\t\t\t\n\t\t\t\tif (swit[nowPos][i] == nowPos) continue;\n\t\t\t\tif (dp[nextBit][nowPos] > dp[nowBit][nowPos] + 1) {\n\t\t\t\t\tprevBit[nextBit][nowPos] = nowBit;\n\t\t\t\t\tprevPos[nextBit][nowPos] = nowPos;\n\t\t\t\t\tdp[nextBit][nowPos] = dp[nowBit][nowPos] + 1;\n\t\t\t\t\tque.push(pii(nextBit, nowPos));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (dp[1<<(n - 1)][n - 1] != INF) {\n\t\t\t printf(\"You can go home in %d steps.\\n\", dp[1<<(n - 1)][n - 1]);\n\t\t\t vector<pii> ans; // first: 1move 2switch on 3switch off\tsecond: number\n\t\t\t \n\t\t\t int nowBit = 1<<(n - 1);\n\t\t\t int nowPos = n - 1;\n\t\t\t \n\t\t\t while (dp[nowBit][nowPos] != 0) {\n\t\t\t\tint nextBit = prevBit[nowBit][nowPos];\n\t\t\t\tint nextPos = prevPos[nowBit][nowPos];\n\t\t\t \t\n\t\t\t \tif (nextBit == nowBit) ans.push_back(pii(1, nowPos + 1));\n\t\t\t \telse {\n\t\t\t \t\tint tmp, pat;\n\t\t\t \t\tif (nextBit > nowBit) {\n\t\t\t \t\t\tpat = 3;\n\t\t\t \t\t\ttmp = nextBit & ~nowBit;\n\t\t\t \t\t}\n\t\t\t \t\telse {\n\t\t\t \t\t\tpat = 2;\n\t\t\t \t\t\ttmp = nowBit & ~nextBit;\n\t\t\t \t\t}\n\t\t\t \t\t\n\t\t\t \t\tint c = 0;\n\t\t\t \t\twhile (tmp > 0) {\n\t\t\t \t\t\ttmp >>= 1;\n\t\t\t \t\t\tc++;\n\t\t\t \t\t}\n\t\t\t \t\tans.push_back(pii(pat, c));\n\t\t\t \t}\n\t\t\t \t\n\t\t\t \tnowBit = nextBit;\n\t\t\t \tnowPos = nextPos;\n\t\t\t }\n\t\t\t reverse(ans.begin(), ans.end());\n\t\t\t REP(i, ans.size()) {\n\t\t\t \tif (ans[i].first == 1) {\n\t\t\t \t\tprintf(\"Move to room %d.\\n\", ans[i].second);\n\t\t\t \t}\n\t\t\t \telse {\n\t\t\t \t\tvector<pii> tmp;\n\t\t\t \t\twhile (i < ans.size() && ans[i].first != 1) {\n\t\t\t \t\t\ttmp.push_back(pii(ans[i].second, ans[i].first));\n\t\t\t \t\t\ti++;\n\t\t\t \t\t}\n\t\t\t \t\ti--;\n\t\t\t \t\tsort(tmp.begin(), tmp.end());\n\t\t\t \t\tREP(j, tmp.size()) {\n\t\t\t \t\t\tif (tmp[j].second == 2) printf(\"Switch on room %d.\\n\", tmp[j].first);\n\t\t\t \t\t\telse printf(\"Switch off room %d.\\n\", tmp[j].first);\n\t\t\t \t\t}\n\t\t\t \t}\n\t\t\t }\n\t\t}\n\t\telse {\n\t\t\tbool flag = false;\n\t\t\tREP(i, 1<<n) if (dp[i][n - 1] != INF) flag = true;\n\t\t\tif (flag) puts(\"You can not switch off all lights.\");\n\t\t\telse puts(\"Help me!\");\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 12848,
"score_of_the_acc": -0.3504,
"final_rank": 16
},
{
"submission_id": "aoj_0172_1962620",
"code_snippet": "# define _CRT_SECUREj_NO_WARNINGS 1\n# define _USE_MATH_DEFINES\n# include <iostream>\n# include <numeric>\n# include <string>\n# include <bitset>\n# include <vector>\n# include <algorithm>\n# include <cstdlib>\n# include <cstdio>\n# include <cstring>\n# include <cstdlib>\n# include <iomanip>\n# include <queue>\n# include <sstream>\n# include <climits>\n# include <cmath>\n# include <list>\n# include <functional>\n# include <string>\n# include <ctime>\n# include <set>\n# include <forward_list>\n# include <map>\n# include <stack>\nusing namespace std;\n# define INF ((int)(1<<25))\n# define REP(i,n) for(int i=0;i<(int)n;i++)\n# define FOR(i,n) REP(i,n)\n# define TORAD 2.0*M_PI/360.0\n# define INT(x) int x;cin>>x;\n# define ALL(x) (x).begin(),(x).end()\n# define RALL(x) (x).rbegin(),(x).rend()\n# define DEBUG(x) cout<<#x<<\" :\"<<x<<endl;\n# define EPS 1e-12\n#ifdef _MSC_VER\n#include <intrin.h>\n#define __builtin_popcount __popcnt\n#endif\ntypedef long long lint;\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef pair<int, pii> piii;\nconst int dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 };\ntemplate<class T> void debug(T a) { for (auto i : a)cout << i << endl; }\n\nconst int MOVE = 0, ON = 1, OFF = 2;\nint n, m;\nvi d[20];\nvi sw[20];\npii pre[1 << 16][20];\npii pw[1 << 16][20];\nstruct P\n{\n\tint a = 0;\n\tint bit = 0, now = 0;\n\n\tbool operator<(const P r)const\n\t{\n\t\treturn a < r.a;\n\t}\n\tbool operator>(const P r)const\n\t{\n\t\treturn a > r.a;\n\t}\n};\nbool ls(const pii& l, const pii& r)\n{\n\treturn l.second < r.second;\n}\nint main()\n{\n\twhile (cin >> n >> m&&n)\n\t{\n\t\tFOR(i, 20)\n\t\t{\n\t\t\td[i].clear();\n\t\t\tsw[i].clear();\n\t\t}\n\t\tFOR(i, 1 << 16) FOR(j, 20)pre[i][j] = pw[i][j] = pii(-1, -1);\n\n\t\tFOR(i, m)\n\t\t{\n\t\t\tint s, t; cin >> s >> t;\n\t\t\td[s].push_back(t);\n\t\t\td[t].push_back(s);\n\t\t}\n\t\tP start;\n\t\tvi ss;\n\t\tFOR(i, n)\n\t\t{\n\t\t\tINT(b);\n\t\t\tss.push_back(b);\n\t\t}\n\t\treverse(ALL(ss));\n\t\tFOR(i, n)\n\t\t{\n\t\t\tstart.bit |= ss[i];\n\t\t\tstart.bit <<= 1;\n\t\t}\n\t\tstart.now = 1;\n\t\tFOR(i, n)\n\t\t{\n\t\t\tINT(k);\n\t\t\tFOR(j, k)\n\t\t\t{\n\t\t\t\tINT(x);\n\t\t\t\tsw[i + 1].push_back(x);\n\t\t\t}\n\t\t\tsort(ALL(sw[i + 1]));\n\t\t}\n\t\tpriority_queue< P, vector<P>, greater<P> >que;\n\t\tque.push(start);\n\t\tbool ok = false;\n\t\twhile (!que.empty())\n\t\t{\n\t\t\tP now = que.top(); que.pop();\n\t\t\tif (now.now == n)ok = true;\n\t\t\tFOR(i, d[now.now].size())\n\t\t\t{\n\t\t\t\tif (!(now.bit & 1 << d[now.now][i]))continue;\n\t\t\t\tP next = now;\n\t\t\t\tnext.a++;\n\t\t\t\tnext.now = d[now.now][i];\n\t\t\t\tif (pre[next.bit][next.now] == pii(-1, -1))\n\t\t\t\t{\n\t\t\t\t\tque.push(next);\n\t\t\t\t\tpre[next.bit][next.now] = pii(now.bit, now.now);\n\t\t\t\t\tpw[next.bit][next.now] = pii(MOVE, next.now);\n\t\t\t\t}\n\t\t\t}\n\t\t\tFOR(i, sw[now.now].size())\n\t\t\t{\n\t\t\t\tif (now.now == sw[now.now][i])continue;\n\t\t\t\tP next = now;\n\t\t\t\tnext.a++;\n\t\t\t\tnext.bit ^= 1 << sw[now.now][i];\n\n\t\t\t\tif (pre[next.bit][next.now] == pii(-1, -1))\n\t\t\t\t{\n\t\t\t\t\tque.push(next);\n\t\t\t\t\tpre[next.bit][next.now] = pii(now.bit, now.now);\n\t\t\t\t\tpw[next.bit][next.now] = pii(now.bit & 1 << sw[now.now][i] ? OFF : ON, sw[now.now][i]);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\tvector<pii> ans;\n\t\tif (ok)\n\t\t{\n\t\t\tif (pre[1 << n][n] != pii(-1, -1))\n\t\t\t{\n\t\t\t\tpii now(1 << n, n);\n\t\t\t\twhile (now.first != start.bit || now.second != 1)\n\t\t\t\t{\n\t\t\t\t\tans.push_back(pw[now.first][now.second]);\n\t\t\t\t\tnow = pre[now.first][now.second];\n\t\t\t\t}\n\t\t\t\treverse(ALL(ans));\n\t\t\t\tfor (int i = 0; i < ans.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tint l, r;\n\t\t\t\t\tif (ans[i].first == ON || ans[i].first == OFF)\n\t\t\t\t\t{\n\t\t\t\t\t\tr = l = i;\n\t\t\t\t\t\twhile (ans[r].first == ON || ans[r].first == OFF)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tr++;\n\t\t\t\t\t\t\tif (r == ans.size())break;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tsort(ans.begin() + l, ans.begin() + r, ls);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tprintf(\"You can go home in %d steps.\\n\", ans.size());\n\t\t\t\tFOR(i, ans.size())\n\t\t\t\t{\n\t\t\t\t\tswitch (ans[i].first)\n\t\t\t\t\t{\n\t\t\t\t\tcase MOVE:\n\t\t\t\t\t\tprintf(\"Move to room %d.\\n\", ans[i].second);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase OFF:\n\t\t\t\t\t\tprintf(\"Switch off room %d.\\n\", ans[i].second);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase ON:\n\t\t\t\t\t\tprintf(\"Switch on room %d.\\n\", ans[i].second);\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\telse\n\t\t\t{\n\t\t\t\tcout << \"You can not switch off all lights.\" << endl;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"Help me!\" << endl;\n\t\t}\n\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 23772,
"score_of_the_acc": -0.9649,
"final_rank": 17
},
{
"submission_id": "aoj_0172_1882670",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\n#include<cstdio>\n#include<cassert>\n#include<algorithm>\n#include<bitset>\n#include<deque>\n#define F first\n#define S second\n\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\nstruct Pox\n{\n int cost;\n int p;\n int bit;\n vector<P> step;\n // P(1,R) -> Move to room R.\n // P(2,R) -> Switch off room R.\n // P(3,R) -> Switch on room R.\n\n Pox(int p,int bit,int cost):p(p),bit(bit),cost(cost){step.clear();}\n};\n\nint n,m;\n\nint main()\n{\n while(cin >> n >> m, (n || m))\n {\n VVI G;\n G.resize(n);\n for(int i=0;i<m;i++)\n\t{\n\t int s,t;\n\t scanf(\"%d %d\",&s,&t);\n\t t--,s--;\n\t G[s].push_back(t);\n\t G[t].push_back(s);\n\t}\n int initial_bit = 0;\n for(int i=0;i<n;i++)\n\t{\n\t int b;\n\t cin >> b;\n\t if(b)\n\t initial_bit |= (1<<i);\n\t}\n \n VVI E;\n E.resize(n);\n for(int i=0;i<n;i++)\n\t{\n\t int k;\n\t cin >> k;\n\t for(int j=0;j<k;j++)\n\t {\n\t int r;\n\t cin >> r;\n\t r--;\n\t E[i].push_back(r);\n\t }\n\t sort(E[i].begin(),E[i].end());\n\t}\n\n int mincost[1<<n][n];\n for(int i=0;i<=(1<<n)-1;i++)\n\tfor(int j=0;j<n;j++)\n\t mincost[i][j] = (1<<29);\n\n deque<Pox> deq;\n mincost[initial_bit][0] = 0;\n deq.push_back(Pox(0,initial_bit,0));\n\n int men_cost = (1<<29);\n vector<P> men_step;\n bool sub = false;\n\n while(!deq.empty())\n\t{\n\t Pox pox = deq.front(); deq.pop_front();\n\t \n\t if(!((pox.bit >> pox.p) & 1))\n\t continue;\n\n\t if(pox.p == n-1 && __builtin_popcount(pox.bit) == 1 && (pox.bit>>(n-1)) & 1) \n\t {\n\t if(men_cost > pox.cost)\n\t\t{\n\t\t men_cost = pox.cost;\n\t\t men_step = pox.step;\n\t\t}\n\t }\n\t else if(pox.p == n-1)\n\t {\n\t sub = true;\n\t }\n\n\t for(int i=0;i<G[pox.p].size();i++)\n\t {// Move\n\t int next = G[pox.p][i];\n\n\t if(!((pox.bit>>next)&1))\n\t\tcontinue;\n\n\t if(mincost[pox.bit][next] > pox.cost + 1)\n\t\t{\n\t\t mincost[pox.bit][next] = pox.cost + 1;\n\t\t Pox next_pox = Pox(next,pox.bit,pox.cost+1);\n\t\t next_pox.step = pox.step;\n\t\t next_pox.step.push_back(P(1,next));\n\t\t deq.push_back(next_pox);\n\t\t}\n\t }// Move\n\n\t for(int i=0;i<E[pox.p].size();i++)\n\t {\n\t int next = E[pox.p][i];\n\t \n\t if(next == pox.p)\n\t\tcontinue;\n\n\t bool swit = (pox.bit>>next)&1?0:1;\n\t int nbit;\n\t if(swit)\n\t\t nbit = pox.bit,nbit |= (1<<next);\n\t else \n\t\t nbit = pox.bit, nbit &= ~(1<<next);\n\n\t bitset<10> before(nbit);\n\n\t if(mincost[nbit][pox.p] > pox.cost+1)\n\t\t{\n \t\t mincost[nbit][pox.p] = pox.cost + 1;\n\t\t Pox next_pox = Pox(pox.p,nbit,pox.cost+1);\n\t\t next_pox.step = pox.step;\n\t\t next_pox.step.push_back(P(swit?3:2,next));\n\t\t deq.push_back(next_pox);\n\t\t}\n\t }\n\t}\n\n if(men_cost == (1<<29) && !sub)\n\t cout << \"Help me!\" << endl;\n else if(men_cost == (1<<29) && sub)\n\t cout << \"You can not switch off all lights.\" << endl;\n else if(men_cost != (1<<29))\n\t{\n\t cout << \"You can go home in \" << men_cost << \" steps.\" << endl;\n\t for(int i=0;i<men_step.size();i++)\n\t {\n\t P p = men_step[i];\n\t if(p.F == 1)\n\t\tcout << \"Move to room \" << p.S+1 << \".\" << endl;\n\t else if(p.F == 2)\n\t\tcout << \"Switch off room \" << p.S+1 << \".\" << endl;\n\t else if(p.F == 3)\n\t\tcout << \"Switch on room \" << p.S+1 << \".\" << endl;\n\t else\n\t\tassert(false);\n\t }\n\t}\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5372,
"score_of_the_acc": -0.1333,
"final_rank": 4
},
{
"submission_id": "aoj_0172_1665026",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n#include <vector>\n#include <functional>\n#define INF 1<<30\n#define MAX_V 16\n\nusing namespace std;\ntypedef pair<int,int> P;\nclass data{\npublic:\n\tint cost,v,bit;\n\tdata(){}\n\tdata(int vv,int bb,int cc){\n\t\tcost=cc;\n\t\tv=vv;\n\t\tbit=bb;\n\t}\n\tbool operator<(const data &d)const{\n\t\treturn cost>d.cost;\n\t}\n};\nint n,m;\nvector<int> G[MAX_V];\nint s[MAX_V];\nint dp[MAX_V][1<<MAX_V];\nint pv[MAX_V][1<<MAX_V],pbit[MAX_V][1<<MAX_V];\nbool flag;\nint dijk(int x){\n\tif(!(x & 1))return -1;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<(1<<n);j++){\n\t\t\tdp[i][j]=INF;\n\t\t\tpv[i][j]=-1;\n\t\t\tpbit[i][j]=-1;\n\t\t}\n\t}\n\tpriority_queue<data> que;\n\tque.push(data(0,x,0));\n\tdp[0][x]=0;\n\twhile(que.size()){\n\t\tdata q=que.top();\n\t\tque.pop();\n\t\tif(q.cost>dp[q.v][q.bit])continue;\n\t\tif(q.v==n-1 && q.bit==1<<(n-1))return q.cost;\n\t\tif(q.v==n-1)flag=true;\n\t\tfor(int i=0;i<G[q.v].size();i++){\n\t\t\tint t=G[q.v][i];\n\t\t\tif(dp[t][q.bit]>q.cost+1 && (q.bit>>t & 1)){\n\t\t\t\tdp[t][q.bit]=q.cost+1;\n\t\t\t\tpv[t][q.bit]=q.v;\n\t\t\t\tpbit[t][q.bit]=q.bit;\n\t\t\t\tque.push(data(t,q.bit,q.cost+1));\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i==q.v)continue;\n\t\t\tif(pv[q.v][q.bit]==q.v && abs(q.bit-pbit[q.v][q.bit])>(1<<i))continue;\n\t\t\tif(s[q.v]>>i & 1){\n\t\t\t\tint nbit=q.bit^(1<<i);\n\t\t\t\tif(dp[q.v][nbit]>q.cost+1){\n\t\t\t\t\tdp[q.v][nbit]=q.cost+1;\n\t\t\t\t\tpv[q.v][nbit]=q.v;\n\t\t\t\t\tpbit[q.v][nbit]=q.bit;\n\t\t\t\t\tque.push(data(q.v,nbit,q.cost+1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\nint main(void){\n\twhile(1){\n\t\tscanf(\"%d%d\",&n,&m);\n\t\tif(n+m==0)break;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tint f,t;\n\t\t\tscanf(\"%d%d\",&f,&t);\n\t\t\tf--;\n\t\t\tt--;\n\t\t\tG[f].push_back(t);\n\t\t\tG[t].push_back(f);\n\t\t}\n\t\tint st=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint a;\n\t\t\tscanf(\"%d\",&a);\n\t\t\tst+=a<<i;\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint a;\n\t\t\tscanf(\"%d\",&a);\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tint b;\n\t\t\t\tscanf(\"%d\",&b);\n\t\t\t\tb--;\n\t\t\t\ts[i]|=1<<b;\n\t\t\t}\n\t\t}\n\t\tflag=false;\n\t\tint res=dijk(st);\n\t\tif(res==-1){\n\t\t\tif(!flag)printf(\"Help me!\\n\");\n\t\t\telse printf(\"You can not switch off all lights.\\n\");\n\t\t}else{\n\t\t\tprintf(\"You can go home in %d steps.\\n\",res);\n\t\t\tvector<P> vec;\n\t\t\tint v=n-1,bit=1<<(n-1);\n\t\t\twhile(v!=-1){\n\t\t\t\tvec.push_back(P(v,bit));\n\t\t\t\tint nv=pv[v][bit];\n\t\t\t\tint nbit=pbit[v][bit];\n\t\t\t\tv=nv;\n\t\t\t\tbit=nbit;\n\t\t\t}\n\t\t\treverse(vec.begin(),vec.end());\n\t\t\tfor(int i=0;i<(int)vec.size()-1;i++){\n\t\t\t\tif(vec[i].first!=vec[i+1].first)printf(\"Move to room %d.\\n\",vec[i+1].first+1);\n\t\t\t\telse{\n\t\t\t\t\tint a=abs(vec[i].second-vec[i+1].second);\n\t\t\t\t\tint cnt=1;\n\t\t\t\t\twhile(a>1){\n\t\t\t\t\t\ta/=2;\n\t\t\t\t\t\tcnt++;\n\t\t\t\t\t}\n\t\t\t\t\tprintf(\"Switch %s room %d.\\n\",vec[i].second>vec[i+1].second?\"off\":\"on\",cnt);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmemset(s,0,sizeof(s));\n\t\tfor(int i=0;i<n;i++){\n\t\t\tG[i].clear();\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 12544,
"score_of_the_acc": -0.2722,
"final_rank": 10
},
{
"submission_id": "aoj_0172_1542463",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nstruct data{\n int pos,state,cost;\n data(int pos,int state):pos(pos),state(state){}\n};\nconst int INF=1001001001;\n\nint N,M;\nvector<int>G[15];\nvector<int>light[15];\nint dist[1<<16][15];\nint prevstate[1<<16][15],prevpos[1<<16][15];\nvoid solve(int bit){\n fill_n(*dist,(1<<16)*15,INF);\n dist[bit][0]=0;\n queue<data>que;\n que.push(data(0,bit));\n\n while(que.size()){\n data d=que.front();que.pop();\n\n for(int i=0;i<light[d.pos].size();i++){\n int l=light[d.pos][i];\n if(l==d.pos)continue;\n int tobit=d.state^(1<<l);\n if(dist[tobit][d.pos]<=dist[d.state][d.pos]+1)continue;\n dist[tobit][d.pos]=dist[d.state][d.pos]+1;\n prevstate[tobit][d.pos]=d.state;\n prevpos[tobit][d.pos]=d.pos;\n que.push(data(d.pos,tobit));\n }\n\n for(int i=0;i<G[d.pos].size();i++){\n int to=G[d.pos][i];\n if((d.state>>to&1)==0)continue;\n if(dist[d.state][to]<=dist[d.state][d.pos]+1)continue;\n dist[d.state][to]=dist[d.state][d.pos]+1;\n prevstate[d.state][to]=d.state;\n prevpos[d.state][to]=d.pos;\n que.push(data(to,d.state));\n }\n }\n\n bool flag=false;\n for(int i=0;i<(1<<N);i++)if(dist[i][N-1]!=INF)flag=true;\n if(!flag){\n cout<<\"Help me!\"<<endl;\n return;\n }\n\n if(dist[1<<(N-1)][N-1]==INF){\n cout<<\"You can not switch off all lights.\"<<endl;\n return;\n }\n\n int state=1<<(N-1),pos=N-1;\n cout<<\"You can go home in \"<<dist[1<<(N-1)][N-1]<<\" steps.\"<<endl;\n vector<string>log;\n while(state!=bit||pos!=0){\n string s;\n if(prevpos[state][pos]!=pos){\n stringstream ss;\n ss<<\"Move to room \"<<pos+1<<\".\";\n getline(ss,s);\n log.push_back(s);\n int a=prevstate[state][pos];\n int b=prevpos[state][pos];\n state=a;pos=b;\n }\n else{\n vector<int>id;\n vector<int>is;\n while(prevstate[state][pos]!=state&&(state!=bit||pos!=0)){\n for(int i=0;i<N;i++){\n if((prevstate[state][pos]>>i&1)!=(state>>i&1)){\n id.push_back(i);\n is.push_back(state>>i&1);\n break;\n }\n }\n int a=prevstate[state][pos];\n int b=prevpos[state][pos];\n state=a;pos=b;\n }\n for(int i=0;i<id.size();i++){\n for(int j=i+1;j<id.size();j++){\n if(id[i]<id[j]){\n swap(id[i],id[j]);\n swap(is[i],is[j]);\n }\n }\n }\n for(int i=0;i<id.size();i++){\n stringstream ss;\n if(is[i])ss<<\"Switch on room \";\n else ss<<\"Switch off room \";\n ss<<id[i]+1;\n ss<<\".\";\n getline(ss,s);\n log.push_back(s);\n }\n\n }\n\n\n }\n\n reverse(log.begin(),log.end());\n for(int i=0;i<log.size();i++)cout<<log[i]<<endl;\n}\n\n\n\n\n\nint main(){\n while(cin>>N>>M,N||M){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<N;i++)light[i].clear();\n\n for(int i=0;i<M;i++){\n int a,b;cin>>a>>b;a--;b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n int bit=0;\n bool flag=false;\n for(int i=0;i<N;i++){\n int a;cin>>a;\n if(a)bit|=(1<<i);\n if(i==0&&a==0)flag=true;\n }\n\n\n for(int i=0;i<N;i++){\n int k;cin>>k;\n for(int j=0;j<k;j++){\n int a;cin>>a;a--;\n light[i].push_back(a);\n }\n }\n if(flag)cout<<\"Help me!\"<<endl;\n else solve(bit);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 11936,
"score_of_the_acc": -0.2491,
"final_rank": 9
},
{
"submission_id": "aoj_0172_1493787",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define BIT(x) (1 << (x))\n\nstruct State {\n\tint cur;\n\tint light;\n\tvector<pair<int, int> > log;\n\tState(){}\n};\n\nconst int MOVE = 1;\nconst int OFF = 2;\nconst int ON = 3;\n\nint n, m;\nvector<int> g[15];\nvector<int> sw[15];\nbool vis[15][1 << 15];\n\nState initial;\n\nvoid solve()\n{\n\tmemset(vis, 0, sizeof(vis));\n\t\n\tint ca = 3;\n\tvector<pair<int, int> > res;\n\t\n\tqueue<State> q;\n\tif (initial.light & BIT(0)) q.push(initial);\n\t\n\twhile (q.size()){\n\t\tState st = q.front();\n\t\tq.pop();\n\t\t\t\n\t\tif (vis[st.cur][st.light]) continue;\n\t\tvis[st.cur][st.light] = true;\n\t\t\n\t\tif (st.cur == n - 1){\n\t\t\tif (st.light == BIT(n - 1)){\n\t\t\t\tca = 1;\n\t\t\t\tres = st.log;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse ca = 2;\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < g[st.cur].size(); i++){\n\t\t\tState nx = st;\n\t\t\tnx.cur = g[st.cur][i];\n\t\t\tif (st.light & BIT(g[st.cur][i])){\n\t\t\t\tnx.log.push_back(make_pair(MOVE, nx.cur));\n\t\t\t\tq.push(nx);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < sw[st.cur].size(); i++){\n\t\t\tif (st.cur == sw[st.cur][i]) continue;\n\t\t\tState nx = st;\n\t\t\tnx.light ^= BIT(sw[st.cur][i]);\n\t\t\tif (nx.light & BIT(sw[st.cur][i])){\n\t\t\t\tnx.log.push_back(make_pair(ON, sw[st.cur][i]));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnx.log.push_back(make_pair(OFF, sw[st.cur][i]));\n\t\t\t}\n\t\t\tq.push(nx);\n\t\t}\n\t}\n\t\n\tif (ca == 1){\n\t\tprintf(\"You can go home in %d steps.\\n\", res.size());\n\t\tfor (int i = 0; i < res.size(); i++){\n\t\t\tif (res[i].first == MOVE){\n\t\t\t\tprintf(\"Move to room %d.\\n\", res[i].second + 1);\n\t\t\t}\n\t\t\telse if (res[i].first == OFF){\n\t\t\t\tprintf(\"Switch off room %d.\\n\", res[i].second + 1);\n\t\t\t}\n\t\t\telse if (res[i].first == ON){\n\t\t\t\tprintf(\"Switch on room %d.\\n\", res[i].second + 1);\n\t\t\t}\n\t\t}\n\t}\n\telse if (ca == 2){\n\t\tputs(\"You can not switch off all lights.\");\n\t}\n\telse if (ca == 3){\n\t\tputs(\"Help me!\");\n\t}\n}\n\nint main()\n{\n\twhile (scanf(\"%d %d\", &n, &m), n){\n\t\tfor (int i = 0; i < 15; i++){\n\t\t\tg[i].clear();\n\t\t\tsw[i].clear();\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < m; i++){\n\t\t\tint s, t;\n\t\t\tscanf(\"%d %d\", &s, &t);\n\t\t\tg[--s].push_back(--t);\n\t\t\tg[t].push_back(s);\n\t\t}\n\t\t\n\t\tint light = 0;\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tint a;\n\t\t\tscanf(\"%d\", &a);\n\t\t\tif (a) light |= BIT(i);\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tint k;\n\t\t\tscanf(\"%d\", &k);\n\t\t\tfor (int j = 0; j < k; j++){\n\t\t\t\tint r;\n\t\t\t\tscanf(\"%d\", &r);\n\t\t\t\tsw[i].push_back(--r);\n\t\t\t}\n\t\t\tsort(sw[i].begin(), sw[i].end());\n\t\t}\n\t\t\n\t\tinitial.cur = 0;\n\t\tinitial.light = light;\n\t\tinitial.log.clear();\n\t\t\n\t\tsolve();\n\t}\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 11644,
"score_of_the_acc": -1.038,
"final_rank": 18
},
{
"submission_id": "aoj_0172_1442006",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 15\n#define INF 1e9\n\nint N,M,light,swt[MAX];\nvector<int> G[MAX];\n\nvoid init(){\n for(int i = 0 ; i < MAX ; i++){\n G[i].clear();\n swt[i] = 0;\n }\n}\n\nstruct State{\n int v,l;\n State(){}\n State(int v,int l) : v(v),l(l) {}\n};\n\nvoid solve(){\n int d[MAX][1<<MAX];\n State path[MAX][1<<MAX];\n fill(d[0],d[0]+MAX*(1<<MAX),INF);\n\n bool found = false;\n d[0][light] = 0;\n queue<State> Q;\n Q.push(State(0,light));\n while(!Q.empty()){\n State s = Q.front(); Q.pop();\n int v = s.v;\n if(v == N-1 && s.l == (1<<(N-1))){\n found = true;\n break;\n }\n for(int i = 0 ; i < (int)G[v].size() ; i++){\n int to = G[v][i];\n if(d[v][s.l] + 1 < d[to][s.l] && (s.l >> to & 1)){\n d[to][s.l] = d[v][s.l] + 1;\n path[to][s.l] = s;\n Q.push(State(to,s.l));\n }\n }\n for(int i = 0 ; i < N ; i++){\n if(i == v){ continue; }\n if(swt[v] >> i & 1){\n int nl = s.l;\n if(s.l >> i & 1){\n nl -= (1<<i);\n }else{\n nl |= (1<<i);\n }\n if(d[v][s.l] + 1 < d[v][nl]){\n d[v][nl] = d[v][s.l] + 1;\n path[v][nl] = s;\n Q.push(State(v,nl));\n }\n }\n }\n }\n if(found){\n cout << \"You can go home in \" << d[N-1][1<<(N-1)] << \" steps.\" << endl;\n int v = N-1,l = 1<<(N-1);\n vector<State> vec;\n vec.push_back(State(N-1,(1<<(N-1))));\n while(true){\n if(v == 0 && l == light){ break; }\n State next = path[v][l];\n vec.push_back(next);\n v = next.v; l = next.l;\n }\n reverse(vec.begin(),vec.end());\n int size = vec.size();\n for(int i = 0 ; i < size-1 ; i++){\n State cs = vec[i],ns = vec[i+1];\n if(cs.v == ns.v){\n int j;\n bool on = false, off = false;\n for(j = 0 ; j < N ; j++){\n if((cs.l >> j & 1) && !(ns.l >> j & 1)){\n off = true;\n break;\n }\n if(!(cs.l >> j & 1) && (ns.l >> j & 1)){\n on = true;\n break;\n }\n }\n if(on){\n cout << \"Switch on room \" << j+1 << \".\" << endl;\n }else if(off){\n cout << \"Switch off room \" << j+1 << \".\" << endl;\n }\n }else{\n cout << \"Move to room \" << ns.v+1 << \".\" << endl;\n }\n }\n }else{\n for(int i = 0 ; i < (1<<N) ; i++){\n if(d[N-1][i] != INF){\n cout << \"You can not switch off all lights.\" << endl;\n return;\n }\n }\n cout << \"Help me!\" << endl;\n }\n}\n\nint main(){\n int s,t,k,r;\n while(cin >> N >> M, (N | M)){\n init();\n for(int i = 0 ; i < M ; i++){\n cin >> s >> t; s--; t--;\n G[s].push_back(t);\n G[t].push_back(s);\n }\n int x;\n light = 0;\n for(int i = 0 ; i < N ; i++){\n cin >> x;\n if(x == 1){ light |= (1<<i); }\n }\n for(int i = 0 ; i < N ; i++){\n cin >> k;\n for(int j = 0 ; j < k ; j++){\n cin >> r; r--;\n swt[i] |= (1<<r);\n }\n }\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5772,
"score_of_the_acc": -0.0152,
"final_rank": 1
},
{
"submission_id": "aoj_0172_1107324",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\nusing namespace std;\nvector<int>g[20];\nint bfs[1<<15][15];\nint rev[1<<15][15];\nint r[16];\nint can[16][16];\nint ans[1000000];\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++)g[i].clear();\n\t\tfor(int i=0;i<b;i++){\n\t\t\tint p,q;\n\t\t\tscanf(\"%d%d\",&p,&q);p--;q--;\n\t\t\tg[p].push_back(q);\n\t\t\tg[q].push_back(p);\n\t\t}\n\t\tfor(int i=0;i<a;i++)scanf(\"%d\",r+i);\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++)can[i][j]=0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint c;scanf(\"%d\",&c);\n\t\t\tfor(int j=0;j<c;j++){\n\t\t\t\tint d;scanf(\"%d\",&d);\n\t\t\t\td--;\n\t\t\t\tcan[i][d]=1;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<(1<<a);i++)for(int j=0;j<a;j++)\n\t\t\tbfs[i][j]=-1;\n\t\tint now=0;\n\t\tfor(int i=0;i<a;i++)now+=r[i]*(1<<i);\n\t\tbfs[now][0]=0;\n\t\tqueue<pair<int,int> > Q;\n\t\tQ.push(make_pair(now,0));\n\t\twhile(Q.size()){\n\t\t\tint bit=Q.front().first;\n\t\t\tint at=Q.front().second;\n\t\t\tQ.pop();\n\t\t\tfor(int i=0;i<g[at].size();i++){\n\t\t\t\tif((bit&(1<<g[at][i]))&&!~bfs[bit][g[at][i]]){\n\t\t\t\t\tbfs[bit][g[at][i]]=bfs[bit][at]+1;\n\t\t\t\t\trev[bit][g[at][i]]=at;\n\t\t\t\t\tQ.push(make_pair(bit,g[at][i]));\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=0;i<a;i++){\n\t\t\t\tif(at!=i&&can[at][i]&&!~bfs[bit^(1<<i)][at]){\n\t\t\t\t\tbfs[bit^(1<<i)][at]=bfs[bit][at]+1;\n\t\t\t\t\trev[bit^(1<<i)][at]=-1-i;\n\t\t\t\t\tQ.push(make_pair(bit^(1<<i),at));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(r[0]==0){\n\t\t\tprintf(\"Help me!\\n\");\n\t\t\tcontinue;\n\t\t}\n\t\tif(~bfs[(1<<(a-1))][a-1]){\n\t\t\tprintf(\"You can go home in %d steps.\\n\",bfs[(1<<(a-1))][a-1]);\n\t\t\tint bit=(1<<(a-1));\n\t\t\tint at=a-1;\n\t\t\tfor(int i=0;i<bfs[(1<<(a-1))][a-1];i++){\n\t\t\t\t\n\t\t\t\tif(rev[bit][at]>=0){\n\t\t\t\t\tans[bfs[(1<<(a-1))][a-1]-i-1]=at;\n\t\t\t\t\tat=rev[bit][at];\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tans[bfs[(1<<(a-1))][a-1]-i-1]=rev[bit][at];\n\t\t\t\t\tbit^=(1<<(-rev[bit][at]-1));\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=0;i<bfs[(1<<(a-1))][a-1];i++){\n\t\t\t\tif(ans[i]>=0)printf(\"Move to room %d.\\n\",ans[i]+1);\n\t\t\t\telse if(now&(1<<(-ans[i]-1))){\n\t\t\t\t\tprintf(\"Switch off room %d.\\n\",-ans[i]);\n\t\t\t\t\tnow^=(1<<(-ans[i]-1));\n\t\t\t\t}else {\n\t\t\t\t\tprintf(\"Switch on room %d.\\n\",-ans[i]);\n\t\t\t\t\tnow^=(1<<(-ans[i]-1));\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tbool ok=false;\n\t\t\tfor(int i=0;i<(1<<a);i++)if(~bfs[i][a-1])ok=true;\n\t\t\tif(ok)printf(\"You can not switch off all lights.\\n\");\n\t\t\telse printf(\"Help me!\\n\");\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6848,
"score_of_the_acc": -0.056,
"final_rank": 2
}
] |
aoj_0178_cpp
|
テトリス
テトリスは、落ちてくるブロックを盤面上に並べて消すゲームです。ここでは、それを少しアレンジしたゲームを考えましょう。
このゲームの盤面の大きさは横 5 コマで、出現するブロックがすべて入るだけの高さがあります。落ちてくるブロックは直線状で、横向き、縦向きの 2 種類があり、長さは 1 から 5 までの 5 種類です。
以下に例を示します。Step(イ) からStep(ホ)までの図はブロックが落ちて消えていく様子を表したものです。
Step(イ)から順にStep(ロ)、Step(ハ)と順に進んでいきます。
ブロックを落とすときに、Step(イ)のようにブロックのどこかが下に積んであるブロックに引っかかったときには、Step(ロ)のように落ちたブロックはその場所で止まります。また、ブロックを落とした結果、盤面の横一行の全てのコマにブロックが詰まった場合には、Step(ニ)で示されるように、その行のブロックが消えます。この後、消えた行の上にあるブロックが、そのままの形で1行下にしずみます(Step(ホ))。
1 ゲームは 1000 個以内のブロックが順に落ちてくることとします。例えば、落ちるブロックの長さが順番に横向き 4 コマ, 横向き 3 コマ, 縦向き 2 コマ, 縦向き 3 コマで、落ちる場所が左端から 1 コマ目、1 コマ目、4 コマ目、5 コマ目であった場合には、下図のStep(イ)~(ト)のように落ち、最後に残るブロックは 2 コマになります。
順番に落ちてくるブロックの情報を入力とし、全てのブロックが落ちた時に残るコマ数を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
n
d
1
p
1
q
1
d
2
p
2
q
2
:
d
n
p
n
q
n
１行目にブロックの数
n
(1 ≤
n
≤ 1000) が与えられます。続く
n
行に
i
個目のブロックの向き
d
i
(1 または2)、ブロックの長さ
p
i
(1 ≤
p
i
≤ 5)、ブロックの位置
q
i
が与えられます。ブロックの向き
d
i
は 1 が横向きを、2 が縦向きを表します。ブロックの位置
q
i
は盤面上の左端から1 ~ 5 までの整数とし、横向きのブロックの場合は左端のコマの落ちる位置とします。
データセットの数は 20 を超えません。
Output
データセット毎に最後に残るブロックの占めるコマ数を１行に出力します。
Sample Input
4
1 4 1
1 3 1
2 2 4
2 3 5
1
1 5 1
7
2 2 2
1 4 1
2 1 3
1 4 1
1 1 1
2 5 5
1 4 2
0
Output for the Sample Input
2
0
6
|
[
{
"submission_id": "aoj_0178_9373749",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n;\n cin >> n;\n if (n == 0) return 1;\n vi p(n), q(n), d(n);\n rep(i, n) {\n cin >> d[i] >> p[i] >> q[i];\n q[i]--;\n }\n vv(ll, b, n*5+2, 5, 0);\n rep(j, 5) b[0][j] = 1;\n vc<bool> removed(len(b), false);\n rep(k, n) {\n ll prev = len(b)-1;\n bool found = false;\n rrep(i, len(b)-1) {\n if (removed[i]) continue;\n if (d[k] == 1) {\n rep(j, q[k], q[k]+p[k]) {\n if (b[i][j] == 1) {\n rep(l, q[k], q[k]+p[k]) {\n b[prev][l] = 1;\n }\n found = true;\n break;\n }\n }\n } else {\n if (b[i][q[k]] == 1) {\n ll cnt = 0;\n rep(l, prev, len(b)) {\n if (removed[l]) continue;\n b[l][q[k]] = 1;\n if (++cnt >= p[k]) break;\n }\n found = true;\n break;\n }\n }\n if (found) break;\n prev = i;\n }\n ll cnt = 0;\n rep(l, prev, len(b)) {\n if (removed[l]) continue;\n if (SUM(b[l]) == 5) {\n removed[l] = true;\n }\n if (++cnt >= p[k]) break;\n }\n }\n ll ans = 0;\n rep(i, 1, len(b)) {\n if (removed[i]) continue;\n ans += SUM(b[i]);\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3764,
"score_of_the_acc": -1,
"final_rank": 11
},
{
"submission_id": "aoj_0178_9067771",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n while (cin >> n, n) {\n deque<char> a[5];\n int sum = 0;\n for (int i = 0; i < n; ++i) {\n int d, p, q;\n cin >> d >> p >> q;\n sum += p, q -= 1;\n if (d == 2) {\n for (int j = 0; j < p; ++j) {\n a[q].push_back('#');\n }\n } else {\n int mx = 0;\n for (int j = 0; j < p; ++j) {\n mx = max(mx, (int)a[q + j].size());\n }\n for (int j = 0; j < p; ++j) {\n while (a[q + j].size() < mx) {\n a[q + j].push_back('.');\n }\n a[q + j].push_back('#');\n }\n }\n // for (int j = 0; j < 5; ++j) {\n // for (int k = 0; k < a[j].size(); ++k) {\n // cout << a[j][k];\n // }\n // cout << endl;\n // }\n deque<char> na[5];\n while (true) {\n bool emp = true;\n bool ers = true;\n for (int j = 0; j < 5; ++j) {\n if (a[j].size() == 0) {\n ers = false;\n continue;\n }\n emp = false;\n na[j].push_back(a[j][0]);\n if (a[j][0] != '#') ers = false;\n a[j].pop_front();\n }\n if (emp) break;\n if (ers) {\n sum -= 5;\n for (int j = 0; j < 5; ++j) {\n na[j].pop_back();\n }\n }\n }\n swap(a, na);\n for (int j = 0; j < 5; ++j) {\n while (a[j].size() and a[j].back() == '.') {\n a[j].pop_back();\n }\n }\n // for (int j = 0; j < 5; ++j) {\n // for (int k = 0; k < a[j].size(); ++k) {\n // cout << a[j][k];\n // }\n // cout << endl;\n // }\n // cout << endl;\n }\n cout << sum << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3476,
"score_of_the_acc": -0.9073,
"final_rank": 10
},
{
"submission_id": "aoj_0178_6875697",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n while(cin >> n, n){\n int d, p, q;\n vector<array<int,5>> A;\n array<int,5> E{};\n while(n--){\n cin >> d >> p >> q;\n q--;\n for(int i = 0; i < 5; i++)A.push_back(E);\n int h = A.size() - 1;\n while(h >= 0){\n if(d == 2){\n if(A[h][q])break;\n }else{\n bool flag = false;\n for(int j = 0; j < p; j++){\n if(A[h][j + q])flag = true;\n }\n if(flag)break;\n }\n h--;\n }\n h++;\n if(d == 2){\n for(int j = 0; j < p; j++){\n A[h + j][q] = 1;\n }\n }else{\n for(int j = 0; j < p; j++){\n A[h][q + j] = 1;\n }\n }\n vector<array<int,5>> B;\n for(int i = 0; i < A.size(); i++){\n int cnt = count(A[i].begin(), A[i].end(), 0);\n if(cnt == 0 || cnt == 5)continue;\n B.push_back(A[i]);\n }\n swap(A, B);\n }\n int ans = 0;\n for(int i = 0; i < A.size(); i++){\n ans += count(A[i].begin(), A[i].end(), 1);\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3572,
"score_of_the_acc": -0.8049,
"final_rank": 9
},
{
"submission_id": "aoj_0178_5747949",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<sstream>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nsigned main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tint d,p,q;\n\t\tbool mp[5000][5]={};\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>d>>p>>q;\n\t\t\tq--;\n\t\t\tfor(int j=4999;j>=0;j--){\n\t\t\t\tbool ok=0;\n\t\t\t\tfor(int k=q;k<q+(d==1?p:1);k++)\n\t\t\t\t\tif(j==0||mp[j-1][k])\n\t\t\t\t\t\tok=1;\n\t\t\t\tif(ok){\n\t\t\t\t\tfor(int k=j+(d==2?p:1)-1;k>=j;k--){\n\t\t\t\t\t\tfor(int l=q;l<q+(d==1?p:1);l++)\n\t\t\t\t\t\t\tmp[k][l]=1;\n\t\t\t\t\t\tbool ok=1;\n\t\t\t\t\t\tfor(int l=0;l<5;l++)\n\t\t\t\t\t\t\tif(!mp[k][l])\n\t\t\t\t\t\t\t\tok=0;\n\t\t\t\t\t\tif(ok){\n\t\t\t\t\t\t\tfor(int l=k;l<4999;l++)\n\t\t\t\t\t\t\t\tfor(int m=0;m<5;m++)\n\t\t\t\t\t\t\t\t\tmp[l][m]=mp[l+1][m];\n\t\t\t\t\t\t\tfor(int l=0;l<5;l++)\n\t\t\t\t\t\t\t\tmp[4999][l]=0;\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}\n\t\tint ans=0;\n\t\tfor(int i=0;i<5000;i++)\n\t\t\tfor(int j=0;j<5;j++)\n\t\t\t\tif(mp[i][j])\n\t\t\t\t\tans++;\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3380,
"score_of_the_acc": -0.6098,
"final_rank": 4
},
{
"submission_id": "aoj_0178_4370880",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nvoid solve(int n){\n vector<vector<int>> grid(5, vector<int>(5*n+1));\n for (int i = 0; i < 5; ++i) grid[i].back() = n+1;\n vector<int> alive(5*n+1);\n vector<int> cnt(5*n+1);\n iota(alive.begin(),alive.end(), 0);\n stack<int> X;\n for (int _ = 0; _ < n; ++_) {\n int d, p, q;\n cin >> d >> p >> q; q--;\n if(d == 1){\n for (int i = 1; i < grid[0].size(); ++i) {\n int ok = 1;\n for (int j = q; j < q+p; ++j) {\n if(grid[j][alive[i]]) ok = 0;\n }\n if(!ok){\n for (int j = q; j < q+p; ++j) {\n int a = alive[i-1];\n grid[j][a] = _+1;\n cnt[a]++;\n if(cnt[a] == 5) X.emplace(a);\n }\n break;\n }\n }\n }else {\n for (int i = 1; i+p-1 < grid[0].size(); ++i) {\n int ok = 1;\n for (int j = i; j < i+p; ++j) {\n if(grid[q][alive[j]]) ok = 0;\n }\n if(!ok){\n for (int j = i; j < i+p; ++j) {\n int a = alive[j-1];\n grid[q][a] = _+1;\n cnt[a]++;\n if(cnt[a] == 5) X.emplace(a);\n }\n break;\n }\n }\n }\n while(!X.empty()){\n alive.erase(lower_bound(alive.begin(),alive.end(), X.top())); X.pop();\n }\n }\n int ans = 0;\n for (auto &&j : alive) {\n for (int i = 0; i < 5; ++i) {\n if(grid[i][j] && grid[i][j] <= n) ans++;\n }\n }\n cout << ans << \"\\n\";\n}\n\nint main() {\n int n;\n while(cin >> n, n){\n solve(n);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3196,
"score_of_the_acc": -0.4228,
"final_rank": 2
},
{
"submission_id": "aoj_0178_4272776",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\n\nint MapData[5001][6];\nint N;\n\n\nvoid solveHori(int len, int pos) {\n\tbool findFirstSquare;\n\n\tfor (int row = 5000; row > -1; --row) {\n\t\tfindFirstSquare = false;\n\t\tfor (int j = 0; j < len; ++j) {\n\t\t\tif (MapData[row][pos+j] == 1) {\n\t\t\t\tfindFirstSquare = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!findFirstSquare) {\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 0; j < len; ++j) {\n\t\t\tMapData[row+1][pos + j] = 1;\n\t\t}\n\t\treturn;\n\t}\n\tfor (int j = 0; j < len; ++j) {\n\t\tMapData[0][pos + j] = 1;\n\t}\n}\n\nvoid solveVert(int len, int pos) {\n\tbool findFirstSquare;\n\n\tfor (int row = 5000; row > -1; --row) {\n\t\tfindFirstSquare = false;\n\t\tif (MapData[row][pos] == 1) {\n\t\t\tfindFirstSquare = true;\n\t\t}\n\t\tif (!findFirstSquare) {\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 0; j < len; ++j) {\n\t\t\tMapData[row + 1 + j][pos] = 1;\n\t\t}\n\t\treturn;\n\t}\n\tfor (int j = 0; j < len; ++j) {\n\t\tMapData[j][pos] = 1;\n\t}\n}\n\nvoid modifyMapData(int row) {\n\n\tfor (int i = row; i < 5000; i++) {\n\t\tfor (int j = 1; j < 6; j++) {\n\t\t\tMapData[i][j] = MapData[i + 1][j];\n\t\t}\n\t}\n\t\n}\n\nvoid earseMapdata() {\n\tint cntZero, cntOne;\n\t\n\tfor (int row = 0; row < 5001; ++row) {\n\t\tcntZero = cntOne = 0;\n\t\tfor (int col = 1; col < 6; ++col) {\n\t\t\tif (MapData[row][col] == 1) {\n\t\t\t\t++cntOne;\n\t\t\t}\n\t\t\telse {\n\t\t\t\t++cntZero;\n\t\t\t}\n\t\t}\n\t\tif (cntZero == 5) {\n\t\t\treturn;\n\t\t}\n\t\tif (cntOne == 5) {\n\t\t\tmodifyMapData(row);\n\t\t\t--row;\n\t\t}\n\t}\n}\n\nint main() {\n\tint d, p, q, cnt;\n\n\twhile (cin >> N, N) {\n\t\tmemset(MapData, 0, sizeof(MapData));\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> d >> p >> q;\n\n\t\t\tif (d == 1) {\n\t\t\t\t//横向き\n\t\t\t\tsolveHori(p, q);\n\t\t\t}\n\t\t\telse if (d == 2) {\n\t\t\t\t//縦向き\n\t\t\t\tsolveVert(p, q);\n\t\t\t}\n\t\t\tearseMapdata();\n\t\t}\n\t\tcnt = 0;\n\t\tfor (int row = 0; row < 5000; ++row) {\n\t\t\tfor (int col = 1; col < 6; ++col) {\n\t\t\t\tif (MapData[row][col] == 1) {\n\t\t\t\t\t++cnt;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<cnt<<endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3188,
"score_of_the_acc": -0.6146,
"final_rank": 5
},
{
"submission_id": "aoj_0178_3896853",
"code_snippet": "#include<iostream>\nusing namespace std;\nint A[5000][5];\nint x[5],y[5];\nmain()\n{\n\tint N;\n\twhile(cin>>N,N)\n\t{\n\t\tfor(int i=0;i<5000;i++)for(int j=0;j<5;j++)A[i][j]=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint d,p,q;cin>>d>>p>>q;\n\t\t\tif(d==1)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<p;j++)\n\t\t\t\t{\n\t\t\t\t\tx[j]=4999;\n\t\t\t\t\ty[j]=q+j-1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor(int j=0;j<p;j++)\n\t\t\t\t{\n\t\t\t\t\tx[j]=4999-j;\n\t\t\t\t\ty[j]=q-1;\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(true)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<p;j++)x[j]--;\n\t\t\t\tbool flag=false;\n\t\t\t\tfor(int j=0;j<p;j++)\n\t\t\t\t{\n\t\t\t\t\tif(x[j]<0||A[x[j]][y[j]])flag=true;\n\t\t\t\t}\n\t\t\t\tif(flag)break;\n\t\t\t}\n\t\t\tfor(int j=0;j<p;j++)A[++x[j]][y[j]]=1;\n\t\t\tfor(int j=0;j<p;j++)\n\t\t\t{\n\t\t\t\tint X=x[j];\n\t\t\t\tbool flag=true;\n\t\t\t\tfor(int k=0;k<5;k++)flag&=A[X][k];\n\t\t\t\tif(flag)\n\t\t\t\t{\n\t\t\t\t\tfor(int k=X+1;k<5000;k++)for(int l=0;l<5;l++)A[k-1][l]=A[k][l];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans=0;\n\t\tfor(int i=0;i<5000;i++)for(int j=0;j<5;j++)ans+=A[i][j];\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3176,
"score_of_the_acc": -1.0024,
"final_rank": 13
},
{
"submission_id": "aoj_0178_3847658",
"code_snippet": "#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint di[2] = {0, 1};\nint dj[2] = {1, 0};\nint mat[5010][5];\n\nint main(){\n int n;\n while(cin >> n, n){\n memset(mat, 0, sizeof(mat));\n int ma = 1;\n for(int i = 0; i < n; i++){\n int d, p, q;\n cin >> d >> p >> q;\n d--, q--;\n int put;\n for(put = 5000; put >= 0; put--){\n bool ok = true;\n for(int j = 0; j < p; j++){\n ok &= mat[put+j*di[d]][q+j*dj[d]] == 0;\n }\n if(!ok) break;\n }\n int h = put+1;\n for(int j = 0; j < p; j++){\n mat[h+j*di[d]][q+j*dj[d]] = 1;\n }\n int acc = 0;\n for(int hh = h; hh < 5000; hh++){\n int sum = 0;\n for(int j = 0; j < 5; j++) sum += mat[hh][j];\n if(sum == 5){\n for(int j = 0; j < 5; j++) mat[hh][j] = 0;\n acc++;\n }else{\n for(int j = 0; j < 5; j++) mat[hh-acc][j] = mat[hh][j];\n }\n }\n }\n int ans = 0;\n for(int i = 0; i < 5000; i++){\n for(int j = 0; j < 5; j++){\n ans += mat[i][j];\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3164,
"score_of_the_acc": -1.3902,
"final_rank": 20
},
{
"submission_id": "aoj_0178_3709173",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n\nusing namespace std;\n\nint n;\nint h[7];\nbool m[6010][7];\nint b[1010][5];\n\nint main()\n{\n while (true)\n {\n cin >> n;\n if (n == 0)\n break;\n for (int i = 0; i < 5500; i++)\n {\n for (int j = 0; j < 7; j++)\n m[i][j] = false;\n }\n for (int i = 0; i <= 6; i++)\n {\n h[i] = 0;\n }\n int ans = 0;\n for (int i = 0; i < n; i++)\n {\n for (int j = 0; j < 3; j++)\n {\n cin >> b[i][j];\n if (j == 1)\n {\n ans += b[i][j];\n }\n }\n }\n for(int i = 0;i < n;i++){\n if(b[i][0] == 1){\n int hmax = h[b[i][2]];\n for(int j = 0;j < b[i][1];j++){\n hmax = max(hmax,h[b[i][2]+j]);\n }\n hmax++;\n for(int j = 0;j < b[i][1];j++){\n h[b[i][2]+j] = hmax;\n m[hmax][b[i][2]+j] = true;\n }\n }else{\n int hmax = h[b[i][2]];\n for(int j = 1;j <= b[i][1];j++){\n m[hmax+j][b[i][2]] = true;\n }\n h[b[i][2]] = hmax + b[i][1];\n }\n int hmax = h[1];\n for(int j = 1;j <= 5;j++) hmax = max(hmax,h[j]);\n set<int> s;\n for(int j = 1;j <= hmax;j++){\n int count = 0;\n for(int k = 1;k <= 5;k++)if(m[j][k] == true)count++;\n if(count == 5){\n ans -= 5;\n s.insert(j);\n }\n }\n int nj = 1;\n for(int j = 1;j <= hmax;j++){\n if( s.find(j) != s.end() )continue;\n for(int k = 1;k <= 5;k++){\n m[nj][k] = m[j][k];\n }\n nj++;\n }\n for(int j = nj;j < 5050;j++){\n for(int k = 1;k <= 5;k++)m[j][k] = false;\n }\n for(int j = 1;j <= 5;j++){\n h[j] = 0;\n for(int k = hmax;k >= 0;k--){\n if(m[k][j] == true){\n h[j] = k;\n break;\n }\n }\n }\n }\n int hmax = h[1];\n for(int j = 1;j <= 5;j++) hmax = max(hmax,h[j]);\n for(int j = hmax;j >= 1;j--){\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3160,
"score_of_the_acc": -0.7862,
"final_rank": 6
},
{
"submission_id": "aoj_0178_3709161",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n\nusing namespace std;\n\nint n;\nint h[7];\nbool m[6010][7];\nint b[1010][5];\n\nint main()\n{\n while (true)\n {\n cin >> n;\n if (n == 0)\n break;\n for (int i = 0; i < 5500; i++)\n {\n for (int j = 0; j < 7; j++)\n m[i][j] = false;\n }\n for (int i = 0; i <= 6; i++)\n {\n h[i] = 0;\n }\n int ans = 0;\n for (int i = 0; i < n; i++)\n {\n for (int j = 0; j < 3; j++)\n {\n cin >> b[i][j];\n if (j == 1)\n {\n ans += b[i][j];\n }\n }\n }\n for(int i = 0;i < n;i++){\n if(b[i][0] == 1){\n int hmax = h[b[i][2]];\n for(int j = 0;j < b[i][1];j++){\n hmax = max(hmax,h[b[i][2]+j]);\n }\n hmax++;\n for(int j = 0;j < b[i][1];j++){\n h[b[i][2]+j] = hmax;\n m[hmax][b[i][2]+j] = true;\n }\n }else{\n int hmax = h[b[i][2]];\n for(int j = 1;j <= b[i][1];j++){\n m[hmax+j][b[i][2]] = true;\n }\n h[b[i][2]] = hmax + b[i][1];\n }\n int hmax = h[1];\n for(int j = 1;j <= 5;j++) hmax = max(hmax,h[j]);\n set<int> s;\n for(int j = 1;j <= hmax;j++){\n int count = 0;\n for(int k = 1;k <= 5;k++)if(m[j][k] == true)count++;\n if(count == 5){\n ans -= 5;\n s.insert(j);\n }\n }\n int nj = 1;\n for(int j = 1;j <= hmax;j++){\n if( s.find(j) != s.end() )continue;\n for(int k = 1;k <= 5;k++){\n m[nj][k] = m[j][k];\n }\n nj++;\n }\n for(int j = nj;j < 5050;j++){\n for(int k = 1;k <= 5;k++)m[j][k] = false;\n }\n for(int j = 1;j <= 5;j++){\n h[j] = 0;\n for(int k = hmax;k >= 0;k--){\n if(m[k][j] == true){\n h[j] = k;\n break;\n }\n }\n }\n }\n int hmax = h[1];\n for(int j = 1;j <= 5;j++) hmax = max(hmax,h[j]);\n for(int j = hmax;j >= 1;j--){\n }\n\n \n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3164,
"score_of_the_acc": -0.7902,
"final_rank": 8
},
{
"submission_id": "aoj_0178_3708850",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n\nusing namespace std;\n\nint n;\nint h[7];\nbool m[6010][7];\nint b[1010][5];\n\nint main()\n{\n while (true)\n {\n cin >> n;\n if (n == 0)\n break;\n for (int i = 0; i < 5500; i++)\n {\n for (int j = 0; j < 7; j++)\n m[i][j] = false;\n }\n for (int i = 0; i <= 6; i++)\n {\n h[i] = 0;\n }\n int ans = 0;\n for (int i = 0; i < n; i++)\n {\n for (int j = 0; j < 3; j++)\n {\n cin >> b[i][j];\n if (j == 1)\n {\n ans += b[i][j];\n }\n }\n }\n for(int i = 0;i < n;i++){\n if(b[i][0] == 1){\n int hmax = h[b[i][2]];\n for(int j = 0;j < b[i][1];j++){\n hmax = max(hmax,h[b[i][2]+j]);\n }\n hmax++;\n for(int j = 0;j < b[i][1];j++){\n h[b[i][2]+j] = hmax;\n m[hmax][b[i][2]+j] = true;\n }\n }else{\n int hmax = h[b[i][2]];\n for(int j = 1;j <= b[i][1];j++){\n m[hmax+j][b[i][2]] = true;\n }\n h[b[i][2]] = hmax + b[i][1];\n }\n int hmax = h[1];\n for(int j = 1;j <= 5;j++) hmax = max(hmax,h[j]);\n set<int> s;\n for(int j = 1;j <= hmax;j++){\n int count = 0;\n for(int k = 1;k <= 5;k++)if(m[j][k] == true)count++;\n if(count == 5){\n ans -= 5;\n s.insert(j);\n }\n }\n int nj = 1;\n for(int j = 1;j <= hmax;j++){\n if( s.find(j) != s.end() )continue;\n for(int k = 1;k <= 5;k++){\n m[nj][k] = m[j][k];\n }\n nj++;\n }\n for(int j = nj;j < 5050;j++){\n for(int k = 1;k <= 5;k++)m[j][k] = false;\n }\n for(int j = 1;j <= 5;j++){\n h[j] = 0;\n for(int k = hmax;k >= 0;k--){\n if(m[k][j] == true){\n h[j] = k;\n break;\n }\n }\n }\n for(int j = hmax;j >= 1;j--){\n for(int k = 1;k <= 5;k++){\n // cout << m[j][k];\n }\n // cout << endl;\n }\n for(int j = 1;j <= 5;j++){\n // cout << h[j];\n }\n // cout << endl << \"*******\" << endl;\n }\n int hmax = h[1];\n for(int j = 1;j <= 5;j++) hmax = max(hmax,h[j]);\n for(int j = hmax;j >= 1;j--){\n // for(int k = 1;k <= 5;k++)cout << m[j][k];\n // cout << endl;\n }\n /* \n int hmax = 0;\n for(int i = 1;i <= 5;i++)hmax = max(hmax,h[i]);\n for(int i = 1;i <= hmax;i++){\n int count = 0;\n for(int j = 1;j <= 5;j++){\n // if(m[hmax-i+1][j] == true)cout << 1 ;\n // else cout << 0;\n if(m[i][j] == true)count++;\n }\n // cout << endl;\n if(count == 5){\n ans -= 5;\n }\n }\n */\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3160,
"score_of_the_acc": -0.7862,
"final_rank": 6
},
{
"submission_id": "aoj_0178_3707762",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <utility>\n#include <tuple>\n#include <math.h>\n#include <iomanip>\n\nusing namespace std;\n\nclass Sover {\n};\n\nint main()\n{\n\twhile (true) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0)break;\n\n\t\tint length = n * 5 + 10;\n\t\tvector<vector<bool>> grid(length, vector<bool>(5, false));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint d, p, q;\n\t\t\tcin >> d >> p >> q;\n\t\t\tq--;\n\t\t\tint bottom = length - 1;\n\t\t\tif (d == 1) {\n\t\t\t\tfor (; bottom >= 0; bottom--) {\n\t\t\t\t\tbool interrupt = false;\n\t\t\t\t\tfor (int j = 0; j < p; j++) {\n\t\t\t\t\t\tif (grid[bottom][q+j])interrupt = true;\n\t\t\t\t\t}\n\t\t\t\t\tif (interrupt)break;\n\t\t\t\t}\n\n\t\t\t\tfor (int j = 0; j < p; j++)grid[bottom + 1][q + j] = true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\twhile (bottom >= 0 && !grid[bottom][q])bottom--;\n\n\t\t\t\tfor (int j = 0; j < p; j++)grid[bottom + 1 + j][q] = true;\n\t\t\t}\n\n\t\t\tint shift_cnt = 0;\n\t\t\tfor (int j = bottom + 1; j < length; j++) {\n\t\t\t\tbool full = true;\n\t\t\t\tfor (int k = 0; k < 5; k++) {\n\t\t\t\t\tif (!grid[j][k]) {\n\t\t\t\t\t\tfull = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (full) {\n\t\t\t\t\tshift_cnt++;\n\t\t\t\t\tfor (int k = 0; k < 5; k++) {\n\t\t\t\t\t\tgrid[j][k] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tfor (int k = 0; k < 5; k++) {\n\t\t\t\t\t\tgrid[j - shift_cnt][k] = grid[j][k];\n\t\t\t\t\t\tif (shift_cnt > 0)grid[j][k] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint res = 0;\n\t\tfor (int i = 0; i < length; i++) {\n\t\t\tfor (int j = 0; j < 5; j++)if (grid[i][j])res++;\n\t\t}\n\t\tcout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3136,
"score_of_the_acc": -1.3618,
"final_rank": 19
},
{
"submission_id": "aoj_0178_3704467",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\n#define int long long int\nconst int INF = 1001001001001001LL;\nconst int MOD = 1000000007;\n\nint di[] = {-1, 0, 1, 0, -1, 1, 1, -1};\nint dj[] = {0, 1, 0, -1, 1, 1, -1, -1};\n \nint g[5100][5];\n\nsigned main(){\n \n while(1){\n memset(g, 0, sizeof(g));\n int n; cin >> n;\n if(!n) break;\n int sum = 0;\n for(int j = 0; j < 5; j++){\n g[0][j] = 1;\n }\n\n\n for(int i = 0; i < n; i++){\n\n int a, p, q; cin >> a >> p >> q;\n swap(p, q);\n p--;\n sum += q;\n if(a == 1){\n\n\n // 落とす\n int y;\n for(int i = 5000; i >= 1; i--){\n bool flag = false;\n for(int j = p; j < p + q; j++){\n if(g[i - 1][j] == 1){\n flag = true;\n y = i; \n break;\n }\n }\n if(flag) break;\n }\n\n for(int j = p; j < p + q; j++){\n g[y][j] = 1;\n }\n\n // 消えるかどうか\n bool erase = true;\n for(int j = 0; j < 5; j++){\n if(!g[y][j]) erase = false;\n }\n\n if(erase){\n sum -= 5;\n for(int i = y + 1; i <= 5000; i++){\n for(int j = 0; j < 5; j++){\n g[i - 1][j] = g[i][j];\n g[i][j] = 0;\n }\n }\n }\n\n }else{\n \n\n // 落とす\n int y = 0;\n for(int i = 5000; i >= 0; i--){\n if(g[i - q][p]){\n y = i;\n break;\n }\n }\n\n for(int i = y - q + 1; i <= y; i++) g[i][p] = 1;\n\n // 消えるかどうか\n y = y - q + 1;\n for(int itr = 0; itr < 5; itr++){\n bool erase = true;\n for(int j = 0; j < 5; j++){\n if(!g[y][j]) erase = false;\n }\n\n if(erase){\n sum -= 5;\n for(int i = y + 1; i <= 5000; i++){\n for(int j = 0; j < 5; j++){\n g[i - 1][j] = g[i][j];\n g[i][j] = 0;\n }\n }\n }else{\n y++;\n }\n }\n }\n\n /*\n // デバック\n for(int i = 10; i >= 0; i--){\n for(int j = 0; j < 5; j++){\n cout << g[i][j] << \" \";\n }\n cout << endl;\n }\n */\n }\n\n\n cout << sum << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3232,
"score_of_the_acc": -0.4593,
"final_rank": 3
},
{
"submission_id": "aoj_0178_3704346",
"code_snippet": "#include <cstdio>\n#include <cstdint>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <utility>\n#include <tuple>\n\nint const yoko = 1;\nint const tate = 2;\n\nvoid tetris(std::vector<std::vector<int>>& z) {\n size_t m = z[0].size();\n std::vector<std::vector<int>> y(5, std::vector<int>(m));\n\n size_t i = 0;\n for (size_t j = 0; j < m; ++j) {\n int cur = 0;\n for (size_t k = 0; k < 5; ++k) cur += z[k][j];\n if (cur == 5) continue;\n for (size_t k = 0; k < 5; ++k) y[k][i] = z[k][j];\n ++i;\n }\n z = std::move(y);\n}\n\nint testcase_ends() {\n size_t n;\n scanf(\"%zu\", &n);\n if (n == 0) return 1;\n\n size_t m = 5*n+10;\n std::vector<std::vector<int>> z(5, std::vector<int>(m));\n for (size_t i = 0; i < n; ++i) {\n size_t d, p, q;\n scanf(\"%zu %zu %zu\", &d, &p, &q);\n --q;\n\n size_t l = q;\n size_t r = q;\n if (d == yoko) r += p-1;\n\n size_t h = 0;\n for (size_t j = l; j <= r; ++j) {\n for (size_t k = m; k--;) {\n if (z[j][k]) {\n h = std::max(h, k+1);\n break;\n }\n }\n }\n\n if (d == yoko) {\n for (size_t i = l; i <= r; ++i) ++z[i][h];\n } else if (d == tate) {\n for (size_t i = 0; i < p; ++i) ++z[q][h+i];\n }\n\n tetris(z);\n }\n int res = 0;\n for (auto const& zi: z)\n res += std::accumulate(zi.begin(), zi.end(), 0);\n\n printf(\"%d\\n\", res);\n return 0;\n}\n\nint main() {\n while (!testcase_ends()) {}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 2780,
"score_of_the_acc": -1,
"final_rank": 11
},
{
"submission_id": "aoj_0178_2382023",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,j) REP((i), 0, (j))\n#define REP(i,j,k) for(int i=(j);(i)<(k);++i)\n#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))\n#define F first\n#define S second\n#define INF 1 << 30\n#define UNDER 10000\n\ntypedef pair<int, int> pi;\ntypedef pair<int, pi> pii;\ntypedef vector<int> vi;\ntypedef queue<int> qi;\ntypedef long long ll;\n\nint t[UNDER + 10][5], n;\n\nint count() {\n\tint res = 0;\n\trep(i, UNDER)\n\t\trep(j, 5)\n\t\t\tif (t[i][j] == 1)\n\t\t\t\tres++;\n\treturn res;\n}\n\nvoid deleteblock() {\n\tfor (int y = UNDER - 1; y >= 0; y--) {\n\t\tint f = 0;\n\t\trep(i, 5)\n\t\t\tif (t[y][i] == 0) {\n\t\t\t\tf = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tif (f)\n\t\t\tcontinue;\n\t\trep(i, 5)\n\t\t{\n\t\t\tfor (int c = y; c > 0; c--) {\n\t\t\t\tt[c][i] = t[c - 1][i];\n\t\t\t}\n\t\t}\n\t\tt[0][0] = t[0][1] = t[0][2] = t[0][3] = t[0][4] = 0;\n\t\ty++;\n\t}\n\treturn;\n}\n\nint main() {\n\twhile (scanf(\"%d\", &n) && n) {\n\t\tint d, p, q;\n\t\tmemset(t, 0, sizeof(t));\n\t\trep(i, 5)\n\t\t\tt[UNDER][i] = 1;\n\n\t\trep(i, n)\n\t\t{\n\t\t\tscanf(\"%d%d%d\", &d, &p, &q);\n\t\t\tq--;\n\t\t\tif (d == 1) {\n\t\t\t\tREP(y, 1, UNDER+1)\n\t\t\t\t{\n\t\t\t\t\tint f = 0;\n\t\t\t\t\tREP(x, q, q+p)\n\t\t\t\t\t\tif (t[y][x] == 1)\n\t\t\t\t\t\t\tf = 1;\n\t\t\t\t\tif (!f)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tREP(x, q, q+p)\n\t\t\t\t\t\tt[y - 1][x] = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\trep(y, UNDER+1)\n\t\t\t\t{\n\t\t\t\t\tif (!t[y][q])\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (int c = y - 1; c > y - p - 1; c--)\n\t\t\t\t\t\tt[c][q] = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdeleteblock();\n\t\t\t/* REP(i, 990, UNDER+1){\n\t\t\t rep(j, 5) printf(\"%d \", t[i][j]); puts(\"\");\n\t\t\t }*/\n\t\t}\n\n\t\tprintf(\"%d\\n\", count());\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3380,
"score_of_the_acc": -1.2098,
"final_rank": 15
},
{
"submission_id": "aoj_0178_2135675",
"code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n#ifdef _WIN32\n#define __builtin_popcount __popcnt\n#endif\nint n, d, p, q;\nint main() {\n\twhile (cin >> n, n) {\n\t\tvector<int> bit;\n\t\tvector<int> c(5);\n\t\twhile (n--) {\n\t\t\tcin >> d >> p >> q; q--;\n\t\t\tif (d == 1) {\n\t\t\t\tint r = *max_element(c.begin() + q, c.begin() + q + p);\n\t\t\t\tint b = (1 << (q + p)) - (1 << q);\n\t\t\t\tif (bit.size() == r) bit.push_back(b);\n\t\t\t\telse bit[r] |= b;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfor (int i = c[q]; i < c[q] + p; i++) {\n\t\t\t\t\tif (bit.size() == i) bit.push_back(1 << q);\n\t\t\t\t\telse bit[i] |= 1 << q;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvector<int> bit2;\n\t\t\tfor (int i : bit) {\n\t\t\t\tif (i != 31) bit2.push_back(i);\n\t\t\t}\n\t\t\tbit = bit2;\n\t\t\tfor (int i = 0; i < 5; i++) {\n\t\t\t\tc[i] = 0;\n\t\t\t\tfor (int j = bit2.size() - 1; j >= 0; j--) {\n\t\t\t\t\tif (bit2[j] & (1 << i)) {\n\t\t\t\t\t\tc[i] = j + 1; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ret = 0;\n\t\tfor (int i : bit) ret += __builtin_popcount(i);\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3112,
"score_of_the_acc": -0.3374,
"final_rank": 1
},
{
"submission_id": "aoj_0178_2065924",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint fall(vector<vector<int>>&fi, vector<vector<int>>&pi,int fall_l) {\n\tint fall_u = 0;\n\tfor (; fall_u < fi.size() - pi.size(); ++fall_u) {\n\t\tbool ok = true;\n\t\tfor (int i = 0; i < pi.size(); ++i) {\n\t\t\tfor (int j = 0; j < pi[i].size(); ++j) {\n\t\t\t\tif (pi[i][j]) {\n\t\t\t\t\tif (fi[fall_u + i+1][fall_l + j])ok = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ok) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < pi.size(); ++i) {\n\t\tfor (int j = 0; j < pi[i].size(); ++j) {\n\t\t\tif (pi[i][j]) {\n\t\t\t\tfi[fall_u + i][fall_l + j] = true;\n\t\t\t}\n\t\t}\n\t}\n\tint delline = 0;\n\tfor (int i = fall_u + pi.size() - 1; i >= fall_u; --i) {\n\t\twhile (all_of(fi[i].begin(), fi[i].end(), [](const int a) {return a == 1; })) {\n\t\t\ttransform(fi[i].begin(), fi[i].end(), fi[i].begin(), [](const int a) {return false; });\n\t\t\trotate(fi.begin(), fi.begin() + i, fi.begin() + i+1); \n\t\t\tdelline += 1;\n\t\t}\n\t}\n\treturn delline;\n}\n\nint main() {\n\tint N;\n\twhile (cin>>N,N) {\n\t\tint sum = 0;\n\t\tvector<vector<int>>field(5*N, vector<int>(5));\n\t\twhile(N--){\n\t\t\tint d, p, q; cin >> d >> p >> q; q--;\n\t\t\tsum += p;\n\t\t\tvector<vector<int>>pino(d == 1 ? 1 : p, vector<int>(d == 2 ? 1 : p, 1));\n\t\t\tsum -= fall(field, pino, q) * 5;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3208,
"score_of_the_acc": -1.235,
"final_rank": 17
},
{
"submission_id": "aoj_0178_2065923",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint fall(vector<vector<int>>&field, vector<vector<int>>&pino,int l) {\n\tint y = 0;\n\tfor ( y = 0; y < field.size() - pino.size(); ++y) {\n\t\tbool ok = true;\n\t\tfor (int i = 0; i < pino.size(); ++i) {\n\t\t\tfor (int j = 0; j < pino[i].size(); ++j) {\n\t\t\t\tif (pino[i][j]) {\n\t\t\t\t\tif (field[y + i+1][l + j])ok = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ok) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < pino.size(); ++i) {\n\t\tfor (int j = 0; j < pino[i].size(); ++j) {\n\t\t\tif (pino[i][j]) {\n\t\t\t\tassert(!field[y + i][l + j]);\n\t\t\t\tfield[y + i][l + j] = true;\n\t\t\t}\n\t\t}\n\t}\n\tint delline = 0;\n\tfor (int i = y + pino.size() - 1; i >= y; --i) {\n\t\twhile (all_of(field[i].begin(), field[i].end(), [](const int a) {return a == 1; })) {\n\t\t\ttransform(field[i].begin(), field[i].end(), field[i].begin(), [](const int a) {return false; });\n\t\t\tfor (int j = i- 1; j >= 0; --j) {\n\t\t\t\tswap(field[j], field[j + 1]);\n\t\t\t}\n\t\t\tdelline += 1;\n\t\t}\n\t}\n\treturn delline;\n}\n\nint main() {\n\tint N;\n\twhile (cin>>N,N) {\n\t\tint sum = 0;\n\t\tvector<vector<int>>field(5*N, vector<int>(5));\n\t\twhile(N--){\n\t\t\tint d, p, q; cin >> d >> p >> q; q--;\n\t\t\tsum += p;\n\t\t\tvector<vector<int>>pino(d == 1 ? 1 : p, vector<int>(d == 2 ? 1 : p, 1));\n\t\t\tsum -= fall(field, pino, q) * 5;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3192,
"score_of_the_acc": -1.2187,
"final_rank": 16
},
{
"submission_id": "aoj_0178_2065922",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint fall(vector<vector<int>>&field, vector<vector<int>>&pino,int l) {\n\tint y = 0;\n\tfor ( y = 0; y < field.size() - pino.size(); ++y) {\n\t\tbool ok = true;\n\t\tfor (int i = 0; i < pino.size(); ++i) {\n\t\t\tfor (int j = 0; j < pino[i].size(); ++j) {\n\t\t\t\tif (pino[i][j]) {\n\t\t\t\t\tif (field[y + i+1][l + j])ok = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ok) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < pino.size(); ++i) {\n\t\tfor (int j = 0; j < pino[i].size(); ++j) {\n\t\t\tif (pino[i][j]) {\n\t\t\t\tassert(!field[y + i][l + j]);\n\t\t\t\tfield[y + i][l + j] = true;\n\t\t\t}\n\t\t}\n\t}\n\tint delline = 0;\n\tfor (int i = y + pino.size() - 1; i >= y; --i) {\n\t\twhile (all_of(field[i].begin(), field[i].end(), [](const int a) {return a == 1; })) {\n\t\t\ttransform(field[i].begin(), field[i].end(), field[i].begin(), [](const int a) {return false; });\n\t\t\tfor (int j = i- 1; j >= 0; --j) {\n\t\t\t\tswap(field[j], field[j + 1]);\n\t\t\t}\n\t\t\tdelline += 1;\n\t\t}\n\t}\n\treturn delline;\n}\n\nint main() {\n\tint N;\n\twhile (cin>>N,N) {\n\t\tint sum = 0;\n\t\tvector<vector<int>>field(5*N+1, vector<int>(5));\n\t\twhile(N--){\n\t\t\tint d, p, q; cin >> d >> p >> q; q--;\n\t\t\tsum += p;\n\t\t\tvector<vector<int>>pino(d == 1 ? 1 : p, vector<int>(d == 2 ? 1 : p, 1));\n\t\t\tsum -= fall(field, pino, q) * 5;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3136,
"score_of_the_acc": -1.1618,
"final_rank": 14
},
{
"submission_id": "aoj_0178_2065921",
"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 fall(vector<vector<int>>&field, vector<vector<int>>&pino,int l) {\n\t{\n\n\t}\n\tint y = 0;\n\tfor ( y = 0; y < field.size() - pino.size(); ++y) {\n\t\tbool ok = true;\n\t\tfor (int i = 0; i < pino.size(); ++i) {\n\t\t\tfor (int j = 0; j < pino[i].size(); ++j) {\n\t\t\t\tif (pino[i][j]) {\n\t\t\t\t\tif (field[y + i+1][l + j])ok = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ok) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < pino.size(); ++i) {\n\t\tfor (int j = 0; j < pino[i].size(); ++j) {\n\t\t\tif (pino[i][j]) {\n\t\t\t\tassert(!field[y + i][l + j]);\n\t\t\t\tfield[y + i][l + j] = true;\n\t\t\t}\n\t\t}\n\t}\n\tint delline = 0;\n\tfor (int i = y + pino.size() - 1; i >= y; --i) {\n\t\twhile (all_of(field[i].begin(), field[i].end(), [](const int a) {return a == 1; })) {\n\t\t\ttransform(field[i].begin(), field[i].end(), field[i].begin(), [](const int a) {return false; });\n\t\t\tfor (int j = i- 1; j >= 0; --j) {\n\t\t\t\tswap(field[j], field[j + 1]);\n\t\t\t}\n\t\t\tdelline += 1;\n\t\t}\n\t}\n\treturn delline;\n}\n\nint main() {\n\twhile (1) {\n\t\tint N; cin >> N;\n\t\tif (!N)break;\n\t\tint sum = 0;\n\t\tvector<vector<int>>field(5*N+10, vector<int>(5));\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint d, p, q; cin >> d >> p >> q; q--;\n\t\t\tint w = d == 2 ? 1 : p;\n\t\t\tint h = d == 1 ? 1 : p;\n\t\t\tsum += p;\n\t\t\tvector<vector<int>>pino(h, vector<int>(w, 1));\n\t\t\tsum -= fall(field, pino, q) * 5;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3244,
"score_of_the_acc": -1.2715,
"final_rank": 18
}
] |
aoj_0186_cpp
|
会津地鶏
2008 年 4 月に、会津若松市は長さ20 m 85 cm のやきとり作りに挑戦して成功しました。このとき使われた鶏肉が、会津特産の会津地鶏です。会津地鶏はとてもおいしいのですが、飼育がむずかしいので生産量が少なく、値段が高いのが難点です。
今日は一郎君の家に、遠くから親戚が遊びに来ます。お母さんは鶏肉の水炊きを作って親戚をもてなすことにしました。近くのお肉屋さんでは会津地鶏とふつうの鶏肉の 2 種類の鶏肉を売っています。お母さんは、以下のような指示を一郎君に与えて、お肉屋さんに行って鶏肉を買ってくるように
頼みました。
鶏肉が足りなくなると困るので、決められた量以上の鶏肉を買う。
予算の許す範囲で会津地鶏をできるだけ多く買う(会津地鶏は必ず買うこと)。
会津地鶏を買った残りでふつうの鶏肉をできるだけ多く買う(予算が足りなければ買わない)。
一郎君がお肉屋さんに行くと、会津地鶏が品薄のため一人が買える量を制限していました。一郎君が、お母さんから与えられたすべての指示を守って買い物をするとき、一郎君が買う会津地鶏と普通の鶏肉の量はそれぞれ何グラムになるでしょう?
買うべき鶏肉の量の下限
q
1
、予算
b
、このお肉屋さんでの会津地鶏 100 グラムの値段
c
1
、ふつうの鶏肉 100 グラムの値段
c
2
、会津地鶏を一人が買える量の上限
q
2
を入力とし、一郎君が買う会津地鶏とふつうの鶏肉の量を 100 グラム単位で出力するプログラムを作成してください。ただし、このお肉屋さんではお母さんの指示通りに買えない場合には、「NA」と出力してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。 各データセットは以下の形式で与えられます。
q
1
b
c
1
c
2
q
2
鶏肉の量を表すデータ
q
1
と
q
2
は100 グラム単位で指定されます。また、
b
、
c
1
、
c
2
、
q
1
、
q
2
は 1 以上 1,000,000 以下の整数とします。
データセットの数は 50 を超えません。
Output
データセット毎に、一郎君が購入する会津地鶏の量とふつうの鶏肉の量(半角空白区切り) または「NA」を１行に出力します。
Sample Input
48 9297 240 126 32
20 3010 157 141 7
30 117002 5680 962 15
8 1673 1712 190 22
64 8478 87 54 307
23 5477 117 92 12
50 7558 1396 187 17
279 88677 4522 514 14
0
Output for the Sample Input
28 20
7 13
15 33
NA
97 0
12 44
NA
NA
|
[
{
"submission_id": "aoj_0186_3878046",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint q1, b, c1, c2, q2, x, y;\n\n\tcin >> q1;\n\n\twhile (q1) {\n\t\tcin >> b >> c1 >> c2 >> q2;\n\n\t\tx = q2;\n\n\t\twhile (c1 * x + c2 * (q1 - x) > b || c1 * x > b)\n\t\t\tx--;\n\n\t\tif (x <= 0)\n\t\t\tcout << \"NA\" << endl;\n\t\telse {\n\t\t\ty = q1 - x;\n\n\t\t\twhile (c1 * x + c2 * y < b)\n\t\t\t\ty++;\n\n\t\t\tif (c1 * x + c2 * y > b)\n\t\t\t\ty--;\n\n\t\t\tcout << x << \" \" << y << endl;\n\t\t}\n\n\t\tcin >> q1;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 3088,
"score_of_the_acc": -2,
"final_rank": 5
},
{
"submission_id": "aoj_0186_1320800",
"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 INF = 1e9 + 7;\n\nint q1, b, q2;\ndouble c1, c2;\n\nint check(int x){\n if(x < 0 || x > q2) return -1;\n double p = (x / 100) * c1;\n if(p > b) return -1;\n int y = (b - p) / c2;\n y *= 100;\n if(x + y < q1) return -1;\n return y;\n}\n \nint main() {\n while(cin >>q1 && q1){\n cin >>b >>c1 >>c2 >>q2;\n q1 *= 100; q2 *= 100;\n int x = -1, y = -1, tmp;\n for(int i = 10000000; i >= 100; i -= 100) if((tmp = check(i)) != -1) { x = i; y = tmp; break; }\n if(x == -1) cout <<\"NA\" <<endl;\n else cout <<x / 100 <<\" \" <<y / 100 <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": -0.1576,
"final_rank": 2
},
{
"submission_id": "aoj_0186_917875",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int q1,b,c1,c2,q2;\n for(;cin>>q1,q1;)\n {\n cin>>b>>c1>>c2>>q2;\n int ans1=-1,ans2;\n for(int i=1;i<=q2;i++)\n\t{\n\t int money=b;\n\t money-=i*c1;\n\t if((money/c2)+i>=q1 && money>=0)\n\t {\n\t ans1=i;\n\t ans2=money/c2;\n\t }\n\t}\n if(ans1==-1)\n\tcout<<\"NA\"<<endl;\n else\n\tcout<<ans1<<\" \"<<ans2<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.1268,
"final_rank": 1
},
{
"submission_id": "aoj_0186_367867",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 10000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\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\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,string> P;\n\nstatic const double eps = 1e-8;\n\nint main(){\n\tint q1;\n\twhile(~scanf(\"%d\",&q1)){\n\t\tif(q1==0) break;\n\t\tint b,c1,c2,q2;\n\t\t//1:aize chiken 2:normal chiken\n\t\tscanf(\"%d %d %d %d\",&b,&c1,&c2,&q2);\n\t\tfor(int i=q2;i>=1;i--){\n\t\t\tint cost = i*c1;\n\n\t\t\tint ub = 1000000;\n\t\t\tint lb = 0;\n\n\t\t\tfor(int j=0;j<20;j++){\n\t\t\t\tint md = (ub+lb)/2;\n\t\t\t\tif(cost + md*c2 <=b) lb = md;\n\t\t\t\telse ub = md;\n\t\t\t}\n\n\t\t\tif(lb+i >= q1 && cost + lb*c2 <=b){\n\t\t\t\tprintf(\"%d %d\\n\",i,lb);\n\t\t\t\tgoto next;\n\t\t\t}\n\t\t}\n\t\tprintf(\"NA\\n\");\nnext:;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 880,
"score_of_the_acc": -0.2857,
"final_rank": 3
},
{
"submission_id": "aoj_0186_367866",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 10000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\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\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,string> P;\n\nstatic const double eps = 1e-8;\n\nint main(){\n\tint q1;\n\twhile(~scanf(\"%d\",&q1)){\n\t\tif(q1==0) break;\n\t\tint b,c1,c2,q2;\n\t\t//1:aize chiken 2:normal chiken\n\t\tscanf(\"%d %d %d %d\",&b,&c1,&c2,&q2);\n\t\tfor(int i=q2;i>=1;i--){\n\t\t\tint cost = i*c1;\n\n\t\t\tint ub = 1000000;\n\t\t\tint lb = 0;\n\n\t\t\tfor(int j=0;j<50;j++){\n\t\t\t\tint md = (ub+lb)/2;\n\t\t\t\tif(cost + md*c2 <=b) lb = md;\n\t\t\t\telse ub = md;\n\t\t\t}\n\n\t\t\tif(lb+i >= q1 && cost + lb*c2 <=b){\n\t\t\t\tprintf(\"%d %d\\n\",i,lb);\n\t\t\t\tgoto next;\n\t\t\t}\n\t\t}\n\t\tprintf(\"NA\\n\");\nnext:;\n\t}\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 880,
"score_of_the_acc": -0.8571,
"final_rank": 4
}
] |
aoj_0181_cpp
|
本棚
太郎君はとある小説にはまっています。その小説は全部で
n
巻あり、各巻で本の厚さが異なります。太郎君はこの小説が大変気に入ったので、その小説専用の本棚を買おうと思っています。しかし、部屋に大きな本棚を置くとかなり狭くなってしまうので、出来るだけ本棚の幅が小さくなるように工夫しなければなりません。床から天井の高さを測ったところ、どうやら
m
段の本棚なら置けることが分かりました。そこで、小説
n
巻をどのように分ければ
m
段の本棚の幅を最小に出来るでしょうか?
太郎君にはこだわりがあり、各段に納める小説は巻の番号順に並んでいなければなりません。
本棚の段数、小説の巻数、各本の厚さを入力として、全巻を 1巻から順に収めることができる本棚の中で幅が最小となるものの幅を求めるプログラムを作成してください。ただし、本棚の枠の大きさは幅に含めないこととします。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
m
n
w
1
w
2
:
w
n
１行目に部屋に置くことができる本棚の段数
m
(1 ≤
m
≤ 20)、 小説の巻数
n
(1 ≤
n
≤ 100) が与えられます。続く
n
行に第
i
巻の本の厚さを表す整数
w
i
(1 ≤
w
i
≤ 1000000) が与えられます。
ただし、本棚の幅は 1500000 を超えないものとします。
データセットの数は 50 を超えません。
Output
データセット毎に最小となる本棚の幅を１行に出力します。
Sample Input
3 9
500
300
800
200
100
600
900
700
400
4 3
1000
1000
1000
0 0
Output for the Sample Input
1800
1000
|
[
{
"submission_id": "aoj_0181_4381121",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n\nusing namespace std;\n\nint w[100];\nint record[100][100];\n\nint minW,tempW,totalW,leftW;\n\nint EstimateMin(int leftW,int floor)\n{\n\tif (floor == 0)\n\t\treturn -1;\n\treturn leftW / floor;\n}\n\nvoid Backtrace(int beg,int n,int floor)\n{\n\tif (floor == 0)\n\t{\n\t\tif (tempW < minW && beg == n + 1)\n\t\t\tminW = tempW;\n\t\treturn;\n\t}\n\tint temp = tempW;\n\tfor (int i = beg - 1; i <= n; i++)\n\t{\n\t\tif (record[beg][i] >= minW)\n\t\t\tbreak;\n\t\tif (EstimateMin(leftW - record[beg][i], floor - 1) >= minW)\n\t\t\tcontinue;\n\t\ttempW = max(record[beg][i], temp);\n\t\tleftW -= record[beg][i];\n\t\tBacktrace(i + 1, n, floor - 1);\n\t\tleftW += record[beg][i];\n\t\ttempW = temp;\n\t}\n}\n\nint main()\n{\n\tint m, n;\n\tcin >> m >> n;\n\twhile (m || n)\n\t{\n\t\ttotalW = 0;\n\t\tfor (size_t i = 1; i <= n; i++)\n\t\t{\n\t\t\tcin >> w[i];\n\t\t\ttotalW += w[i];\n\t\t}\n\t\tfor (size_t i = 1; i <= n; i++)\n\t\t{\n\t\t\trecord[i][i - 1] = 0;\n\t\t\tint sumw = 0;\n\t\t\tfor (size_t j = i; j <= n; j++)\n\t\t\t{\n\t\t\t\tsumw += w[j];\n\t\t\t\trecord[i][j] = sumw;\n\t\t\t}\n\t\t}\n\t\ttempW = 0;\n\t\tminW = totalW;\n\t\tleftW = totalW;\n\t\tBacktrace(1, n, m);\n\t\tcout << minW << endl;\n\t\tcin >> m >> n;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3112,
"score_of_the_acc": -0.7378,
"final_rank": 7
},
{
"submission_id": "aoj_0181_3214262",
"code_snippet": "// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nint M, N, width[110];\nint dp[110][110][25];\n\nsigned main() {\n while(cin >> M >> N, M) {\n fill(dp[0][0], dp[N][N], INF);\n for(int i=0; i<N; i++) {\n cin >> width[i];\n }\n\n for(int i=0; i<N; i++) {\n int sum = 0;\n for(int j=i; j<N; j++) {\n sum += width[j];\n dp[i][j+1][1] = sum;\n }\n }\n\n for(int d=2; d<=N; d++) {\n for(int l=0; l<N-d+1; l++) {\n int r = l + d;\n int mi = INF;\n for(int m=2; m<=M; m++) {\n chmin(dp[l][r][m], mi);\n for(int k=l+1; k<r; k++) {\n for(int p=1; p<m; p++) {\n int vl = dp[l][k][p ];\n int vr = dp[k][r][m-p];\n chmin(dp[l][r][m], max(vl, vr));\n }\n }\n chmin(mi, dp[l][r][m]);\n }\n }\n }\n cout << dp[0][N][M] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3964,
"score_of_the_acc": -1,
"final_rank": 10
},
{
"submission_id": "aoj_0181_2724073",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main() {\n\tint m, n;\n\twhile (cin >> m >> n, m, n) {\n\t\tint w[110];\n\t\tint f = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> w[i]; f = max(w[i], f);\n\t\t}\n\t\twhile (1) {\n\t\t\tint p = 1, q = f;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (w[i] <= q)q -= w[i];\n\t\t\t\telse {\n\t\t\t\t\tp++;\n\t\t\t\t\tq = f - w[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (p <= m)break;\n\t\t\tf++;\n\t\t}\n\t\tcout << f << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3112,
"score_of_the_acc": -0.9045,
"final_rank": 9
},
{
"submission_id": "aoj_0181_2072952",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n\n#define MAX_SIZE 1500000\n\nusing namespace std;\n\n\nint main(){\n\tint dansu,kansu,shelf[20],book[100],min_size,left,right,m,dansu_index;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&dansu,&kansu);\n\t\tif(dansu == 0 && kansu == 0)break;\n\n\t\tfor(int i = 0; i < kansu; i++){\n\t\t\tscanf(\"%d\",&book[i]);\n\t\t}\n\n\t\tmin_size = MAX_SIZE;\n\t\tleft = 0,right = MAX_SIZE;\n\t\tm = (left+right)/2;\n\t\tint i;\n\n\t\twhile(left < right){\n\n\t\t\tshelf[0] = m;\n\t\t\tdansu_index = 0;\n\t\t\tfor(i = 0; i < kansu && dansu_index < dansu;){\n\t\t\t\tif(book[i] > m)break;\n\t\t\t\tif(shelf[dansu_index] >= book[i]){\n\t\t\t\t\tshelf[dansu_index] -= book[i];\n\t\t\t\t\ti++;\n\t\t\t\t}else{\n\t\t\t\t\tdansu_index++;\n\t\t\t\t\tif(dansu_index < dansu)shelf[dansu_index] = m;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(i < kansu){\n\t\t\t\tleft = m + 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}else{\n\t\t\t\tright = right - 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",left);\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 660,
"memory_kb": 2600,
"score_of_the_acc": -1.4024,
"final_rank": 12
},
{
"submission_id": "aoj_0181_2072949",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n\n#define MAX_SIZE 1500000\n\nusing namespace std;\n\n\nint main(){\n\tint dansu,kansu,shelf[20],book[100],min_size,left,right,m,dansu_index;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&dansu,&kansu);\n\t\tif(dansu == 0 && kansu == 0)break;\n\n\t\tfor(int i = 0; i < kansu; i++){\n\t\t\tscanf(\"%d\",&book[i]);\n\t\t}\n\n\t\tmin_size = MAX_SIZE;\n\t\tleft = 0,right = MAX_SIZE;\n\t\tm = (left+right)/2;\n\n\t\twhile(left < right){\n\n\t\t\tshelf[0] = m;\n\t\t\tdansu_index = 0;\n\t\t\tfor(int i = 0; i < kansu && dansu_index < dansu;){\n\t\t\t\tif(shelf[dansu_index] >= book[i]){\n\t\t\t\t\tshelf[dansu_index] -= book[i];\n\t\t\t\t\ti++;\n\t\t\t\t}else{\n\t\t\t\t\tdansu_index++;\n\t\t\t\t\tif(dansu_index < dansu)shelf[dansu_index] = m;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(dansu_index == dansu){\n\t\t\t\tleft = m + 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}else{\n\t\t\t\tright = right - 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",left);\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 2564,
"score_of_the_acc": -1.3618,
"final_rank": 11
},
{
"submission_id": "aoj_0181_2072918",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n\n#define MAX_SIZE 1500000\n\nusing namespace std;\n\nint main(){\n\tint dansu,kansu,shelf[20],book[100],min_size,left,right,m,dansu_index,max_length;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&dansu,&kansu);\n\t\tif(dansu == 0 && kansu == 0)break;\n\n\t\tmax_length = 0;\n\n\t\tfor(int i = 0; i < kansu; i++){\n\t\t\tscanf(\"%d\",&book[i]);\n\t\t\tmax_length = max(max_length,book[i]);\n\t\t}\n\n\t\tmin_size = MAX_SIZE;\n\t\tleft = max_length,right = MAX_SIZE;\n\t\tm = (left+right)/2;\n\n\t\twhile(left < right){\n\n\t\t\tfor(int i = 0; i < dansu; i++)shelf[i] = m;\n\t\t\tdansu_index = 0;\n\t\t\tfor(int i = 0; i < kansu && dansu_index < dansu;){\n\t\t\t\tif(shelf[dansu_index] >= book[i]){\n\t\t\t\t\tshelf[dansu_index] -= book[i];\n\t\t\t\t\ti++;\n\t\t\t\t}else{\n\t\t\t\t\tdansu_index++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(dansu_index == dansu){\n\t\t\t\tleft = m + 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}else{\n\t\t\t\tright = right - 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",left);\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 710,
"memory_kb": 2688,
"score_of_the_acc": -1.5033,
"final_rank": 15
},
{
"submission_id": "aoj_0181_2072911",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n\n#define MAX_SIZE 1500000\n\nusing namespace std;\n\nint main(){\n\tint dansu,kansu,shelf[20],book[100],min_size,left,right,m,dansu_index,max_length;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&dansu,&kansu);\n\t\tif(dansu == 0 && kansu == 0)break;\n\n\t\tmax_length = 0;\n\n\t\tfor(int i = 0; i < kansu; i++){\n\t\t\tscanf(\"%d\",&book[i]);\n\t\t\tmax_length = max(max_length,book[i]);\n\t\t}\n\n\t\tmin_size = MAX_SIZE;\n\t\tleft = max_length,right = MAX_SIZE;\n\t\tm = (left+right)/2;\n\n\t\twhile(left < right){\n\n\t\t\tfor(int i = 0; i < dansu; i++)shelf[i] = m;\n\t\t\tdansu_index = 0;\n\t\t\tfor(int i = 0; i < kansu && dansu_index < dansu;){\n\t\t\t\tif(book[i] > m){\n\t\t\t\t\tdansu_index = dansu;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(shelf[dansu_index] >= book[i]){\n\t\t\t\t\tshelf[dansu_index] -= book[i];\n\t\t\t\t\ti++;\n\t\t\t\t}else{\n\t\t\t\t\tdansu_index++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(dansu_index == dansu){\n\t\t\t\tleft = m + 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}else{\n\t\t\t\tmin_size = min(min_size,m);\n\t\t\t\tright = right - 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",min_size);\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 740,
"memory_kb": 2564,
"score_of_the_acc": -1.5007,
"final_rank": 14
},
{
"submission_id": "aoj_0181_2072839",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n\n#define MAX_SIZE 1500000\n\nusing namespace std;\n\nint main(){\n\tint dansu,kansu,shelf[20],book[100],min_size,left,right,m,dansu_index,max_length;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&dansu,&kansu);\n\t\tif(dansu == 0 && kansu == 0)break;\n\n\t\tmax_length = 0;\n\n\t\tfor(int i = 0; i < kansu; i++){\n\t\t\tscanf(\"%d\",&book[i]);\n\t\t\tmax_length = max(max_length,book[i]);\n\t\t}\n\n\t\tmin_size = MAX_SIZE;\n\t\tleft = max_length,right = MAX_SIZE;\n\t\tm = (left+right)/2;\n\n\t\twhile(left < right){\n\n\t\t\tfor(int i = 0; i < dansu; i++)shelf[i] = m;\n\t\t\tdansu_index = 0;\n\t\t\tfor(int i = 0; i < kansu && dansu_index < dansu;){\n\t\t\t\tif(shelf[dansu_index] >= book[i]){\n\t\t\t\t\tshelf[dansu_index] -= book[i];\n\t\t\t\t\ti++;\n\t\t\t\t}else{\n\t\t\t\t\tdansu_index++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(dansu_index == dansu){\n\t\t\t\tleft = m + 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}else{\n\t\t\t\tmin_size = min(min_size,m);\n\t\t\t\tright = right - 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",min_size);\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 710,
"memory_kb": 2708,
"score_of_the_acc": -1.5104,
"final_rank": 16
},
{
"submission_id": "aoj_0181_2072821",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n\n#define MAX_SIZE 1500000\n\nusing namespace std;\n\nint main(){\n\tint dansu,kansu,shelf[20],book[100],min_size,left,right,m,dansu_index;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&dansu,&kansu);\n\t\tif(dansu == 0 && kansu == 0)break;\n\n\t\tfor(int i = 0; i < kansu; i++){\n\t\t\tscanf(\"%d\",&book[i]);\n\t\t}\n\n\t\tmin_size = MAX_SIZE;\n\t\tleft = 0,right = MAX_SIZE;\n\t\tm = (left+right)/2;\n\n\t\twhile(left < right){\n\n\t\t\tfor(int i = 0; i < dansu; i++)shelf[i] = m;\n\t\t\tdansu_index = 0;\n\t\t\tfor(int i = 0; i < kansu && dansu_index < dansu;){\n\t\t\t\tif(shelf[dansu_index] >= book[i]){\n\t\t\t\t\tshelf[dansu_index] -= book[i];\n\t\t\t\t\ti++;\n\t\t\t\t}else{\n\t\t\t\t\tdansu_index++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(dansu_index == dansu){\n\t\t\t\tleft = m + 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}else{\n\t\t\t\tmin_size = min(min_size,m);\n\t\t\t\tright = right - 1;\n\t\t\t\tm = (left + right)/2;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",min_size);\n\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 730,
"memory_kb": 2584,
"score_of_the_acc": -1.494,
"final_rank": 13
},
{
"submission_id": "aoj_0181_2041887",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\n\nint w[100];\nint main() {\n\tint m, n;\n\twhile (scanf(\"%d%d\", &m, &n), m) {\n\t\tint ans = 0;\n\t\trep(i, n) {\n\t\t\tscanf(\"%d\", &w[i]);\n\t\t\tans = max(ans, w[i]);\n\t\t}\n\t\tfor (;; ans++) {\n\t\t\tint j = 0, k = 0;\n\t\t\tbool flag = true;\n\t\t\trep(i, n) {\n\t\t\t\tj += w[i];\n\t\t\t\tif (j > ans) {\n\t\t\t\t\tk++; j = w[i];\n\t\t\t\t\tif (k >= m) {\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag) {\n\t\t\t\tprintf(\"%d\\n\", ans);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3164,
"score_of_the_acc": -0.8119,
"final_rank": 8
},
{
"submission_id": "aoj_0181_1996026",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\n#define FOR(i,a,b) for (int i = a; i < b; i++)\n#define REP(i,n) FOR(i,0,n)\n\nint main() {\n\tint n, m;\n\twhile (cin >> m >> n, n || m) {\n\t\tint v[100];\n\t\tREP(i, n) scanf(\"%d\", &v[i]);\n\t\t\n\t\tint sum[100];\n\t\tsum[0] = v[0];\n\t\tFOR(i,1,n) sum[i] = sum[i - 1] + v[i];\n\t\t\n\t\tint ans = 1;\n\t\tREP(i, n) ans = max(ans, v[i]);\n\t\tans = max(ans, sum[n - 1] / m);\n\t\t\n\t\twhile (true) {\n\t\t\tint cnt = 0, pos = 0;\n\t\t\twhile (pos < n) {\n\t\t\t\tcnt++;\n\t\t\t\tif (cnt > m) break;\n\t\t\t\t\n\t\t\t\tint now = v[pos++];\n\t\t\t\twhile (pos < n && now + v[pos] <= ans) now += v[pos++];\n\t\t\t}\n\t\t\t\n\t\t\tif (cnt <= m) {\n\t\t\t\tcout << ans << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tans++;\n\t\t}\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1244,
"score_of_the_acc": -0.03,
"final_rank": 1
},
{
"submission_id": "aoj_0181_1996021",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\n#define FOR(i,a,b) for (int i = a; i < b; i++)\n#define REP(i,n) FOR(i,0,n)\n\nint main() {\n\tint n, m;\n\twhile (cin >> m >> n, n || m) {\n\t\tint v[100];\n\t\tREP(i, n) scanf(\"%d\", &v[i]);\n\t\t\n\t\tint ans = 1;\n\t\tREP(i, n) ans = max(ans, v[i]);\n\t\t\n\t\twhile (true) {\n\t\t\tint cnt = 0, pos = 0;\n\t\t\twhile (pos < n) {\n\t\t\t\tcnt++;\n\t\t\t\tint now = v[pos++];\n\t\t\t\twhile (pos < n && now + v[pos] <= ans) now += v[pos++];\n\t\t\t}\n\t\t\t\n\t\t\tif (cnt <= m) {\n\t\t\t\tcout << ans << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tans++;\n\t\t}\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 1240,
"score_of_the_acc": -0.4035,
"final_rank": 6
},
{
"submission_id": "aoj_0181_1850779",
"code_snippet": "//2?????¢?´¢????????£????§£????????????????????????????????§??????\n#include<cstdio>\n#include<iostream>\n\nusing namespace std;\n\nint gcd(int m, int n)\n{\n\tif ((0 == m) || (0 == n))\n\t\treturn 1;\n\twhile (m != n)\n\t{\n\t\tif (m > n) m = m - n;\n\t\telse n = n - m;\n\t}\n\treturn m;\n}\n\n\n\n\nint main(void) {\n\n\twhile (1) {\n\n\t\tint floor, n, book[102] = { 0 };\n\t\tcin >> floor >> n;\n\n\t\tif (floor == 0)return 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> book[i];\n\t\t}\n\n\t\t//?????§??¬?´???°????±???????\n\t\tint m = book[0];\n\t\tint w_avr = book[0];\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tm = gcd(m, book[i]);\n\t\t\tw_avr += book[i];\n\t\t}\n\t\t//?????????????????§?????¬??????????????????????????°??§?????£?????°??????????????¬????????§?????????\n\t\tint ans = w_avr / floor;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (ans < book[i]) {\n\t\t\t\tans = book[i];\n\t\t\t}\n\t\t}\n\t\twhile (ans%m != 0) {\n\t\t\tans=ans-1;\n\t\t}\n\t\twhile (1) {\n\t\t\tint count = floor;\n\t\t\tint length = ans;\n\t\t\tint i = 0;\n\t\t\twhile (count != 0 && i < n) {\n\t\t\t\tif (length >= book[i]) {\n\t\t\t\t\tlength -= book[i];\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tlength = ans;\n\t\t\t\t\tcount = count - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (count != 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tans += m;\n\t\t}\n\t\tcout << ans << endl;\n\n\t}\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 1160,
"score_of_the_acc": -0.2361,
"final_rank": 2
},
{
"submission_id": "aoj_0181_1850777",
"code_snippet": "//2?????¢?´¢????????£????§£????????????????????????????????§??????\n#include<cstdio>\n#include<iostream>\n\nusing namespace std;\n\nint gcd(int m, int n)\n{\n\tif ((0 == m) || (0 == n))\n\t\treturn 1;\n\twhile (m != n)\n\t{\n\t\tif (m > n) m = m - n;\n\t\telse n = n - m;\n\t}\n\treturn m;\n}\n\n\n\n\nint main(void) {\n\n\twhile (1) {\n\n\t\tint floor, n, book[1000] = { 0 };\n\t\tcin >> floor >> n;\n\n\t\tif (floor == 0)return 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> book[i];\n\t\t}\n\n\t\t//?????§??¬?´???°????±???????\n\t\tint m = book[0];\n\t\tint w_avr = book[0];\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tm = gcd(m, book[i]);\n\t\t\tw_avr += book[i];\n\t\t}\n\t\t//?????????????????§?????¬??????????????????????????°??§?????£?????°??????????????¬????????§?????????\n\t\tint ans = w_avr / floor;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (ans < book[i]) {\n\t\t\t\tans = book[i];\n\t\t\t}\n\t\t}\n\t\twhile (ans%m != 0) {\n\t\t\tans=ans-1;\n\t\t}\n\t\twhile (1) {\n\t\t\tint count = floor;\n\t\t\tint length = ans;\n\t\t\tint i = 0;\n\t\t\twhile (count != 0 && i < n) {\n\t\t\t\tif (length >= book[i]) {\n\t\t\t\t\tlength -= book[i];\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tlength = ans;\n\t\t\t\t\tcount = count - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (count != 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tans += m;\n\t\t}\n\t\tcout << ans << endl;\n\n\t}\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 1164,
"score_of_the_acc": -0.2375,
"final_rank": 3
},
{
"submission_id": "aoj_0181_1831584",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint i,n,m,hon[100],max,dan,temp;\n\twhile(cin >> m >> n, n || m){\n\t\tmax = 0;\n\t\tfor(i = 0;i < n;i++){\n\t\t\tcin >> hon[i];\n\t\t\tif(max < hon[i])\n\t\t\t\tmax = hon[i];\n\t\t}\n\t\tdan = m + 1;\n\t\tfor(i = max;dan > m;i++){\n\t\t\tdan = 1;\n\t\t\ttemp = 0;\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(temp + hon[j] <= i){\n\t\t\t\t\ttemp += hon[j];\n\t\t\t\t} else {\n\t\t\t\t\ttemp = hon[j];\n\t\t\t\t\tdan++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << i - 1 << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 1160,
"score_of_the_acc": -0.375,
"final_rank": 5
},
{
"submission_id": "aoj_0181_560693",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\nint main(){\n int n,m;\n while(cin >>n>>m,n||m){\n vector<int> book;\n int x,ans = 0;\n for(int i=0; i<m; i++){\n cin >>x;\n book.push_back(x);\n if(ans<x){ans = x;}\n }\n for(int i;;ans++){\n int last = ans,l = n;\n for(i=0; i<m; i++){\n\tif(last < book[i]){\n\t last = ans;\n\t l--;\n\t if(l == 0){break;}\n\t last-=book[i];\n\t}\n\telse{last-=book[i];}\n }\n if(i == m){cout <<ans<<endl;break;}\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 1216,
"score_of_the_acc": -0.2561,
"final_rank": 4
}
] |
aoj_0179_cpp
|
ふしぎな虫
会津生物学研究所のA博士は、とある南の島でふしぎな虫を発見しました。形は芋虫のように細長いのですが、ひとつの体節が玉のような形をしているので、糸でつないだビーズ玉のように見えます。ふしぎなのは体の色に様々なバリエーションがあることと、なかには時間がたつにつれて体の色が変っていく虫がいることでした。どの虫の体節の色も赤か緑か青のどれかに限られるようですが、1 秒ごとに体節の色が変わっていき、最後にはすべての体節が同じ色になって落ち着く場合もあれば、いつまで待ってもずっと色が変わりつづける場合もあるようでした。
調べていくうちに、ふだんはすべての体節が同じ色をしているのですが、何かに驚いたりして興奮した後は体節の色が勝手に変わってしまうことがわかりました。一度体節の色が変わってしまうと、ふたたびすべての体節が同じ色になるまではずっと色が変わり続けることがわかりました。
A博士はこの虫を何匹も捕まえて興奮させてみては、色が変わる様子を興味深く観察していましたが、やがて色が変化している最中の色の変わり方には次のような規則性があることに気がつきました。
色が変わるのは、隣り合っている色違いの 2つの体節のペア 1組だけが変わり、他の体節の色は変わらない。ただし、そのようなペアが複数あるときに、どのペアの色が変わるかはあらかじめ予測できない。
そのようなペアは、2つの体節の色のどちらでもない色に同時に変わる(たとえば、緑と赤の体節が隣り合っているときは、それらが同時に青に変わる)。
虫の色の変化を、2秒後まですべて書いたものが上の図です。図の上段のような色をした虫がいるとします。このとき、隣り合った色違いの体節のペアは 3組あるので、1秒後には中段に並べて描いた 3通りの色のどれかに変わります。1秒後に中段左側の 2つのように変わったときには、2秒後にすべての体節が緑色になることができます(図の下段の左側から 2番目)。 それに対して、1秒後に中段の1番右のように変わったときには、2秒後にすべての体節が同じ色に変わることはありません。
博士は、目の前にいる虫の体節がすべて同じ色になる可能性があるのか、あるとしたらそうなるのは最短で何秒後なのかを予測することにしました。
目の前にいる虫の体節の色の並びを入力とし、その虫の体節がすべて同じ色になるのに要する最短の時間を秒単位で出力するプログラムを作成してください。ただし、同じ色になる可能性がないときは「NA(半角英大文字)」と出力してください。また、虫の体節の色の並びは2 以上 10 以下のr(赤)、g(緑)、b(青)からなる文字列で表されます。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されま
す。各データセットとして、 虫の体節の情報を表す１つの文字列が１行に与えられます。
データセットの数は 100 を超えません。
Output
データセット毎に、すべての体節の色が同じになるまでに要する最小時間 (秒単位の整数) または NA を１行に出力します。
Sample Input
rbgrg
rbbgbbr
bgr
bgrbrgbr
bggrgbgrr
gbrggrbggr
rrrrr
bgbr
0
Output for the Sample Input
5
7
1
6
NA
8
0
4
|
[
{
"submission_id": "aoj_0179_8542009",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <map>\n#include <cmath>\n#include <queue>\n#include <string>\n#include <set>\n#include <stack>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\nusing ll = long long;\n\nint main() {\n while (true) {\n string S;\n cin >> S;\n if (S == \"0\")break;\n int N = (int) S.size();\n int cs = 'r' + 'g' + 'b';\n\n string gr = string(N, 'r');\n string gg = string(N, 'g');\n string gb = string(N, 'b');\n queue<pair<int, string>> Q;\n set < string > st;\n\n Q.emplace(0, S);\n st.insert(S);\n int ans = -1;\n while (!Q.empty()) {\n auto [cnt, T] = Q.front();\n Q.pop();\n if (T == gr || T == gg || T == gb) {\n ans = cnt;\n break;\n }\n for (int i = 0; i < N - 1; i++) {\n string t = T;\n if (t[i] != t[i + 1]) {\n char c = char(cs - t[i] - t[i + 1]);\n t[i] = t[i + 1] = c;\n if (st.find(t) == st.end()) {\n Q.emplace(cnt + 1, t);\n st.insert(t);\n }\n }\n }\n }\n if (ans == -1) {\n cout << \"NA\" << endl;\n } else {\n cout << ans << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 4068,
"score_of_the_acc": -0.5469,
"final_rank": 5
},
{
"submission_id": "aoj_0179_7820010",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n string s;\n while (cin >> s , s != \"0\") {\n map<string,int> mp;\n int res = 1e9;\n mp[s] = 0;\n queue<string> q; q.push(s);\n while (q.size()) {\n s = q.front(); q.pop();\n int cur = mp[s];\n bool ok = true;\n for (int i = 0; i+1 < s.size(); ++i) {\n if (s[i] != s[i+1]) {\n ok = false;\n char a = s[i], b = s[i+1];\n char c = 'r'+'g'+'b'-a-b;\n s[i] = s[i+1] = c;\n if (mp.find(s) == mp.end()) {\n mp[s] = cur+1; q.push(s);\n }\n s[i] = a; s[i+1] = b;\n }\n }\n if (ok) {\n res = cur;\n break;\n }\n }\n if (res == 1e9) {\n cout << \"NA\" << \"\\n\";\n }\n else {\n cout << res << \"\\n\";\n }\n }\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4612,
"score_of_the_acc": -0.75,
"final_rank": 11
},
{
"submission_id": "aoj_0179_6955896",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n string s;\n while(cin >> s, s != \"0\"){\n map<string, int> mp;\n queue<string> nxt;\n mp[s] = 0;\n nxt.push(s);\n while(!nxt.empty()){\n s = nxt.front();\n nxt.pop();\n int d = mp[s];\n for(int i = 0; i + 1 < s.size(); i++){\n if(s[i] != s[i + 1]){\n char c1 = s[i], c2 = s[i + 1];\n s[i] = s[i + 1] = s[i] ^ s[i + 1] ^ 'r' ^ 'g' ^ 'b';\n if(mp.find(s) == mp.end()){\n mp[s] = d + 1;\n nxt.push(s);\n }\n s[i] = c1, s[i + 1] = c2;\n }\n }\n }\n int ans = 1 << 30;\n for(auto c:{'r','g','b'}){\n string t(s.size(), c);\n if(mp.find(t) == mp.end())continue;\n ans = min(ans, mp[t]);\n }\n if(ans == (1 << 30))cout << \"NA\" << '\\n';\n else cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 4868,
"score_of_the_acc": -1.2898,
"final_rank": 19
},
{
"submission_id": "aoj_0179_5846534",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n string S;\n cin >> S;\n if(S == \"0\") break;\n int N = S.size();\n long long int INF = 1000000000000000000;\n vector<long long int> dist(59049,INF);\n int a = 0;\n for(int i=0;i<N;i++){\n if(S[i] == 'r') a *= 3;\n else if(S[i] == 'g') a = a*3+1;\n else a = a*3+2;\n }\n dist[a] = 0;\n priority_queue<pair<long long int,long long int>,vector<pair<long long int,long long int> >,greater<pair<long long int,long long int> > > que;\n que.push(make_pair(0,a));\n while(!que.empty()){\n int v = que.top().second;\n long long int d = que.top().first;\n que.pop();\n if(dist[v] < d) continue;\n string T = \"\";\n for(int i=0;i<N;i++){\n if(v%3 == 0) T += 'r';\n else if(v%3 == 1) T += 'g';\n else T += 'b';\n v /= 3;\n }\n reverse(T.begin(),T.end());\n for(int i=0;i<N-1;i++){\n if(T[i] == T[i+1]) continue;\n int k=3;\n if(T[i] == 'r') k -= 0;\n else if(T[i] == 'g') k -= 1;\n else k -= 2;\n if(T[i+1] == 'r') k -= 0;\n else if(T[i+1] == 'g') k -= 1;\n else k -= 2;\n string U = T;\n if(k == 0){\n U[i] = 'r';\n U[i+1] = 'r';\n }\n else if(k == 1){\n U[i] = 'g';\n U[i+1] = 'g';\n }\n else{\n U[i] = 'b';\n U[i+1] = 'b';\n }\n int l=0;\n for(int i=0;i<N;i++){\n if(U[i] == 'r') l *= 3;\n else if(U[i] == 'g') l = l*3+1;\n else l = l*3+2;\n }\n if(dist[l] <= d+1) continue;\n dist[l] = d+1;\n que.push(make_pair(dist[l],l));\n }\n }\n long long int ans = INF;\n int x=0,y=0,z=0;\n for(int i=0;i<N;i++){\n x = x*3;\n y = y*3+1;\n z = z*3+2;\n }\n ans = min(ans,dist[x]);\n ans = min(ans,dist[y]);\n ans = min(ans,dist[z]);\n if(ans != INF) cout << ans << endl;\n else cout << \"NA\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 3584,
"score_of_the_acc": -0.6712,
"final_rank": 10
},
{
"submission_id": "aoj_0179_5834830",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tstring s;\n\twhile(cin>>s,s!=\"0\"){\n\t\tmap<string,int>dist;\n\t\tset<string>used;\n\t\tqueue<string>que;\n\t\tbool fnd=0;\n\t\tdist[s]=0;\n\t\tused.insert(s);\n\t\tque.push(s);\n\t\twhile(!que.empty()){\n\t\t\ts=que.front();\n\t\t\tque.pop();\n\t\t\tif(s==string(s.size(),s[0])){\n\t\t\t\tcout<<dist[s]<<endl;\n\t\t\t\tfnd=1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int i=0;i<s.size()-1;i++){\n\t\t\t\tif(s[i]!=s[i+1]){\n\t\t\t\t\tstring ss=s;\n\t\t\t\t\tss[i]=ss[i+1]='r'+'g'+'b'-s[i]-s[i+1];\n\t\t\t\t\tif(used.count(ss))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tdist[ss]=dist[s]+1;\n\t\t\t\t\tused.insert(ss);\n\t\t\t\t\tque.push(ss);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!fnd)\n\t\t\tcout<<\"NA\"<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 5576,
"score_of_the_acc": -1.1224,
"final_rank": 17
},
{
"submission_id": "aoj_0179_5550884",
"code_snippet": "#include <stdio.h>\n#include<queue>\n#include<string.h>\n#include<map>\n\n#define MAX_CODE 59049\nchar table[MAX_CODE];\n\nchar str[12];\n\nstruct Node\n{\n\tint code;\n\tint depth;\n};\n\nint getNumber(char ch)\n{\n\tif (ch == 'r')\n\t\treturn 0;\n\telse if (ch == 'g')\n\t\treturn 1;\n\telse if (ch == 'b')\n\t\treturn 2;\n\treturn 0;\n}\n\nchar get_char(int number)\n{\n\tif (number == 0)\n\t\treturn 'r';\n\telse if (number == 1)\n\t\treturn 'g';\n\telse if (number == 2)\n\t\treturn 'b';\n\treturn 'r';\n}\n\nint strToCode(char* str, int len)\n{\n\tint sum = 0;\n\tint ans = 1;\n\tfor (int i = 0; i < len; i++)\n\t{\n\t\tsum += getNumber(str[i]) * ans;\n\t\tans *= 3;\n\t}\n\treturn sum;\n}\n\nvoid codeToStr(int code, char* str, int len)\n{\n\tint number;\n\tchar ch;\n\tfor (int i = 0; i < len; i++)\n\t{\n\t\tnumber = code % 3;\n\t\tcode = code / 3;\n\t\tch = get_char(number);\n\t\tstr[i] = ch;\n\t}\n}\n\nint check(char* str, int len)\n{\n\tint i;\n\tfor (i = 0; i < len - 1; i++)\n\t{\n\t\tif (str[i] != str[i + 1])\n\t\t\tbreak;\n\t}\n\treturn i == (len - 1);\n}\n\n\nint bfs(char* str, int len)\n{\n\tif (check(str, len))\n\t\treturn 0;\n\tint code;\n\tchar chs[2];\n\tcode = strToCode(str, len);\n\ttable[code] = '1';\n\n\tstd::queue<Node> Q;\n\tNode tmp, nd;\n\ttmp.code = code;\n\ttmp.depth = 0;\n\tQ.push(tmp);\n\twhile (!Q.empty())\n\t{\n\t\tnd = Q.front();\n\t\tQ.pop();\n\n\t\tcodeToStr(nd.code, str, len);\n\t\tfor (int i = 0; i < len - 1; i++)\n\t\t{\n\t\t\tif (str[i] != str[i + 1])\n\t\t\t{\n\t\t\t\tchs[0] = str[i], chs[1] = str[i + 1];\n\t\t\t\tif (str[i] != 'r' && str[i + 1] != 'r') str[i] = str[i + 1] = 'r';\n\t\t\t\telse if (str[i] != 'g' && str[i + 1] != 'g') str[i] = str[i + 1] = 'g';\n\t\t\t\telse if (str[i] != 'b' && str[i + 1] != 'b') str[i] = str[i + 1] = 'b';\n\n\t\t\t\tif (check(str, len)) return nd.depth + 1;\n\t\t\t\tcode = strToCode(str, len);\n\t\t\t\tif (table[code] == '0')\n\t\t\t\t{\n\t\t\t\t\ttable[code] = '1';\n\t\t\t\t\ttmp.code = code;\n\t\t\t\t\ttmp.depth = nd.depth + 1;\n\t\t\t\t\tQ.push(tmp);\n\t\t\t\t}\n\t\t\t\tstr[i] = chs[0], str[i + 1] = chs[1];\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\nint slove(char* str, int len)\n{\n\treturn bfs(str, len);\n}\n\nint main()\n{\n\tint count;\n\twhile (1)\n\t{\n\t\tscanf(\"%s\", str);\n\t\tif (str[0] == '0')\n\t\t\tbreak;\n\n\t\tint len = strlen(str);\n\t\tfor (int i = 0; i < MAX_CODE; i++) table[i] = '0';\n\t\tcount = slove(str, len);\n\t\tif (count >= 0)\n\t\t\tprintf(\"%d\\n\", count);\n\t\telse\n\t\t\tprintf(\"NA\\n\");\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2756,
"score_of_the_acc": -0.0102,
"final_rank": 1
},
{
"submission_id": "aoj_0179_5549602",
"code_snippet": "#include <stdio.h>\n#include<queue>\n#include<string>\n#include<map>\n#include<string.h>\n\nchar table[1001];\nint len = 0;\n\nstruct Node\n{\n\tstd::string str;\n\tint depth;\n};\n\n\nint check(char* s, int len)\n{\n\tint i = 0;\n\tfor (i = 0; i < len - 1; i++)\n\t{\n\t\tif (s[i] != s[i + 1])\n\t\t\tbreak;\n\t}\n\treturn i == (len - 1);\n}\n\nint insertMap(std::map<std::string, int>& strMap, std::string& key)\n{\n\tstd::map<std::string, int>::iterator iter = strMap.find(key);\n\tif (iter != strMap.end())\n\t\treturn 0;\n\n\tstrMap.insert(std::pair<std::string, int>(key, 1));\n\treturn 1;\n}\n\nint bfs()\n{\n\tlen = strlen(table);\n\tif (check(table, len))\n\t\treturn 0;\n\tchar chs[2];\n\tNode tmp, nd;\n\tstd::map<std::string, int > strMap;\n\tstd::queue<Node> Q;\n\ttmp.str = table;\n\ttmp.depth = 0;\n\tQ.push(tmp);\n\n\twhile (!Q.empty())\n\t{\n\t\tnd = Q.front();\n\t\tQ.pop();\n\t\tstrcpy(table, nd.str.c_str());\n\t\tfor (int i = 0; i < len - 1; i++)\n\t\t{\n\t\t\tif (table[i] != table[i + 1])\n\t\t\t{\n\t\t\t\tchs[0] = table[i];\n\t\t\t\tchs[1] = table[i + 1];\n\t\t\t\tif (table[i] != 'r' && table[i + 1] != 'r') table[i] = table[i + 1] = 'r';\n\t\t\t\telse if (table[i] != 'g' && table[i + 1] != 'g') table[i] = table[i + 1] = 'g';\n\t\t\t\telse if (table[i] != 'b' && table[i + 1] != 'b') table[i] = table[i + 1] = 'b';\n\t\t\t\tif (check(table, len)) return nd.depth + 1;\n\t\t\t\ttmp.str = table;\n\t\t\t\ttmp.depth = nd.depth + 1;\n\t\t\t\tif (insertMap(strMap, tmp.str))\n\t\t\t\t{\n\t\t\t\t\tQ.push(tmp);\n\t\t\t\t}\n\t\t\t\ttable[i] = chs[0];\n\t\t\t\ttable[i + 1] = chs[1];\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\nint slove()\n{\n\treturn bfs();\n}\n\nint main()\n{\n\tint count;\n\twhile (1)\n\t{\n\t\tscanf(\"%s\", table);\n\t\tif (table[0] == '0')\n\t\t\tbreak;\n\t\tcount = slove();\n\t\tif (count >= 0)\n\t\t\tprintf(\"%d\\n\", count);\n\t\telse\n\t\t\tprintf(\"NA\\n\");\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4208,
"score_of_the_acc": -0.6067,
"final_rank": 6
},
{
"submission_id": "aoj_0179_4833855",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <map>\nusing namespace std;\nconst int inf = 1e9;\n\nint main(){\n string col = \"rgb\";\n while(1){\n string s;\n cin >> s;\n if(s == \"0\") break;\n int n = s.length();\n \n queue<string> wait;\n map<string, int> dp;\n dp[s] = 0;\n wait.push(s);\n while(!wait.empty()){\n string t = wait.front();\n int cost = dp[t];\n wait.pop();\n for(int i=0; i<n-1; i++){\n if(t[i] == t[i+1]) continue;\n string tmp = t;\n char unuse;\n for(int j=0; j<3; j++){\n if(t[i]!=col[j] and t[i+1]!=col[j]){\n unuse = col[j];\n }\n }\n tmp[i] = unuse;\n tmp[i+1] = unuse;\n if(dp.count(tmp) > 0) continue;\n wait.push(tmp);\n dp[tmp] = cost+1;\n }\n }\n int ans = inf;\n for(int i=0; i<3; i++){\n if(dp.count(string(n, col[i])) > 0){\n ans = min(ans, dp[string(n, col[i])]);\n }\n }\n if(ans == inf){\n cout << \"NA\" << endl;\n }else{\n cout << ans << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 990,
"memory_kb": 5196,
"score_of_the_acc": -1.8652,
"final_rank": 20
},
{
"submission_id": "aoj_0179_4619330",
"code_snippet": "#include <iostream>\n#include <set>\n#include <queue>\n\nstruct Worm {\n\tstd::string body;\n\tint step;\n\tWorm() {}\n\tWorm(std::string body, int step) : body(body), step(step) {}\n};\n\nbool meetColor(std::string body)\n{\n\tchar c = body[0];\n\tfor (int i=1; i<body.length(); i++) {\n\t\tif (body[i] != c) return false;\n\t}\n\treturn true;\n}\n\nint getMinStep(std::queue<Worm> que, std::set<std::string>& checked)\n{\n\twhile (!que.empty()) {\n\t\tWorm worm = que.front(); que.pop();\n\t\tif (meetColor(worm.body)) return worm.step;\n\t\tif (checked.find(worm.body) != checked.end()) continue;\n\t\tchecked.insert(worm.body);\n\t\tfor (int i=0; i<worm.body.length()-1; i++) {\n\t\t\tif (worm.body[i] == worm.body[i+1]) continue;\n\t\t\tstd::string new_body = worm.body;\n\t\t\tif (new_body[i] == 'r' && new_body[i+1] == 'g') new_body[i] = new_body[i+1] = 'b';\n\t\t\telse if (new_body[i] == 'r' && new_body[i+1] == 'b') new_body[i] = new_body[i+1] = 'g';\n\t\t\telse if (new_body[i] == 'g' && new_body[i+1] == 'r') new_body[i] = new_body[i+1] = 'b';\n\t\t\telse if (new_body[i] == 'g' && new_body[i+1] == 'b') new_body[i] = new_body[i+1] = 'r';\n\t\t\telse if (new_body[i] == 'b' && new_body[i+1] == 'r') new_body[i] = new_body[i+1] = 'g';\n\t\t\telse new_body[i] = new_body[i+1] = 'r';\n\t\t\tque.push(Worm(new_body, worm.step+1));\n\t\t}\n\t}\n\treturn -1;\n}\n\nint main()\n{\n\tstd::string worm;\n\twhile (true) {\n\t\tstd::cin >> worm;\n\t\tif (worm==\"0\") break;\n\t\tstd::queue<Worm> que;\n\t\tque.push(Worm(worm,0));\n\t\tstd::set<std::string> checked;\n\t\tint res = getMinStep(que, checked);\n\t\tif (res >= 0) std::cout << res << std::endl;\n\t\telse std::cout << \"NA\" << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 4804,
"score_of_the_acc": -0.8793,
"final_rank": 14
},
{
"submission_id": "aoj_0179_4377054",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n\nusing namespace std;\n\nchar GetDifColor(char c1, char c2)\n{\n\tif (c1 != 'r' && c2 != 'r')\n\t\treturn 'r';\n\tif (c1 != 'g' && c2 != 'g')\n\t return 'g';\n\tif (c1 != 'b' && c2 != 'b')\n\t\treturn 'b';\n\treturn ' ';\n}\n\nint BF(string worm)\n{\n\tint len = worm.length();\n\tstring R(len,'r');\n\tstring G(len,'g');\n\tstring B(len,'b');\n\tif (worm == R || worm == G || worm == B)\n\t\treturn 0;\n\tqueue<string> nodes;\n\tmap<string, int> records;\n\tnodes.push(worm);\n\tnodes.push(\"end\");\n\tint count0 = 0;\n\twhile (!nodes.empty())\n\t{\n\t\tstring node = nodes.front();\n\t\tnodes.pop();\n\t\tif (node == \"end\")\n\t\t{\n\t\t\tif (nodes.empty())\n\t\t\t\treturn -1;\n\t\t\tcount0++;\n\t\t\tnodes.push(\"end\");\n\t\t\tcontinue;\n\t\t}\n\t\tfor (size_t i = 0; i < len - 1; i++)\n\t\t{\n\t\t\tif (node[i] != node[i + 1])\n\t\t\t{\n\t\t\t\tchar c = GetDifColor(node[i], node[i + 1]);\n\t\t\t\tstring part(2, c);\n\t\t\t\tstring newNode = node;\n\t\t\t\tnewNode.replace(i, 2, part);\n\t\t\t\tif (records.find(newNode) == records.end())\n\t\t\t\t{\n\t\t\t\t\tif (newNode == R || newNode == G || newNode == B)\n\t\t\t\t\t\treturn count0 + 1;\n\t\t\t\t\tnodes.push(newNode);\n\t\t\t\t\trecords[newNode] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\nint main()\n{\n\tstring worm;\n\tcin >> worm;\n\twhile (worm != \"0\")\n\t{\n\t\tint count0 = BF(worm);\n\t\tstring ret = count0 == -1 ? \"NA\" : to_string(count0);\n\t\tcout << ret << endl;\n\t\tcin >> worm;\n\t}\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 4576,
"score_of_the_acc": -0.7678,
"final_rank": 12
},
{
"submission_id": "aoj_0179_4370452",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n string s;\n while(cin >> s, s != \"0\"){\n map<string, int> m;\n queue<string> Q;\n Q.emplace(s);\n m[s] = 0;\n int p = 0;\n while(!Q.empty()){\n string x = Q.front(); Q.pop();\n int ok = 1;\n for (int i = 0; i+1 < x.size(); ++i) {\n if(x[i] != x[i+1]) {\n ok = 0;\n break;\n }\n }\n if(ok) {\n p = 1;\n cout << m[x] << \"\\n\";\n break;\n }\n for (int i = 0; i+1 < x.size(); ++i) {\n if(x[i] == x[i+1]) continue;;\n string y = x;\n auto w = 'r'^'g'^'b'^x[i]^x[i+1];\n y[i] = y[i+1] = w;\n if(!m.count(y)){\n m[y] = m[x]+1;\n Q.emplace(y);\n }\n }\n }\n if(!p){\n puts(\"NA\");\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 4828,
"score_of_the_acc": -0.9082,
"final_rank": 15
},
{
"submission_id": "aoj_0179_4269707",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<algorithm>\n#include<math.h>\n#include<map>\n#include<queue>\n\nusing namespace std;\n\nstring InputStr, StrNow;\nmap<string, int> DpResult;\n\n\nbool isAllSame() {\n\tint size;\n\n\tsize = StrNow.size();\n\tfor (int i = 1; i < size; i++) {\n\t\tif (StrNow[0] != StrNow[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool solve() {\n\tint size;\n\tstring strPrev;\n\tqueue<string> CurrentStr;\n\n\tDpResult[InputStr] = 0;\n\tCurrentStr.push(InputStr);\n\n\twhile (!CurrentStr.empty()) {\n\t\tStrNow = strPrev = CurrentStr.front();\n\t\tCurrentStr.pop();\n\n\t\t//cout << \"befor:\" << strPrev << endl;\n\t\tsize = StrNow.size() - 1;\n\t\tfor (int i = 0; i < size; i++) {\n\t\t\tStrNow = strPrev;\n\t\t\tif ((StrNow[i] == 'r' && StrNow[i + 1] == 'g') || (StrNow[i] == 'g' && StrNow[i + 1] == 'r')) {\n\t\t\t\tStrNow[i] = StrNow[i + 1] = 'b';\n\t\t\t}\n\t\t\telse if ((StrNow[i] == 'r' && StrNow[i + 1] == 'b') || (StrNow[i] == 'b' && StrNow[i + 1] == 'r')) {\n\t\t\t\tStrNow[i] = StrNow[i + 1] = 'g';\n\t\t\t}\n\t\t\telse if ((StrNow[i] == 'g' && StrNow[i + 1] == 'b') || (StrNow[i] == 'b' && StrNow[i + 1] == 'g')) {\n\t\t\t\tStrNow[i] = StrNow[i + 1] = 'r';\n\t\t\t}\n\n\t\t\t//cout << \"after:\" << StrNow << endl;\n\t\t\tif (DpResult.find(StrNow) == DpResult.end()) {\n\t\t\t\tCurrentStr.push(StrNow);\n\t\t\t\tDpResult[StrNow] = DpResult[strPrev] + 1;\n\t\t\t}\n\n\t\t\tif (isAllSame()) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint main() {\n\n\twhile (cin >> InputStr, InputStr[0] != '0') {\n\t\t//cout << InputStr << endl;\n\t\tDpResult.clear();\t\t\n\t\tif (solve()) {\n\t\t\tcout << DpResult[StrNow] << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 4632,
"score_of_the_acc": -0.8285,
"final_rank": 13
},
{
"submission_id": "aoj_0179_3847139",
"code_snippet": "#include <cstdio>\n#include <utility>\n#include <string>\n#include <queue>\n#include <climits>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n#define _OP(t) inline operator t()\nstruct _in {\n#ifdef _GLIBCXX_STRING\n\t_OP(string){string s;for(char c;c=gcu(),c!=' '&&c!='\\n';)s+=c;return s;}\n#define _S\n#endif\n\t_OP(char){char c=gcu();gcu();return c;}\n\t_OP(double){double d; scanf(\"%lf\",&d); gcu();return d;}\n\t_T _OP(T){T n{},m{1},c;if((c=gcu())=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n} in;\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n#ifdef _S\n_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}\n#endif\n_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);}\n_OUT(const char *s){while(*s)pcu(*s++);}\n_OUT(char c){pcu(c);}\n#ifdef _S\n_OUT(string &s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n\t_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n\t_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n\t_HT _OUT(H &&h, T... t){out(h);out(t...);}\n\ttemplate <typename... T> _OUTL(T... t){out(t...);outl();}\n\tstruct range{\n\t\tint e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\t\tstruct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}\n\t\t\tit& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};\n#define times(i,n) for(int i=n;i;i--)\n\nstruct N {\n\tint s, n;\n};\n\nbool all(int n) {\n\tint c = n & 3;\n\tn >>= 2;\n\tfor (; n; n >>= 2)\n\t\tif ((n & 3) != c)\n\t\t\treturn false;\n\treturn true;\n}\n\nint main() {\n\tfor (;;) {\n\t\tstring s = in;\n\t\tif (s == \"0\")\n\t\t\treturn 0;\n\t\tint r = [&] {\n\t\t\tbool m[1 << 2 * s.size()] {};\n\t\t\tint t {};\n\t\t\tfor (char c: s) {\n\t\t\t\tt <<= 2;\n\t\t\t\tt |= c == 'r' ? 1 : c == 'g' ? 2 : 3;\n\t\t\t}\n\t\t\tm[t] = true;\n\t\t\tqueue<N> q;\n\t\t\tq.push({t, 0});\n\t\t\twhile (!q.empty()) {\n\t\t\t\tN f {q.front()};\n\t\t\t\tq.pop();\n\t\t\t\tif (all(f.s))\n\t\t\t\t\treturn f.n;\n\t\t\t\tfor (int i: range(1, s.size())) {\n\t\t\t\t\tif (((f.s >> (i - 1) * 2) & 3) != ((f.s >> i * 2) & 3)) {\n\t\t\t\t\t\tint t = f.s,\n\t\t\t\t\t\t\tg = ((t >> (i - 1) * 2) & 3) ^ ((t >> i * 2) & 3);\n\t\t\t\t\t\tt &= ~(15 << (i - 1) * 2);\n\t\t\t\t\t\tt |= (g | g << 2) << (i - 1) * 2;\n\t\t\t\t\t\tif (!m[t]) {\n\t\t\t\t\t\t\tm[t] = true;\n\t\t\t\t\t\t\tq.push({t, f.n + 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\treturn -1;\n\t\t}();\n\t\tif (r == -1)\n\t\t\toutl(\"NA\");\n\t\telse\n\t\t\toutl(r);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3648,
"score_of_the_acc": -0.3163,
"final_rank": 4
},
{
"submission_id": "aoj_0179_3847115",
"code_snippet": "#include <cstdio>\n#include <utility>\n#include <string>\n#include <queue>\n#include <unordered_set>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n#define _OP(t) inline operator t()\nstruct _in {\n#ifdef _GLIBCXX_STRING\n\t_OP(string){string s;for(char c;c=gcu(),c!=' '&&c!='\\n';)s+=c;return s;}\n#define _S\n#endif\n\t_OP(char){char c=gcu();gcu();return c;}\n\t_OP(double){double d; scanf(\"%lf\",&d); gcu();return d;}\n\t_T _OP(T){T n{},m{1},c;if((c=gcu())=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n} in;\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n#ifdef _S\n_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}\n#endif\n_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);}\n_OUT(const char *s){while(*s)pcu(*s++);}\n_OUT(char c){pcu(c);}\n#ifdef _S\n_OUT(string &s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n\t_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n\t_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n\t_HT _OUT(H &&h, T... t){out(h);out(t...);}\n\ttemplate <typename... T> _OUTL(T... t){out(t...);outl();}\n\tstruct range{\n\t\tint e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\t\tstruct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}\n\t\t\tit& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};\n#define times(i,n) for(int i=n;i;i--)\n\nstruct N {\n\tint s, n;\n};\n\nbool all(int n) {\n\tint c = n & 7;\n\tn >>= 3;\n\tfor (; n; n >>= 3)\n\t\tif ((n & 7) != c)\n\t\t\treturn false;\n\treturn true;\n}\n\nint main() {\n\tfor (;;) {\n\t\tstring s = in;\n\t\tif (s == \"0\")\n\t\t\treturn 0;\n\t\tint r = [&] {\n\t\t\tunordered_set<int> m;\n\t\t\tint t {};\n\t\t\tfor (char c: s) {\n\t\t\t\tt <<= 3;\n\t\t\t\tt |= c == 'r' ? 1 : c == 'g' ? 2 : 4;\n\t\t\t}\n\t\t\tm.insert(t);\n\t\t\tqueue<N> q;\n\t\t\tq.push({t, 0});\n\t\t\twhile (!q.empty()) {\n\t\t\t\tN f {q.front()};\n\t\t\t\tq.pop();\n\t\t\t\tif (all(f.s))\n\t\t\t\t\treturn f.n;\n\t\t\t\tfor (int i: range(1, s.size())) {\n\t\t\t\t\tif (((f.s >> (i - 1) * 3) & 7) != ((f.s >> i * 3) & 7)) {\n\t\t\t\t\t\tint t = f.s,\n\t\t\t\t\t\t\tg = 7 & ~(((t >> (i - 1) * 3) & 7) | ((t >> i * 3) & 7));\n\t\t\t\t\t\tt &= ~(63 << (i - 1) * 3);\n\t\t\t\t\t\tt |= (g | g << 3) << (i - 1) * 3;\n\t\t\t\t\t\tif (!m.count(t)) {\n\t\t\t\t\t\t\tm.insert(t);\n\t\t\t\t\t\t\tq.push({t, f.n + 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\treturn -1;\n\t\t}();\n\t\tif (r == -1)\n\t\t\toutl(\"NA\");\n\t\telse\n\t\t\toutl(r);\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 2984,
"score_of_the_acc": -0.1013,
"final_rank": 3
},
{
"submission_id": "aoj_0179_3847114",
"code_snippet": "#include <cstdio>\n#include <utility>\n#include <string>\n#include <queue>\n#include <unordered_set>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n#define _OP(t) inline operator t()\nstruct _in {\n#ifdef _GLIBCXX_STRING\n\t_OP(string){string s;for(char c;c=gcu(),c!=' '&&c!='\\n';)s+=c;return s;}\n#define _S\n#endif\n\t_OP(char){char c=gcu();gcu();return c;}\n\t_OP(double){double d; scanf(\"%lf\",&d); gcu();return d;}\n\t_T _OP(T){T n{},m{1},c;if((c=gcu())=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n} in;\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n#ifdef _S\n_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}\n#endif\n_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);}\n_OUT(const char *s){while(*s)pcu(*s++);}\n_OUT(char c){pcu(c);}\n#ifdef _S\n_OUT(string &s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n\t_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n\t_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n\t_HT _OUT(H &&h, T... t){out(h);out(t...);}\n\ttemplate <typename... T> _OUTL(T... t){out(t...);outl();}\n\tstruct range{\n\t\tint e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\t\tstruct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}\n\t\t\tit& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};\n#define times(i,n) for(int i=n;i;i--)\n\nstruct N {\n\tint s, n;\n};\n\nint flag(char c) {\n\treturn c == 'r' ? 3 : c == 'g' ? 5 : 6;\n}\n\nbool all(int n) {\n\tint c = n & 7;\n\tn >>= 3;\n\tfor (; n; n >>= 3)\n\t\tif ((n & 7) != c)\n\t\t\treturn false;\n\treturn true;\n}\n\nint main() {\n\tfor (;;) {\n\t\tstring s = in;\n\t\tif (s == \"0\")\n\t\t\treturn 0;\n\t\tint r = [&] {\n\t\t\tunordered_set<int> m;\n\t\t\tint t {};\n\t\t\tfor (char c: s) {\n\t\t\t\tt <<= 3;\n\t\t\t\tt |= c == 'r' ? 1 : c == 'g' ? 2 : 4;\n\t\t\t}\n\t\t\tm.insert(t);\n\t\t\tqueue<N> q;\n\t\t\tq.push({t, 0});\n\t\t\twhile (!q.empty()) {\n\t\t\t\tN f {q.front()};\n\t\t\t\tq.pop();\n\t\t\t\tif (all(f.s))\n\t\t\t\t\treturn f.n;\n\t\t\t\tfor (int i: range(1, s.size())) {\n\t\t\t\t\tif (((f.s >> (i - 1) * 3) & 7) != ((f.s >> i * 3) & 7)) {\n\t\t\t\t\t\tint t = f.s,\n\t\t\t\t\t\t\tg = 7 & ~(((t >> (i - 1) * 3) & 7) | ((t >> i * 3) & 7));\n\t\t\t\t\t\tt &= ~(63 << ((i - 1) * 3));\n\t\t\t\t\t\tt |= (g | g << 3) << ((i - 1) * 3);\n\t\t\t\t\t\tif (!m.count(t)) {\n\t\t\t\t\t\t\tm.insert(t);\n\t\t\t\t\t\t\tq.push({t, f.n + 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\treturn -1;\n\t\t}();\n\t\tif (r == -1)\n\t\t\toutl(\"NA\");\n\t\telse\n\t\t\toutl(r);\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 2972,
"score_of_the_acc": -0.097,
"final_rank": 2
},
{
"submission_id": "aoj_0179_3847059",
"code_snippet": "#include <cstdio>\n#include <utility>\n#include <string>\n#include <queue>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n#define _OP(t) inline operator t()\nstruct _in {\n#ifdef _GLIBCXX_STRING\n\t_OP(string){string s;for(char c;c=gcu(),c!=' '&&c!='\\n';)s+=c;return s;}\n#define _S\n#endif\n\t_OP(char){char c=gcu();gcu();return c;}\n\t_OP(double){double d; scanf(\"%lf\",&d); gcu();return d;}\n\t_T _OP(T){T n{},m{1},c;if((c=gcu())=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n} in;\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n#ifdef _S\n_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}\n#endif\n_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);}\n_OUT(const char *s){while(*s)pcu(*s++);}\n_OUT(char c){pcu(c);}\n#ifdef _S\n_OUT(string &s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n\t_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n\t_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n\t_HT _OUT(H &&h, T... t){out(h);out(t...);}\n\ttemplate <typename... T> _OUTL(T... t){out(t...);outl();}\n\tstruct range{\n\t\tint e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\t\tstruct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}\n\t\t\tit& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};\n#define times(i,n) for(int i=n;i;i--)\n\nstruct N {\n\tstring s;\n\tint n;\n};\n\nint flag(char c) {\n\treturn c == 'r' ? 3 : c == 'g' ? 5 : 6;\n}\n\nint main() {\n\tfor (;;) {\n\t\tstring s = in;\n\t\tif (s == \"0\")\n\t\t\treturn 0;\n\t\tint r = [&] {\n\t\t\tset<string> m;\n\t\t\tm.insert(s);\n\t\t\tqueue<N> q;\n\t\t\tq.push({s, 0});\n\t\t\twhile (!q.empty()) {\n\t\t\t\tN f {q.front()};\n\t\t\t\tq.pop();\n\t\t\t\tif(all_of(begin(f.s) + 1, end(f.s), [&](char c) {return c == f.s[0];}))\n\t\t\t\t\treturn f.n;\n\t\t\t\tfor (int i: range(1, f.s.size())) {\n\t\t\t\t\tif (f.s[i - 1] != f.s[i]) {\n\t\t\t\t\t\tstring t = f.s;\n\t\t\t\t\t\tt[i - 1] = t[i] = \"0bg0r\"[flag(f.s[i - 1]) & flag(f.s[i])];\n\t\t\t\t\t\tif (!m.count(t)) {\n\t\t\t\t\t\t\tm.insert(t);\n\t\t\t\t\t\t\tq.push({t, f.n + 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\treturn -1;\n\t\t}();\n\t\tif (r == -1)\n\t\t\toutl(\"NA\");\n\t\telse\n\t\t\toutl(r);\n\t}\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 4148,
"score_of_the_acc": -0.6467,
"final_rank": 8
},
{
"submission_id": "aoj_0179_3847002",
"code_snippet": "#include <cstdio>\n#include <utility>\n#include <string>\n#include <queue>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n#define _OP(t) inline operator t()\nstruct _in {\n#ifdef _GLIBCXX_STRING\n\t_OP(string){string s;for(char c;c=gcu(),c!=' '&&c!='\\n';)s+=c;return s;}\n#define _S\n#endif\n\t_OP(char){char c=gcu();gcu();return c;}\n\t_OP(double){double d; scanf(\"%lf\",&d); gcu();return d;}\n\t_T _OP(T){T n{},m{1},c;if((c=gcu())=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n} in;\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n#ifdef _S\n_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}\n#endif\n_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);}\n_OUT(const char *s){while(*s)pcu(*s++);}\n_OUT(char c){pcu(c);}\n#ifdef _S\n_OUT(string &s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n\t_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n\t_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n\t_HT _OUT(H &&h, T... t){out(h);out(t...);}\n\ttemplate <typename... T> _OUTL(T... t){out(t...);outl();}\n\tstruct range{\n\t\tint e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\t\tstruct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}\n\t\t\tit& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};\n#define times(i,n) for(int i=n;i;i--)\n\nstruct N {\n\tstring s;\n\tint n;\n};\n\nint flag(char c) {\n\treturn c == 'r' ? 3 : c == 'g' ? 5 : 6;\n}\n\nint main() {\n\tfor (;;) {\n\t\tstring s = in;\n\t\tif (s == \"0\")\n\t\t\treturn 0;\n\t\tint r = [&] {\n\t\t\tset<string> m;\n\t\t\tm.insert(s);\n\t\t\tqueue<N> q;\n\t\t\tq.push({s, 0});\n\t\t\twhile (!q.empty()) {\n\t\t\t\tN f {q.front()};\n\t\t\t\tq.pop();\n\t\t\t\tif(all_of(begin(f.s) + 1, end(f.s), [&](char c) {return c == f.s[0];}))\n\t\t\t\t\treturn f.n;\n\t\t\t\tm.insert(f.s);\n\t\t\t\tfor (int i: range(1, f.s.size())) {\n\t\t\t\t\tif (f.s[i - 1] != f.s[i]) {\n\t\t\t\t\t\tstring t = f.s;\n\t\t\t\t\t\tt[i - 1] = t[i] = \"0bg0r\"[flag(f.s[i - 1]) & flag(f.s[i])];\n\t\t\t\t\t\tif (!m.count(t)) {\n\t\t\t\t\t\t\tm.insert(t);\n\t\t\t\t\t\t\tq.push({t, f.n + 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\treturn -1;\n\t\t}();\n\t\tif (r == -1)\n\t\t\toutl(\"NA\");\n\t\telse\n\t\t\toutl(r);\n\t}\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 4160,
"score_of_the_acc": -0.6611,
"final_rank": 9
},
{
"submission_id": "aoj_0179_3846987",
"code_snippet": "#include <cstdio>\n#include <utility>\n#include <string>\n#include <queue>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\n#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}\n#ifdef __linux\n_gp(_unlocked);\n#else\n_gp();\n#endif\n#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept\n#define _T template <typename T>\n#define _HT template <typename H,typename... T>\n#define _OP(t) inline operator t()\nstruct _in {\n#ifdef _GLIBCXX_STRING\n\t_OP(string){string s;for(char c;c=gcu(),c!=' '&&c!='\\n';)s+=c;return s;}\n#define _S\n#endif\n\t_OP(char){char c=gcu();gcu();return c;}\n\t_OP(double){double d; scanf(\"%lf\",&d); gcu();return d;}\n\t_T _OP(T){T n{},m{1},c;if((c=gcu())=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}\n} in;\n#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)\n#ifdef _S\n_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}\n#endif\n_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}\n_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}\n#define _OUT(...) _DEF(void,out,__VA_ARGS__)\n#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)\n_OUT(bool b){pcu('0'+b);}\n_OUT(const char *s){while(*s)pcu(*s++);}\n_OUT(char c){pcu(c);}\n#ifdef _S\n_OUT(string &s){for(char c:s)pcu(c);}\n#endif\n_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;\n\tif(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}\n\t_OUTL(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n\t_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);}\n#endif\n\t_HT _OUT(H &&h, T... t){out(h);out(t...);}\n\ttemplate <typename... T> _OUTL(T... t){out(t...);outl();}\n\tstruct range{\n\t\tint e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}\n\t\tstruct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}\n\t\t\tit& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};\n#define times(i,n) for(int i=n;i;i--)\n\nstruct N {\n\tstring s;\n\tint n;\n};\n\nint flag(char c) {\n\treturn c == 'r' ? 3 : c == 'g' ? 5 : 6;\n}\n\nint main() {\n\tfor (;;) {\n\t\tstring s = in;\n\t\tif (s == \"0\")\n\t\t\treturn 0;\n\t\tint r = [&] {\n\t\t\tset<string> m;\n\t\t\tm.insert(s);\n\t\t\tqueue<N> q;\n\t\t\tq.push({s, 0});\n\t\t\twhile (!q.empty()) {\n\t\t\t\tN f {q.front()};\n\t\t\t\tq.pop();\n\t\t\t\tif(count(begin(f.s) + 1, end(f.s), f.s[0]) == (int) s.size() - 1)\n\t\t\t\t\treturn f.n;\n\t\t\t\tm.insert(f.s);\n\t\t\t\tfor (int i: range(1, f.s.size())) {\n\t\t\t\t\tif (f.s[i - 1] != f.s[i]) {\n\t\t\t\t\t\tstring t = f.s;\n\t\t\t\t\t\tt[i - 1] = t[i] = \"0bg0r\"[flag(f.s[i - 1]) & flag(f.s[i])];\n\t\t\t\t\t\tif (!m.count(t)) {\n\t\t\t\t\t\t\tm.insert(t);\n\t\t\t\t\t\t\tq.push({t, f.n + 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\treturn -1;\n\t\t}();\n\t\tif (r == -1)\n\t\t\toutl(\"NA\");\n\t\telse\n\t\t\toutl(r);\n\t}\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 4056,
"score_of_the_acc": -0.6345,
"final_rank": 7
},
{
"submission_id": "aoj_0179_3722720",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e16;\nconst ll MOD = 1e9 + 7;\n#define FOR(i, a, b) for(int i=(a);i<(b);i++)\n#define rep(i,N) FOR(i, 0, N)\n#define ALL(s) (s).begin(), (s).end()\n#define EQ(a, b) (abs((a) - (b)) < EPS)\n#define EQV(a, b) (EQ((a).reeal(), (b).real) && EQ((a).imag(), (b).imag()))\n#define NIL -1\n\nll g;\nll w;\nll d[100000];\nchar table[] = {'r','g','b'};\n\nstring myitos(ll num){\n string res = \"\";\n rep(i,w){\n res += table[num % 3];\n num /= 3;\n }\n reverse(ALL(res));\n return res;\n}\n\nll mystoi(string s){\n ll res = 0;\n rep(i,s.size()){\n res *= 3;\n if(s[i] == 'g')res++;\n else if(s[i] == 'b')res += 2;\n }\n return res;\n}\n\nvoid dijkstra(ll start){\n fill(d,d+100000,INF);\n d[start] = 0;\n\n priority_queue<P,vector<P>,greater<P>> que;\n que.push(P(0,start));\n\n while(!que.empty()){\n P p = que.top();\n que.pop();\n ll v = p.second;\n ll cost = p.first;\n if(d[v] < cost)continue;\n // d[v] = cost;\n if(v == 0 || v == g || v == 2*g)continue;\n\n string now = myitos(v);\n\n rep(i,now.size() - 1){\n char c1 = now[i];\n char c2 = now[i+1];\n string t = now;\n if((c1 == 'r' && c2 == 'g') || (c1 == 'g' && c2 == 'r')){\n t[i] = 'b';\n t[i+1] = 'b';\n }\n if((c1 == 'g' && c2 == 'b') || (c1 == 'b' && c2 == 'g')){\n t[i] = 'r';\n t[i+1] = 'r';\n }\n if((c1 == 'b' && c2 == 'r') || (c1 == 'r' && c2 == 'b')){\n t[i] = 'g';\n t[i+1] = 'g';\n }\n ll to = mystoi(t);\n // cout << t << endl;\n if(d[to] > cost+1){\n d[to] = cost + 1;\n que.push(P(cost+1,to));\n }\n }\n\n }\n}\n\nstring s;\n\nint main(){\n while(cin >> s && s != \"0\"){\n int start = 0;\n w = s.size();\n g = 0;\n rep(i,s.size()){\n g *= 3;\n g++;\n int num = 0;\n if(s[i] == 'g')num++;\n if(s[i] == 'b')num += 2;\n start = 3*start + num;\n }\n // string t = myitos(start);\n // cout << t << endl;\n // cout << mystoi(t) << endl;\n // continue;\n dijkstra(start);\n ll ans = min(d[0],min(d[g],d[2*g]));\n if(ans == INF)cout << \"NA\" << endl;\n else cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 3984,
"score_of_the_acc": -1.1293,
"final_rank": 18
},
{
"submission_id": "aoj_0179_3661859",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <numeric>\n#include <map>\n#include <queue>\n#include <utility>\n\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\n#ifdef _DEBUG_\n#define dump(val) cerr << __LINE__ << \":\\t\" << #val << \" = \" << (val) << endl\n#else\n#define dump(val)\n#endif\n\nusing namespace std;\n\ntypedef long long int ll;\n\ntemplate<typename T>\nvector<T> make_v(size_t a, T b) {\n return vector<T>(a, b);\n}\ntemplate<typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n return vector<decltype(make_v(ts...))>(a, make_v(ts...));\n}\n\nusing P = pair<string, int>;\n\nchar getLast(char c1, char c2) {\n if (c1 > c2) swap(c1, c2);\n if (c1 == 'b' && c2 == 'g') return 'r';\n if (c1 == 'b' && c2 == 'r') return 'g';\n return 'b';\n}\n\n#include <set>\nbool check(string s) {\n set<int> st;\n for(auto &c: s) {\n st.insert(c);\n }\n return st.size() == 1;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n string s;\n while (cin >> s, s != \"0\") {\n map<string, int> mp;\n int n = s.size();\n queue<P> q;\n q.emplace(s, 0);\n int ans = -1;\n while (q.size()) {\n string e = q.front().first;\n int cnt = q.front().second;\n q.pop();\n if (check(e)) {\n ans = cnt;\n break;\n }\n mp[e] = cnt;\n REP (i, 0, n - 1) {\n if (e[i] != e[i + 1]) {\n string tmp = e;\n tmp[i] = tmp[i + 1] = getLast(e[i], e[i + 1]);\n if (mp.count(tmp) == 0) {\n q.emplace(tmp, cnt + 1);\n mp[tmp] = cnt + 1;\n }\n }\n }\n }\n if (ans == -1) {\n cout << \"NA\" << endl;\n } else {\n cout << ans << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 4824,
"score_of_the_acc": -0.9374,
"final_rank": 16
}
] |
aoj_0185_cpp
|
ゴールドバッハ予想
ゴールドバッハ予想とは「6 以上のどんな偶数も、2 つの素数 (*1) の和として表わすことができる」というものです。
たとえば、偶数の 12 は
12 = 5 + 7
、18 は
18 = 5 + 13 = 7 + 11
などと表すことができます。
和が 134 となる 2 つの素数の組み合せをすべて書き出すと、以下の通りとなります。
134 = 3+131 = 7+127 = 31+103 = 37+97 = 61+73 = 67+67
= 131+3 = 127+7 = 103+31 = 97+37 = 73+61
与えられた数が大きくなると、いくらでも素数の組み合せが見つかるような気がします。しかし、現代数学をもってしてもこの予想を証明することも、反例を作ることもできません(*2)。ちょっと不思議な感じがしますね。
そこで、ゴールドバッハ予想を鑑賞するために、偶数
n
を入力とし、和が
n
となる 2 つの素数の組み合せの数を求めるプログラムを作成してください。
和が
n
となる素数の組み合せの数とは
n = p + q
かつ
p ≤ q
であるような正の素数
p
,
q
の組み合せの数です。上の例からわかるように和が 134 となる素数の組み合せは6 個です。
(*1) 素数とは、1 または自分自身以外に約数を持たない整数のことである。なお、1 は素数ではない。
(*2) 2007 年 2 月現在、5×10
17
までの全ての偶数について成り立つことが確かめられている。(Wikipedia)
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。 各データセットとして、１つの偶数
n
(6 ≤
n
≤ 1000000) が１行に与えられます。
データセットの数は 500 を超えません。
Output
データセット毎に素数の組み合せの数を１行に出力します。
Sample Input
134
4330
34808
98792
0
Output for the Sample Input
6
72
274
607
|
[
{
"submission_id": "aoj_0185_6928744",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (long long i=0;i<(long long)(n);i++)\n#define all(v) v.begin(),v.end()\nusing ll=long long;\nusing pll=pair<ll,ll>;\nusing tll=tuple<ll,ll,ll>;\nconst ll inf=-(1ll<<60),INF=(1ll<<60);\ntemplate<class T> void chmin(T &a,T b){\n if(a>b){\n a=b;\n }\n}\ntemplate<class T> void chmax(T &a,T b){\n if(a<b){\n a=b;\n }\n}\n\nint main(){\n vector<bool> v(1000010,true);\n v[0]=false;\n v[1]=false;\n for(ll i=2;i<1000010;i++){\n if(!v[i]) continue;\n ll x=i+i;\n while(x<1000010){\n v[x]=false;\n x+=i;\n }\n }\n while(true){\n ll n;\n cin >> n;\n if(n==0) return 0;\n ll cnt=0;\n for(ll i=2;i<n/2+1;i++){\n if(i<=n-i&&v[i]&&v[n-i]) cnt++;\n }\n cout << cnt << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3464,
"score_of_the_acc": -0.0578,
"final_rank": 3
},
{
"submission_id": "aoj_0185_6928709",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nbool f(ll p){\n if(p==1){\n return false;\n }\n else{\n for(ll i=2;i*i<=p;i++){\n if(p%i==0){\n return false;\n }\n }\n return true;\n }\n}\nint main() {\n ll kannkeinasi=0;\n set<ll> s;\n rep(i,1000001){\n if(f(i)){\n s.insert(i);\n }\n }\n while(kannkeinasi>=0){\n ll N;\n cin >> N;\n ll p=N;\n if(p==0){\n return 0;\n }\n if(N>=6){\n ll ans=0;\n for(ll i=1;i<=N/2;i+=2){\n if(s.count(i)&&s.count(N-i)){\n ans++;\n }\n }\n cout << ans << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 580,
"memory_kb": 6772,
"score_of_the_acc": -1.4272,
"final_rank": 20
},
{
"submission_id": "aoj_0185_6809124",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int M = 1000000;\n vector<bool> P(M+1,true);\n P[0] = P[1] = false;\n for(int i=2;i<=M;i++){\n for(int j=2;j*j<=i;j++){\n if(i%j == 0){\n P[i] = false;\n break;\n }\n }\n }\n for(;;){\n int N;\n cin >> N;\n if(N == 0) break;\n int ans = 0;\n for(int i=0;i<=N/2;i++) if(P[i] && P[N-i]) ans++;\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3260,
"score_of_the_acc": -0.2486,
"final_rank": 8
},
{
"submission_id": "aoj_0185_4733326",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX 1000005\nbool isPrime(int n){\n for(int i=2;i*i<=n;i++) if(n%i==0) return 0;\n return 1;\n}\nint main(){\n int n;\n bool d[MAX]={};\n for(int i=2;i<MAX;i++) d[i]=isPrime(i);\n while(cin>>n,n){\n int ans=0;\n for(int i=2;i<=n/2;i++){\n if(d[i]&&d[n-i]) ans++;\n }cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 4060,
"score_of_the_acc": -0.3667,
"final_rank": 10
},
{
"submission_id": "aoj_0185_4619824",
"code_snippet": "#include <iostream>\n#include <cmath>\n\nbool isPrime(int n)\n{\n\tint ub = (int)std::sqrt((float)n);\n\tfor (int p=2; p<=ub; p++) {\n\t\tif (n%p==0) return false;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint n;\n\twhile (true) {\n\t\tstd::cin >> n;\n\t\tif (n == 0) break;\n\t\tint res = 0;\n\t\tfor (int k=3; k<=n/2; k++) {\n\t\t\tif (isPrime(k) && isPrime(n-k)) res++;\n\t\t}\n\t\tstd::cout << res << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 610,
"memory_kb": 3052,
"score_of_the_acc": -1.0056,
"final_rank": 18
},
{
"submission_id": "aoj_0185_4442120",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nvector<int> get_prime(int n){\n if(n <= 1) return vector<int>();\n vector<bool> is_prime(n+1, true);\n vector<int> prime;\n is_prime[0] = is_prime[1] = 0;\n for (int i = 2; i <= n; ++i) {\n if(is_prime[i]) prime.emplace_back(i);\n for (auto &&j : prime){\n if(i*j > n) break;\n is_prime[i*j] = false;\n if(i % j == 0) break;\n }\n }\n return prime;\n}\n\nauto p = get_prime(1000000);\n\nint main() {\n int n;\n while(cin >> n, n){\n int l = 0, ans = 0;\n for (int i = p.size()-1; i >= 0; --i) {\n while(l < i && p[l]+p[i] < n) l++;\n ans += (p[i]+p[l] == n);\n }\n cout << ans << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3368,
"score_of_the_acc": -0.0623,
"final_rank": 4
},
{
"submission_id": "aoj_0185_4385184",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n\nusing namespace std;\n\nbool record[1000001];\n\nint Func(int n)\n{\n\tint count0 = 0;\n\tint max0 = n / 2;\n\tfor (size_t i = 2; i <= max0; i++)\n\t\tif (record[i] && record[n - i])\n\t\t\tcount0++;\n\treturn count0;\n}\n\nint main()\n{\n\tfill(record, record + 1000001, true);\n\tfor (size_t i = 2; i < 1000001; i++)\n\t{\n\t\tif (record[i])\n\t\t{\n\t\t\tfor (size_t j = 2; i * j < 1000001; j++)\n\t\t\t{\n\t\t\t\trecord[i * j] = false;\n\t\t\t}\n\t\t}\n\t}\n\tint n;\n\tcin >> n;\n\twhile (n)\n\t{\n\t\tcout << Func(n) << endl;\n\t\tcin >> n;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4060,
"score_of_the_acc": -0.1334,
"final_rank": 6
},
{
"submission_id": "aoj_0185_4235724",
"code_snippet": "#include <iostream>\n#include <stdlib.h>\nusing namespace std;\n#define limit 1000010\n\nint main(void){\n int* table=(int*)malloc(sizeof(int)*limit);\n for(int i=0;i<limit;i++){\n table[i]=1;\n }\n table[0]=0;\n table[1]=0;\n int k;\n for(int i=0;i<limit;i++){\n if(table[i]==0)continue;\n k=2;\n while(k*i<=limit){\n table[k*i]=0;\n k++;\n }\n }\n int n;\n while(1){\n cin>>n;\n if(n==0)break;\n int retval=0;\n for(int i=1;i<=n/2;i++){\n if(table[i]==1 && table[n-i]==1){\n retval++;\n }\n }\n cout<<retval<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6908,
"score_of_the_acc": -0.4944,
"final_rank": 12
},
{
"submission_id": "aoj_0185_4068897",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint PrimeNumber[1000001] = {0,0,1,1};\n\nvoid findPrimeNumber(){\n\tint limit;\n\tbool flag;\n\n\tfor (int i = 5; i < 1000001; i += 2) {\n\t\tlimit = sqrt(i) + 1;\n\t\tflag = true;\n\t\tfor (int j = 2; j < limit; j++) {\n\t\t\tif (i%j == 0) {\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag) {\n\t\t\tPrimeNumber[i] = 1;\n\t\t}\n\t}\n\n\treturn;\n}\n\nint main() {\n\tint n, rest, sum;\n\n\tfindPrimeNumber();\n\twhile (cin >> n, n) {\n\t\tsum = 0;\n\t\tfor (int i = 2; i < n; i++) {\n\t\t\trest = n - i;\n\t\t\tif (i > rest) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (PrimeNumber[i] == 1 && PrimeNumber[rest] == 1) {\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\t \n\t\tcout << sum << endl;\n\t}\n\t\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 6956,
"score_of_the_acc": -0.7338,
"final_rank": 17
},
{
"submission_id": "aoj_0185_4042225",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(int i=0;i<(num);++i)\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=int>\nT in(){T x; cin >> x; return (x);}\ntemplate<typename T=int,typename C=vector<T>>\nC vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}\n\nvoid vout(){cout << endl;}\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}\nvoid out(){cout << endl;}\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}\n\nvector<ll> enum_prime(ll N){\n\tdeque<bool> is_prime(N+1,true);\n\tvector<ll> P;\n\tfor(ll i=2;i<=N;i++){\n\t\tif(is_prime[i]){\n\t\t\tfor(ll j=i*i;j<=N;j+=i){\n\t\t\t\tis_prime[j] = false;\n\t\t\t}\n\t\t\tP.emplace_back(i);\n\t\t}\n\t}\n\treturn P;\n}\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tauto P=enum_prime(1000000);\n\tsort(ALL(P));\n\tint M=P.size();\n\t\n\twhile(true){\n\t\tint N=in();\n\t\tif(!N) break;\n\n\t\tint sum = 0;\n\t\tfor(int i=0;i<M;i++){\n\t\t\tint V=N-P[i];\n\t\t\tif(binary_search(P.begin()+i,P.end(),V)) sum++;\n\t\t}\n\t\tout(sum);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 4860,
"score_of_the_acc": -0.5348,
"final_rank": 15
},
{
"submission_id": "aoj_0185_3873248",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint n;\nint p[100000];\n\nint main()\n{\n\tint t = 0;\n\n\tfor (int i = 3; i < 1000000; i += 2) {\n\t\tbool f = 1;\n\t\tfor (int j = 3; j * j <= i; j++) {\n\t\t\tif (i % j == 0) {\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (f) {\n\t\t\tp[t] = i;\n\t\t\tt++;\n\t\t}\n\t}\n\n\tcin >> n;\n\n\twhile (n) {\n\t\tint m = 0, i = 0;\n\n\t\twhile (p[i] * 2 <= n) {\n\t\t\tif (binary_search(p, p + t, n - p[i]))\n\t\t\t\tm++;\n\n\t\t\ti++;\n\t\t}\n\n\t\tcout << m << endl;\n\n\t\tcin >> n;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3352,
"score_of_the_acc": -0.2936,
"final_rank": 9
},
{
"submission_id": "aoj_0185_3427740",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n int n;\n while(cin >> n){\n if(n == 0) return 0;\n vector<bool> F(n + 1, true);\n for(int i = 2; i <= (int)sqrt(n); i++){\n if(F[i]){\n for(int j = i + i; j <= n; j += i){\n F[j] = false;\n }\n }\n }\n\n int ans = 0;\n for(int i = 2; i <= n / 2; i++){\n if(F[i] and F[n - i]) ans++;\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3264,
"score_of_the_acc": -0.0491,
"final_rank": 1
},
{
"submission_id": "aoj_0185_3394448",
"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 bool a[1000000];\n \n a[0] = a[1] = false;\n for( int i = 2; i < 1000000; i++ )\n a[i] = judgePrimeNumber(i);\n\n while( cin >> n )\n {\n if( !n )\n break;\n\n int cnt = 0;\n for( int i = 2; i <= n / 2; i++ )\n if( a[i] && a[n-i] )\n cnt++;\n \n cout << cnt << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 4000,
"score_of_the_acc": -0.4258,
"final_rank": 11
},
{
"submission_id": "aoj_0185_3208519",
"code_snippet": "#include<vector>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nnamespace AOJ0185\n{\n\tclass Primes\n\t{\n\tpublic:\n\t\tstatic void GetPrimes(int max, vector<int> &primes)\n\t\t{\n\t\t\tvector<bool> flags(max + 1, true);\n\t\t\tfor (int i = 2; i <= max; i++)\n\t\t\t{\n\t\t\t\tif (flags[i])\n\t\t\t\t{\n\t\t\t\t\tprimes.push_back(i);\n\t\t\t\t\tfor (int j = i; j <= max; j += i)\n\t\t\t\t\t{\n\t\t\t\t\t\tflags[j] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t};\n\n\tclass Solver\n\t{\n\tprivate:\n\t\tstatic const int MAX_N = 1000001;\n\t\tint Input()\n\t\t{\n\t\t\tint n;\n\t\t\tcin >> n;\n\t\t\treturn n;\n\t\t}\n\n\t\tvoid Output(int answer)\n\t\t{\n\t\t\tcout << answer << endl;\n\t\t}\n\n\tpublic:\n\t\tvoid Solve()\n\t\t{\n\t\t\tvector<int> primes;\n\t\t\tPrimes::GetPrimes(MAX_N, primes);\n\n\t\t\tint n;\n\t\t\twhile (n = Input())\n\t\t\t{\n\t\t\t\tint answer = 0;\n\t\t\t\tfor (int i = 0; i < primes.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tint diff = n - primes[i];\n\t\t\t\t\tif (diff < primes[i])break;\n\t\t\t\t\tbool exist = binary_search(primes.begin(), primes.end(), diff);\n\t\t\t\t\tif (exist)answer++;\n\t\t\t\t}\n\t\t\t\tOutput(answer);\n\t\t\t}\n\t\t}\n\n\t};\n}\n\nint main()\n{\n\tAOJ0185::Solver().Solve();\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3440,
"score_of_the_acc": -0.0548,
"final_rank": 2
},
{
"submission_id": "aoj_0185_2971827",
"code_snippet": "#include<iostream>\n#include<math.h>\n#include<vector>\n#include<algorithm>\n#include<cstdio>\n#include <string>\n#include <complex>\n#include <functional>\nusing namespace std;\ntypedef pair<int,int> P;\nint cnt[7];\nint main(){\n int i,j,n,prime[1000001];\n prime[0]=prime[1]=-1;\n for(i=2;i<=1000000;i++){\n if(prime[i]!=-1){\n prime[i]=1;\n for(j=i+i;j<=1000000;j+=i)prime[j]=-1;\n }\n }\n while(cin>>n,n){\n int cnt=0;\n for(i=1;i<=n/2;i++){\n if(prime[i]==1&&prime[n-i]==1) cnt++;\n }\n cout<<cnt<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6988,
"score_of_the_acc": -0.5046,
"final_rank": 13
},
{
"submission_id": "aoj_0185_2628458",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n#define MAX 1000001\n\nbool isPrime[MAX];\n\nvoid eratos() {\n fill(isPrime, isPrime + MAX, true);\n for (int i = 2; i < MAX; i++) {\n if (!isPrime[i]) continue;\n for (int j = i + i; j < MAX; j += i) {\n isPrime[j] = false;\n }\n }\n}\n\nint main() {\n eratos();\n int n;\n while (true) {\n cin >> n;\n if (n == 0) return 0;\n int count = 0;\n for (int i = 2; i <= n / 2; i++) {\n if (!isPrime[i]) continue;\n if (isPrime[n - i]) count++;\n }\n cout << count << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3976,
"score_of_the_acc": -0.1227,
"final_rank": 5
},
{
"submission_id": "aoj_0185_2559831",
"code_snippet": "#include<iostream>\nusing namespace std;\n#include<cmath>\nbool isprime(int n) {\n\tif (n == 2)return true;\n\tif (n % 2 == 0)return false;\n\tfor (int i = 3; i <= sqrt(n); i += 2) if (n%i == 0)return false;\n\treturn true;\n}\nint main() {\n\tint n; while (cin >> n, n) {\n\t\tint cnt = 0;\n\t\tfor (int i = 2; i <= n / 2; i++) {\n\t\t\tif (isprime(i) && isprime(n - i))cnt++;\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 440,
"memory_kb": 3008,
"score_of_the_acc": -0.7167,
"final_rank": 16
},
{
"submission_id": "aoj_0185_2493355",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<algorithm>\n#include<string>\n#include<queue>\n#include<vector>\n#include<functional>\n#include<cmath>\n#include<map>\n#include<stack>\n#include<set>\n#include<numeric>\n#include<limits>\n#include<iterator>\n\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define rep(i,n) for(int i=0; i<n; i++)\n#define INF (1<<20)\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pi;\ntypedef pair<ll, ll> pl;\ntypedef pair<ll, char> plc;\n\nll arr[1000010];\n\nvoid Eratosthenes(ll n) {\n\tfor (int i = 0; i <= n; i++)\n\t\tarr[i] = 1;\n\n\tfor (int i = 2; i <= sqrt(n); i++) {\n\t\tif (arr[i]) {\n\t\t\tfor (int j = 0; i*(j + 2) <= n; j++)\n\t\t\t\tarr[i*(j + 2)] = 0;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tll n;\n\twhile (cin >> n, n)\n\t{\n\t\tll cnt = 0;\n\t\tEratosthenes(n);\n\t\tfor (int i = 2; i <= n / 2 + n % 2; i++) {\n\t\t\tif (arr[i]) {\n\t\t\t\tif (arr[n - i])cnt++;\n\t\t\t}\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 10896,
"score_of_the_acc": -1.0667,
"final_rank": 19
},
{
"submission_id": "aoj_0185_2402875",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n#define fi first\n#define se second\n\ntemplate<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<int, pll> pip;\nconst ll INF = 1ll<<60;\nconst ll MOD = 1000000007;\nconst double EPS = 1e-9;\n\nvector<int> sieve(int n) {\n\tvector<int> res;\n\tvector<bool> is_prime(n + 1, true);\n\t\n\tis_prime[0] = is_prime[1] = false;\n\t\n\tfor (int i = 2; i * i <= n; i++) if (is_prime[i]) {\n\t\tres.push_back(i);\n\t\tis_prime[i] = false;\n\t\tfor (int j = 2; i * j <= n; j++) if (is_prime[i * j]) {\n\t\t\tis_prime[i * j] = false;\n\t\t}\n\t}\n\t\n\tREP(i, n + 1) if (is_prime[i]) res.push_back(i);\n\tsort(res.begin(), res.end());\n\treturn res;\n}\n\nint main() {\n\tvector<int> prime = sieve(1000000);\n\tset<int> ss;\n\tREP(i, prime.size()) ss.insert(prime[i]);\n\t\n\tint n;\n\twhile (cin >> n, n) {\n\t\tint ans = 0;\n\t\tREP(i, prime.size()) {\n\t\t\tif (prime[i] * 2 > n) break;\n\t\t\tif (ss.find(n - prime[i]) != ss.end()) ans++;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 6684,
"score_of_the_acc": -0.516,
"final_rank": 14
},
{
"submission_id": "aoj_0185_2217420",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\tbool prime[1000001] = {true,true};\n\tvector<int> ps;\n\tfor(int i = 4;i <= 1000000;i += 2) prime[i] = true;\n\tfor(int i = 3;i * i <= 1000000;i += 2){\n\t\tfor(int j = i * 2;j <= 1000000;j += i) prime[j] = true;\n\t}\n\tfor(int i = 0;i <= 1000000;i++) if(!prime[i]) ps.push_back(i);\n\tint n;\n\twhile(cin >> n,n){\n\t\tint cnt = 0;\n\t\tfor(int i = 0;i < ps.size();i++){\n\t\t\tif(ps[i] > n / 2) break;\n\t\t\tif(upper_bound(ps.begin(),ps.end(),n - ps[i]) - lower_bound(ps.begin(),ps.end(),n - ps[i])) cnt++;\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4248,
"score_of_the_acc": -0.1739,
"final_rank": 7
}
] |
aoj_0182_cpp
|
ビーカー
いろいろな容量のビーカーが与えられています。はじめに、その中の一番容量の大きなビーカーを一個選び、蛇口から水をいっぱいになるまで注ぎます。つぎに、次のルールにしたがいながら、ビーカーの水を他のビーカーに移し替えていきます。
ビーカーに入っている水は,残さずにすべて他のビーカーに移さなければならない。ただし、一個のビーカーに水を全部移せないときは、複数のビーカーに分けて移してもよい。
ビーカーに水を入れるとき、いっぱいになるまで水を注がなければならない。また、水をこぼしてはならない。
複数のビーカーから同じビーカーに一度に水を注いではならない。
同じビーカーには一度しか水を注いではならない。
このルールにしたがったとき、ビーカーの個数
n
と各ビーカーの容量を入力とし、すべてのビーカーに水を注ぐことができるかどうかを判定して出力するプログラムを作成してください。すべてのビーカーに水を注ぐことができるときは YES (半角英大文字)、できないときは NO (半角英大文字) を出力してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
n
c
1
c
2
...
c
n
1 行目にビーカーの個数
n
(1 ≤
n
≤ 50) が与えられます。２行目に
i
番目のビーカーの容量を表す整数
c
i
(1 ≤
c
i
≤ 100) が与えられます。
データセットの数は 105 を超えません。
Output
データセット毎に判定結果を１行に出力します。
Sample Input
10
11 2 23 4 2 12 8 5 2 10
8
2 1 3 11 2 3 1 4
9
5 9 1 2 4 8 17 1 8
8
3 38 9 4 18 14 19 5
1
1
0
Output for the Sample Input
YES
YES
YES
NO
YES
|
[
{
"submission_id": "aoj_0182_7847482",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nll can(const int n,const vector<int> &c, int i, ll bit, int sum) {\n if (sum == 0) {\n return bit;\n }\n if (i == -1) {\n return -1;\n }\n if ((1LL<<i)&bit) {\n if (sum >= c[i]) {\n ll r = can(n,c,i-1,bit^(1LL<<i),sum-c[i]);\n if (r != -1) {\n return r;\n }\n }\n }\n return can(n,c,i-1,bit,sum);\n}\n\nbool dfs(const int n,const vector<int> &c, int i, ll bit, int sum) {\n if (i + 1 == n) {\n return (sum == c[i]);\n }\n if (sum > c.back()) return false;\n // 最後に残す場合\n if (dfs(n,c,i+1,(bit|(1LL<<i)),sum+c[i])) {\n return true;\n }\n // これまでの集合からi番目作る場合\n ll b = can(n,c,i-1,bit,c[i]);\n if (b != -1) {\n return dfs(n,c,i+1,b^(1LL<<i),sum);\n }\n return false;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n while (cin >> n,n) {\n vector<int> c(n);\n for (int i = 0; i < n; ++i) {\n cin >> c[i];\n }\n sort(c.begin(), c.end());\n if (n == 1 or dfs(n,c,1,1,c[0])) {\n cout << \"YES\" << \"\\n\";\n }\n else {\n cout << \"NO\" << \"\\n\";\n }\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3344,
"score_of_the_acc": -1.0843,
"final_rank": 16
},
{
"submission_id": "aoj_0182_7447547",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint n = -1;\nvector<int> beakers;\nvector<bool> final_state;\nvector<bool> c_state;\n\n\nbool dfs1(int i, int c) {\n\tif (c == 0) {\n\t\treturn true;\n\t}\n\tif (i < 0) {\n\t\treturn false;\n\t}\n\n\tif (!c_state[i]) {\n\t\treturn dfs1(i - 1, c);\n\t}\n\n\tif (beakers[i] <= c) {\n\t\tc_state[i] = false;\n\t\tif (dfs1(i - 1, c - beakers[i])) {\n\t\t\treturn true;\n\t\t}\n\t\tc_state[i] = true;\n\t}\n\treturn dfs1(i - 1, c);\n}\n\n\nbool dfs0(int i, int c) {\n\tif (c == 0) {\n\t\tc_state = final_state;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tif (!c_state[j]) {\n\t\t\t\tif (!dfs1(j - 1, beakers[j])) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tc_state[j] = true;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tif (c < beakers[i]) {\n\t\treturn false;\n\t}\n\n\tfinal_state[i] = true;\n\tif (dfs0(i + 1, c - beakers[i])) {\n\t\treturn true;\n\t}\n\tfinal_state[i] = false;\n\treturn dfs0(i + 1, c);\n}\n\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tbeakers.resize(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> beakers[i];\n\t\t}\n\n\t\tsort(beakers.begin(), beakers.end());\n\t\tfinal_state = vector<bool>(n, false);\n\t\tfinal_state[0] = true;\n\n\t\tcout << (dfs0(1, beakers.back() - beakers[0]) ? \"YES\" : \"NO\") << endl;\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3176,
"score_of_the_acc": -0.9278,
"final_rank": 13
},
{
"submission_id": "aoj_0182_7447533",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint n = -1;\nvector<int> c;\nvector<bool> final_state;\nvector<bool> water;\n\nbool dfs1(int k, int v) {\n\tif (v == 0) {\n\t\treturn true;\n\t}\n\tif (k < 0) {\n\t\treturn false;\n\t}\n\n\tif (!water[k]) {\n\t\treturn dfs1(k - 1, v);\n\t}\n\n\tif (c[k] <= v) {\n\t\twater[k] = false;\n\t\tif (dfs1(k - 1, v - c[k])) {\n\t\t\treturn true;\n\t\t}\n\t\twater[k] = true;\n\t}\n\treturn dfs1(k - 1, v);\n}\n\n\nbool dfs0(int k, int v) {\n\tif (v == 0) {\n\t\twater = final_state;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (!water[i]) {\n\t\t\t\tif (!dfs1(i - 1, c[i])) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\twater[i] = true;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tif (v < c[k]) {\n\t\treturn false;\n\t}\n\n\tfinal_state[k] = true;\n\tif (dfs0(k + 1, v - c[k])) {\n\t\treturn true;\n\t}\n\tfinal_state[k] = false;\n\treturn dfs0(k + 1, v);\n}\n\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tc.resize(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> c[i];\n\t\t}\n\n\t\tsort(c.begin(), c.end());\n\t\tfinal_state = vector<bool>(n, false);\n\t\tfinal_state[0] = true;\n\n\t\tcout << (dfs0(1, c.back() - c[0]) ? \"YES\" : \"NO\") << endl;\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3344,
"score_of_the_acc": -1,
"final_rank": 15
},
{
"submission_id": "aoj_0182_4464577",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nstruct Solution {\n vector<int> used, used2, v;\n int N;\n bool rec(int cur, int rest){\n if(!rest) return true;\n if(cur < 0) return false;\n if(used2[cur] && v[cur] <= rest){\n used2[cur] = 0;\n if(rec(cur-1, rest-v[cur])) return true;\n used2[cur] = 1;\n }\n return rec(cur-1, rest);\n }\n\n int ok(int cur, int rest){\n if(!rest){\n used2 = used;\n for (int i = 1; i < N; ++i) {\n if(used2[i]) continue;\n if(!rec(i-1, v[i])) return 0;\n used2[i] = 1;\n }\n return true;\n }else if(rest < v[cur]) return 0;\n used[cur] = 1;\n if(ok(cur+1, rest-v[cur])) return 1;\n used[cur] = 0;\n return ok(cur+1, rest);\n }\n\n void solve(int n){\n if(n == 1){\n cin >> n;\n puts(\"YES\");\n return;\n }\n N = n;\n used.resize(n, 0);\n fill(used.begin(),used.end(),0);\n v.resize(n);\n for (auto &&i : v) scanf(\"%d\", &i);\n sort(v.begin(),v.end());\n used[0] = 1;\n puts(ok(1, v.back()-v.front()) ? \"YES\" : \"NO\");\n }\n};\n\nint main() {\n int n;\n Solution s;\n while(cin >> n, n) s.solve(n);\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3204,
"score_of_the_acc": -0.964,
"final_rank": 14
},
{
"submission_id": "aoj_0182_4289862",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<algorithm>\n#include<vector>\n#include<map>\n\nusing namespace std;\n\nint N;\nint Volume[50];\nbool WaterIn[50], Tmp[50];\n\n\nbool calculation(int id, int volumeOfCurrent) {\n\t//cout << \"rest:\" << volumeOfCurrent << \" :id\" << id << endl;\n\n\tif (id < -1) {\n\t\treturn false;\n\t}\n\tif (volumeOfCurrent == 0) {\n\t\treturn true;\n\t}\n\t\n\tif (!Tmp[id]) {\n\t\treturn calculation(id - 1, volumeOfCurrent);\n\t}\n\n\tif (Volume[id] <= volumeOfCurrent) {\n\t\tTmp[id] = false;\n\t\tif (calculation(id - 1, volumeOfCurrent - Volume[id])) {\n\t\t\treturn true;\n\t\t}\n\t\tTmp[id] = true;\n\t}\n\t\n\treturn calculation(id - 1, volumeOfCurrent);\n}\n\nbool solve(int beakerId, int rest) {\n\t\n\tif (rest == 0) {\n\t\t//judge\n\t\tcopy(WaterIn, WaterIn + N, Tmp);\n\t\t/*for (int i = 0; i < N; ++i) {\n\t\t\tTmp[i] = WaterIn[i];\n\t\t}*/\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (Tmp[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (!calculation(i-1, Volume[i])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tTmp[i] = true;\n\t\t}\n\t\treturn true;\n\t}\n\n\tif (Volume[beakerId] > rest) {\n\t\treturn false;\n\t}\n\n\tWaterIn[beakerId] = true;\n\tif (solve(beakerId + 1, rest - Volume[beakerId])) {\n\t\treturn true;\n\t}\n\tWaterIn[beakerId] = false;\n\treturn (solve(beakerId + 1, rest));\n}\n\nint main() {\n\n\twhile (cin >> N, N) {\n\t\tmemset(Volume, 0, sizeof(Volume));\n\t\tmemset(WaterIn, false, sizeof(WaterIn));\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> Volume[i];\n\t\t}\n\t\tsort(Volume, Volume + N);\n\t\tWaterIn[0] = true;\n\t\n\t\tif (solve(1, Volume[N - 1] - Volume[0])) {\n\t\t\tcout << \"YES\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"NO\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3020,
"score_of_the_acc": -0.8729,
"final_rank": 10
},
{
"submission_id": "aoj_0182_3896927",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint N;\nint C[50];\nbool g(const long,const long);\nbool f(int res,int start,long now,long usd)\n{\n\tif(res==0)\n\t{\n\t\treturn g(now,usd);\n\t}\n\tint a=__builtin_ctzll(now);\n\tint b=__builtin_ctzll(~usd);\n\tif(a>b&&C[b]>res)return false;\n\tint pre=-1;\n\tfor(int i=start;i<N;i++)\n\t{\n\t\tif(usd>>i&1||C[i]>res||pre==C[i])continue;\n\t\tif(f(res-C[i],i+1,now|1LL<<i,usd|1LL<<i))return true;\n\t\tpre=C[i];\n\t}\n\treturn false;\n}\nbool g(long now,long usd)\n{\n\tif(usd==((1LL<<N)-1))return true;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tif(now>>i&1)\n\t\t{\n\t\t\tif(f(C[i],i+1,now&~(1LL<<i),usd))return true;\n\t\t}\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tfor(int i=0;i<N;i++)cin>>C[i];\n\t\tsort(C,C+N);\n\t\treverse(C,C+N);\n\t cout<<(g(1,1)?\"YES\":\"NO\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 840,
"memory_kb": 3016,
"score_of_the_acc": -1.8591,
"final_rank": 19
},
{
"submission_id": "aoj_0182_3896926",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint N;\nint C[50];\nbool g(const long,const long);\nbool f(int res,int start,long now,long usd)\n{\n\tif(res==0)\n\t{\n\t\treturn g(now,usd);\n\t}\n\tint a=__builtin_ctz(now);\n\tint b=__builtin_ctz(~usd);\n\tif(a>b&&C[b]>res)return false;\n\tint pre=-1;\n\tfor(int i=start;i<N;i++)\n\t{\n\t\tif(usd>>i&1||C[i]>res||pre==C[i])continue;\n\t\tif(f(res-C[i],i+1,now|1LL<<i,usd|1LL<<i))return true;\n\t\tpre=C[i];\n\t}\n\treturn false;\n}\nbool g(long now,long usd)\n{\n\tif(usd==((1LL<<N)-1))return true;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tif(now>>i&1)\n\t\t{\n\t\t\tif(f(C[i],i+1,now&~(1LL<<i),usd))return true;\n\t\t}\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tfor(int i=0;i<N;i++)cin>>C[i];\n\t\tsort(C,C+N);\n\t\treverse(C,C+N);\n\t cout<<(g(1,1)?\"YES\":\"NO\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 830,
"memory_kb": 3112,
"score_of_the_acc": -1.8883,
"final_rank": 20
},
{
"submission_id": "aoj_0182_3896924",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint N;\nint C[50];\nbool g(const long,const long);\nbool f(const int res,const int start,const long now,const long usd)\n{\n\tif(res==0)\n\t{\n\t\treturn g(now,usd);\n\t}\n\tint a=__builtin_ctz(now);\n\tint b=__builtin_ctz(~usd);\n\tif(a>b&&C[b]>res)return false;\n\tint pre=-1;\n\tfor(int i=start;i<N;i++)\n\t{\n\t\tif(usd>>i&1||C[i]>res||pre==C[i])continue;\n\t\tif(f(res-C[i],i+1,now|1LL<<i,usd|1LL<<i))return true;\n\t\tpre=C[i];\n\t}\n\treturn false;\n}\nbool g(const long now,const long usd)\n{\n\tif(usd==((1LL<<N)-1))return true;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tif(now>>i&1)\n\t\t{\n\t\t\tif(f(C[i],i+1,now&~(1LL<<i),usd))return true;\n\t\t}\n\t}\n\treturn false;\n}\nmain()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\twhile(cin>>N,N)\n\t{\n\t\tfor(int i=0;i<N;i++)cin>>C[i];\n\t\tsort(C,C+N);\n\t\treverse(C,C+N);\n\t cout<<(g(1,1)?\"YES\\n\":\"NO\\n\");\n\t}\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 2972,
"score_of_the_acc": -1.7559,
"final_rank": 18
},
{
"submission_id": "aoj_0182_3622486",
"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 55\n\nint N;\nvector<int> V;\nbool check[NUM];\n\nbool recursive(int);\n\n\nbool dfs(int water_index,int current_index,int water_rest){\n\tif(water_rest == 0)return recursive(water_index+1);\n\tif(current_index == N)return false;\n\n\tif(check[current_index] == false && V[current_index] <= water_rest){\n\t\tcheck[current_index] = true;\n\t\tif(dfs(water_index,current_index+1,water_rest-V[current_index]))return true;\n\t\tcheck[current_index] = false;\n\t}\n\treturn dfs(water_index,current_index+1,water_rest);\n}\n\nbool recursive(int index){\n\n\tif(index == N)return true;\n\n\tif(!check[index])return false;\n\n\treturn dfs(index,index,V[index]) || recursive(index+1);\n}\n\nvoid func(){\n\n\tV.clear();\n\n\tint tmp;\n\n\tfor(int loop = 0; loop < N; loop++){\n\n\t\tscanf(\"%d\",&tmp);\n\t\tV.push_back(tmp);\n\t}\n\n\tif(N == 1){\n\t\tprintf(\"YES\\n\");\n\t\treturn;\n\t}\n\n\tsort(V.rbegin(),V.rend());\n\n\tcheck[0] = true;\n\tfor(int i = 1; i < N; i++){\n\n\t\tcheck[i] = false;\n\t}\n\n\tif(recursive(0)){\n\n\t\tprintf(\"YES\\n\");\n\t}else{\n\n\t\tprintf(\"NO\\n\");\n\t}\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": 40,
"memory_kb": 3072,
"score_of_the_acc": -0.9193,
"final_rank": 12
},
{
"submission_id": "aoj_0182_2389393",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\n\nbool dfs(int i);\nint n,a[50];\nbool fil[50];\n\nbool dfs2(int i,int j,int rem){\n if(rem==0) return dfs(i+1);\n if(j==n) return false;\n\n if(!fil[j] && a[j]<=rem){\n fil[j]=true;\n if(dfs2(i,j+1,rem-a[j])) return true;\n fil[j]=false;\n }\n return dfs2(i,j+1,rem);\n}\n\nbool dfs(int i){\n if(i==n) return true;\n if(!fil[i]) return false;\n return dfs2(i,i+1,a[i]) || dfs(i+1);\n}\n\nint main(){\n for(;scanf(\"%d\",&n),n;){\n rep(i,n){\n scanf(\"%d\",a+i);\n fil[i]=false;\n }\n sort(a,a+n,greater<int>());\n fil[0]=true;\n puts(dfs(0)?\"YES\":\"NO\");\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3068,
"score_of_the_acc": -0.9176,
"final_rank": 11
},
{
"submission_id": "aoj_0182_2078200",
"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\nbool getans(vector<int>&used, vector<int>&vs, int rest) {\n\tif (rest) {\n\t\tbool flag = false;\n\t\tfor (int i = 0; i < used.size(); ++i) {\n\t\t\tif (used[i] == 0) {\n\t\t\t\tused[i] = 2;\n\t\t\t\tif (rest >= vs[i]) {\n\n\t\t\t\t\tif (getans(used, vs, rest - vs[i])) {\n\t\t\t\t\t\tused[i] = 0;\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tused[i] = 0;\n\t\t\t\tif (!flag)return false;\n\t\t\t}\n\t\t\telse if(used[i]==2){\n\t\t\t\tflag = true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\telse {\n\t\tif (all_of(used.begin(), used.end(), [](const int n) {return n; })) {\n\t\t\treturn true;\n\t\t}\n\t\tbool flag = false;\n\t\tfor (int i = 0; i < used.size(); ++i) {\n\t\t\tif (used[i] == 2) {\n\t\t\t\tused[i] = 1;\n\t\t\t\tbool ok=getans(used, vs, vs[i]);\n\t\t\t\tused[i] = 2;\n\t\t\t\tif (ok)return true;\n\t\t\t}\n\t\t\telse if (used[i] == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n}\nint main() {\n\twhile (1) {\n\t\tint N; cin >> N;\n\t\tif (!N)break;\n\t\tvector<int>vs(N),used(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> vs[i];\n\t\t}\n\t\tsort(vs.begin(), vs.end(), greater<int>());\n\t\tused[0] = 2;\n\t\tbool ans = getans(used,vs, 0);\n\t\tif (ans)cout << \"YES\" << endl;\n\t\telse cout << \"NO\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 420,
"memory_kb": 3120,
"score_of_the_acc": -1.3978,
"final_rank": 17
},
{
"submission_id": "aoj_0182_1565660",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint n;\nint a[50];\nbool b[50];\n\nbool pourAll(int p);\n\nbool pour(int p, int q, int rest) {\n if (!rest) {\n return pourAll(p+1);\n }\n if (q == n) {\n return false;\n }\n if (!b[q] && a[q] <= rest) {\n b[q] = true;\n if (pour(p, q+1, rest-a[q])) {\n return true;\n }\n b[q] = false;\n }\n return pour(p, q+1, rest);\n}\n\nbool pourAll(int p) {\n if (p == n) {\n return true;\n }\n if (!b[p]) {\n return false;\n }\n if (pour(p, p+1, a[p])) {\n return true;\n }\n return pourAll(p+1);\n}\n\nbool solve() {\n sort(a, a+n, greater<int>());\n b[0] = true;\n for (int i=1; i<n; i++) {\n b[i] = false;\n }\n\n return pourAll(0);\n}\n\nint main() {\n bool ans;\n while (1) {\n cin >> n;\n if (!n) {\n break;\n }\n for (int i=0; i<n; i++) {\n cin >> a[i];\n }\n ans = solve();\n cout << (ans ? \"YES\" : \"NO\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1172,
"score_of_the_acc": -0.1273,
"final_rank": 1
},
{
"submission_id": "aoj_0182_1390754",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nbool ans;\nvector<int> b;\nvoid mainDFS(int x,vector<int> &c);\n\nvoid subSolve(int x,int r,vector<int> &c,int X){\n\t//?????????\n\tif( ans ) return;\n\t\n\t//???????????§??\\?????????\n\tif( x == n ){\n\t\tif( r == 0 ){\n\t\t\tmainDFS(X+1,c);\n\t\t}\n\t\treturn;\n\t}\n\t//????????????????????????\n\tif( c[x] == 0 && b[x] <= r ){\n\t\tc[x] = b[x];\n\t\tsubSolve(x+1,r-b[x],c,X);\n\t\tc[x] = 0;\n\t}\n\t//???????????????\n\tsubSolve(x+1,r,c,X);\n}\n\nvoid mainDFS(int x,vector<int> &c){\n\tif( x == n ){ ans = 1; return; }\n\t//?????????\n\tif( ans ) return;\n\tif( c[x] == 0 ){ return; }\n\telse{\n\t\t// ?¬??????????????????????????????¶????????????\n\t\tif( x + 1 < n && c[x+1] == 0 ){\n\t\t\tc[x+1] = b[x+1];\n\t\t\tsubSolve(x+2,c[x]-b[x+1],c,x);\n\t\t\tc[x+1] = 0;\n\t\t}else{\n\t\t\t//???????????????\n\t\t\tmainDFS(x+1,c);\n\t\t\t//??\\????????????\n\t\t\tsubSolve(x+1,c[x],c,x);\n\t\t}\t\t\n\t}\n}\nint main(){\n\twhile( cin >> n && n ){\n\t\tb = vector<int>(n);\n\t\tfor(int i = 0 ; i < n ; i++) cin >> b[i];\n\t\tsort(b.rbegin(),b.rend());\n\t\tvector<int> s(n,0);\n\t\ts[0] = b[0];\n\t\tans = 0;\n\t\tmainDFS(0,s);\n\t\tif(ans) cout << \"YES\" << endl;\n\t\telse cout << \"NO\" << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 1192,
"score_of_the_acc": -0.3527,
"final_rank": 9
},
{
"submission_id": "aoj_0182_1154722",
"code_snippet": "#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 <deque>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n//#include <cctype>\n#include <cstring>\n//#include <ctime>\n#include <iterator>\n#include <bitset>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <tuple>\n#include <initializer_list>\n#include <unordered_set>\n#include <unordered_map>\n#include <forward_list>\n\n#define cauto const auto&\n#else\n\n#endif\n\nusing namespace std;\n\n\nnamespace{\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\nint n;\nvint v;\nvint tt;\nvint used;\nbool f=false;\nint cnt=0;\nint foo(int x);\nint foo2(int c,int x,int y){\n\tif(c==0){\n\t\treturn foo(x+1);\n\t}\n\tif(y>=n){\n\t\treturn 0;\n\t}\n\tint ret=0;\n\treep(i,y,n){\n\t\tif(v[i]<=c&&used[i]==0){\n\t\t\tused[i]=1;\n\t\t\t++cnt;\n\t\t\tif(foo2(c-v[i],x,i+1)&&cnt==n){\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tused[i]=0;\n\t\t\t--cnt;\n\t\t}\n\t}\n\treturn 0;\n}\nint foo(int x){\n\tif(x==n){\n\t\treturn 1;\n\t}\n\tif(used[x]==0) return 0;\n\tif(used[x]==2) return foo(x+1);\n\tint ret=0;\n\tused[x]=2;\n\tif(foo2(v[x],x,x+1)) return 1;\n\tused[x]=1;\n\treturn foo(x+1);\n}\nvoid mainmain(){\n\twhile(cin>>n,n){\n\t\tv=vint(n);\n\t\trep(i,n){\n\t\t\tcin>>v[i];\n\t\t}\n\t\tsort(ALL(v));\n\t\treverse(ALL(v));\n\t\ttt=vint(n,0);\n\t\tused=vint(n,0);\n\t\t// rep(i,n) cout<<used[i]<<\" \";\n\t\t// cout<<endl;\n\t\tused[0]=1;\n\t\ttt[0]=v[0];\n\t\tcnt=1;\n\t\tif(foo(0)) cout<<\"YES\\n\";\n\t\telse cout<<\"NO\\n\";\n\t}\n}\n\n\n\n}\nmain() try{\n mainmain();\n}\ncatch(...){\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1180,
"score_of_the_acc": -0.1307,
"final_rank": 2
},
{
"submission_id": "aoj_0182_1154721",
"code_snippet": "#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 <deque>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n//#include <cctype>\n#include <cstring>\n//#include <ctime>\n#include <iterator>\n#include <bitset>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <tuple>\n#include <initializer_list>\n#include <unordered_set>\n#include <unordered_map>\n#include <forward_list>\n\n#define cauto const auto&\n#else\n\n#endif\n\nusing namespace std;\n\n\nnamespace{\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\nint n;\nvint v;\nvint tt;\nvint used;\nbool f=false;\nint cnt=0;\nint foo(int x);\nint foo2(int c,int x,int y){\n\tif(c==0){\n\t\treturn foo(x+1);\n\t}\n\tif(y>=n){\n\t\treturn 0;\n\t}\n\tint ret=0;\n\tif(v[y]<=c&&used[y]==0){\n\t\tused[y]=1;\n\t\t++cnt;\n\t\tif(foo2(c-v[y],x,y+1)&&cnt==n){\n\t\t\treturn 1;\n\t\t}\n\t\tused[y]=0;\n\t\t--cnt;\n\t}\n\treturn foo2(c,x,y+1);\n}\nint foo(int x){\n\tif(x==n){\n\t\treturn 1;\n\t}\n\tif(used[x]==0) return 0;\n\tif(used[x]==2) return foo(x+1);\n\tint ret=0;\n\tused[x]=2;\n\tif(foo2(v[x],x,x+1)) return 1;\n\tused[x]=1;\n\treturn foo(x+1);\n}\nvoid mainmain(){\n\twhile(cin>>n,n){\n\t\tv=vint(n);\n\t\trep(i,n){\n\t\t\tcin>>v[i];\n\t\t}\n\t\tsort(ALL(v));\n\t\treverse(ALL(v));\n\t\ttt=vint(n,0);\n\t\tused=vint(n,0);\n\t\t// rep(i,n) cout<<used[i]<<\" \";\n\t\t// cout<<endl;\n\t\tused[0]=1;\n\t\ttt[0]=v[0];\n\t\tcnt=1;\n\t\tif(foo(0)) cout<<\"YES\\n\";\n\t\telse cout<<\"NO\\n\";\n\t}\n}\n\n\n\n}\nmain() try{\n mainmain();\n}\ncatch(...){\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1180,
"score_of_the_acc": -0.1307,
"final_rank": 2
},
{
"submission_id": "aoj_0182_1154719",
"code_snippet": "#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 <deque>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n//#include <cctype>\n#include <cstring>\n//#include <ctime>\n#include <iterator>\n#include <bitset>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <tuple>\n#include <initializer_list>\n#include <unordered_set>\n#include <unordered_map>\n#include <forward_list>\n\n#define cauto const auto&\n#else\n\n#endif\n\nusing namespace std;\n\n\nnamespace{\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\nint n;\nvint v;\nvint tt;\nvint used;\nbool f=false;\nint cnt=0;\nint foo(int x);\nint foo2(int c,int x,int y){\n\tif(c==0){\n\t\treturn foo(x+1);\n\t}\n\tif(y>=n){\n\t\treturn 0;\n\t}\n\tint ret=0;\n\tif(v[y]<=c&&used[y]==0){\n\t\tused[y]=1;\n\t\tcnt++;\n\t\tif(foo2(c-v[y],x,y+1)&&cnt==n){\n\t\t\treturn 1;\n\t\t}\n\t\tused[y]=0;\n\t\tcnt--;\n\t}\n\t// reep(i,x+1,n){\n\t\t// if(used[i]==0&&c-v[i]>=0){\n\t\t\t// used[i]=1;\n\t\t\t// ret=max(ret,foo2(c-v[i],x));\n\t\t\t// if(ret) return ret;\n\t\t\t// used[i]=0;\n\t\t// }\n\t// }\n\treturn foo2(c,x,y+1);\n}\nint foo(int x){\n\t// cout<<\"x \"<<x<<endl;\n\t// rep(i,n){\n\t\t// cout<<used[i]<<\" \";\n\t// }\n\t// cout<<endl;\n\tif(x==n&&used[x-1]!=0){\n\t\t// cout<<\"**************\\n\";\n\t\t// f=true;\n\t\treturn 1;\n\t}\n\tif(used[x]==0) return 0;\n\tif(used[x]==2) return foo(x+1);\n\tint ret=0;\n\tused[x]=2;\n\tret=max(ret,foo2(v[x],x,x+1));\n\tif(ret) return ret;\n\tused[x]=1;\n\tret=max(ret,foo(x+1));\n\treturn ret;\n}\nvoid mainmain(){\n\twhile(cin>>n,n){\n\t\tv=vint(n);\n\t\trep(i,n){\n\t\t\tcin>>v[i];\n\t\t}\n\t\tsort(ALL(v));\n\t\treverse(ALL(v));\n\t\ttt=vint(n,0);\n\t\tused=vint(n,0);\n\t\t// rep(i,n) cout<<used[i]<<\" \";\n\t\t// cout<<endl;\n\t\tused[0]=1;\n\t\ttt[0]=v[0];\n\t\tcnt=1;\n\t\tif(foo(0)) cout<<\"YES\\n\";\n\t\telse cout<<\"NO\\n\";\n\t}\n}\n\n\n\n}\nmain() try{\n mainmain();\n}\ncatch(...){\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1184,
"score_of_the_acc": -0.1324,
"final_rank": 4
},
{
"submission_id": "aoj_0182_1136723",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint c[60];\nint v[60];\nint u[60];\nint n;\nint solve(int a,int b){\n\tif(b==0){\n\t\tbool ok=true;\n\t\tfor(int i=0;i<n;i++)if(!u[i]){ok=false;break;}\n\t\tif(ok)return 1;\n\t\tint at=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(v[i]){\n\t\t\t\tv[i]=0;\n\t\t\t\tint res=solve(0,c[i]);\n\t\t\t\tif(res)return 1;\n\t\t\t\tv[i]=1;\n\t\t\t}\n\t\t\tif(!u[i])break;\n\t\t}\n\t\treturn 0;\n\t}\n\tif(a==n)return 0;\n\tif(!u[a]&&b>=c[a]){\n\t\tu[a]=v[a]=1;\n\t\tif(solve(a+1,b-c[a]))return 1;\n\t\tu[a]=v[a]=0;\n\t}\n\tint rem=0;\n\tfor(int i=a+1;i<n;i++)if(b>=c[i]&&!u[i])rem+=c[i];\n\tif(rem<b)return 0;\n\treturn solve(a+1,b);\n}\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tn=a;\n\t\tfor(int i=0;i<a;i++)scanf(\"%d\",c+i);\n\t\tfor(int i=0;i<a;i++)c[i]=-c[i];\n\t\tstd::sort(c,c+a);\n\t\tfor(int i=0;i<a;i++)c[i]=-c[i];\n\t\tfor(int i=0;i<a;i++)v[i]=u[i]=0;\n\t\tv[0]=u[0]=1;\n\t\tif(solve(0,0))printf(\"YES\\n\");\n\t\telse printf(\"NO\\n\");\n\t}\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 1016,
"score_of_the_acc": -0.1807,
"final_rank": 7
},
{
"submission_id": "aoj_0182_1119241",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint n;\nint beaker[128];\nbool filled[128];\nbool used[128];\n\nbool check();\n\nbool pour(int vol, int indx) {\n\tif(vol == 0)\n\t\treturn true;\n\tif(vol < 0)\n\t\treturn false;\n\tif(indx >= n)\n\t\treturn false;\n\n\tif(!filled[indx] && !used[indx] && beaker[indx] <= vol) {\n\t\tfilled[indx] = used[indx] = true;\n\t\tif(pour(vol - beaker[indx], indx + 1) && check())\n\t\t\treturn true;\n\t\tfilled[indx] = used[indx] = false;\n\t}\n\n\treturn pour(vol, indx + 1);\n}\n\nbool check() {\n\tfor(int i = 0; i < n; i++) {\n\t\tif(filled[i]) {\n\t\t\tfilled[i] = false;\n\t\t\tif(pour(beaker[i], i + 1))\n\t\t\t\treturn true;\n\t\t\tfilled[i] = true;\n\t\t}\n\t\telse if(!used[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main() {\n\twhile(cin >> n, n) {\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tcin >> beaker[i];\n\n\t\tsort(beaker, beaker + n, greater<int>());\n\t\tfor(int i = 0; i < 128; i++) {\n\t\t\tfilled[i] = used[i] = false;\n\t\t}\n\t\tfilled[0] = used[0] = true;\n\n\t\tif(check())\n\t\t\tcout << \"YES\" << endl;\n\t\telse\n\t\t\tcout << \"NO\" << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 1172,
"score_of_the_acc": -0.1754,
"final_rank": 6
},
{
"submission_id": "aoj_0182_1008453",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<bitset>\n#include<algorithm>\n#include<functional>\nusing namespace std;\n\nconst int N = 50;\n\nint n;\nvector<int> beaker;\nbitset<N> full;\nbitset<N> used;\n\nbool pour(int water, int start);\nbool check();\n\nbool pour(int water, int start) {\n for(int i = start; i < n; ++i) {\n if(used[i]) continue;\n\n if(water < beaker[i]) continue;\n else if(water == beaker[i]) {\n full.set(i);\n used.set(i);\n if(check()) return true;\n full.reset(i);\n used.reset(i);\n } else {\n full.set(i);\n used.set(i);\n if(pour(water - beaker[i], i + 1)) return true;\n full.reset(i);\n used.reset(i);\n }\n }\n return false;\n}\n\nbool check() {\n if(used.count() == n) return true;\n for(int i = 0; i < n; ++i) {\n if(!used[i] && !used[i]) return false;\n if(!full[i]) continue;\n full.reset(i);\n if(pour(beaker[i], i + 1)) return true;\n full.set(i);\n }\n return false;\n}\n\nint main() {\n while(cin >> n, n) {\n beaker.resize(n);\n for(auto& b: beaker) cin >> b;\n sort(beaker.begin(), beaker.end(), greater<int>());\n full = bitset<N>(1);\n used = bitset<N>(1);\n cout << (check() ? \"YES\" : \"NO\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 1208,
"score_of_the_acc": -0.1909,
"final_rank": 8
},
{
"submission_id": "aoj_0182_779639",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <memory>\n#include <string>\n\n#include <algorithm>\n#include <complex>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n#include <bitset>\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\n#define strtok_r strtok_s\n#endif\n\n#define ITER(c) __typeof__((c).begin())\n#define FOREACH(it, c) for (ITER(c) it=(c).begin(); it != (c).end(); ++it)\n#define RITER(c) __typeof__((c).rbegin())\n#define RFOREACH(it, c) for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)\n#define REP(i, n) REPEAT(i, 0, n)\n#define RREP(i, n) RREPEAT(i, 0, n)\n#define REPEAT(i, k, n) for(int i = (k); i < ((k)+(n)); ++i)\n#define RREPEAT(i, k, n) for(int i = (k)+(n)-1; i >= (k); --i)\n#define FROMTO(i,f,t) for(int i = f; i < t; i++)\n#define ALL(c) (c).begin(), (c).end()\n#define LLPOW(p1,p2) ((ll)pow((double)(p1), (int)p2))\n#define ESIZEOF(A) (sizeof(A)/sizeof((A)[0]))\n#define CIN_NO_SYNC do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)\n#define GETSTR(p) fgets((p), sizeof(p), stdin)\n#define CHOMP(p) do{ char *_q = (p) + strlen(p)-1; if(*_q == '\\n' || *_q == '\\r') *_q = 0; } while(0)\n#define FILL(m,v) memset(m, v, sizeof(m))\n#define mp make_pair\n#define pb push_back\ntemplate<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} \ntemplate<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} \ntemplate <class _Tv> inline string join(const _Tv &v,string sep=\" \"){\n ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();\n}\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef double D;\ntypedef complex<D> P;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\n#define X real()\n#define Y imag()\n#define EPS (1e-9)\n#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)\n\n#ifdef _DEBUG\ntemplate<class _Tv> inline void _prfe(const char *_n,const _Tv _c,bool _p=false){\n ITER(_c) _it=_c.begin();\n if(_p){cout<<_n<<\" = [\"<<endl;for(;_it!=_c.end();++_it)cout<<\" \"<<*_it<<endl;cout<<\"]\"<<endl; }\n else{cout<<_n<<\" = [ \";if(_c.size()){cout<<*_it++;for(;_it!=_c.end();++_it)cout<<\", \"<<*_it;}cout<<\" ]\"<<endl; }\n}\nostream &operator<<(ostream &os, const pair<int,int> &p){return(os<<\"(\"<<p.first<<\",\"<<p.second<<\")\");}\n#define pf printf\n#define pr(n) do{cout<<#n\" = \"<<(n)<<endl;}while(0)\n#define prfe(n) _prfe(#n, n)\n#define prfep(n) _prfe(#n, n, true)\n#define dbgchk(n) do{if(n)throw;}while(0)\n#else\n#define pf(...) /* */\n#define pr(...) /* */\n#define prfe(...) /* */\n#define prfep(...) /* */\n#define dbgchk(...) /* */\n#endif\n\nint n;\nint b[101], f[101];\nenum { EMPTY=0,FULL=1,USED=2 };\n\nvoid dbg(){\n pf(\"f = \"); REP(i,n) pf(\"%2d, \", f[i]); pf(\"\\n\");\n}\n\nbool move(int i, int v, int n_empty);\nbool rec(int n_empty){\n if(n_empty == 0) return true;\n REP(i,n){\n if(f[i] == EMPTY) break;\n if(f[i] == FULL){\n f[i] = USED; dbg();\n if(move(i+1, b[i], n_empty)) return true;\n f[i] = FULL; dbg();\n }\n }\n return false;\n}\nbool move(int i, int v, int n_empty){\n if(v == 0) return rec(n_empty);\n FROMTO(j, i, n){\n if(f[j] != EMPTY) continue;\n if(v < b[j]) continue;\n f[j] = FULL; dbg();\n if(move(j+1, v-b[j], n_empty-1)) return true;\n if(i == j && f[j] == EMPTY) break;\n f[j] = EMPTY; dbg();\n }\n return false;\n}\n\nbool solve(){\n sort(b, b+n, greater<int>());\n pf(\"b = \"); REP(i,n) pf(\"%2d, \", b[i]); pf(\"\\n\");\n REP(i,n) f[i] = EMPTY;\n f[0] = FULL; dbg();\n return rec(n-1);\n}\n\nint main(){\n while(cin >> n && n){\n REP(i,n) cin >> b[i];\n cout << (solve()?\"YES\":\"NO\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 1176,
"score_of_the_acc": -0.1531,
"final_rank": 5
}
] |
aoj_0184_cpp
|
鶴ヶ城
会津若松市のシンボルである鶴ヶ城は、蒲生氏郷が本格的な天守閣を築城し、「鶴ヶ城」と名付けました。天守閣からは会津盆地が一望できます。また、晴れた日には、白虎隊で有名な飯盛山の山頂から鶴ヶ城を見ることができます。
会津若松市の今後の広報活動の参考にするため、鶴ヶ城に訪れた来場者について、年代調査をすることにしました。来場者の年齢を入力とし、下記の年齢区分別に人数を出力するプログラムを作成してください。
区分
年齢
10歳未満
0 ~ 9
10代
10 ~ 19
20代
20 ~ 29
30代
30 ~ 39
40代
40 ~ 49
50代
50 ~ 59
60歳以上
60 ~
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
a
1
a
2
:
a
n
1 行目に来場者の人数
n
(1 ≤
n
≤ 1000000)、続く
n
行に
i
人目の来場者の年齢
a
i
( 0 ≤
a
i
≤ 120 ) が与えられます。
Output
データセット毎に以下の形式で人数を出力します。
1 行目: 10 歳未満の人数
2 行目: 10 代の人数
3 行目: 20 代の人数
4 行目: 30 代の人数
5 行目: 40 代の人数
6 行目: 50 代の人数
7 行目: 60 歳以上の人数
Sample Input
8
71
34
65
11
41
39
6
5
4
67
81
78
65
0
Output for the Sample Input
2
1
0
2
1
0
2
0
0
0
0
0
0
4
|
[
{
"submission_id": "aoj_0184_9184995",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, a;\n cin >> n;\n if (n == 0) return 1;\n vi cnt(7, 0);\n rep(n) {\n cin >> a;\n cnt[min(a/10, 6LL)]++;\n }\n rep(i, len(cnt)) print(cnt[i]);\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3220,
"score_of_the_acc": -0.1262,
"final_rank": 4
},
{
"submission_id": "aoj_0184_8125550",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n while (cin >> n, n) {\n vector<int> v(7);\n for (int i = 0; i < n; ++i) {\n int a; cin >> a;\n if (a >= 60) v.back() += 1;\n else v[a/10] += 1;\n }\n for (int i = 0; i < 7; ++i) {\n cout << v[i] << \"\\n\";\n }\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3144,
"score_of_the_acc": -0.1085,
"final_rank": 3
},
{
"submission_id": "aoj_0184_7402992",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n, a, sum[11];\n while(cin >> n, n!=0){\n memset(sum, 0, sizeof(sum));\n for(int i=0;i<n;i++){\n cin >> a;\n if(a>=60) sum[6]++;\n else sum[a/10]++;\n }\n for(int i=0;i<7;i++) cout << sum[i] << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 2980,
"score_of_the_acc": -0.7372,
"final_rank": 9
},
{
"submission_id": "aoj_0184_6958402",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n while(cin >> n, n){\n int v;\n vector<int> cnt(7);\n while(n--){\n cin >> v;\n cnt[min(6, v / 10)]++;\n }\n for(auto v:cnt)cout << v << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3344,
"score_of_the_acc": -0.5716,
"final_rank": 7
},
{
"submission_id": "aoj_0184_6809120",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n int N;\n cin >> N;\n if(N == 0) break;\n vector<int> ans(7,0);\n for(int i=0;i<N;i++){\n int a;\n cin >> a;\n if(a <= 9) ans[0]++;\n else if(a <= 19) ans[1]++;\n else if(a <= 29) ans[2]++;\n else if(a <= 39) ans[3]++;\n else if(a <= 49) ans[4]++;\n else if(a <= 59) ans[5]++;\n else ans[6]++;\n }\n for(int i=0;i<7;i++) cout << ans[i] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3168,
"score_of_the_acc": -0.5308,
"final_rank": 5
},
{
"submission_id": "aoj_0184_5761112",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<sstream>\n#include<regex>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-10;\nsigned main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tint a,c1=0,c2=0,c3=0,c4=0,c5=0,c6=0,c7=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>a;\n\t\t\tif(a<10)\n\t\t\t\tc1++;\n\t\t\telse if(a<20)\n\t\t\t\tc2++;\n\t\t\telse if(a<30)\n\t\t\t\tc3++;\n\t\t\telse if(a<40)\n\t\t\t\tc4++;\n\t\t\telse if(a<50)\n\t\t\t\tc5++;\n\t\t\telse if(a<60)\n\t\t\t\tc6++;\n\t\t\telse\n\t\t\t\tc7++;\n\t\t}\n\t\tcout<<c1<<endl<<c2<<endl<<c3<<endl<<c4<<endl<<c5<<endl<<c6<<endl<<c7<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3364,
"score_of_the_acc": -0.5762,
"final_rank": 8
},
{
"submission_id": "aoj_0184_5201485",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\nint main() {\n\tint n;\n\twhile (cin >> n, n) {\n\t\tint cnt[7]{};\n\t\trep(i, n) {\n\t\t\tint d; cin >> d;\n\t\t\tif (d >= 60)cnt[6]++;\n\t\t\telse cnt[d / 10]++;\n\t\t}rep(i, 7)cout << cnt[i] << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3048,
"score_of_the_acc": -0.7529,
"final_rank": 11
},
{
"submission_id": "aoj_0184_5188011",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<int> ans(7, 0);\n for(int i=0; i<n; i++){\n int a;\n cin >> a;\n ans[min(a/10, 6)]++;\n }\n for(int i: ans){\n cout << i << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3288,
"score_of_the_acc": -0.5586,
"final_rank": 6
},
{
"submission_id": "aoj_0184_4619810",
"code_snippet": "#include <iostream>\n\nint getIndex(int age)\n{\n\tif (age<10) return 0;\n\telse if (age<20) return 1;\n\telse if (age<30) return 2;\n\telse if (age<40) return 3;\n\telse if (age<50) return 4;\n\telse if (age<60) return 5;\n\telse return 6;\n}\n\nint main()\n{\n\tint n;\n\twhile (true) {\n\t\tstd::cin >> n;\n\t\tif (n == 0) break;\n\t\tint a[7] = {0,0,0,0,0,0,0};\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tint age;\n\t\t\tstd::cin >> age;\n\t\t\ta[getIndex(age)]++;\n\t\t}\n\t\tfor (int i=0; i<7; i++) std::cout << a[i] << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 2996,
"score_of_the_acc": -0.8242,
"final_rank": 15
},
{
"submission_id": "aoj_0184_4575312",
"code_snippet": "#include <cstdio>\n#include <string>\n#include <algorithm>\nusing namespace std;\nint main() {\n int n, t;\n int arr[7];\n for (; ;) {\n scanf(\"%d\", &n);\n if (n == 0) break;\n fill(arr, arr+7, 0);\n for (int i = 0; i < n; i++) {\n scanf(\"%d\", &t);\n t/=10;\n if (t >= 6) arr[6]++;\n else arr[t]++;\n }\n for (int i = 0; i<= 6; i++) printf(\"%d\\n\", arr[i]);\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 2676,
"score_of_the_acc": -0.0833,
"final_rank": 1
},
{
"submission_id": "aoj_0184_4442051",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n;\n while(cin >> n, n){\n vector<int> a{10, 20, 30, 40, 50, 60, 200};\n vector<int> v(n);\n vector<int> cnt(7);\n for (auto &&i : v) {\n scanf(\"%d\", &i);\n for (int j = 0; j < 7; ++j) {\n if(i < a[j]){\n cnt[j]++;\n break;\n }\n }\n }\n for (int i = 0; i < 7; ++i) {\n cout << cnt[i] << \"\\n\";\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 6748,
"score_of_the_acc": -1.111,
"final_rank": 18
},
{
"submission_id": "aoj_0184_4065939",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint Result[7];\n\nint main() {\n\tint n, age;\n\n\twhile (cin >> n, n) {\n\t\tmemset(Result, 0, sizeof(Result));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> age;\n\n\t\t\tage /= 10;\n\t\t\tif (age > 6) {\n\t\t\t\tage = 6;\n\t\t\t}\n\t\t\tResult[age]++;\n\t\t}\n\n\t\tfor (int i = 0; i < 7; i++) {\n\t\t\tcout << Result[i] << endl;\n\t\t}\n\t}\n\t\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3088,
"score_of_the_acc": -0.7622,
"final_rank": 13
},
{
"submission_id": "aoj_0184_4065936",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint Result[7];\n\n\n\nint main() {\n\tint n, age;\n\n\twhile (cin >> n, n) {\n\t\tmemset(Result, 0, sizeof(Result));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> age;\n\t\t\tif (age < 10) {\n\t\t\t\tResult[0]++;\n\t\t\t}\n\t\t\telse if (age < 20) {\n\t\t\t\tResult[1]++;\n\t\t\t}\n\t\t\telse if (age < 30) {\n\t\t\t\tResult[2]++;\n\t\t\t}\n\t\t\telse if (age < 40) {\n\t\t\t\tResult[3]++;\n\t\t\t}\n\t\t\telse if (age < 50) {\n\t\t\t\tResult[4]++;\n\t\t\t}\n\t\t\telse if (age < 60) {\n\t\t\t\tResult[5]++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tResult[6]++;\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < 7; i++) {\n\t\t\tcout << Result[i] << endl;\n\t\t}\n\t}\n\t\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 2996,
"score_of_the_acc": -0.7409,
"final_rank": 10
},
{
"submission_id": "aoj_0184_4028154",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int n,a,count1,count10,count20,count30,count40,count50,count60;\n count1=0;\n count10=0;\n count20=0;\n count30=0;\n count40=0;\n count50=0;\n count60=0;\n while (cin>>n) {\n if (n==0) {\n break;\n } else {\n for (int i=0;i<n;i++) {\n cin>>a;\n if (a<10) {\n count1++;\n } else if (a>=10&&a<20) {\n count10++;\n } else if (a>=20&&a<30) {\n count20++;\n } else if (a>=30&&a<40) {\n count30++;\n } else if (a>=40&&a<50) {\n count40++;\n } else if (a>=50&&a<60) {\n count50++;\n } else if (a>=60) {\n count60++;\n }\n }\n }\n cout<<count1<<endl;\n cout<<count10<<endl;\n cout<<count20<<endl;\n cout<<count30<<endl;\n cout<<count40<<endl;\n cout<<count50<<endl;\n cout<<count60<<endl;\n count1=0;\n count10=0;\n count20=0;\n count30=0;\n count40=0;\n count50=0;\n count60=0;\n }\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3088,
"score_of_the_acc": -0.7622,
"final_rank": 13
},
{
"submission_id": "aoj_0184_3873220",
"code_snippet": "#include <iostream>\n#include <string.h>\nusing namespace std;\n\nint n;\nint p[7];\n\nint main()\n{\n\tcin >> n;\n\n\twhile (n) {\n\t\tmemset(p, 0, sizeof(p));\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint a;\n\t\t\tcin >> a;\n\n\t\t\ta /= 10;\n\n\t\t\tif (a > 5)\n\t\t\t\tp[6]++;\n\t\t\telse\n\t\t\t\tp[a]++;\n\t\t}\n\n\t\tfor (int i = 0; i < 7; i++)\n\t\t\tcout << p[i] << endl;\n\n\t\tcin >> n;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3000,
"score_of_the_acc": -0.8251,
"final_rank": 16
},
{
"submission_id": "aoj_0184_3791221",
"code_snippet": "#include<iostream>\nusing namespace std;\nint t[7],n,a;\nint main(void){\n while(cin>>n&&n){\n for(int i=0;i<7;i++)t[i]=0;\n for(int i=0;i<n;i++){\n cin>>a;\n for(int j=0;j<7;j++){\n if(j*10<=a&&a<=j*10+9){\n t[j]++;\n break;\n }\n if(j==6)t[6]++;\n }\n }\n for(int i=0;i<7;i++){\n cout<<t[i]<<endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3104,
"score_of_the_acc": -1.0993,
"final_rank": 17
},
{
"submission_id": "aoj_0184_3701781",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <vector>\n#include <utility>\n#include <cstring>\n#include <iomanip>\n#include <numeric>\n#include <limits>\n#include <cmath>\n#include <cassert>\n#include <map>\nusing namespace std;\nusing ll = long long;\n\nconst int INF = 1<<30;\nconst int MOD = (int)1e9 + 7;\nconst int MAX_N = (int)1e5 + 5;\n#define debug(x) cout << #x << \": \" << x << endl\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n while(cin >> n, n)\n {\n vector<int> cnt(7, 0);\n for(int i = 0; i < n; i++)\n {\n int x; cin >> x;\n bool flag = false;\n for(int age = 10; age <= 60; age += 10)\n {\n if(x < age)\n {\n cnt[age / 10 - 1]++;\n flag = true;\n break;\n }\n }\n if(flag == false) cnt[6]++;\n }\n for(int i = 0; i < 7; i++) cout << cnt[i] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3128,
"score_of_the_acc": -0.1048,
"final_rank": 2
},
{
"submission_id": "aoj_0184_3658407",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(void){\n#define MAX 1001000\n int n; //来場者数\n int a[MAX]; //来場者の年齢\n\n while(true){\n cin >> n;\n if(n == 0) break;\n\n for(int i = 0; i < n; i++)\n cin >> a[i];\n \n int c0 = 0, c1 = 0, c2 = 0, c3 = 0, c4 = 0, c5 = 0, c6 = 0;\n //10代未満の人数、10代の人数、20代の人数、30代の人数、40代の人数、50代の人数、60歳以上の人数\n for(int i = 0; i < n; i++){\n if(a[i] < 10) \n c0++;\n else if(10 <= a[i] && a[i] < 20)\n c1++;\n else if(20 <= a[i] && a[i] < 30)\n c2++;\n else if(30 <= a[i] && a[i] < 40)\n c3++;\n else if(40 <= a[i] && a[i] < 50)\n c4++;\n else if(50 <= a[i] && a[i] < 60)\n c5++;\n else\n c6++;\n }\n cout << c0 << endl;\n cout << c1 << endl;\n cout << c2 << endl;\n cout << c3 << endl;\n cout << c4 << endl;\n cout << c5 << endl;\n cout << c6 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 6988,
"score_of_the_acc": -1.6667,
"final_rank": 20
},
{
"submission_id": "aoj_0184_3436421",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i, n) for(int i=0; i<(n); ++i)\n#define FOR(i, m, n) for(int i=(m); i<(n); ++i)\n#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define Cout(x) cout << (x) << endl\n#define Cout2(x, y) cout << (x) << \" \" << (y) << endl\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define forauto(i, a) for(auto i : a)cout << i << \" \"; puts(\"\");\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef vector<LL> VL;\ntypedef vector<string> VS;\ntypedef vector<bool> VB;\ntypedef vector<vector<int>> VVI;\ntypedef pair<int, int> PII;\nconst int inf = 1e9;\nconst double pi = acos(-1.0);\n\nint main() {\n\tint n;\n\twhile (cin >> n && n) {\n\t\tVI a(n); rep(i, n)cin >> a[i];\n\t\tVI data(9);\n\n\t\trep(i, n) {\n\t\t\tint x;\n\t\t\tif (a[i] < 10)x = 0;\n\t\t\telse if (a[i] < 20)x = 1;\n\t\t\telse if (a[i] < 30)x = 2;\n\t\t\telse if (a[i] < 40)x = 3;\n\t\t\telse if (a[i] < 50)x = 4;\n\t\t\telse if (a[i] < 60)x = 5;\n\t\t\telse x = 6;\n\n\t\t\tdata[x]++;\n\t\t}\n\n\t\trep(i, 7)cout << data[i] << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 6684,
"score_of_the_acc": -1.5962,
"final_rank": 19
},
{
"submission_id": "aoj_0184_3332601",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int n, d, a[13];\n\n while( cin >> n )\n {\n if( n == 0 )\n break;\n\n for( int i = 0; i < 13; i++ )\n a[i] = 0;\n\n for( int i = 0; i < n; i++ )\n {\n cin >> d;\n a[d/10]++;\n }\n\n for( int i = 0; i < 6; i++ )\n cout << a[i] << endl;\n\n int sum = 0;\n for( int i = 6; i < 13; i++ )\n sum += a[i];\n \n cout << sum << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3080,
"score_of_the_acc": -0.7604,
"final_rank": 12
}
] |
aoj_0193_cpp
|
コンビニ
コンビニエンスストア・デブンイレブンは事業を広げるため若松市に一店舗目をオープンしようと考えています。若松市には既に他のたくさんのコンビニエンスストアがあるので、新店舗をオープンする場所が成功の鍵を握ることになりそうです。デブンイレブンは「お客さんは自分の住んでいる地域から最も近いコンビニを利用する」という前提の下、「多くのお客さんが利用するであろう地点」に出店することにしています。
デブンイレブンは、既設の各コンビニがカバーしている範囲を把握するため、若松市の地図を合同な正六角形(以後「ブロック」)を用いて区分しました。このとき、各ブロックには既設のコンビニが多くとも一つだけ入るように区分しました。この地図上で、各ブロックからあるコンビニへ行くのに経由するブロックの数をもとにコンビニとの距離を求めます。各ブロックはこの距離が最も小さいコンビニによってカバーされていると考えます。問題は、この地図をもとに「できるだけ多くのブロックをカバーする既設のコンビニがないブロック」を探すことです。
デブンイレブンのプログラマであるあなたは、ブロック分けされた地図情報と新店舗の候補地の情報から、最も広くカバーできるブロック数を計算するプログラムを開発することになりました。
m × n
に区分した地図は図1のように表します。六角形のブロックが横に
m
個、縦に
n
個並び、それぞれは一つの座標(
x, y
)で示されます。奇数行の左端はその上の行の左端の左下に、偶数行の左端はその上の行の左端の右下に、それぞれ位置します。例えば、座標(1, 1)は図1の一番左上のブロックを示します。また、座標(1, 2)は座標(1, 1)の右下に位置し、座標(1, 3)は座標(1, 2)の左下に位置します。
図2は既設のコンビニが6個あった場合の例で、6 × 6 に区分されています。各コンビニは1から順に番号が振られています。このとき、各コンビニがカバーするブロックを番号毎に塗り分けると図3のようになります。座標(1, 4)や(2, 5)のように塗られていないブロックは最も近いコンビニが二つ以上あり、どちらとも判断がつかないブロックになっています。例えば、座標(1, 4)のブロックの場合、番号4のコンビニと番号5のコンビニへの距離が等しく、このブロックをカバーしているコンビニはないものとして考えます。番号4のコンビニがカバーしているブロック数は5となります。
ここで、デブンイレブンが座標(1, 3)と座標(5, 3)を新店舗の候補地として考えているとします。座標(1, 3)に店舗を構えた場合、カバーできるブロック数は3となります(図4)。一方、座標(5, 3)に店舗を構えた場合にカバーできるブロック数は4となります(図5)。したがって、最も広くカバーできるブロック数は4となります。
地図情報
m × n
、既設のコンビニの数
s
とその座標(
x, y
)、候補地の数
t
とその座標(
p, q
)を入力とし、全候補地の中で最も広くカバーできるブロック数を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。 各データセットは以下の形式で与えられます。
m
n
s
x
1
y
1
x
2
y
2
:
x
s
y
s
t
p
1
q
1
p
2
q
2
:
p
t
q
t
1 行目に区分した地図の大きさ(横、縦)を表す整数
m
,
n
(2 ≤
m, n
≤ 100) が与えられます。
2行目に既設のコンビニの数
s
(1 ≤
s
≤ 10) が与えられます。続く
s
行に、
i
個目の既設のコンビニの座標
x
i
,
y
1
が与えられます。
続く行に、新店舗の候補地の数
t
(1 ≤
t
≤ 10 ) が与えられます。続く
t
行に、
i
個目の候補地の座標
p
i
,
q
i
が与えられます。
データセットの数は 20 を超えません。
Output
データセット毎に、全候補地の中で最も広くカバーできるブロック数を１行に出力します。
Sample Input
6 6
6
1 1
6 1
3 2
3 5
1 6
5 6
2
1 3
5 3
6 6
6
3 2
3 5
6 1
1 1
1 6
5 6
2
2 3
5 3
0 0
Output for the Sample Input
4
4
|
[
{
"submission_id": "aoj_0193_2070183",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <queue>\nusing namespace std;\n\n#define INF 1010001000\n\ntypedef pair<int, int> i_i;\ntypedef long long int ll;\n\nint n, m;\nint dom[6] = {1, 1, 1, 0, -1, 0};\nint don[6] = {-1, 0, 1, -1, 0, 1};\nint dem[6] = {-1, -1, -1, 0, 1, 0};\nint den[6] = {-1, 0, 1, -1, 0, 1};\n\nint bfs(int x, int y, vector<vector<int> > &g, vector<vector<bool> > &pos);\nint solve(int x,int y, vector<vector<int> > &g, vector<vector<bool> > &pos);\n\nint main()\n{\n while (cin >> m >> n, (n|m)) {\n int s, t;\n vector<vector<int> > g(n, vector<int>(m, 0));\n vector<vector<bool> > pos(n, vector<bool>(m, false));\n cin >> s;\n for (int i = 0; i < s; i++) {\n int x, y;\n cin >> x >> y;\n pos[y-1][x-1] = true;\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n //cout << \"===\" << i << j << \"===\" << endl;\n g[i][j] = bfs(i, j, g, pos);\n //cout << g[i][j];\n }\n //cout << endl;\n }\n cin >> t;\n int ans = -INF;\n for (int i = 0; i < t; i++) {\n int x, y;\n cin >> x >> y;\n ans = max(solve(y-1, x-1, g, pos), ans);\n }\n cout << ans << endl;\n }\n return 0;\n}\n\nint solve(int x, int y, vector<vector<int> > &g, vector<vector<bool> > &pos)\n{\n int ret = 0, dist = 0;\n vector<vector<bool> > ch(n, vector<bool>(m, false));\n queue<i_i> a, b, c;\n a.push(make_pair(x, y));\n while (!a.empty()) {\n while (!a.empty()) {\n i_i tmp = a.front(); a.pop();\n x = tmp.first; y = tmp.second;\n if (ch[x][y]) {\n continue;\n } else {\n ch[x][y] = true;\n }\n if (dist < g[x][y]) {\n ret++;\n for (int i = 0; i < 6; i++) {\n \tif (x % 2) {\n\t int nx = x + don[i];\n \t int ny = y + dom[i];\n \t if (0 <= nx && nx < n && 0 <= ny && ny < m) {\n \t b.push(make_pair(nx, ny));\n \t }\n \t} else {\n\t int nx = x + den[i];\n \t int ny = y + dem[i];\n \t if (0 <= nx && nx < n && 0 <= ny && ny < m) {\n \t b.push(make_pair(nx, ny));\n \t } \t\t\n \t}\n }\n }\n }\n a = b;\n b = c;\n dist++;\n }\n return ret;\n}\n\nint bfs(int x, int y, vector<vector<int> > &g, vector<vector<bool> > &pos)\n{\n int ret = 0;\n queue<i_i> a, b, c;\n vector<vector<bool> > ch(n, vector<bool>(m, false));\n a.push(make_pair(x, y));\n while (!a.empty()) {\n while (!a.empty()) {\n i_i tmp = a.front();\n a.pop();\n x = tmp.first;\n y = tmp.second;\n if (ch[x][y]) {\n continue;\n } else {\n ch[x][y] = true;\n }\n if (pos[x][y]) {\n return ret;\n } else {\n for (int i = 0; i < 6; i++) {\n \tif (x % 2) {\n \t int nx = x + don[i];\n \t int ny = y + dom[i];\n \t if (0 <= nx && nx < n && 0 <= ny && ny < m) {\n \t b.push(make_pair(nx, ny));\n \t}\n \t} else {\n \t int nx = x + den[i];\n \t int ny = y + dem[i];\n \t if (0 <= nx && nx < n && 0 <= ny && ny < m) {\n \t b.push(make_pair(nx, ny));\n \t}\n \t}\n }\n }\n }\n ret++;\n a = b;\n b = c;\n }\n return ret;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 3152,
"score_of_the_acc": -1.7817,
"final_rank": 12
},
{
"submission_id": "aoj_0193_1849549",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 110\n#define INF (1<<29)\ntypedef pair<int, int> pii;\n\nint d[11][MAX][MAX]; \n\nint get_max_block(int M, int N,\n vector<int> &x, vector<int> &y)\n{\n int s = x.size();\n vector<int> cnt(s, 0);\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < N; j++) {\n int mini = INF, mid = -1, c = -1;\n for (int k = 0; k < s; k++) {\n if (d[k][i][j] < mini) {\n mini = d[k][i][j];\n c = 1;\n mid = k;\n } else if (d[k][i][j] == mini) {\n c = -1;\n }\n }\n if (c == 1) {\n cnt[mid]++;\n }\n }\n } \n return cnt[s-1];\n}\n\nint get_dist(int sx, int sy, int gx, int gy, int M, int N)\n{\n queue<pii> Q;\n Q.push(pii(sx, sy));\n\n vector<vector<int>> md(MAX, vector<int>(MAX, INF));\n md[sy][sx] = 0;\n\n const int dx[2][6] = {\n {-1, +0, -1, +1, -1, +0},\n {+0, +1, -1, +1, +0, +1}\n };\n const int dy[6] = {-1, -1, +0, +0, +1, +1};\n \n while (!Q.empty()) {\n pii p = Q.front(); Q.pop();\n int x = p.first, y = p.second;\n if (x == gx && y == gy) {\n return md[y][x];\n }\n\n for (int i = 0; i < 6; i++) {\n int nx = x + dx[y&1][i];\n int ny = y + dy[i];\n\n if (0 <= nx && nx < M && 0 <= ny && ny < N) {\n if (md[y][x] + 1 < md[ny][nx]) {\n md[ny][nx] = md[y][x] + 1;\n Q.push(pii(nx, ny));\n }\n }\n } \n }\n return INF;\n}\n\nint main()\n{\n int M, N, s, t;\n while (cin >> M >> N, M) {\n cin >> s;\n vector<int> x(s), y(s);\n for (int i = 0; i < s; i++) {\n cin >> x[i] >> y[i];\n x[i]--; y[i]--;\n for (int j = 0; j < M; j++) {\n for (int k = 0; k < N; k++) {\n d[i][j][k] = get_dist(x[i], y[i], j, k, M, N);\n }\n }\n }\n \n int res = 0;\n \n cin >> t;\n for (int i = 0; i < t; i++) {\n int X, Y;\n cin >> X >> Y;\n X--; Y--;\n for (int j = 0; j < M; j++) {\n for (int k = 0; k < N; k++) {\n d[s][j][k] = get_dist(X, Y, j, k, M, N);\n }\n }\n x.push_back(X); y.push_back(Y);\n res = max(res, get_max_block(M, N, x, y));\n x.pop_back(); y.pop_back();\n }\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3252,
"score_of_the_acc": -1.5625,
"final_rank": 11
},
{
"submission_id": "aoj_0193_1340910",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define at(t, i) get<i>(t)\ntypedef pair<int, int> Pr;\ntypedef tuple<int, int, int> Tp;\nconst int INF = 1 << 28;\nconst int dx[] = {0, -1, -1, 0, 1, 1};\nconst int dy[][6] = {\n\t{-1, 0, 1, 1, 1, 0},\n\t{-1, -1, 0, 1, 0, -1},\n};\n\nint m, n;\nint s, t;\nPr pos[11];\nint dist[11][128][128];\n\nint solve()\n{\n\tfill_n(**dist, 11 * 128 * 128, INF);\n\tfor (int i = 0; i <= s; i++){\n\t\tfor (int j = 0; j <= 127; j++){\n\t\t\tfor (int k = 0; k <= 127; k++){\n\t\t\t\tif (j == 0 || k == 0 || j == 127 || k == 127){\n\t\t\t\t\tdist[i][j][k] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tfor (int i = 0; i <= s; i++){\n\t\tdist[i][pos[i].first][pos[i].second] = 0;\n\t\tqueue<Tp> que;\n\t\tfor (que.push(Tp(pos[i].first, pos[i].second, 0)); que.size(); que.pop()){\n\t\t\tTp t = que.front();\n\t\t\tint x = at(t, 0);\n\t\t\tint y = at(t, 1);\n\t\t\tint d = at(t, 2);\n\t\t\t//printf(\"%d %d %d\\n\", x, y, d);\n\t\t\tif (dist[i][x][y] < d) continue;\n\t\t\tfor (int dir = 0; dir < 6; dir++){\n\t\t\t\tint nx = x + dx[dir];\n\t\t\t\tint ny = y + dy[x & 1][dir];\n\t\t\t\tif (dist[i][nx][ny] > d + 1){\n\t\t\t\t\tdist[i][nx][ny] = d + 1;\n\t\t\t\t\tque.push(Tp(nx, ny, d + 1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t/*for (int i = 0; i <= s; i++){\n\t\tfor (int j = 1; j <= n; j++){\n\t\t\tfor (int k = 1; k <= m; k++){\n\t\t\t\tprintf(\"%d \", dist[i][j][k]);\n\t\t\t}\n\t\t\tputs(\"\");\n\t\t}\n\t\tputs(\"\\n\");\n\t}*/\n\t\n\tint res = 0;\n\tfor (int i = 1; i <= n; i++){\n\t\tfor (int j = 1; j <= m; j++){\n\t\t\tint p = 0;\n\t\t\tfor (int k = 1; k <= s; k++){\n\t\t\t\tif (dist[p][i][j] >= dist[k][i][j]){\n\t\t\t\t\tp = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (p == 0) res++;\n\t\t}\n\t}\n\t\n\treturn res;\n}\n\nint main()\n{\n\twhile (scanf(\"%d %d\", &m, &n), m){\n\t\tscanf(\"%d\", &s);\n\t\tfor (int i = 0; i < s; i++){\n\t\t\tint x, y;\n\t\t\tscanf(\"%d %d\", &x, &y);\n\t\t\tpos[i + 1] = Pr(y, x);\n\t\t}\n\t\t\n\t\tint res = 0;\n\t\tscanf(\"%d\", &t);\n\t\tfor (int i = 0; i < t; i++){\n\t\t\tint p, q;\n\t\t\tscanf(\"%d %d\", &p, &q);\n\t\t\tpos[0] = Pr(q, p);\n\t\t\tres = max(res, solve());\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\", res);\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1904,
"score_of_the_acc": -0.6792,
"final_rank": 4
},
{
"submission_id": "aoj_0193_1234801",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\n\nstruct Point {\n\tint x, y, s;\n\tPoint(int x_, int y_, int s_) : x(x_), y(y_), s(s_) {}\n};\n\nint dx[2][6] = {\n\t\t{1, 1, 1, 0, -1, 0}, \n\t\t{0, 1, 0, -1, -1, -1}\n\t},\n\tdy[6] = {-1, 0, 1, 1, 0, -1},\n\tW, H, S, T;\n\nbool vis[110][110], grid[110][110];\n\nvector< Point > search(int sx, int sy) {\n\tmemset(vis, 0, sizeof(vis));\n\t\n\tqueue< Point > que;\n\tque.push(Point(sx, sy, 0));\n\tvis[sy][sx] = 1;\n\t\n\tvector< Point > res;\n\tint mns = int(1e9);\n\t\n\twhile (!que.empty()) {\n\t\tPoint p = que.front(); que.pop();\n\t\t\n\t\tif (mns < p.s) break;\n\t\t\n\t\tif (grid[p.y][p.x]) {\n\t\t\tmns = p.s;\n\t\t\tres.push_back(p);\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tfor_(d,0,6) {\n\t\t\tint nx = p.x + dx[p.y % 2][d], ny = p.y + dy[d];\n\t\t\tif (nx <= 0 || W < nx || ny <= 0 || H < ny) continue;\n\t\t\tif (vis[ny][nx]) continue;\n\t\t\tvis[ny][nx] = 1;\n\t\t\tque.push(Point(nx, ny, p.s + 1));\n\t\t}\n\t}\n\t\n\treturn res;\n}\n\nint main() {\t\n\twhile (cin >> W >> H, W) {\n\t\tmemset(grid, 0, sizeof(grid));\n\t\t\n\t\tcin >> S;\t\t\n\t\tfor_(i,0,S) {\n\t\t\tint x, y;\n\t\t\tcin >> x >> y;\n\t\t\tgrid[y][x] = 1;\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tcin >> T;\n\t\tfor_(i,0,T) {\n\t\t\tint x, y;\n\t\t\tcin >> x >> y;\n\t\t\tgrid[y][x] = 1;\n\t\t\t\n\t\t\tint cnt = 0;\n\t\t\tfor_(yy,1,H+1) for_(xx,1,W+1) {\n\t\t\t\tvector< Point > vp = search(xx, yy);\n\t\t\t\tif (vp.size() > 1) continue;\t\t\t\t\n\t\t\t\tif (vp[0].x == x && vp[0].y == y) ++cnt;\n\t\t\t}\n\t\t\t\n\t\t\tgrid[y][x] = 0;\n\t\t\tans = max(ans, cnt);\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 1248,
"score_of_the_acc": -0.6338,
"final_rank": 3
},
{
"submission_id": "aoj_0193_1166482",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <climits>\n#include <map>\n#include <cstring>\nusing namespace std;\n\nconst int dx[2][6] = {\n {-1, 0, -1, 1, -1, 0},\n {0, 1, -1, 1, 0, 1}\n};\nconst int dy[2][6] = {\n {-1, -1, 0, 0, 1, 1},\n {-1, -1, 0, 0, 1, 1}\n};\n\nint m, n;\npair<int,int> bloc[100][100], tmp[100][100];\n\nvoid dfs(int idx, int x, int y, int dist) {\n if (dist < bloc[y][x].second) {\n bloc[y][x] = make_pair(idx, dist);\n int k = y%2;\n for (int i=0; i<6; ++i) {\n if (0 <= x+dx[k][i] && x+dx[k][i] < m &&\n 0 <= y+dy[k][i] && y+dy[k][i] < n) {\n dfs(idx, x+dx[k][i], y+dy[k][i], dist+1);\n }\n }\n } else if (idx != bloc[y][x].first && dist == bloc[y][x].second) {\n bloc[y][x] = make_pair(-1, dist);\n }\n}\n\nint main() {\n while (cin >> m >> n, (m || n)) {\n for (int i=0; i<100; ++i) for (int j=0; j<100; ++j) {\n bloc[i][j] = make_pair(INT_MAX, INT_MAX);\n }\n int s;\n cin >> s;\n int x, y;\n for (int i=0; i<s; ++i) {\n cin >> x >> y;\n dfs(i, x-1, y-1, 0);\n }\n int t;\n cin >> t;\n int p, q, res = 0;\n for (int i=0; i<t; ++i) {\n cin >> p >> q;\n memcpy(tmp, bloc, sizeof bloc);\n dfs(s, p-1, q-1, 0);\n int cnt = 0;\n for (int i=0; i<n; ++i) {\n for (int j=0; j<m; ++j) {\n if (bloc[i][j].first == s) {\n ++ cnt;\n }\n }\n }\n res = max(res, cnt);\n memcpy(bloc, tmp, sizeof tmp);\n }\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 1468,
"score_of_the_acc": -0.7327,
"final_rank": 6
},
{
"submission_id": "aoj_0193_1166480",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <climits>\n#include <map>\n#include <cstring>\nusing namespace std;\n\nconst int dx[2][6] = {\n {-1, 0, -1, 1, -1, 0},\n {0, 1, -1, 1, 0, 1}\n};\nconst int dy[2][6] = {\n {-1, -1, 0, 0, 1, 1},\n {-1, -1, 0, 0, 1, 1}\n};\n\nint m, n;\npair<int,int> bloc[100][100], tmp[100][100];\n\nvoid dfs(int idx, int x, int y, int dist) {\n if (dist < bloc[y][x].second) {\n bloc[y][x] = make_pair(idx, dist);\n for (int i=0; i<6; ++i) {\n if (0 <= x+dx[y%2][i] && x+dx[y%2][i] < m &&\n 0 <= y+dy[y%2][i] && y+dy[y%2][i] < n) {\n dfs(idx, x+dx[y%2][i], y+dy[y%2][i], dist+1);\n }\n }\n } else if (idx != bloc[y][x].first && dist == bloc[y][x].second) {\n bloc[y][x] = make_pair(-1, dist);\n }\n}\n\nint main() {\n while (cin >> m >> n, (m || n)) {\n for (int i=0; i<100; ++i) for (int j=0; j<100; ++j) {\n bloc[i][j] = make_pair(INT_MAX, INT_MAX);\n }\n int s;\n cin >> s;\n int x, y;\n for (int i=0; i<s; ++i) {\n cin >> x >> y;\n dfs(i, x-1, y-1, 0);\n }\n int t;\n cin >> t;\n int p, q, res = 0;\n for (int i=0; i<t; ++i) {\n cin >> p >> q;\n memcpy(tmp, bloc, sizeof bloc);\n dfs(s, p-1, q-1, 0);\n int cnt = 0;\n for (int i=0; i<n; ++i) {\n for (int j=0; j<m; ++j) {\n if (bloc[i][j].first == s) {\n ++ cnt;\n }\n }\n }\n res = max(res, cnt);\n memcpy(bloc, tmp, sizeof tmp);\n }\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 1464,
"score_of_the_acc": -0.7002,
"final_rank": 5
},
{
"submission_id": "aoj_0193_591525",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\n#include<cassert>\n#include<vector>\n#include<deque>\nusing namespace std;\ntypedef pair<int,int> P;\nint n,m,cnt;\nint mincost[110][110];\nbool visited[110][110];\nint dx[2][6] = {{-1,+0,1,0,-1,-1},{+0,+1,1,1,0,-1}};\nint dy[2][6] = {{-1,-1,0,1,+1,+0},{-1,-1,0,1,1,+0}};\nbool f;\n \nvoid dfs(int x,int y,int cost)\n{\n //if(!f)\n //cout << \"xy = \" << x << \",\" << y << \" cost = \" << cost << endl;\n for(int i=0;i<6;i++)\n {\n int nx = x + dx[y%2][i];\n int ny = y + dy[y%2][i];\n if(!(0 <= nx && nx < m && 0 <= ny && ny < n))\n continue;\n //if(!f)cout << \"mincost[\"<<ny<<\"][\"<<nx<<\"] = \" << mincost[ny][nx] << \" = cost + 1 = \" << cost + 1 << endl;\n if(mincost[ny][nx] > cost+1)\n {\n if(!visited[ny][nx])\n cnt++;\n visited[ny][nx] = true;\n mincost[ny][nx] = cost + 1;\n dfs(nx,ny,cost+1);\n }\n }\n}\n \nint main()\n{\n while(true)\n {\n cin >> m;\n if(!m) break;\n cin >> n;\n for(int i=0;i<n;i++) \n for(int j=0;j<m;j++)\n mincost[i][j] = (1<<29); \n f = true;\n int s,t,mex = 0;\n scanf(\"%d\",&s);\n for(int i=0;i<s;i++)\n {\n int x,y;\n scanf(\"%d %d\",&x,&y);\n x--,y--;\n mincost[y][x] = 0;\n dfs(x,y,0);\n }\n f = false;\n scanf(\"%d\",&t);\n for(int i=0;i<t;i++)\n { \n int pre_mincost[n][m];\n for(int j=0;j<n;j++)\n for(int k=0;k<m;k++)\n pre_mincost[j][k] = mincost[j][k],visited[j][k] = false;\n int p,q;\n scanf(\"%d %d\",&p,&q);\n \n cnt = 1,p--,q--;\n mincost[q][p] = 0,visited[q][p] = true;\n \n dfs(p,q,0);\n \n mex = max(mex,cnt);\n for(int j=0;j<n;j++)\n for(int k=0;k<m;k++)\n mincost[j][k] = pre_mincost[j][k];\n }\n cout << mex << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1384,
"score_of_the_acc": -0.5818,
"final_rank": 2
},
{
"submission_id": "aoj_0193_487464",
"code_snippet": "//50\n#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n for(int m,n;cin>>m>>n,m;){\n int s;\n cin>>s;\n int g[100][100];\n fill(g[0],g[100],1<<29);\n int sh[100][100]={};\n for(int i=1;i<=s;i++){\n int x,y;\n cin>>x>>y;\n x--;\n y--;\n sh[y][x]=i;\n g[y][x]=0;\n }\n int a=0;\n int t;\n cin>>t;\n while(t--){\n int x,y;\n cin>>x>>y;\n x--;\n y--;\n int gg[100][100];\n copy(g[0],g[n],gg[0]);\n int ss[100][100];\n copy(sh[0],sh[n],ss[0]);\n ss[y][x]=-1;\n gg[y][x]=0;\n for(int i=0;i<m*n;i++){\n\tfor(int j=0;j<n;j++){\n\t for(int k=0;k<m;k++){\n\t for(int l=0;l<6;l++){\n\t int dy[]={-1,0,1,1,0,-1};\n\t int dx[][6]={{0,1,0,-1,-1,-1},{1,1,1,0,-1,0}};\n\t int ny=j+dy[l];\n\t int nx=k+dx[j%2][l];\n\t if(0<=min(nx,ny)&&ny<n&&nx<m){\n\t\tint c=gg[ny][nx]+1;\n\t\tif(c<gg[j][k]){\n\t\t gg[j][k]=c;\n\t\t ss[j][k]=ss[ny][nx];\n\t\t}else if(c==gg[j][k]){\n\t\t if(ss[j][k]!=ss[ny][nx]){\n\t\t ss[j][k]=0;\n\t\t }\n\t\t}\n\t }\n\t }\n\t }\n\t}\n }\n int c=0;\n for(int i=0;i<n;i++){\n\tfor(int j=0;j<m;j++){\n\t c+=ss[i][j]==-1;\n\t}\n }\n a=max(c,a);\n }\n cout<<a<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 1304,
"score_of_the_acc": -1.401,
"final_rank": 10
},
{
"submission_id": "aoj_0193_389785",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n\nconst int MAX_N = 101;\nconst int INF = 1e+9;\ntypedef pair<int,int> P;\n\nint w, h;\n// st[y][x] := (x,y) が店舗かどうか\nint st[MAX_N][MAX_N];\n\n// 移動6方向のベクトル(偶数列と奇数列で遷移の仕方が異なる)\nint dx[2][6] = { \n\t{ -1, 0, -1, 1, -1, 0 },\n\t{ 0, 1, -1, 1, 0, 1 }\n};\nint dy[6] = { -1, -1, 0, 0, 1, 1 };\n\n// BFSのときに利用\nint d[MAX_N][MAX_N];\n// m[y][x] := (x,y) から最短の店舗までの距離\nint m[MAX_N][MAX_N];\n// 解\nint ans;\n\nvoid init(){\n\tfor(int y=0 ; y < MAX_N ; y++ ){\n\t\tfor(int x=0 ; x < MAX_N ; x++ ){\n\t\t\tm[y][x] = st[y][x] = 0;\n\t\t}\n\t}\n}\n\nvoid clear_d(){\n\tfor(int y=0 ; y < MAX_N ; y++ ){\n\t\tfor(int x=0 ; x < MAX_N ; x++ ){\n\t\t\td[y][x] = INF;\n\t\t}\n\t}\n}\n\n// (sx,sy) から最短の店舗までの距離を求める\nvoid bfs(int sx, int sy){\n\tqueue<P> q;\n\tclear_d();\n\tq.push( P(sx,sy) );\n\td[sy][sx] = 0;\n\t\n\twhile( !q.empty() ){\n\t\tint px = q.front().first; \n\t\tint py = q.front().second;\n\t\tq.pop();\n\t\t\n\t\tif( st[py][px] == 1 ){\n\t\t\tm[sy][sx] = d[py][px];\n\t\t\tbreak;\n\t\t}\n\t\tfor(int i=0 ; i < 6 ; i++ ){\n\t\t\tint mx = px + dx[py%2][i];\n\t\t\tint my = py + dy[i];\n\t\t\tif( mx < 0 || my < 0 || mx >= w || my >= h ) continue;\n\t\t\t\n\t\t\tif( d[my][mx] == INF ){\n\t\t\t\tq.push( P(mx,my) );\n\t\t\t\td[my][mx] = d[py][px] + 1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n// (sx,sy) からカバーできるブロック数\nint solve(int sx, int sy){\n\tqueue<P> q;\n\tclear_d();\n\tq.push( P(sx,sy) );\n\td[sy][sx] = 0;\n\tint cnt = 0;\n\t\n\twhile( !q.empty() ){\n\t\tint px = q.front().first; \n\t\tint py = q.front().second;\n\t\tq.pop();\n\t\tif( d[py][px] < m[py][px] ){\n\t\t\tcnt++;\n\t\t}else{\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tfor(int i=0 ; i < 6 ; i++ ){\n\t\t\tint mx = px + dx[py%2][i];\n\t\t\tint my = py + dy[i];\n\t\t\tif( mx < 0 || my < 0 || mx >= w || my >= h ) continue;\n\t\t\t\n\t\t\tif( d[my][mx] == INF ){\n\t\t\t\tq.push( P(mx,my) );\n\t\t\t\td[my][mx] = d[py][px] + 1;\n\t\t\t}\n\t\t}\n\t}\n\treturn cnt;\n}\n\nint main(){\n\twhile( cin >> w >> h , w || h ){\n\t\tinit();\n\t\t\n\t\tint s, t;\n\t\tcin >> s;\n\t\tfor(int i=0 ; i < s ; i++ ){\n\t\t\tint x, y;\n\t\t\tcin >> x >> y;\n\t\t\tx--; y--;\n\t\t\tst[y][x] = 1;\n\t\t}\n\t\t\n\t\tfor(int y=0 ; y < h ; y++ ){\n\t\t\tfor(int x=0 ; x < w ; x++ ){\n\t\t\t\tbfs( x , y );\n\t\t\t}\n\t\t}\n\t\t\n\t\tans = 0;\n\t\tcin >> t;\n\t\tfor(int i=0 ; i < t ; i++ ){\n\t\t\tint x, y;\n\t\t\tcin >> x >> y;\n\t\t\tx--; y--;\n\t\t\tint cnt = solve( x, y );\n\t\t\tans = max( ans , cnt );\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 1028,
"score_of_the_acc": -0.7849,
"final_rank": 7
},
{
"submission_id": "aoj_0193_107033",
"code_snippet": "#include <iostream>\n#include <queue>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\ntypedef pair<pair<int,int>,int> NODE;\n#define X first.second\n#define Y first.first\n#define depth second\n\n/*ï*/\nint ox[] = {-1, 1, 0, 0, 1,1};\nint oy[] = { 0, 0,-1, 1,-1,1};\n\n/*ô*/\nint ex[] = {-1, 1, 0, 0,-1,-1};\nint ey[] = { 0, 0,-1, 1,-1, 1};\n\nint main(){\n\tint point[100][100];\n\tint h,w,a,b,t,x,y,s;\n\twhile(cin >> w && w){\n\t\tint ret = 0;\n\t\tcin >> h;\n\t\trep(i,100)rep(j,100)point[i][j] = 0;\n\t\tcin >> t;\n\t\trep(i,t){\n\t\t\tcin >> a >> b;\n\t\t\ta--;b--;\n\t\t\tpoint[b][a] = i+1;\n\t\t}\n\t\tcin >> s;\n\t\trep(P,s){\n\t\t\tcin >> a >> b;\n\t\t\ta--;b--;\n\t\t\tpoint[b][a] = 50;\n\t\t\t\n\t\t//rep(i,h){rep(j,w)cout << point[i][j];cout << endl;}\n\t\tint pt[100] = {0};\n\t\trep(i,h)rep(j,w){\n\t\t\tx = j,y = i;\n\t\t\tqueue<NODE> Q;\n\t\t\tpair<int,int> dp[100];\n\t\t\tbool done[100][100]={0};\n\t\t\tQ.push( make_pair(make_pair(y,x),0\t) );\n\t\t\twhile( Q.size() ){\n\t\t\t\tNODE q = Q.front(); Q.pop();\n\t\t\t\tif(point[q.Y][q.X]){\n\t\t\t\t\tdp[q.depth].first++;\n\t\t\t\t\tdp[q.depth].second = point[q.Y][q.X];\n\t\t\t }\n\t\t\t\tif( q.Y % 2 == 1){\n\t\t\t\t\trep(L,6){\n\t\t\t\t\t\tif( q.X+ox[L] >=0 && q.X+ox[L] < w && q.Y+oy[L] < h && q.Y+oy[L]>=0 ){\n\t\t\t\t\t\t\t\tif( !done[q.Y+oy[L]][q.X+ox[L]] )Q.push( make_pair(make_pair(q.Y+oy[L],q.X+ox[L]),q.depth+1) );\n\t\t\t\t\t\t\t \tdone[q.Y+oy[L]][q.X+ox[L]] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\trep(L,6){\n\t\t\t\t\t\tif( q.X+ex[L] >=0 && q.X+ex[L] < w && q.Y+ey[L] < h && q.Y+ey[L]>=0 ){\n\t\t\t\t\t\t\t\t\tif( !done[q.Y+ey[L]][q.X+ex[L]] )Q.push( make_pair(make_pair(q.Y+ey[L],q.X+ex[L]),q.depth+1) );\n\t\t\t\t\t\t\t \tdone[q.Y+ey[L]][q.X+ex[L]] = 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\trep(I,100){\n\t\t\t\tif(dp[I].first){\n\t\t\t\t\tif(dp[I].first==1)\n\t\t\t\t\t\tpt[dp[I].second-1]++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tret = max(pt[49],ret);\n\t\t\tpoint[b][a] = 0;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\t\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 960,
"score_of_the_acc": -1.0765,
"final_rank": 9
},
{
"submission_id": "aoj_0193_94399",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<set>\n\n#define INV (-1)\n#define MAX 128\n#define MAX_ENEMY 10\n#define MAX_STORE 21\n\nusing namespace std;\n\nconst int even_di[] = {-1,-1,0,0,1,1};\nconst int even_dj[] = {0,1,-1,1,0,1};\nconst int odd_di[] = {-1,-1,0,0,1,1};\nconst int odd_dj[] = {-1,0,-1,1,-1,0};\nconst int infty = 1 << 26;\n\nclass Area{\n public:\n int store;\n int dist[MAX_STORE];\n bool valid;\n Area():store(INV),valid(false){\n for(int i = 0; i < MAX_STORE; ++i){\n dist[i] = infty;\n }\n }\n};\n\nclass Map{\n public:\n int n,m;\n Area T[MAX][MAX];\n Map(){}\n Map(int n, int m):n(n),m(m){\n for(int i = 1; i < n+1; ++i){\n for(int j = 1; j < m+1; ++j){\n\tT[i][j].valid = true;\n\tfor(int k = 0; k < MAX_STORE; ++k){\n\t T[i][j].dist[k] = infty;\n\t}\n }\n }\n }\n int occupied(int store){\n int ret = 0;\n for(int i = 1; i < n + 1; ++i){\n for(int j = 1; j < m + 1; ++j){\n\tint minimum = infty;\n\tint id = -1;\n\tint cnt = 0;\n\tfor(int k = 0; k < MAX_STORE; ++k){\n\t if( k >= MAX_ENEMY && k != store ) continue;\n\t minimum = min( minimum, T[i][j].dist[k] ); \n\t}\n\tfor(int k = 0; k < MAX_STORE; ++k){\n\t if( k >= MAX_ENEMY && k != store ) continue;\n\t if( minimum == T[i][j].dist[k] ){\n\t ++cnt;\n\t id = k;\n\t }\n\t}\n\tif( cnt == 1 && id == store ){\n\t ++ret;\n\t}\n }\n }\n return ret;\n }\n};\n\nclass State\n{\npublic:\n int i,j;\n int cost;\n State():i(0),j(0),cost(infty){}\n State(int i, int j, int cost):i(i),j(j),cost(cost){}\n};\n \nvoid store_bfs( int i, int j, int store, Map &M )\n{\n queue< State > qpi;\n set<pair<int,int> > vis;\n qpi.push( State(i,j,0) );\n\n vis.insert(make_pair(i,j));\n while(!qpi.empty()){\n State now = qpi.front();\n qpi.pop();\n\n M.T[now.i][now.j].dist[store] = now.cost;\n \n for(int i = 0; i < sizeof(even_di)/sizeof(*even_di); ++i){\n int ti = now.i + ( now.i%2==0 ? even_di[i] : odd_di[i] );\n int tj = now.j + ( now.i%2==0 ? even_dj[i] : odd_dj[i] );\n \n if( !M.T[ti][tj].valid ) continue;\n if( vis.find( make_pair( ti, tj ) ) != vis.end() ) continue;\n \n vis.insert( make_pair( ti, tj ) );\n qpi.push( State(ti,tj,now.cost+1) );\n }\n }\n}\n\nint main()\n{\n while(true){\n int m,n;\n int ans = 0;\n cin >> m;\n if( m == 0 ) break;\n cin >> n;\n if( n == 0 ) break;\n int st;\n Map M(n,m);\n \n cin >> st;\n for(int i = 0; i < st; ++i){\n int y,x;\n cin >> x >> y;\n //++x;++y;\n M.T[y][x].store = i;\n store_bfs( y, x, i, M );\n }\n \n int cands;\n cin >> cands;\n for(int i = 0; i < cands; ++i){\n int y,x;\n cin >> x >> y;\n //++x;++y;\n M.T[y][x].store = MAX_ENEMY + i;\n store_bfs( y, x, MAX_ENEMY+i, M );\n }\n \n\n /*\n for(int i = 0; i < n+2; ++i){\n for(int j = 0; j < m+2; ++j){\n\tcout << \"(\" << j << \" , \" << i << \") = \";\n\tfor(int k = 0; k < MAX_STORE; ++k){\n\t cout << M.T[i][j].dist[k] << ' ';\n\t}\n\tcout << endl;\n }\n cout << \"--------\" << endl;\n }\n */\n \n\n for(int i = 0; i < cands; ++i){\n ans = max( ans, M.occupied( MAX_ENEMY + i ) );\n }\n\n cout << ans << endl;\n \n }\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0193_29287",
"code_snippet": "#include<iostream>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define ck(a,b) (0<=a&&a<b)\n#define INF 1<<30\nusing namespace std;\nint dx0[]={0,1,0,-1,-1,-1},dx1[]={1,1,1,0,-1,0},dy[]={-1,0,1,1,0,-1};\nint md[100][100],td[100][100],s,t,sx[10],sy[10],tx[10],ty[10],m,n,tc,mc;\nvoid rec(int x,int y,int a){\n\ttd[x][y]=a;\n\trep(d,6){\n\t\tint nx=x+(y%2?dx1[d]:dx0[d]),ny=y+dy[d];\n\t\tif(ck(nx,m)&&ck(ny,n)&&td[nx][ny]>a+1)rec(nx,ny,a+1);\n\t}\n}\nint main(){\n\twhile(cin>>m>>n>>s,m){\n\t\trep(i,m)rep(j,n)md[i][j]=INF;\n\t\trep(i,s)cin>>sx[i]>>sy[i],sx[i]--,sy[i]--;\n\t\tcin>>t; rep(i,t)cin>>tx[i]>>ty[i],tx[i]--,ty[i]--;\n\t\trep(i,s){\n\t\t\trep(k,m)rep(l,n)td[k][l]=INF;\n\t\t\trec(sx[i],sy[i],0);\n\t\t\trep(k,m)rep(l,n)if(md[k][l]>td[k][l])md[k][l]=td[k][l];\n\t\t}\n\t\tmc=0; rep(i,t){\n\t\t\ttc=0;\n\t\t\trep(k,m)rep(l,n)td[k][l]=INF;\n\t\t\trec(tx[i],ty[i],0);\n\t\t\trep(k,m)rep(l,n)if(md[k][l]>td[k][l])tc++;\n\t\t\tif(mc<tc)mc=tc;\n\t\t}\n\t\tcout<<mc<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 1020,
"score_of_the_acc": -0.9074,
"final_rank": 8
}
] |
aoj_0190_cpp
|
11 パズル
太郎君は 8 パズルが大得意で休み時間などにいつも友達に並び替えてもらって遊んでいます。そんなとき、友達から「もっと複雑なパズルは解ける?」と聞かれたのですが、他のパズルはやったことはありません。どうやらその友達は自作で 11 パズルを作っていたみたいです。そのパズルは以下のような形をしています。
11 パズルは 11 枚の正方形のカードと、図 1 のような形の枠を使って行います。最初に 11 枚のカードを枠に入れます。すると 2 カ所の空きスペースができますので、この空きスペースに隣接したカードを動かすことができます。これを繰り返し、カードをきれいに整列して、図 2 の完成型にすることが 11 パズルの目的です。
太郎君はこのパズルに挑戦することにしました。ところが太郎君はこの 11 パズルをいとも簡単に解いてしまいました。そこで友達は「動かす数を一番少なくして解いてよ!」と無茶なことを言ってきました。太郎君は答えがわからないので、プログラムのできるあなたに 11 パズルを解くときの最小ステップ数を出すプログラムを作成してもらってから挑戦することにしました。このとき、2 カ所動かせるところがあるのですが、一つの数字を 1 スペース分移動させることを1ステップとして考えることとします。
11 パズルの初期状態を入力とし、11 パズルを解くときの最小ステップ数を出力するプログラムを作成してください。ただし、パズルを解くときの最小ステップ数が 20 ステップより多くかかってしまう場合は、「NA」と出力してください。パズルの状態は、一行目の情報から順に入力されるものとし、数字の 0 は空きスペースを表します。例えば、図 1 の状態を表す入力は以下のようになります。
6
2 1 3
10 5 7 0 8
9 4 11
0
Input
複数のデータセットの並びが入力として与えられます。入力の終わりは-1ひとつの行で示されます。 各データセットは以下の形式で与えられます。
p
1
p
2
p
3
p
4
p
5
p
6
p
7
p
8
p
9
p
10
p
11
p
12
p
13
i
行目にパズルの
i
行目の情報
p
i
(0 ≤
p
i
≤ 11) が空白区切りで与えられます。
データセットの数は 100 を超えません。
Output
データセット毎に、最小ステップ数または NA を１行に出力します。
Sample Input
2
1 0 3
4 5 6 7 8
9 0 11
10
0
1 2 3
4 5 6 7 8
9 10 11
0
0
11 10 9
8 7 6 5 4
3 2 1
0
-1
Output for the Sample Input
2
0
NA
|
[
{
"submission_id": "aoj_0190_6960636",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n array<int, 13> a;\n array<int, 13> b{0,1,2,3,4,5,6,7,8,9,10,11,0};\n // 0\n // 1 2 3\n //4 5 6 7 8\n // 9 10 11\n // 12\n vector<vector<int>> g = {\n {2},\n {2, 5},\n {0, 1, 3, 6},\n {2, 7},\n {5},\n {1, 4, 6, 9},\n {2, 5, 7, 10},\n {3, 6, 8, 11},\n {7},\n {5, 10},\n {6, 9, 11, 12},\n {7, 10},\n {10}\n };\n map<array<int,13>,int> mp;\n queue<array<int,13>> nxt;\n mp[b] = 0;\n nxt.push(b);\n while(!nxt.empty()){\n a = nxt.front();\n nxt.pop();\n int d = mp[a];\n if(d >= 13)continue;\n for(int i = 0; i < 13; i++){\n if(a[i] != 0)continue;\n for(auto &&j:g[i]){\n swap(a[i], a[j]);\n if(mp.find(a) == mp.end()){\n mp[a] = d + 1;\n nxt.push(a);\n }\n swap(a[i], a[j]);\n }\n }\n }\n while(cin >> a[0], a[0] != -1){\n for(int i = 1; i < 13; i++)cin >> a[i];\n if(mp.find(a) != mp.end()){\n cout << mp[a] << '\\n';\n continue;\n }\n map<array<int,13>,int> mp2;\n mp2[a] = 0;\n nxt.push(a);\n int ans = 21;\n while(!nxt.empty()){\n a = nxt.front();\n nxt.pop();\n int d = mp2[a];\n if(mp.find(a) != mp.end()){\n ans = min(ans, d + mp[a]);\n continue;\n }\n if(d >= 7)continue;\n for(int i = 0; i < 13; i++){\n if(a[i] != 0)continue;\n for(auto &&j:g[i]){\n swap(a[i], a[j]);\n if(mp2.find(a) == mp2.end()){\n mp2[a] = d + 1;\n nxt.push(a);\n }\n swap(a[i], a[j]);\n }\n }\n }\n if(ans > 20)cout << \"NA\" << '\\n';\n else cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 11860,
"score_of_the_acc": -0.4341,
"final_rank": 15
},
{
"submission_id": "aoj_0190_5833673",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<set>\n#include<map>\nusing namespace std;\n//arr[i]…位置iから動ける位置\nint arr[13][4]={\n\t{2,-1,-1,-1},\n\t{2,5,-1,-1},\n\t{0,1,3,6},\n\t{2,7,-1,-1},\n\t{5,-1,-1,-1},\n\t{1,4,6,9},\n\t{2,5,7,10},\n\t{3,6,8,11},\n\t{7,-1,-1,-1},\n\t{5,10,-1,-1},\n\t{6,9,11,12},\n\t{7,10,-1,-1},\n\t{10,-1,-1,-1},\n};\n//dx[i],dy[i]…位置iの座標\nint dx[]={0,1,1,1,2,2,2,2,2,3,3,3,4},dy[]={2,1,2,3,0,1,2,3,4,1,2,3,2};\n//位置iと位置jの距離\nint dist(int i,int j){\n\treturn abs(dx[i]-dx[j])+abs(dy[i]-dy[j]);\n}\n//パズルの状態を表す構造体\nstruct board{\n\tint val[13];\n\t//setやmapを使う用\n\tbool operator<(const board&b)const{\n\t\tfor(int i=0;i<13;i++)\n\t\t\tif(val[i]!=b.val[i])\n\t\t\t\treturn val[i]<b.val[i];\n\t\treturn 0;\n\t}\n\t//残り最低でも何手かかるかの評価\n\tint h(){\n\t\tint res=0;\n\t\tfor(int i=0;i<13;i++){\n\t\t\tif(val[i]==0)\n\t\t\t\tcontinue;\n\t\t\tres+=dist(val[i],i);\n\t\t}\n\t\treturn res;\n\t}\n\t//完成形かどうか\n\tbool end(){\n\t\tint res=1;\n\t\tfor(int i=0;i<13;i++)\n\t\t\tres&=val[i]==i%12;\n\t\treturn res;\n\t}\n\t//1手進めた形(一覧)\n\tvector<board>next(){\n\t\tvector<board>res;\n\t\t//空白がどこか\n\t\tint sp=-1,sp2;\n\t\tfor(int i=0;i<13;i++){\n\t\t\tif(val[i]==0){\n\t\t\t\tif(sp==-1)\n\t\t\t\t\tsp=i;\n\t\t\t\telse\n\t\t\t\t\tsp2=i;\n\t\t\t}\n\t\t}\n\t\t//1つ目の空白を使う\n\t\tfor(int i=0;i<4;i++){\n\t\t\tint nsp=arr[sp][i];\n\t\t\tif(nsp==-1)\n\t\t\t\tcontinue;\n\t\t\tboard tmp=*this;\n\t\t\tswap(tmp.val[sp],tmp.val[nsp]);\n\t\t\tres.push_back(tmp);\n\t\t}\n\t\t//2つ目の空白を使う\n\t\tfor(int i=0;i<4;i++){\n\t\t\tint nsp=arr[sp2][i];\n\t\t\tif(nsp==-1)\n\t\t\t\tcontinue;\n\t\t\tboard tmp=*this;\n\t\t\tswap(tmp.val[sp2],tmp.val[nsp]);\n\t\t\tres.push_back(tmp);\n\t\t}\n\t\treturn res;\n\t}\n};\nsigned main(){\n\tboard puzzle;\n\twhile(cin>>puzzle.val[0],puzzle.val[0]!=-1){\n\t\tfor(int i=1;i<13;i++)\n\t\t\tcin>>puzzle.val[i];\n\t\tmap<board,int>dist;\n\t\tset<board>used;\n\t\tqueue<board>que;\n\t\tbool fnd=0;\n\t\t//初期状態\n\t\tdist[puzzle]=0;\n\t\tused.insert(puzzle);\n\t\tque.push(puzzle);\n\t\twhile(!que.empty()){\n\t\t\tpuzzle=que.front();\n\t\t\tque.pop();\n\t\t\t//枝刈り\n\t\t\tif(puzzle.h()+dist[puzzle]>=21)\n\t\t\t\tcontinue;\n\t\t\t//完成\n\t\t\tif(puzzle.end()){\n\t\t\t\tcout<<dist[puzzle]<<endl;\n\t\t\t\tfnd=1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tauto nxt=puzzle.next();\n\t\t\tfor(const auto&x:nxt){\n\t\t\t\t//既に見たことがあるならスキップ\n\t\t\t\tif(used.find(x)!=used.end())\n\t\t\t\t\tcontinue;\n\t\t\t\tused.insert(x);\n\t\t\t\tdist[x]=dist[puzzle]+1;\n\t\t\t\tque.push(x);\n\t\t\t}\n\t\t}\n\t\t//見つからなかった\n\t\tif(!fnd)\n\t\t\tcout<<\"NA\"<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 5480,
"score_of_the_acc": -0.1543,
"final_rank": 10
},
{
"submission_id": "aoj_0190_4445513",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nint main() {\n vector<vector<int>> G{{2},{2, 5},{0, 1, 3, 6},{2, 7},{5},{1, 4, 6, 9},{2, 5, 7, 10},{3, 6, 8, 11},{7},{5, 10},{6, 9, 11, 12},{7, 10},{10}};\n vector<int> y{0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4}, x{2, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 2};\n using P = array<int, 13>;\n P v{};\n iota(v.begin(), v.end(), 0);\n v.back() = 0;\n map<P, int> A;\n auto dfs1 = [&](int a, int b, int cur, auto &&f) -> void {\n if(!A.count(v)) A[v] = cur;\n else chmin(A[v], cur);\n if(cur >= 5) return;\n for (auto &&j : G[a]) {\n if(j != b){\n swap(v[a], v[j]);\n f(j, b, cur+1, f);\n swap(v[a], v[j]);\n }\n }\n for (auto &&j : G[b]) {\n if(j != a){\n swap(v[b], v[j]);\n f(a, j, cur+1, f);\n swap(v[b], v[j]);\n }\n }\n return;\n };\n dfs1(0, 12, 0, dfs1);\n while(cin >> v[0], ~v[0]){\n for (int i = 1; i < 13; ++i) cin >> v[i];\n int ans = 21;\n auto dfs = [&](int cur, auto &&f) -> void {\n if(cur+5 >= ans) return;\n if(A.count(v)) {\n chmin(ans, A[v]+cur);\n return;\n }\n int d = 0, a = -1, b = -1;\n for (int i = 0; i < 13; ++i) {\n if(v[i]) d += abs(y[i]-y[v[i]])+abs(x[i]-x[v[i]]);\n else if(!~a) a = i;\n else b = i;\n }\n if(d+cur >= ans) return;\n for (auto &&j : G[a]) {\n if(j != b){\n swap(v[a], v[j]);\n f(cur+1, f);\n swap(v[a], v[j]);\n }\n }\n for (auto &&j : G[b]) {\n if(j != a){\n swap(v[b], v[j]);\n f(cur+1, f);\n swap(v[b], v[j]);\n }\n }\n\n };\n dfs(0, dfs);\n if(ans == 21) puts(\"NA\");\n else cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3068,
"score_of_the_acc": -0.0046,
"final_rank": 1
},
{
"submission_id": "aoj_0190_4445503",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nint main() {\n vector<vector<int>> G{{2},{2, 5},{0, 1, 3, 6},{2, 7},{5},{1, 4, 6, 9},{2, 5, 7, 10},{3, 6, 8, 11},{7},{5, 10},{6, 9, 11, 12},{7, 10},{10}};\n vector<int> y{0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4}, x{2, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 2};\n using P = array<int, 13>;\n P v{};\n iota(v.begin(), v.end(), 0);\n v.back() = 0;\n map<P, int> A;\n auto dfs1 = [&](int a, int b, int cur, auto &&f) -> void {\n if(!A.count(v)) A[v] = cur;\n else chmin(A[v], cur);\n if(cur >= 10) return;\n for (auto &&j : G[a]) {\n if(j != b){\n swap(v[a], v[j]);\n f(j, b, cur+1, f);\n swap(v[a], v[j]);\n }\n }\n for (auto &&j : G[b]) {\n if(j != a){\n swap(v[b], v[j]);\n f(a, j, cur+1, f);\n swap(v[b], v[j]);\n }\n }\n return;\n };\n dfs1(0, 12, 0, dfs1);\n while(cin >> v[0], ~v[0]){\n for (int i = 1; i < 13; ++i) cin >> v[i];\n int ans = 21;\n auto dfs = [&](int cur, auto &&f) -> void {\n if(cur+10 >= ans) return;\n if(A.count(v)) {\n chmin(ans, A[v]+cur);\n return;\n }\n int d = 0, a = -1, b = -1;\n for (int i = 0; i < 13; ++i) {\n if(v[i]) d += abs(y[i]-y[v[i]])+abs(x[i]-x[v[i]]);\n else if(!~a) a = i;\n else b = i;\n }\n if(d+cur >= ans) return;\n for (auto &&j : G[a]) {\n if(j != b){\n swap(v[a], v[j]);\n f(cur+1, f);\n swap(v[a], v[j]);\n }\n }\n for (auto &&j : G[b]) {\n if(j != a){\n swap(v[b], v[j]);\n f(cur+1, f);\n swap(v[b], v[j]);\n }\n }\n\n };\n dfs(0, dfs);\n if(ans == 21) puts(\"NA\");\n else cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1500,
"memory_kb": 3908,
"score_of_the_acc": -0.8223,
"final_rank": 18
},
{
"submission_id": "aoj_0190_3904441",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<map>\n#include<vector>\nusing namespace std;\nint px[13]={0,1,1,1,2,2,2,2,2,3,3,3,4},py[13]={2,1,2,3,0,1,2,3,4,1,2,3,2};\nint xx[12]={0,1,1,1,2,2,2,2,2,3,3,3},yy[12]={0,1,2,3,0,1,2,3,4,1,2,3};\nstruct board{\n\tint p[13],a,b;\n\tbool operator<(const board&a)const\n\t{\n\t\tfor(int i=0;i<13;i++)\n\t\t{\n\t\t\tif(p[i]!=a.p[i])return p[i]<a.p[i];\n\t\t}\n\t\treturn false;\n\t}\n\tint distance()const\n\t{\n\t\tint ret=0;\n\t\tfor(int i=0;i<13;i++)\n\t\t{\n\t\t\tif(p[i]==0)continue;\n\t\t\tret+=abs(px[i]-xx[p[i]])+abs(py[i]-yy[p[i]]);\n\t\t}\n\t\treturn ret;\n\t}\n};\nvector<int>D[13];\nmain()\n{\n\tD[0].push_back(2);\n\tD[1].push_back(2);\n\tD[1].push_back(5);\n\tD[2].push_back(0);\n\tD[2].push_back(1);\n\tD[2].push_back(3);\n\tD[2].push_back(6);\n\tD[3].push_back(2);\n\tD[3].push_back(7);\n\tD[4].push_back(5);\n\tD[5].push_back(1);\n\tD[5].push_back(4);\n\tD[5].push_back(6);\n\tD[5].push_back(9);\n\tD[6].push_back(2);\n\tD[6].push_back(5);\n\tD[6].push_back(7);\n\tD[6].push_back(10);\n\tD[7].push_back(3);\n\tD[7].push_back(6);\n\tD[7].push_back(8);\n\tD[7].push_back(11);\n\tD[8].push_back(7);\n\tD[9].push_back(5);\n\tD[9].push_back(10);\n\tD[10].push_back(6);\n\tD[10].push_back(9);\n\tD[10].push_back(11);\n\tD[10].push_back(12);\n\tD[11].push_back(7);\n\tD[11].push_back(10);\n\tD[12].push_back(10);\n\twhile(true)\n\t{\n\t\tboard start;\n\t\tcin>>start.p[0];\n\t\tif(start.p[0]<0)break;\n\t\tfor(int i=1;i<13;i++)cin>>start.p[i];\n\t\tstart.a=start.b=-1;\n\t\tfor(int i=0;i<13;i++)\n\t\t{\n\t\t\tif(start.p[i]==0)\n\t\t\t{\n\t\t\t\tif(start.a<0)start.a=i;\n\t\t\t\telse start.b=i;\n\t\t\t}\n\t\t}\n\t\tboard goal;\n\t\tfor(int i=0;i<12;i++)goal.p[i]=i;\n\t\tgoal.p[12]=0;\n\t\tqueue<board>P;\n\t\tP.push(start);\n\t\tmap<board,int>M;\n\t\tM[start]=0;\n\t\tint ans=-1;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tboard now=P.front();P.pop();\n\t\t\tint c=M[now];\n\t\t\tif(c+now.distance()>20)continue;\n\t\t\tif(!(now<goal||goal<now))\n\t\t\t{\n\t\t\t\tans=c;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int v:D[now.a])\n\t\t\t{\n\t\t\t\tint x=now.a,y=v;\n\t\t\t\tswap(now.p[x],now.p[y]);\n\t\t\t\tnow.a=y;\n\t\t\t\tif(M.find(now)==M.end())\n\t\t\t\t{\n\t\t\t\t\tM[now]=c+1;\n\t\t\t\t\tP.push(now);\n\t\t\t\t}\n\t\t\t\tswap(now.p[x],now.p[y]);\n\t\t\t\tnow.a=x;\n\t\t\t}\n\t\t\tfor(int v:D[now.b])\n\t\t\t{\n\t\t\t\tint x=now.b,y=v;\n\t\t\t\tswap(now.p[x],now.p[y]);\n\t\t\t\tnow.b=y;\n\t\t\t\tif(M.find(now)==M.end())\n\t\t\t\t{\n\t\t\t\t\tM[now]=c+1;\n\t\t\t\t\tP.push(now);\n\t\t\t\t}\n\t\t\t\tswap(now.p[x],now.p[y]);\n\t\t\t\tnow.b=x;\n\t\t\t}\n\t\t}\n\t\tif(ans<0)cout<<\"NA\"<<endl;\n\t\telse cout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4516,
"score_of_the_acc": -0.1007,
"final_rank": 8
},
{
"submission_id": "aoj_0190_3218071",
"code_snippet": "#include <queue>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst int lim = 20;\nconst vector<int> bx = { 0, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3 };\nconst vector<int> by = { 2, 2, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3 };\nstruct state {\n\tvector<int> px, py;\n\tint cost, rem, last1, last2;\n};\nbool operator<(const state& s1, const state& s2) {\n\treturn s1.cost + s1.rem != s2.cost + s2.rem ? s1.cost + s1.rem > s2.cost + s2.rem : s1.rem > s2.rem;\n}\nint eval(vector<int> px, vector<int> py) {\n\tint ret = 0;\n\tfor (int i = 2; i < 13; ++i) {\n\t\tret += abs(px[i] - bx[i]) + abs(py[i] - by[i]);\n\t}\n\treturn ret;\n}\nint main() {\n\tint x;\n\twhile (cin >> x, x != -1) {\n\t\tvector<int> vx(13), vy(13);\n\t\tint zc = 0;\n\t\tvx[x == 0 ? zc : x + 1] = bx[0];\n\t\tvy[x == 0 ? zc : x + 1] = by[0];\n\t\tif (x == 0) ++zc;\n\t\tfor (int i = 1; i < 13; ++i) {\n\t\t\tcin >> x;\n\t\t\tvx[x == 0 ? zc : x + 1] = bx[i == 12 ? 1 : i + 1];\n\t\t\tvy[x == 0 ? zc : x + 1] = by[i == 12 ? 1 : i + 1];\n\t\t\tif (x == 0) ++zc;\n\t\t}\n\t\tpriority_queue<state> que;\n\t\tque.push(state{ vx, vy, 0, eval(vx, vy), -1, -1 });\n\t\tint ans = -1;\n\t\twhile (!que.empty()) {\n\t\t\tstate u = que.top();\n\t\t\tque.pop();\n\t\t\tif (u.rem == 0) {\n\t\t\t\tans = u.cost;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor (int i = 0; i < 2; ++i) {\n\t\t\t\tfor (int j = 2; j < 13; ++j) {\n\t\t\t\t\tif (i == u.last1 && j == u.last2) continue;\n\t\t\t\t\tif (abs(u.px[i] - u.px[j]) + abs(u.py[i] - u.py[j]) == 1) {\n\t\t\t\t\t\tswap(u.px[i], u.px[j]);\n\t\t\t\t\t\tswap(u.py[i], u.py[j]);\n\t\t\t\t\t\tint ev = eval(u.px, u.py);\n\t\t\t\t\t\tif (u.cost + ev + 1 <= lim) {\n\t\t\t\t\t\t\tque.push(state{ u.px, u.py, u.cost + 1, eval(u.px, u.py), i, j });\n\t\t\t\t\t\t}\n\t\t\t\t\t\tswap(u.px[i], u.px[j]);\n\t\t\t\t\t\tswap(u.py[i], u.py[j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (ans != -1) cout << ans << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3948,
"score_of_the_acc": -0.0544,
"final_rank": 7
},
{
"submission_id": "aoj_0190_2772681",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<vector<int>,int>P;\nvector<int>v[13],s(13),t(13);\nmap<vector<int>,int>m;\n \nint has[14];\n \n \nvoid init(){\n \n v[0].push_back(2);\n \n v[1].push_back(2);\n v[1].push_back(5);\n \n v[2].push_back(0);\n v[2].push_back(1);\n v[2].push_back(3);\n v[2].push_back(6);\n \n v[3].push_back(2);\n v[3].push_back(7);\n \n v[4].push_back(5);\n \n v[5].push_back(1);\n v[5].push_back(4);\n v[5].push_back(6);\n v[5].push_back(9);\n \n v[6].push_back(2);\n v[6].push_back(5);\n v[6].push_back(7);\n v[6].push_back(10);\n \n v[7].push_back(3);\n v[7].push_back(6);\n v[7].push_back(8);\n v[7].push_back(11);\n \n v[8].push_back(7);\n \n v[9].push_back(5);\n v[9].push_back(10);\n \n v[10].push_back(6);\n v[10].push_back(9);\n v[10].push_back(11);\n v[10].push_back(12);\n \n v[11].push_back(7);\n v[11].push_back(10);\n \n v[12].push_back(10);\n \n int a=20;\n int p=1;\n \n r(i,13){\n has[i]=p;\n p*=a;\n }\n}\n \nint ha(vector<int> &x){\n \n int re=0;\n \n r(i,13){\n re+=x[i]*has[i];\n }\n \n return re;\n}\n \nvector<int> ah(int x){\n vector<int>y(13);\n r(i,13){\n y[i]=x%20;\n x/=20;\n }\n return y;\n}\n \nvoid BFS1(){\n s[0]=0;\n s[12]=0;\n r(i,11)s[i+1]=i+1;\n set<vector<int> >st;\n st.insert(s);\n m[s]=0;\n queue<P>q;\n q.push(P(s,0));\n while(1){\n vector<int> now=q.front().first;\n int cost=q.front().second;\n q.pop();\n if(cost==11)break;\n //cout<<m.size()<<' '<<cost<<endl;\n r(i,13)if(now[i]==0){\n r(j,v[i].size()){\n swap(now[i],now[v[i][j]]);\n if(!st.count(now)){\n st.insert(now);\n m[now]=cost+1;\n q.push(P(now,cost+1));\n }\n swap(now[i],now[v[i][j]]);\n }\n }\n }\n}\n \nvoid BFS2(){\n set<vector<int> >st;\n st.insert(t);\n queue<P>q;\n q.push(P(t,0));\n while(1){\n vector<int>now=q.front().first;\n int cost=q.front().second;\n q.pop();\n if(m.count(now)){\n cout<<m[now]+cost<<endl;\n return ;\n }\n if(cost==9)break;\n r(i,13)if(now[i]==0){\n r(j,v[i].size()){\n swap(now[i],now[v[i][j]]);\n if(!st.count(now)){\n st.insert(now);\n if(m.count(now)){\n cout<<m[now]+cost+1<<endl;\n return ;\n }\n q.push(P(now,cost+1));\n }\n swap(now[i],now[v[i][j]]);\n }\n }\n }\n cout<<\"NA\"<<endl;\n}\n \n \nsigned main(){\n init();\n BFS1();\n while(cin>>t[0],t[0]!=-1){\n r(i,12)cin>>t[i+1];\n BFS2();\n }\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 8612,
"score_of_the_acc": -0.3518,
"final_rank": 13
},
{
"submission_id": "aoj_0190_2772680",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<vector<int>,int>P;\nvector<int>v[13],s(13),t(13);\nmap<vector<int>,int>m;\n \nint has[14];\n \n \nvoid init(){\n \n v[0].push_back(2);\n \n v[1].push_back(2);\n v[1].push_back(5);\n \n v[2].push_back(0);\n v[2].push_back(1);\n v[2].push_back(3);\n v[2].push_back(6);\n \n v[3].push_back(2);\n v[3].push_back(7);\n \n v[4].push_back(5);\n \n v[5].push_back(1);\n v[5].push_back(4);\n v[5].push_back(6);\n v[5].push_back(9);\n \n v[6].push_back(2);\n v[6].push_back(5);\n v[6].push_back(7);\n v[6].push_back(10);\n \n v[7].push_back(3);\n v[7].push_back(6);\n v[7].push_back(8);\n v[7].push_back(11);\n \n v[8].push_back(7);\n \n v[9].push_back(5);\n v[9].push_back(10);\n \n v[10].push_back(6);\n v[10].push_back(9);\n v[10].push_back(11);\n v[10].push_back(12);\n \n v[11].push_back(7);\n v[11].push_back(10);\n \n v[12].push_back(10);\n \n int a=20;\n int p=1;\n \n r(i,13){\n has[i]=p;\n p*=a;\n }\n}\n \nint ha(vector<int> &x){\n \n int re=0;\n \n r(i,13){\n re+=x[i]*has[i];\n }\n \n return re;\n}\n \nvector<int> ah(int x){\n vector<int>y(13);\n r(i,13){\n y[i]=x%20;\n x/=20;\n }\n return y;\n}\n \nvoid BFS1(){\n s[0]=0;\n s[12]=0;\n r(i,11)s[i+1]=i+1;\n set<vector<int> >st;\n st.insert(s);\n m[s]=0;\n queue<P>q;\n q.push(P(s,0));\n while(1){\n vector<int> now=q.front().first;\n int cost=q.front().second;\n q.pop();\n if(cost==13)break;\n //cout<<m.size()<<' '<<cost<<endl;\n r(i,13)if(now[i]==0){\n r(j,v[i].size()){\n swap(now[i],now[v[i][j]]);\n if(!st.count(now)){\n st.insert(now);\n m[now]=cost+1;\n q.push(P(now,cost+1));\n }\n swap(now[i],now[v[i][j]]);\n }\n }\n }\n}\n \nvoid BFS2(){\n set<vector<int> >st;\n st.insert(t);\n queue<P>q;\n q.push(P(t,0));\n while(1){\n vector<int>now=q.front().first;\n int cost=q.front().second;\n q.pop();\n if(m.count(now)){\n cout<<m[now]+cost<<endl;\n return ;\n }\n if(cost==7)break;\n r(i,13)if(now[i]==0){\n r(j,v[i].size()){\n swap(now[i],now[v[i][j]]);\n if(!st.count(now)){\n st.insert(now);\n if(m.count(now)){\n cout<<m[now]+cost+1<<endl;\n return ;\n }\n q.push(P(now,cost+1));\n }\n swap(now[i],now[v[i][j]]);\n }\n }\n }\n cout<<\"NA\"<<endl;\n}\n \n \nsigned main(){\n init();\n BFS1();\n while(cin>>t[0],t[0]!=-1){\n r(i,12)cin>>t[i+1];\n BFS2();\n }\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 25348,
"score_of_the_acc": -1.0785,
"final_rank": 19
},
{
"submission_id": "aoj_0190_2772679",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<vector<int>,int>P;\nvector<int>v[13],s(13),t(13);\nmap<vector<int>,int>m;\n \nint has[14];\n \n \nvoid init(){\n \n v[0].push_back(2);\n \n v[1].push_back(2);\n v[1].push_back(5);\n \n v[2].push_back(0);\n v[2].push_back(1);\n v[2].push_back(3);\n v[2].push_back(6);\n \n v[3].push_back(2);\n v[3].push_back(7);\n \n v[4].push_back(5);\n \n v[5].push_back(1);\n v[5].push_back(4);\n v[5].push_back(6);\n v[5].push_back(9);\n \n v[6].push_back(2);\n v[6].push_back(5);\n v[6].push_back(7);\n v[6].push_back(10);\n \n v[7].push_back(3);\n v[7].push_back(6);\n v[7].push_back(8);\n v[7].push_back(11);\n \n v[8].push_back(7);\n \n v[9].push_back(5);\n v[9].push_back(10);\n \n v[10].push_back(6);\n v[10].push_back(9);\n v[10].push_back(11);\n v[10].push_back(12);\n \n v[11].push_back(7);\n v[11].push_back(10);\n \n v[12].push_back(10);\n \n int a=20;\n int p=1;\n \n r(i,13){\n has[i]=p;\n p*=a;\n }\n}\n \nint ha(vector<int> &x){\n \n int re=0;\n \n r(i,13){\n re+=x[i]*has[i];\n }\n \n return re;\n}\n \nvector<int> ah(int x){\n vector<int>y(13);\n r(i,13){\n y[i]=x%20;\n x/=20;\n }\n return y;\n}\n \nvoid BFS1(){\n s[0]=0;\n s[12]=0;\n r(i,11)s[i+1]=i+1;\n set<vector<int> >st;\n st.insert(s);\n m[s]=0;\n queue<P>q;\n q.push(P(s,0));\n while(1){\n vector<int> now=q.front().first;\n int cost=q.front().second;\n q.pop();\n if(cost==12)break;\n //cout<<m.size()<<' '<<cost<<endl;\n r(i,13)if(now[i]==0){\n r(j,v[i].size()){\n swap(now[i],now[v[i][j]]);\n if(!st.count(now)){\n st.insert(now);\n m[now]=cost+1;\n q.push(P(now,cost+1));\n }\n swap(now[i],now[v[i][j]]);\n }\n }\n }\n}\n \nvoid BFS2(){\n set<vector<int> >st;\n st.insert(t);\n queue<P>q;\n q.push(P(t,0));\n while(1){\n vector<int>now=q.front().first;\n int cost=q.front().second;\n q.pop();\n if(m.count(now)){\n cout<<m[now]+cost<<endl;\n return ;\n }\n if(cost==8)break;\n r(i,13)if(now[i]==0){\n r(j,v[i].size()){\n swap(now[i],now[v[i][j]]);\n if(!st.count(now)){\n st.insert(now);\n if(m.count(now)){\n cout<<m[now]+cost+1<<endl;\n return ;\n }\n q.push(P(now,cost+1));\n }\n swap(now[i],now[v[i][j]]);\n }\n }\n }\n cout<<\"NA\"<<endl;\n}\n \n \nsigned main(){\n init();\n BFS1();\n while(cin>>t[0],t[0]!=-1){\n r(i,12)cin>>t[i+1];\n BFS2();\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 14412,
"score_of_the_acc": -0.5795,
"final_rank": 16
},
{
"submission_id": "aoj_0190_2769398",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<vector<int>,int>P;\nvector<int>v[13],s(13),t(13);\nmap<vector<int>,int>m;\n\nint has[14];\n\n\nvoid init(){\n\n v[0].push_back(2);\n\n v[1].push_back(2);\n v[1].push_back(5);\n\n v[2].push_back(0);\n v[2].push_back(1);\n v[2].push_back(3);\n v[2].push_back(6);\n\n v[3].push_back(2);\n v[3].push_back(7);\n\n v[4].push_back(5);\n\n v[5].push_back(1);\n v[5].push_back(4);\n v[5].push_back(6);\n v[5].push_back(9);\n\n v[6].push_back(2);\n v[6].push_back(5);\n v[6].push_back(7);\n v[6].push_back(10);\n\n v[7].push_back(3);\n v[7].push_back(6);\n v[7].push_back(8);\n v[7].push_back(11);\n\n v[8].push_back(7);\n\n v[9].push_back(5);\n v[9].push_back(10);\n\n v[10].push_back(6);\n v[10].push_back(9);\n v[10].push_back(11);\n v[10].push_back(12);\n\n v[11].push_back(7);\n v[11].push_back(10);\n\n v[12].push_back(10);\n\n int a=20;\n int p=1;\n\n r(i,13){\n has[i]=p;\n p*=a;\n }\n}\n\nint ha(vector<int> &x){\n\n int re=0;\n\n r(i,13){\n re+=x[i]*has[i];\n }\n\n return re;\n}\n\nvector<int> ah(int x){\n vector<int>y(13);\n r(i,13){\n y[i]=x%20;\n x/=20;\n }\n return y;\n}\n\nvoid BFS1(){\n s[0]=0;\n s[12]=0;\n r(i,11)s[i+1]=i+1;\n set<vector<int> >st;\n st.insert(s);\n m[s]=0;\n queue<P>q;\n q.push(P(s,0));\n while(1){\n vector<int> now=q.front().first;\n int cost=q.front().second;\n q.pop();\n if(cost==10)break;\n //cout<<m.size()<<' '<<cost<<endl;\n r(i,13)if(now[i]==0){\n r(j,v[i].size()){\n swap(now[i],now[v[i][j]]);\n if(!st.count(now)){\n st.insert(now);\n m[now]=cost+1;\n q.push(P(now,cost+1));\n }\n swap(now[i],now[v[i][j]]);\n }\n }\n }\n}\n\nvoid BFS2(){\n set<vector<int> >st;\n st.insert(t);\n queue<P>q;\n q.push(P(t,0));\n while(1){\n vector<int>now=q.front().first;\n int cost=q.front().second;\n q.pop();\n if(m.count(now)){\n cout<<m[now]+cost<<endl;\n return ;\n }\n if(cost==10)break;\n r(i,13)if(now[i]==0){\n r(j,v[i].size()){\n swap(now[i],now[v[i][j]]);\n if(!st.count(now)){\n st.insert(now);\n if(m.count(now)){\n cout<<m[now]+cost+1<<endl;\n return ;\n }\n q.push(P(now,cost+1));\n }\n swap(now[i],now[v[i][j]]);\n }\n }\n }\n cout<<\"NA\"<<endl;\n}\n\n\nsigned main(){\n init();\n BFS1();\n while(cin>>t[0],t[0]!=-1){\n r(i,12)cin>>t[i+1];\n BFS2();\n }\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 8280,
"score_of_the_acc": -0.4312,
"final_rank": 14
},
{
"submission_id": "aoj_0190_2558113",
"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\tshort table[5][5];\n\tint space_row1,space_col1,space_row2,space_col2;\n};\n\nmap<string,bool> MAP;\n\nbool rangeCheck(int row,int col){\n\tif(row < 0 || row >= 5)return false;\n\n\tswitch(row){\n\tcase 0:\n\t\tif(col == 2)return true;\n\t\tbreak;\n\tcase 1:\n\t\tif(col >= 1 && col <= 3)return true;\n\t\tbreak;\n\tcase 2:\n\t\tif(col >= 0 && col <= 4)return true;\n\t\tbreak;\n\tcase 3:\n\t\tif(col >= 1 && col <= 3)return true;\n\t\tbreak;\n\tcase 4:\n\t\tif(col == 2)return true;\n\t\tbreak;\n\t}\n\treturn false;\n}\n\nbool clearFLG;\nint ans;\nint p[13];\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\n\n\nvoid copyInfo(Info& to,Info from){\n\n\tfor(int row = 0; row <= 4; row++){\n\t\tfor(int col = 0; col <= 4; col++){\n\t\t\tto.table[row][col] = from.table[row][col];\n\t\t}\n\t}\n}\n\nint calc_manhattan_sum(Info info){\n\n\tint sum = 0;\n\tfor(int row = 0; row <= 4; row++){\n\t\tfor(int col = 0; col <= 4; col++){\n\t\t\tif(rangeCheck(row,col) == true && info.table[row][col] != 0){\n\t\t\t\tswitch(info.table[row][col]){\n\t\t\t\tcase 1:\n\t\t\t\t\tsum += abs(row-1)+abs(col-1);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tsum += abs(row-1)+abs(col-2);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tsum += abs(row-1)+abs(col-3);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 4:\n\t\t\t\t\tsum += abs(row-2)+abs(col-0);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 5:\n\t\t\t\t\tsum += abs(row-2)+abs(col-1);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 6:\n\t\t\t\t\tsum += abs(row-2)+abs(col-2);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 7:\n\t\t\t\t\tsum += abs(row-2)+abs(col-3);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 8:\n\t\t\t\t\tsum += abs(row-2)+abs(col-4);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 9:\n\t\t\t\t\tsum += abs(row-3)+abs(col-1);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 10:\n\t\t\t\t\tsum += abs(row-3)+abs(col-2);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 11:\n\t\t\t\t\tsum += abs(row-3)+abs(col-3);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn sum;\n}\n\n\nvoid recursive(Info info,int depth,int max_depth){\n\n\tif(clearFLG)return;\n\n\tif(depth == max_depth){\n\t\tif(info.table[1][1] == 1 && info.table[1][2] == 2 && info.table[1][3] == 3 &&\n\t\t\t\tinfo.table[2][0] == 4 && info.table[2][1] == 5 && info.table[2][2] == 6 && info.table[2][3] == 7 && info.table[2][4] == 8 &&\n\t\t\t\tinfo.table[3][1] == 9 && info.table[3][2] == 10 && info.table[3][3] == 11){\n\t\t\tclearFLG = true;\n\t\t}\n\t\treturn;\n\t}\n\n\tint adj_row,adj_col;\n\n\tfor(int i = 0; i < 4; i++){\n\t\tadj_row = info.space_row1+diff_row[i];\n\t\tadj_col = info.space_col1+diff_col[i];\n\n\t\tif(rangeCheck(adj_row,adj_col) == false || info.table[adj_row][adj_col] == 0)continue;\n\n\t\tInfo next_info;\n\t\tcopyInfo(next_info,info);\n\n\t\tswap(next_info.table[info.space_row1][info.space_col1],next_info.table[adj_row][adj_col]);\n\n\t\tstring tmp;\n\t\tfor(int row = 0; row <= 4; row++){\n\t\t\tfor(int col = 0; col <= 4; col++){\n\t\t\t\tif(rangeCheck(row,col)){\n\t\t\t\t\ttmp.append(to_string(next_info.table[row][col])).append(to_string('*'));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tauto at = MAP.find(tmp);\n\t\tif(at != MAP.end())continue;\n\n\t\tMAP[tmp] = true;\n\n\t\tnext_info.space_row1 = adj_row;\n\t\tnext_info.space_col1 = adj_col;\n\t\tnext_info.space_row2 = info.space_row2;\n\t\tnext_info.space_col2 = info.space_col2;\n\n\t\tif(max_depth-(depth+1) < calc_manhattan_sum(next_info))continue;\n\n\t\trecursive(next_info,depth+1,max_depth);\n\t}\n\n\tfor(int i = 0; i < 4; i++){\n\t\tadj_row = info.space_row2+diff_row[i];\n\t\tadj_col = info.space_col2+diff_col[i];\n\n\t\tif(rangeCheck(adj_row,adj_col) == false || info.table[adj_row][adj_col] == 0)continue;\n\n\t\tInfo next_info;\n\t\tcopyInfo(next_info,info);\n\n\t\tswap(next_info.table[info.space_row2][info.space_col2],next_info.table[adj_row][adj_col]);\n\n\t\tstring tmp;\n\t\tfor(int row = 0; row <= 4; row++){\n\t\t\tfor(int col = 0; col <= 4; col++){\n\t\t\t\tif(rangeCheck(row,col)){\n\t\t\t\t\ttmp.append(to_string(next_info.table[row][col])).append(to_string('*'));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tauto at = MAP.find(tmp);\n\t\tif(at != MAP.end())continue;\n\n\t\tMAP[tmp] = true;\n\n\t\tnext_info.space_row1 = info.space_row1;\n\t\tnext_info.space_col1 = info.space_col1;\n\t\tnext_info.space_row2 = adj_row;\n\t\tnext_info.space_col2 = adj_col;\n\n\t\tif(max_depth-(depth+1) < calc_manhattan_sum(next_info))continue;\n\n\t\trecursive(next_info,depth+1,max_depth);\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 1; i < 13; i++)scanf(\"%d\",&p[i]);\n\n\tInfo first;\n\tfirst.table[0][2] = p[0];\n\tfor(int i = 1; i <= 3; i++)first.table[1][i] = p[i];\n\tfor(int i = 0; i <= 4; i++)first.table[2][i] = p[4+i];\n\tfor(int i = 1; i <= 3; i++)first.table[3][i] = p[8+i];\n\tfirst.table[4][2] = p[12];\n\n\tint count = 0;\n\n\tfor(int row = 0; row <= 4; row++){\n\t\tfor(int col = 0; col <= 4; col++){\n\t\t\tif(rangeCheck(row,col) == true && first.table[row][col] == 0){\n\t\t\t\tif(count == 0){\n\t\t\t\t\tfirst.space_row1 = row;\n\t\t\t\t\tfirst.space_col1 = col;\n\t\t\t\t\tcount++;\n\t\t\t\t}else{\n\t\t\t\t\tfirst.space_row2 = row;\n\t\t\t\t\tfirst.space_col2 = col;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tclearFLG = false;\n\n\tfor(int max_depth = 0; max_depth <= 20; max_depth++){\n\t\tMAP.clear();\n\n\t\tstring tmp;\n\t\tfor(int row = 0; row <= 4; row++){\n\t\t\tfor(int col = 0; col <= 4; col++){\n\t\t\t\tif(rangeCheck(row,col)){\n\t\t\t\t\ttmp.append(to_string(first.table[row][col])).append(to_string('*'));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tMAP[tmp] = true;\n\n\t\trecursive(first,0,max_depth);\n\t\tif(clearFLG){\n\t\t\tans = max_depth;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif(clearFLG){\n\t\tprintf(\"%d\\n\",ans);\n\t}else{\n\t\tprintf(\"NA\\n\");\n\t}\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&p[0]);\n\t\tif(p[0] == -1)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3344,
"score_of_the_acc": -0.0327,
"final_rank": 6
},
{
"submission_id": "aoj_0190_2405430",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n#define fi first\n#define se second\n\ntemplate<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<int, pll> pip;\nconst ll INF = 1ll<<29;\nconst ll MOD = 1000000007;\nconst double EPS = 1e-9;\n\nint dd[13][4] = {\n\t{2,-1,-1,-1},\n\t{2,5,-1,-1},\n\t{0,1,3,6},\n\t{2,7,-1,-1},\n\t{5,-1,-1,-1},\n\t{1,4,6,9},\n\t{2,5,7,10},\n\t{3,6,8,11},\n\t{7,-1,-1,-1},\n\t{5,10,-1,-1},\n\t{6,9,11,12},\n\t{7,10,-1,-1},\n\t{10,-1,-1,-1}\n};\n\nint main() {\n\tqueue<string> que;\n\tmap<string, int> d;\n\t\n\tque.push(\"abcdefghijkla\");\n\td[\"abcdefghijkla\"] = 0;\n\t\n\twhile (!que.empty()) {\n\t\tstring now = que.front(); que.pop();\n\t\tint cost = d[now];\n\t\t\n\t\tif (cost > 10) break;\n\t\t\n\t\tREP(i, 13) if (now[i] == 'a') {\n\t\t\tREP(j, 4) {\n\t\t\t\tif (dd[i][j] == -1) break;\n\t\t\t\t\n\t\t\t\tswap(now[i], now[dd[i][j]]);\n\t\t\t\tif (d.find(now) == d.end()) {\n\t\t\t\t\td[now] = cost + 1;\n\t\t\t\t\tque.push(now);\n\t\t\t\t}\n\t\t\t\tswap(now[i], now[dd[i][j]]);\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) que.pop();\n\t\n\tint p[13];\n\twhile (cin >> p[0], ~p[0]) {\n\t\tFOR(i, 1, 13) cin >> p[i];\n\t\tstring st = \"\";\n\t\tREP(i, 13) st += p[i] + 'a';\n\t\t\n\t\tmap<string, int> d2;\n\t\tque.push(st);\n\t\td2[st] = 0;\n\t\t\n\t\tint ans = INF;\n\t\t\n\t\twhile (!que.empty()) {\n\t\t\tstring now = que.front(); que.pop();\n\t\t\tint cost = d2[now];\n\t\t\t\n\t\t\tif (cost > 10) break;\n\t\t\tif (d.find(now) != d.end()) chmin(ans, d[now] + d2[now]);\n\t\t\t\n\t\t\tREP(i, 13) if (now[i] == 'a') {\n\t\t\t\tREP(j, 4) {\n\t\t\t\t\tif (dd[i][j] == -1) break;\n\t\t\t\t\t\n\t\t\t\t\tswap(now[i], now[dd[i][j]]);\n\t\t\t\t\tif (d2.find(now) == d2.end()) {\n\t\t\t\t\t\td2[now] = cost + 1;\n\t\t\t\t\t\tque.push(now);\n\t\t\t\t\t}\n\t\t\t\t\tswap(now[i], now[dd[i][j]]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (!que.empty()) que.pop();\n\t\t\n\t\tif (ans <= 20) cout << ans << endl;\n\t\telse puts(\"NA\");\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 1920,
"memory_kb": 11456,
"score_of_the_acc": -1.3794,
"final_rank": 20
},
{
"submission_id": "aoj_0190_2396938",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint fie[5][5];\nint o_fie[5][5]={\n -1,-1,0,-1,-1,\n -1,1,2,3,-1,\n 4,5,6,7,8,\n -1,9,10,11,-1\n -1,-1,0,-1,-1,\n};\n\nint ox[12],oy[12],zx[2],zy[2],zcnt;\nint res;\nbool flag;\n\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\n\nvoid dfs(int v,int dist,int pd,int pu){\n if(dist==0){\n flag=true;\n res=min(res,v);\n return;\n }\n for(int i=0;i<4;i++){\n for(int j=0;j<2;j++){\n if(pu==j && (pd+2)%4==i)continue;\n int nx=zx[j]+dx[i],ny=zy[j]+dy[i];\n if(nx>=0 && nx<5 && ny>=0 && ny<5){\n if(fie[nx][ny]<=0)continue;\n int ch=fie[nx][ny];\n int ndist=dist;\n ndist-=abs(ox[ch]-nx)+abs(oy[ch]-ny);\n swap(fie[nx][ny],fie[zx[j]][zy[j]]);\n ndist+=abs(ox[ch]-zx[j])+abs(oy[ch]-zy[j]);\n zx[j]+=dx[i];\n zy[j]+=dy[i];\n if(v+1+ndist<=res)dfs(v+1,ndist,i,j);\n zx[j]-=dx[i];\n zy[j]-=dy[i];\n swap(fie[nx][ny],fie[zx[j]][zy[j]]);\n }\n }\n }\n}\nint dist;\n\nint main(void){\n for(int i=0;i<5;i++){\n for(int j=abs(2-i);j<=4-abs(2-i);j++){\n ox[o_fie[i][j]]=j;\n oy[o_fie[i][j]]=i;\n }\n }\n while(1){\n memset(fie,-1,sizeof(fie));\n dist=0;\n zcnt=0;\n for(int i=0;i<5;i++){\n for(int j=abs(2-i);j<=4-abs(2-i);j++){\n scanf(\"%d\",&fie[j][i]);\n if(fie[j][i]==-1)return 0;\n }\n }\n for(int i=0;i<5;i++){\n for(int j=abs(2-i);j<=4-abs(2-i);j++){\n int v=fie[j][i];\n if(v==0){\n zx[zcnt]=j;\n zy[zcnt++]=i;\n }else dist+=abs(ox[v]-j)+abs(oy[v]-i);\n }\n }\n if(dist>20){\n printf(\"NA\\n\");\n }else{\n int i=0;\n flag=false;\n res=20;\n dfs(0,dist,-1,-1);\n if(flag){\n printf(\"%d\\n\",res);\n }\n if(!flag)printf(\"NA\\n\");\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3140,
"score_of_the_acc": -0.0183,
"final_rank": 5
},
{
"submission_id": "aoj_0190_2143177",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define FR first\n#define SC second\n#define all(v) (v).begin(), (v).end()\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\n#define each(a, b) for(auto& a : b)\n\ntypedef pair<int, int> P;\n\nconst int inf = 1LL << 55;\n\nvector< vector<int> > to = {\n {2},\n {2, 5},\n {0, 1, 3, 6},\n {2, 7},\n {5},\n {1, 4, 6, 9},\n {2, 5, 7, 10},\n {3, 6, 8, 11},\n {7},\n {5, 10},\n {6, 9, 11, 12},\n {7, 10},\n {10}\n};\n\nvector<int> ans = {0,1,2,3,4,5,6,7,8,9,10,11,0};\n\nvector<int> x = {2,1,2,3,0,1,2,3,4,1,2,3,2};\nvector<int> y = {0,1,1,1,2,2,2,2,2,3,3,3,4};\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n int p;\n while(cin >> p, ~p) {\n vector<int> pzl; pzl.push_back(p);\n rep(i, 12) cin >> p, pzl.push_back(p);\n map<vector<int>, int> d;\n queue< vector<int> > que;\n que.push(pzl);\n d[pzl] = 0;\n bool flag = false;\n while(!que.empty() && !flag) {\n auto v = que.front(); que.pop();\n int e = 0;\n rep(i, v.size()) if(v[i]) {\n\te += abs(x[i]-x[v[i]]) + abs(y[i]-y[v[i]]);\n }\n if(e == 0) {\n\tcout << d[v] << endl;\n\tflag = true;\n\tbreak;\n }\n if(e + d[v] > 20) continue;\n rep(i, v.size()) {\n\tif(v[i]) continue;\n\trep(j, to[i].size()) {\n\t int c = d[v];\n\t swap(v[i], v[to[i][j]]);\n\t if(!d.count(v)) {\n\t que.push(v);\n\t d[v] = c + 1;\n\t }\n\t swap(v[i], v[to[i][j]]);\n\t}\n }\n }\n if(!flag) cout << \"NA\" << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 5468,
"score_of_the_acc": -0.1747,
"final_rank": 11
},
{
"submission_id": "aoj_0190_2142979",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define FR first\n#define SC second\n#define all(v) (v).begin(), (v).end()\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\n#define each(a, b) for(auto& a : b)\n\ntypedef pair<int, int> P;\n\nconst int inf = 1LL << 55;\n\nvector< vector<int> > to = {\n {2},\n {2, 5},\n {0, 1, 3, 6},\n {2, 7},\n {5},\n {1, 4, 6, 9},\n {2, 5, 7, 10},\n {3, 6, 8, 11},\n {7},\n {5, 10},\n {6, 9, 11, 12},\n {7, 10},\n {10}\n};\n\nvector<int> ans = {0,1,2,3,4,5,6,7,8,9,10,11,0};\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n map<vector<int>, int> D; \n queue< vector<int> > que;\n que.push(ans);\n D[ans] = 0;\n while(!que.empty()) {\n auto v = que.front(); que.pop();\n if(D[v] >= 10) break;\n rep(i, v.size()) {\n if(v[i]) continue;\n rep(j, to[i].size()) {\n\tint c = D[v];\n\tswap(v[i], v[to[i][j]]);\n\tif(!D.count(v)) {\n\t que.push(v);\n\t D[v] = c + 1;\n\t}\n\tswap(v[i], v[to[i][j]]);\n }\n }\n }\n \n int p;\n while(cin >> p, ~p) {\n vector<int> pzl; pzl.push_back(p);\n rep(i, 12) cin >> p, pzl.push_back(p);\n if(D.count(pzl)) {\n cout << D[pzl] << endl;\n continue;\n }\n map<vector<int>, int> d;\n queue< vector<int> > que;\n que.push(pzl);\n d[pzl] = 0;\n bool flag = false;\n while(!que.empty() && !flag) {\n auto v = que.front(); que.pop();\n if(d[v] >= 10) break; \n rep(i, v.size()) {\n\tif(v[i]) continue;\n\trep(j, to[i].size()) {\n\t int c = d[v];\n\t swap(v[i], v[to[i][j]]);\n\t if(D.count(v)) {\n\t cout << D[v] + c + 1 << endl;\n\t flag = true;\n\t break;\n\t } else if(!d.count(v)) {\n\t que.push(v);\n\t d[v] = c + 1;\n\t }\n\t swap(v[i], v[to[i][j]]);\n\t}\n\tif(flag) break;\n }\n }\n if(!flag) cout << \"NA\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 11232,
"score_of_the_acc": -0.6416,
"final_rank": 17
},
{
"submission_id": "aoj_0190_2142205",
"code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\n \nstruct P {\n int x, y;\n P(int x, int y) : x{x}, y{y} {}\n};\n \nint limit;\nvector<int> v;\n\nconstexpr int X[] = {2, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 2};\nconstexpr int Y[] = {0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4};\n \nint next_pos(int x, int y)\n{\n for (int i = 0; i < 13; i++) {\n if (x == X[i] && y == Y[i]) {\n return i;\n }\n } \n return -1;\n}\n \nint getMD()\n{\n int sum = 0;\n for (int i = 0; i < 13; i++) {\n if (v[i] == 0) continue;\n sum += abs(X[i] - X[v[i]]) + abs(Y[i] - Y[v[i]]);\n }\n return sum;\n}\n \nconstexpr int dx[] = {-1, 0, 1, 0};\nconstexpr int dy[] = {0, -1, 0, 1};\n \nbool dfs(const int* sp, int step)\n{\n int md = getMD();\n if (md == 0) return 1;\n if (md + step > limit) {\n return 0;\n }\n \n for (int i = 0; i < 2; i++) {\n int x = X[sp[i]], y = Y[sp[i]];\n for (int j = 0; j < 4; j++) {\n int nx = x + dx[j], ny = y + dy[j];\n int next = next_pos(nx, ny);\n if (next == -1) continue;\n \n const int nsp1[] = {next, sp[1]}, nsp2[] = {sp[0], next};\n \n swap(v[sp[i]], v[next]);\n if (i == 0 && dfs(nsp1, step + 1)) {\n return 1;\n }\n if (i == 1 && dfs(nsp2, step + 1)) {\n return 1;\n }\n swap(v[sp[i]], v[next]);\n }\n }\n return 0;\n}\n \nint main()\n{\n int x;\n while (cin >> x, x != -1) {\n int sp[2];\n v.resize(13); v[0] = x;\n for (int i = 1; i < 13; i++) {\n cin >> v[i];\n }\n\n for (int i = 0, j = 0; i < 13; i++) {\n if (v[i] == 0) {\n sp[j++] = i;\n }\n }\n\n bool found = 0;\n constexpr int LIMIT = 20;\n for (limit = 0; limit <= LIMIT; limit++) {\n if (dfs(sp, 0)) {\n cout << limit << endl;\n found = 1;\n break;\n }\n }\n if (!found) {\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3004,
"score_of_the_acc": -0.007,
"final_rank": 3
},
{
"submission_id": "aoj_0190_2142203",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\n \nstruct P {\n int x, y;\n P(int x, int y) : x{x}, y{y} {}\n};\n \nint limit;\nvector<int> v;\n\nconstexpr int X[] = {2, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 2};\nconstexpr int Y[] = {0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4};\n \nint next_pos(int x, int y)\n{\n for (int i = 0; i < 13; i++) {\n if (x == X[i] && y == Y[i]) {\n return i;\n }\n } \n return -1;\n}\n \nint getMD()\n{\n int sum = 0;\n for (int i = 0; i < 13; i++) {\n if (v[i] == 0) continue;\n sum += abs(X[i] - X[v[i]]) + abs(Y[i] - Y[v[i]]);\n }\n return sum;\n}\n \nconstexpr int dx[] = {-1, 0, 1, 0};\nconstexpr int dy[] = {0, -1, 0, 1};\n \nbool dfs(const int* sp, int step)\n{\n int md = getMD();\n if (md == 0) return 1;\n if (md + step > limit) {\n return 0;\n }\n \n for (int i = 0; i < 2; i++) {\n int x = X[sp[i]], y = Y[sp[i]];\n for (int j = 0; j < 4; j++) {\n int nx = x + dx[j], ny = y + dy[j];\n int next = next_pos(nx, ny);\n if (next == -1) continue;\n \n const int nsp1[] = {next, sp[1]}, nsp2[] = {sp[0], next};\n \n swap(v[sp[i]], v[next]);\n if (i == 0 && dfs(nsp1, step + 1)) {\n return 1;\n }\n if (i == 1 && dfs(nsp2, step + 1)) {\n return 1;\n }\n swap(v[sp[i]], v[next]);\n }\n }\n return 0;\n}\n \nint main()\n{\n int x;\n while (cin >> x, x != -1) {\n int sp[2];\n v.resize(13); v[0] = x;\n for (int i = 1; i < 13; i++) {\n cin >> v[i];\n }\n\n for (int i = 0, j = 0; i < 13; i++) {\n if (v[i] == 0) {\n sp[j++] = i;\n }\n }\n\n bool found = 0;\n constexpr int LIMIT = 20;\n for (limit = 0; limit <= LIMIT; limit++) {\n if (dfs(sp, 0)) {\n cout << limit << endl;\n found = 1;\n break;\n }\n }\n if (!found) {\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2964,
"score_of_the_acc": -0.0052,
"final_rank": 2
},
{
"submission_id": "aoj_0190_2142196",
"code_snippet": "#include <iostream>\n#include <vector>\n \nusing namespace std;\n \nstruct P {\n int y, x;\n P(int y, int x) : y{y}, x{x} {}\n};\n \nint limit;\nvector<int> v;\n \nP getPos(int x)\n{\n if (x == 0) return P(0, 2);\n if (1 <= x && x <= 3) return P(1, x);\n if (4 <= x && x <= 8) return P(2, x - 4);\n if (9 <= x && x <= 11) return P(3, x - 8);\n return P(4, 2);\n}\n \nint getPos(P p)\n{\n switch (p.y) {\n case 0:\n return (p.x == 2 ? 0 : -1);\n case 1:\n return (1 <= p.x && p.x <= 3 ? p.x : -1);\n case 2:\n return (0 <= p.x && p.x <= 4 ? p.x + 4 : -1); \n case 3:\n return (1 <= p.x && p.x <= 3 ? p.x + 8 : -1);\n case 4:\n return (p.x == 2 ? 12 : -1);\n }\n return -1;\n}\n \nint getMD()\n{\n int sum = 0;\n for (int i = 0; i < 13; i++) {\n if (v[i] == 0) continue;\n P np = getPos(i);\n P tp = getPos(v[i]);\n sum += abs(np.x - tp.x) + abs(np.y - tp.y);\n }\n return sum;\n}\n \nconstexpr int dx[] = {-1, 0, 1, 0};\nconstexpr int dy[] = {0, -1, 0, 1};\n \nbool dfs(int sp1, int sp2, int step)\n{\n int md = getMD();\n if (md == 0) return 1;\n if (md + step > limit) {\n return 0;\n }\n P p[2] = {getPos(sp1), getPos(sp2)};\n for (int i = 0; i < 2; i++) {\n int x = p[i].x, y = p[i].y;\n for (int j = 0; j < 4; j++) {\n int nx = x + dx[j], ny = y + dy[j];\n P np(ny, nx);\n int next = getPos(np);\n if (next == -1) continue;\n if (i == 0) {\n swap(v[sp1], v[next]);\n if (dfs(next, sp2, step + 1)) {\n return 1;\n }\n swap(v[sp1], v[next]);\n } else {\n swap(v[sp2], v[next]);\n if (dfs(sp1, next, step + 1)) {\n return 1;\n }\n swap(v[sp2], v[next]);\n }\n }\n }\n return 0;\n}\n \nint main()\n{\n int x;\n while (cin >> x, x != -1) {\n int sp[2];\n v.resize(13); v[0] = x;\n for (int i = 1; i < 13; i++) {\n cin >> v[i];\n }\n for (int i = 0, j = 0; i < 13; i++) {\n if (v[i] == 0) {\n sp[j++] = i;\n }\n }\n bool found = 0;\n constexpr int LIMIT = 20;\n for (limit = 0; limit <= LIMIT; limit++) {\n if (dfs(sp[0], sp[1], 0)) {\n cout << limit << endl;\n found = 1;\n break;\n }\n }\n if (!found) {\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 2988,
"score_of_the_acc": -0.0168,
"final_rank": 4
},
{
"submission_id": "aoj_0190_2106557",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <map>\nusing namespace std;\n\nunsigned long long int makeID( int (&p)[ 13 ] )\n{\n\tunsigned long long int ret = 0;\n\tfor( int i = 0; i < 13; ++i ){\n\t\tret *= 13;\n\t\tret += p[ i ];\n\t}\n\treturn ret;\n}\n\nunsigned long long int slide( unsigned long long int s, int a, int b )\n{\n\tint p[ 13 ];\n\tfor( int i = 0; i < 13; ++i ){\n\t\tp[ 12 - i ] = s % 13;\n\t\ts /= 13;\n\t}\n\tint t = p[ a ];\n\tp[ a ] = p[ b ];\n\tp[ b ] = t;\n\treturn makeID( p );\n}\n\nint side[][ 4 ] = {\n\t{ -1, -1, 2, -1 },\n\t{ -1, 2, 5, -1 },\n\t{ 0, 3, 6, 1 },\n\t{ -1, -1, 7, 2 },\n\t{ -1, 5, -1, -1 },\n\t{ 1, 6, 9, 4 },\n\t{ 2, 7, 10, 5 },\n\t{ 3, 8, 11, 6 },\n\t{ -1, -1, -1, 7 },\n\t{ 5, 10, -1, -1,},\n\t{ 6, 11, 12, 9 },\n\t{ 7, -1, -1, 10 },\n\t{ 10, -1, -1, -1 }\n};\n\nint solve( map< unsigned long long int, int >& ans, queue< unsigned long long int >& q, int* p, map< unsigned long long int, int >* sub )\n{\n\tint cnt = 1;\n\twhile( cnt <= 10 ){\n\t\tint size = q.size();\n\t\tfor( int i = 0; i < size; ++i ){\n\t\t\tunsigned long long int s = q.front();\n\t\t\tq.pop();\n\t\t\tint pos[ 2 ], a = 0;\n\t\t\tunsigned long long int t = s;\n\t\t\tfor( int j = 0; j < 13; ++j ){\n\t\t\t\tint b = t % 13;\n\t\t\t\tif( b == 0 ) pos[ a++ ] = 12 - j;\n\t\t\t\tt /= 13;\n\t\t\t}\n\t\t\tfor( int j = 0; j < 2; ++j ){\n\t\t\t\tint b = pos[ j ];\n\t\t\t\tfor( int k = 0; k < 4; ++k ){\n\t\t\t\t\tint c = side[ b ][ k ];\n\t\t\t\t\tif( c == -1 ) continue;\n\t\t\t\t\tt = slide( s, b, c );\n\t\t\t\t\tbool e = ans.find( t ) == ans.end();\n\t\t\t\t\tif( sub == NULL ){\n\t\t\t\t\t\tif( e ){\n\t\t\t\t\t\t\tans[ t ] = cnt;\n\t\t\t\t\t\t\tq.push( t );\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif( !e ){\n\t\t\t\t\t\t\treturn ans[ t ] + cnt;\n\t\t\t\t\t\t}else if( sub->find( t ) == sub->end() ){\n\t\t\t\t\t\t\t(*sub)[ t ] = cnt;\n\t\t\t\t\t\t\tq.push( t );\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++cnt;\n\t}\n\treturn -1;\n}\n\nint main()\n{\n\tmap< unsigned long long int, int > ans;\n\tqueue< unsigned long long int > q;\n\n\n\tint p[ 13 ];\n\tfor( int i = 0; i < 13; ++i ){\n\t\tp[ i ] = i;\n\t}\n\tp[ 12 ] = 0;\n\tunsigned long long int s = makeID( p );\n\tans[ s ] = 0;\n\tq.push( s );\n\n\tsolve( ans, q, p, NULL );\n\n\twhile( !q.empty() )q.pop();\n\n\twhile( cin >> p[ 0 ] && p [ 0 ] != -1 ){\n\t\tfor( int i = 1; i < 13; ++i ){\n\t\t\tcin >> p[ i ];\n\t\t}\n\t\tqueue< unsigned long long int > qq;\n\t\ts = makeID( p );\n\t\tqq.push( s );\n\t\tint r;\n\t\tmap< unsigned long long int, int > u;\n\t\tif( ans.find( s ) != ans.end() ){\n\t\t\tr = ans[ s ];\n\t\t}else{\n\t\t\tr = solve( ans, qq, p, &u );\n\t\t}\n\t\tif( r >= 0 ){\n\t\t\tcout << r << endl;\n\t\t}else{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 5144,
"score_of_the_acc": -0.1759,
"final_rank": 12
},
{
"submission_id": "aoj_0190_2006546",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\nusing namespace std;\n#define MAX_N 20\n#define WIDTH 100\nint OK[5][5] = { {0,0,1,0,0},{0,1,1,1,0},{1,1,1,1,1},{0,1,1,1,0},{0,0,1,0,0} };\nint dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };\npair<int, vector<vector<int>>> dp[MAX_N + 2][WIDTH], E[WIDTH * 10];\n\nint score(vector<vector<int>>p) {\n\tint sum = 0; pair<int, int>a[12], b[12]; int CNT = 0;\n\tfor (int i = 0; i < 25; i++) {\n\t\tif (p[i / 5][i % 5] >= 1)a[p[i / 5][i % 5]] = make_pair(i / 5, i % 5);\n\t}\n\tfor (int i = 5; i < 20; i++) {\n\t\tif (OK[i / 5][i % 5] == 1) { CNT++; b[CNT] = make_pair(i / 5, i % 5); }\n\t}\n\tfor (int i = 1; i <= 11; i++) { sum += abs(a[i].first - b[i].first) + abs(a[i].second - b[i].second); }\n\treturn sum;\n}\nvector<vector<int>> Move(vector<vector<int>>p, int x, int y,int dir) {\n\tswap(p[x + dx[dir]][y + dy[dir]], p[x][y]); return p;\n}\nint BeemSearch(vector<vector<int>>Z) {\n\tvector<vector<int>>GOAL; int CNT = 0;\n\tfor (int i = 0; i < 5; i++) { vector<int>GOAL2(5, -1); GOAL.push_back(GOAL2); }\n\tfor (int i = 5; i < 20; i++) {\n\t\tif (OK[i / 5][i % 5] == 1) { CNT++; GOAL[i / 5][i % 5] = CNT; }\n\t}\n\tGOAL[0][2] = 0; GOAL[4][2] = 0;\n\tif (Z == GOAL)return 0;\n\tdp[0][0] = make_pair(score(Z), Z);\n\tfor (int i = 0; i < MAX_N; i++) {\n\t\tint CNTS = 0;\n\t\tfor (int j = 0; j < WIDTH; j++) {\n\t\t\tif (dp[i][j].second.size() == 0)continue;\n\t\t\tvector<vector<int>>D = dp[i][j].second;\n\t\t\tfor (int k = 0; k < 25; k++) {\n\t\t\t\tif (D[k / 5][k % 5] != 0)continue;\n\t\t\t\tfor (int l = 0; l < 4; l++) {\n\t\t\t\t\tint cx = (k / 5) + dx[l], cy = (k % 5) + dy[l];\n\t\t\t\t\tif (cx < 0 || cx >= 5 || cy < 0 || cy >= 5)continue;\n\t\t\t\t\tif (D[cx][cy] <= 0)continue;\n\t\t\t\t\tvector<vector<int>>D2 = Move(D, k / 5, k % 5, l);\n\t\t\t\t\tE[CNTS] = make_pair(score(D2), D2); CNTS++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsort(E, E + CNTS); dp[i + 1][0] = E[0]; int CNT2 = 1;\n\t\tif (E[0].first == 0)return i + 1;\n\t\tfor (int j = 1; j < CNTS; j++) {\n\t\t\tif (E[j - 1] != E[j]) { dp[i + 1][CNT2] = E[j]; CNT2++; }\n\t\t\tif (CNT2 == WIDTH)break;\n\t\t}\n\t}\n\treturn -1;\n}\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < MAX_N + 2; i++) {\n\t\t\tfor (int j = 0; j < WIDTH; j++) {\n\t\t\t\tvector<vector<int>>ZERO; dp[i][j] = make_pair(0, ZERO);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < WIDTH * 10; i++) { vector<vector<int>>ZERO; E[i] = make_pair(0, ZERO); }\n\t\tvector<vector<int>>C;\n\t\tfor (int i = 0; i < 5; i++) { vector<int>C2(5, -1); C.push_back(C2); }\n\t\tcin >> C[0][2]; if (C[0][2] == -1)break;\n\t\tfor (int i = 1; i < 4; i++)cin >> C[1][i];\n\t\tfor (int i = 0; i < 5; i++)cin >> C[2][i];\n\t\tfor (int i = 1; i < 4; i++)cin >> C[3][i]; cin >> C[4][2];\n\t\tint ret = BeemSearch(C);\n\t\tif (ret == -1)cout << \"NA\" << endl; else cout << ret << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3928,
"score_of_the_acc": -0.153,
"final_rank": 9
}
] |
aoj_0199_cpp
|
難儀な人たちが座る椅子
4つの国の中心にある中立都市アイズシティには、大陸横断列車バンダイ号のホームがあります。 ホームには、バンダイ号を待つ乗客用の椅子が一列に用意されており、ホームに入ってきた人は自由に椅子を利用することができます。
このバンダイ号、安いし早いし快適ということで、周囲の4つの国からの利用者が絶えません。今日は開通記念日ということで、ホームに座っている人たちに特別なことをしてあげようと思っています。そのためには、改札を通った人たちがどこに座っているか把握しなければなりません。4つの国の人たちの難儀な性格を考慮して、椅子がどのように埋まっているかをシミュレートするプログラムを作成してください。改札を通った人たちは、次々に一列に並んだ椅子に座っていきます。4つの国の人たちは、国ごとに決まった性格と座り方があります。それぞれの座り方は以下の通りです。
A国人の性格
A 国人は座れればいい。左端から見ていき空いている椅子に座る。
B国人の性格
B 国人は A 国人が苦手。 A 国人の隣以外で、右端から空いている椅子に座る。ただし、 A国人の隣しか空いていない場合、我慢して左端から空いている椅子に座る。
C国人の性格
C 国人は人の隣に座りたい。左側から順に座っている人を見ていき、一番左側に座っている人 の右隣に座ろうとするが、そこが埋まっているならその人の左隣に座ろうとする。そこも埋まっ ているなら次の人の隣に同条件で座ろうとする。どの椅子にも人が座っていなければ真ん中(椅子の数
n
が奇数の場合 (
n
+1)/2 、偶数の場合
n
/2+1 )の椅子に座る。
D国人の性格
D 国人は人の隣に座りたくない。一番近い人との距離が、一番大きくなる椅子に座ろうとする。同条件の椅子が複数ある場合や、どうしても誰かの隣に座らなければならない場合、その中で一番左側にある椅子に座る。誰も座っていない場合は左端の椅子に座る。
バンダイ号に乗ろうとしている乗客の情報を入力とし、 椅子にどのように座っているかを出力するプログラムを作成してください。左から順番に座っている人の国籍を出力します。ただし、空席の場合は # (半角シャープ)を出力してください。
Input
複数のデータセットの並びが入力として与えられます。 入力の終わりはゼロふたつの行で示されます。
各データセットは以下の形式で与えられます。
n
m
a
1
a
2
:
a
m
1 行目に椅子の数
n
(1 ≤
n
≤ 100) と乗客の数
m
(
m
≤
n
) が与えられます。続く
m
行に
i
人目の情報
a
i
が与えられます。
a
i
は１つの文字で、'A' ならば A 国人、'B' ならば B 国人、'C' ならば C 国人、'D' ならば D 国人を表します。
データセットの数は 100 を超えません。
Output
データセットごとに、最終的な椅子の状態を１行に出力します。
Sample Input
5 4
A
B
C
D
5 4
D
C
B
A
0 0
Output for the Sample Input
ACD#B
DCA#B
|
[
{
"submission_id": "aoj_0199_4840157",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n string a(n, '#');\n for(int i=0; i<m; i++){\n char c;\n cin >> c;\n if(c == 'A'){\n for(int j=0; j<n; j++){\n if(a[j] == '#'){\n a[j] = 'A';\n break;\n } \n }\n }else if(c == 'B'){\n bool ok = false;\n for(int j=n-1; j>=0; j--){\n if(a[j] != '#') continue;\n if((j==0 or a[j-1]!='A') and (j==n-1 or a[j+1]!='A')){\n a[j] = 'B';\n ok = true;\n break;\n }\n }\n if(!ok){\n for(int j=0; j<n; j++){\n if(a[j] == '#'){\n a[j] = 'B';\n break;\n } \n }\n }\n }else if(c == 'C'){\n if(i == 0){\n a[n/2] = 'C';\n }else{\n for(int j=0; j<n-1; j++){\n if(a[j] == '#') continue;\n if(a[j+1] == '#'){\n a[j+1] = 'C';\n break;\n }else if(j!=0 and a[j-1]=='#'){\n a[j-1] = 'C';\n break;\n }\n }\n }\n }else{\n vector<int> b(n, 999);\n for(int j=0; j<n; j++){\n if(a[j] != '#') b[j] = 0;\n }\n for(int j=0; j<n; j++){\n for(int k=0; k<n; k++){\n if(k!=0) b[k] = min(b[k], b[k-1]+1);\n if(k!=n-1) b[k] = min(b[k], b[k+1]+1);\n }\n }\n int me = *max_element(b.begin(), b.end());\n for(int j=0; j<n; j++){\n if(b[j] == me){\n a[j] = 'D';\n break;\n }\n }\n }\n }\n cout << a << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3008,
"score_of_the_acc": -1.91,
"final_rank": 9
},
{
"submission_id": "aoj_0199_4815211",
"code_snippet": "#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define ALL(a) (a).begin(), (a).end()\n\nint get_d(vector<string> seat, int idx, int n)\n// idxから最短にいる人の距離を返す\n// seat:座席\n// n : seat length\n{\n\tint left_idx, right_idx;\n\trep(i, n)\n\t{\n\t\t// 左右に1つずつ増やしていく\n\t\tleft_idx = idx - i;\n\t\tright_idx = idx + i;\n\t\tif (left_idx >= 0 && seat[left_idx] != \"#\") // !(\"#\") <=> 人がいる\n\t\t{\n\t\t\treturn i;\n\t\t}\n\n\t\tif (right_idx < n && seat[right_idx] != \"#\")\n\t\t{\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn 0; // warningがうざいのでつけています\n}\n\nint where(vector<string> seat, string person, int n)\n// personが座る位置を返す\n// seat: 座席の状態\n// n: seat length\n{\n if (person == \"A\")\n {\n rep(i, n)\n {\n if (seat[i] == \"#\"){ // 空席なら座る\n return i;\n }\n }\n }\n else if (person == \"B\")\n {\n // 右から見ていく\n for (int i = n - 1; i >= 0; i--)\n { \n // out-of-boundsになるので場合わけ\n if (i == n - 1)\n {\n if (seat[i - 1] != \"A\" && seat[i] == \"#\"){ // 空席かつ左隣がA国人ではない\n return i;\n }\n }\n else if (i == 0)\n {\n if (seat[i + 1] != \"A\" && seat[i] == \"#\"){ // 空席かつ右隣がA国人ではない\n return i;\n }\n }\n else\n {\n if (seat[i - 1] != \"A\" && seat[i + 1] != \"A\" && seat[i] == \"#\"){ // 空席かつ左右がA国人ではない\n return i;\n }\n }\n }\n rep(i, n)\n {\n // A国人の隣しか空いていないなら、左から見ていって空いている席に座る\n if (seat[i] == \"#\"){\n return i;\n }\n }\n }\n else if (person == \"C\")\n {\n vector<string> initial_seat(n, \"#\");\n // 誰も座っていない <=> 全部 \"#\" なら中央に座る\n if (initial_seat == seat)\n {\n return n / 2;\n }\n else\n {\n // 左から見ていく。\n for (int i = 0; i < n; i++)\n {\n if (seat[i] != \"#\") // 人が座っているなら\n {\n if (i < n - 1 && seat[i + 1] == \"#\") // 右側に座ろうとする\n {\n return i + 1;\n }\n else if (i > 0 && seat[i - 1] == \"#\") // それがダメなら左側\n {\n return i - 1;\n }\n }\n }\n }\n }\n else if (person == \"D\")\n {\n vector<string> initial_seat(n, \"#\");\n // 誰も座っていなければ左端に座る\n if (initial_seat == seat)\n {\n return 0;\n }\n else\n {\n // md: 最大の距離\n // max_idx: その時のidx\n int md = -1;\n int max_idx = -1;\n rep(i, n)\n {\n int d = get_d(seat, i, n);\n if (d > md)\n {\n md = d;\n max_idx = i;\n }\n }\n return max_idx;\n }\n }\n else\n {\n cout << \"ignore\" << endl;\n return 1000001;\n }\n return 0; // warningがうざいのでつけています\n}\n\nvoid output(vector<string> seat)\n{\n for (string seet : seat)\n {\n cout << seet;\n }\n cout << endl;\n}\n\nint main()\n{\n int n, m;\n string person;\n while (true)\n {\n cin >> n >> m;\n if (n == 0 && m == 0) {\n break;\n }\n vector<string> seat(n, \"#\");\n rep(i, m)\n {\n cin >> person;\n int idx = where(seat, person, n);\n //output(seat);\n seat[idx] = person;\n }\n output(seat);\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3192,
"score_of_the_acc": -2,
"final_rank": 11
},
{
"submission_id": "aoj_0199_4815168",
"code_snippet": "#define _GLIBCXX_DEBUG\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define ALL(a) (a).begin(), (a).end()\n\nvoid output(vector<string> seat)\n{\n\tfor (string seet : seat)\n\t{\n\t\tcout << seet;\n\t}\n\tcout << endl;\n}\n\nint get_d(vector<string> seat, int idx, int n)\n// idxから最短にいる人の距離を返す\n// seat:座席\n// n : seat length\n{\n\tint left_idx, right_idx;\n\trep(i, n)\n\t{\n\t\t// 左右に1つずつ増やしていく\n\t\tleft_idx = idx - i;\n\t\tright_idx = idx + i;\n\t\tif (left_idx >= 0 && seat[left_idx] != \"#\") // !(\"#\") <=> 人がいる\n\t\t{\n\t\t\treturn i;\n\t\t}\n\n\t\tif (right_idx < n && seat[right_idx] != \"#\")\n\t\t{\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn 0; // warningがうざいのでつけています\n}\n\nint where(vector<string> seat, string person, int n)\n// personが座る位置を返す\n// seat: 座席の状態\n// n: seat length\n{\n\tif (person == \"A\")\n\t{\n\t\trep(i, n)\n\t\t{\n\t\t\tif (seat[i] == \"#\") // 空席なら座る\n\t\t\t\treturn i;\n\t\t}\n\t}\n\telse if (person == \"B\")\n\t{\n\t\t// 右から見ていく\n\t\tfor (int i = n - 1; i >= 0; i--)\n\t\t{\n\t\t\t// out-of-boundsになるので場合わけ\n\t\t\tif (i == n - 1)\n\t\t\t{\n\t\t\t\tif (seat[i - 1] != \"A\" && seat[i] == \"#\") // 空席かつ左隣がA国人ではない\n\t\t\t\t\treturn i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if (i == 0)\n\t\t\t{\n\t\t\t\tif (seat[i + 1] != \"A\" && seat[i] == \"#\") // 空席かつ右隣がA国人ではない\n\t\t\t\t\treturn i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (seat[i - 1] != \"A\" && seat[i + 1] != \"A\" && seat[i] == \"#\") // 空席かつ左右がA国人ではない\n\t\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\trep(i, n)\n\t\t{\n\t\t\t// A国人の隣しか空いていないなら、左から見ていって空いている席に座る\n\t\t\tif (seat[i] == \"#\")\n\t\t\t\treturn i;\n\t\t}\n\t}\n\telse if (person == \"C\")\n\t{\n\t\tvector<string> initial_seat(n, \"#\");\n\t\t// 誰も座っていない <=> 全部 \"#\" なら中央に座る\n\t\tif (initial_seat == seat)\n\t\t{\n\t\t\tif (n % 2 == 0)\n\t\t\t{\n\t\t\t\treturn (n / 2);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn n / 2;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// 左から見ていく。\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t{\n\t\t\t\tif (seat[i] != \"#\") // 人が座っているなら\n\t\t\t\t{\n\t\t\t\t\tif (i < n - 1 && seat[i + 1] == \"#\") // 右側に座ろうとする\n\t\t\t\t\t{\n\t\t\t\t\t\treturn i + 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (i > 0 && seat[i - 1] == \"#\") // それがダメなら左側\n\t\t\t\t\t{\n\t\t\t\t\t\treturn i - 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\telse if (person == \"D\")\n\t{\n\t\tvector<string> initial_seat(n, \"#\");\n\t\t// 誰も座っていなければ左端に座る\n\t\tif (initial_seat == seat)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// md: 最大の距離\n\t\t\t// max_idx: その時のidx\n\t\t\tint md = -1;\n\t\t\tint max_idx = -1;\n\t\t\trep(i, n)\n\t\t\t{\n\t\t\t\tint d = get_d(seat, i, n);\n\t\t\t\t// cout<<d<<endl;\n\t\t\t\tif (d > md)\n\t\t\t\t{\n\t\t\t\t\tmd = d;\n\t\t\t\t\tmax_idx = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_idx;\n\t\t}\n\t}\n\telse\n\t{\n\t\tcout << \"ignore\" << endl;\n\t\treturn 1001;\n\t}\n\treturn 0; // warningがうざいのでつけています\n}\n\nint main()\n{\n\tint n, m;\n\tstring person;\n\twhile (true)\n\t{\n\t\tcin >> n >> m;\n\t\tif (n == 0 && m == 0)\n\t\t\tbreak;\n\t\tvector<string> seat(n, \"#\");\n\t\trep(i, m)\n\t\t{\n\t\t\tcin >> person;\n\t\t\t// output(seat);\n\t\t\tint idx = where(seat, person, n);\n\t\t\tseat[idx] = person;\n\t\t}\n\t\toutput(seat);\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3116,
"score_of_the_acc": -1.9628,
"final_rank": 10
},
{
"submission_id": "aoj_0199_4815108",
"code_snippet": "#define _GLIBCXX_DEBUG\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define ALL(a) (a).begin(), (a).end()\n\nvoid output(vector<string> seat)\n{\n\tfor (string seet : seat)\n\t{\n\t\tcout << seet;\n\t}\n\tcout << endl;\n}\n\nint get_d(vector<string> seat, int idx, int n)\n// idxから最短にいる人の距離を返す\n// seat:座席\n// n : seat length\n{\n\tint left_idx, right_idx;\n\trep(i, n)\n\t{\n\t\t// 左右に1つずつ増やしていく\n\t\tleft_idx = idx - i;\n\t\tright_idx = idx + i;\n\t\tif (left_idx >= 0 && seat[left_idx] != \"#\") // !(\"#\") <=> 人がいる\n\t\t{\n\t\t\treturn i;\n\t\t}\n\n\t\tif (right_idx < n && seat[right_idx] != \"#\")\n\t\t{\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn 0; // warningがうざいのでつけています\n}\n\nint where(vector<string> seat, string person, int n)\n// personが座る位置を返す\n// seat: 座席の状態\n// n: seat length\n{\n\tif (person == \"A\")\n\t{\n\t\trep(i, n)\n\t\t{\n\t\t\tif (seat[i] == \"#\") // 空席なら座る\n\t\t\t\treturn i;\n\t\t}\n\t}\n\telse if (person == \"B\")\n\t{\n\t\t// 右から見ていく\n\t\tfor (int i = n - 1; i >= 0; i--)\n\t\t{\n\t\t\t// out-of-boundsになるので場合わけ\n\t\t\tif (i == n - 1)\n\t\t\t{\n\t\t\t\tif (seat[i - 1] != \"A\" && seat[i] == \"#\") // 空席かつ左隣がA国人ではない\n\t\t\t\t\treturn i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if (i == 0)\n\t\t\t{\n\t\t\t\tif (seat[i + 1] != \"A\" && seat[i] == \"#\") // 空席かつ右隣がA国人ではない\n\t\t\t\t\treturn i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (seat[i - 1] != \"A\" && seat[i + 1] != \"A\" && seat[i] == \"#\") // 空席かつ左右がA国人ではない\n\t\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\trep(i, n)\n\t\t{\n\t\t\t// A国人の隣しか空いていないなら、左から見ていって空いている席に座る\n\t\t\tif (seat[i] == \"#\")\n\t\t\t\treturn i;\n\t\t}\n\t}\n\telse if (person == \"C\")\n\t{\n\t\tvector<string> initial_seat(n, \"#\");\n\t\t// 誰も座っていない <=> 全部 \"#\" なら中央に座る\n\t\tif (initial_seat == seat)\n\t\t{\n\t\t\tif (n % 2 == 0)\n\t\t\t{\n\t\t\t\treturn (n / 2);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn n / 2;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// 左から見ていく。\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t{\n\t\t\t\tif (seat[i] != \"#\") // 人が座っているなら\n\t\t\t\t{\n\t\t\t\t\tif (i < n - 1 && seat[i + 1] == \"#\") // 右側に座ろうとする\n\t\t\t\t\t{\n\t\t\t\t\t\treturn i + 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (i > 0 && seat[i - 1] == \"#\") // それがダメなら左側\n\t\t\t\t\t{\n\t\t\t\t\t\treturn i - 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\telse if (person == \"D\")\n\t{\n\t\tvector<string> initial_seat(n, \"#\");\n\t\t// 誰も座っていなければ左端に座る\n\t\tif (initial_seat == seat)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// md: 最大の距離\n\t\t\t// max_idx: その時のidx\n\t\t\tint md = -1;\n\t\t\tint max_idx = -1;\n\t\t\trep(i, n)\n\t\t\t{\n\t\t\t\tint d = get_d(seat, i, n);\n\t\t\t\t// cout<<d<<endl;\n\t\t\t\tif (d > md)\n\t\t\t\t{\n\t\t\t\t\tmd = d;\n\t\t\t\t\tmax_idx = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_idx;\n\t\t}\n\t}\n\telse\n\t{\n\t\tcout << \"ignore\" << endl;\n\t\treturn 1001;\n\t}\n\treturn 0; // warningがうざいのでつけています\n}\n\nint main()\n{\n\tint n, m;\n\tstring person;\n\twhile (true)\n\t{\n\t\tcin >> n >> m;\n\t\tif (n == 0 && m == 0)\n\t\t\tbreak;\n\t\tvector<string> seat(n, \"#\");\n\t\trep(i, m)\n\t\t{\n\t\t\tcin >> person;\n\t\t\t// output(seat);\n\t\t\tint idx = where(seat, person, n);\n\t\t\tseat[idx] = person;\n\t\t}\n\t\toutput(seat);\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3000,
"score_of_the_acc": -1.9061,
"final_rank": 8
},
{
"submission_id": "aoj_0199_1978775",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cmath>\n#include <algorithm>\n//#include <set>\n\nint n, m; //テヲツ、ツ?・ツュツ? テ、ツコツコ\n\nint main() {\n while(std::cin >> n >> m, n + m) {\n std::string str(n, '#');\n\n char q;\n for(int a = 0; a < m; ++a) {\n std::cin >> q;\n\n bool ok;\n switch(q) {\n case 'A':\n str[str.find(\"#\")] = 'A';\n break;\n case 'B':\n ok = false;\n for(int i = n - 1; i >= 0; --i) {\n if((i == 0 || str[i - 1] != 'A') && (i == n - 1 || str[i + 1] != 'A') && str[i] == '#') {\n ok = true;\n str[i] = 'B';\n break;\n }\n }\n if(!ok) {\n str[str.find(\"#\")] = 'B';\n }\n break;\n case 'C':\n ok = false;\n for(int i = 0; i < n; ++i) {\n if(str[i] != '#') {\n if(i != n - 1 && str[i + 1] == '#') {\n str[i + 1] = 'C';\n ok = true; break;\n }\n if(i != 0 && str[i - 1] == '#') {\n str[i - 1] = 'C';\n ok = true; break;\n }\n }\n }\n\n if(!ok) {\n str[n / 2] = 'C';\n }\n break;\n case 'D':\n int dist[101];\n for(int i = 0; i < n; ++i) {\n int d = 1e+9;\n if(str[i] == '#') {\n for(int j = 0; j < n; ++j) {\n if(str[j] != '#') {\n d = std::min(d, std::abs(i - j));\n }\n }\n }else {\n d = 0;\n }\n \n dist[i] = d;\n }\n\n int maxIdx = 0;\n for(int i = 1; i < n; ++i) {\n if(dist[i] > dist[maxIdx]) {\n maxIdx = i;\n }\n }\n\n str[maxIdx] = 'D';\n\n break;\n }\n// std::cout << str << std::endl;\n }\n\n std::cout << str << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1204,
"score_of_the_acc": -0.0274,
"final_rank": 5
},
{
"submission_id": "aoj_0199_1978774",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cmath>\n#include <algorithm>\n//#include <set>\n\nint n, m; //??????, ???\n\nint main() {\n while(std::cin >> n >> m, n + m) {\n std::string str(n, '#');\n\n char q;\n for(int a = 0; a < m; ++a) {\n std::cin >> q;\n\n bool ok;\n switch(q) {\n case 'A':\n str[str.find(\"#\")] = 'A';\n break;\n case 'B':\n ok = false;\n for(int i = n - 1; i >= 0; --i) {\n if((i == 0 || str[i - 1] != 'A') && (i == n - 1 || str[i + 1] != 'A') && str[i] == '#') {\n ok = true;\n str[i] = 'B';\n break;\n }\n }\n if(!ok) {\n str[str.find(\"#\")] = 'B';\n }\n break;\n case 'C':\n ok = false;\n for(int i = 0; i < n; ++i) {\n if(str[i] != '#') {\n if(i != n - 1 && str[i + 1] == '#') {\n str[i + 1] = 'C';\n ok = true; break;\n }\n if(i != 0 && str[i - 1] == '#') {\n str[i - 1] = 'C';\n ok = true; break;\n }\n }\n }\n\n if(!ok) {\n str[n / 2] = 'C';\n }\n break;\n case 'D':\n int dist[101];\n for(int i = 0; i < n; ++i) {\n int d = 1e+9;\n if(str[i] == '#') {\n for(int j = 0; j < n; ++j) {\n if(str[j] != '#') {\n d = std::min(d, std::abs(i - j));\n }\n }\n }else {\n d = 0;\n }\n \n dist[i] = d;\n }\n\n int maxIdx = 0;\n for(int i = 1; i < n; ++i) {\n if(dist[i] > dist[maxIdx]) {\n maxIdx = i;\n }\n }\n\n str[maxIdx] = 'D';\n\n break;\n }\n// std::cout << str << std::endl;\n }\n\n std::cout << str << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1204,
"score_of_the_acc": -0.0274,
"final_rank": 5
},
{
"submission_id": "aoj_0199_1941460",
"code_snippet": "/*\n * src.cpp\n *\n * Created on: 2016/07/27\n * Author: joi\n */\n\n#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,a) FOR(i,0,a)\n\nusing namespace std;\n\nconst int MAX_N=1e2,INF=1e8;\n\nint n,m;\n\nchar chairs[MAX_N+1];\n\nint dist(int a){\n\tint res=INF;\n\tREP(i,n){\n\t\tif (chairs[i]!='#'){\n\t\t\tres=min(res,abs(i-a));\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(){\n\tdo{\n\t\tcin>>n>>m;\n\t\tif (n || m){\n\t\t\tcin.ignore();\n\t\t\tREP(i,n){\n\t\t\t\tchairs[i]='#';\n\t\t\t}\n\t\t\tchairs[n]=0;\n\t\t\tREP(i,m){\n\t\t\t\tchar c;\n\t\t\t\tcin>>c;\n\t\t\t\tswitch (c){\n\t\t\t\tcase 'A':{\n\t\t\t\t\tREP(i,n){\n\t\t\t\t\t\tif (chairs[i]=='#'){\n\t\t\t\t\t\t\tchairs[i]='A';\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\tcase 'B':{\n\t\t\t\t\tint v=-1;\n\t\t\t\t\tfor (int i=n-1;i>=0;i--){\n\t\t\t\t\t\tif (chairs[i]=='#'){\n\t\t\t\t\t\t\tif (i!=0){\n\t\t\t\t\t\t\t\tif (chairs[i-1]=='A'){\n\t\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (i+1!=n){\n\t\t\t\t\t\t\t\tif (chairs[i+1]=='A'){\n\t\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tv=i;\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\tif (v!=-1){\n\t\t\t\t\t\tchairs[v]='B';\n\t\t\t\t\t}else{\n\t\t\t\t\t\tREP(i,n){\n\t\t\t\t\t\t\tif (chairs[i]=='#'){\n\t\t\t\t\t\t\t\tchairs[i]='B';\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 'C':{\n\t\t\t\t\tif (i==0){\n\t\t\t\t\t\tif (n%2==1){\n\t\t\t\t\t\t\tchairs[(n+1)/2-1]='C';\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tchairs[n/2]='C';\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tREP(i,n){\n\t\t\t\t\t\t\tif (chairs[i]!='#'){\n\t\t\t\t\t\t\t\tif (i+1!=n && chairs[i+1]=='#'){\n\t\t\t\t\t\t\t\t\tchairs[i+1]='C';\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (i!=0 && chairs[i-1]=='#'){\n\t\t\t\t\t\t\t\t\tchairs[i-1]='C';\n\t\t\t\t\t\t\t\t\tbreak;\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\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 'D':{\n\t\t\t\t\tint a=0,d=dist(0);\n\t\t\t\t\tFOR(i,1,n){\n\t\t\t\t\t\tif (dist(i)>d){\n\t\t\t\t\t\t\ta=i;\n\t\t\t\t\t\t\td=dist(i);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tchairs[a]='D';\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<chairs<<endl;\n\t\t}\n\t}while(n || m);\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0039,
"final_rank": 2
},
{
"submission_id": "aoj_0199_1397343",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// 12:46\n\nstring chair;\n\n\nint goA(char c){\n\tfor(int i = 0 ; i < chair.size() ; i++)\n\t\tif( chair[i] == '#'){\n\t\t\tchair[i] = c;\n\t\t\treturn 1;\n\t\t}\n\treturn 0;\n}\nint goB(char c){\n\tfor(int i = chair.size() -1 ; i >= 0 ; i--)\n\t\tif( chair[i] == '#' && (!i||chair[i-1]!='A') && (i+1==chair.size()||chair[i+1]!='A') ){\n\t\t\tchair[i] = c;\n\t\t\treturn 1;\n\t\t}\n\treturn goA(c);\n}\nint goC(char c){\n\tif( count(chair.begin(),chair.end(),'#') == chair.size() ){\n\t\tif( chair.size() % 2 ) chair[(1+chair.size())/2-1] = c;\n\t\telse chair[chair.size()/2] = c;\n\t\treturn 1;\n\t}\n\tfor(int i = 0 ; i < chair.size() ; i++)\n\t\tif( chair[i] != '#'){\n\t\t\tfor(int j = 1 ; j >= -1 ; j--){\n\t\t\t\tif( i+j >= 0 && i+j < chair.size() && chair[i+j] == '#' ){\n\t\t\t\t\tchair[i+j] = c;\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\treturn 0;\n}\nint goD(char c){\n\tint pos;\n\tint dst = -2e9;\n\tfor(int i = 0 ; i < chair.size() ; i++){\n\t\tif( chair[i] == '#' ){\n\t\t\tint dist = 1e9;\n\t\t\tfor(int j = 0 ; j < chair.size() ; j++)\n\t\t\t\tif( chair[j] != '#') dist = min(dist,abs(i-j));\n\n\t\t\tif( dst < dist){\n\t\t\t\tdst = dist;\n\t\t\t\tpos = i;\n\t\t\t}\n\t\t}\n\t}\n\tchair[pos] = c;\n\treturn 1;\n}\n\n\nint main(){\n\tint n,m;\n\twhile( cin >> n >> m && n ){\n\t\tchair = string(n,'#');\n\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\tchar c; cin >> c;\n\t\t\tif( c == 'A' ) goA(c);\n\t\t\tif( c == 'B' ) goB(c);\n\t\t\tif( c == 'C' ) goC(c);\n\t\t\tif( c == 'D' ) goD(c);\n\t\t}\n\t\tcout << chair << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0294,
"final_rank": 7
},
{
"submission_id": "aoj_0199_1364308",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) REP((i),0,(n))\n#define RREP(i,a,b) for(int i=(int)(a);i>=(int)(b);i--)\n#define rrep(i,n) RREP(i,n,0)\n#define each(it,X) for(__typeof((X).begin()) it=(X).begin();it!=(X).end();it++)\n#define all(v) ((v).begin(),(v).end())\n#define fi first\n#define se second\n#define pb push_back\ntypedef pair<int,int>pr;\ntypedef vector<int>vi;\ntypedef vector<vi>vvi;\ntypedef set<int>si;\nconst int INF=1070000000ll;\nconst int mod=1000000007ll;\n\nint n,m;\nchar seet[100];\nvoid A(){\n rep(i,n)if(seet[i]=='#'){\n seet[i]='A';\n return;\n }\n}\nvoid B(){\n rrep(i,n-1)if(seet[i]=='#'){\n if((i!=0||seet[i-1]!='A')&&(i!=n-1||seet[i+1]!='A')){\n seet[i]='B';\n return;\n }\n }\n rep(i,n)if(seet[i]=='#'){\n seet[i]='B';\n return;\n }\n}\nvoid C(){\n rep(i,n)if(seet[i]!='#'){\n if(i!=n-1&&seet[i+1]=='#'){\n seet[i+1]='C';return;\n }\n if(i!=0&&seet[i-1]=='#'){\n seet[i-1]='C';return;\n }\n }\n seet[n/2]='C';\n}\nvoid D(){\n int ma=0,dist=0;\n rep(i,n)if(seet[i]=='#'){\n int v=1000;\n rep(j,n)if(seet[j]!='#'){\n v=min(abs(i-j),v);\n }\n if(dist<v){\n dist=v;\n ma=i;\n }\n }\n seet[ma]='D';\n}\nsigned main(){\n cin.tie(0);ios_base::sync_with_stdio(0);\n\n while(cin>>n>>m,n||m){\n fill_n(seet,n,'#');\n rep(i,m){\n char c;cin>>c;\n switch(c){\n case 'A':A();break;\n case 'B':B();break;\n case 'C':C();break;\n case 'D':D();break;\n }\n }\n rep(i,n)cout<<seet[i];cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.0254,
"final_rank": 4
},
{
"submission_id": "aoj_0199_1106271",
"code_snippet": "#include <iostream>\n#include <cstdlib>\n#include <string>\nusing namespace std;\n\nchar chair[128];\nint n, m;\nconst int M = 2;\n\nvoid A() {\n\tfor(int i = 0; i < n; i++) {\n\t\tif(chair[i+M] == 'N') {\n\t\t\tchair[i+M] = 'A';\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid B() {\n\tfor(int i = n-1; i >= 0; i--) {\n\t\tif(chair[i+M] == 'N' && chair[i+1+M] != 'A' && chair[i-1+M] != 'A') {\n\t\t\tchair[i+M] = 'B';\n\t\t\treturn;\n\t\t}\n\t}\n\tfor(int i = 0; i < n; i++) {\n\t\tif(chair[i+M] == 'N') {\n\t\t\tchair[i+M] = 'B';\n\t\t\treturn;\n\t\t}\n\t}\n}\n\nvoid C() {\n\tfor(int i = 0; i < n; i++) {\n\t\t/*\n\t\tif(chair[i+M] == 'N' && (chair[i-1+M] != 'N' || chair[i+1+M] != 'N')) {\n\t\t\tchair[i+M] = 'C';\n\t\t\treturn;\n\t\t}\n\t\t*/\n\t\tif(chair[i+M] != 'N') {\n\t\t\tif(chair[i+1+M] == 'N' && i+1 < n) {\n\t\t\t\tchair[i+1+M] = 'C';\n\t\t\t\treturn;\n\t\t\t}\n\t\t\telse if(chair[i-1+M] == 'N' && i-1 >= 0) {\n\t\t\t\tchair[i-1+M] = 'C';\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\tchair[n/2+M] = 'C';\n}\n\nvoid D() {\n\tint mx = 0;\n\tint indx = 0;\n\tfor(int i = 0; i < n; i++) {\n\t\tif(chair[i+M] == 'N') {\n\t\t\tint mn = 1000;\n\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\tif(chair[j+M] != 'N') {\n\t\t\t\t\tif(mn > abs(j - i))\n\t\t\t\t\t\tmn = abs(j - i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(mn > mx) {\n\t\t\t\tmx = mn;\n\t\t\t\tindx = i;\n\t\t\t}\n\t\t}\n\t}\n\tchair[indx+M] = 'D';\n}\n\nint main() {\n\twhile(cin >> n >> m, n || m) {\n\t\tfor(int i = 0; i < 128; i++)\n\t\t\tchair[i] = 'N';\n\t\tfor(int i = 0; i < m; i++) {\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\tif(s[0] == 'A')\n\t\t\t\tA();\n\t\t\telse if(s[0] == 'B')\n\t\t\t\tB();\n\t\t\telse if(s[0] == 'C')\n\t\t\t\tC();\n\t\t\telse\n\t\t\t\tD();\n\t\t}\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tcout << (chair[i+M] == 'N' ? '#' : chair[i+M]);\n\t\t}\n\t\tcout << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0235,
"final_rank": 3
},
{
"submission_id": "aoj_0199_948478",
"code_snippet": "#include <iostream>\n#include <algorithm>\n\n#define MAX 100\n\nusing namespace std;\n\nint n,m;\nchar chair[MAX+2];\n \nvoid A(){\n for(int i = 1 ; i <= n ; i++){\n if(chair[i] == '#'){\n chair[i] = 'A';\n return;\n }\n }\n}\n\nvoid B(){\n int pos = -1;\n \n for(int i = 1 ; i <= n ; i++){\n if(chair[i] == 'A'){\n pos = i;\n break;\n }\n }\n \n if(pos == -1){\n for(int i = n ; i > 0 ; i--){\n if(chair[i] == '#'){\n chair[i] = 'B';\n return;\n } \n }\n }\n else{\n for(int i = n ; i > 0 ; i--){\n if(chair[i] == '#' && chair[i-1] != 'A' && chair[i+1] != 'A'){\n\tchair[i] = 'B';\n\treturn;\n }\n }\n \n for(int i = 1 ; i <= n ; i++){\n if(chair[i] == '#'){\n chair[i] = 'B';\n return;\n }\n }\n }\n}\n \nvoid C(){\n int cnt = count(chair,chair+n,'#');\n \n if(cnt == n){\n if(n % 2){\n chair[(n+1)/2] = 'C';\n }\n else{\n chair[n/2+1] = 'C';\n }\n }\n else{\n for(int i = 1 ; i <= n ; i++){\n if(chair[i] != '#' && chair[i+1] == '#' && i != n){\n chair[i+1] = 'C';\n return;\n }\n if(chair[i] != '#' && chair[i-1] == '#' && i != 1){\n chair[i-1] = 'C';\n return;\n }\n }\n }\n}\n \nvoid D(){\n int Breadth = 0, pos;\n int cnt = count(chair,chair+n,'#');\n\n if(cnt == n){\n chair[1] = 'D';\n return;\n } \n\n for(int i = 1 ; i <= n ; i++){\n int dist = (1<<29);\n if(chair[i] != '#') continue;\n for(int j = 1 ; j <= n ; j++){\n if(chair[j] != '#'){\n dist = min(dist,abs(j-i)+1);\n }\n }\n if(Breadth < dist){\n Breadth = dist;\n pos = i;\n } \n }\n \n chair[pos] = 'D';\n}\n \nint main(){\n while(cin >> n >> m , n | m){\n char person;\n \n for(int i = 0 ; i <= n+1 ; i++){\n chair[i] = '#';\n }\n \n for(int i = 0 ; i < m ; i++){\n cin >> person;\n \n switch(person){\n case 'A': \n A(); \n break;\n case 'B': \n B(); \n break;\n case 'C': \n C(); \n break;\n case 'D': \n D(); \n break;\n }\n \n }\n \n for(int i = 1 ; i <= n ; i++){\n cout << chair[i];\n }\n cout << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1148,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_0206_cpp
|
旅行はいつ?
あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある友人はなかなか旅行費用を貯めることができません。友人が今の生活を続けていると、旅行に行くのはいつになってしまうか分かりません。そこで、早く旅行に行きたいあなたは、友人が計画的に貯蓄することを助けるプログラムを作成することにしました。
友人のある月のお小遣いを
M
円、その月に使うお金を
N
円とすると、その月は (
M
-
N
) 円貯蓄されます。毎月の収支情報
M
、
N
を入力とし、貯蓄額が旅行費用
L
に達するのにかかる月数を出力するプログラムを作成してください。ただし、12 ヶ月を過ぎても貯蓄額が旅行費用に達しなかった場合はNA と出力してください。
Input
複数のデータセットの並びが入力として与えられます。 入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
L
M
1
N
1
M
2
N
2
:
M
12
N
12
1 行目に旅行費用
L
(1 ≤
L
≤ 1000000, 整数) が与えられます。続く 12 行に、
i
月目の収支情報
M
i
,
N
i
(0 ≤
M
i
, N
i
≤ 100000,
N
i
≤
M
i
, 整数) が与えられます。
データセットの数は 1000 を超えません。
Output
入力データセットごとに、貯蓄額が旅行費用に達するのにかかる月数を１行に出力します。
Sample Input
10000
5000 3150
5000 5000
0 0
5000 1050
5000 3980
5000 210
5000 5000
5000 5000
0 0
5000 2100
5000 2100
5000 2100
29170
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 70831
0
Output for the Sample Input
6
NA
|
[
{
"submission_id": "aoj_0206_1820615",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <complex>\n#include <utility>\n#include <set>\n#include <cmath>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\n#define pi acos(-1)\n#define all(v) v.begin(),v.end()\n#define EPS (1e-10)\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))\nusing namespace std;\ntypedef pair<int,int> point;\ntypedef complex<double> P;\ntypedef long long ll;\n\nconst double eps = 1e-8;\nconst double INF = 1e12;\n\n\ndouble dot(P a,P b){\n\treturn a.real()*b.real()+a.imag()*b.imag();\n}\ndouble cross(P a,P b){\n\treturn a.real()*b.imag()-a.imag()*b.real();\n}\n\nbool is_orthogonal(P a1,P a2,P b1,P b2){\n\treturn EQ(dot(a1-a2,b1-b2),0.0);\n}\nbool is_parallel(P a1,P a2,P b1,P b2){\n\treturn EQ(cross(a1-a2,b1-b2),0.0);\n}\n\nbool is_point_on_line(P a,P b,P c){\n\treturn EQ(cross(b-a,c-a),0.0);\n}\n\nbool is_point_on_linesegment3(P a,P b,P c){\n\treturn (abs(a-c)+abs(c-b)<abs(a-b)+EPS);\n}\n\ndouble distance_l_p(P a,P b,P c){\n\treturn abs(cross(b-a,c-a))/abs(b-a);\n}\n\n\ndouble distance_ls_p(P a,P b,P c){\n\tif(dot(b-a,c-a)<EPS)return abs(c-a);\n\tif(dot(a-b,c-b)<EPS)return abs(c-b);\n\treturn abs(cross(b-a,c-a))/abs(b-a);\n}\n\nint main(){\n\tint m,n,l;\n\twhile(cin>>l,l){\n\t\tint ans=-1;\n\t\trep(i,12){\n\t\t\tcin>>m>>n;\n\t\t\tl-=(m-n);\n\t\t\tif(l<=0 && ans==-1){\n\t\t\t\tans=i+1;\n\t\t\t}\n\t\t}\n\t\tif(ans==-1)cout<<\"NA\"<<endl;\n\t\telse cout<<ans<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0206_1767100",
"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\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 1000000007\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\n\nll l, m, n, sum;\nint f = 0;\n\nint main(){\n\twhile (cin >> l&&l){\n\t\tf = 0;\n\t\tsum = 0;\n\t\tREP(i, 12){\n\t\t\tcin >> m >> n;\n\t\t\tsum += m - n;\n\t\t\tif (f == 0){\n\t\t\t\tif (sum >= l)f = i + 1;\n\t\t\t}\n\t\t}\n\t\tif (f == 0)cout << \"NA\\n\";\n\t\telse cout << f << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0206_1499710",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\n\nint main() {\n\tint L;\n\t\n\twhile (cin >> L, L) {\n\t\tint sum = 0, ans = -1;\n\t\t\n\t\tfor_(i,0,12) {\n\t\t\tint M, N;\n\t\t\tcin >> M >> N;\n\t\t\tsum += (M - N);\n\t\t\tif (sum >= L && ans == -1) ans = i + 1;\n\t\t}\n\t\t\n\t\tif (ans == -1) puts(\"NA\");\n\t\telse cout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0206_1376397",
"code_snippet": "#include <set>\n#include <map>\n#include <list>\n#include <queue>\n#include <stack>\n#include <cmath>\n#include <ctype.h>\n#include <ctime>\n#include <cstdio>\n#include <vector>\n#include <string>\n#include <bitset>\n#include <cctype>\n#include <cstdlib>\n#include <cstring>\n#include <utility>\n#include <numeric>\n#include <complex>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n#include <cassert>\n#include <iostream>\n#include <iterator>\n#include <algorithm>\n#define ALL(g) (g).begin(),(g).end()\n#define REP(i, x, n) for(int i = x; i < n; i++)\n#define rep(i,n) REP(i,0,n)\n#define F(i,j,k) fill(i[0],i[0]+j*j,k)\n#define P(p) cout<<(p)<<endl;\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define INF 1<<25\n#define pb push_back\nusing namespace std; \ntypedef vector<int> vi;\ntypedef vector<long long> vl;\ntypedef vector<double> vd;\ntypedef pair<int,int> pii;\ntypedef pair<long,long> pll;\ntypedef long long ll;\n \nint calc(int n,int *i,int *o){\n int *p,*q;\n p = i;\n q = o;\n int count = 0;\n for(int i = 0;i < 12;i++){\n count += *p - *q;\n if(count >= n) return i+1;\n p++;q++;\n }\n return -1;\n}\n\nint main(){\n int n;\n int in[12],out[12];\n int c;\n while(1){\n cin >> n;\n if(n == 0)break; \n for(int i = 0;i < 12;i++){\n cin >> in[i] >> out[i];\n }\n int count = 0;\n for(int i = 0;i < 12;i++){\n count += in[i] - out[i];\n if(count >= n){P(i+1);break;}\n if(i == 11) P(\"NA\");\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0206_941591",
"code_snippet": "#include<iostream>\n\nint main(){\n\n\tint l;\n\twhile (std::cin >> l){\n\n\t\tif (l == 0)break;\n\n\t\tbool flg = true;\n\t\tfor (int i = 1, m, n; i <= 12; i++){\n\t\t\tstd::cin >> m >> n;\n\t\t\tl -= (m - n);\n\n\t\t\tif (flg&&l <= 0)std::cout << i << std::endl, flg = false;\n\t\t\tif (i == 12 && l > 0)std::cout << \"NA\" << std::endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0206_853468",
"code_snippet": "#include<iostream>\n\nusing namespace std;\nint main(void){\n\n\tint L,M,N,wa=0,mo=-1;\n\twhile(1){\n\t\twa=0,mo=-1;\n\t\tcin>>L;\n\t\tif(L==0) break;\n\t\tfor(int i=1;i<=12;i++){\n\t\t\tcin>>M>>N;\n\t\t\twa+=M-N;\n\t\t\tif(wa>=L&&mo==-1) mo=i;\n\t\t}\n\t\tif(mo!=-1) cout<<mo<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_0200_cpp
|
青春の片道切符
太郎君は夏休みに電車で長旅をする計画を立てています。しかし高校生の身である太郎君が一ヵ月しかない夏休みで可能な限り遠くに旅をするには、出来るだけ安い行き方と出来るだけ早い行き方をそれぞれ見つけなければうまく計画が立てられません。太郎君が素敵な旅を満喫できるように、太郎君の計画の助けになるプログラムを作ってあげましょう。
線路の情報、駅の数を入力とし、問い合わせに応じて、最小金額または最短時間を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
n
m
a
1
b
1
cost
1
time
1
a
2
b
2
cost
2
time
2
:
a
n
b
n
cost
n
time
n
k
p
1
q
1
r
1
p
2
q
2
r
2
:
p
k
q
k
r
k
1 行目に線路の情報の数
n
(1 ≤
n
≤ 3000)と駅の数
m
(1 ≤
m
≤ 100) が与えられます。
続く
n
行に
i
番目の路線の情報が与えられます。各路線の情報として、路線がつなぐ２つの駅の番号
a
i
,
b
i
(1 ≤
a
i
,
b
i
≤
m
)、料金
cost
i
(1 ≤
cost
i
≤ 1000)、移動時間
time
i
(1 ≤
time
i
≤ 1000) が与えられます。ただし、各駅は 1 から
m
まで順番に番号が付けられているものとします。
なお、
a
i
と
b
i
が線路でつながっていれば、
a
i
から
b
i
、
b
i
から
a
i
の両方の移動が同じ料金と時間で可能とします。
続く行に問い合わせの数
k
(1 ≤
k
≤ 200) が与えられます。続く
k
行に
i
番目の問い合わせが与えられます。各問合わせとして、出発駅
p
i
、到着駅
q
i
、出力する値の種類
r
i
(0 または 1)が与えられます。なお、問い合わせには必ず経路があるものとします。
データセットの数は 50 を超えない。
Output
データセットごとに、最小金額もしくは最短時間を１行に出力します。
r
i
が 0 の時は最小金額を、 1 の時は最短時間を出力します。
Sample Input
6 5
1 2 200 10
1 4 400 15
1 3 250 25
2 4 100 10
4 5 150 20
3 5 300 20
2
1 5 0
1 5 1
0 0
Output for the Sample Input
450
35
|
[
{
"submission_id": "aoj_0200_10876171",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Pint = pair<int, int>;\nusing Tuple = tuple<int, int, int>;\nusing Graph = vector<vector<Tuple>> ;\n\nint main() {\n int n, m;\n while (1) {\n cin >> n >> m;\n if (m == 0) break;\n Graph g(m);\n for (int a, b, cost, time; n; n--) {\n cin >> a >> b >> cost >> time;\n a--; b--;\n g[a].push_back(Tuple(cost, time, b));\n g[b].push_back(Tuple(cost, time, a));\n }\n vector<vector<vector<int>>> dist(2, vector<vector<int>>(m, vector<int>(m, -1)));\n priority_queue<Pint, vector<Pint>, greater<Pint>> pq;\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < m; j++) {\n pq.push({ 0, j });\n dist[i][j][j] = 0;\n while (!pq.empty()) {\n auto pos = pq.top();\n pq.pop();\n if (dist[i][j][pos.second] < pos.first) continue;\n for (auto k : g[pos.second]) {\n int d = pos.first + ((i == 0) ? get<0>(k) : get<1>(k));\n if (dist[i][j][get<2>(k)] == -1 || dist[i][j][get<2>(k)] > d) {\n dist[i][j][get<2>(k)] = d;\n pq.push({ d, get<2>(k) });\n }\n }\n }\n }\n }\n int k, p, q, r;\n cin >> k;\n while (k--) {\n cin >> p >> q >> r;\n cout << dist[r][p - 1][q - 1] << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3712,
"score_of_the_acc": -0.9317,
"final_rank": 17
},
{
"submission_id": "aoj_0200_10870764",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int N = 1000;\n\nvoid solve(int n, int m){\n vector<vector<long long>> GT(n, vector<long long>(n, 1ll<<60)), GC(n, vector<long long>(n, 1ll<<60));\n for(int i = 0; i < n; i++) GT[i][i] = GC[i][i] = 0;\n for(int i = 0; i < m; i++){\n int u, v, c, t;\n cin >> u >> v >> c >> t;\n u--; v--;\n GC[u][v] = GC[v][u] = min<long long>(GC[u][v], c);\n GT[u][v] = GT[v][u] = min<long long>(GT[u][v], t);\n }\n \n for(int k = 0; k < n; k++){\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n GC[i][j] = min(GC[i][j], GC[i][k] + GC[k][j]);\n }\n }\n }\n \n for(int k = 0; k < n; k++){\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n GT[i][j] = min(GT[i][j], GT[i][k] + GT[k][j]);\n }\n }\n }\n \n int q;\n cin >> q;\n while(q--){\n int t, u, v;\n cin >> u >> v >> t;\n u--; v--;\n if(t == 0) cout << GC[u][v] << '\\n';\n else cout << GT[u][v] << '\\n';\n }\n}\n\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n int n, m;\n while(cin >> m >> n){\n if(m != 0 || n != 0) solve(n, m);\n else break;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3576,
"score_of_the_acc": -0.7128,
"final_rank": 9
},
{
"submission_id": "aoj_0200_10870754",
"code_snippet": "//gemini\n\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <limits>\n\n// 無限大を表す定数\nconst int INF = std::numeric_limits<int>::max();\n\n// 線路（グラフの辺）を表す構造体\nstruct Edge {\n int to; // 隣接する駅\n int cost; // 金額\n int time; // 時間\n};\n\n// 駅の最大数 + 1\nconst int MAX_STATIONS = 1001;\n\n// 隣接リストでグラフを表現\nstd::vector<Edge> adj[MAX_STATIONS];\n\n// ダイクストラ法で最短経路を計算する関数\n// start: 出発駅, end: 目的駅, type: 0なら金額、1なら時間, num_stations: 駅の総数\nint dijkstra(int start, int end, int type, int num_stations) {\n // 各駅までの距離を記録する配列（INFで初期化）\n std::vector<int> dist(num_stations + 1, INF);\n \n // 優先度付きキュー（{距離, 駅} のペアを格納）\n // C++のpriority_queueはデフォルトで最大ヒープなので、最小ヒープにするためにgreaterを指定\n std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>, std::greater<std::pair<int, int>>> pq;\n\n // 出発駅の距離は0\n dist[start] = 0;\n pq.push({0, start});\n\n while (!pq.empty()) {\n // 現在地までの距離が最小の駅を取り出す\n int current_dist = pq.top().first;\n int u = pq.top().second;\n pq.pop();\n\n // より短い経路が既に見つかっている場合はスキップ\n if (current_dist > dist[u]) {\n continue;\n }\n\n // 目的駅に到達したら、その時点の距離を返す\n if (u == end) {\n return dist[end];\n }\n\n // 現在の駅から繋がっている全ての駅vについて\n for (const auto& edge : adj[u]) {\n int v = edge.to;\n // typeに応じて重み（金額か時間）を選択\n int weight = (type == 0) ? edge.cost : edge.time;\n \n // 現在の駅uを経由した場合の駅vへの距離が、記録されている距離より短いか調べる\n if (dist[u] != INF && dist[u] + weight < dist[v]) {\n // 短い経路が見つかったら距離を更新し、キューに追加\n dist[v] = dist[u] + weight;\n pq.push({dist[v], v});\n }\n }\n }\n // 基本的に経路は必ず存在するため、ここは通らない\n return dist[end];\n}\n\nint main() {\n // 高速な入出力\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(NULL);\n\n int n, m; // n: 線路の数, m: 駅の数\n\n // 複数のデータセットの処理\n // nとmが両方0になるまでループ\n while (std::cin >> n >> m && (n != 0 || m != 0)) {\n // 新しいデータセットのために隣接リストをクリア\n for (int i = 1; i <= m; ++i) {\n adj[i].clear();\n }\n\n // 線路の情報を読み込む\n for (int i = 0; i < n; ++i) {\n int a, b, cost, time;\n std::cin >> a >> b >> cost >> time;\n // 無向グラフなので、両方向の辺を追加\n adj[a].push_back({b, cost, time});\n adj[b].push_back({a, cost, time});\n }\n\n // 問い合わせの数を読み込む\n int k;\n std::cin >> k;\n\n // 各問い合わせを処理する\n for (int i = 0; i < k; ++i) {\n int p, q, r; // p: 出発駅, q: 到着駅, r: 問い合わせの種類\n std::cin >> p >> q >> r;\n std::cout << dijkstra(p, q, r, m) << \"\\n\";\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3464,
"score_of_the_acc": -0.6463,
"final_rank": 8
},
{
"submission_id": "aoj_0200_10854044",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n \nconstexpr int INF = 1e9;\n \nint main() {\n int n, m;\n while(cin >> n >> m, n) {\n vector<vector<vector<int>>> d(2, vector<vector<int>>(m, vector<int>(m, INF)));\n for(int i=0; i<m; ++i) {\n d[0][i][i] = d[1][i][i] = 0;\n }\n for(int i=0; i<n; ++i) {\n int a, b, cost, time;\n cin >> a >> b >> cost >> time;\n a--; b--;\n d[0][a][b] = d[0][b][a] = cost;\n d[1][a][b] = d[1][b][a] = time;\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 d[0][i][j] = min(d[0][i][j], d[0][i][k] + d[0][k][j]);\n d[1][i][j] = min(d[1][i][j], d[1][i][k] + d[1][k][j]);\n }\n }\n }\n \n int k;\n cin >> k;\n for(int i=0; i<k; ++i) {\n int p, q, r;\n cin >> p >> q >> r;\n p--; q--;\n cout << d[r][p][q] << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3476,
"score_of_the_acc": -0.6405,
"final_rank": 7
},
{
"submission_id": "aoj_0200_10282741",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\n#include <queue>\n#include <map>\nusing namespace std;\n\nstruct Edge {\n int to, cost, time;\n};\n\nvoid dijkstra(int start, int m, vector<vector<Edge> >& graph, vector<int>& dist, bool isCost) {\n priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq; //優先度付きキューの宣言\n\n dist[start] = 0; //出発点の距離を0にする\n pq.push({0, start});\n\n while(!pq.empty()) {\n int d = pq.top().first; //現在ノードまでの距離\n int node = pq.top().second;\n pq.pop();\n\n if(d > dist[node]) continue; //取り出した距離が現在の値より大きければスキップ\n\n for(auto& edge : graph[node]) {\n int newDist = d + (isCost ? edge.cost : edge.time);\n if(newDist < dist[edge.to]) {\n dist[edge.to] = newDist;\n pq.push({newDist, edge.to});\n }\n }\n\n }\n\n}\n\n\n\nint main(void) {\n int n,m;\n while(cin >> n >> m, n != 0 && m != 0) {\n\n vector<vector<Edge> > graph(m+1);\n //グラフの作成\n for(int i = 0; i < n; i++) {\n int a, b, cost, time;\n cin >> a >> b >> cost >> time;\n graph[a].push_back({b, cost, time});\n graph[b].push_back({a, cost, time});\n }\n\n int k;\n cin >> k;\n while(k--) {\n int p, q, r;\n cin >> p >> q >> r;\n vector<int> dist(m+1, INT32_MAX);\n\n if(r == 0) {\n dijkstra(p, m, graph, dist, true); //コスト最小\n } else {\n dijkstra(p, m, graph, dist, false); //時間最短\n }\n\n cout << dist[q] << endl;\n }\n }\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3464,
"score_of_the_acc": -0.7446,
"final_rank": 11
},
{
"submission_id": "aoj_0200_9631369",
"code_snippet": "#include <bits/stdc++.h>\n#include<random>\n#include<chrono>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define Rrep(i,n) for(int i=n-1;i>=0;i--)\n#define Rrep1(i,n) for(int i=n;i>0;i--)\n#define all(a) a.begin(),a.end()\nusing ll = long long;\nusing ull = unsigned long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing vvvl = vector<vvl>;\n#define INF ((ll)2e18)\n#define IINF ((int)(1e9+5e8))\nconst double PI = 3.1415926535897932384626433832795028841971;\ntemplate<typename T>inline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate<typename T>inline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }\n#define yesno(ans) cout<<((ans)?\"Yes\\n\":\"No\\n\")\nbool eq(double a, double b) { return abs(a - b) < 0.0000001; }\n//LRUD\n//const int di[4] = { 0,-1,0,1 };\n//const int dj[4] = { -1,0,1,0 };\nconst int di[8] = { 0,0,1,1,1,-1,-1,-1 };\nconst int dj[8] = { 1,-1,0,-1,1,0,-1,1 };\n\n/*ACL\n#include <atcoder/all>\nusing namespace atcoder;\n//using mint=modint;\nusing mint = modint998244353;\n//using mint = modint1000000007;\nusing vm = vector<mint>;\nusing vvm = vector<vm>;\nusing vvvm = vector<vvm>;\n//*/\n\nrandom_device seed_gen;\nmt19937 rnd(seed_gen());\n\n\n\nconst int MAX_N=(int)2e5+10;//10余分に取ります\nconst int ST_SIZE=(1<<20)-1;\n\nstruct Edge{\n int to,cost;\n Edge(){}\n Edge(int to,int cost):to(to),cost(cost){}\n};\n\nvi dij(int s,vector<vector<Edge>> G){\n vi dist(G.size(),IINF);\n using P=pair<int,int>;\n priority_queue<P,vector<P>,greater<P>>q;\n q.emplace(0,s);\n while(!q.empty()){\n int cost=q.top().first;\n int pos=q.top().second;\n q.pop();\n if(dist[pos]<=cost)continue;\n dist[pos]=cost;\n for(auto [to,c]:G[pos]){\n if(dist[to]>cost+c)q.emplace(cost+c,to);\n }\n }\n return dist;\n}\nint solve() {\n int N,M;\n while(cin>>M>>N,N+M){\n vector<vector<Edge>> Gc(N),Gt(N);\n vvi dc(N,vi(N));\n vvi dt(N,vi(N));\n\n rep(i,M){\n int a,b;cin>>a>>b;\n int c,t;cin>>c>>t;\n a--,b--;\n Gt[a].emplace_back(b,t);\n Gt[b].emplace_back(a,t);\n Gc[a].emplace_back(b,c);\n Gc[b].emplace_back(a,c);\n }\n rep(i,N)dt[i]=dij(i,Gt);\n rep(i,N)dc[i]=dij(i,Gc);\n int K;cin>>K;\n while(K--){\n int p,q,r;cin>>p>>q>>r;\n p--,q--;\n int ans=0;\n if(r==0)ans=dc[p][q];\n else ans=dt[p][q];\n cout<<ans<<endl;\n }\n }\n return 0;\n}\n\nint main()\n{\n //std::cin.tie(0)->sync_with_stdio(0);\n int T = 1;\n while (T--)\n {\n solve();\n }\n return 0;\n}\n\n/* 意気込み\n\n*/",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 3800,
"score_of_the_acc": -1.9113,
"final_rank": 20
},
{
"submission_id": "aoj_0200_9362119",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"/opt/library/graph/base.hpp\"\n\ntemplate <typename T>\nstruct Edge {\n ll frm, to;\n T cost;\n ll id;\n};\n\ntemplate <typename T = ll, bool directed = false>\nstruct Graph {\n static constexpr bool is_directed = directed;\n ll N, M;\n using cost_type = T;\n using edge_type = Edge<T>;\n vector<edge_type> edges;\n vi indptr;\n vc<edge_type> csr_edges;\n vc<ll> vc_deg, vc_indeg, vc_outdeg;\n bool prepared;\n\n class OutgoingEdges {\n public:\n OutgoingEdges(const Graph* G, ll l, ll r) : G(G), l(l), r(r) {}\n\n const edge_type* begin() const {\n if (l == r) { return 0; }\n return &G->csr_edges[l];\n }\n\n const edge_type* end() const {\n if (l == r) { return 0; }\n return &G->csr_edges[r];\n }\n\n private:\n const Graph* G;\n ll l, r;\n };\n\n bool is_prepared() { return prepared; }\n\n Graph() : N(0), M(0), prepared(0) {}\n Graph(ll N) : N(N), M(0), prepared(0) {}\n\n void build(ll n) {\n N = n, M = 0;\n prepared = 0;\n edges.clear();\n indptr.clear();\n csr_edges.clear();\n vc_deg.clear();\n vc_indeg.clear();\n vc_outdeg.clear();\n }\n\n void add(ll frm, ll to, T cost = 1, ll i = -1) {\n assert(!prepared);\n assert(0 <= frm && 0 <= to && to < N);\n if (i == -1) i = M;\n auto e = edge_type({frm, to, cost, i});\n edges.eb(e);\n ++M;\n }\n\n#ifdef FASTIO\n // wt, off\n void read_tree(bool wt = false, ll off = 1) { read_graph(N - 1, wt, off); }\n\n void read_graph(ll M, bool wt = false, ll off = 1) {\n for (ll m = 0; m < M; ++m) {\n LL(a, b);\n a -= off, b -= off;\n if (!wt) {\n add(a, b);\n } else {\n T c;\n read(c);\n add(a, b, c);\n }\n }\n build();\n }\n#endif\n\n void build() {\n assert(!prepared);\n prepared = true;\n indptr.assign(N + 1, 0);\n for (auto&& e: edges) {\n indptr[e.frm + 1]++;\n if (!directed) indptr[e.to + 1]++;\n }\n for (ll v = 0; v < N; ++v) { indptr[v + 1] += indptr[v]; }\n auto counter = indptr;\n csr_edges.resize(indptr.back() + 1);\n for (auto&& e: edges) {\n csr_edges[counter[e.frm]++] = e;\n if (!directed)\n csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});\n }\n }\n\n OutgoingEdges operator[](ll v) const {\n assert(prepared);\n return {this, indptr[v], indptr[v + 1]};\n }\n\n vi deg_array() {\n if (vc_deg.empty()) calc_deg();\n return vc_deg;\n }\n\n pair<vi, vi> deg_array_inout() {\n if (vc_indeg.empty()) calc_deg_inout();\n return {vc_indeg, vc_outdeg};\n }\n\n ll deg(ll v) {\n if (vc_deg.empty()) calc_deg();\n return vc_deg[v];\n }\n\n ll in_deg(ll v) {\n if (vc_indeg.empty()) calc_deg_inout();\n return vc_indeg[v];\n }\n\n ll out_deg(ll v) {\n if (vc_outdeg.empty()) calc_deg_inout();\n return vc_outdeg[v];\n }\n\n#ifdef FASTIO\n void debug() {\n print(\"Graph\");\n if (!prepared) {\n print(\"frm to cost id\");\n for (auto&& e: edges) print(e.frm, e.to, e.cost, e.id);\n } else {\n print(\"indptr\", indptr);\n print(\"frm to cost id\");\n rep(v, N) for (auto&& e: (*this)[v]) print(e.frm, e.to, e.cost, e.id);\n }\n }\n#endif\n\n vi new_idx;\n vc<bool> used_e;\n\n // G における頂点 V[i] が、新しいグラフで i になるようにする\n // {G, es}\n Graph<T, directed> rearrange(vi V, bool keep_eid = 0) {\n if (len(new_idx) != N) new_idx.assign(N, -1);\n if (len(used_e) != M) used_e.assign(M, 0);\n ll n = len(V);\n rep(i, n) new_idx[V[i]] = i;\n Graph<T, directed> G(n);\n vi history;\n rep(i, n) {\n for (auto&& e: (*this)[V[i]]) {\n if (used_e[e.id]) continue;\n ll a = e.frm, b = e.to;\n if (new_idx[a] != -1 && new_idx[b] != -1) {\n history.eb(e.id);\n used_e[e.id] = 1;\n ll eid = (keep_eid ? e.id : -1);\n G.add(new_idx[a], new_idx[b], e.cost, eid);\n }\n }\n }\n rep(i, n) new_idx[V[i]] = -1;\n for (auto&& eid: history) used_e[eid] = 0;\n G.build();\n return G;\n }\n\nprivate:\n void calc_deg() {\n assert(vc_deg.empty());\n vc_deg.resize(N);\n for (auto&& e: edges) vc_deg[e.frm]++, vc_deg[e.to]++;\n }\n\n void calc_deg_inout() {\n assert(vc_indeg.empty());\n vc_indeg.resize(N);\n vc_outdeg.resize(N);\n for (auto&& e: edges) { vc_indeg[e.to]++, vc_outdeg[e.frm]++; }\n }\n};\n#line 3 \"/opt/library/graph/shortest_path/dijkstra.hpp\"\n\ntemplate <typename T, typename GT>\npair<vc<T>, vi> dijkstra_dense(GT& G, ll s) {\n const ll N = G.N;\n vc<T> dist(N, infty<T>);\n vi par(N, -1);\n vc<bool> done(N);\n dist[s] = 0;\n while (1) {\n ll v = -1;\n T mi = infty<T>;\n rep(i, N) {\n if (!done[i] && chmin(mi, dist[i])) v = i;\n }\n if (v == -1) break;\n done[v] = 1;\n for (auto&& e: G[v]) {\n if (chmin(dist[e.to], dist[v] + e.cost)) par[e.to] = v;\n }\n }\n return {dist, par};\n}\n\ntemplate <typename T, typename GT, bool DENSE = false>\npair<vc<T>, vi> dijkstra(GT& G, ll v) {\n if (DENSE) return dijkstra_dense<T>(G, v);\n auto N = G.N;\n vc<T> dist(N, infty<T>);\n vi par(N, -1);\n using P = pair<T, ll>;\n\n priority_queue<P, vector<P>, greater<P>> que;\n\n dist[v] = 0;\n que.emplace(0, v);\n while (!que.empty()) {\n auto [dv, v] = que.top();\n que.pop();\n if (dv > dist[v]) continue;\n for (auto&& e: G[v]) {\n if (chmin(dist[e.to], dist[e.frm] + e.cost)) {\n par[e.to] = e.frm;\n que.emplace(dist[e.to], e.to);\n }\n }\n }\n return {dist, par};\n}\n\n// 多点スタート。[dist, par, root]\ntemplate <typename T, typename GT>\ntuple<vc<T>, vi, vi> dijkstra(GT& G, vi vs) {\n assert(G.is_prepared());\n ll N = G.N;\n vc<T> dist(N, infty<T>);\n vi par(N, -1);\n vi root(N, -1);\n\n using P = pair<T, ll>;\n\n priority_queue<P, vector<P>, greater<P>> que;\n\n for (auto&& v: vs) {\n dist[v] = 0;\n root[v] = v;\n que.emplace(T(0), v);\n }\n\n while (!que.empty()) {\n auto [dv, v] = que.top();\n que.pop();\n if (dv > dist[v]) continue;\n for (auto&& e: G[v]) {\n if (chmin(dist[e.to], dist[e.frm] + e.cost)) {\n root[e.to] = root[e.frm];\n par[e.to] = e.frm;\n que.push(mp(dist[e.to], e.to));\n }\n }\n }\n return {dist, par, root};\n}\n#line 3 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, m, a, b, c, t, k, p, q, r;;\n cin >> n >> m;\n if (n == 0 && m == 0) {return 1;}\n Graph<ll> GC(m), GT(m);\n rep(n) {\n cin >> a >> b >> c >> t;\n --a, --b;\n GC.add(a, b, c);\n GT.add(a, b, t);\n }\n GC.build();\n GT.build();\n cin >> k;\n rep(k) {\n cin >> p >> q >> r;\n --p, --q;\n if (r == 0) {\n print(dijkstra<ll>(GC, p).fi[q]);\n } else {\n print(dijkstra<ll>(GT, p).fi[q]);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3592,
"score_of_the_acc": -0.8581,
"final_rank": 15
},
{
"submission_id": "aoj_0200_9154543",
"code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to;\n double cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, double cost) : to(to), cost(cost) {}\n Edge(int from, int to, double cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nvector<string> split_str(string S, char c) {\n vector<string> ret;\n stringstream ss;\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == c) {\n ret.pb(ss.str());\n ss.str(\"\");\n ss.clear();\n } else {\n ss << S[i];\n }\n }\n ret.pb(ss.str());\n return ret;\n}\n\nsigned main() {\n int N, M;\n while (cin >> M >> N, N) {\n vector<vector<Edge>> Gc(N), Gt(N);\n for (int i = 0; i < M; i++) {\n int u, v, c, t;\n cin >> u >> v >> c >> t;\n u--; v--;\n Gc[u].pb(Edge(v, c));\n Gc[v].pb(Edge(u, c));\n Gt[u].pb(Edge(v, t));\n Gt[v].pb(Edge(u, t));\n }\n\n int Q;\n cin >> Q;\n for (int q = 0; q < Q; q++) {\n int s, t, ty;\n cin >> s >> t >> ty;\n s--; t--;\n if (ty == 0) {\n vector<int> dist(N, INFL);\n dist[s] = 0;\n \n std::priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\n pq.emplace(0, s);\n // for (int i = 0; i < N; i++) pq.emplace(dist[i], i);\n \n while (pq.size()) {\n int d = pq.top().first;\n int v = pq.top().second;\n pq.pop();\n if (v == t) break;\n if (d > dist[v]) continue;\n for (auto &e : Gc[v]) {\n if (dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n pq.emplace(dist[e.to], e.to);\n }\n }\n }\n cout << dist[t] << endl;\n } else {\n vector<int> dist(N, INFL);\n dist[s] = 0;\n \n std::priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\n pq.emplace(0, s);\n // for (int i = 0; i < N; i++) pq.emplace(dist[i], i);\n \n while (pq.size()) {\n int d = pq.top().first;\n int v = pq.top().second;\n pq.pop();\n if (v == t) break;\n if (d > dist[v]) continue;\n for (auto &e : Gt[v]) {\n if (dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n pq.emplace(dist[e.to], e.to);\n }\n }\n }\n cout << dist[t] << endl;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3880,
"score_of_the_acc": -1.0314,
"final_rank": 18
},
{
"submission_id": "aoj_0200_8072911",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, m;\n while (cin >> n >> m, n+m) {\n const int inf = 1e9;\n vector<vector<int>> d(m, vector<int>(m, inf));\n auto e = d;\n for (int i = 0; i < m; ++i) {\n d[i][i] = e[i][i] = 0;\n }\n for (int i = 0; i < n; ++i) {\n int a,b,c,t; cin >> a >> b >> c >> t;\n a--; b--;\n d[a][b] = min(d[a][b], c);\n d[b][a] = min(d[b][a], c);\n e[a][b] = min(e[a][b], t);\n e[b][a] = min(e[b][a], t);\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 d[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n e[i][j] = min(e[i][j], e[i][k] + e[k][j]);\n }\n }\n }\n int k; cin >> k;\n for (int i = 0; i < k; ++i) {\n int p,q,r; cin >> p >> q >> r;\n p--; q--;\n if (r == 0) {\n cout << d[p][q] << endl;\n }\n else {\n cout << e[p][q] << endl;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3472,
"score_of_the_acc": -0.637,
"final_rank": 6
},
{
"submission_id": "aoj_0200_6091388",
"code_snippet": "//Source.cpp\n//いつもの\n#ifdef LOCAL\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<unordered_set>\n#include<unordered_map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\n#include<complex>\n#include<cassert>\n#else\n#include<bits/stdc++.h>\n#ifdef ONLINE_JUDGE\n#include<atcoder/all>\nusing namespace atcoder;\n#else\n#define gcd __gcd\n#define lcm __detail::__lcm\n#endif\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#ifdef LOCAL\n//*\n#include<atcoder/all>\nusing namespace atcoder;\n//*/\nunsigned popcount(unsigned x){\n\treturn __popcnt(x);\n}\nunsigned popcountll(ull x){\n\treturn __popcnt64(x);\n}\nunsigned parity(unsigned x){\n\treturn popcount(x)%2;\n}\nunsigned parityll(ull x){\n\treturn popcountll(x)%2;\n}\nunsigned clz(unsigned x){\n\tif(x==0)\n\t\tthrow;\n\tunsigned cnt=__lzcnt(x);\n\treturn cnt;\n}\nunsigned clzll(ull x){\n\tif(x==0)\n\t\tthrow;\n\tunsigned cnt=__lzcnt64(x);\n\treturn cnt;\n}\nunsigned ctz(unsigned x){\n\tif(x==0)\n\t\tthrow;\n\tx&=~x+1;\n\tunsigned cnt=0;\n\tif(x&0xffff0000)\n\t\tcnt|=16;\n\tif(x&0xff00ff00)\n\t\tcnt|=8;\n\tif(x&0xf0f0f0f0)\n\t\tcnt|=4;\n\tif(x&0xcccccccc)\n\t\tcnt|=2;\n\tif(x&0xaaaaaaaa)\n\t\tcnt|=1;\n\treturn cnt;\n}\nunsigned ctzll(ull x){\n\tif(x==0)\n\t\tthrow;\n\tx&=~x+1;\n\tunsigned cnt=0;\n\tif(x&0xffffffff00000000)\n\t\tcnt|=32;\n\tif(x&0xffff0000ffff0000)\n\t\tcnt|=16;\n\tif(x&0xff00ff00ff00ff00)\n\t\tcnt|=8;\n\tif(x&0xf0f0f0f0f0f0f0f0)\n\t\tcnt|=4;\n\tif(x&0xcccccccccccccccc)\n\t\tcnt|=2;\n\tif(x&0xaaaaaaaaaaaaaaaa)\n\t\tcnt|=1;\n\treturn cnt;\n}\nunsigned ffs(unsigned x){\n\tif(x==0)\n\t\treturn 0;\n\treturn ctz(x)+1;\n}\nunsigned ffsll(ull x){\n\tif(x==0)\n\t\treturn 0;\n\treturn ctzll(x)+1;\n}\n#define __builtin_popcount popcount\n#define __builtin_popcountll popcountll\n#define __builtin_parity parity\n#define __builtin_parityll parityll\n#define __builtin_clz clz\n#define __builtin_clzll clzll\n#define __builtin_ctz ctz\n#define __builtin_ctzll ctzll\n#define __builtin_ffs ffs\n#define __builtin_ffsll ffsll\n#endif\nconstexpr int mod=1e9+7;\nconstexpr int Mod=998244353;\nconstexpr int inf=mod;\nconstexpr ll linf=(ll)mod*mod;\nstruct fastio{\n\tfastio(){\n\t\tcin.tie(0);\n\t\tios::sync_with_stdio(0);\n\t\tcout<<fixed<<setprecision(20);\n\t};\n}fio;\ntemplate<class T>\nbool chmax(T&a,const T&b){\n\tif(a<b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\ntemplate<class T>\nbool chmin(T&a,const T&b){\n\tif(a>b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\ntypedef pair<int,int> P;\nstruct edge{int to,cost;};\nvector<vector<edge>>G[2];\nvector<int>dist;\nint main(){\n\tint n,m;\n\twhile(cin>>n>>m,n||m){\n\t\tG[0].assign(m,vector<edge>());\n\t\tG[1].assign(m,vector<edge>());\n\t\tint a,b,cost,time,k,p,q,r;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>a>>b>>cost>>time;\n\t\t\ta--,b--;\n\t\t\tG[0][a].emplace_back(edge{b,cost});\n\t\t\tG[0][b].emplace_back(edge{a,cost});\n\t\t\tG[1][a].emplace_back(edge{b,time});\n\t\t\tG[1][b].emplace_back(edge{a,time});\n\t\t}\n\t\tcin>>k;\n\t\tfor(int i=0;i<k;i++){\n\t\t\tcin>>p>>q>>r;\n\t\t\tp--,q--;\n\t\t\tdist.assign(m,inf);\n\t\t\tpriority_queue<P,vector<P>,greater<P>>que;\n\t\t\tdist[p]=0;\n\t\t\tque.emplace(0,p);\n\t\t\twhile(!que.empty()){\n\t\t\t\tP p=que.top();\n\t\t\t\tque.pop();\n\t\t\t\tint v=p.second,d=p.first;\n\t\t\t\tif(d>dist[v])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor(auto x:G[r][v]){\n\t\t\t\t\tif(dist[x.to]>d+x.cost){\n\t\t\t\t\t\tdist[x.to]=d+x.cost;\n\t\t\t\t\t\tque.emplace(dist[x.to],x.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<dist[q]<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3544,
"score_of_the_acc": -0.7992,
"final_rank": 14
},
{
"submission_id": "aoj_0200_6045673",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#define inf (1<<21)\n\nusing namespace std;\n\nvoid WF(vector<vector<long>>&dc,vector<vector<long>>&dt,int m){\n for (int k=1;k<=m;k++)\n for(int i=1;i<=m;i++)\n for(int j=1;j<=m;j++){\n dc[i-1][j-1]=std::min(dc[i-1][j-1],dc[i-1][k-1]+dc[k-1][j-1]);\n dt[i-1][j-1]=std::min(dt[i-1][j-1],dt[i-1][k-1]+dt[k-1][j-1]);\n }\n}\n\nint main()\n{\nwhile(1){\n int n,m;\n scanf(\"%d %d\",&n,&m);\n if(n==0 && m==0)return 0;\n \n vector<vector<long>>dc(m,vector<long>(m));\n vector<vector<long>>dt(m,vector<long>(m));\n \n for (int i=1;i<=m;i++){\n for(int j=1;j<=m;j++){\n dc[i-1][j-1]=inf;\n dt[i-1][j-1]=inf;\n }\n }\n \n for(int i=1;i<=m;i++){\n dc[i-1][i-1]=0;\n dt[i-1][i-1]=0;\n }\n int a,b,c,t;\n for(int i=0;i<n;i++){\n scanf(\"%d %d %d %d\",&a,&b,&c,&t);\n dc[a-1][b-1]=dc[b-1][a-1]=c;\n dt[a-1][b-1]=dt[b-1][a-1]=t;\n }\n\n \n WF(dc,dt,m);\n int k,p,q,r;\n scanf(\"%d\",&k);\n \n for(int i=0;i<k;i++){\n scanf(\"%d %d %d\",&p,&q,&r);\n if(r==0)\n cout<<dc[p-1][q-1]<<endl;\n else\n cout<<dt[p-1][q-1]<<endl;\n }\n}\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3648,
"score_of_the_acc": -0.7766,
"final_rank": 13
},
{
"submission_id": "aoj_0200_5934140",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 100000;\nint main(){\n while (true){\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0){\n break;\n }\n vector<vector<int>> E1(m, vector<int>(m, INF));\n vector<vector<int>> E2(m, vector<int>(m, INF));\n for (int i = 0; i < m; i++){\n E1[i][i] = 0;\n E2[i][i] = 0;\n }\n for (int i = 0; i < n; i++){\n int a, b, c, t;\n cin >> a >> b >> c >> t;\n a--;\n b--;\n E1[a][b] = min(E1[a][b], c);\n E1[b][a] = min(E1[b][a], c);\n E2[a][b] = min(E2[a][b], t);\n E2[b][a] = min(E2[b][a], t);\n }\n for (int i = 0; i < m; i++){\n for (int j = 0; j < m; j++){\n for (int k = 0; k < m; k++){\n E1[j][k] = min(E1[j][k], E1[j][i] + E1[i][k]);\n E2[j][k] = min(E2[j][k], E2[j][i] + E2[i][k]);\n }\n }\n }\n int k;\n cin >> k;\n for (int i = 0; i < k; i++){\n int p, q, r;\n cin >> p >> q >> r;\n p--;\n q--;\n if (r == 0){\n cout << E1[p][q] << endl;\n }\n if (r == 1){\n cout << E2[p][q] << endl;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3416,
"score_of_the_acc": -0.6037,
"final_rank": 4
},
{
"submission_id": "aoj_0200_5903589",
"code_snippet": "#include<cstdio>\n#include <queue>\n#include <vector>\n\nusing namespace std;\n\nstruct edge{ int to,cost;};\n\nint main(){\n\tint e,v,k;\n\tint a,b,c,t;\n\tint d[101];\n\ttypedef pair<int,int> P;\n\tpriority_queue<P,vector<P>,greater<P> > que;\n\tvector<edge> g[2][101];\n\tint s,last,type;\n\t\n\twhile(1){\n\t\tscanf(\"%d %d\",&e,&v);\n\t\tif(e==0&&v==0) break;\n\t\tfor(int i=0;i<101;i++){\n\t\t\tg[0][i].clear();\n\t\t\tg[1][i].clear();\n\t\t}\n\t\tfor(int i=0;i<e;i++){\n\t\t\tscanf(\"%d %d %d %d\",&a,&b,&c,&t);\n\t\t\tg[0][a].push_back({b,c});\n\t\t\tg[1][a].push_back({b,t});\n\t\t\tg[0][b].push_back({a,c});\n\t\t\tg[1][b].push_back({a,t});\n\t\t}\n\t\tscanf(\"%d\",&k);\n\t\tfor(int kloop=0;kloop<k;kloop++){\n\t\t\tscanf(\"%d %d %d\",&s,&last,&type);\n\t\t\tfill(d,d+v+1,30000000);\n\t\t\td[s]=0;\n\t\t\tque.push(P(0,s));\n\t\t\twhile(!que.empty()){\n\t\t\t\t//for(int i=1;i<=v;i++)printf(\"%d ,\",d[i]);\n\t\t\t\t//printf(\"\\n\");\n\t\t\t\tP p = que.top();\n\t\t\t\t//printf(\"%d %d\\n\",p.first,p.second);\n\t\t\t\tque.pop();\n\t\t\t\tint ver = p.second;\n\t\t\t\t//printf(\"%d>=%d\\n\",d[ver],p.first);\n\t\t\t\tif(d[ver] < p.first) continue;\n\t\t\t\tfor(int i=0;i<g[type][ver].size();i++){\n\t\t\t\t\tedge e = g[type][ver][i];\n\t\t\t\t\t//printf(\"%d->%d %d %d %d\\n\",ver,e.to,d[e.to] , d[ver],e.cost);\n\t\t\t\t\tif(d[e.to] > d[ver]+e.cost){\n\t\t\t\t\t\td[e.to]=d[ver]+e.cost;\n\t\t\t\t\t\tque.push(P(d[e.to],e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",d[last]);\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 2772,
"score_of_the_acc": -0.1475,
"final_rank": 1
},
{
"submission_id": "aoj_0200_5864172",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<set>\n#include<bitset>\n#include<vector>\n#include<string>\n#include <iomanip>\n#include <deque>\n#include<list>\n#include<cmath>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\nusing ll=long long;\nusing P=pair<int,int>;\nusing P_S=pair<int,string>;\nusing P_D=pair<double,int>;\nusing T=tuple<int,int,char,ll,string>;\n\nint main()\n{\n int n,m;\n while(1){\n cin>>n>>m;\n if(n==0) break;\n vector<vector<vector<int>>> score(2,vector<vector<int>>(m,vector<int>(m,1<<29)));\n rep(i,m) score[0][i][i]=score[1][i][i]=0;\n rep(i,n){\n int a,b,c,t;\n cin>>a>>b>>c>>t;\n a--; b--;\n score[0][a][b]=score[0][b][a]=c;\n score[1][a][b]=score[1][b][a]=t;\n }\n rep(k,m){\n rep(i,m){\n rep(j,m){\n score[0][i][j]=min(score[0][i][j],score[0][i][k]+score[0][k][j]);\n score[1][i][j]=min(score[1][i][j],score[1][i][k]+score[1][k][j]);\n }\n }\n }\n int k;\n cin>>k;\n rep(i,k){\n int p,q,r;\n cin>>p>>q>>r;\n p--; q--;\n cout<<score[r][p][q]<<endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3236,
"score_of_the_acc": -0.4605,
"final_rank": 2
},
{
"submission_id": "aoj_0200_5859783",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define endl \"\\n\"\n#define all(v) v.begin(), v.end()\n#define rep(i, begin, end) for(auto i = (begin); i < (end); i++)\n#define rrep(i, end, begin) for(auto i = (end) - 1; i >= (begin); i--)\ntemplate<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }\ntemplate<class T> inline T roundup(T a, T b){ return (a + b - 1) / b; }\nconstexpr int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\nconstexpr int dx[] = {1, 0, -1, 0, 1, -1, 1, -1, 0};\nusing ll = long long;\nusing ull = unsigned long long;\nconstexpr ll INF = 1e9;\nconstexpr ll MOD = 1e9 + 7;\nstruct Edge{ int to; ll cost; Edge(int to, ll cost) : to(to), cost(cost) {} };\nusing Graph = vector<vector<Edge>>;\n\nvector<ll> dijkstra(const Graph &g, int s){\n int n = g.size();\n vector<ll> dist(n, INF * INF);\n dist[s] = 0;\n priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;\n q.emplace(dist[s], s);\n while(q.size()){\n pair<ll, int> p = q.top(); q.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n for(auto e : g[v]){\n if(chmin(dist[e.to], dist[v] + e.cost)) q.emplace(dist[e.to], e.to);\n }\n }\n return dist;\n}\n\nvoid solve(){\n int n, m;\n cin >> m >> n;\n if(n == 0 && m == 0) exit(0);\n Graph g(n), h(n);\n rep(_, 0, m){\n int a, b, cost, time;\n cin >> a >> b >> cost >> time;\n a--, b--;\n g[a].emplace_back(b, time);\n g[b].emplace_back(a, time);\n h[a].emplace_back(b, cost);\n h[b].emplace_back(a, cost);\n }\n int k;\n cin >> k;\n \n vector<vector<ll>> dist(n), cost(n);\n rep(i, 0, n) dist[i] = dijkstra(g, i), cost[i] = dijkstra(h, i);\n while(k--){\n int p, q, r;\n cin >> p >> q >> r;\n p--, q--;\n if(r == 1) cout << dist[p][q] << endl;\n else cout << cost[p][q] << endl;\n }\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n while(true) solve();\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3900,
"score_of_the_acc": -1.1311,
"final_rank": 19
},
{
"submission_id": "aoj_0200_5790481",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e9;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, long long N) {\n for (long long i = 0; i < N; i++) {\n cin >> A[i];\n }\n}\nint main() {\n long long N, M; cin >> N >> M;\n while (N != 0) {\n vector<vector<long long>>G(M, vector<long long>(M, INF)), G2(M, vector<long long>(M, INF));\n for (long long i = 0; i < N; i++) {\n long long u, v; cin >> u >> v;\n long long cost1 , cost2; cin >> cost1 >> cost2;\n u--; v--;\n G[u][v] = G[v][u] = cost1;\n G2[u][v] = G2[v][u] = cost2;\n }\n for (long long i = 0; i < M; i++) {\n G[i][i] = 0;\n G2[i][i] = 0;\n }\n for (long long k = 0; k < M; k++) {\n for (long long i = 0; i < M; i++) {\n for (long long j = 0; j < M; j++) {\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\n \tG2[i][j] = min(G2[i][j], G2[i][k] + G2[k][j]);\n }\n }\n }\n long long Q; cin >> Q;\n for (long long i = 0; i < Q; i++) {\n long long u, v, q; cin >> u >> v >> q;\n u--; v--;\n if (q) {\n cout << G2[u][v] << endl;\n }\n else cout << G[u][v] << endl;\n }\n cin >> N >> M;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3552,
"score_of_the_acc": -0.7243,
"final_rank": 10
},
{
"submission_id": "aoj_0200_5750787",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n long long int INF = 1000000000000000000;\n int N,M;\n cin >> N >> M;\n if(N == 0 && M == 0) break;\n vector<vector<long long int> > costd(M,vector<long long int>(M,INF));\n vector<vector<long long int> > timed(M,vector<long long int>(M,INF));\n for(int i=0;i<M;i++){\n costd[i][i] = 0;\n timed[i][i] = 0;\n }\n for(int i=0;i<N;i++){\n int a,b;\n long long int cost,time;\n cin >> a >> b >> cost >> time;\n a--;\n b--;\n costd[a][b] = min(costd[a][b],cost);\n costd[b][a] = min(costd[b][a],cost);\n timed[a][b] = min(timed[a][b],time);\n timed[b][a] = min(timed[b][a],time);\n }\n for(int k=0;k<M;k++) for(int i=0;i<M;i++) for(int j=0;j<M;j++) costd[i][j] = min(costd[i][j],costd[i][k]+costd[k][j]);\n for(int k=0;k<M;k++) for(int i=0;i<M;i++) for(int j=0;j<M;j++) timed[i][j] = min(timed[i][j],timed[i][k]+timed[k][j]);\n int K;\n cin >> K;\n for(int i=0;i<K;i++){\n int p,q,r;\n cin >> p >> q >> r;\n if(r == 0) cout << costd[p-1][q-1] << endl;\n else cout << timed[p-1][q-1] << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3236,
"score_of_the_acc": -0.4605,
"final_rank": 2
},
{
"submission_id": "aoj_0200_5723737",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-9;\ntypedef pair<int,int> P;\nstruct edge{int to,cost;};\nvector<edge>G[2][1000];\nint dist[1000];\nsigned main(){\n\tint n,m;\n\twhile(cin>>n>>m,n||m){\n\t\tfor(int i=0;i<m;i++){\n\t\t\tG[0][i].clear();\n\t\t\tG[1][i].clear();\n\t\t}\n\t\tint a,b,cost,time,k,p,q,r;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>a>>b>>cost>>time;\n\t\t\ta--,b--;\n\t\t\tG[0][a].emplace_back(edge{b,cost});\n\t\t\tG[0][b].emplace_back(edge{a,cost});\n\t\t\tG[1][a].emplace_back(edge{b,time});\n\t\t\tG[1][b].emplace_back(edge{a,time});\n\t\t}\n\t\tcin>>k;\n\t\tfor(int i=0;i<k;i++){\n\t\t\tcin>>p>>q>>r;\n\t\t\tp--,q--;\n\t\t\tfor(int j=0;j<m;j++)\n\t\t\t\tdist[j]=inf;\n\t\t\tpriority_queue<P,vector<P>,greater<P>>que;\n\t\t\tdist[p]=0;\n\t\t\tque.emplace(0,p);\n\t\t\twhile(!que.empty()){\n\t\t\t\tP p=que.top();\n\t\t\t\tque.pop();\n\t\t\t\tint v=p.second,d=p.first;\n\t\t\t\tif(d>dist[v])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor(auto x:G[r][v]){\n\t\t\t\t\tif(dist[x.to]>d+x.cost){\n\t\t\t\t\t\tdist[x.to]=d+x.cost;\n\t\t\t\t\t\tque.emplace(dist[x.to],x.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<dist[q]<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3284,
"score_of_the_acc": -0.6178,
"final_rank": 5
},
{
"submission_id": "aoj_0200_5723254",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-9;\ntypedef pair<int,int> P;\nstruct edge{int to,cost;};\nvector<edge>G[2][1000];\nint dist[1000];\nsigned main(){\n\tint n,m;\n\twhile(cin>>n>>m,n||m){\n\t\tfor(int i=0;i<m;i++){\n\t\t\tG[0][i].clear();\n\t\t\tG[1][i].clear();\n\t\t}\n\t\tint a,b,cost,time,k,p,q,r;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>a>>b>>cost>>time;\n\t\t\ta--,b--;\n\t\t\tG[0][a].emplace_back(edge{b,cost});\n\t\t\tG[0][b].emplace_back(edge{a,cost});\n\t\t\tG[1][a].emplace_back(edge{b,time});\n\t\t\tG[1][b].emplace_back(edge{a,time});\n\t\t}\n\t\tcin>>k;\n\t\tfor(int i=0;i<k;i++){\n\t\t\tcin>>p>>q>>r;\n\t\t\tp--,q--;\n\t\t\tfor(int j=0;j<m;j++)\n\t\t\t\tdist[j]=inf;\n\t\t\tpriority_queue<P,vector<P>,greater<P>>que;\n\t\t\tdist[p]=0;\n\t\t\tque.emplace(0,p);\n\t\t\twhile(!que.empty()){\n\t\t\t\tP p=que.top();\n\t\t\t\tque.pop();\n\t\t\t\tint v=p.second,d=p.first;\n\t\t\t\tif(d>dist[v])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor(auto x:G[r][v]){\n\t\t\t\t\tif(dist[x.to]>d+x.cost){\n\t\t\t\t\t\tdist[x.to]=d+x.cost;\n\t\t\t\t\t\tque.emplace(dist[x.to],x.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<dist[q]<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3628,
"score_of_the_acc": -0.89,
"final_rank": 16
},
{
"submission_id": "aoj_0200_5702529",
"code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcount(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define umap unordered_map\n#define uset unordered_set\nusing namespace std;\nusing ll = long long;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\n//入力系\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\n//出力系\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\n//デバッグ系\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\n//負の閉路がない場合はtrue，負の閉路がある場合はfalseを返す\nbool warshallFloyd(vector<vector<ll>> &A){\n int n=A.size();\n for(int k=0;k<n;k++){\n for(int i=0;i<n;i++){\n if(A[i][k]==INF2)continue;\n for(int j=0;j<n;j++){\n if(A[k][j]==INF2)continue;\n A[i][j]=min(A[i][j],A[i][k]+A[k][j]);\n }\n }\n }\n for(int i=0;i<n;i++){\n //ある点から連結であるという条件を加える場合A[u][v]!=INF2のようにする\n if(A[i][i]<0)return false;\n }\n return true;\n}\n\nint main(){\n while(1){\n INT(n,m);\n if(n==0&&m==0)return 0;\n vector2d(ll,A,m,m,INF2);\n vector2d(ll,B,m,m,INF2);\n int u,v,c,t;\n rep(i,n){\n in(u,v,c,t);\n A[--u][--v]=c;\n A[v][u]=c;\n B[u][v]=t;\n B[v][u]=t;\n }\n rep(i,m)A[i][i]=B[i][i]=0;\n warshallFloyd(A);\n warshallFloyd(B);\n codefor{\n in(u,v,c);\n if(c==0)out(A[--u][--v]);\n else out(B[--u][--v]);\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3620,
"score_of_the_acc": -0.7682,
"final_rank": 12
}
] |
aoj_0198_cpp
|
立方体の作品
芸術家品川は
n
点の作品を出展するように依頼されました。そこで、立方体の 6 面をペンキで色付けしたものを作品として出展することにしました。作品は、Red、Yellow、Blue、Magenta、Green、Cyan の 6 色全てが使われていて、各面は 1 色で塗りつぶされています。品川は形が同じ立方体の作品でも色の配置の仕方を変え、異なる作品として
n
点作成しました。
彼の友人であるあなたは、友人のよしみで作品を出展前に閲覧させてもらいましたが、そこであることに気が付きました。それらの作品の中に異なる色付けをされているように見えても、実は同じ色の組み合わせをした立方体が存在していたのです。このままでは、
n
点の作品を出展することできなくなってしまいます。
作成した作品の数と各作品の色の情報を入力とし、出展するためにあと何点必要かを出力するプログラムを作成してください。
立方体の各面の色は c1 から c6 までの記号で表され、 以下のような配置となっています。また、c1 から c6 のそれぞれは Red、Yellow、Blue、Magenta、Green、Cyan のいずれか 1 色となります。
Input
複数のデータセットの並びが入力として与えられます。 入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
cube
1
cube
2
:
cube
n
１行目に作品の数
n
(1 ≤
n
≤ 30)、続く
n
行に
i
番目の作品の情報が与えられます。各作品の情報は次の形式で与えられます。
c1 c2 c3 c4 c5 c6
作品の色の配置 c
i
が空白区切りで与えられます。
データセットの数は 100 を超えません。
Output
データセットごとに、出展するのにあと何点の作品が必要かを１行に出力します。
Sample Input
3
Cyan Yellow Red Magenta Green Blue
Cyan Yellow Red Magenta Green Blue
Red Yellow Magenta Blue Green Cyan
4
Red Magenta Blue Green Yellow Cyan
Red Yellow Magenta Blue Green Cyan
Magenta Green Red Cyan Yellow Blue
Cyan Green Yellow Blue Magenta Red
0
Output for the Sample Input
1
1
|
[
{
"submission_id": "aoj_0198_9088633",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\n// D[i][j] : (2,3,4,5面) 方向に倒した時 + 1面を軸に (時計/反時計) 周りにした時、\n// 次の j 面は今の D[i][j] 面になる\nint D[6][6] = {{4, 0, 2, 3, 5, 1}, {3, 1, 0, 5, 4, 2}, {2, 1, 5, 0, 4, 3},\n {1, 5, 2, 3, 0, 4}, {0, 2, 4, 1, 3, 5}, {0, 3, 1, 4, 2, 5}};\ntemplate <typename T> array<T, 6> get_next_dice(array<T, 6> dice, int dir) {\n array<T, 6> ndice;\n for (int i = 0; i < 6; i++) {\n ndice[i] = dice[D[dir][i]];\n }\n return ndice;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n while (cin >> n, n) {\n using Dice = array<string, 6>;\n set<Dice> st;\n int res = 0;\n for (int i = 0; i < n; i++) {\n bool f = false;\n vector<Dice> v(6);\n for (int j = 0; j < 6; j++) {\n cin >> v[0][j];\n }\n for (int j = 1; j < 4; j++) {\n v[j] = get_next_dice(v[j - 1], 0);\n }\n v[4] = get_next_dice(v[0], 1);\n v[5] = get_next_dice(v[0], 2);\n for (int j = 0; j < 6; j++) {\n auto d = v[j];\n for (int k = 0; k < 4; k++) {\n if (st.find(d) != st.end()) f = true;\n st.insert(d);\n d = get_next_dice(d, 4);\n }\n }\n\n if (f) res += 1;\n }\n cout << res << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3504,
"score_of_the_acc": -0.9769,
"final_rank": 16
},
{
"submission_id": "aoj_0198_6860080",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n while(cin >> n, n){\n set<vector<string>> S;\n int ans = 0;\n for(int i = 0; i < n; i++){\n vector<string> a(6);\n for(auto &&s:a)cin >> s;\n if(S.count(a)){\n ans++;\n continue;\n }\n for(int l = 0; l < 4; l++){\n for(int j = 0; j < 4; j++){\n for(int k = 0; k < 4; k++){\n S.insert(a);\n swap(a[5], a[2]);\n swap(a[2], a[0]);\n swap(a[0], a[3]);\n }\n swap(a[4], a[2]);\n swap(a[2], a[1]);\n swap(a[1], a[3]);\n }\n swap(a[5], a[2]);\n swap(a[2], a[0]);\n swap(a[0], a[3]);\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3592,
"score_of_the_acc": -1,
"final_rank": 17
},
{
"submission_id": "aoj_0198_5804251",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\n#pragma GCC target (\"avx2\")\n#pragma GCC optimization (\"O3\")\n#pragma GCC optimization (\"unroll-loops\")\nusing namespace std;\n \ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\n \ntypedef long long ll;\ntypedef long double ld;\ntypedef unsigned long long ull;\n \n \n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n \n#define MOD 1000000007\n \ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\nconst double EPS = 1e-8, PI = acos(-1);\nconst double pi = 3.141592653589793238462643383279;\n//ここから編集 \ntypedef string::const_iterator State;\nll GCD(ll a, ll b){\n return (b==0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b) * b;\n}\ntemplate< int mod >\nstruct ModInt {\n int x;\n \n ModInt() : x(0) {}\n \n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n \n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n \n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n \n ModInt operator-() const { return ModInt(-x); }\n \n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n \n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n \n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n \n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n \n bool operator==(const ModInt &p) const { return x == p.x; }\n \n bool operator!=(const ModInt &p) const { return x != p.x; }\n \n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n \n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n \n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n \n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n \n static int get_mod() { return mod; }\n};\n \nusing modint = ModInt< 1000000007 >;\ntemplate< typename T >\nstruct Combination {\n vector< T > _fact, _rfact, _inv;\n \n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\n _fact[0] = _rfact[sz] = _inv[0] = 1;\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[sz] /= _fact[sz];\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n \n inline T fact(int k) const { return _fact[k]; }\n \n inline T rfact(int k) const { return _rfact[k]; }\n \n inline T inv(int k) const { return _inv[k]; }\n \n T P(int n, int r) const {\n if(r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n \n T C(int p, int q) const {\n if(q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n \n T H(int n, int r) const {\n if(n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\n \nll modpow(ll x, ll n, ll mod) {\n ll res = 1;\n while(n) {\n if(n&1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n} \ninline long long mod(long long a, long long m) {\n return (a % m + m) % m;\n}\ntemplate<typename T> \nstruct BIT{\n int N;\n std::vector<T> node;\n\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\n\n /* a: 1-indexed */\n void update(int a, T x){\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] = max(node[i],x);\n }\n\n /* [1, a] */\n T query(int a){\n T res = 0;\n for(int x=a; x>0; x -= x & -x) res = max(res,node[x]);\n return res;\n }\n\n /* \n a1+a2+...+aw >= valとなるような最小のwを返す\n @verify https://codeforces.com/contest/992/problem/E\n */\n int lower_bound(T val) {\n if(val < 0) return 0;\n\n int res = 0;\n int n = 1; \n while (n < N) n *= 2;\n\n T tv=0;\n for (int k = n; k > 0; k /= 2) {\n if(res + k < N && node[res + k] < val){\n val -= node[res+k];\n res += k;\n }\n }\n return res+1; \n }\n};\nstruct UnionFind{\n std::vector<int> par;\n std::vector<int> siz;\n\n UnionFind(int sz_): par(sz_), siz(sz_) {\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n void init(int sz_){\n par.resize(sz_);\n siz.resize(sz_);\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n int root(int x){\n if(x == par[x]) return x;\n return par[x] = root(par[x]);\n }\n\n bool merge(int x, int y){\n x = root(x), y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) std::swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y){\n return root(x) == root(y);\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\nstruct RollingHash {\n static const int base1 = 1007, base2 = 2009;\n static const int mod1 = 1000000007, mod2 = 1000000009;\n vector<long long> hash1, hash2, power1, power2;\n int n;\n // construct\n RollingHash(const string &S) {\n n = (int)S.size();\n hash1.assign(n+1, 0);\n hash2.assign(n+1, 0);\n power1.assign(n+1, 1);\n power2.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\n power1[i+1] = (power1[i] * base1) % mod1;\n power2[i+1] = (power2[i] * base2) % mod2;\n }\n }\n \n // get hash of S[left:right]\n inline pair<long long, long long> get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\n if (res2 < 0) res2 += mod2;\n return {res1, res2};\n }\n \n inline pair<long long, long long> c_shift(int l) {\n auto h1 = get(0, l);\n auto h2 = get(l, n);\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\n }\n \n // get lcp of S[a:] and T[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\nstruct Dice {\n const int UP = 0;\n const int FRONT = 1;\n const int RIGHT = 2;\n const int LEFT = 3;\n const int BACK = 4;\n const int DOWN = 5;\n\n vector<string> d;\n\n Dice(vector<string> v, int N = 6){\n d.resize(N);\n for(int i=0; i<N; i++){\n d[i] = v[i];\n }\n }\n\n void rotate(char s){\n vector<string> tmp = d;\n if(s == 'S'){\n d[0] = tmp[4];\n d[1] = tmp[0];\n d[5] = tmp[1];\n d[4] = tmp[5];\n }\n\n if(s == 'E'){\n d[0] = tmp[3];\n d[2] = tmp[0];\n d[5] = tmp[2];\n d[3] = tmp[5];\n }\n\n if(s == 'W'){\n d[0] = tmp[2];\n d[3] = tmp[0];\n d[5] = tmp[3];\n d[2] = tmp[5];\n }\n\n if(s == 'N'){\n d[0] = tmp[1];\n d[1] = tmp[5];\n d[5] = tmp[4];\n d[4] = tmp[0];\n }\n }\n\n void spin(){\n vector<string> tmp = d;\n d[1] = tmp[2];\n d[2] = tmp[4];\n d[4] = tmp[3];\n d[3] = tmp[1];\n }\n \n\n string operator[](const int &k)\n {\n return d[k];\n }\n\n bool issame(Dice d2){\n bool res = true;\n\n for(int i=0; i<6; i++){\n if(d[i] != d2[i]) res = false;\n }\n\n return res;\n }\n};\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n int n; \n while(cin >> n, n) {\n int ans = 0;\n vector<Dice> ds;\n REP(i,n) {\n vector<string> s(6);\n REP(j,6) cin >> s[j];\n Dice d(s);\n ds.push_back(Dice(s));\n }\n UnionFind uf(n);\n REP(i,n) {\n bool ok = true;\n REP(j,n) {\n if(i == j) continue;\n Dice d1 = ds[i];\n Dice d2 = ds[j];\n REP(k,4) {\n d2.spin();\n REP(l,4){\n d2.rotate('N');\n REP(m,4) {\n d2.rotate('W');\n if(d1.issame(d2)) uf.merge(i, j);\n }\n }\n }\n }\n }\n set<int> roots;\n REP(i,n) {\n roots.insert(uf.root(i));\n }\n for(auto e: roots) {\n ans += uf.size(e) -1;\n }\n cout << ans << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 3396,
"score_of_the_acc": -1.23,
"final_rank": 18
},
{
"submission_id": "aoj_0198_5790448",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e9;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, long long N) {\n for (long long i = 0; i < N; i++) {\n cin >> A[i];\n }\n}\nstruct Dice {\n vector<string>S;\n Dice() {S.resize(6, \"\");}\n void read() {\n for (long long i = 0; i < 6; i++) {\n cin >> S[i];\n }\n }\n string &operator [] (long long i) {\n return S[i];\n }\n};\nvoid rotate(string &A, string &B, string &C, string &D) {\n string S = A;\n A=B;B=C;C=D;D=S;\n}\nbool same(Dice &A, Dice &B) {\n vector<vector<long long>>C = {\n {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 };\n vector<long long>D = {5, 4, 3, 2, 1, 0};\n for (long long i = 0; i < 6; i++) {\n for (long long j = 0; j < 4; j++) {\n //compare\n bool check = true;\n for (long long k = 0; k < 6; k++) {\n if (A[k] != B[k]) check = false;\n }\n if (check) return true;\n rotate(B[C[5][0]],B[C[5][1]],B[C[5][2]],B[C[5][3]]);\n }\n if (i % 2 == 0) {\n rotate(B[C[3][0]],B[C[3][1]],B[C[3][2]],B[C[3][3]]);\n }\n else rotate(B[C[1][0]],B[C[1][1]],B[C[1][2]],B[C[1][3]]);\n }\n return false;\n}\nint main() {\n long long N; cin >> N;\n while (N != 0) {\n vector<Dice>S(N);\n for (long long i = 0; i < N; i++) {\n S[i].read();\n }\n for (long long i = 0; i < N; i++) {\n for (long long j = i + 1; j < N; j++) {\n if (same(S[i], S[j])) {\n for (long long k = 0; k < 6; k++) {\n S[i][k] = \"-1\";\n }\n break;\n }\n }\n }\n long long ans = 0;\n for (long long i = 0; i < N; i++) {\n ans += (S[i][0] == \"-1\");\n }\n cout << ans << endl;\n cin >> N;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3336,
"score_of_the_acc": -0.8997,
"final_rank": 13
},
{
"submission_id": "aoj_0198_4979965",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).endf()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).endf())\n#define SORT(c) sort((c).begin(), (c).endf())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-4, PI = acos(-1);\n//ここから編集 \ntypedef string::const_iterator State;\nstruct Dice {\n const int UP = 0;\n const int FRONT = 1;\n const int RIGHT = 2;\n const int LEFT = 3;\n const int BACK = 4;\n const int DOWN = 5;\n\n vector<int> d;\n\n Dice(vector<int> v, int N = 6){\n d.resize(N);\n for(int i=0; i<N; i++){\n d[i] = v[i];\n }\n }\n\n void rotate(char s){\n vector<int> tmp = d;\n if(s == 'S'){\n d[0] = tmp[4];\n d[1] = tmp[0];\n d[5] = tmp[1];\n d[4] = tmp[5];\n }\n\n if(s == 'E'){\n d[0] = tmp[3];\n d[2] = tmp[0];\n d[5] = tmp[2];\n d[3] = tmp[5];\n }\n\n if(s == 'W'){\n d[0] = tmp[2];\n d[3] = tmp[0];\n d[5] = tmp[3];\n d[2] = tmp[5];\n }\n\n if(s == 'N'){\n d[0] = tmp[1];\n d[1] = tmp[5];\n d[5] = tmp[4];\n d[4] = tmp[0];\n }\n }\n\n void spin(){\n vector<int> tmp = d;\n d[1] = tmp[2];\n d[2] = tmp[4];\n d[4] = tmp[3];\n d[3] = tmp[1];\n }\n \n\n int operator[](const int &k)\n {\n return d[k];\n }\n\n bool issame(Dice &d2){\n bool res = true;\n\n for(int i=0; i<6; i++){\n if(d[i] != d2[i]) res = false;\n }\n\n return res;\n }\n};\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n int n; \n while(cin >> n,n){\n\n set<vector<int>> st;\n vector<vector<string>> v(n);\n map<string, int> mp;\n int cnt = 0;\n REP(i,n){\n REP(j,6){\n string t; cin >> t;\n if(!mp.count(t)) mp[t] = cnt++;\n v[i].push_back(t);\n }\n }\n int ans = 0;\n vector<bool> checked(n, false);\n REP(i,n){\n if(checked[i]) continue;\n\n REP(t,n){ \n if(i == t || checked[t]) continue;\n vector<int> tt;\n REP(j,6) tt.push_back(mp[v[i][j]]);\n Dice d1(tt, 6);\n vector<int> ttt;\n REP(j,6) ttt.push_back(mp[v[t][j]]);\n Dice d2(ttt, 6);\n bool ok = false;\n REP(j,4){\n d1.spin();\n REP(k,4){\n d1.rotate('N');\n REP(l,4){\n d1.rotate('W');\n if(d2.issame(d1)) ok = true;\n }\n }\n }\n if(ok){\n ans++;\n checked[t] = true;\n }\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3184,
"score_of_the_acc": -0.8742,
"final_rank": 11
},
{
"submission_id": "aoj_0198_4286649",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<string>\n#include<algorithm>\n#include<vector>\n\nusing namespace std;\n\nvector<string> CubeInfo[30];\nstring StrTmp[6];\nint N;\nbool SameFlag[30];\n//top front right left back bottom\nint RotateBase[24][6] = {\n\t{ 0,1,2,3,4,5 },{},{},{},\n\t{ 1,5,2,3,0,4 },{},{},{},\n\t{ 2,1,5,0,4,3 },{},{},{},\n\t{ 3,1,0,5,4,2 },{},{},{},\n\t{ 4,0,2,3,5,1 },{},{},{},\n\t{ 5,4,2,3,1,0 },{},{},{},\n};\n\n\nvoid fullRotateBase() {\n\tint tmp[6], num;\n\n\tfor (int i = 0; i < 21; i += 4) {\n\t\tfor (int j = 0; j < 6; ++j) {\n\t\t\ttmp[j] = RotateBase[i][j];\n\t\t}\n\t\tfor (int k = 1; k < 4; ++k) {\n\t\t\tnum = tmp[1];\n\t\t\ttmp[1] = tmp[3];\n\t\t\ttmp[3] = tmp[4];\n\t\t\ttmp[4] = tmp[2];\n\t\t\ttmp[2] = num;\n\t\t\tfor (int j = 0; j < 6; ++j) {\n\t\t\t\tRotateBase[i + k][j] = tmp[j];\n\t\t\t}\n\t\t}\n\t}\n\t/*for (int i = 0; i < 24; ++i) {\n\t\tfor (int j = 0; j < 6; ++j) {\n\t\t\tcout << RotateBase[i][j] + 1 << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\tcout << endl;*/\n}\n\nbool judgeSame(int i, int j) {\n\tstring tmp[6];\n\tbool flag;\n\n\tfor (int id = 0; id < 24; ++id) {\n\t\tfor (int k = 0; k < 6; ++k) {\n\t\t\ttmp[k] = CubeInfo[j][RotateBase[id][k]];\n\t\t}\n\t\tfor (int k = 0; k < 6; ++k) {\n\t\t\tif (CubeInfo[i][k] != tmp[k]) {\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tflag = true;\n\t\t}\n\t\tif (flag) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nint solve() {\n\tint cnt;\n\n\tcnt = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (SameFlag[i]) {\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = i + 1; j < N; ++j) {\n\t\t\tif (judgeSame(i, j)) {\n\t\t\t\tSameFlag[j] = true;\n\t\t\t\t++cnt;\n\t\t\t}\n\t\t}\n\t}\n\treturn cnt;\n}\n\nint main() {\n\tstring str;\n\n\tfullRotateBase();\n\twhile (cin >> N, N) {\n\t\tmemset(SameFlag, false, sizeof(SameFlag));\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tCubeInfo[i].clear();\n\t\t\tfor (int j = 0; j < 6; ++j) {\n\t\t\t\tcin >> str;\n\t\t\t\tCubeInfo[i].push_back(str);\n\t\t\t}\n\t\t}\n\t\tcout << solve() << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3016,
"score_of_the_acc": -0.7743,
"final_rank": 5
},
{
"submission_id": "aoj_0198_3896934",
"code_snippet": "#include<iostream>\nusing namespace std;\nstruct A{\n\tstring s[6];\n\tvoid input(){\n\t\tfor(int i=0;i<6;i++)cin>>s[i];\n\t}\n\tbool operator==(const A&a){\n\t\tfor(int _=0;_<8;_++)\n\t\t{\n\t\t\tfor(int __=0;__<4;__++)\n\t\t\t{\n\t\t\t\tbool flag=true;\n\t\t\t\tfor(int i=0;i<6;i++)flag&=s[i]==a.s[i];\n\t\t\t\tif(flag)return true;\n\t\t\t\tstring tmp=s[1];\n\t\t\t\ts[1]=s[2];\n\t\t\t\ts[2]=s[4];\n\t\t\t\ts[4]=s[3];\n\t\t\t\ts[3]=tmp;\n\t\t\t}\n\t\t\tif(_<4)\n\t\t\t{\n\t\t\t\tstring tmp=s[0];\n\t\t\t\ts[0]=s[1];\n\t\t\t\ts[1]=s[5];\n\t\t\t\ts[5]=s[4];\n\t\t\t\ts[4]=tmp;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstring tmp=s[0];\n\t\t\t\ts[0]=s[2];\n\t\t\t\ts[2]=s[5];\n\t\t\t\ts[5]=s[3];\n\t\t\t\ts[3]=tmp;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n};\nint N;\nA a[30];\nbool used[30];\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tint ans=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\ta[i].input();\n\t\t\tused[i]=true;\n\t\t\tfor(int j=0;j<i;j++)\n\t\t\t{\n\t\t\t\tif(used[j]&&a[j]==a[i])\n\t\t\t\t{\n\t\t\t\t\tused[i]=false;\n\t\t\t\t\tans++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3160,
"score_of_the_acc": -0.8307,
"final_rank": 8
},
{
"submission_id": "aoj_0198_3671527",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n\nstruct cube {\n\n vector<string> c;\n\n cube(): c(6) {}\n\n static bool is_same(cube a, cube b) {\n\n {\n bool r = true;\n for (int l = 0; l < 6; l++) {\n if (a.c[l] != b.c[l]) {\n r = false;\n break;\n }\n }\n if (r) return true;\n }\n \n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 4; j++) {\n for (int k = 0; k < 4; k++) {\n string temp = b.c[3];\n b.c[3] = b.c[5];\n b.c[5] = b.c[2];\n b.c[2] = b.c[0];\n b.c[0] = temp;\n bool r = true;\n for (int l = 0; l < 6; l++) {\n if (a.c[l] != b.c[l]) {\n r = false;\n break;\n }\n }\n if (r) return true;\n }\n string temp = b.c[4];\n b.c[4] = b.c[5];\n b.c[5] = b.c[1];\n b.c[1] = b.c[0];\n b.c[0] = temp;\n }\n string temp = b.c[3];\n b.c[3] = b.c[4];\n b.c[4] = b.c[2];\n b.c[2] = b.c[1];\n b.c[1] = temp;\n }\n\n return false;\n\n }\n\n\n};\n\nint main() {\n\n ll n;\n while (cin >> n, n) {\n\n vector<cube> cb(n);\n for (ll i = 0; i < n; i++) {\n for (ll j = 0; j < 6; j++) {\n cin >> cb[i].c[j];\n }\n }\n\n ll ans = 0;\n for (ll i = 0; i < n; i++) {\n bool is_kaburi = false;\n for (ll j = 0; j < i; j++) {\n if (cube::is_same(cb[i], cb[j])) {\n is_kaburi = true;\n break;\n }\n }\n if (is_kaburi) {\n ans++;\n }\n }\n\n cout << ans << endl;\n\n }\n\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3156,
"score_of_the_acc": -0.8405,
"final_rank": 10
},
{
"submission_id": "aoj_0198_3120280",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n//define\n#define int long long\n#define UNIQUE(v) v.erase(unique(all(v)), v.end());\n#define ZIP(v) sort(all(v)),UNIQUE(v)\n#define ADD(a, b) a = (a + b) % mod\n#define SUB(a, b) a = (a+mod-b)%mod\n#define MUL(a, b) a = (a * b) % mod\n#define repi(i,m,n) for(int i = m;i < n;i++)\n#define drep(i,n,m) for(int i = n;i >= m;i--)\n#define rep(i,n) repi(i,0,n)\n#define rrep(i,n) repi(i,1,n+1)\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define all(v) v.begin(),v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define dmp(x,y) make_pair(x,y)\n#define pb(x) push_back(x)\n#define fi first\n#define se second\n\n//template\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p){\n os << p.first << \" \" << p.second;return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v){\n for (auto it = v.begin();it != v.end();++it){\n if (it != v.begin())os << \" \";os << *it;\n }return os;\n}\ntemplate<typename T, int SIZE>\nint array_length(const T (&)[SIZE]){return SIZE;}\ntemplate<typename T, int N>\nvoid print(const T (&a)[N], int s = N, int t = -1, bool f = true){\n\tif(t == -1){rep(i,s){if(i)cout << \" \";cout << a[i];}}\n\telse repi(i,s,t){if(i!=s)cout << \" \";cout << a[i];}\n\tif(f)cout << \"\\n\";\n}\ntemplate<typename T, int N1, int N2>\nvoid print(const T (&a)[N1][N2], int h = N1, int w = N2){\n\trep(i,h){rep(j,w){cout << a[i][j] << \" \\n\"[j==w-1];}}\n}\n\n//typedef\ntypedef pair<int,int> P;\ntypedef pair<int, P> PP;\ntypedef pair<P, int> Pi;\ntypedef vector<int> vi;\ntypedef deque<int> dq;\nconst int inf = 1e9+7;\nconst int INF = 1e18+7;\n\n\n\n\nclass UnionFind{\npublic:\n\tvector<int> ran, par;\n\tvoid init(int n){\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tpar.push_back(i);\n\t\t\tran.push_back(0);\n\t\t}\n\t}\n\t\n\tint find(int x){\n\t\tif(par[x] == x)return x;\n\t\treturn par[x] = find(par[x]);\n\t}\n\t\n\tvoid unite(int x, int y){\n\t\tx = find(par[x]);\n\t\ty = find(par[y]);\n\t\tif(x == y)return;\n\t\tif(ran[x] < ran[y]){\n\t\t\tpar[x] = y;\n\t\t}else{\n\t\t\tpar[y] = x;\n\t\t\tif(par[x] == par[y])ran[x]++;\n\t\t}\n\t}\n\t\n\tbool same(int x, int y){\n\t\treturn find(par[x]) == find(par[y]);\n\t}\n};\n\ntemplate <typename T>class Box;\ntemplate <typename T>ostream& operator<<(ostream &, const Box<T> &);\ntemplate<typename T>class Box{\npublic:\n\tT top;\n T back, left, right, head;\n T bottom;\n\tT a[6];\n\tvoid init(T TOP, T BACK, T LEFT, T RIGHT, T HEAD, T BOTTOM){\n\t\ttop = TOP;back = BACK;left = LEFT;\n\t\tright = RIGHT;head = HEAD;bottom = BOTTOM;\n\t\ta[0] = top;a[1] = back;a[2] = left;\n\t\ta[3] = right;a[4] = head;a[5] = bottom;\n\t}\n\tfriend ostream &operator<<<T>(ostream &os, const Box &B);\n\tbool operator==(const Box& b) const {\n\t\treturn(top == b.top &&\n\t\t\t\t\t back == b.back &&\n\t\t\t\t\t left == b.left &&\n\t\t\t\t\t right == b.right &&\n\t\t\t\t\t head == b.head &&\n\t\t\t\t\t bottom == b.bottom);\n\t}\n\tvoid rotate(T &d1, T &d2, T &d3, T &d4){\n\t\tT tmp = d1;\n\t\td1 = d2;d2 = d3;d3 = d4;\n\t\td4 = tmp;\n\t}\n\tvoid rotate_forward(){rotate(top, head, bottom, back);}\n\tvoid rotate_right(){rotate(top, left, bottom, right);}\n\tvoid rotate_spin(){rotate(head, right, back, left);}\n\tfriend ostream & operator<< <>(ostream &, const Box<T> & B);\n};\ntemplate <typename T>\nostream & operator<<(ostream & os, const Box<T> & B){\n\tos << \" \" \t\t\t\t<< B.back << endl;\n\tos << B.left << \" \" << B.bottom << \" \" << B.right << \" \" << B.top << endl;\n\tos << \" \" \t\t\t\t<< B.head << endl;\n\treturn os;\n}\n\nbool same(Box<string> a, Box<string> b){\n\trep(i,4){\n\t\ta.rotate_forward();\n\t\trep(j,4){\n\t\t\ta.rotate_right();\n\t\t\trep(k,4){\n\t\t\t\ta.rotate_spin();\n\t\t\t\tif(a == b)return true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nsigned main(){\n\twhile(1){\n\t\tint n;\n\t\tscanf(\"%lld\", &n);\n\t\tif(n == 0)break;\n\t\tBox<string> B[n];\n\t\tUnionFind uf;uf.init(n);\n\t\trep(i,n){\n\t\t\tstring str[6];\n\t\t\trep(j,6)cin >> str[j];\n\t\t\tB[i].init(str[5], str[4], str[3], str[2], str[1], str[0]);\n\t\t}\n\t\tint ans = 0;\n\t\trep(i,n)rep(j,n){\n\t\t\tif(same(B[i], B[j]))uf.unite(i, j);\n\t\t}\n\t\trep(i,n)ans += (uf.find(i) == i);\n\t\tprintf(\"%lld\\n\", n-ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3180,
"score_of_the_acc": -0.8954,
"final_rank": 12
},
{
"submission_id": "aoj_0198_2894547",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint pad[3][6] = { { 3, 1, 0, 5, 4, 2 }, { 1, 5, 2, 3, 0, 4 }, { 0, 2, 4, 1, 3, 5 } };\nvoid rotate ( int op, string &S )\n{\n string temp;\n for ( int i = 0; i < 6; i++ ) {\n temp.push_back ( S[pad[op][i]] );\n }\n S = temp;\n}\n\nbool search ( string S, string T )\n{\n for ( int i = 0; i < 4; i++ ) {\n for ( int j = 0; j < 4; j++ ) {\n for ( int k = 0; k < 4; k++ ) {\n if ( S == T ) {\n return ( false );\n }\n rotate ( 2, S );\n }\n rotate ( 1, S );\n }\n rotate ( 0, S );\n }\n return ( true );\n}\n\nint main()\n{\n int N;\n int rotate_pos[35];\n\n while ( cin >> N, N ) {\n vector < string > data(N);\n int ans = 0;\n bool flag[35];\n\n fill_n(flag, 35, true);\n for ( int i = 0; i < N; i++ ) {\n string S;\n for ( int j = 0; j < 6; j++ ) {\n cin >> S;\n data[i] += S[0];\n }\n for ( int j = 0; j < i; j++ ) {\n flag[i] &= search ( data[i], data[j] );\n }\n }\n for ( int i = 0; i < N; i++ ) {\n if ( !flag[i] ) {\n ans++;\n }\n }\n cout << ans << endl;\n }\n\n return ( 0 );\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3008,
"score_of_the_acc": -0.9189,
"final_rank": 15
},
{
"submission_id": "aoj_0198_2401810",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 100\nclass Cube {\npublic:\n\tstring f[6];\n\tCube() {\n\t}\n\tvoid roll_z() {\n\t\troll(1, 2, 4, 3);\n\t}\n\tvoid roll_y() {\n\t\troll(0, 2, 5, 3);\n\t}\n\tvoid roll_x() {\n\t\troll(0, 1, 5, 4);\n\t}\n\tvoid roll(int i, int j, int k, int l) {\n\t\tstring t = f[i];\n\t\tf[i] = f[j];\n\t\tf[j] = f[k];\n\t\tf[k] = f[l];\n\t\tf[l] = t;\n\t}\n};\nCube C[MAX];\nint n;\nbool eq(Cube c1, Cube c2) {\n\tfor (int i = 0; i < 6; i++)\n\t\tif (c1.f[i] != c2.f[i])\n\t\t\treturn false;\n\treturn true;\n}\n\nbool equal(Cube c1, Cube c2) {\n\tfor (int i = 0; i < 6; i++) {\n\t\tfor (int j = 0; j < 4; j++) {\n\t\t\tif (eq(c1, c2))\n\t\t\t\treturn true;\n\t\t\tc1.roll_z();\n\t\t}\n\t\tif (i % 2 == 0)\n\t\t\tc1.roll_y();\n\t\telse\n\t\t\tc1.roll_x();\n\t}\n\treturn false;\n}\nmain() {\n\twhile( cin >> n && n ) {\n\t\tfor(int i = 0;i<n;i++) for(int j = 0;j<6;j++) cin >> C[i].f[j];\n\t\tint cnt = 0;\n\t\tfor(int i = 0;i<n;i++) {\n\t\t\tbool hasSame = false;\n\t\t\tfor(int j=i+1; j<=n-1;j++) if (equal(C[i],C[j])) {hasSame =\n\t\t\t\ttrue;break;}\n\t\t\tif ( !hasSame ) cnt++;\n\t\t}\n\t\tcout << n - cnt << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3092,
"score_of_the_acc": -0.8154,
"final_rank": 6
},
{
"submission_id": "aoj_0198_2315008",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nstring s[33][6];\nint check(int a,int b){\n if(s[a][0]==s[b][0]&&s[a][1]==s[b][1]&&s[a][2]==s[b][2]&&s[a][3]==s[b][3]&&s[a][4]==s[b][4]&&s[a][5]==s[b][5])return 1;\n return 0;\n}\nvoid r1(int a){\n string p=s[a][0];\n swap(s[a][0],s[a][2]);swap(s[a][2],s[a][5]);\n swap(s[a][5],s[a][3]);s[a][3]=p;\n}\nvoid r2(int a){\n string p=s[a][0];\n swap(s[a][0],s[a][1]);swap(s[a][1],s[a][5]);\n swap(s[a][5],s[a][4]);s[a][4]=p;\n}\nvoid r3(int a){\n string p=s[a][1];\n swap(s[a][1],s[a][2]);swap(s[a][2],s[a][4]);\n swap(s[a][4],s[a][3]);s[a][3]=p;\n}\nint c7(int a,int b){\n int p=0;\n for(int i=0;i<4;i++){\n r1(a);\n for(int j=0;j<4;j++){\n r2(a);\n for(int k=0;k<4;k++){\n r3(a);\n if(check(a,b))p++;\n }\n }\n }\n return p;\n}\nint main(){\n int n;\n while(cin>>n,n){\n int sum=0;\n for(int i=0;i<n;i++)\n for(int j=0;j<6;j++)\n cin>>s[i][j];\n for(int i=0;i<n;i++){\n int p=0;\n for(int j=i+1;j<n;j++){\n if(c7(i,j))p++;\n }\n if(p)sum++;\n }\n cout<<sum<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3136,
"score_of_the_acc": -0.8327,
"final_rank": 9
},
{
"submission_id": "aoj_0198_2176551",
"code_snippet": "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n#include <cassert>\n#include <utility>\n#include <memory>\n#include <functional>\n#include <deque>\n#include <cctype>\n#include <ctime>\n#include <numeric>\n#include <list>\n#include <iomanip>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <tuple>\n#include <initializer_list>\n#include <forward_list>\n\n#define cauto const auto&\n#else\n\n#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n\n#define MOD 1000000007LL\n#define EPS 1e-8\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\n#define maxs(x,y) x=max(x,y)\n#define mins(x,y) x=min(x,y)\n\nmap<string,int> dict;\n\n//saikoro\n \ntypedef vector<int> Dice;\nenum {TOP, FRONT, RIGHT, LEFT, BACK, BOTTOM};\n#define rotate_swap(x, a, b, c, d) swap(x[a], x[b]); swap(x[b], x[c]); swap(x[c], x[d]);\n \nvoid rotate_r(Dice& dice) {rotate_swap(dice, TOP, LEFT, BOTTOM, RIGHT);}\nvoid rotate_l(Dice& dice) {rotate_swap(dice, TOP, RIGHT, BOTTOM, LEFT);}\nvoid rotate_f(Dice& dice) {rotate_swap(dice, TOP, BACK, BOTTOM, FRONT);}\nvoid rotate_b(Dice& dice) {rotate_swap(dice, TOP, FRONT, BOTTOM, BACK);}\nvoid rotate_w(Dice& dice) {rotate_swap(dice, BACK, LEFT, FRONT, RIGHT);}\nvoid rotate_c(Dice& dice) {rotate_swap(dice, BACK, RIGHT, FRONT, LEFT);}\n \nvector<Dice> generate_all(Dice dice) {\n \tvector<Dice> res;\n \tfor (int i = 0; i < 6; ++i) {\n \tfor (int j = 0; j < 4; ++j){\n \t\tres.emplace_back(dice), rotate_w(dice);\n \t}\n\t if (i % 2) rotate_f(dice);\n\t else rotate_r(dice);\n\t}\n\treturn res;\n}\n\n\nvoid mainmain(){\n\tdict[\"Red\"] = 0;\n\tdict[\"Yellow\"] = 1;\n\tdict[\"Blue\"] = 2;\n\tdict[\"Magenta\"] = 3;\n\tdict[\"Green\"] = 4;\n\tdict[\"Cyan\"] = 5;\n\tint n;\n\twhile(cin>>n,n){\n\t\tvector<Dice> v(n);\n\t\trep(i,n){\n\t\t\tv[i] = Dice(6);\n\t\t\trep(j,6){\n\t\t\t\tstring s;\n\t\t\t\tcin>>s;\n\t\t\t\tv[i][j] = dict[s];\n\t\t\t}\n\t\t}\n\t\tint cnt = 0;\n\t\trep(i,n){\n\t\t\tbool ok = true;\n\t\t\trep(j,i){\n\t\t\t\tvector<Dice> tmp = generate_all(v[j]);\n\t\t\t\trep(k, tmp.size()){\n\t\t\t\t\tif(tmp[k] == v[i]) ok = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ok){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tcout << n - cnt << endl;\n\t}\n}\n\n\nsigned main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout<<fixed<<setprecision(20);\n mainmain();\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.8245,
"final_rank": 7
},
{
"submission_id": "aoj_0198_2149021",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint Dice[6][6] = { { 1,5,2,3,0,4 },{ 4,0,2,3,5,1 },{ 3,1,0,5,4,2 },{ 2,1,5,0,4,3 },{ 0,2,4,1,3,5 },{ 0,3,1,4,2,5 } }, power[6] = { 1,3,9,27,81,243 };\nstruct Saikoro { int x[6]; }; Saikoro T[30]; int n, vis[30]; char F[7] = \"CYRMGB\"; bool G[30][30];\nbool bfs(int p, int q) {\n\tfor (int i = 0; i < 729; i++) {\n\t\tint bit[6]; for (int j = 0; j < 6; j++) { bit[j] = (i / power[j]) % 3; }\n\t\tSaikoro U = T[p];\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tfor (int k = 0; k <= bit[j]; k++) {\n\t\t\t\tSaikoro V = U; for (int l = 0; l < 6; l++)V.x[l] = U.x[Dice[j][l]]; U = V;\n\t\t\t}\n\t\t}\n\t\tbool OK = true; for (int j = 0; j < 6; j++) { if (T[q].x[j] != U.x[j])OK = false; }\n\t\tif (OK == true)return true;\n\t}\n\treturn false;\n}\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < 30; i++) { for (int j = 0; j < 30; j++)G[i][j] = false; vis[i] = 0; }\n\t\tcin >> n; if (n == 0)break; for (int i = 0; i < n; i++) { for (int j = 0; j < 6; j++) { string S; cin >> S; for (int k = 0; k < 6; k++) { if (S[0] == F[k])T[i].x[j] = k; } } }\n\t\tfor (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { G[i][j] = bfs(i, j); G[j][i] = G[i][j]; } }\n\t\tint cnt = 0; for (int i = 0; i < n; i++) { if (vis[i] != 0)continue; cnt++; vis[i] = cnt; for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { if (vis[k] != cnt)continue; for (int l = 0; l < n; l++) { if (G[k][l] == true)vis[l] = cnt; } } } }\n\t\tcout << n - cnt << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 890,
"memory_kb": 2976,
"score_of_the_acc": -1.7586,
"final_rank": 20
},
{
"submission_id": "aoj_0198_2044566",
"code_snippet": "#ifndef ___Rank_Union_Find\n#define ___Rank_Union_Find\n\n#include <vector>\n\n// ------ Class ------ //\nclass UnionFind {\nprivate:\n\tunsigned size_; std::vector<unsigned> par, rank;\npublic:\n\tUnionFind() : size_(0), par(std::vector<unsigned>()), rank(std::vector<unsigned>()) {};\n\tUnionFind(unsigned size__) : size_(size__) {\n\t\tpar.resize(size_); rank.resize(size_);\n\t\tfor (unsigned i = 0; i < size_; i++) par[i] = i, rank[i] = 0;\n\t}\n\tunsigned size() { return size_; }\n\tunsigned root(unsigned x) { return par[x] == x ? x : par[x] = root(par[x]); }\n\tbool same(unsigned x, unsigned y) { return root(x) == root(y); }\n\tvoid unite(unsigned x, unsigned y) {\n\t\tx = root(x), y = root(y);\n\t\tif (x == y) return;\n\t\tif (rank[x] < rank[y]) par[x] = y;\n\t\telse if (rank[x] == rank[y]) par[y] = x, rank[x]++;\n\t\telse par[y] = x;\n\t}\n\tbool operator==(const UnionFind &u) { return par == u.par; }\n\tbool operator!=(const UnionFind &u) { return par != u.par; }\n};\n\n#endif\n\n#include <set>\n#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\nvector<int> x, y; int t;\nbool same(vector<int> a, vector<int> b) {\n\tfor (int i = 0; i < 4; i++) {\n\t\tfor (int j = 0; j < 4; j++) {\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tfor (int l = 0; l < 4; l++) {\n\t\t\t\t\tstring s;\n\t\t\t\t\tfor (int m = 0; m < i; m++) s += 'N';\n\t\t\t\t\tfor (int m = 0; m < j; m++) s += 'E';\n\t\t\t\t\tfor (int m = 0; m < k; m++) s += 'S';\n\t\t\t\t\tfor (int m = 0; m < l; m++) s += 'W';\n\t\t\t\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\t\t\t\tt = a[0];\n\t\t\t\t\t\tswitch (s[i]) {\n\t\t\t\t\t\tcase 'N':\n\t\t\t\t\t\t\ta[0] = a[1];\n\t\t\t\t\t\t\ta[1] = a[5];\n\t\t\t\t\t\t\ta[5] = a[4];\n\t\t\t\t\t\t\ta[4] = t;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\ta[0] = a[3];\n\t\t\t\t\t\t\ta[3] = a[5];\n\t\t\t\t\t\t\ta[5] = a[2];\n\t\t\t\t\t\t\ta[2] = t;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 'S':\n\t\t\t\t\t\t\ta[0] = a[4];\n\t\t\t\t\t\t\ta[4] = a[5];\n\t\t\t\t\t\t\ta[5] = a[1];\n\t\t\t\t\t\t\ta[1] = t;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 'W':\n\t\t\t\t\t\t\ta[0] = a[2];\n\t\t\t\t\t\t\ta[2] = a[5];\n\t\t\t\t\t\t\ta[5] = a[3];\n\t\t\t\t\t\t\ta[3] = t;\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\tif (a == b) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nint n; string s;\nint main() {\n\twhile (cin >> n, n) {\n\t\tvector<vector<int> > v(n, vector<int>(6));\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < 6; j++) {\n\t\t\t\tcin >> s;\n\t\t\t\tv[i][j] = s[0];\n\t\t\t}\n\t\t}\n\t\tUnionFind uf(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\tif (same(v[i], v[j])) uf.unite(i, j);\n\t\t\t}\n\t\t}\n\t\tset<int> s_;\n\t\tfor (int i = 0; i < n; i++) s_.insert(uf.root(i));\n\t\tcout << n - s_.size() << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 3180,
"score_of_the_acc": -1.4295,
"final_rank": 19
},
{
"submission_id": "aoj_0198_1967823",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nint main(void)\n{\n\tint n,f[30],i,j,k,x,cnt,l,flg;\n\tchar pat1[7],pat2[7];\n\tchar a[30][6],buf[10],wk;\n\twhile(1)\t{\n\t\tscanf(\" %d\",&n);\n\t\tif(n==0)\tbreak;\n\t\tfor(i=0;i<n;i++)\t{\n\t\t\tfor(j=0;j<6;j++)\t{\n\t\t\t\tscanf(\"%s\",buf);\n\t\t\t\ta[i][j]=buf[0];\n\t\t\t}\n\t\t}\n//\t\tfor(i=0;i<n;i++)\t{\n//\t\t\tfor(j=0;j<6;j++)\tprintf(\"%c\",a[i][j]);\n//\t\t\tprintf(\"\\n\");\n//\t\t}\n\t\tpat1[6]='\\0';\tpat2[6]='\\0';\n\t\tfor(i=0;i<n;i++)\tf[i]=0;\n\t\tfor(i=0;i<n-1;i++)\t{\n\t\t\tfor(j=i+1;j<n;j++)\t{\n\t\t\t\tfor(k=0;k<6;k++)\t{\n\t\t\t\t\tpat1[k]=a[i][k];\n\t\t\t\t\tpat2[k]=a[j][k];\n\t\t\t\t}\n\t\t\t\tflg=0;\n\t\t\t\tfor(k=0;k<4;k++)\t{\n\t\t\t\t\twk=pat1[0];\n\t\t\t\t\tpat1[0]=pat1[2];\n\t\t\t\t\tpat1[2]=pat1[5];\n\t\t\t\t\tpat1[5]=pat1[3];\n\t\t\t\t\tpat1[3]=wk;\n\t\t\t\t\tfor(l=0;l<4;l++)\t{\n\t\t\t\t\t\twk=pat1[1];\n\t\t\t\t\t\tpat1[1]=pat1[3];\n\t\t\t\t\t\tpat1[3]=pat1[4];\n\t\t\t\t\t\tpat1[4]=pat1[2];\n\t\t\t\t\t\tpat1[2]=wk;\n\t\t\t\t\t\tif(strcmp(pat1,pat2)==0)\t{\n\t\t\t\t\t\t\tflg=1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(k=0;k<4;k++)\t{\n\t\t\t\t\twk=pat1[0];\n\t\t\t\t\tpat1[0]=pat1[1];\n\t\t\t\t\tpat1[1]=pat1[5];\n\t\t\t\t\tpat1[5]=pat1[4];\n\t\t\t\t\tpat1[4]=wk;\n\t\t\t\t\tfor(l=0;l<4;l++)\t{\n\t\t\t\t\t\twk=pat1[1];\n\t\t\t\t\t\tpat1[1]=pat1[3];\n\t\t\t\t\t\tpat1[3]=pat1[4];\n\t\t\t\t\t\tpat1[4]=pat1[2];\n\t\t\t\t\t\tpat1[2]=wk;\n\t\t\t\t\t\tif(strcmp(pat1,pat2)==0)\t{\n\t\t\t\t\t\t\tflg=1;\t\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flg==1)\t{\n\t\t\t\t\tf[j]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt=0;\n\t\tfor(i=0;i<n;i++)\tcnt+=f[i];\n\t\tprintf(\"%d\\n\",cnt);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1040,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0198_1899733",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint N;\nint main()\n{\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N==0)return 0;\n\t\tint X[30][6];\n\t\tfor(int i=0;i<N;i++){\n\t\t\tfor(int j=0;j<6;j++){\n\t\t\t\tstring SS;\n\t\t\t\tcin >> SS;\n\t\t\t\tif(SS==\"Cyan\")X[i][j]=0;\n\t\t\t\tif(SS==\"Yellow\")X[i][j]=1;\n\t\t\t\tif(SS==\"Red\")X[i][j]=2;\n\t\t\t\tif(SS==\"Magenta\")X[i][j]=3;\n\t\t\t\tif(SS==\"Green\")X[i][j]=4;\n\t\t\t\tif(SS==\"Blue\")X[i][j]=5;\n\t\t\t}\n\t\t}\n\t\tint cou=0;\n\t\tfor(int i=0;i<N;i++){\n\t\t\tbool F=true;\n\t\t\tfor(int j=i+1;j<N;j++){\n\t\t\t\t//equal->false\n\t\t\t\tfor(int k=0;k<6;k++){\n\t\t\t\t\tfor(int l=0;l<4;l++){\n\t\t\t\t\t\tbool FF=false;\n\t\t\t\t\t\tfor(int m=0;m<6;m++){\n\t\t\t\t\t\t\t//if(i==0&&j==1)printf(\"%d \",X[i][m]);\n\t\t\t\t\t\t\tif(X[i][m]!=X[j][m])FF=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//if(i==0&&j==1)printf(\"\\n\");\n\t\t\t\t\t\tif(!FF)F=false;\n\t\t\t\t\t\tint t=X[i][1];\n\t\t\t\t\t\tX[i][1]=X[i][2];\n\t\t\t\t\t\tX[i][2]=X[i][4];\n\t\t\t\t\t\tX[i][4]=X[i][3];\n\t\t\t\t\t\tX[i][3]=t;\n\t\t\t\t\t}\n\t\t\t\t\tif(k==0){\n\t\t\t\t\t\tint t=X[i][0];\n\t\t\t\t\t\tX[i][0]=X[i][1];\n\t\t\t\t\t\tX[i][1]=X[i][5];\n\t\t\t\t\t\tX[i][5]=X[i][4];\n\t\t\t\t\t\tX[i][4]=t;\n\t\t\t\t\t}\n\t\t\t\t\tif(k==1){\n\t\t\t\t\t\tint t=X[i][0];\n\t\t\t\t\t\tX[i][0]=X[i][2];\n\t\t\t\t\t\tX[i][2]=X[i][5];\n\t\t\t\t\t\tX[i][5]=X[i][3];\n\t\t\t\t\t\tX[i][3]=t;\n\t\t\t\t\t}\n\t\t\t\t\tif(k==2){\n\t\t\t\t\t\tint t=X[i][2];\n\t\t\t\t\t\tX[i][2]=X[i][3];\n\t\t\t\t\t\tX[i][3]=t;\n\t\t\t\t\t\tt=X[i][5];\n\t\t\t\t\t\tX[i][5]=X[i][0];\n\t\t\t\t\t\tX[i][0]=t;\n\t\t\t\t\t}\n\t\t\t\t\tif(k==3){\n\t\t\t\t\t\tint t=X[i][0];\n\t\t\t\t\t\tX[i][0]=X[i][3];\n\t\t\t\t\t\tX[i][3]=X[i][5];\n\t\t\t\t\t\tX[i][5]=X[i][2];\n\t\t\t\t\t\tX[i][2]=t;\n\t\t\t\t\t}\n\t\t\t\t\tif(k==4){\n\t\t\t\t\t\tint t=X[i][0];\n\t\t\t\t\t\tX[i][0]=X[i][1];\n\t\t\t\t\t\tX[i][1]=X[i][5];\n\t\t\t\t\t\tX[i][5]=X[i][4];\n\t\t\t\t\t\tX[i][4]=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\tif(F)cou++;\n\t\t}\n\t\tprintf(\"%d\\n\",N-cou);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1256,
"score_of_the_acc": -0.0846,
"final_rank": 2
},
{
"submission_id": "aoj_0198_1861161",
"code_snippet": "#include<iostream>\n#include<stdio.h>\n#include<ctype.h>\n#include<string>\n#include<cmath>\n#include<math.h>\n#include<vector>\n#include<stdlib.h>\n#include<algorithm>\n#include<functional>\n\nusing namespace std;\n\n#define OUT cout <<\n#define IN cin >>\n#define E << endl;\n#define FOR(i,a,b) for(int i = a;i < b;i++)\n\nint n;\n\nvoid input(){\n\tIN n;\n}\n\nclass Dice{\n\tprivate:\n\t\tstring temp;\n\tpublic:\n\t\tstring c[6];\n\t\tDice(){}\n\t\tvoid roll(int axis){\n\t\t\tswitch(axis){\n\t\t\tcase 0:\n\t\t\t\ttemp = c[0];\n\t\t\t\tc[0] = c[1];\n\t\t\t\tc[1] = c[5];\n\t\t\t\tc[5] = c[4];\n\t\t\t\tc[4] = temp;\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\ttemp = c[1];\n\t\t\t\tc[1] = c[3];\n\t\t\t\tc[3] = c[4];\n\t\t\t\tc[4] = c[2];\n\t\t\t\tc[2] = temp;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\ttemp = c[0];\n\t\t\t\tc[0] = c[2];\n\t\t\t\tc[2] = c[5];\n\t\t\t\tc[5] = c[3];\n\t\t\t\tc[3] = temp;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tOUT \"switch error!!!!!!\\n\" E\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tvoid getd(string& c1, string& c2, string& c3, string& c4, string& c5, string& c6){\n\t\t\tc1 = c[0];\n\t\t\tc2 = c[1];\n\t\t\tc3 = c[2];\n\t\t\tc4 = c[3];\n\t\t\tc5 = c[4];\n\t\t\tc6 = c[5];\n\t\t}\n\n\t\tvoid input(){\n\t\t\tFOR(i,0,6){\n\t\t\t\tIN c[i];\n\t\t\t}\n\t\t}\n\n};\n\nint main(){\n\twhile(true){\n\t\tinput();\n\t\tif(n == 0)break;\n\t\tint count = 0;\n\t\tbool match[n];\n\t\tFOR(i, 0, n){\n\t\t\tmatch[i] = false;\n\t\t}\n\t\tstring str1[6];\n\t\tstring str2[6];\t\n\n\t\tvector<Dice> dice;\n\t\n\t\tdice.resize(n);\n\t\tFOR(i, 0, n){\n\t\t\tdice[i].input();\n\t\t}\n\t\t\t\n\n\t\tFOR(i, 0, n - 1){\n\t\t\tFOR(j, i + 1, n){\n\t\t\t\tbool flag2 = false;\n\t\t\t\tFOR(z, 0, 4){\n\t\t\t\tFOR(x, 0, 4){\n\t\t\t\t\tFOR(y, 0, 4){\n\t\t\t\t\t\tdice[i].getd(str1[0],str1[1],str1[2],str1[3],str1[4],str1[5]);\n\t\t\t\t\t\tdice[j].getd(str2[0],str2[1],str2[2],str2[3],str2[4],str2[5]);\n\t\t\t\t\t\t\n\t\t\t\t\t\t//printf(\"\\n%s %s %s %s %s %s \\n\",str1[0].c_str(),str1[1].c_str(),str1[2].c_str(),str1[3].c_str(),str1[4].c_str(),str1[5].c_str());\n\t\t\t\t\t\t//printf(\"%s %s %s %s %s %s \\n\\n\",str2[0].c_str(),str2[1].c_str(),str2[2].c_str(),str2[3].c_str(),str2[4].c_str(),str2[5].c_str());\n\n\t\t\t\t\t\tbool flag1 = true;\n\t\t\t\t\t\tFOR(d, 0, 6){\t\t\t\t\t\n\t\t\t\t\t\t\tif(str1[d] != str2[d]){\n\t\t\t\t\t\t\t\tflag1 = false;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(flag1){\n\t\t\t\t\t\t\tif(match[i] == false){\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tflag2 = true;\n\t\t\t\t\t\t\t\t//printf(\"%s %s %s %s %s %s \\n\",str1[0].c_str(),str1[1].c_str(),str1[2].c_str(),str1[3].c_str(),str1[4].c_str(),str1[5].c_str());\n\t\t\t\t\t\t\t\t//printf(\"%s %s %s %s %s %s \\n\",str2[0].c_str(),str2[1].c_str(),str2[2].c_str(),str2[3].c_str(),str2[4].c_str(),str2[5].c_str());\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmatch[j] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tflag1 = true;\n\t\t\t\t\t\n\t\t\t\t\t\tdice[i].roll(1);\n\t\t\t\t\t}\n\t\t\t\t\tdice[i].roll(0);\n\t\t\t\t}\n\t\t\t\tdice[i].roll(2);\n\t\t\t\t}\n\t\t\t\t//OUT i << \" \" << j << \" \" << flag2 E\n\t\t\t\tif(flag2){\n\t\t\t\t\tcount++;\n\t\t\t\t\t//OUT \"count++ \" << i << \" \" << j E\n\t\t\t\t}\n\t\t\t}\n\t\t}\t\n\n\t\tOUT count E\n\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3156,
"score_of_the_acc": -0.9087,
"final_rank": 14
},
{
"submission_id": "aoj_0198_1857122",
"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 1000000007\n#define EPS 1e-10\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\nstruct Dice{\n\tstring me[6];\n\t\n\tvoid Init(string a[6]){\n\t\tfor (int i = 0; i < 6; i++){\n\t\t\tme[i] = a[i];\n\t\t}\n\t}\n\n\tbool check(Dice d2){\n\t\tfor (int i = 0; i < 6; i++){\n\t\t\tif (d2.me[i] != me[i])return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tvoid print(){\n\t\tfor (int i = 0; i < 6; i++){\n\t\t\tcout << me[i] << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n};\n\nint n;\nstring a[6];\nDice d[110];\nbool F[100];\n\nint main(){\n\twhile (cin >> n&&n){\n\t\tfill(F, F + 100, 1);\n\t\tREP(i, n){\n\t\t\tREP(j, 6)cin >> a[j];\n\t\t\td[i].Init(a);\n\t\t}\n\t\tbool f = 0;\n\t\tREP(k, n){\n\t\t\tif (F[k]){\n\t\t\t\tFOR(l, k + 1, n){\n\t\t\t\t\tREP(i, 4){\n\t\t\t\t\t\tREP(j, 4){\n\t\t\t\t\t\t\tif (d[k].check(d[l]))F[l] = 0;\n\t\t\t\t\t\t\tswap(d[k].me[1], d[k].me[2]);\n\t\t\t\t\t\t\tswap(d[k].me[2], d[k].me[4]);\n\t\t\t\t\t\t\tswap(d[k].me[4], d[k].me[3]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tREP(j, 4){\n\t\t\t\t\t\t\tif (d[k].check(d[l]))F[l] = 0;\n\t\t\t\t\t\t\tswap(d[k].me[0], d[k].me[1]);\n\t\t\t\t\t\t\tswap(d[k].me[1], d[k].me[5]);\n\t\t\t\t\t\t\tswap(d[k].me[5], d[k].me[4]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tswap(d[k].me[0], d[k].me[2]);\n\t\t\t\t\t\tswap(d[k].me[2], d[k].me[5]);\n\t\t\t\t\t\tswap(d[k].me[5], d[k].me[3]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint co = 0;\n\t\tREP(i, n)if (F[i])co++;\n\t\tcout << n - co << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1228,
"score_of_the_acc": -0.0964,
"final_rank": 4
},
{
"submission_id": "aoj_0198_1856339",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nclass DICE {\npublic:\n\tstring top;\n\tstring bottom;\n\tstring left;\n\tstring right;\n\tstring front;\n\tstring back;\n\tvoid TF();\n\tvoid TB();\n\tvoid TL();\n\tvoid TR();\n\tvoid TurnL();\n\tvoid TurnR();\n\tbool HANTEI(DICE d2);\n\tbool CHECK(DICE d2);\n};\n\nvoid DICE::TF() {\n\tstring kari = front;\n\tfront = top;\n\ttop = back;\n\tback = bottom;\n\tbottom = kari;\n}\n\nvoid DICE::TB() {\n\tTF();\n\tTF();\n\tTF();\n}\n\nvoid DICE::TL() {\n\tstring kari = left;\n\tleft = top;\n\ttop = right;\n\tright = bottom;\n\tbottom = kari;\n}\n\nvoid DICE::TR() {\n\tTL();\n\tTL();\n\tTL();\n}\n\nvoid DICE::TurnL() {\n\tstring kari = left;\n\tleft = back;\n\tback = right;\n\tright = front;\n\tfront = kari;\n}\n\nvoid DICE::TurnR() {\n\tTurnL();\n\tTurnL();\n\tTurnL();\n}\n\nbool DICE::HANTEI(DICE d2) {\n\tif ((top==d2.top)&&(bottom==d2.bottom)&&(left==d2.left)&&(right==d2.right)&&(front==d2.front)&&(back==d2.back)) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool DICE::CHECK(DICE d2) {\n\tDICE d3 = d2;\n\tfor (int i = 0; i < 4; i++) {\n\t\td3.TurnL();\n\t\tif (HANTEI(d3)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\td3 = d2;\n\td3.TF();\n\td3.TF();\n\tfor (int i = 0; i < 4; i++) {\n\t\td3.TurnL();\n\t\tif (HANTEI(d3)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\td3 = d2;\n\td3.TF();\n\tfor (int i = 0; i < 4; i++) {\n\t\td3.TL();\n\t\tif (HANTEI(d3)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\td3 = d2;\n\td3.TB();\n\tfor (int i = 0; i < 4; i++) {\n\t\td3.TL();\n\t\tif (HANTEI(d3)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\td3 = d2;\n\td3.TL();\n\tfor (int i = 0; i < 4; i++) {\n\t\td3.TF();\n\t\tif (HANTEI(d3)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\td3 = d2;\n\td3.TR();\n\tfor (int i = 0; i < 4; i++) {\n\t\td3.TF();\n\t\tif (HANTEI(d3)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n\tint n;\n\twhile (cin >> n) {\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<DICE> dd;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tDICE d;\n\t\t\tcin >> d.top >> d.front >> d.right >> d.left >> d.back >> d.bottom;\n\t\t\tbool h = true;\n\t\t\tfor (int j = 0; j < dd.size(); j++) {\n\t\t\t\tif (dd[j].CHECK(d)) {\n\t\t\t\t\th = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (h) {\n\t\t\t\tdd.push_back(d);\n\t\t\t}\n\t\t}\n\t\tint sz = dd.size();\n\t\tcout << n-sz << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1240,
"score_of_the_acc": -0.0897,
"final_rank": 3
}
] |
aoj_0203_cpp
|
会津山スキー場の新企画
会津山スキー場の経営者である油木屋さんは、上級者向けとして障害物やジャンプ台を配置したコースを用意しました。コースにはいろいろな滑り方があり、シーズン中に全てのパターンの滑り方が出来た利用者には、プレゼントを贈ることになっています。
油木屋さんのために、コースの見取り図をもとに滑り方のパターン数を出力するプログラムを作ってあげましょう。
コースは上図のような
X × Y
個のマスからなるグリッドで表されます。左上を原点とし、x 座標は右に行くにつれて大きくなり、y 座標は下にいくにつれて大きくなるものとします。
各滑り方のパターンは、最も高いところ(
y = 1
、ただし障害物の無いところ) からスタートし、ゴール(
y = Y
) に向かって進んでいきます。グリッドのマス(
x, y
) にいる滑走者は、(
x − 1, y + 1
)、(
x, y + 1
)、 (
x + 1, y + 1
) のいずれかに移動することができます。マスには、障害物やジャンプ台があり、障害物のあるマスには進入できず、ジャンプ台があるマスに進入すると(
x, y + 2
) へ移動します。ただし、いちばん高いマス (
y = 1
のマス) にはジャンプ台は存在せず、ジャンプ台のあるマスに進入する際には x 座標が同じマスからしか進入できません。コースの上端(
y = 1
) からスタートし、コースからはずれることなく下端を超えれば(
y ≥ Y
) 1つの滑り方とみなし、滑り終わります。
コースの情報を入力とし、滑り方の総数を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
X
Y
c
11
c
21
...
c
X1
c
12
c
22
...
c
X2
:
c
1Y
c
2Y
...
c
XY
1 行目にコースの大きさ
X, Y
(1 ≤
X, Y
≤ 15) が与えられます。続く
Y
行にコースの情報が与えられます。
c
ij
(0 , 1 , 2 のいずれか) は
x = i, y = j
のマスの情報を表す整数で、0 が移動可能なマス、1 が障害物があるマス、2 がジャンプ台があるマスを表します。
データセットの数は 50 を超えません。
Output
入力データセットごとに、コースの滑り方のパターン数を1行に出力します。
Sample Input
5 5
0 0 0 0 1
2 1 0 2 0
1 0 0 1 1
0 2 1 2 0
0 1 0 0 0
5 5
0 0 1 0 0
2 1 0 2 0
1 0 0 1 1
0 2 1 2 0
0 1 0 0 0
15 15
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0
Output for the Sample Input
8
6
52694573
|
[
{
"submission_id": "aoj_0203_8114959",
"code_snippet": "#include <iostream>\n#include <cstring>\n#define N 15\nusing namespace std;\nint X, Y, data[N][N], memo[N][N];\nint func(int, int);\nint jump(int, int);\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n while (1) {\n cin >> X >> Y;\n if (X == 0 && Y == 0)\n break;\n memset(data, 0, sizeof(data));\n memset(memo, 0, sizeof(memo));\n for (int i = 0; i < Y; i++)\n for (int j = 0; j < X; j++)\n cin >> data[i][j];\n int cnt = 0;\n for (int i = 0; i < X; i++)\n if (data[0][i] == 0)\n cnt += func(0, i);\n cout << cnt << \"\\n\";\n }\n return 0;\n}\nint func(int y, int x) {\n if (y == Y - 1) {\n memo[Y - 1][x] = 1;\n return 1;\n }\n if(memo[y][x])\n return memo[y][x];\n if (0 <= x - 1 && data[y + 1][x - 1] == 0)\n memo[y][x] += func(y + 1, x - 1);\n if (x + 1 < X && data[y + 1][x + 1] == 0)\n memo[y][x] += func(y + 1, x + 1);\n if (data[y + 1][x] == 0)\n memo[y][x] += func(y + 1, x);\n if (data[y + 1][x] == 2) {\n int r = jump(y + 1, x);\n if (r == -2)\n memo[y][x] += 1;\n else if (r != -1)\n memo[y][x] += func(r, x);\n }\n return memo[y][x];\n}\nint jump(int y, int x) {\n while (1) {\n y += 2;\n if (data[y][x] == 1)\n break;\n if (y >= Y - 1)\n return -2;\n if (data[y][x] == 0)\n return y;\n }\n return -1;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3180,
"score_of_the_acc": -0.952,
"final_rank": 5
},
{
"submission_id": "aoj_0203_8114955",
"code_snippet": "#include <iostream>\n#include <cstring>\n#define N 15\nusing namespace std;\nint X, Y, data[N][N], memo[N][N];\nint func(int, int);\nint jump(int, int);\nint main() {\n ios_base::sync_with_stdio(false); //to optimize input/output operations\n cin.tie(NULL); //to optimize input/output operations\n while (1) {\n cin >> X >> Y;\n if (X == 0 && Y == 0)\n break;\n memset(data, 0, sizeof(data)); //to initialize 'data' array to 0\n memset(memo, 0, sizeof(memo)); //to initialize 'memo' array to 0\n for (int i = 0; i < Y; i++) {\n for (int j = 0; j < X; j++) {\n cin >> data[i][j];\n }\n }\n int cnt = 0;\n for (int i = 0; i < X; i++) {\n if (data[0][i] == 0) {\n cnt += func(0, i);\n }\n }\n cout << cnt << endl;\n }\n return 0;\n}\nint func(int y, int x) {\n if (y == Y - 1) {\n memo[Y - 1][x] = 1;\n return 1;\n }\n if (memo[y][x] != 0) {\n return memo[y][x];\n }\n int res = 0;\n if (0 <= x - 1 && data[y + 1][x - 1] == 0) {\n res += func(y + 1, x - 1);\n }\n if (x + 1 < X && data[y + 1][x + 1] == 0) {\n res += func(y + 1, x + 1);\n }\n if (data[y + 1][x] == 0) {\n res += func(y + 1, x);\n }\n if (data[y + 1][x] == 2) {\n int r = jump(y + 1, x);\n if (r == -2) {\n res += 1;\n }\n else if (r != -1) {\n res += func(r, x);\n }\n }\n memo[y][x] = res;\n return res;\n}\nint jump(int y, int x) {\n while (1) {\n y += 2;\n if (data[y][x] == 1) {\n break;\n }\n if (y >= Y - 1) {\n return -2;\n }\n if (data[y][x] == 0) {\n return y;\n }\n }\n return -1;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3216,
"score_of_the_acc": -0.9572,
"final_rank": 6
},
{
"submission_id": "aoj_0203_7054452",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nll x,y,c[17][17],s,i,j;\nvoid DFS(ll Y,ll X){\n if(c[Y][X]==1){\n return;\n }\n if(X<1 || X>x){\n return;\n }\n if(Y>=y){\n s++;\n return;\n }\n if(c[Y][X]==2){\n DFS(Y+2,X);\n }else{\n if(c[Y+1][X]!=1){\n DFS(Y+1,X);\n }\n if(c[Y+1][X+1]==0){\n DFS(Y+1,X+1);\n }\n if(c[Y+1][X-1]==0){\n DFS(Y+1,X-1);\n }\n }\n}\nint main(void){\n while(cin>>x>>y,x){\n for(s=0,i=0;i<17;i++){\n for(j=0;j<17;j++){\n c[i][j]=0;\n }\n }\n for(s=0,i=1;i<=y;i++){\n for(j=1;j<=x;j++){\n cin>>c[i][j];\n }\n }\n for(i=1;i<=x;i++){\n if(c[1][i]==0){\n DFS(1,i);\n }\n }\n cout<<s<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 450,
"memory_kb": 3308,
"score_of_the_acc": -1.3837,
"final_rank": 8
},
{
"submission_id": "aoj_0203_2161963",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint x,y,a[17][17],s,i,j;\nvoid dfs(int y1,int x1){\n if(a[y1][x1]==1)return;\n if(x1<1||x1>x)return;\n if(y1>=y){s++;return;}\n if(a[y1][x1]==2)dfs(y1+2,x1);\n else {if(a[y1+1][x1]!=1)dfs(y1+1,x1);\n if(a[y1+1][x1+1]==0)dfs(y1+1,x1+1);\n if(a[y1+1][x1-1]==0)dfs(y1+1,x1-1);}\n return;\n}\nint main(){\n while(cin>>x>>y,x){\n for(s=0,i=0;i<17;i++)for(j=0;j<17;j++)a[i][j]=0; \n for(s=0,i=1;i<=y;i++)for(j=1;j<=x;j++)cin>>a[i][j];\n for(i=1;i<=x;i++){if(a[1][i]==0)dfs(1,i);}\n cout<<s<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 700,
"memory_kb": 3080,
"score_of_the_acc": -1.5683,
"final_rank": 9
},
{
"submission_id": "aoj_0203_1803608",
"code_snippet": "#include<iostream>\nusing namespace std;\nint X,Y;\nint dp[20][20];\nchar maps[20][20];\nint bun(int x,int y);\nint dx[3]={-1,0,1};\nmain(){\n while(1){\n cin>>X>>Y;\n if(X==0&&Y==0){\n break;\n }\n for(int i=1;i<=Y;i++){\n for(int j=1;j<=X;j++){\n cin>>maps[i][j];\n dp[i][j]=0;\n }\n }\n int ans=0;\n for(int i=1;i<=X;i++){\n if(maps[1][i]!='1'){\n ans+=bun(1,i);\n }\n }\n cout<<ans<<endl;\n }\n}\nint bun(int y,int x){\n if(y>=Y){\n return 1;\n }\n else if(dp[y][x]!=0){\n return dp[y][x];\n }\n else if(maps[y][x]=='2'){\n if(maps[y+2][x]!='1'){\n return dp[y][x]=bun(y+2,x);\n }\n else{\n return 0;\n }\n }\n else if(maps[y][x]=='1'){\n return 0;\n }\n else{\n int anss=0;\n for(int i=0;i<3;i++){\n int nx=x+dx[i];\n if(i!=1){\n if(nx>0&&nx<=X&&maps[y+1][nx]=='0'){\n anss+=bun(y+1,nx);\n }\n }\n else{\n if(maps[y+1][nx]!='1'){\n anss+=bun(y+1,nx);\n }\n }\n }\n return dp[y][x]=anss;\n } \n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 1160,
"score_of_the_acc": -0.1512,
"final_rank": 2
},
{
"submission_id": "aoj_0203_1561000",
"code_snippet": "#include <iostream>\n#define N 15\nusing namespace std;\nint data[N][N];\nvoid func(int,int);\nint Cnt(int,int);\nint X,Y,cnt;\nint main(){\n while(1){\n cin >> X >> Y;\n if(X==0&&Y==0) break;\n for(int i=0;i<Y;i++)\n for(int j=0;j<X;j++)\n\tcin >> data[i][j];\n cnt=0;\n for(int i=0;i<X;i++){\n if(data[0][i]==0) func(0,i);\n }\n cout << cnt << endl;\n }\n return 0;\n}\nvoid func(int y,int x){\n if(y>=Y-1){\n cnt++;\n return;\n }\n if(y+1<Y&&x+1<X&&data[y+1][x+1]==0) func(y+1,x+1);\n if(y+1<Y&&x-1>=0&&data[y+1][x-1]==0) func(y+1,x-1);\n if(y+1<Y&&data[y+1][x]==2){\n int r=Cnt(y,x);\n if(r!=-1) func(r,x);\n else return ;\n }\n if(y+1<Y&&data[y+1][x]==0) func(y+1,x);\n}\nint Cnt(int y,int x){\n y+=3;\n while(1){\n if(y>=Y-1){\n if(y>Y-1) cnt++;\n else if(y==Y-1&&data[y][x]!=1) cnt++;\n break;\n }\n if(data[y][x]==1) break;\n if(data[y][x]==2) y+=2;\n if(data[y][x]==0) return y;\n }\n return -1;\n}",
"accuracy": 1,
"time_ms": 980,
"memory_kb": 1160,
"score_of_the_acc": -1,
"final_rank": 7
},
{
"submission_id": "aoj_0203_1373120",
"code_snippet": "#include<iostream>\nusing namespace std;\nint solve(int x,int y);\nint ax,ay;\nint mas[20][20];\nint memo[20][20];\nint main(){\n while(1){\n int ans=0;\n cin>>ax>>ay;\n if(ax==0 && ay==0) break;\n for(int i=1;i<=ay;i++){\n for(int j=1;j<=ax;j++){\n\tcin>>mas[i][j];\n\tmemo[i][j]=0;\n }\n }\n for(int i=1;i<=ax;i++){\n if(mas[1][i]!=1){\n\tans+=solve(i,1);\n }\n }\n cout<<ans<<endl;\n }\n}\nint solve(int x,int y){\n if(y>=ay){\n return 1;\n }else if(memo[y][x]!=0){\n return memo[y][x];\n }else if(mas[y][x]==2){\n if(mas[y+2][x]!=1){\n return memo[y][x]=solve(x,y+2);\n } \n else{\n return 0;\n }\n }\n else if(mas[y][x]==1){\n return 0;\n }\n else{\n int anss=0; \n if(mas[y+1][x]!=1){\n anss+=solve(x,y+1);\n }\n if(x+1<=ax && 0<x+1 && mas[y+1][x+1]==0){\n anss+=solve(x+1,y+1);\n }\n if(0<x-1 && x-1<=ax && mas[y+1][x-1]==0){\n anss+=solve(x-1,y+1);\n }\n return memo[y][x]=anss;\n }\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 1164,
"score_of_the_acc": -0.0484,
"final_rank": 1
},
{
"submission_id": "aoj_0203_1316751",
"code_snippet": "#include<iostream>\nusing namespace std;\nint X,Y;\nint dp[20][20];\nchar maps[20][20];\nint bun(int x,int y);\nint dx[3]={-1,0,1};\nmain(){\n while(1){\n cin>>X>>Y;\n if(X==0&&Y==0){\n break;\n }\n for(int i=1;i<=Y;i++){\n for(int j=1;j<=X;j++){\n\tcin>>maps[i][j];\n\tdp[i][j]=0;\n }\n }\n int ans=0;\n for(int i=1;i<=X;i++){\n if(maps[1][i]!='1'){\n\tans+=bun(1,i);\n }\n }\n cout<<ans<<endl;\n }\n}\nint bun(int y,int x){\n if(y>=Y){\n return 1;\n }\n else if(dp[y][x]!=0){\n return dp[y][x];\n }\n else if(maps[y][x]=='2'){\n if(maps[y+2][x]!='1'){\n return dp[y][x]=bun(y+2,x);\n }\n else{\n return 0;\n }\n }\n else if(maps[y][x]=='1'){\n return 0;\n }\n else{\n int anss=0;\n for(int i=0;i<3;i++){\n int nx=x+dx[i];\n if(i!=1){\n\tif(nx>0&&nx<=X&&maps[y+1][nx]=='0'){\n\t anss+=bun(y+1,nx);\n\t}\n }\n else{\n\tif(maps[y+1][nx]!='1'){\n\t anss+=bun(y+1,nx);\n\t}\n }\n }\n return dp[y][x]=anss;\n }\t \t \n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 1160,
"score_of_the_acc": -0.1628,
"final_rank": 3
},
{
"submission_id": "aoj_0203_1065511",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstring>\n\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\n\nint a[16][16];\nint count = 0;\nint n,m;\n\nvoid dfs(int y,int x)\n{\n\tif(a[y][x] == 0)\n\t{\n\n\t\tif(y == m-1)\n\t\t{\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\tif(x-1 >= 0 && y+1 < m)\n\t\t{\n\t\t\tif(a[y+1][x-1] != 2)\n\t\t\t{\n\t\t\t\tdfs(y+1,x-1);\n\t\t\t}\n\t\t}\n\t\tif(y+1 < m)\n\t\t{\n\t\t\tdfs(y+1,x);\n\t\t}\n\t\tif(x+1 < n && y+1 < m)\n\t\t{\n\t\t\tif(a[y+1][x+1] != 2)\n\t\t\t{\n\t\t\t\tdfs(y+1,x+1);\n\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n\telse if(a[y][x] == 1)\n\t{\n\t\treturn;\n\t}\n\telse if(a[y][x] == 2)\n\t{\n\t\tif(y == m-2 || y == m-1)\n\t\t{\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdfs(y+2,x);\n\t\t}\n\t}\n}\n\nint main()\n{\n\twhile(cin >> n >> m)\n\t{\n\t\tif(n == 0 && m == 0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tmemset(a,0,sizeof(a));\n\t\trep(i,m)\n\t\t{\n\t\t\trep(j,n)\n\t\t\t{\n\t\t\t\tcin >> a[i][j];\n\t\t\t}\n\t\t}\n\t\tcount = 0;\n\t\trep(i,n) dfs(0,i);\n\n\t\tcout << count << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 920,
"memory_kb": 1160,
"score_of_the_acc": -0.9302,
"final_rank": 4
}
] |
aoj_0202_cpp
|
上司のおごり
会津太郎さんの会社には、割り切れない事が大嫌いな上司がいます。太郎さんがその上司と食事に行くときは、割り勘で会計をしているのですが、支払金額が参加人数で割り切れないときは、いつも上司がおごってくれています。
ある日、太郎さんは食事会の幹事になりました。お金の少ない太郎さんは、その上司を誘ってなんとかおごってもらえるように出来ないか考えました。もう料理屋に注文をしなければならないのですが、まだ何人参加するかは分からないので、どんな人数が参加してもおごってもらえるような注文をしておきたいようです。太郎さんの同期で、同じく食事会に参加する予定のあなたは、太郎さんに協力して、予算額以下で最大のどんな人数でも割り切れない金額を算出することにしました。
料理の種類、各料理の料金、予算額を入力とし、予算額以下で最大のどんな数字でも割り切れない合計金額(ただし、 1 と合計金額は除く)を出力するプログラムを作成してください。なお、各種類の料理は複数個注文できますが、全種類の料理を注文する必要はありません。ただし、このような合計金額がない場合は、 NA と出力してください。
Input
複数のデータセットの並びが入力として与えられます。 入力の終わりはゼロふたつの行で示されます。
各データセットは以下の形式で与えられます。
n
x
v
1
v
2
:
v
n
1 行目に料理の種類
n
(1 ≤
n
≤ 30) と予算額
x
(1 ≤
x
≤ 1000000) が空白区切りで与えられます。続く
n
行に
i
種類目の料理の金額を表す整数
v
i
(1 ≤
v
i
≤ 1000000) が与えられます。
データセットの数は 100 を超えません。
Output
入力データセットごとに、予算額に最も近い合計金額、または NA を１行に出力します。
Sample Input
4 15000
305
260
129
500
3 400
10
20
30
3 200909
5
9
12
0 0
Output for the Sample Input
14983
NA
200909
|
[
{
"submission_id": "aoj_0202_9047323",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nconst int N = 10000000;\nbool f[N];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n f[0] = f[1] = true;\n for (int i = 2; i < N; i++) {\n if (f[i]) continue;\n for (int j = i + i; j < N; j += i) {\n f[j] = true;\n }\n }\n int n, x;\n while (cin >> n >> x, n) {\n vector<int> a(n);\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n }\n vector<bool> dp(x + 1, false);\n dp[0] = true;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j <= x - a[i]; j++) {\n if (dp[j]) dp[j + a[i]] = true;\n }\n }\n int res = -1;\n for (int i = x; i >= 0; i--) {\n if (dp[i] and !f[i]) {\n res = i;\n break;\n }\n }\n if (res == -1) {\n cout << \"NA\" << endl;\n } else {\n cout << res << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 13268,
"score_of_the_acc": -0.2408,
"final_rank": 17
},
{
"submission_id": "aoj_0202_8861190",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nint n, x;\nvector<int> a(30);\nvector<bool> dp(1000001), prime(1000001);\n\nvoid generate_primes() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i++) {\n if (!prime[i])\n continue;\n for (int j = i; i * j <= 1000000; j += 2)\n prime[i * j] = false;\n }\n}\n\nint main() {\n generate_primes();\n while (cin >> n >> x, n) {\n for (int i = 0; i < n; i++)\n cin >> a[i];\n sort(a.begin(), a.begin() + n);\n if (x >= dp.size()) dp.resize(x+1);\n fill(dp.begin(), dp.begin() + x + 1, false);\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n cout << (i ? to_string(i) : \"NA\") << '\\n';\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 3736,
"score_of_the_acc": -0.0352,
"final_rank": 9
},
{
"submission_id": "aoj_0202_8861183",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\nusing namespace std;\n\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\n\n// Function to calculate prime numbers\nvoid calculate_primes() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i++) {\n if (!prime[i])\n continue;\n for (int j = i; i * j <= 1000000; j += 2)\n prime[i * j] = false;\n }\n}\n\nint main() {\n calculate_primes(); // Calculate primes once\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i < x; i++)\n dp[i + 1] = false;\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 4924,
"score_of_the_acc": -0.0353,
"final_rank": 10
},
{
"submission_id": "aoj_0202_8836267",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <stdio.h>\nusing namespace std;\nint n, x, a[30];\nbitset<1000001> prime;\nbool dp[1000001];\nint main() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i++) {\n if (!prime[i])\n continue;\n for (int j = i; i * j <= 1000000; j += 2)\n prime[i * j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i < x; i++)\n dp[i + 1] = false;\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 3892,
"score_of_the_acc": -0.0268,
"final_rank": 4
},
{
"submission_id": "aoj_0202_8818733",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\n#include <string.h>\nusing namespace std;\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\nint main() {\n memset(prime, false, sizeof(prime));\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i * i <= 1000000; i += 2) {\n if (!prime[i])\n continue;\n for (int j = i * i; j <= 1000000; j += i * 2)\n prime[j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n memset(dp, false, sizeof(dp));\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (prime[i] && dp[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 4896,
"score_of_the_acc": -0.0156,
"final_rank": 1
},
{
"submission_id": "aoj_0202_8363258",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing LL = long long;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<LL>;\n\nvector<bool> GetPrimes(const int N) {\n vector<bool> is_p(N + 1, true); // 素数表\n\n is_p[0] = is_p[1] = false;\n for (int i = 2; i * i <= N; ++i) {\n if (is_p[i]) {\n for (int j = 2; i * j <= N; ++j) {\n is_p[i * j] = false;\n }\n }\n }\n return is_p;\n}\n\nint main() {\n vector<bool> p = GetPrimes(1000000);\n int n, x;\n while (true) {\n cin >> n >> x;\n if (n == 0 && x == 0) break;\n VI items(n);\n for (int i = 0; i < n; ++i) cin >> items[i];\n VVI dp(n, VI(x + 1, 0));\n for (int i = items[0]; i <= x; i += items[0]) dp[0][i] = 1;\n for (int i = 0; i < n; ++i) dp[i][0] = 1;\n for (int i = 1; i < n; ++i) {\n for (int j = 1; j <= x; ++j) {\n if (j < items[i]) {\n dp[i][j] = dp[i - 1][j];\n } else {\n dp[i][j] = (dp[i - 1][j] | dp[i][j - items[i]]);\n }\n }\n }\n bool flg = false;\n for (int i = x; i >= 2; --i) {\n if (p[i] && dp[n - 1][i]) {\n cout << i << endl;\n flg = true;\n break;\n }\n }\n if (!flg) cout << \"NA\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1750,
"memory_kb": 124008,
"score_of_the_acc": -1.7308,
"final_rank": 19
},
{
"submission_id": "aoj_0202_8363245",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing LL = long long;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<LL>;\n\nvector<bool> GetPrimes(const int N) {\n vector<bool> is_p(N + 1, true); // 素数表\n\n is_p[0] = is_p[1] = false;\n for (int i = 2; i * i <= N; ++i) {\n if (is_p[i]) {\n for (int j = 2; i * j <= N; ++j) {\n is_p[i * j] = false;\n }\n }\n }\n return is_p;\n}\n\nint main() {\n vector<bool> p = GetPrimes(1000000);\n int n, x;\n while (true) {\n cin >> n >> x;\n if (n == 0 && x == 0) break;\n VI items(n);\n for (int i = 0; i < n; ++i) cin >> items[i];\n VVI dp(n, VI(x + 1, 0));\n for (int i = items[0]; i <= x; i += items[0]) dp[0][i] = 1;\n for (int i = 0; i < n; ++i) dp[i][0] = 1;\n for (int i = 1; i < n; ++i) {\n for (int j = 1; j <= x; ++j) {\n if (j < items[i]) {\n dp[i][j] = dp[i - 1][j];\n } else {\n dp[i][j] = (dp[i - 1][j] || dp[i][j - items[i]]);\n }\n }\n }\n bool flg = false;\n for (int i = x; i >= 2; --i) {\n if (p[i] && dp[n - 1][i] == 1) {\n cout << i << endl;\n flg = true;\n break;\n }\n }\n if (!flg) cout << \"NA\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2300,
"memory_kb": 124120,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0202_8214525",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\nint main() {\n fill(prime, prime+1000001, true);\n prime[0] = prime[1] = false;\n for (int i = 2; i*i <= 1000000; i++) {\n if (prime[i]) {\n for (int j = i*i; j <= 1000000; j += i)\n prime[j] = false;\n }\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n fill(dp, dp+x+1, false);\n dp[0] = true;\n for (int i = 0; i < n; i++)\n for (int j = a[i]; j <= x; j++)\n dp[j] = dp[j] || dp[j - a[i]];\n\n int i = x;\n while (i > 0 && (!dp[i] || !prime[i])) i--;\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n }\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 4876,
"score_of_the_acc": -0.1178,
"final_rank": 15
},
{
"submission_id": "aoj_0202_8214524",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\n#define MAX_NUM 1000001\nusing namespace std;\nint n, x, a[30];\nbool dp[MAX_NUM], prime[MAX_NUM];\nint main() {\n fill_n(prime, MAX_NUM, true);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= MAX_NUM; i++) {\n if (!prime[i]) continue;\n for (int j = i * i; j <= MAX_NUM; j += i)\n prime[j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n fill_n(dp, x+1, false);\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n int i;\n for (i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(\"%d\\n\", i);\n break;\n }\n }\n if(i < 0) printf(\"NA\\n\");\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 4680,
"score_of_the_acc": -0.043,
"final_rank": 14
},
{
"submission_id": "aoj_0202_8214523",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\nvoid sieve() {\n fill(prime, prime+1000001, true);\n prime[0] = prime[1] = false;\n for (int p=2; p*p<=1000000; p++) {\n if (prime[p]) {\n for (int i=p*p; i<=1000000; i += p)\n prime[i] = false;\n }\n }\n}\nint main() {\n sieve();\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n fill(dp, dp+x+1, false);\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && a[j] <= i; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(\"%d\\n\", i);\n break;\n }\n else if (i == 0)\n printf(\"NA\\n\");\n }\n }\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 4960,
"score_of_the_acc": -0.0405,
"final_rank": 13
},
{
"submission_id": "aoj_0202_8214517",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\nint main() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i++) {\n if (!prime[i])\n continue;\n for (int j = i; i * j <= 1000000; j++)\n prime[i * j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i < x; i++)\n dp[i + 1] = false;\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 4904,
"score_of_the_acc": -0.0351,
"final_rank": 8
},
{
"submission_id": "aoj_0202_8214515",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\nint main() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i++) {\n if (!prime[i])\n continue;\n for (int j = i; i * j <= 1000000; j += 2)\n prime[i * j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i < x; i++)\n dp[i + 1] = false;\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 4756,
"score_of_the_acc": -0.029,
"final_rank": 5
},
{
"submission_id": "aoj_0202_8207224",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\nint main() {\n prime[0] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i++) {\n if (!prime[i])\n continue;\n for (int j = i; i * j <= 1000000; j += 2)\n prime[i * j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i < x; i++)\n dp[i + 1] = false;\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 4896,
"score_of_the_acc": -0.0351,
"final_rank": 7
},
{
"submission_id": "aoj_0202_8114948",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\nint main() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i += 2) { // Only check odd numbers\n if (prime[i]) {\n for (int j = i * i; j <= 1000000; j += i * 2) // Start from i^2 instead of i and increment by i * 2\n prime[j] = false;\n }\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i < x; i++)\n dp[i + 1] = false;\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n for (int j = 0; j < n && i >= a[j]; j++) {\n if (dp[i - a[j]]) {\n dp[i] = true;\n break;\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 4668,
"score_of_the_acc": -0.0332,
"final_rank": 6
},
{
"submission_id": "aoj_0202_8114947",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\n#include <bitset>\nusing namespace std;\nint n, x, a[30];\nbitset<1000001> dp, prime;\nint main() {\n prime[0] = prime[1] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i += 2) {\n if (prime[i])\n for (int j = i * i; j <= 1000000; j += i)\n prime[j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n dp.reset();\n dp[0] = true;\n for (int i = 0; i < n; i++) {\n for (int j = a[i]; j <= x; j++) {\n dp[j] = dp[j] || dp[j - a[i]];\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 810,
"memory_kb": 3012,
"score_of_the_acc": -0.2732,
"final_rank": 18
},
{
"submission_id": "aoj_0202_8114944",
"code_snippet": "#include <algorithm>\n#include <cstdio>\nusing namespace std;\nint n, x, a[30];\nbool dp[1000001], prime[1000001];\nint main() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= 1000000; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i += 2) {\n if (!prime[i])\n continue;\n for (int j = i * i; j <= 1000000; j += i << 1)\n prime[j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i <= x; i++)\n dp[i] = false;\n dp[0] = true;\n for (int i = 0; i < n; i++) {\n for (int j = a[i]; j <= x; j++) {\n dp[j] |= dp[j - a[i]];\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 4924,
"score_of_the_acc": -0.0353,
"final_rank": 10
},
{
"submission_id": "aoj_0202_8114943",
"code_snippet": "#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nconst int MAXN = 30, MAXX = 1e6 + 1;\nint n, x, a[MAXN];\nbool dp[MAXX], prime[MAXX];\nint main() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= MAXX - 1; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i += 2) {\n if (!prime[i])\n continue;\n for (int j = i; i * j <= MAXX - 1; j += 2)\n prime[i * j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i <= x; i++)\n dp[i] = false;\n dp[0] = true;\n for (int i = 1; i <= x; i++) {\n if (!dp[i]) {\n for (int j = 0; j < n && a[j] <= i; j++) {\n dp[i] |= dp[i - a[j]];\n }\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 4884,
"score_of_the_acc": -0.1228,
"final_rank": 16
},
{
"submission_id": "aoj_0202_8114940",
"code_snippet": "#include <algorithm>\n#include <cstdio>\nusing namespace std;\nconst int MAX_N = 30;\nconst int MAX_X = 1e6;\nbool dp[MAX_X + 1], prime[MAX_X + 1];\nint n, x, a[MAX_N];\nint main() {\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= MAX_X; i += 2)\n prime[i] = true;\n for (int i = 3; i * i <= MAX_X; i += 2) {\n if (!prime[i])\n continue;\n for (int j = i * i; j <= MAX_X; j += 2 * i)\n prime[j] = false;\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n for (int i = 0; i <= x; i++)\n dp[i] = false;\n dp[0] = true;\n for (int i = 0; i < n; i++) {\n for (int j = a[i]; j <= x; j++) {\n dp[j] |= dp[j - a[i]];\n }\n }\n for (int i = x; i >= 0; i--) {\n if (dp[i] && prime[i]) {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 4924,
"score_of_the_acc": -0.0353,
"final_rank": 10
},
{
"submission_id": "aoj_0202_8114939",
"code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n\nusing namespace std;\n\nconst int MAX_N = 30;\nconst int MAX_X = 1e6;\n\nint n, x, a[MAX_N];\nbool dp[MAX_X + 1], prime[MAX_X + 1];\n\nint main()\n{\n prime[0] = true, prime[2] = true;\n for (int i = 3; i <= MAX_X; i += 2)\n prime[i] = true;\n for (int i = 3; i <= 1000; i += 2)\n {\n if (!prime[i])\n continue;\n for (int j = i; i * j <= MAX_X; j += 2)\n prime[i * j] = false;\n }\n\n while (scanf(\"%d %d\", &n, &x), n)\n {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n memset(dp, false, sizeof(dp));\n dp[0] = true;\n for (int i = 0; i < n; i++)\n {\n for (int j = a[i]; j <= x; j++)\n dp[j] |= dp[j - a[i]];\n }\n for (int i = x; i >= 0; i--)\n {\n if (dp[i] && prime[i])\n {\n printf(i ? \"%d\\n\" : \"NA\\n\", i);\n break;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 4904,
"score_of_the_acc": -0.0254,
"final_rank": 3
},
{
"submission_id": "aoj_0202_8114938",
"code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\nconst int MAXN = 30;\nconst int MAXX = 1000000;\nint n, x, a[MAXN];\nbool dp[MAXX + 1], prime[MAXX + 1];\nint main() {\n memset(prime, true, sizeof(prime));\n prime[0] = false, prime[1] = false;\n for (int i = 2; i * i <= MAXX; ++i) {\n if (prime[i]) {\n for (int j = i * i; j <= MAXX; j += i)\n prime[j] = false;\n }\n }\n while (scanf(\"%d%d\", &n, &x), n) {\n for (int i = 0; i < n; ++i) scanf(\"%d\", &a[i]);\n sort(a, a + n);\n memset(dp, false, sizeof(dp));\n dp[0] = true;\n for (int i = 0; i < n; ++i) {\n for (int j = a[i]; j <= x; ++j) {\n dp[j] |= dp[j - a[i]];\n }\n }\n for (int i = x; i >= 0; --i) {\n if (dp[i] && prime[i]) {\n printf(\"%d\\n\", i);\n goto end;\n }\n }\n puts(\"NA\");\n end:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 4664,
"score_of_the_acc": -0.0234,
"final_rank": 2
}
] |
aoj_0194_cpp
|
運送会社
白虎運送は会津若松市を代表する運送会社です。昨今の原油価格の高騰は運送会社にも多大なダメージを与え、運送会社各社では、できるだけ少ないガソリンで荷物を運ぶことが課題となっています。
白虎運送では、重い荷物を積んだトラックは、その走りだしに多くのエネルギーを必要とすることに着目しました。トラックが倉庫を出発してから一度も停止することなく目的地まで到達する経路の中で最短時間の経路を通ることで、ガソリンの節約ができると考えました。
あなたの仕事は、このような最短経路を計算できるカーナビを開発することです。作成するカーナビ用プログラムの仕様は以下のとおりです。
市内は、下図のように、東西方向の道路
M
本、南北方向の道路
N
本 からなる格子で表し、格子の各交点は交差点を表します。
交差点のいくつかには東西 - 南北の方向に信号機が設置されており、一定の周期で青、赤のシグナルが点灯しています。
市内の交差点間を結ぶ道路には工事中で通過できない個所がいくつかあります。
トラックが交差点から交差点へ移動するのに必要な時間は一定ですが、渋滞している道路ではさらに長い時間がかかります。
市内の道路情報、トラックが交差点間を移動するのに必要な時間、信号機がある交差点と各信号機の周期、工事中の道路、渋滞している道路と渋滞度、白虎運送の倉庫(始点)と目的地(終点)の位置を入力とし、始点から終点までの最短の時間を出力するプログラムを作成して下さい。
図のように、東西の方向の道路はa、b、c、... と英小文字で名前が付けられ 、南北の方向の道路は 1、2、3、... と整数で名前が付けられています。市内の交差点は、これらの英小文字と整数の組み合わせ
H
-
V
で指定されます。
例えば、市内の最北西の交差点は a-1 で指定されます。各信号は周期
k
をもち、
k
分ごとに切り替わります。東西が青ならば南北が赤で、南北が青ならば東西が赤です。黄色のシグナルは存在しません。トラックは二つの交差点を結ぶ道路を移動するのに
D
分要しますが、その道路が渋滞している場合はさらに
d
分の時間を要します。トラックは道路が工事中の場合は移動できません。
また、交差点に到達した時刻に、信号が赤の場合には進入できません。トラックは交差点でのみ、東、西、南、北に方向を変えることができますが、来た方向へは移動(Uターン)できません。道路は2方通行であり、トラックが行き来する時間、工事状況、渋滞度は2方向共通です。
初期状態として、トラックは東を向いていて、トラックが倉庫を出発する瞬間すべての信号機が南北の方向に青に切り替わるものとします。また、トラックは 100分以内で目的地に到達できるものとします。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
M
N
D
ns
H
1
-
V
1
k
1
H
2
-
V
2
k
2
:
H
ns
-
V
ns
k
ns
nc
H
11
-
V
11
H
12
-
V
12
H
21
-
V
21
H
22
-
V
22
:
H
nc1
-
V
nc1
H
nc2
-
V
nc2
nj
H
11
-
V
11
H
12
-
V
12
d
1
H
21
-
V
21
H
22
-
V
22
d
2
:
H
nj1
-
V
nj1
H
nj2
-
V
nj2
d
nj
H
s
-
V
s
H
d
-
V
d
１行目に道路の本数
M
,
N
(2 ≤
M, N
≤ 20) が与えられます。２行目に、二つの交差点を結ぶ道路を移動するのに要する時間
D
(1 ≤
D
≤ D, 整数) が与えられます。
３行目に信号機の数
ns
が与えられます。続く
ns
行に、
i
個目の信号機の位置を表す英小文字と整数の組
H
i
-
V
i
と周期
k
(1 ≤
k
≤ 100) が与えられます。
続く行に、工事中の道路の数
nc
が与えられます。続く
nc
行に、
i
個目の工事中の道路の２つの端点（交差点）を表す英小文字と整数の組
H
i1
-
V
i1
H
i2
-
V
i2
が与えられます。
続く行に、渋滞道路の数
nj
が与えられます。続く
nj
行に、
i
個目の渋滞道路の２つの端点（交差点）を表す英小文字と整数の組
H
i1
-
V
i1
H
i2
-
V
i2
と時間
d
i
(1 ≤
d
i
≤ 100) が与えられます。
最後の行に、始点の交差点
H
s
-
V
d
と終点の交差点
H
d
-
V
d
が与えられます。
データセットの数は 20 を超えません。
Output
データセット毎に最短時間を１行に出力します。
Sample Input
4 5
1
3
b-2 3
c-3 2
c-4 1
3
a-2 b-2
b-3 c-3
d-3 d-4
2
b-3 b-4 1
c-1 d-1 1
d-1 b-4
4 5
1
3
b-2 3
c-3 2
c-4 1
3
a-2 b-2
b-3 c-3
d-3 d-4
2
b-3 b-4 1
c-1 d-1 1
d-2 b-4
4 5
1
3
b-2 3
c-3 2
c-4 1
3
a-2 b-2
b-3 c-3
d-3 d-4
2
b-3 b-4 1
c-1 d-1 1
d-3 b-4
0 0
Output for the Sample Input
7
4
8
|
[
{
"submission_id": "aoj_0194_6971954",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;\n\nvoid debug(vector<vector<int>> A){\n for(int y = 0; y < A.size(); y++){\n for(int x = 0; x < A[y].size(); x++){\n cerr << A[y][x] << (x + 1 == A[y].size() ? '\\n' : ' ');\n }\n }\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int h, w;\n vector<pair<int,int>> dir = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\n while(cin >> h >> w, h){\n auto f = [&](string s){\n return make_pair(s[0] - 'a', stoi(s.substr(2, s.size() - 2)) - 1);\n };\n int D, ns, nc, nj, y, x, y1, x1, y2, x2, v, sy, sx, gy, gx, ds, is, d, dy, dx, ans = 1 << 30;\n string s, t;\n cin >> D >> ns;\n //信号機と周期\n //時刻tに対して t mod 2 * S[y][x] < S[y][x]のとき南北方向\n //そうでないとき東西方向\n vector<vector<int>> S(h, vector<int>(w));\n vector<vector<vector<vector<int>>>> K(h, vector<vector<vector<int>>>(w, \n vector<vector<int>>(h, vector<int>(w))));\n vector<vector<vector<vector<int>>>> J(h, vector<vector<vector<int>>>(w, \n vector<vector<int>>(h, vector<int>(w))));\n for(int i = 0; i < ns; i++){\n cin >> s >> v;\n tie(y, x) = f(s);\n S[y][x] = v;\n }\n cin >> nc;\n for(int i = 0; i < nc; i++){\n cin >> s >> t;\n tie(y1, x1) = f(s);\n tie(y2, x2) = f(t);\n K[y1][x1][y2][x2] = K[y2][x2][y1][x1] = 1;\n }\n cin >> nj;\n for(int i = 0; i < nj; i++){\n cin >> s >> t >> v;\n tie(y1, x1) = f(s);\n tie(y2, x2) = f(t);\n J[y1][x1][y2][x2] = J[y2][x2][y1][x1] = v;\n }\n cin >> s >> t;\n tie(sy, sx) = f(s);\n tie(gy, gx) = f(t);\n\n //交差点に入る :0~3\n //交差点から出る:4~7\n //0, 2:東西方向\n //1, 3:南北方向\n vector<vector<vector<vector<bool>>>> dp(101,\n vector<vector<vector<bool>>>(8, \n vector<vector<bool>>(h, \n vector<bool>(w))));\n dp[0][0][sy][sx] = true;\n for(int i = 0; i <= 100; i++){\n for(int j = 0; j < 8; j++){\n if(j & 4){\n tie(dy, dx) = dir[j - 4];\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n if(!dp[i][j][y][x])continue;\n if(y + dy < 0 || x + dx < 0 || y + dy >= h || x + dx >= w)continue;\n if(K[y][x][y + dy][x + dx])continue;\n int nt = i + D + J[y][x][y + dy][x + dx];\n if(nt > 100)continue;\n dp[nt][j - 4][y + dy][x + dx] = true;\n }\n }\n }else{\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n if(!dp[i][j][y][x])continue;\n if(S[y][x]){\n if(j & 1){\n if(i % (2 * S[y][x]) >= S[y][x])continue;\n }else{\n if(i % (2 * S[y][x]) < S[y][x])continue;\n }\n }\n for(int k = 0; k < 4; k++){\n if(abs(j - k) == 2)continue;\n dp[i][k + 4][y][x] = true;\n }\n }\n }\n }\n }\n }\n for(int i = 0; i <= 100; i++){\n for(int j = 0; j < 8; j++){\n if(dp[i][j][gy][gx])ans = min(ans, i);\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6500,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_0194_4902504",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<map>\n#include<algorithm>\nusing namespace std;\nint H,W,D;\nint rd()\n{\n\tchar c;cin>>c;\n\tint ret=(c-'a')*W;\n\tcin>>c;\n\tint y;cin>>y;\n\treturn ret+y-1;\n}\nint k[400];\nbool vis[400][101][4];\nint dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};\nmain()\n{\n\twhile(cin>>H>>W,H)\n\t{\n\t\tcin>>D;\n\t\t{\n\t\t\tfor(int i=0;i<H*W;i++)k[i]=0;\n\t\t\tint ns;\n\t\t\tcin>>ns;\n\t\t\tfor(;ns--;)\n\t\t\t{\n\t\t\t\tint id=rd();\n\t\t\t\tcin>>k[id];\n\t\t\t}\n\t\t}\n\t\tmap<pair<int,int>,int>d;\n\t\t{\n\t\t\tint nc;cin>>nc;\n\t\t\tfor(;nc--;)\n\t\t\t{\n\t\t\t\tint x,y;\n\t\t\t\tx=rd();\n\t\t\t\ty=rd();\n\t\t\t\tpair<int,int>p=minmax(x,y);\n\t\t\t\td[p]=-1;\n\t\t\t}\n\t\t}\n\t\t{\n\t\t\tint nj;cin>>nj;\n\t\t\tfor(;nj--;)\n\t\t\t{\n\t\t\t\tint x,y;\n\t\t\t\tx=rd();\n\t\t\t\ty=rd();\n\t\t\t\tpair<int,int>p=minmax(x,y);\n\t\t\t\tcin>>d[p];\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<H*W;i++)for(int k=0;k<=100;k++)for(int j=0;j<4;j++)vis[i][k][j]=false;\n\t\tint start,goal;\n\t\tstart=rd();goal=rd();\n\t\tqueue<pair<int,pair<int,int> > >P;\n\t\tP.push(make_pair(0,make_pair(start,2)));\n\t\tvis[start][0][2]=true;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tint cost=P.front().first;\n\t\t\tint now=P.front().second.first,dir=P.front().second.second;\n\t\t\tP.pop();\n\t\t\tint nx=now/W,ny=now%W;\n\t\t\tfor(int r=0;r<4;r++)if(dir!=(r^1))\n\t\t\t{\n\t\t\t\tint tx=nx+dx[r],ty=ny+dy[r];\n\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\tint nxt=tx*W+ty;\n\t\t\t\tpair<int,int>p=minmax(now,nxt);\n\t\t\t\tif(d[p]<0)continue;\n\t\t\t\tint nc=cost+D+d[p];\n\t\t\t\tif(k[nxt]>0)\n\t\t\t\t{\n\t\t\t\t\tint wi=nc%(2*k[nxt])/k[nxt];\n\t\t\t\t\tif(wi==0&&r>=2||wi==1&&r<2)continue;\n\t\t\t\t}\n\t\t\t\tif(nc<=100&&!vis[nxt][nc][r])\n\t\t\t\t{\n\t\t\t\t\tvis[nxt][nc][r]=true;\n\t\t\t\t\tP.push(make_pair(nc,make_pair(nxt,r)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans=1e9;\n\t\tfor(int k=0;k<=100;k++)for(int r=0;r<4;r++)if(vis[goal][k][r])ans=min(ans,k);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3276,
"score_of_the_acc": -0.5318,
"final_rank": 15
},
{
"submission_id": "aoj_0194_4451315",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nvoid solve(int n, int m){\n int d, ns;\n cin >> d >> ns;\n map<int, int> kousaten;\n map<pair<int, int>, int> G;\n for (int i = 0; i < ns; ++i) {\n char a; int b, k;\n scanf(\" %c-%d %d\", &a, &b, &k);\n kousaten[(a-'a'+1)*m+b] = k;\n }\n int nc;\n cin >> nc;\n for (int i = 0; i < nc; ++i) {\n char a, aa; int b, bb;\n scanf(\" %c-%d %c-%d\", &a, &b, &aa, &bb);\n G[{(a-'a'+1)*m+b, (aa-'a'+1)*m+bb}] = 200;\n G[{(aa-'a'+1)*m+bb, (a-'a'+1)*m+b}] = 200;\n }\n int nj;\n cin >> nj;\n for (int i = 0; i < nj; ++i) {\n char a, aa; int b, bb, D;\n scanf(\" %c-%d %c-%d %d\", &a, &b, &aa, &bb, &D);\n G[{(a-'a'+1)*m+b, (aa-'a'+1)*m+bb}] = d+D;\n G[{(aa-'a'+1)*m+bb, (a-'a'+1)*m+b}] = d+D;\n }\n int sy, sx, gy, gx;\n {\n char a, aa; int b, bb;\n scanf(\" %c-%d %c-%d\", &a, &b, &aa, &bb);\n sy = a-'a'+1, sx = b, gy = aa-'a'+1, gx = bb;\n }\n auto v = make_v(n+2, m+2, 0);\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n v[i+1][j+1] = 1;\n }\n }\n array<int, 4> dy{-1, 1, 0, 0}, dx{0, 0, -1, 1};\n auto dp = make_v(n+2, m+2, 101, 4, 0);\n auto dfs = [&](int y, int x, int t, int kk, auto &&f) -> void {\n for (int k = 0; k < 4; ++k) {\n int yy = y+dy[k], xx = x+dx[k];\n if(!v[yy][xx] || k == (kk^1)) continue;\n\n if(kousaten.count(yy*m+xx)){\n int K = kousaten[yy*m+xx];\n int D = G.count({y*m+x, yy*m+xx}) ? G[{y*m+x, yy*m+xx}] : d;\n if(t+D <= 100 && !dp[yy][xx][t+D][kk] && !(((t+D)%(2*K) < K)^(k < 2))){\n dp[yy][xx][t+D][kk] = 1;\n f(yy, xx, t+D, k, f);\n }\n }else {\n int D = G.count({y*m+x, yy*m+xx}) ? G[{y*m+x, yy*m+xx}] : d;\n if(t+D <= 100 && !dp[yy][xx][t+D][kk]){\n dp[yy][xx][t+D][kk] = 1;\n f(yy, xx, t+D, k, f);\n }\n }\n\n }\n };\n dp[sy][sx][0][3] = 1;\n dfs(sy, sx, 0, 3, dfs);\n for (int i = 0; i <= 100; ++i) {\n for (int k = 0; k < 4; ++k) {\n if(dp[gy][gx][i][k]){\n cout << i << \"\\n\";\n return;\n }\n }\n }\n}\n\nint main() {\n int n, m;\n while(cin >> n >> m, n){\n solve(n, m);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6056,
"score_of_the_acc": -0.9317,
"final_rank": 17
},
{
"submission_id": "aoj_0194_2094948",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <queue>\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<int, P> PP;\ntypedef pair<int, PP> PPP;\ntypedef pair<int, PPP> E;\ntypedef priority_queue<E, vector<E>, greater<E> > Q;\n\nint M, N, D;\nint sr, sc;\nint gr, gc;\nint cost_c[19][20];\nint cost_r[20][19];\nint signal[20][20];\nbool used[101][4][20][20];\nconst int INF = 10000000;\n\nbool input() {\n scanf(\"%d %d\\n\", &M, &N);\n if (!M && !N) {\n return false;\n }\n scanf(\"%d\\n\", &D);\n for (int i = 0; i < M - 1; ++i) {\n for (int j = 0; j < N; ++j) {\n cost_c[i][j] = D;\n }\n }\n for (int i = 0; i < M; ++i) {\n for (int j = 0; j < N - 1; ++j) {\n cost_r[i][j] = D;\n }\n }\n for (int i = 0; i < M; ++i) {\n for (int j = 0; j < N; ++j) {\n signal[i][j] = -1;\n }\n }\n int ns;\n scanf(\"%d\\n\", &ns);\n for (int i = 0; i < ns; ++i) {\n char a;\n int r, c, k;\n scanf(\"%c-%d %d\\n\", &a, &c, &k);\n r = a - 'a';\n --c;\n signal[r][c] = k;\n }\n int nc;\n scanf(\"%d\\n\", &nc);\n for (int i = 0; i < nc; ++i) {\n char a1, a2;\n int r1, c1, r2, c2;\n scanf(\"%c-%d %c-%d\\n\", &a1, &c1, &a2, &c2);\n r1 = a1 - 'a';\n r2 = a2 - 'a';\n --c1;\n --c2;\n if (r1 == r2) {\n cost_r[r1][min(c1, c2)] = INF;\n } else if (c1 == c2) {\n cost_c[min(r1, r2)][c1] = INF;\n }\n }\n int nj;\n scanf(\"%d\\n\", &nj);\n for (int i = 0; i < nj; ++i) {\n char a1, a2;\n int r1, c1, r2, c2, d;\n scanf(\"%c-%d %c-%d %d\\n\", &a1, &c1, &a2, &c2, &d);\n r1 = a1 - 'a';\n r2 = a2 - 'a';\n --c1;\n --c2;\n if (r1 == r2) {\n cost_r[r1][min(c1, c2)] += d;\n } else if (c1 == c2) {\n cost_c[min(r1, r2)][c1] += d;\n }\n }\n {\n char c;\n scanf(\"%c-%d\\n\", &c, &sc);\n sr = c - 'a';\n --sc;\n }\n {\n char c;\n scanf(\"%c-%d\\n\", &c, &gc);\n gr = c - 'a';\n --gc;\n }\n for (int t = 0; t <= 100; ++t) {\n for (int d = 0; d < 4; ++d) {\n for (int i = 0; i < M; ++i) {\n for (int j = 0; j < N; ++j) {\n used[t][d][i][j] = false;\n }\n }\n }\n }\n return true;\n}\n\nbool can_go(int t, int k, bool row) {\n int h = t / k;\n if (row) {\n return h & 1;\n } else {\n return !(h & 1);\n }\n}\n\nint solve() {\n PP s = PP(0, P(sr, sc));\n int h0 = (abs(sr - gr) + abs(sc - gc)) * D;\n Q q;\n q.push(E(h0, PPP(0, s)));\n int ans = -1;\n while (!q.empty()) {\n E cur = q.top();\n q.pop();\n PPP ppp = cur.second;\n int t = ppp.first;\n PP pp = ppp.second;\n int d = pp.first;\n P p = pp.second;\n int r = p.first;\n int c = p.second;\n if (r == gr && c == gc) {\n ans = t;\n break;\n }\n if (used[t][d][r][c]) {\n continue;\n }\n used[t][d][r][c] = true;\n if (r > 0 && d != 2) {\n int nt = t + cost_c[r - 1][c];\n if (nt < INF && (signal[r - 1][c] < 0 || can_go(nt, signal[r - 1][c], false))) {\n int h = (abs(r - 1 - gr) + abs(c - gc)) * D;\n q.push(E(nt + h, PPP(nt, PP(3, P(r - 1, c)))));\n }\n }\n if (r < M - 1 && d != 3) {\n int nt = t + cost_c[r][c];\n if (nt < INF && (signal[r + 1][c] < 0 || can_go(nt, signal[r + 1][c], false))) {\n int h = (abs(r + 1 - gr) + abs(c - gc)) * D;\n q.push(E(nt + h, PPP(nt, PP(2, P(r + 1, c)))));\n }\n }\n if (c > 0 && d != 0) {\n int nt = t + cost_r[r][c - 1];\n if (nt < INF && (signal[r][c - 1] < 0 || can_go(nt, signal[r][c - 1], true))) {\n int h = (abs(r - gr) + abs(c - 1 - gc)) * D;\n q.push(E(nt + h, PPP(nt, PP(1, P(r, c - 1)))));\n }\n }\n if (c < N - 1 && d != 1) {\n int nt = t + cost_r[r][c];\n if (nt < INF && (signal[r][c + 1] < 0 || can_go(nt, signal[r][c + 1], true))) {\n int h = (abs(r - gr) + abs(c + 1 - gc)) * D;\n q.push(E(nt + h, PPP(nt, PP(0, P(r, c + 1)))));\n }\n }\n }\n return ans;\n}\n\nint main() {\n while (input()) {\n int ans = solve();\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2852,
"score_of_the_acc": -0.4388,
"final_rank": 12
},
{
"submission_id": "aoj_0194_1378568",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int dx[] = {-1, 0, 1, 0};\nconst int dy[] = {0, -1, 0, 1};\nconst int INF = 1 << 28;\ninline pair<int, int> inputPos(){\n\tstring str;\n\tcin >> str;\n\treturn pair<int, int>(str[0] - 'a', atoi(str.c_str() + 2) - 1);\n}\n\nint m, n;\nint D;\nint sign[20][20];\nint cant[20][20][20][20];\nint cst[20][20][20][20];\npair<int, int> sp, gp;\n\nbool ok(int x, int y){\n\treturn x >= 0 && x < m && y >= 0 && y < n;\n}\n\nvoid solve()\n{\n\tstatic int dist[101][20][20][4];\n\tfill_n(***dist, 101 * 20 * 20 * 4, INF);\n\tdist[0][sp.first][sp.second][3] = 0;\n\tfor (int t = 0; t < 100; t++){\n\t\tfor (int x = 0; x < m; x++){\n\t\t\tfor (int y = 0; y < n; y++){\n\t\t\t\tfor (int d = 0; d < 4; d++){\n\t\t\t\t\tif (dist[t][x][y][d] == INF) continue;\n\t\t\t\t\tfor (int dd = 3; dd <= 5; dd++){\n\t\t\t\t\t\tint dir = (d + dd) % 4;\n\t\t\t\t\t\tint nx = x + dx[dir];\n\t\t\t\t\t\tint ny = y + dy[dir];\n\t\t\t\t\t\tif (!ok(nx, ny)) continue;\n\t\t\t\t\t\tif (cant[x][y][nx][ny]) continue;\n\t\t\t\t\t\tint nt = t + D + cst[x][y][nx][ny];\n\t\t\t\t\t\tif (nt > 100) continue;\n\t\t\t\t\t\tif (sign[nx][ny]){\n\t\t\t\t\t\t\tif ((nt / sign[nx][ny] + dir) % 2 == 1){\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdist[nt][nx][ny][dir] = min(dist[nt][nx][ny][dir], nt);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tfor (int t = 0; ; t++){\n\t\tfor (int d = 0; d < 4; d++){\n\t\t\tif (dist[t][gp.first][gp.second][d] < INF){\n\t\t\t\tprintf(\"%d\\n\", dist[t][gp.first][gp.second][d]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main()\n{\n\twhile (scanf(\"%d %d\", &m, &n), m){\n\t\tmemset(sign, 0, sizeof(sign));\n\t\tmemset(cant, 0, sizeof(cant));\n\t\tmemset(cst, 0, sizeof(cst));\n\t\t\n\t\tscanf(\"%d\", &D);\n\t\t\n\t\tint ns;\n\t\tscanf(\"%d\", &ns);\n\t\tfor (int i = 0; i < ns; i++){\n\t\t\tpair<int, int> pos = inputPos();\n\t\t\tint k;\n\t\t\tscanf(\"%d\", &k);\n\t\t\tsign[pos.first][pos.second] = k;\n\t\t}\n\t\t\n\t\tint nc;\n\t\tscanf(\"%d\", &nc);\n\t\tfor (int i = 0; i < nc; i++){\n\t\t\tpair<int, int> pos1 = inputPos();\n\t\t\tpair<int, int> pos2 = inputPos();\n\t\t\tcant[pos1.first][pos1.second][pos2.first][pos2.second] = true;\n\t\t\tcant[pos2.first][pos2.second][pos1.first][pos1.second] = true;\n\t\t}\n\t\t\n\t\tint nj;\n\t\tscanf(\"%d\", &nj);\n\t\tfor (int i = 0; i < nj; i++){\n\t\t\tpair<int, int> pos1 = inputPos();\n\t\t\tpair<int, int> pos2 = inputPos();\n\t\t\tint d;\n\t\t\tscanf(\"%d\", &d);\n\t\t\tcst[pos1.first][pos1.second][pos2.first][pos2.second] += d;\n\t\t\tcst[pos2.first][pos2.second][pos1.first][pos1.second] += d;\n\t\t}\n\t\t\n\t\tsp = inputPos();\n\t\tgp = inputPos();\n\t\t\n\t\tsolve();\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3104,
"score_of_the_acc": -0.4775,
"final_rank": 13
},
{
"submission_id": "aoj_0194_1170572",
"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 cur, dir, time;\n bool operator < ( const Data &data ) const {\n if( time != data.time ) return time > data.time;\n if( dir != data.dir ) return dir > data.dir;\n return cur > data.cur;\n }\n};\n\nint w,h,D,sp,ep;\nint field[30][30];\nmap<ii,int> coef;\nset<ii> S;\nvector<int> wigwag;\nbool visited[500][110][4];\nint dx[] = {0,1,0,-1};\nint dy[] = {1,0,-1,0};\n\nbool isValid(int x,int y) { return 0 <= x && x < w && 0 <= y && y < h; }\n\nint getPoint(string s){\n rep(i,s.size()) if( s[i] == '-' ) { s[i] = ' '; break; }\n stringstream ss;\n ss << s;\n string temp[2];\n ss >> temp[0] >> temp[1];\n int x = (atoi)(temp[1].c_str());\n int y = temp[0][0] - 'a';\n --x;\n return x + y * w;\n}\n\nvoid compute(){\n rep(i,h*w) rep(j,110) rep(k,4) visited[i][j][k] = false;\n visited[sp][0][1] = true;\n priority_queue<Data> Q;\n Q.push((Data){sp,1,0});\n while( !Q.empty() ){\n Data data = Q.top(); Q.pop();\n if( data.cur == ep ) { cout << data.time << endl; return; }\n rep(i,4) if( (data.dir+2)%4 != i ){\n int nx = data.cur % w + dx[i], ny = data.cur / w + dy[i];\n int next = nx + ny * w;\n if( !isValid(nx,ny) ) continue;\n ii coor = ii(data.cur,next);\n if( coor.first > coor.second ) swap(coor.first,coor.second);\n if( S.count(coor) ) continue;\n int ntime = data.time + D + coef[coor];\n if( ntime > 100 ) continue;\n\n if( field[ny][nx] != -1 ) {\n bool failed = false;\n int cycle = wigwag[field[ny][nx]];\n int now = ntime / cycle;\n //cout << nx << \",\" << ny << \" \" << cycle << \" and \" << now << \" ndir = \" << i<< endl;\n if( now & 1 ) {\n if( i == 0 || i == 2 ) failed = true;\n } else {\n if( i == 1 || i == 3 ) failed = true;\n }\n if( failed ) continue;\n }\n \n if( !visited[next][ntime][i] ){\n //cout << coor.first << \" < \" << coor.second << endl;\n //cout << ntime << \" : (\" << data.cur % w << \",\" << data.cur / w << \") \" << data.dir << \" => (\" << nx << \",\" << ny << \") dir = \" << i << endl; \n visited[next][ntime][i] = true;\n Q.push((Data){next,i,ntime});\n }\n \n }\n }\n}\n\nint main(){\n while( cin >> h >> w, w|h ){\n cin >> D;\n rep(i,h) rep(j,w) field[i][j] = -1;\n wigwag.clear();\n int temp;\n cin >> temp;\n wigwag.resize(temp);\n rep(i,temp) {\n string s;\n int k;\n cin >> s >> k;\n rep(j,s.size()) if( s[j] == '-' ) { s[j] = ' '; break; }\n stringstream ss;\n ss << s;\n string stemp[2];\n ss >> stemp[0] >> stemp[1];\n int x = (atoi)(stemp[1].c_str());\n int y = stemp[0][0] - 'a';\n --x;\n field[y][x] = wigwag.size();\n wigwag.push_back(k);\n }\n \n S.clear();\n cin >> temp;\n rep(i,temp){\n string s,s2;\n cin >> s >> s2;\n int p1 = getPoint(s), p2 = getPoint(s2);\n if( p1 > p2 ) swap(p1,p2);\n S.insert(ii(p1,p2));\n }\n\n coef.clear();\n cin >> temp;\n rep(i,temp){\n string s,s2;\n int itemp;\n cin >> s >> s2 >> itemp;\n int p1 = getPoint(s), p2 = getPoint(s2);\n if( p1 > p2 ) swap(p1,p2);\n coef[ii(p1,p2)] = itemp;\n }\n\n string ssp,sep;\n cin >> ssp >> sep;\n sp = getPoint(ssp);\n ep = getPoint(sep);\n\n compute();\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1516,
"score_of_the_acc": -0.2471,
"final_rank": 6
},
{
"submission_id": "aoj_0194_1104517",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <algorithm>\n#include <string>\n#include <utility>\n#include <cstdio>\nusing namespace std;\n\n// inputs\nint N, M;\nint D;\nint ns, nc, nj;\n\nconst int margin = 2;\nbool visited[32][32][128][4];\nint map[64][64];\n\nstruct status {\n\tint x, y;\n\tint t;\n\tint d;\n\tstatus() {}\n\tstatus(int x_, int y_, int t_, int d_) {\n\t\tx = x_; y = y_; t = t_; d = d_;\n\t}\n\tbool operator<(const status obj) const {\n\t\treturn this->t > obj.t;\n\t}\n};\n\nint dx[] = {-1, 1, 0, 0};\nint dy[] = {0, 0, -1, 1};\n\nint gcd(int a, int b) {\n\treturn a % b == 0 ? b : gcd(b, a % b);\n}\nint lcm(int a, int b) {\n\treturn a * b / gcd(a, b);\n}\n\npair<int,int> to_coord(string s) {\n\tstring tmp(s.begin() + 2, s.end());\n\tint x = 0;\n\tfor(int i = 0; i < tmp.size(); i++) {\n\t\tx *= 10;\n\t\tx += tmp[i] - '0';\n\t}\n\treturn pair<int,int>(x - 1, s[0] - 'a');\n}\n\nint main() {\n\twhile(cin >> M >> N, M || N) {\n\t\tcin >> D;\n\t\tfor(int i = 0; i < 64; i++)\n\t\t\tfor(int j = 0; j < 64; j++)\n\t\t\t\tmap[i][j] = -1;\n\t\tfor(int i = 0; i < M; i++) {\n\t\t\tfor(int j = 0; j < N; j++) {\n\t\t\t\tmap[i*2 + margin][j%(N-1)*2+1 + margin] = D;\n\t\t\t\tmap[i%(M-1)*2+1 + margin][j*2 + margin] = D;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < 32; i++)\n\t\t\tfor(int j = 0; j < 32; j++)\n\t\t\t\tfor(int k = 0; k < 128; k++)\n\t\t\t\t\tfor(int l = 0; l < 4; l++)\n\t\t\t\t\t\tvisited[i][j][k][l] = false;\n\t\tcin >> ns;\n\t\tfor(int i = 0; i < ns; i++) {\n\t\t\tstring tmp;\n\t\t\tint k;\n\t\t\tpair<int,int> coord;\n\t\t\tcin >> tmp >> k;\n\t\t\tcoord = to_coord(tmp);\n\t\t\tmap[coord.second * 2 + margin][coord.first * 2 + margin] = k;\n\t\t}\n\t\tcin >> nc;\n\t\tfor(int i = 0; i < nc; i++) {\n\t\t\tstring tmp0, tmp1;\n\t\t\tpair<int,int> coord0, coord1;\n\t\t\tcin >> tmp0 >> tmp1;\n\t\t\tcoord0 = to_coord(tmp0);\n\t\t\tcoord1 = to_coord(tmp1);\n\t\t\tmap[coord0.second + coord1.second + margin][coord0.first + coord1.first + margin] = -1;\n\t\t}\n\t\tcin >> nj;\n\t\tfor(int i = 0; i < nj; i++) {\n\t\t\tstring tmp0, tmp1;\n\t\t\tint d;\n\t\t\tpair<int,int> coord0, coord1;\n\t\t\tcin >> tmp0 >> tmp1 >> d;\n\t\t\tcoord0 = to_coord(tmp0);\n\t\t\tcoord1 = to_coord(tmp1);\n\t\t\tmap[coord0.second + coord1.second + margin][coord0.first + coord1.first + margin] = D + d;\n\t\t}\n\n\t\t/*\n\t\tfor(int i = 0; i < 32; i++) {\n\t\t\tfor(int j = 0; j < 32; j++) {\n\t\t\t\tif(map[i][j] < 0)\n\t\t\t\t\tprintf(\" x\");\n\t\t\t\telse\n\t\t\t\t\tprintf(\"% 2d\", map[i][j]);\n\t\t\t}\n\t\t\tputchar('\\n');\n\t\t}\n\t\t// */\n\n\t\tstring start_str, goal_str;\n\t\tpair<int,int> start, goal;\n\t\tcin >> start_str >> goal_str;\n\t\tstart = to_coord(start_str);\n\t\tgoal = to_coord(goal_str);\n\n\t\t// dijkstra\n\t\tpriority_queue<status> q;\n\t\tq.push(status(start.first, start.second, 0, 1));\n\t\tvisited[start.second][start.first][0][1] = true;\n\n\t\twhile(!q.empty()) {\n\t\t\tstatus cur;\n\t\t\tcur = q.top(); q.pop();\n\t\t//\tcout << cur.x << \" \" << cur.y << \" \" << cur.t << endl;\n\t\t\tif(cur.x == goal.first && cur.y == goal.second) {\n\t\t\t\tcout << cur.t << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < 4; i++) {\n\t\t\t\tbool flg = true;\n\t\t\t\tflg &= !(map[cur.y * 2 + dy[i] + margin][cur.x * 2 + dx[i] + margin] < 0);\n\t\t\t\tflg &= !visited[cur.y + dy[i]][cur.x + dx[i]][cur.t + map[cur.y * 2 + dy[i] + margin][cur.x* 2 + dx[i] + margin]][i];\n\t\t\t\tflg &= dx[i]*dx[cur.d] + dy[i]*dy[cur.d] >= 0;\n\t\t\t\tflg &= (map[(cur.y + dy[i]) * 2 + margin][(cur.x + dx[i]) * 2 + margin] < 0)\n\t\t\t\t\t|| (((cur.t + map[cur.y * 2 + dy[i] + margin][cur.x * 2 + dx[i] + margin]) / map[(cur.y + dy[i]) * 2 + margin][(cur.x + dx[i]) * 2 + margin]) % 2\n\t\t\t\t\t\t\t== !(i / 2));\n\t\t\t\tif(flg) {\n\t\t\t\t\tq.push(status(cur.x + dx[i], cur.y + dy[i], cur.t + map[cur.y * 2 + dy[i] + margin][cur.x * 2 + dx[i] + margin], i));\n\t\t\t\t\tvisited[cur.y + dy[i]][cur.x + dx[i]][cur.t + map[cur.y * 2 + dy[i] + margin][cur.x * 2 + dx[i] + margin]][i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1800,
"score_of_the_acc": -0.2769,
"final_rank": 7
},
{
"submission_id": "aoj_0194_1021589",
"code_snippet": "#include<iostream>\n#include<tuple>\n#include<set>\n\nusing namespace std;\n\nint main(){\n for(int M,N;cin>>M>>N,M;){\n int D,ns;\n cin>>D>>ns;\n int k[21][21]={};\n for(int i=0;i<ns;i++){\n char H,d;\n int V;\n cin>>H>>d>>V;\n cin>>k[H-'a'][V];\n }\n int nc;\n cin>>nc;\n bool uc[21][21][21][21]={};\n while(nc--){\n char H1,d1,H2,d2;\n int V1,V2;\n cin>>H1>>d1>>V1>>H2>>d2>>V2;\n uc[H1-'a'][V1][H2-'a'][V2]=uc[H2-'a'][V2][H1-'a'][V1]=true;\n }\n int nj;\n cin>>nj;\n int jam[21][21][21][21]={};\n while(nj--){\n char H1,d1,H2,d2;\n int V1,V2,d;\n cin>>H1>>d1>>V1>>H2>>d2>>V2>>d;\n jam[H1-'a'][V1][H2-'a'][V2]=jam[H2-'a'][V2][H1-'a'][V1]=d;\n }\n char H1,d1,H2,d2;\n int V1,V2;\n cin>>H1>>d1>>V1>>H2>>d2>>V2;\n set<tuple<int,int,int,int> > s;\n s.insert(make_tuple(0,H1-'a',V1,1));\n for(auto e:s){\n if(get<1>(e)==H2-'a'&&get<2>(e)==V2){\n\tcout<<get<0>(e)<<endl;\n\tbreak;\n }\n for(int i=1;i<=3;i++){\n\tint nd=(get<3>(e)+i+2)%4;\n\tstatic int dy[]={-1,0,1,0};\n\tstatic int dx[]={0,1,0,-1};\n\tint sy=get<1>(e);\n\tint sx=get<2>(e);\n\tint ny=sy+dy[nd];\n\tint nx=sx+dx[nd];\n\tif(ny<0||M<=ny||nx<1||N<nx||uc[sy][sx][ny][nx])continue;\n\tint nt=get<0>(e)+D+jam[sy][sx][ny][nx];\n\tif(k[ny][nx]&&nt%(2*k[ny][nx])<k[ny][nx]==nd%2)continue;\n\ts.insert(make_tuple(nt,ny,nx,nd));\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 6060,
"score_of_the_acc": -0.9462,
"final_rank": 18
},
{
"submission_id": "aoj_0194_1013713",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<tuple>\n#include<functional>\n#include<map>\n#include<set>\nusing namespace std;\n\nenum Direction {NORTH, EAST, SOUTH, WEST};\nint dy[4] = {-1, 0, 1, 0};\nint dx[4] = {0, 1, 0, -1};\nenum {RED, BLUE};\n\nclass Point {\n int y_value, x_value;\npublic:\n Point() {}\n Point(int y, int x) :y_value(y), x_value(x) {\n }\n explicit Point(const string& s) {\n y_value = s[0] - 'a';\n x_value = 0;\n for(const auto& c: s.substr(2)) x_value = x_value * 10 + c - '0';\n --x_value;\n }\n int x() const {return x_value;}\n int y() const {return y_value;}\n bool operator<(const Point& p) const {return y() != p.y() ? y() < p.y() : x() < p.x();}\n bool operator>(const Point& p) const {return y() != p.y() ? y() > p.y() : x() > p.x();}\n bool operator==(const Point& p) const {return y() == p.y() && x() == p.x();}\n};\n\nclass Vertex {\n Point point_value;\n int direction_value;\n int minute_value;\npublic:\n Vertex(const Point& p, int d, int m) :point_value(p), direction_value(d), minute_value(m) {}\n const Point point() const {return point_value;}\n int y() const {return point_value.y();}\n int x() const {return point_value.x();}\n int direction() const {return direction_value;}\n int minute() const {return minute_value;}\n void minute(int m) {minute_value = m;}\n bool operator<(const Vertex& v) const {\n if(minute() != v.minute()) return minute() < v.minute();\n if(direction() != v.direction()) return direction() < v.direction();\n return point() < v.point();\n }\n bool operator>(const Vertex& v) const {\n if(minute() != v.minute()) return minute() > v.minute();\n if(direction() != v.direction()) return direction() > v.direction();\n return point() > v.point();\n }\n};\n\ntypedef tuple<Point, Point> Edge;\n\nint M, N, D;\nmap<Point, int> signal;\nset<Edge> construction;\nmap<Edge, int> jam;\n\nint Dijkstra(const Point& start, const Point& goal) {\n set<Vertex> visited;\n priority_queue<Vertex, vector<Vertex>, greater<Vertex>> q;\n q.push(Vertex(start, EAST, 0));\n while(!q.empty()) {\n Vertex current = q.top();\n q.pop();\n if(current.point() == goal) return current.minute();\n if(visited.count(current)) continue;\n visited.insert(current);\n for(int d = 0; d < 4; ++d) {\n if(current.direction() == (d + 2) % 4) continue;\n Vertex next(Point(current.y() + dy[d], current.x() + dx[d]), d, current.minute());\n if(next.y() < 0 || M <= next.y() || next.x() < 0 || N <= next.x()) continue;\n Edge edge(Point(current.point()), Point(next.point()));\n if(construction.count(edge)) continue;\n int add = D;\n if(jam.count(edge)) add += jam[edge];\n next.minute(current.minute() + add);\n if(signal.count(next.point())) {\n int we = (next.minute() / signal[next.point()]) & 1;\n if((next.direction() == NORTH || next.direction() == SOUTH) && we == BLUE) continue;\n if((next.direction() == EAST || next.direction() == WEST) && we == RED) continue;\n }\n q.push(next);\n }\n }\n return -1;\n}\n\nint main() {\n while(cin >> M >> N, M | N) {\n int ns, nc, nj, k, d;\n string p, p1, p2;\n cin >> D;\n signal.clear();\n for(cin >> ns; ns > 0; --ns) {\n cin >> p >> k;\n signal[Point(p)] = k;\n }\n construction.clear();\n for(cin >> nc; nc > 0; --nc) {\n cin >> p1 >> p2;\n construction.insert(Edge(Point(p1), Point(p2)));\n construction.insert(Edge(Point(p2), Point(p1)));\n }\n jam.clear();\n for(cin >> nj; nj > 0; --nj) {\n cin >> p1 >> p2 >> d;\n jam[Edge(Point(p1), Point(p2))] = jam[Edge(Point(p2), Point(p1))] = d;\n }\n cin >> p1 >> p2;\n Point start(p1), goal(p2);\n\n cout << Dijkstra(start, goal) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 5112,
"score_of_the_acc": -0.8559,
"final_rank": 16
},
{
"submission_id": "aoj_0194_907990",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<sstream>\nusing namespace std;\nint dx[4]={0,1,0,-1};\nint dy[4]={-1,0,1,0};\nint INF=(1<<24);\nint c2i(char ch){return ch-'a';}\nint str2i(string str){\n stringstream ss;\n int res;\n ss<<str;\n ss>>res;\n return res-1; \n}\n \nint M,N,D,ns,nc,nj,Sy,Sx,Gy,Gx,lcm;\nint t[20][20][4];\nint k[20][20];\n \nbool u[20][20][101][4];\nbool vd[20][20][101][4];\n \nvoid input();\nvoid init();\nvoid solve();\nvoid dijkstra();\n \nint main(){\n while(1){\n cin>>N>>M;\n if(M==0&&N==0)break;\n cin>>D;\n init();\n input();\n solve();\n }\n return 0;\n}\n \nvoid dijkstra(){\n int Y,X,Z,dir,ny,nx,nz;\n u[Sy][Sx][0][1]=true;\n \n while(1){\n Y=X=-1;\n for(int a=0;a<101;a++)\n for(int b=0;b<N;b++)\n for(int c=0;c<M;c++)\n for(int d=0;d<4;d++)\n if(u[b][c][a][d]&&!vd[b][c][a%lcm][d]&&Y==-1&&X==-1){Y=b;X=c;Z=a;dir=d;}\n if(Y==-1&&X==-1)break;\n vd[Y][X][Z%lcm][dir]=true;\n if(Y==Gy&&X==Gx)break;\n //cout<<Y<<' '<<X<<' '<<Z<<' '<<dir<<endl;\n if(k[Y][X]>0&&dir%2==1&&(Z/k[Y][X])%2==0)continue;\n if(k[Y][X]>0&&dir%2==0&&(Z/k[Y][X])%2==1)continue;\n for(int i=0;i<4;i++){ \n ny=Y+dy[i];nx=X+dx[i];nz=Z+t[Y][X][i];\n if((dir+2)%4==i)continue;\n if(ny<0||ny>=N||nx<0||nx>=M||nz>100)continue;\n u[ny][nx][nz][i]=true;\n //if(ny==1&&nx==3)cout<<Y<<'-'<<X<<'-'<<Z<<'-'<<dir<<endl;\n }\n \n \n }//while\n}\n \nvoid solve(){\n dijkstra();\n for(int i=0;i<101;i++){\n for(int j=0;j<4;j++){\n if(!u[Gy][Gx][i][j])continue;\n cout<<i<<endl;\n return;\n }\n }\n}\n \nvoid input(){\n string str;\n int y,x,Y,X,d;\n lcm=1;\n cin>>ns;\n for(int i=0;i<ns;i++){\n cin>>str;\n y=c2i(str[0]);\n x=str2i(str.substr(2));\n cin>>k[y][x];\n lcm=lcm/__gcd(lcm,k[y][x])*k[y][x];\n }\n cin>>nc;\n \n for(int i=0;i<nc;i++){\n cin>>str;\n y=c2i(str[0]);\n x=str2i(str.substr(2));\n cin>>str;\n Y=c2i(str[0]);\n X=str2i(str.substr(2));\n for(int j=0;j<4;j++){\n if(y+dy[j]==Y&&x+dx[j]==X){\n t[y][x][j]=INF;\n t[Y][X][(j+2)%4]=INF;\n break;\n }\n }\n }\n \n cin>>nj;\n for(int i=0;i<nj;i++){\n cin>>str;\n y=c2i(str[0]);\n x=str2i(str.substr(2));\n cin>>str;\n Y=c2i(str[0]);\n X=str2i(str.substr(2));\n cin>>d;\n for(int j=0;j<4;j++){\n if(y+dy[j]==Y&&x+dx[j]==X){\n t[y][x][j]+=d;\n t[Y][X][(j+2)%4]+=d;\n break;\n }\n }\n }\n \n cin>>str;\n Sy=c2i(str[0]);\n Sx=str2i(str.substr(2));\n cin>>str;\n Gy=c2i(str[0]);\n Gx=str2i(str.substr(2));\n \n}\n \nvoid init(){\n for(int i=0;i<20;i++){\n for(int j=0;j<20;j++){\n for(int K=0;K<4;K++){\n\tt[i][j][K]=D;\n }\n k[i][j]=0;\n for(int K=0;K<101;K++){\n\tfor(int l=0;l<4;l++){\n\t u[i][j][K][l]=false;\n\t vd[i][j][K][l]=false;\n\t}\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 730,
"memory_kb": 1556,
"score_of_the_acc": -1.2394,
"final_rank": 20
},
{
"submission_id": "aoj_0194_879512",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nvector<string> split(const string &str, char delim){\n vector<string> res;\n size_t current = 0, found;\n while((found = str.find_first_of(delim, current)) != string::npos){\n res.push_back(string(str, current, found - current));\n current = found + 1;\n }\n res.push_back(string(str, current, str.size() - current));\n return res;\n}\n\npair<char,int> conv(char point[32]){\n vector<string> v_pos = split(point,'-');\n string alpha = v_pos[0];\n string num = v_pos[1];\n return make_pair(alpha[0],atoi(num.c_str()));\n}\n\nbool dp[201][4][21][21];\n\nint main(){\n int total_east2west_roads;\n int total_north2south_roads;\n while(~scanf(\"%d %d\",\n\t &total_east2west_roads,\n\t &total_north2south_roads)){\n if(total_east2west_roads == 0 && total_north2south_roads == 0) continue;\n int normal_required_time;\n scanf(\"%d\",&normal_required_time);\n\n int traffic_light[21][21];\n bool has_construction[21][21][21][21];\n int traffic_jam[21][21][21][21];\n memset(traffic_light,0,sizeof(traffic_light));\n memset(traffic_jam,0,sizeof(traffic_jam));\n memset(has_construction,false,sizeof(has_construction));\n\n int total_traffic_lights;\n scanf(\"%d\",&total_traffic_lights);\n for(int traffic_light_idx = 0; traffic_light_idx < total_traffic_lights; traffic_light_idx++){\n char point[32];\n int period;\n scanf(\"%s %d\",point,&period);\n pair<char,int> pos = conv(point);\n traffic_light[pos.first - 'a'][pos.second - 1] = period;\n }\n int total_roads_being_constructed;\n scanf(\"%d\",&total_roads_being_constructed);\n for(int road_idx = 0; road_idx < total_roads_being_constructed; road_idx++){\n char from[32];\n char to[32];\n scanf(\"%s %s\",from,to);\n pair<char,int> pos_from = conv(from);\n pair<char,int> pos_to = conv(to);\n\n has_construction[pos_from.first - 'a'][pos_from.second - 1][pos_to.first - 'a'][pos_to.second - 1] = true;\n has_construction[pos_to.first - 'a'][pos_to.second - 1][pos_from.first - 'a'][pos_from.second - 1] = true;\n }\n\n int total_traffic_jam_roads;\n scanf(\"%d\",&total_traffic_jam_roads);\n for(int road_idx = 0; road_idx < total_traffic_jam_roads; road_idx++){\n char from[32];\n char to[32];\n int jam_required_time; \n scanf(\"%s %s %d\",from,to,&jam_required_time);\n pair<char,int> pos_from = conv(from);\n pair<char,int> pos_to = conv(to);\n traffic_jam[pos_from.first - 'a'][pos_from.second - 1][pos_to.first - 'a'][pos_to.second - 1] = jam_required_time;\n traffic_jam[pos_to.first - 'a'][pos_to.second - 1][pos_from.first - 'a'][pos_from.second - 1] = jam_required_time;\n }\n \n char start[32];\n char goal[32];\n\n scanf(\"%s %s\",start,goal);\n pair<char,int> pos_s = conv(start);\n pair<char,int> pos_g = conv(goal);\n\n int sx = pos_s.second - 1;\n int sy = pos_s.first - 'a';\n\n int gx = pos_g.second - 1;\n int gy = pos_g.first - 'a';\n\n\n memset(dp,false,sizeof(dp));\n dp[0][1][sy][sx] = true;\n dp[0][0][sy][sx] = true;\n dp[0][2][sy][sx] = true;\n dp[0][3][sy][sx] = true;\n\n for(int time = 0;time <= 100; time++){\n for(int x=0;x<total_north2south_roads;x++){\n\tfor(int y=0;y<total_east2west_roads;y++){\n\t for(int next_dir=0;next_dir<4;next_dir++){\n\n\t int dx = x + tx[next_dir];\n\t int dy = y + ty[next_dir];\n\t if(dx < 0 || dx >= total_north2south_roads\n\t || dy < 0 || dy >= total_east2west_roads) continue;\n\t if(has_construction[y][x][dy][dx]) continue;\n\n\t for(int org_dir = 0; org_dir < 4 ; org_dir++){\t \n\t if((org_dir+2)%4 == next_dir) continue;\n\n\t if((org_dir == 1 || org_dir == 3) \n\t\t && traffic_light[y][x] != 0\n\t\t && (time / traffic_light[y][x]) % 2 == 0) continue;\n\t \n\t if((org_dir == 0 || org_dir == 2) \n\t\t && traffic_light[y][x] != 0\n\t\t && (time / traffic_light[y][x]) % 2 != 0) continue;\n\n\t int jam = traffic_jam[y][x][dy][dx];\n\t dp[time + jam + normal_required_time][next_dir][dy][dx]\n\t\t|= dp[time][org_dir][y][x];\n\t }\n\t }\n\t}\n }\n }\n int res = INF;\n for(int time = 0;time <= 100; time++){\n for(int dir = 0;dir < 4; dir++){\n\tif(dp[time][dir][gy][gx]){\n\t res = min(time,res);\n\t}\n }\n }\n\n printf(\"%d\\n\",res);\n\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2524,
"score_of_the_acc": -0.3883,
"final_rank": 11
},
{
"submission_id": "aoj_0194_870241",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<vector>\n#include<map>\nusing namespace std;\ntypedef pair < int , int > Pi;\ntypedef pair < int , Pi > Pii;\n#define fr first\n#define sc second\n\nint M, N, D, ns, nc, nj;\nchar temp['z'+1],o;\nint mas[20][20];\nint go[20][20][20][20];\nbool used[20][20][101];\nPi S, G;\nint dy[] = { 0, 1, 0, -1}, dx[] = { -1, 0, 1, 0};\n\nbool isover(int y, int x){\n return y < 0 || y >= M || x < 0 || x >= N;\n}\n\nbool isred(int y, int x, int time, bool istate){\n return ~mas[y][x] && !istate ^ time / mas[y][x] & 1;\n}\n\nint Dijkstra(){\n fill_n(**used, 20 * 20 * 101, false);\n priority_queue< Pii , vector< Pii > , greater< Pii > > que;\n que.push(Pii( 0, S)); //時間,座標\n while(!que.empty()){\n Pii p = que.top();\n que.pop();\n if(p.sc == G) return p.fr; //ごーるついた\n if(used[p.sc.fr][p.sc.sc][p.fr]++) continue;\n for(int i = 0 ; i < 4 ; i++ ){\n int ny = p.sc.fr + dy[i], nx = p.sc.sc + dx[i];\n if(isover(ny,nx)) continue; //そといった\n if(go[p.sc.fr][p.sc.sc][ny][nx] == -1) continue; //工事中\n int nexttime = p.fr + D + go[p.sc.fr][p.sc.sc][ny][nx];\n if(isred(ny, nx, nexttime, i & 1)) continue; //交差点に侵入不可\n que.push(Pii(nexttime, Pi( ny, nx)));\n }\n }\n return -1;\n}\n\n\nint main(){\n\n for(int i = 'a', j = 1 ; i <= 'z' ; i++, j++ ){ //まっぷてきなかんじ\n temp[i] = j;\n }\n\n\n while( cin >> M >> N, M){\n\n fill_n(*mas, 400, -1);\n fill_n(***go, 20 * 20 * 20 * 20, 0);\n\n cin >> D;\n cin >> ns;\n for(int i = 0 ; i < ns ; i++ ){\n char h;\n int v, k;\n cin >> h >> o >> v >> k;\n mas[temp[h] - 1][v - 1] = k;\n }\n\n cin >> nc;\n for(int i = 0 ; i < nc ; i++ ){\n char h1, h2;\n int v1, v2;\n cin >> h1 >> o >> v1 >> h2 >> o >> v2; //入力面倒くさいね\n go[temp[h1] - 1][v1 - 1][temp[h2] - 1][v2 - 1] = -1;\n go[temp[h2] - 1][v2 - 1][temp[h1] - 1][v1 - 1] = -1;\n }\n\n cin >> nj;\n for(int i = 0 ; i < nj ; i++ ){\n char h1, h2;\n int v1, v2, d;\n cin >> h1 >> o >> v1 >> h2 >> o >> v2 >> d;\n go[temp[h1] - 1][v1 - 1][temp[h2] - 1][v2 - 1] = d;\n go[temp[h2] - 1][v2 - 1][temp[h1] - 1][v1 - 1] = d;\n }\n\n char h1, h2;\n int v1, v2;\n cin >> h1 >> o >> v1 >> h2 >> o >> v2;\n S = Pi( temp[h1] - 1, v1 - 1);\n G = Pi( temp[h2] - 1, v2 - 1);\n\n cout << Dijkstra() << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1888,
"score_of_the_acc": -0.2905,
"final_rank": 8
},
{
"submission_id": "aoj_0194_870237",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<vector>\n#include<map>\nusing namespace std;\ntypedef pair < int , int > Pi;\ntypedef pair < int , Pi > Pii;\n#define fr first\n#define sc second\n\nint M, N, D, ns, nc, nj;\nchar temp['z'+1],o;\nint mas[20][20];\nint go[20][20][20][20];\nbool used[20][20][101];\nPi S, G;\nint dy[] = { 0, 1, 0, -1}, dx[] = { -1, 0, 1, 0};\n\nbool isover(int y, int x){\n return y < 0 || y >= M || x < 0 || x >= N;\n}\n\nbool isred(int y, int x, int time, bool istate){\n if(mas[y][x] == -1) return false; //そもそも信号がない\n const int kankaku = mas[y][x];\n if(istate) return time / kankaku % 2;\n else return !(time / kankaku % 2);\n}\n\nint Dijkstra(){\n fill_n(**used, 20 * 20 * 101, false);\n priority_queue< Pii , vector< Pii > , greater< Pii > > que;\n que.push(Pii( 0, S)); //時間,座標\n while(!que.empty()){\n Pii p = que.top();\n que.pop();\n if(p.sc == G) return p.fr; //ごーるついた\n if(used[p.sc.fr][p.sc.sc][p.fr]++) continue;\n for(int i = 0 ; i < 4 ; i++ ){\n int ny = p.sc.fr + dy[i], nx = p.sc.sc + dx[i];\n if(isover(ny,nx)) continue; //そといった\n if(go[p.sc.fr][p.sc.sc][ny][nx] == -1) continue; //工事中\n int nexttime = p.fr + D + go[p.sc.fr][p.sc.sc][ny][nx];\n if(isred(ny, nx, nexttime, i % 2)) continue; //交差点に侵入不可\n que.push(Pii(nexttime, Pi( ny, nx)));\n }\n }\n return -1;\n}\n\n\nint main(){\n\n for(int i = 'a', j = 1 ; i <= 'z' ; i++, j++ ){ //まっぷてきなかんじ\n temp[i] = j;\n }\n\n\n while( cin >> M >> N, M){\n\n fill_n(*mas, 400, -1);\n fill_n(***go, 20 * 20 * 20 * 20, 0);\n\n cin >> D;\n cin >> ns;\n for(int i = 0 ; i < ns ; i++ ){\n char h;\n int v, k;\n cin >> h >> o >> v >> k;\n mas[temp[h] - 1][v - 1] = k;\n }\n\n cin >> nc;\n for(int i = 0 ; i < nc ; i++ ){\n char h1, h2;\n int v1, v2;\n cin >> h1 >> o >> v1 >> h2 >> o >> v2; //入力面倒くさいね\n go[temp[h1] - 1][v1 - 1][temp[h2] - 1][v2 - 1] = -1;\n go[temp[h2] - 1][v2 - 1][temp[h1] - 1][v1 - 1] = -1;\n }\n\n cin >> nj;\n for(int i = 0 ; i < nj ; i++ ){\n char h1, h2;\n int v1, v2, d;\n cin >> h1 >> o >> v1 >> h2 >> o >> v2 >> d;\n go[temp[h1] - 1][v1 - 1][temp[h2] - 1][v2 - 1] = d;\n go[temp[h2] - 1][v2 - 1][temp[h1] - 1][v1 - 1] = d;\n }\n\n char h1, h2;\n int v1, v2;\n cin >> h1 >> o >> v1 >> h2 >> o >> v2;\n S = Pi( temp[h1] - 1, v1 - 1);\n G = Pi( temp[h2] - 1, v2 - 1);\n\n cout << Dijkstra() << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1888,
"score_of_the_acc": -0.2905,
"final_rank": 8
},
{
"submission_id": "aoj_0194_677359",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <sstream>\nusing namespace std;\n\nconst int MAXH = 21;\nconst int MAXW = 21;\nconst int MAXT = 103;\nconst int INF = 1<<28;\nconst int dx[] = {1,0,-1,0};\nconst int dy[] = {0,1,0,-1};\nint H, W;\nint D;\nint G[MAXH][MAXW][4];\nint S[MAXH][MAXW];\nbool dp[MAXT][MAXH][MAXW][4];\n\npair<int,int> getPair() {\n string s;\n cin >> s;\n replace(s.begin(), s.end(), '-', ' ');\n stringstream ss(s);\n char h;\n int v;\n ss >> h >> v;\n return make_pair(h-'a', v-1);\n}\n\nint main() {\n while(cin >> H >> W && (H|W)) {\n cin >> D;\n {\n fill(S[0], S[MAXH], 0);\n int ns;\n cin >> ns;\n while(ns--) {\n pair<int,int> p = getPair();\n cin >> S[p.first][p.second];\n }\n }\n {\n fill(G[0][0], G[MAXH][0], D);\n int nc;\n cin >> nc;\n while(nc--) {\n pair<int,int> p1 = getPair();\n pair<int,int> p2 = getPair();\n int tx = p2.second - p1.second;\n int ty = p2.first - p1.first;\n for(int i = 0; i < 4; ++i) {\n if(dx[i] == tx && dy[i] == ty) {\n G[p1.first][p1.second][i] = INF;\n G[p2.first][p2.second][(i+2)%4] = INF;\n break;\n }\n }\n }\n }\n {\n int nj;\n cin >> nj;\n while(nj--) {\n pair<int,int> p1 = getPair();\n pair<int,int> p2 = getPair();\n int d;\n cin >> d;\n int tx = p2.second - p1.second;\n int ty = p2.first - p1.first;\n for(int i = 0; i < 4; ++i) {\n if(dx[i] == tx && dy[i] == ty) {\n G[p1.first][p1.second][i] = D+d;\n G[p2.first][p2.second][(i+2)%4] = D+d;\n break;\n }\n }\n }\n }\n pair<int,int> src = getPair();\n pair<int,int> dst = getPair();\n\n fill(dp[0][0][0], dp[MAXT][0][0], false);\n dp[0][src.first][src.second][0] = true;\n for(int t = 0; t < MAXT; ++t) {\n for(int i = 0; i < H; ++i) {\n for(int j = 0; j < W; ++j) {\n for(int d = 0; d < 4; ++d) {\n if(!dp[t][i][j][d]) continue;\n for(int k = 0; k < 4; ++k) {\n if(k == (d+2)%4) continue;\n if(G[i][j][k] == INF) continue;\n int ni = i + dy[k];\n int nj = j + dx[k];\n if(nj < 0 || nj >= W) continue;\n if(ni < 0 || ni >= H) continue;\n int nt = t + G[i][j][k];\n if(nt >= MAXT) continue;\n if(S[ni][nj]) {\n int a = (nt / S[ni][nj]) % 2;\n if(a == k % 2) continue;\n }\n dp[nt][ni][nj][k] = true;\n }\n }\n }\n }\n }\n\n try {\n for(int t = 0; t < MAXT; ++t) {\n for(int d = 0; d < 4; ++d) {\n if(dp[t][dst.first][dst.second][d]) {\n cout << t << endl;\n throw 0;\n }\n }\n }\n } catch(...) {}\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1472,
"score_of_the_acc": -0.2265,
"final_rank": 5
},
{
"submission_id": "aoj_0194_556206",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n#include <cassert>\n#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <algorithm>\n#include <numeric>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <list>\n#include <set>\n#include <map>\n#include <bitset>\n#include <functional>\n#include <iterator>\n\nusing namespace std;\n\n#define dump(n) cout<<\"# \"<<#n<<'='<<(n)<<endl\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define peri(i,a,b) for(int i=int(b);i-->int(a);)\n#define rep(i,n) repi(i,0,n)\n#define per(i,n) peri(i,0,n)\n#define iter(c) __typeof__((c).begin())\n#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();++i)\n#define all(c) (c).begin(),(c).end()\n#define mp make_pair\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<vvvi> vvvvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\n\nconst int INFTY=1<<29;\nconst double EPS=1e-9;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\ntemplate<typename T>\nostream& operator<<(ostream& os,const vector<T>& a){\n\tos<<'[';\n\trep(i,a.size()) os<<(i?\" \":\"\")<<a[i];\n\treturn os<<']';\n}\n\nstruct State{\n\tint i,j,t;\n\tint d; // {up,down,left,right}=>{0,1,2,3}\n\tState(){}\n\tState(int i,int j,int t,int d):i(i),j(j),t(t),d(d){}\n\tbool operator<(const State& s)const{return t<s.t;}\n\tbool operator>(const State& s)const{return t>s.t;}\n};\n\nint solve(const vvi& sig,const vvvvi& delay,pii start,pii goal)\n{\n\tint h=sig.size(),w=sig[0].size();\n\t\n\tvvvvi vis(h,vvvi(w,vvi(4,vi(101))));\n\tpriority_queue<State,vector<State>,greater<State>> pq;\n\tpq.emplace(start.first,start.second,0,3);\n\twhile(!pq.empty()){\n\t\tState cur=pq.top(); pq.pop();\n\t\tif(vis[cur.i][cur.j][cur.d][cur.t])\n\t\t\tcontinue;\n\t\tvis[cur.i][cur.j][cur.d][cur.t]=1;\n\t\tif(cur.i==goal.first && cur.j==goal.second)\n\t\t\tbreak;\n\t\t\n\t\tint di[]={-1,1,0,0},dj[]={0,0,-1,1};\n\t\trep(k,4) if(k!=(cur.d^1)){\n\t\t\tint ni=cur.i+di[k],nj=cur.j+dj[k];\n\t\t\tif(ni<0 || h<=ni || nj<0 || w<=nj)\n\t\t\t\tcontinue;\n\t\t\tint nt=cur.t+delay[cur.i][cur.j][ni][nj];\n\t\t\tif(nt>=INFTY)\n\t\t\t\tcontinue;\n\t\t\tif(sig[ni][nj]!=-1 && nt/sig[ni][nj]%2!=k/2)\n\t\t\t\tcontinue;\n\t\t\tpq.emplace(ni,nj,nt,k);\n\t\t}\n\t}\n\tconst vvi& res=vis[goal.first][goal.second];\n\trep(i,101) rep(j,4) if(res[j][i])\n\t\treturn i;\n}\n\nint main()\n{\n\tfor(int h,w;scanf(\"%d%d\",&h,&w),h|w;){\n\t\tint d,s; scanf(\"%d%d\",&d,&s); // 基本コスト，信号機の数\n\t\tvvi sig(h,vi(w,-1));\n\t\trep(i,s){\n\t\t\tchar a; int b,t;\n\t\t\tscanf(\" %c-%d %d\",&a,&b,&t);\n\t\t\tsig[a-'a'][b-1]=t;\n\t\t}\n\t\tvvvvi delay(h,vvvi(w,vvi(h,vi(w,INFTY))));\n\t\trep(i,h) rep(j,w) rep(k,h) rep(l,w){\n\t\t\tif(i==k && j==l)\n\t\t\t\tdelay[i][j][k][l]=0;\n\t\t\tif(abs(i-k)+abs(j-l)==1)\n\t\t\t\tdelay[i][j][k][l]=d;\n\t\t}\n\t\t// 工事中\n\t\tint c; scanf(\"%d\",&c);\n\t\trep(i,c){\n\t\t\tchar a1,a2; int b1,b2;\n\t\t\tscanf(\" %c-%d %c-%d\",&a1,&b1,&a2,&b2);\n\t\t\tdelay[a1-'a'][b1-1][a2-'a'][b2-1]=INFTY;\n\t\t\tdelay[a2-'a'][b2-1][a1-'a'][b1-1]=INFTY;\n\t\t}\n\t\t// 渋滞\n\t\tint j; scanf(\"%d\",&j);\n\t\trep(i,j){\n\t\t\tchar a1,a2; int b1,b2,dd;\n\t\t\tscanf(\" %c-%d %c-%d %d\",&a1,&b1,&a2,&b2,&dd);\n\t\t\tdelay[a1-'a'][b1-1][a2-'a'][b2-1]+=dd;\n\t\t\tdelay[a2-'a'][b2-1][a1-'a'][b1-1]+=dd;\n\t\t}\n\t\t// 始点・終点\n\t\tpii start,goal;{\n\t\t\tchar a1,a2; int b1,b2;\n\t\t\tscanf(\" %c-%d %c-%d\",&a1,&b1,&a2,&b2);\n\t\t\tstart=mp(a1-'a',b1-1);\n\t\t\tgoal=mp(a2-'a',b2-1);\n\t\t}\n\t\t\n\t\tcout<<solve(sig,delay,start,goal)<<endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3028,
"score_of_the_acc": -0.4797,
"final_rank": 14
},
{
"submission_id": "aoj_0194_547134",
"code_snippet": "#include <algorithm>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <vector>\n\nusing namespace std;\n\n#define reps(i,f,n) for(int i=f; i<int(n); ++i)\n#define rep(i,n) reps(i,0,n)\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n\nconst int INF = 1001001001;\n\npii convert(const char* str)\n{\n\treturn pii(str[0]-'a', atoi(str+2)-1);\n}\n\nconst int dy[] = {-1, 0, 1, 0};\nconst int dx[] = {0, -1, 0, 1};\n\nstruct Data\n{\n\tint y, x, d, t;\n\tData(int y, int x, int d, int t) : y(y), x(x), d(d), t(t) {}\n\tbool operator< (const Data& d)const{\n\t\treturn t > d.t;\n\t}\n};\n\nint main()\n{\n\tint h, w;\n\twhile(scanf(\"%d%d\", &h, &w), h){\n\t\tint D, ns;\n\t\tscanf(\"%d%d\", &D, &ns);\n\n\t\tint sign[20][20] = {{0}};\n\t\trep(i, ns){\n\t\t\tchar str[128];\n\t\t\tint k;\n\t\t\tscanf(\"%s%d\", str, &k);\n\t\t\tpii p = convert(str);\n\t\t\tsign[p.first][p.second] = k;\n\t\t}\n\n\t\tbool work[20][20][4] = {{{false}}};\n\t\tint nc;\n\t\tscanf(\"%d\", &nc);\n\t\trep(i, nc){\n\t\t\tchar str1[128], str2[128];\n\t\t\tscanf(\"%s%s\", str1, str2);\n\t\t\tpii p1 = convert(str1), p2 = convert(str2);\n\t\t\trep(j, 4){\n\t\t\t\tif(pii(p1.first+dy[j], p1.second+dx[j]) == p2){\n\t\t\t\t\twork[p1.first][p1.second][j] = true;\n\t\t\t\t\twork[p2.first][p2.second][(j+2)%2] = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint cost[20][20][4] = {{{0}}};\n\t\tint nj;\n\t\tscanf(\"%d\", &nj);\n\t\trep(i, nj){\n\t\t\tchar str1[128], str2[128];\n\t\t\tint d;\n\t\t\tscanf(\"%s%s%d\", str1, str2, &d);\n\t\t\tpii p1 = convert(str1), p2 = convert(str2);\n\t\t\trep(j, 4){\n\t\t\t\tif(pii(p1.first+dy[j], p1.second+dx[j]) == p2){\n\t\t\t\t\tcost[p1.first][p1.second][j] = d;\n\t\t\t\t\tcost[p2.first][p2.second][(j+2)%2] = d;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tchar str1[128], str2[128];\n\t\tscanf(\"%s%s\", str1, str2);\n\t\tpii start = convert(str1), goal = convert(str2);\n\n\t\tint ans = -1;\n\t\tbool visited[20][20][4][101] = {{{{false}}}};\n\t\tpriority_queue<Data> Q;\n\t\tQ.push(Data(start.first, start.second, 3, 0));\n\t\twhile(!Q.empty()){\n\t\t\tData d = Q.top();\n\t\t\tQ.pop();\n\t\t\tif(visited[d.y][d.x][d.d][d.t])\n\t\t\t\tcontinue;\n\t\t\tvisited[d.y][d.x][d.d][d.t] = true;\n\t\t\tif(d.y==goal.first && d.x==goal.second){\n\t\t\t\tans = d.t;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\trep(i, 4){\n\t\t\t\tif(abs(d.d-i) == 2 || work[d.y][d.x][i])\n\t\t\t\t\tcontinue;\n\n\t\t\t\tint py = d.y + dy[i];\n\t\t\t\tint px = d.x + dx[i];\n\t\t\t\tif(py<0 || h<=py || px<0 || w<=px)\n\t\t\t\t\tcontinue;\n\n\t\t\t\tint pt = d.t + D + cost[d.y][d.x][i];\n\t\t\t\tif(sign[py][px]==0 || (((pt/sign[py][px])%2) ^ (i%2==0))){\n\t\t\t\t\tQ.push(Data(py, px, i, pt));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1320,
"score_of_the_acc": -0.2031,
"final_rank": 4
},
{
"submission_id": "aoj_0194_452035",
"code_snippet": "#include<stdio.h>\n#include<map>\n#include<queue>\n#include<set>\n#include<algorithm>\n#include<string.h>\n\n\nint arrows[4][3]={{0,1,3},\n\t\t {0,1,2},\n\t\t {1,2,3},\n\t\t {0,2,3}};//右0、上1、左2、下3\nint dxs[]={1,0,-1,0};\nint dys[]={0,-1,0,1};\n\n\n\nstruct stop{\n\t//信号,周期はmapのvalに放り込む\n\tint x,y;\n\tbool operator<(const stop& s)const{\n\t\tif(x!=s.x)return x<s.x;\n\t\treturn y<s.y;\n\t}\n};\nstruct evePos{\n\tint r1,c1,r2,c2;\n\t//渋滞か工事中の表現\n\tbool operator<(const evePos& j)const{\n\t\tif(r1!=j.r1)return r1<j.r1;\n\t\tif(c1!=j.c1)return c1<j.c1;\n\t\tif(r2!=j.r2)return r2<j.r2;\n\t\treturn c2<j.c2;\n\t}\n};\nstruct car{\n\tint time,arrow;\n\tevePos pos;//手抜きをして構造体を流用、トラックが前にいたポジションと今のポジション\n\tbool operator<(const car& c)const{\n\t\treturn time>c.time;//優先順位付きキュー用\n\t}\n\tcar move(int nextArrow){\n\t\tcar re;\n\t\tre.pos.r2=pos.r1;//今いるポジションを過去にする\n\t\tre.pos.c2=pos.c1;\n\t\tre.pos.r1=pos.r1+dys[nextArrow];\n\t\tre.pos.c1=pos.c1+dxs[nextArrow];\n\t\tre.time=time;\n\t\tre.arrow=nextArrow;\n\t\treturn re;//タイム計算は後でする\n\t}\n};\n\nbool memo[101][21][21][4];//タイム、座標、向きで同じ状態を探索してないか\n\nvoid calc(int h,int w){\n\tstd::map<stop,int> stops;//信号\n\tstd::priority_queue<car> pQ;\n\tstd::set<evePos> stops2;//工事\n\tstd::map<evePos,int> jams;//渋滞\n\tmemset(memo,false,sizeof(memo));\n\tint d,ns,v1,v2,k,nc,nj;\n\tchar h1,h2,t1;\n\tstop s1;\n\t\n\tscanf(\"%d %d\",&d,&ns);\n\tfor(int i=0;i<ns;i++){\n\t\tscanf(\"%c%c-%d %d\",&t1,&h1,&v1,&k);\n\t\ts1.y=h1-'a';//0ベースで読み込み\n\t\ts1.x=v1-1;\n\t\tstops[s1]=k;\n\t\t//printf(\"<%c %d>\",h1,v1);\n\t}\n\tscanf(\"%d\",&nc);\n\tevePos e1;\n\tfor(int i=0;i<nc;i++){\n\t\tscanf(\"%c%c-%d%c%c-%d\",&t1,&h1,&v1,&t1,&h2,&v2);\n\t\te1.r1=h1-'a';\n\t\te1.c1=v1-1;\n\t\te1.r2=h2-'a';\n\t\te1.c2=v2-1;\n\t\tstops2.insert(e1);\n\t\tstd::swap(e1.r1,e1.r2);//逆向きも登録する\n\t\tstd::swap(e1.c1,e1.c2);\n\t\tstops2.insert(e1);\n\t\t//printf(\"<%c %d %c %d>\",h1,v1,h2,v2);\n\t}\n\tscanf(\"%d\",&nj);\n\tfor(int i=0;i<nj;i++){\n\t\tscanf(\"%c%c-%d%c%c-%d %d\",&t1,&h1,&v1,&t1,&h2,&v2,&k);\n\t\te1.r1=h1-'a';\n\t\te1.c1=v1-1;\n\t\te1.r2=h2-'a';\n\t\te1.c2=v2-1;\n\t\tjams[e1]=k;;\n\t\tstd::swap(e1.r1,e1.r2);//逆向きも登録する\n\t\tstd::swap(e1.c1,e1.c2);\n\t\tjams[e1]=k;\n\t\t//printf(\"<%c %d %c %d>\",h1,v1,h2,v2);\n\t}\n\tcar myCar,nextCar;\n\tmyCar.time=myCar.arrow=0;\n\tint gx,gy;\n\tscanf(\"%c%c-%d%c%c-%d\",&t1,&h1,&v1,&t1,&h2,&v2);\n\tgx=v2-1;\n\tgy=h2-'a';\n\tmyCar.pos.r1=h1-'a';\n\tmyCar.pos.c1=v1-1;//0ベース\n\tpQ.push(myCar);\n\twhile(!pQ.empty()){\n\t\tmyCar=pQ.top();\n\t\tpQ.pop();\n\t\tif(myCar.pos.r1==gy&&myCar.pos.c1==gx)break;//ゴールに到達\n\t\t//printf(\"<x=%d y=%d a=%d t=%d>\",myCar.pos.c1,myCar.pos.r1,myCar.arrow,myCar.time);\n\t\t//scanf(\"%c\",&t1);\n\t\tmyCar.time+=d;\n\t\tfor(int i=0;i<3;i++){\n\t\t\tnextCar=myCar.move(arrows[myCar.arrow][i]);\n\t\t\ts1.y=nextCar.pos.r1;//信号で止まらないかのチェック\n\t\t\ts1.x=nextCar.pos.c1;\n\t\t\tif(s1.x<0 || w<=s1.x || s1.y<0 || h<=s1.y)continue;//マップ外に飛び出した\n\t\t\tif(stops2.find(nextCar.pos)!=stops2.end())continue;//工事に引っかかった\n\t\t\tif(jams.find(nextCar.pos)!=jams.end()){\n\t\t\t\tnextCar.time+=jams[nextCar.pos];//渋滞に引っかかった\n\t\t\t}\n\t\t\tif(stops.find(s1)!=stops.end()){\n\t\t\t\tint t1=(nextCar.time/stops[s1])%2;//0なら東西停止、1なら南北停止\n\t\t\t\tint t2=nextCar.arrow%2;//東西なら0、1なら南北移動中\n\t\t\t\tif(t1==t2)continue;//信号に引っかかった\n\t\t\t}\n\t\t\tif(nextCar.time>100)continue;//100分以内という条件を満たしてない\n\t\t\tif(memo[nextCar.time][s1.x][s1.y][nextCar.arrow]==true)continue;//過去にこの状態を通った\n\t\t\tmemo[nextCar.time][s1.x][s1.y][nextCar.arrow]=true;//この状態はもう終わってる\n\t\t\tpQ.push(nextCar);\n\t\t}\n\t}\n\tprintf(\"%d\\n\",myCar.time);\n}\n\nint main(){\n\tint h,w;\n\twhile(1){\n\t\tscanf(\"%d %d\",&h,&w);\n\t\tif(h==0&&w==0)break;\n\t\tcalc(h,w);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0194_449806",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\nusing namespace std;\n\ntypedef istringstream ISS;\ntypedef ostringstream OSS;\ntypedef vector<string> VS;\ntypedef int INT;\ntypedef vector<INT> VI;\ntypedef vector<VI> VVI;\ntypedef pair <INT, INT> II;\ntypedef vector <II> VII;\n\ntemplate<class T> ostream& operator << ( ostream& os, vector<T> v ) {\n for ( typename vector<T>::iterator it_i = v.begin(); it_i != v.end(); ++it_i ) {\n os << *it_i << \", \";\n }\n return os;\n}\n\n\nconst int SIZE = 22;\nconst int NONE = -1;\n\nint w, h;\nint SG[SIZE][SIZE]; \nbool CS[SIZE][SIZE][SIZE][SIZE]; \nint D[SIZE][SIZE][SIZE][SIZE];\nint sr, sc, gr, gc;\n\nvoid init() {\n for ( int i = 0; i < SIZE; ++ i ) {\n for ( int j = 0; j < SIZE; ++ j ) {\n SG[i][j] = NONE;\n }\n }\n for ( int i1 = 0; i1 < SIZE; ++ i1 ) {\n for ( int j1 = 0; j1 < SIZE; ++ j1 ) {\n for ( int i2 = 0; i2 < SIZE; ++ i2 ) {\n for ( int j2 = 0; j2 < SIZE; ++ j2 ) {\n CS[i1][j1][i2][j2] = false; \n }\n }\n }\n }\n}\n\nII getPosition( string s ) {\n replace( s.begin(), s.end(), '-', ' ' );\n ISS iss( s );\n char H_;\n int H;\n int V;\n iss >> H_ >> V;\n H = H_ - 'a';\n V --;\n return II( H, V );\n}\n\nvoid input() {\n int D_;\n cin >> D_; \n\n for ( int i1 = 0; i1 < SIZE; ++ i1 ) {\n for ( int j1 = 0; j1 < SIZE; ++ j1 ) {\n for ( int i2 = 0; i2 < SIZE; ++ i2 ) {\n for ( int j2 = 0; j2 < SIZE; ++ j2 ) {\n D[i1][j1][i2][j2] = D_;\n }\n }\n }\n }\n\n int ns;\n cin >> ns;\n for ( int i = 0; i < ns; ++ i ) {\n string s;\n cin >> s;\n II ret1 = getPosition( s );\n int r = ret1.first, c = ret1.second;\n int k;\n cin >> k;\n SG[r][c] = k;\n }\n\n int nc;\n cin >> nc;\n for ( int i = 0; i < nc; ++ i ) {\n string s1, s2;\n cin >> s1 >> s2;\n II ret1 = getPosition( s1 ), ret2 = getPosition( s2 );\n int r1 = ret1.first, c1 = ret1.second, r2 = ret2.first, c2 = ret2.second;\n CS[r1][c1][r2][c2] = true;\n CS[r2][c2][r1][c1] = true;\n }\n\n int nj;\n cin >> nj;\n for ( int i = 0; i < nj; ++ i ) {\n string s1, s2;\n cin >> s1 >> s2;\n II ret1 = getPosition( s1 ), ret2 = getPosition( s2 );\n int r1 = ret1.first, c1 = ret1.second, r2 = ret2.first, c2 = ret2.second;\n int d;\n cin >> d;\n D[r1][c1][r2][c2] += d;\n D[r2][c2][r1][c1] += d;\n }\n\n {\n string s1, s2;\n cin >> s1 >> s2;\n II ret1 = getPosition( s1 ), ret2 = getPosition( s2 );\n int r1 = ret1.first, c1 = ret1.second, r2 = ret2.first, c2 = ret2.second;\n sr = r1, sc = c1, gr = r2, gc = c2;\n }\n}\n\ntypedef pair <II, II> NODE; \ntypedef priority_queue <NODE, vector<NODE>, greater<NODE> > QUEUE;\n\nconst int dr[4] = { 0, 1, 0, -1 };\nconst int dc[4] = { 1, 0, -1, 0 };\n\nbool V[102][4][SIZE][SIZE];\nvoid solveInit() {\n for ( int i1 = 0; i1 < 102; ++ i1 ) {\n for ( int j1 = 0; j1 < 4; ++ j1 ) {\n for ( int i2 = 0; i2 < SIZE; ++ i2 ) {\n for ( int j2 = 0; j2 < SIZE; ++ j2 ) {\n V[i1][j1][i2][j2] = false;\n }\n }\n }\n }\n}\n\nbool isValidPos( int r, int c ) {\n return r >= 0 && r < h && c >= 0 && c < w;\n}\n\nint solve() {\n solveInit();\n\n QUEUE Q;\n Q.push( NODE( II( 0, 0 ), II( sr, sc ) ) );\n V[0][0][sr][sc] = true;\n\n while ( ! Q.empty() ) {\n NODE node = Q.top();\n Q.pop();\n\n int steps = node.first.first;\n int dir = node.first.second;\n int r = node.second.first;\n int c = node.second.second;\n\n if ( r == gr && c == gc ) {\n return steps;\n }\n \n\n for ( int i = 0; i < 4; ++ i ) {\n int ndir = i;\n if ( dir == ( ndir + 2 ) % 4 ) continue;\n int nr = r + dr[ndir];\n int nc = c + dc[ndir];\n if ( ! isValidPos( nr, nc ) ) continue;\n if ( CS[r][c][nr][nc] ) continue;\n int nsteps = steps + D[r][c][nr][nc];\n if ( nsteps > 100 ) continue;\n if ( SG[nr][nc] != NONE ) {\n int k = SG[nr][nc];\n bool f = ( ndir == 1 ) || ( ndir == 3 );\n if ( ( nsteps / k ) % 2 == 1 ) f = !f;\n if ( ! f ) continue;\n }\n if ( V[nsteps][ndir][nr][nc] ) continue;\n V[nsteps][ndir][nr][nc] = true;\n NODE next( II( nsteps, ndir ), II( nr, nc ) );\n Q.push( next );\n }\n\n }\n \n return -1;\n}\n\nint main() {\n while ( cin >> h >> w ) {\n if ( w == 0 && h == 0 ) break;\n init();\n input();\n cout << solve() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -0.0139,
"final_rank": 3
},
{
"submission_id": "aoj_0194_449805",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\nusing namespace std;\n\ntypedef istringstream ISS;\ntypedef ostringstream OSS;\ntypedef vector<string> VS;\ntypedef int INT;\ntypedef vector<INT> VI;\ntypedef vector<VI> VVI;\ntypedef pair <INT, INT> II;\ntypedef vector <II> VII;\n\ntemplate<class T> ostream& operator << ( ostream& os, vector<T> v ) {\n for ( typename vector<T>::iterator it_i = v.begin(); it_i != v.end(); ++it_i ) {\n os << *it_i << \", \";\n }\n return os;\n}\n\n\nconst int SIZE = 22;\nconst int NONE = -1;\n\nint w, h;\nint SG[SIZE][SIZE]; \nbool CS[SIZE][SIZE][SIZE][SIZE]; \nint D[SIZE][SIZE][SIZE][SIZE];\nint sr, sc, gr, gc;\n\nvoid init() {\n for ( int i = 0; i < SIZE; ++ i ) {\n for ( int j = 0; j < SIZE; ++ j ) {\n SG[i][j] = NONE;\n }\n }\n for ( int i1 = 0; i1 < SIZE; ++ i1 ) {\n for ( int j1 = 0; j1 < SIZE; ++ j1 ) {\n for ( int i2 = 0; i2 < SIZE; ++ i2 ) {\n for ( int j2 = 0; j2 < SIZE; ++ j2 ) {\n CS[i1][j1][i2][j2] = false; \n }\n }\n }\n }\n}\n\nII getPosition( string s ) {\n replace( s.begin(), s.end(), '-', ' ' );\n ISS iss( s );\n char H_;\n int H;\n int V;\n iss >> H_ >> V;\n H = H_ - 'a';\n V --;\n return II( H, V );\n}\n\nvoid input() {\n int D_;\n cin >> D_; \n\n for ( int i1 = 0; i1 < SIZE; ++ i1 ) {\n for ( int j1 = 0; j1 < SIZE; ++ j1 ) {\n for ( int i2 = 0; i2 < SIZE; ++ i2 ) {\n for ( int j2 = 0; j2 < SIZE; ++ j2 ) {\n D[i1][j1][i2][j2] = D_;\n }\n }\n }\n }\n\n int ns;\n cin >> ns;\n for ( int i = 0; i < ns; ++ i ) {\n string s;\n cin >> s;\n II ret1 = getPosition( s );\n int r = ret1.first, c = ret1.second;\n int k;\n cin >> k;\n SG[r][c] = k;\n }\n\n int nc;\n cin >> nc;\n for ( int i = 0; i < nc; ++ i ) {\n string s1, s2;\n cin >> s1 >> s2;\n II ret1 = getPosition( s1 ), ret2 = getPosition( s2 );\n int r1 = ret1.first, c1 = ret1.second, r2 = ret2.first, c2 = ret2.second;\n CS[r1][c1][r2][c2] = true;\n CS[r2][c2][r1][c1] = true;\n }\n\n int nj;\n cin >> nj;\n for ( int i = 0; i < nj; ++ i ) {\n string s1, s2;\n cin >> s1 >> s2;\n II ret1 = getPosition( s1 ), ret2 = getPosition( s2 );\n int r1 = ret1.first, c1 = ret1.second, r2 = ret2.first, c2 = ret2.second;\n int d;\n cin >> d;\n D[r1][c1][r2][c2] += d;\n D[r2][c2][r1][c1] += d;\n }\n\n {\n string s1, s2;\n cin >> s1 >> s2;\n II ret1 = getPosition( s1 ), ret2 = getPosition( s2 );\n int r1 = ret1.first, c1 = ret1.second, r2 = ret2.first, c2 = ret2.second;\n sr = r1, sc = c1, gr = r2, gc = c2;\n }\n}\n\nvoid debug() {\n for ( int i = 0; i < h; ++ i ) {\n for ( int j = 0; j < w; ++ j ) {\n if ( SG[i][j] != NONE )\n cout << \"(\" << i << \",\" << j << \")ツづ可信ツ債?機ツつェツつ?づゥ\" << \", k = \" << SG[i][j] << endl; \n }\n }\n for ( int i1 = 0; i1 < h; ++ i1 ) {\n for ( int j1 = 0; j1 < w; ++ j1 ) {\n for ( int i2 = 0; i2 < h; ++ i2 ) {\n for ( int j2 = 0; j2 < w; ++ j2 ) {\n cout << \"(\" << i1 << \", \" << j1 << \")-(\";\n cout << i2 << \", \" << j2 << \") = \" << D[i1][j1][i2][j2] << endl;\n }\n }\n }\n }\n cout << \"ツ始ツ点-ツ終ツ点\" << \": (\" << sr << \", \" << sc << \") / (\" << gr << \", \" << gc << \")\" << endl;\n}\n\ntypedef pair <II, II> NODE; \ntypedef priority_queue <NODE, vector<NODE>, greater<NODE> > QUEUE;\n\nconst int dr[4] = { 0, 1, 0, -1 };\nconst int dc[4] = { 1, 0, -1, 0 };\n\nbool V[102][4][SIZE][SIZE];\nvoid solveInit() {\n for ( int i1 = 0; i1 < 102; ++ i1 ) {\n for ( int j1 = 0; j1 < 4; ++ j1 ) {\n for ( int i2 = 0; i2 < SIZE; ++ i2 ) {\n for ( int j2 = 0; j2 < SIZE; ++ j2 ) {\n V[i1][j1][i2][j2] = false;\n }\n }\n }\n }\n}\n\nbool isValidPos( int r, int c ) {\n return r >= 0 && r < h && c >= 0 && c < w;\n}\n\nint solve() {\n solveInit();\n\n QUEUE Q;\n Q.push( NODE( II( 0, 0 ), II( sr, sc ) ) );\n V[0][0][sr][sc] = true;\n\n while ( ! Q.empty() ) {\n NODE node = Q.top();\n Q.pop();\n\n int steps = node.first.first;\n int dir = node.first.second;\n int r = node.second.first;\n int c = node.second.second;\n\n if ( r == gr && c == gc ) {\n return steps;\n }\n \n\n for ( int i = 0; i < 4; ++ i ) {\n int ndir = i;\n if ( dir == ( ndir + 2 ) % 4 ) continue;\n int nr = r + dr[ndir];\n int nc = c + dc[ndir];\n if ( ! isValidPos( nr, nc ) ) continue;\n if ( CS[r][c][nr][nc] ) continue;\n int nsteps = steps + D[r][c][nr][nc];\n if ( nsteps > 100 ) continue;\n if ( SG[nr][nc] != NONE ) {\n int k = SG[nr][nc];\n bool f = ( ndir == 1 ) || ( ndir == 3 );\n if ( ( nsteps / k ) % 2 == 1 ) f = !f;\n if ( ! f ) continue;\n }\n if ( V[nsteps][ndir][nr][nc] ) continue;\n V[nsteps][ndir][nr][nc] = true;\n NODE next( II( nsteps, ndir ), II( nr, nc ) );\n Q.push( next );\n }\n\n }\n \n return -1;\n}\n\nint main() {\n while ( cin >> h >> w ) {\n if ( w == 0 && h == 0 ) break;\n init();\n input();\n cout << solve() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2328,
"score_of_the_acc": -0.372,
"final_rank": 10
},
{
"submission_id": "aoj_0194_386821",
"code_snippet": "#include<cstdio>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int dx[]={1,0,-1,0},dy[]={0,-1,0,1};\n\nstruct edge{ int x1,y1,x2,y2,cost; };\n\nint h,w,d;\nint sig[20][20]; // 交差点 [y][x] にある信号の周期\nint n_ban,n_jam;\nedge ban[800],jam[800];\nint sx,sy,gx,gy;\n\nint solve(){\n\tstatic bool dp[101][20][20][4];\n\trep(t,101) rep(i,h) rep(j,w) rep(k,4) dp[t][i][j][k]=false;\n\tdp[0][sy][sx][0]=true;\n\trep(t,101) rep(i,h) rep(j,w) rep(k,4) {\n\t\tif(!dp[t][i][j][k]) continue;\n\t\tif(sig[i][j]!=0 && t/sig[i][j]%2==k%2) continue; // 信号が赤ならそこで打ち止め\n\n\t\trep(k2,4) if((k-k2+4)%4!=2) { // k2 方向に進む\n\t\t\tint i2=i+dy[k2],j2=j+dx[k2];\n\t\t\tif(0<=i2 && i2<h && 0<=j2 && j2<w){\n\t\t\t\t// 道路が封鎖されていたらそこで打ち止め\n\t\t\t\tbool isban=false;\n\t\t\t\trep(l,n_ban){\n\t\t\t\t\tif(ban[l].x1==j && ban[l].y1==i && ban[l].x2==j2 && ban[l].y2==i2\n\t\t\t\t\t|| ban[l].x2==j && ban[l].y2==i && ban[l].x1==j2 && ban[l].y1==i2) isban=true;\n\t\t\t\t}\n\t\t\t\tif(isban) continue;\n\n\t\t\t\tint t_jam=0;\n\t\t\t\trep(l,n_jam){\n\t\t\t\t\tif(jam[l].x1==j && jam[l].y1==i && jam[l].x2==j2 && jam[l].y2==i2\n\t\t\t\t\t|| jam[l].x2==j && jam[l].y2==i && jam[l].x1==j2 && jam[l].y1==i2) t_jam=jam[l].cost;\n\t\t\t\t}\n\n\t\t\t\tint t2=t+d+t_jam;\n\t\t\t\tif(t2<=100){\n\t\t\t\t\tdp[t2][i2][j2][k2]=true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\trep(t,101) rep(k,4) if(dp[t][gy][gx][k]) return t;\n\treturn -1;\n}\n\nint main(){\n\tchar a;\n\tint b;\n\tfor(;scanf(\"%d%d%d\",&h,&w,&d),h;){\n\t\trep(i,h) rep(j,w) sig[i][j]=0; // 0 なら信号がない\n\n\t\tint n_sig; scanf(\"%d\",&n_sig);\n\t\trep(i,n_sig){\n\t\t\tint t;\n\t\t\tscanf(\" %c%*c%d%d\",&a,&b,&t);\n\t\t\tsig[a-'a'][b-1]=t;\n\t\t}\n\n\t\tscanf(\"%d\",&n_ban);\n\t\trep(i,n_ban){\n\t\t\tscanf(\" %c%*c%d\",&a,&b);\n\t\t\tban[i].x1=b-1;\n\t\t\tban[i].y1=a-'a';\n\t\t\tscanf(\" %c%*c%d\",&a,&b);\n\t\t\tban[i].x2=b-1;\n\t\t\tban[i].y2=a-'a';\n\t\t}\n\n\t\tscanf(\"%d\",&n_jam);\n\t\trep(i,n_jam){\n\t\t\tint t;\n\t\t\tscanf(\" %c%*c%d\",&a,&b);\n\t\t\tjam[i].x1=b-1;\n\t\t\tjam[i].y1=a-'a';\n\t\t\tscanf(\" %c%*c%d%d\",&a,&b,&t);\n\t\t\tjam[i].x2=b-1;\n\t\t\tjam[i].y2=a-'a';\n\t\t\tjam[i].cost=t;\n\t\t}\n\n\t\t{\n\t\t\tscanf(\" %c%*c%d\",&a,&b);\n\t\t\tsx=b-1;\n\t\t\tsy=a-'a';\n\t\t\tscanf(\" %c%*c%d\",&a,&b);\n\t\t\tgx=b-1;\n\t\t\tgy=a-'a';\n\t\t}\n\n\t\tprintf(\"%d\\n\",solve());\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_0191_cpp
|
苗木
植物学者のサトー博士は苗木用の特殊肥料を何種類も発明しました。その肥料を苗木に与えると、瞬く間に苗木の大きさが変わります。
但し、肥料に以下のように副作用があることが判明しました。
1 回目に与えた肥料だけでは、苗木の大きさが変わりません。
2 回目以降は、その回に与えた肥料と、その直前に与えた肥料との組み合わせによって苗木に影響を与えます。良い影響を与えると苗木が伸び、悪い影響を与えると苗木が縮んでしまうこともあります。
試しに、サトー博士は 3 種類の肥料 (肥料 1、2、3) に対し、ある時点で与えた肥料 (今回の肥料) とその直前に与えた肥料 (直前の肥料) の組み合わせによる苗木の成長度合いを調べ、以下の「成長度表」を作成しました。
右表の 1 行目は今回与える肥料の番号で、1 列目はその直前に与えた肥料の番号です。他の数字は直前に与えた肥料と今回与える肥料の組み合わせによる苗木の成長度 (成長後対成長前の大きさの比率) を示します。成長度 > 1.0 の場合は苗木が伸びる、成長度 < 1.0 の場合は苗木が縮むことを示します。例えば肥料 1 の後に肥料 2 を与えると苗木の大きさが 3 倍になるが、肥料 1 の後に肥料 3 を与えると苗木の大きさが半分に縮んでしまいます。
苗木に与える肥料の回数が制限された場合、苗木をできるだけ大きく育てるにはどの肥料をどのような順で与えればよいでしょうか?「成長度表」がその答え教えてくれます。例として上の表にある肥料を 3 回だけ与える場合、以下のように肥料 3 → 肥料 1 → 肥料 2 の順にあげると最も苗木が成長します。
1 回目の肥料 (肥料 3) では苗木の大きさは変わりません。
2 回目の肥料 (肥料 1) では、表より肥料 3 後の肥料 1 での成長度が 3.0 なので、苗木の大きさは前回の 3.0 倍になります。
3 回目の肥料 (肥料 2) では、表より肥料 1 後の肥料 2 での成長度が 3.0 なので、苗木の大きさはさらに前回の 3.0 倍で、最初の 3.0 × 3.0 の 9.0 倍になります。
今度は、サトー博士は発明した
n
種類の肥料を全部調べて、上のような「成長度表」を作りあげましたが、非常に大きな表になってしまい、肥料の種類と与える順番を決めるのに大変苦労しています。
そこで博士に代わり、
n
種類の肥料の組み合わせによる苗木の「成長度表」中の成長度値部分を入力とし、肥料を
m
回与えた後の最大の苗木の大きさを求めるプログラムを作成してください。ただし、初めの苗木の大きさを 1 とし、1 回目に与える肥料の成長度はどの肥料でも 1.0 とします。なお、肥料は 1 から
n
まで番号付けされています。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。 各データセットは以下の形式で与えられます。
n
m
g
11
g
12
...
g
1n
g
21
g
22
...
g
2n
:
g
n1
g
n2
...
g
nn
1 行目に肥料の種類数
n
(2 ≤
n
≤ 100)、 肥料を与える回数
m
(1 ≤
m
≤ 100) が与えられます。
続く
n
行に、肥料
i
の後に肥料
j
を与えた時の苗木の成長度
g
ij
(0.0 ≤
g
ij
≤ 10.0, 実数) が与えられます。
データセットの数は 20 を超えません。
Output
データセット毎に、最大の苗木の大きさを１行に出力します。出力する苗木の大きさは、小数点第 3 位を四捨五入して、小数点第 2 位まで求めてください。
Sample Input
3 3
1.3 3.0 0.5
2.4 2.1 1.0
3.0 0.8 1.2
2 2
1.0 1.0
1.0 1.0
0 0
Output for the Sample Input
9.00
1.00
|
[
{
"submission_id": "aoj_0191_8861875",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\ndouble solve(int times, int prev) {\n if (times == m)\n return dp[times][prev] = 1;\n if (dp[times][prev] != -1)\n return dp[times][prev];\n double tmp = -1;\n for (int i = 0; i < n; i++) {\n if (times == 0) {\n tmp = max(tmp, solve(times + 1, i) * 1);\n } else {\n tmp = max(tmp, solve(times + 1, i) * t[prev][i]);\n }\n }\n return dp[times][prev] = tmp;\n}\nint main(void) {\n while (cin >> n >> m) {\n if (!(n | m))\n break;\n fill((double *)dp, (double *)dp + 101 * 101, -1);\n int ret;\n double retd;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3380,
"score_of_the_acc": -0.2871,
"final_rank": 9
},
{
"submission_id": "aoj_0191_8861872",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\ndouble solve(int times, int prev) {\n if (dp[times][prev] != -1)\n return dp[times][prev];\n if (times == m)\n return dp[times][prev] = 1;\n double tmp = -1;\n // Move the condition check outside the loop\n if (times == 0) {\n for (int i = 0; i < n; i++) {\n tmp = max(tmp, solve(times + 1, i));\n }\n } else {\n for (int i = 0; i < n; i++) {\n tmp = max(tmp, solve(times + 1, i) * t[prev][i]);\n }\n }\n return dp[times][prev] = tmp;\n}\nint main(void) {\n while (cin >> n >> m) {\n if (!(n | m))\n break;\n fill((double *)dp, (double *)dp + 101 * 101, -1);\n int ret;\n double retd;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3328,
"score_of_the_acc": -0.1584,
"final_rank": 3
},
{
"submission_id": "aoj_0191_8837161",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nconst int MAX_N = 101;\n\nint n, m;\ndouble dp[MAX_N][MAX_N];\ndouble t[MAX_N][MAX_N];\n\ndouble solve(int times, int prev) {\n // Check if the probability has already been calculated\n if (dp[times][prev] >= 0)\n return dp[times][prev];\n\n // Base case: reach the maximum number of steps\n if (times == m)\n return dp[times][prev] = 1;\n\n double maxProb = -1;\n for (int i = 0; i < n; i++) {\n double prob;\n if (times == 0) {\n prob = solve(times + 1, i) * 1;\n } else {\n prob = solve(times + 1, i) * t[prev][i];\n }\n maxProb = max(maxProb, prob);\n }\n\n // Store the calculated probability in the dp array for future use\n return dp[times][prev] = maxProb;\n}\n\nint main(void) {\n while (cin >> n >> m) {\n if (n == 0 && m == 0)\n break;\n\n // Initialize only the portion of the dp array that is used\n for (int i = 0; i <= m; i++) {\n for (int j = 0; j < n; j++) {\n dp[i][j] = -1;\n }\n }\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n\n double maxProb = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(maxProb) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3456,
"score_of_the_acc": -0.4752,
"final_rank": 12
},
{
"submission_id": "aoj_0191_8837160",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nconst int MAX_N = 101;\n\nint n, m;\ndouble dp[MAX_N][MAX_N];\ndouble t[MAX_N][MAX_N];\n\ndouble calculate(int n, int m) {\n double dp[MAX_N][MAX_N];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n dp[i][j] = -1;\n }\n }\n\n for (int times = m; times >= 0; times--) {\n for (int prev = 0; prev < n; prev++) {\n if (times == m) {\n dp[times][prev] = 1;\n } else {\n double tmp = -1;\n for (int i = 0; i < n; i++) {\n if (times == 0) {\n tmp = max(tmp, dp[times + 1][i] * 1);\n } else {\n tmp = max(tmp, dp[times + 1][i] * t[prev][i]);\n }\n }\n dp[times][prev] = tmp;\n }\n }\n }\n\n return dp[0][0];\n}\n\nint main(void) {\n while (cin >> n >> m) {\n if (!(n | m))\n break;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n double result = calculate(n, m) * 100;\n printf(\"%.2lf\\n\", round(result) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3296,
"score_of_the_acc": -0.0792,
"final_rank": 2
},
{
"submission_id": "aoj_0191_8837157",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint n, m;\ndouble** dp;\ndouble** t;\n\ndouble solve(int times, int prev) {\n if (dp[times][prev] != -1)\n return dp[times][prev];\n\n if (times == m)\n return dp[times][prev] = 1;\n\n double tmp = -1;\n\n if (times == 0) {\n for (int i = 0; i < n; i++) {\n tmp = max(tmp, solve(times + 1, i) * 1);\n }\n } else {\n for (int i = 0; i < n; i++) {\n tmp = max(tmp, solve(times + 1, i) * t[prev][i]);\n }\n }\n\n return dp[times][prev] = tmp;\n}\n\nint main(void) {\n while (cin >> n >> m) {\n if (!(n | m))\n break;\n\n // Allocate memory for dp and t arrays\n dp = new double*[m + 1];\n t = new double*[n];\n for (int i = 0; i <= m; i++) {\n dp[i] = new double[n];\n fill(dp[i], dp[i] + n, -1);\n }\n for (int i = 0; i < n; i++) {\n t[i] = new double[n];\n }\n\n int ret;\n double retd;\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n\n retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n\n // Free memory for dp and t arrays\n for (int i = 0; i <= m; i++) {\n delete[] dp[i];\n }\n delete[] dp;\n for (int i = 0; i < n; i++) {\n delete[] t[i];\n }\n delete[] t;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3368,
"score_of_the_acc": -0.2574,
"final_rank": 8
},
{
"submission_id": "aoj_0191_8819566",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\n\ndouble solve(unsigned short int times, unsigned short int prev) {\n if (dp[times][prev] != -1)\n return dp[times][prev];\n if (times == m)\n return dp[times][prev] = 1;\n double max_val = -1.0, tmp;\n for (unsigned short int i = 0; i < n; i++) {\n if (times == 0) {\n tmp = solve(times + 1, i);\n } else {\n tmp = solve(times + 1, i) * t[prev][i];\n }\n max_val = max(max_val, tmp);\n }\n return dp[times][prev] = max_val;\n}\n\nint main(void) {\n while (cin >> n >> m) {\n if (!(n | m))\n break;\n fill((double *)dp, (double *)dp + 101 * 101, -1);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n double retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3328,
"score_of_the_acc": -0.1584,
"final_rank": 3
},
{
"submission_id": "aoj_0191_8664720",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <map>\n#include <cmath>\n#include <queue>\n#include <string>\n#include <set>\n#include <stack>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\nusing ll = long long;\n\nvoid solve(int n, int m){\n vector<vector<double>> g(n, vector<double>(n));\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n cin >> g[i][j];\n\n vector<vector<double>> dp(m + 1, vector<double>(n, -1e6));\n for (int i = 0; i < n; i++)dp[0][i] = 0;\n for (int i = 0; i < n; i++)dp[1][i] = 1;\n\n for (int i = 1; i < m; i++) {\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][k] * g[k][j]);\n }\n }\n }\n\n double ans = 0;\n for (int i = 0; i < n; i++) {\n ans = max(ans, dp[m][i]);\n }\n printf(\"%.2f\\n\",ans);\n}\nint main() {\n while(true){\n int n,m;\n cin >> n >> m;\n if(n == 0 && m == 0)break;\n solve(n,m);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3588,
"score_of_the_acc": -0.802,
"final_rank": 17
},
{
"submission_id": "aoj_0191_8664312",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <map>\n#include <cmath>\n#include <queue>\n#include <string>\n#include <set>\n#include <stack>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\nusing ll = long long;\n\nint main() {\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0)break;\n vector<vector<double>> g(n, vector<double>(n));\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n cin >> g[i][j];\n\n vector<vector<double>> dp(m + 1, vector<double>(n, -1e6));\n for (int i = 0; i < n; i++)dp[0][i] = 0;\n for (int i = 0; i < n; i++)dp[1][i] = 1;\n\n for (int i = 1; i < m; i++) {\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][k] * g[k][j]);\n }\n }\n }\n\n double ans = 0;\n for (int i = 0; i < n; i++) {\n ans = max(ans, dp[m][i]);\n }\n printf(\"%.2f\\n\",ans);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3632,
"score_of_the_acc": -0.9109,
"final_rank": 19
},
{
"submission_id": "aoj_0191_8664227",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n while(true)\n\t{\n\t\tint N,M;cin>>N>>M;\n\t\tif(N==0)return 0;\n\t\tvector<vector<double>>A(N,vector<double>(N));\n\t\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>A[i][j];\n\t\tvector<vector<double>>dp(M+1,vector<double>(N,0));\n\t\tfor(int i=0;i<N;i++)dp[1][i]=1;\n\t\tfor(int i=2;i<=M;i++)\n\t\t{\n\t\t\tfor(int j=0;j<N;j++)\n\t\t\t{\n\t\t\t\tfor(int k=0;k<N;k++)\n\t\t\t\t{\n\t\t\t\t\tdp[i][j]=max(dp[i][j],dp[i-1][k]*A[j][k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<fixed<<setprecision(2);\n\t\tcout<<*max_element(dp[M].begin(),dp[M].end())<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3668,
"score_of_the_acc": -1,
"final_rank": 20
},
{
"submission_id": "aoj_0191_8664215",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n while(true)\n\t{\n\t\tint N,M;cin>>N>>M;\n\t\tif(N==0)return 0;\n\t\tvector<vector<double>>A(N,vector<double>(N));\n\t\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>A[i][j];\n\t\tvector<vector<double>>dp(M+1,vector<double>(N,0));\n\t\tfor(int i=0;i<N;i++)dp[1][i]=1;\n\t\tfor(int i=2;i<=M;i++)\n\t\t{\n\t\t\tfor(int j=0;j<N;j++)\n\t\t\t{\n\t\t\t\tfor(int k=0;k<N;k++)\n\t\t\t\t{\n\t\t\t\t\tdp[i][j]=max(dp[i][j],dp[i-1][k]*A[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<fixed<<setprecision(2);\n\t\tcout<<*max_element(dp[M].begin(),dp[M].end())<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3600,
"score_of_the_acc": -0.8317,
"final_rank": 18
},
{
"submission_id": "aoj_0191_8664202",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <iomanip>\nusing namespace std;\nint main()\n{\n while(true)\n\t{\n\t\tint N,M;cin>>N>>M;\n\t\tif(N==0)return 0;\n\t\tvector<vector<double> >A(N,vector<double>(N));\n\t\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>A[i][j];\n\t\tvector<vector<double> >dp(M+1,vector<double>(N,0));\n\t\tfor(int i=0;i<N;i++)dp[1][i]=1;\n\t\tfor(int i=2;i<=M;i++)\n\t\t{\n\t\t\tfor(int j=0;j<N;j++)\n\t\t\t{\n\t\t\t\tfor(int k=0;k<N;k++)\n\t\t\t\t{\n\t\t\t\t\tdp[i][j]=max(dp[i][j],dp[i-1][k]*A[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<fixed<<setprecision(2);\n\t\tcout<<*max_element(dp[M].begin(),dp[M].end())<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3504,
"score_of_the_acc": -0.5941,
"final_rank": 15
},
{
"submission_id": "aoj_0191_8214501",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\n\ndouble solve(int times, int prev) {\n if (dp[times][prev] > -0.5)\n return dp[times][prev];\n if (times == m)\n return dp[times][prev] = 1;\n double tmp = 0;\n for (int i = 0; i < n; i++) {\n tmp = max(tmp, solve(times + 1, i) * (times == 0 ? 1 : t[prev][i]));\n }\n return dp[times][prev] = tmp;\n}\n\nint main(void) {\n while (cin >> n >> m && (n || m)) {\n fill((double *)dp, (double *)dp + 101 * 101, -1);\n double retd;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3360,
"score_of_the_acc": -0.2376,
"final_rank": 6
},
{
"submission_id": "aoj_0191_8214496",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\n\ndouble solve(int times, int prev) {\n if (dp[times][prev] > -0.5)\n return dp[times][prev];\n if (times == m)\n return dp[times][prev] = 1;\n double tmp = 0;\n for (int i = 0; i < n; i++) {\n tmp = max(tmp, solve(times + 1, i) * (times ? t[prev][i] : 1));\n }\n return dp[times][prev] = tmp;\n}\n\nint main(void) {\n while (cin >> n >> m && (n || m)) {\n fill(*dp, *dp + 101 * 101, -1);\n int ret;\n double retd;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n cin >> t[i][j];\n retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3404,
"score_of_the_acc": -0.3465,
"final_rank": 10
},
{
"submission_id": "aoj_0191_8214495",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\n\ndouble solve(int times, int prev) {\n if (times == m)\n return dp[times][prev] = 1;\n if (dp[times][prev] != -1)\n return dp[times][prev];\n \n double tmp = -1;\n for (int i = 0; i < n; i++) {\n double cost = (times == 0) ? 1 : t[prev][i];\n tmp = max(tmp, solve(times + 1, i) * cost);\n }\n return dp[times][prev] = tmp;\n}\nint main(void) {\n while (cin >> n >> m, n | m) {\n fill((double *)dp, (double *)dp + 101 * 101, -1);\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n cin >> t[i][j];\n \n double result = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(result) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3404,
"score_of_the_acc": -0.3465,
"final_rank": 10
},
{
"submission_id": "aoj_0191_8214493",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\n\ndouble solve(int times, int prev) {\n if (times == m) return 1;\n if (dp[times][prev] != -1) return dp[times][prev];\n \n double tmp = -1;\n for (int i = 0; i < n; i++) {\n tmp = max(tmp, solve(times + 1, i) * (times == 0 ? 1 : t[prev][i]));\n }\n\n return dp[times][prev] = tmp;\n}\n\nint main(void) {\n while (cin >> n >> m && (n | m)) {\n fill(&dp[0][0], &dp[0][0] + sizeof(dp) / sizeof(double), -1);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n\n double retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3360,
"score_of_the_acc": -0.2376,
"final_rank": 6
},
{
"submission_id": "aoj_0191_8214488",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\ndouble solve(int times, int prev) {\n if (dp[times][prev] != -1)\n return dp[times][prev];\n if (times == m)\n return dp[times][prev] = 1;\n double tmp = -1;\n for (int i = 0; i < n; i++) {\n if (times == 0) {\n tmp = max(tmp, solve(times + 1, i) * 1);\n } else {\n tmp = max(tmp, solve(times + 1, i) * t[prev][i]);\n }\n }\n return dp[times][prev] = tmp;\n}\nint main(void) {\n while (cin >> n >> m) {\n if (!(n | m))\n break;\n fill((double *)dp, (double *)dp + 101 * 101, -1);\n int ret;\n double retd;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3484,
"score_of_the_acc": -0.5446,
"final_rank": 14
},
{
"submission_id": "aoj_0191_8207198",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\ndouble solve(int times, int prev) {\n if (dp[times][prev] != -1)\n return dp[times][prev];\n if (times == m)\n return dp[times][prev] = 1;\n double tmp = -1;\n for (int i = 0; i < n; i++) {\n if (times == 0) {\n tmp = max(tmp, solve(times + 1, i) * 1);\n } else {\n tmp = max(tmp, solve(times + 1, i) * t[prev][i]);\n }\n }\n return dp[times][prev] = tmp;\n}\nint main(void) {\n while (cin >> n >> m) {\n if (!(n | m))\n break;\n fill((double *)dp, (double *)dp + 101 * 101, -1);\n double ret;\n double retd;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n retd = solve(0, 0) * 100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3468,
"score_of_the_acc": -0.505,
"final_rank": 13
},
{
"submission_id": "aoj_0191_8114912",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint n, m;\ndouble dp[101][101];\ndouble t[101][101];\ndouble solve(int times, int prev) {\n if (dp[times][prev] != -1)\n return dp[times][prev];\n if (times == m)\n return dp[times][prev] = 1;\n double tmp = -1;\n for (int i = 0; i < n; i++) {\n if (times == 0) {\n tmp = max(tmp, solve(times + 1, i) * 1);\n } else if (dp[times + 1][i] != -1){\n tmp = max(tmp, dp[times + 1][i] * t[prev][i]);\n } else {\n tmp = max(tmp, solve(times + 1, i) * t[prev][i]);\n }\n }\n return dp[times][prev] = tmp;\n}\nint main(void) {\n while (cin >> n >> m) {\n if (!(n | m))\n break;\n fill((double *)dp, (double *)dp + 101 * 101, -1);\n int ret;\n double retd;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n }\n }\n for(int i=m-1;i>=0;--i){\n for(int j=0;j<n;++j){\n solve(i,j);\n }\n }\n retd = dp[0][0]*100;\n printf(\"%.2lf\\n\", round(retd) / 100);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3348,
"score_of_the_acc": -0.2079,
"final_rank": 5
},
{
"submission_id": "aoj_0191_7456249",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n, m;\ndouble g[110][110], memo[110][110];\ndouble dp(int mae, int sum){\n if(sum == 0) return 1.0;\n if(memo[mae][sum]>0) return memo[mae][sum];\n double res = 0.0;\n for(int i=1;i<=n;i++){\n res = max(res, dp(i, sum-1)*g[mae][i]);\n }\n return memo[mae][sum] = res;\n}\nint main(){\n while(cin >> n >> m, n!=0){\n for(int i=1;i<=n;i++) g[0][i] = 1.0;\n for(int i=1;i<=n;i++){\n for(int j=1;j<=n;j++) cin >> g[i][j];\n }\n fill_n(*memo, 110*110, 0.0);\n printf(\"%.2f\\n\", dp(0, m));\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3264,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0191_6961425",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n, m;\n while(cin >> n >> m, n){\n vector<vector<double>> A(n, vector<double>(n)), dp(m, vector<double>(n));\n for(int y = 0; y < n; y++){\n for(int x = 0; x < n; x++){\n cin >> A[y][x];\n }\n }\n fill(dp[0].begin(), dp[0].end(), 1);\n for(int i = 0; i + 1 < m; i++){\n for(int j = 0; j < n; j++){\n for(int k = 0; k < n; k++){\n dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] * A[j][k]);\n }\n }\n }\n printf(\"%.2lf\\n\", *max_element(dp[m - 1].begin(), dp[m - 1].end()));\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3560,
"score_of_the_acc": -0.7327,
"final_rank": 16
}
] |
aoj_0208_cpp
|
病院の部屋番号
ウォーターデブンに住む建築家のデブンキーさんのもとに、古い大病院を改装する仕事の依頼が舞い込んできました。
国によっては忌み数(いみかず)として嫌われる数字を部屋番号に用いたくない人がいます(日本では 4 と 9 が有名です)。しかし、この病院の部屋番号は忌み数に関係なく、1 から順番に付けられていました。
それが気になったデブンキーさんは、機材やベッドの入れ替えが全て終わる前にウォーターデブンの忌み数である「4」と「6」を除いた数字で部屋番号を付けなおしてしまいました。しかし、入れ替え作業は旧部屋番号で計画していたので、残りの作業を確実に行うには旧部屋番号を新部屋番号に変換する必要があります。計算が苦手なデブンキーさんはこのことに気づいて愕然としています。
そんなデブンキーさんのために、旧部屋番号を入力とし対応する新部屋番号を出力するプログラムを作成してください。
15 番目までの部屋番号の対応表は以下のようになります。
旧部屋番号
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
新部屋番号
1
2
3
5
7
8
9
10
11
12
13
15
17
18
19
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットとして、旧部屋番号を表す整数
n
(1 ≤
n
≤ 1,000,000,000) が１行に与えられます。
データセットの数は 30000 を超えません。
Output
入力データセットごとに、新部屋番号を１行に出力します。
Sample Input
15
100
1000000000
3
0
Output for the Sample Input
19
155
9358757000
3
|
[
{
"submission_id": "aoj_0208_10850778",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nint main() {\n int n;\n while(cin >> n, n) {\n string res;\n while(n > 0) {\n int oct = n & 7;\n if(oct <= 3) {\n res += '0' + oct;\n } else if(4 == oct) {\n res += '0' + oct + 1;\n } else {\n res += '0' + oct + 2;\n }\n n >>= 3;\n }\n reverse(res.begin(), res.end());\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3324,
"score_of_the_acc": -0.494,
"final_rank": 17
},
{
"submission_id": "aoj_0208_7472102",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint hassin(int x){\n if(x==4) return 5;\n return x<4?x:x+2;\n}\nvoid dfs(int n){\n if(n == 0) return;\n dfs(n/8);\n cout << hassin(n%8);\n}\nint main(){\n int n;\n while(cin >> n, n!=0){\n dfs(n);\n cout << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3068,
"score_of_the_acc": -0.1208,
"final_rank": 7
},
{
"submission_id": "aoj_0208_6978057",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n;\n auto f = [&](ll v){\n string s = to_string(v);\n int n = s.size();\n vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(2, vector<ll>(2)));\n dp[0][1][0] = 1;\n for(int i = 0; i < n; i++){\n for(int j = 0; j < 2; j++){\n for(int k = 0; k < 2; k++){\n int r = j ? s[i] - '0': 9;\n for(int l = 0; l <= r; l++){\n dp[i + 1][j & (l == r)][k | (l == 4) | (l == 6)] += dp[i][j][k];\n }\n }\n }\n }\n return dp[n][1][0] + dp[n][0][0] - 1;\n };\n while(cin >> n, n){\n ll ng = 0, ok = 1ll << 40, mid;\n while(ng + 1 < ok){\n mid = (ng + ok) / 2;\n if(f(mid) >= n)ok = mid;\n else ng = mid;\n }\n cout << ok << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 820,
"memory_kb": 3400,
"score_of_the_acc": -1.6084,
"final_rank": 20
},
{
"submission_id": "aoj_0208_6833064",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(void){\n ll n;\n while(cin>>n,n){\n ll v[100]={0},c=0;\n while(n>0){\n v[c++]=n%8;\n n/=8;\n }\n while(c--){\n cout<<\"01235789\"[v[c]];\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3320,
"score_of_the_acc": -0.488,
"final_rank": 16
},
{
"submission_id": "aoj_0208_6642006",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nvoid ToOctalNumber(int n) {\n if (!n)\n return;\n ToOctalNumber(n >> 3);\n std ::cout << ((n & 7) < 4 ? n & 7 : (n & 7) == 4 ? 5 : (n & 7) + 2);\n}\n\nint main() {\n int n;\n while (std::cin >> n, n) {\n ToOctalNumber(n);\n std::cout << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3008,
"score_of_the_acc": -0.0304,
"final_rank": 4
},
{
"submission_id": "aoj_0208_5911929",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int64_t dp[10];\n dp[0] = 1;\n for (int i = 1; i <= 9; i++)\n dp[i] = dp[i - 1] * 8;\n while (true) {\n int n;\n cin >> n;\n if (!n)\n return 0;\n int64_t ans = 0;\n while (n) {\n for (int i = 9; i >= 0; i--) {\n int d = n / dp[i];\n if (d >= 5)\n ans += (d + 2) * pow(10, i);\n else if (d >= 4)\n ans += (d + 1) * pow(10, i);\n else if (d >= 1)\n ans += d * pow(10, i);\n n -= dp[i] * d;\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3660,
"score_of_the_acc": -1,
"final_rank": 18
},
{
"submission_id": "aoj_0208_5762225",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<sstream>\n#include<regex>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-10;\nsigned main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tstringstream ss;\n\t\tss<<oct<<n;\n\t\tfor(auto x:ss.str())\n\t\t\tcout<<\"01235789\"[x-'0'];\n\t\tcout<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3240,
"score_of_the_acc": -0.3798,
"final_rank": 15
},
{
"submission_id": "aoj_0208_4726252",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cmath>\n#include <algorithm>\n#include <sstream>\n\nint main() {\n\n while (true) {\n int n;\n std::cin >> n;\n\n if (n == 0) {\n break;\n }\n\n std::stringstream ss;\n ss << std::oct << n;\n std::string n_oct = ss.str();\n\n const int len = n_oct.length();\n\n std::string s = n_oct;\n std::replace(s.begin(), s.end(), '7', '9');\n std::replace(s.begin(), s.end(), '6', '8');\n std::replace(s.begin(), s.end(), '5', '7');\n std::replace(s.begin(), s.end(), '4', '5');\n\n std::cout << s << std::endl;\n }\n\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3160,
"score_of_the_acc": -0.2593,
"final_rank": 12
},
{
"submission_id": "aoj_0208_4453091",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n;\n string s = \"01235789\";\n while(cin >> n, n){\n string ans;\n while(n){\n ans += s[n%8];\n n /= 8;\n }\n reverse(ans.begin(),ans.end());\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3188,
"score_of_the_acc": -0.3015,
"final_rank": 14
},
{
"submission_id": "aoj_0208_4411294",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n#include<iomanip>\n\nusing namespace std;\n\nint m[8] = { 0,1,2,3,5,7,8,9 };\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\twhile (n)\n\t{\n\t\tstack<int> nums;\n\t\twhile (n)\n\t\t{\n\t\t\tnums.push(n % 8);\n\t\t\tn /= 8;\n\t\t}\n\t\twhile (!nums.empty())\n\t\t{\n\t\t\tcout << m[nums.top()];\n\t\t\tnums.pop();\n\t\t}\n\t\tcout << endl;\n\t\tcin >> n;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2996,
"score_of_the_acc": -0.0123,
"final_rank": 2
},
{
"submission_id": "aoj_0208_4338594",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nlong convert(long n);\n\nint main(void){\n long n;\n while(true){\n cin>>n;\n if(n==0)break;\n cout<<convert(n)<<endl;\n }\n return 0;\n}\n\nlong convert(long n){\n long order=1;\n long retval=0;\n while(n>0){\n int mod=n%8;\n if(mod>=5){\n mod+=2;\n }\n else if(mod>=4){\n mod+=1;\n }\n retval+=order*mod;\n n=n/8;\n order=order*10;\n }\n return retval;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3068,
"score_of_the_acc": -0.1084,
"final_rank": 6
},
{
"submission_id": "aoj_0208_4305945",
"code_snippet": "#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint TableNewOctal[] = { 0,1,2,3,5,7,8,9 };\nvector<int> Result;\n\nint main() {\n\tint num;\n\n\twhile (cin >> num, num) {\n\t\twhile (num > 0) {\n\t\t\tResult.push_back(TableNewOctal[num % 8]);\n\t\t\tnum /= 8;\n\t\t}\n\t\twhile (!Result.empty()) {\n\t\t\tcout << Result.back();\n\t\t\tResult.pop_back();\n\t\t}\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3092,
"score_of_the_acc": -0.1569,
"final_rank": 8
},
{
"submission_id": "aoj_0208_4162509",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(int i=0;i<(num);++i)\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=int>\nT in(){T x; cin >> x; return (x);}\ntemplate<typename T=int,typename C=vector<T>>\nC vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}\n\nvoid vout(){cout << endl;}\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}\nvoid out(){cout << endl;}\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tchar conv[8]={'0','1','2','3','5','7','8','9'};\n\twhile(true){\n\t\tint X=in();\n\t\tif(!X) break;\n\t\tvector<int> V;\n\t\twhile(X){\n\t\t\tV.push_back(X%8);\n\t\t\tX/=8;\n\t\t}\n\t\treverse(ALL(V));\n\t\tfor(auto& x:V) cout<<conv[x];\n\t\tout();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3144,
"score_of_the_acc": -0.2352,
"final_rank": 11
},
{
"submission_id": "aoj_0208_4082530",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nsigned main() {\n while (true) {\n int n;\n cin >> n;\n \n if (n==0) {\n break;\n }\n \n map<int, int> mp{{0,0}, {1,1}, {2,2}, {3,3}, {4,5}, {5,7}, {6,8}, {7,9}};\n \n int ans = 0;\n int c = 1;\n \n while (!(n<8)) {\n ans += mp[n%8]*c;\n n /= 8;\n c *= 10;\n }\n \n ans += mp[n]*c;\n \n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3004,
"score_of_the_acc": -0.0244,
"final_rank": 3
},
{
"submission_id": "aoj_0208_3872583",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tunsigned long long n, m;\n\n\tcin >> n;\n\n\twhile (n) {\n\t\tm = 0;\n\t\tunsigned long long i = 1;\n\n\t\twhile (n > 0) {\n\t\t\tunsigned long long t = n % 8;\n\t\t\tif (t < 4)\n\t\t\t\tm += t * i;\n\t\t\telse if (t == 4)\n\t\t\t\tm += 5 * i;\n\t\t\telse\n\t\t\t\tm += (t + 2) * i;\n\n\t\t\tn /= 8;\n\t\t\ti *= 10;\n\t\t}\n\n\t\tcout << m << endl;\n\n\t\tcin >> n;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3000,
"score_of_the_acc": -0.006,
"final_rank": 1
},
{
"submission_id": "aoj_0208_3861065",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint n[] = { 0,1,2,3,5,7,8,9 };\n\nint main() {\n\twhile(true){\n\tvector<int>v;\n\tlong long num;\n\tcin >> num;\n\tif (num == 0) return 0;\n\twhile (num >= 1) {\n\t\tv.push_back(n[num % 8]);\n\t\tnum /= 8;\n\t}\n\tfor (int i = v.size() - 1; i >= 0; i--) cout << v[i];\n\tcout << endl;\n}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3128,
"score_of_the_acc": -0.2111,
"final_rank": 10
},
{
"submission_id": "aoj_0208_3524480",
"code_snippet": "#include <iostream>\n#include <string>\n#define int long long\nusing namespace std;\nsigned main() {\n\tint a[10];\n\ta[0] = 0; a[1] = 1; a[2] = 2; a[3] = 3; a[4] = 5; a[5] = 7; a[6] = 8; a[7] = 9;\n\tint n;\n\twhile (cin >> n, n) {\n\t\tstring ans;\n\t\tint m = n;\n\t\twhile (m > 0) {\n\t\t\tans = (char)(a[m % 8] + '0') + ans;\n\t\t\tm /= 8;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3176,
"score_of_the_acc": -0.2834,
"final_rank": 13
},
{
"submission_id": "aoj_0208_3436635",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i, n) for(int i=0; i<(n); ++i)\n#define FOR(i, m, n) for(int i=(m); i<(n); ++i)\n#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define Cout(x) cout << (x) << endl\n#define Cout2(x, y) cout << (x) << \" \" << (y) << endl\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define forauto(i, a) for(auto i : a)cout << i << \" \"; puts(\"\");\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef vector<LL> VL;\ntypedef vector<string> VS;\ntypedef vector<bool> VB;\ntypedef vector<vector<int>> VVI;\ntypedef pair<int, int> PII;\nconst int inf = 1e9;\nconst double pi = acos(-1.0);\n\nstring convi(string s) {\n\tchar a[] = { '0','1','2','3','5','7','8','9' };\n\tstring ret;\n\tfor (auto c : s) {\n\t\tret += a[c - '0'];\n\t}\n\treturn ret;\n}\n\nint main() {\n\tint n;\n\twhile (cin >> n && n) {\n\t\tstringstream ss;\n\t\tss << oct << n;\n\t\tstring s = ss.str();\n\t\ts = convi(s);\n\t\tCout(s);\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3112,
"score_of_the_acc": -0.1994,
"final_rank": 9
},
{
"submission_id": "aoj_0208_3042824",
"code_snippet": "#include<iostream>\n#include<cstring>\nusing namespace std;\nstring s;\nlong dp[11][2][2];\nmain()\n{\n\tlong S;\n\twhile(cin>>S,S)\n\t{\n\t\tlong pre=0,ans=0;\n\t\twhile(1)\n\t\t{\n\t\t\ts=to_string(S+=ans-pre);\n\t\t\tpre=ans;\n\t\t\tfor(int i=0;i<=s.size();i++)for(int j=0;j<4;j++)dp[i][j/2][j%2]=0;\n\t\t\tdp[0][0][0]=1;\n\t\t\tfor(int i=0;i<s.size();i++)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<2;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int k=0;k<2;k++)\n\t\t\t\t\t{\n\t\t\t\t\t\tint lim=j?9:s[i]-'0';\n\t\t\t\t\t\tfor(int l=0;l<=lim;l++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tdp[i+1][j||(l<lim)][k||(l==4||l==6)]+=dp[i][j][k];\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\tans=dp[s.size()][0][1]+dp[s.size()][1][1];\n\t\t\tif(ans==pre)break;\n\t\t}\n\t\tcout<<S<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 660,
"memory_kb": 3232,
"score_of_the_acc": -1.1579,
"final_rank": 19
},
{
"submission_id": "aoj_0208_3015294",
"code_snippet": "// 0, 1, 2, 3, 5, 7, 8, 9を用いた8進表現に変換するだけ\n#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint ref[8] = {0, 1, 2, 3, 5, 7, 8, 9};\nint n;\n\nint main(){\n while(cin >> n, n){\n vector<int> decode;\n while(n != 0){\n decode.push_back(ref[n%8]);\n n /= 8;\n }\n\n reverse(decode.begin(), decode.end());\n for(int x : decode) cout << x;\n cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3032,
"score_of_the_acc": -0.0789,
"final_rank": 5
}
] |
aoj_0209_cpp
|
写真に写っている景色は?
A 君は会津に観光にやってきました。宿泊したホテルの窓からは会津盆地が一望できます。景色を眺めていると、床に写真の切れ端が落ちているのに気がつきました。どうやら窓から外の景色を撮ったようです。「どの辺りを撮ったのかな」と、A 君は窓の外の景色と写真が同じ大きさになるように写真をかざして、写真と窓の外の景色が一致する場所を探し始めました。
それでは、A 君がやっていることをコンピュータでやってみましょう。窓の外の景色を
n × n
マスの正方形に分割します (
n
を景色の大きさと呼びます)。各マスには、そのマスの画像の情報を表す 0 以上の整数が書かれています。マスの位置は座標 (
x, y
) で表します。各マスの座標は以下の通りになります。
写真の切れ端は、
m × m
マスの正方形で表されます (
m
を写真の切れ端の大きさと呼びます) 。この正方形の中で、切れ端の部分のマスには画像の情報が、切れ端に含まれない部分のマスには -1 が書かれています。たとえば、下図では、色が塗られている部分が実際の写真の切れ端の形を表しています。切れ端に穴が開いていることはありますが、必ず 1 つにつながっています。 (0 以上の値をもつマスが頂点だけで接しているときは、つながっていないものとみなします。) また、値 -1 のマスが縦または横 1 列に端から端まで並ぶことはありません。
窓から見える景色の中で、写真の切れ端を 0、90、180、270 度回転させたいずれかと一致する領域を探します。たとえば、景色が下図のように表わせるとき、上図の切れ端を反時計回りに90 度回転させると、色が塗られた領域に一致します。
窓から見える景色と写真の切れ端の情報を入力とし、景色の中で、切れ端を 0、90、180、270 度回転させたいずれかと一致する領域の最も上端に近いマスのうち、最も左端に近いマスの座標を出力するプログラムを作成してください。
一致する領域が複数ある場合は、それらの領域内にあるマスの中で、最も上端に近いマスのうち、最も左端に近いマスの座標を出力してください。一致する領域がないときは、NA と出力します。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
n
m
w
11
w
12
...
w
1n
w
21
w
22
...
w
2n
:
w
n1
w
n2
...
w
nn
p
11
p
12
...
p
1m
p
21
p
22
...
p
2m
:
p
m1
p
m2
...
p
mm
1 行目に
n, m
(1 ≤
n
≤ 100, 1 ≤
m
≤ 50,
m
≤
n
) が与えられます。
続く
n
行に窓から見える景色の情報
w
ij
(0 ≤
w
ij
≤ 15)、続く
m
行に写真の切れ端のデータの情報
p
ij
(-1 ≤
p
ij
≤ 15) が与えられます。
データセットの数は 100 を超えません。
Output
入力データセットごとに、マスの位置の座標または NA を１行に出力します。
Sample Input
8 4
2 1 3 1 1 5 1 3
2 3 2 4 1 0 2 1
0 3 1 2 1 1 4 2
1 2 3 2 1 1 5 4
0 2 0 1 1 3 2 1
1 3 1 2 2 4 3 2
5 1 2 1 4 1 1 5
4 1 1 0 1 2 2 1
2 -1 -1 -1
0 3 -1 -1
-1 2 2 4
-1 1 -1 1
5 3
1 0 2 3 5
2 3 7 2 1
2 5 4 2 2
8 9 0 3 3
3 6 0 4 7
-1 -1 2
-1 3 5
0 4 -1
0 0
Output for the Sample Input
4 2
NA
|
[
{
"submission_id": "aoj_0209_9646962",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint w[100][100], p[50][50], tmp[50][50], n, m;\n\nvoid turn() {\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < m; j++) tmp[i][j] = p[i][j];\n }\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < m; j++) p[i][j] = tmp[m - 1 - j][i];\n }\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n #ifdef BACKER\n freopen(\"input.txt\", \"r\", stdin);\n // freopen(\"output.txt\", \"w\", stdout);\n #endif\n\n while (cin >> n >> m && n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) cin >> w[i][j];\n }\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < m; j++) cin >> p[i][j];\n }\n pair<int, int> ans = {100, 100};\n for (int t = 0; t < 4; t++) {\n for (int i = 0; i < n - m + 1; i++) {\n for (int j = 0; j < n - m + 1; j++) {\n bool ok = 1;\n for (int k = 0; k < m; k++) {\n if (!ok) break;\n for (int l = 0; l < m; l++) {\n if (p[k][l] != -1 && p[k][l] != w[i + k][j + l]) ok = 0;\n }\n }\n if (!ok) continue;\n // cout << \"!!! \" << t << \" \" << i + 1 << \" \" << j + 1 << \"\\n\";\n for (int k = 0; k < m; k++) {\n for (int l = 0; l < m; l++) {\n if (p[k][l] != -1) {\n ans = min(ans, {i + k, j + l});\n break;\n }\n }\n }\n }\n }\n turn();\n }\n if (ans.first == 100) cout << \"NA\\n\";\n else cout << ans.second + 1 << \" \" << ans.first + 1 << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.3912,
"final_rank": 5
},
{
"submission_id": "aoj_0209_7941018",
"code_snippet": "#include <iostream>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define MAX 200\n#define INFTY (1 << 21)\nint n, m, T[MAX][MAX], P[MAX][MAX];\nvoid valid(int sx, int sy, int &lx, int &ly) {\n int ax = -1, ay;\n rep(y, m) rep(x, m) {\n if (P[x][y] == -1)\n continue;\n if (P[x][y] != T[sx + x][sy + y])\n return;\n if (ax == -1) {\n ay = y;\n ax = x;\n }\n }\n if (ay < ly || (ay == ly && ax < lx)) {\n ly = sy + ay;\n lx = sx + ax;\n }\n}\nbool rotate(int sx, int sy) {\n int tmp[MAX][MAX];\n int ly = INFTY, lx;\n rep(r, 4) {\n valid(sx, sy, lx, ly);\n rep(y, m) rep(x, m) tmp[x][y] = P[x][y];\n rep(y, m) rep(x, m) P[y][m - x - 1] = tmp[x][y];\n }\n if (ly == INFTY)\n return false;\n cout << lx + 1 << \" \" << ly + 1 << endl;\n return true;\n}\nvoid compute() {\n rep(y, n - m + 1) rep(x, n - m + 1) if (rotate(x, y)) return;\n cout << \"NA\" << endl;\n}\nmain() {\n while (cin >> n >> m && n) {\n rep(y, n) rep(x, n) cin >> T[x][y];\n rep(y, m) rep(x, m) cin >> P[x][y];\n compute();\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3180,
"score_of_the_acc": -0.6277,
"final_rank": 13
},
{
"submission_id": "aoj_0209_7941017",
"code_snippet": "#include <cstdio>\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define MAX 200\n#define INFTY (1 << 21)\nint n, m, T[MAX][MAX], P[MAX][MAX];\nvoid valid(int sx, int sy, int &lx, int &ly) {\n int ax = -1, ay;\n rep(y, m) rep(x, m) {\n if (P[x][y] == -1)\n continue;\n if (P[x][y] != T[sx + x][sy + y])\n return;\n if (ax == -1) {\n ay = y;\n ax = x;\n }\n }\n if (ay < ly || (ay == ly && ax < lx)) {\n ly = sy + ay;\n lx = sx + ax;\n }\n}\nbool rotate(int sx, int sy) {\n int tmp[MAX][MAX];\n int ly = INFTY, lx;\n rep(r, 4) {\n valid(sx, sy, lx, ly);\n rep(y, m) rep(x, m) tmp[x][y] = P[x][y];\n rep(y, m) rep(x, m) P[y][m - x - 1] = tmp[x][y];\n }\n if (ly == INFTY)\n return false;\n printf(\"%d %d\\n\", lx + 1, ly + 1);\n return true;\n}\nvoid compute() {\n rep(y, n - m + 1) rep(x, n - m + 1) if (rotate(x, y)) return;\n printf(\"NA\\n\");\n}\nmain() {\n while (scanf(\"%d %d\", &n, &m) && n) {\n rep(y, n) rep(x, n) scanf(\"%d\", &T[x][y]);\n rep(y, m) rep(x, m) scanf(\"%d\", &P[x][y]);\n compute();\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 2784,
"score_of_the_acc": -0.3365,
"final_rank": 3
},
{
"submission_id": "aoj_0209_7941016",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\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()\nconst double PI = acos(-1);\nconst double EPS = 1e-10;\nconst int inf = 1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\nint main() {\n int n, m;\n while (cin >> n >> m, n) {\n vvi in(n, vi(n));\n vvi pic(m, vi(m));\n rep(i, n) rep(j, n) cin >> in[i][j];\n rep(i, m) rep(j, m) cin >> pic[i][j];\n pii out(inf, inf);\n rep(e, 4) {\n rep(i, n - m + 1) rep(j, n - m + 1) {\n bool h = true;\n pii t(inf, inf);\n rep(k, m)\n rep(l, m) if (pic[k][l] != -1 && in[i + k][j + l] != pic[k][l]) h =\n false;\n else if (pic[k][l] != -1) t = min(t, pii(i + k, j + l));\n if (h) {\n out = min(out, t);\n }\n }\n vvi tmp = pic;\n rep(i, m) rep(j, m) pic[i][j] = tmp[j][m - i - 1];\n }\n if (out.first == inf)\n cout << \"NA\" << endl;\n else\n cout << out.second + 1 << \" \" << out.first + 1 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 3204,
"score_of_the_acc": -1.1605,
"final_rank": 19
},
{
"submission_id": "aoj_0209_7941015",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\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()\nconst double PI = acos(-1);\nconst double EPS = 1e-10;\nconst int inf = 1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\nint main() {\n int n, m;\n while (cin >> n >> m, n) {\n vvi in(n, vi(n));\n vvi pic(m, vi(m));\n rep(i, n) rep(j, n) cin >> in[i][j];\n rep(i, m) rep(j, m) cin >> pic[i][j];\n pii out(inf, inf);\n rep(e, 4) {\n rep(i, n - m + 1) rep(j, n - m + 1) {\n pii t(inf, inf);\n rep(k, m) rep(l, m) if (pic[k][l] != -1 &&\n in[i + k][j + l] != pic[k][l]) goto en;\n else if (pic[k][l] != -1) t = min(t, pii(i + k, j + l));\n out = min(out, t);\n goto end;\n en:;\n }\n end:;\n vvi tmp = pic;\n rep(i, m) rep(j, m) pic[i][j] = tmp[j][m - i - 1];\n }\n if (out.first == inf)\n cout << \"NA\" << endl;\n else\n cout << out.second + 1 << \" \" << out.first + 1 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3204,
"score_of_the_acc": -0.4635,
"final_rank": 7
},
{
"submission_id": "aoj_0209_7941013",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\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()\nconst double PI = acos(-1);\nconst double EPS = 1e-10;\nconst int inf = 1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\nint main() {\n int n, m;\n while (scanf(\"%d %d\", &n, &m), n) {\n vvi in(n, vi(n));\n vvi pic(m, vi(m));\n rep(i, n) rep(j, n) scanf(\"%d\", &in[i][j]);\n rep(i, m) rep(j, m) scanf(\"%d\", &pic[i][j]);\n pii out(inf, inf);\n rep(e, 4) {\n rep(i, n - m + 1) rep(j, n - m + 1) {\n pii t(inf, inf);\n rep(k, m) rep(l, m) if (pic[k][l] != -1 &&\n in[i + k][j + l] != pic[k][l]) goto en;\n else if (pic[k][l] != -1) t = min(t, pii(i + k, j + l));\n out = min(out, t);\n goto end;\n en:;\n }\n end:;\n vvi tmp = pic;\n rep(i, m) rep(j, m) pic[i][j] = tmp[j][m - i - 1];\n }\n if (out.first == inf)\n cout << \"NA\" << endl;\n else\n cout << out.second + 1 << \" \" << out.first + 1 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3264,
"score_of_the_acc": -0.4471,
"final_rank": 6
},
{
"submission_id": "aoj_0209_7941010",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\n#define rep(i, a, n) for (int i = a; i < n; i++)\nint pic[50][50];\nint all[100][100];\nint n, m;\nvoid rotate() {\n rep(i, 0, m) rep(j, 0, i) swap(pic[i][j], pic[j][i]);\n rep(i, 0, m) reverse(pic[i], pic[i] + m);\n}\nint main() {\n bool flag = 0;\n int X, Y, f_x, f_y, first;\n while (cin >> n >> m && n && m) {\n X = Y = (1 << 21);\n rep(i, 0, n) rep(j, 0, n) { cin >> all[i][j]; }\n rep(i, 0, m) rep(j, 0, m) { cin >> pic[i][j]; }\n rep(y, 0, n - m + 1) {\n rep(x, 0, n - m + 1) {\n rep(b, 0, 4) {\n first = flag = true;\n rep(i, 0, m) rep(j, 0, m) {\n if (pic[i][j] == -1)\n continue;\n if (pic[i][j] != all[y + i][x + j]) {\n flag = false;\n } else if (first) {\n f_y = y + i;\n f_x = x + j;\n first = false;\n }\n }\n if (flag) {\n if (f_y < Y) {\n Y = f_y;\n X = f_x;\n } else if (f_y == Y) {\n if (f_x < X) {\n X = f_x;\n }\n }\n }\n rotate();\n }\n }\n }\n if (X == (1 << 21))\n cout << \"NA\" << endl;\n else\n cout << X + 1 << \" \" << Y + 1 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 3132,
"score_of_the_acc": -1.1379,
"final_rank": 18
},
{
"submission_id": "aoj_0209_7941009",
"code_snippet": "#include <iostream>\nusing namespace std;\nint f[100][100];\nint e[100][100];\nint main() {\n int n, m;\n while (cin >> n >> m && n) {\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n cin >> f[i][j];\n for (int i = 0; i < m; i++)\n for (int j = 0; j < m; j++)\n cin >> e[i][j];\n pair<int, int> ans(1e7, 1e7);\n for (int r = 0; r < 4; r++) {\n for (int i = 0; i < n - m + 1; i++) {\n for (int j = 0; j < n - m + 1; j++) {\n int flag = 1;\n int X = -1, Y;\n for (int k = 0; k < m; k++) {\n for (int l = 0; l < m; l++) {\n if (f[i + k][j + l] != e[k][l] && e[k][l] != -1) {\n flag = false;\n }\n if (e[k][l] != -1 && X == -1) {\n Y = i + k;\n X = j + l;\n }\n }\n }\n if (flag)\n ans = min(ans, make_pair(Y, X));\n }\n }\n for (int i = 0; i < m; i++)\n for (int j = i + 1; j < m; j++)\n swap(e[i][j], e[j][i]);\n for (int i = 0; i < m; i++)\n for (int j = 0; j < m / 2; j++)\n swap(e[i][j], e[i][m - j - 1]);\n }\n if (ans.first > 1e6)\n cout << \"NA\" << endl;\n else\n cout << ans.second + 1 << \" \" << ans.first + 1 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3132,
"score_of_the_acc": -0.9864,
"final_rank": 15
},
{
"submission_id": "aoj_0209_7941008",
"code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n#define reep(i, f, t) for (int i = f; i < int(t); ++i)\n#define rep(i, n) reep(i, 0, n)\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\npii fit(const vvi &window, const vvi &pic, int y, int x) {\n int m = pic.size();\n pii ans(-1, -1);\n rep(i, m) rep(j, m) {\n if (pic[i][j] == -1)\n continue;\n if (window[y + i][x + j] != pic[i][j]) {\n return pii(-1, -1);\n } else if (ans.first == -1)\n ans = pii(y + i, x + j);\n }\n return ans;\n}\nvoid rotate(vvi &p) {\n int m = p.size();\n vvi next(m, vi(m));\n rep(i, m) rep(j, m) next[i][j] = p[m - j - 1][i];\n p.swap(next);\n}\nint main() {\n int n, m;\n while (scanf(\"%d%d\", &n, &m), n) {\n vvi window(n, vi(n));\n rep(i, n) rep(j, n) scanf(\"%d\", &window[i][j]);\n vvi pic(m, vi(m));\n rep(i, m) rep(j, m) scanf(\"%d\", &pic[i][j]);\n pii ans(-1, -1);\n rep(i, n - m + 1) rep(j, n - m + 1) {\n rep(k, 4) {\n ans = fit(window, pic, i, j);\n if (ans.first != -1) {\n i = n - m + 1;\n j = n - m + 1;\n break;\n }\n rotate(pic);\n }\n }\n if (ans.first == -1)\n puts(\"NA\");\n else\n printf(\"%d %d\\n\", ans.second + 1, ans.first + 1);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 2656,
"score_of_the_acc": -0.4848,
"final_rank": 8
},
{
"submission_id": "aoj_0209_7941007",
"code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n#define reep(i, f, t) for (int i = f; i < int(t); ++i)\n#define rep(i, n) reep(i, 0, n)\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\nint m;\npii fit(const int window[][100], const int pic[][50], int y, int x) {\n pii ans(-1, -1);\n rep(i, m) rep(j, m) {\n if (pic[i][j] == -1)\n continue;\n if (window[y + i][x + j] != pic[i][j]) {\n return pii(-1, -1);\n } else if (ans.first == -1)\n ans = pii(y + i, x + j);\n }\n return ans;\n}\nvoid rotate(int p[][50]) {\n int next[50][50];\n rep(i, m) rep(j, m) next[i][j] = p[m - j - 1][i];\n rep(i, m) rep(j, m) p[i][j] = next[i][j];\n}\nint main() {\n int n;\n while (scanf(\"%d%d\", &n, &m), n) {\n int window[100][100];\n rep(i, n) rep(j, n) scanf(\"%d\", &window[i][j]);\n int pic[50][50];\n rep(i, m) rep(j, m) scanf(\"%d\", &pic[i][j]);\n pii ans(-1, -1);\n rep(i, n - m + 1) rep(j, n - m + 1) {\n rep(k, 4) {\n ans = fit(window, pic, i, j);\n if (ans.first != -1) {\n i = n - m + 1;\n j = n - m + 1;\n break;\n }\n rotate(pic);\n }\n }\n if (ans.first == -1)\n puts(\"NA\");\n else\n printf(\"%d %d\\n\", ans.second + 1, ans.first + 1);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 2748,
"score_of_the_acc": -0.2798,
"final_rank": 1
},
{
"submission_id": "aoj_0209_6978078",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, m;\n auto rotate90 = [&](vector<vector<int>> A){\n int n = A.size();\n vector<vector<int>> B(n, vector<int>(n));\n for(int y = 0; y < n; y++){\n for(int x = 0; x < n; x++){\n B[n - 1 - x][y] = A[y][x];\n }\n }\n return B;\n };\n while(cin >> n >> m, n){\n vector<vector<int>> A(n, vector<int>(n)), B(m, vector<int>(m));\n for(int y = 0; y < n; y++){\n for(int x = 0; x < n; x++){\n cin >> A[y][x];\n }\n }\n for(int y = 0; y < m; y++){\n for(int x = 0; x < m; x++){\n cin >> B[y][x];\n }\n }\n pair<int,int> ans = {n + 1, n + 1};\n for(int i = 0; i < 4; i++){\n for(int y = 0; y + m <= n; y++){\n for(int x = 0; x + m <= n; x++){\n bool flag = true;\n pair<int,int> p = {n + 1, n + 1};\n for(int cy = 0; cy < m; cy++){\n for(int cx = 0; cx < m; cx++){\n if(B[cy][cx] == -1)continue;\n if(B[cy][cx] != A[y + cy][x + cx]){\n flag = false;\n break;\n }\n p = min(p, make_pair(y + cy + 1, x + cx + 1));\n }\n }\n if(flag){\n ans = min(ans, p);\n }\n }\n }\n B = rotate90(B);\n }\n if(ans.first == n + 1)cout << \"NA\" << '\\n';\n else cout << ans.second << \" \" << ans.first << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3300,
"score_of_the_acc": -0.625,
"final_rank": 12
},
{
"submission_id": "aoj_0209_5815528",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\twhile(true){\n\t\tauto N=in(),M=in();\n\t\tif(!N && !M) break;\n\n\t\tvvll W(N,vll(N));\n\t\tvvll P[4];\n\t\tll X[4],Y[4];\n\t\tREP(i,N){\n\t\t\tREP(j,N){\n\t\t\t\tW[i][j]=in();\n\t\t\t}\n\t\t}\n\n\t\tREP(i,4){\n\t\t\tP[i].resize(M,vll(M));\n\t\t}\n\t\tREP(i,M){\n\t\t\tREP(j,M){\n\t\t\t\tP[0][i][j]=in();\n\t\t\t}\n\t\t}\n\t\tREP(i,M){\n\t\t\tREP(j,M){\n\t\t\t\tP[1][i][j]=P[0][M-1-j][i];\n\t\t\t\tP[2][i][j]=P[0][M-1-i][M-1-j];\n\t\t\t\tP[3][i][j]=P[0][j][M-1-i];\n\t\t\t}\n\t\t}\n\t\tREP(k,4){\n\t\t\tX[k]=-1,Y[k]=-1;\n\t\t\tREP(i,M){\n\t\t\t\tREP(j,M){\n\t\t\t\t\tif(P[k][i][j]!=-1){\n\t\t\t\t\t\tX[k]=j;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(X[k]!=-1){\n\t\t\t\t\tY[k]=i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbool finish = false;\n\t\tREP(i,N-M+1){\n\t\t\tREP(j,N-M+1){\n\t\t\t\tREP(k,4){\n\t\t\t\t\tbool flag = true;\n\t\t\t\t\tREP(v,M){\n\t\t\t\t\t\tREP(u,M){\n\t\t\t\t\t\t\tif(P[k][v][u]!=-1 && W[i+v][j+u]!=P[k][v][u]){\n\t\t\t\t\t\t\t\tflag &= false;\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(flag){\n\t\t\t\t\t\tout(j+X[k]+1,i+Y[k]+1);\n\t\t\t\t\t\tfinish = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(finish) break;\n\t\t\t}\n\t\t\tif(finish) break;\n\t\t}\n\t\tif(!finish) out(\"NA\");\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3652,
"score_of_the_acc": -0.8233,
"final_rank": 14
},
{
"submission_id": "aoj_0209_5235996",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\ntemplate<typename T>\nvector<vector<T>> rotate_2dvec(vector<vector<T>> &v){\n int n = v.size();\n int m = v[0].size();\n vector<vector<T>> res(m, vector<T>(n));\n for(int i=0; i<n; i++){\n for(int j=0; j<m; j++){\n res[m-j-1][i] = v[i][j];\n }\n }\n return res;\n}\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n vector<vector<int>> a(n, vector<int>(n));\n for(int i=0; i<n; i++){\n for(int j=0; j<n; j++){\n cin >> a[i][j];\n }\n }\n vector<vector<int>> b(m, vector<int>(m));\n for(int i=0; i<m; i++){\n for(int j=0; j<m; j++){\n cin >> b[i][j];\n }\n }\n int y=n,x=n;\n for(int i=0; i<n-m+1; i++){\n for(int j=0; j<n-m+1; j++){\n for(int d=0; d<4; d++){\n bool ok = true;\n int ty=-1,tx=-1;\n for(int k=0; k<m; k++){\n for(int l=0; l<m; l++){\n if(b[k][l]!=-1 and ty==-1){\n ty = i+k;\n tx = j+l;\n }\n if(b[k][l]!=-1 and a[i+k][j+l]!=b[k][l]){\n ok = false;\n break;\n }\n }\n }\n if(ok){\n if(ty < y){\n y = ty;\n x = tx;\n }else if(ty == y){\n x = min(x, tx);\n }\n }\n b = rotate_2dvec<int>(b);\n }\n }\n }\n if(y == n){\n cout << \"NA\" << endl;\n }else{\n cout << x+1 << \" \" << y+1 << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3316,
"score_of_the_acc": -1.0307,
"final_rank": 17
},
{
"submission_id": "aoj_0209_4454833",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nvoid solve(int n, int m){\n auto A = make_v(n, n, 0);\n auto B = make_v(m, m, 0);\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n cin >> A[i][j];\n }\n }\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < m; ++j) {\n cin >> B[i][j];\n }\n }\n vector<pair<int, int>> ans;\n for (int k = 0; k < 4; ++k) {\n for (int i = 0; i+m <= n; ++i) {\n for (int j = 0; j+m <= n; ++j) {\n int ok = 1;\n for (int y = 0; y < m; ++y) {\n for (int x = 0; x < m; ++x) {\n if(~B[y][x] && A[i+y][j+x] != B[y][x]){\n ok = 0;\n y = x = m;\n }\n }\n }\n if(ok){\n for (int y = 0; y < m; ++y) {\n for (int x = 0; x < m; ++x) {\n if(~B[y][x]){\n ans.emplace_back(y+i, x+j);\n i = j = x = y = n;\n }\n }\n }\n }\n }\n }\n auto BB = B;\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < m; ++j) {\n B[i][j] = BB[m-j-1][i];\n }\n }\n }\n if(ans.empty()){\n puts(\"NA\");\n }else {\n sort(ans.begin(),ans.end());\n printf(\"%d %d\\n\", ans[0].second+1, ans[0].first+1);\n }\n}\n\nint main() {\n int n, m;\n while(cin >> n >> m, n){\n solve(n, m);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3328,
"score_of_the_acc": -0.5547,
"final_rank": 9
},
{
"submission_id": "aoj_0209_4418283",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n#include<iomanip>\n\nusing namespace std;\n\nint w[101][101];\nint p[51][51];\n\nvoid Rotate(int p[51][51],int m)\n{\n\tint temp[51][51];\n\tfor (int i = 1; i <= m; i++)\n\t\tfor (int j = 1; j <= m; j++)\n\t\t\ttemp[m + 1 - j][i] = p[i][j];\n\tfor (int i = 1; i <= m; i++)\n\t\tfor (int j = 1; j <= m; j++)\n\t\t\tp[j][i] = temp[j][i];\n}\nbool Compare(int x, int y, int m)\n{\n\tfor (size_t i = 1; i <= m; i++)\n\t{\n\t\tfor (size_t j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (p[j][i] != -1 && p[j][i] != w[x + j - 1][y + i - 1])\n\t\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\npair<int,int> Find(int w[101][101],int n,int p[51][51],int m)\n{\n\tpair<int, int> pos = make_pair(0, 0);\n\tfor (size_t i = 1; i <= n - m + 1; i++)\n\t{\n\t\tfor (size_t j = 1; j <= n - m + 1; j++)\n\t\t{\n\t\t\tfor (size_t k = 0; k < 4; k++)\n\t\t\t{\n\t\t\t\tif (Compare(j, i, m))\n\t\t\t\t{\n\t\t\t\t\tfor (size_t k = 1; k <= m; k++)\n\t\t\t\t\t\tif (p[k][1] != -1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint x = j + k - 1;\n\t\t\t\t\t\t\tint y = i;\n\t\t\t\t\t\t\tif (pos.first == 0 || (pos.first > x))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tpos = make_pair(x, y);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\treturn pos;\n\t\t\t\t}\n\t\t\t\tRotate(p, m);\n\t\t\t}\n\t\t}\n\t}\n\treturn make_pair(0, 0);\n}\n\nint main()\n{\n\tint n,m;\n\tcin >> n >> m;\n\twhile (n && m)\n\t{\n\t\tfor (size_t i = 1; i <= n; i++)\n\t\t\tfor (size_t j = 1; j <= n; j++)\n\t\t\t\tcin >> w[j][i];\n\t\tfor (size_t i = 1; i <= m; i++)\n\t\t\tfor (size_t j = 1; j <= m; j++)\n\t\t\t\tcin >> p[j][i];\n\t\tauto pos = Find(w, n, p, m);\n\t\tif (pos.first != 0)\n\t\t\tcout << pos.first << \" \" << pos.second << endl;\n\t\telse\n\t\t\tcout << \"NA\" << endl;\n\t\tcin >> n >> m;\n\t}\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3044,
"score_of_the_acc": -0.6186,
"final_rank": 11
},
{
"submission_id": "aoj_0209_4338810",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n#define INF 100000\n\nstruct point{\n int x;\n int y;\n};\n\nvoid find(int** w,int** p, int n, int m, point* retval);\n\nbool match(int i, int j, int** w, int** p, int m);\n\nint main(void){\n int n,m;\n while(true){\n cin>>n>>m;\n if(n==0 and m==0){break;}\n int** w=(int**)malloc(sizeof(int*)*n);\n for(int i=0;i<n;i++){\n w[i]=(int*)malloc(sizeof(int)*n);\n for(int j=0;j<n;j++){\n cin>>w[i][j];\n }\n }\n int** p=(int**)malloc(sizeof(int*)*m);\n for(int i=0;i<m;i++){\n p[i]=(int*)malloc(sizeof(int)*m);\n for(int j=0;j<m;j++){\n cin>>p[i][j];\n }\n }\n point retval;\n find(w,p,n,m,&retval);\n if(retval.x==INF and retval.y==INF){\n cout<<\"NA\"<<endl;\n }\n else{\n cout<<retval.x+1<<\" \"<<retval.y+1<<endl;\n }\n }\n}\n\nvoid find(int** w,int** p, int n, int m, point* retval){\n retval->x=INF;\n retval->y=INF;\n\n int** p1=p;\n int** p2=(int**)malloc(sizeof(int*)*m);\n for(int i=0;i<m;i++){\n p2[i]=(int*)malloc(sizeof(int)*m);\n for(int j=0;j<m;j++){\n p2[i][j]=p1[m-1-j][i];\n }\n }\n int** p3=(int**)malloc(sizeof(int*)*m);\n for(int i=0;i<m;i++){\n p3[i]=(int*)malloc(sizeof(int)*m);\n for(int j=0;j<m;j++){\n p3[i][j]=p2[m-1-j][i];\n }\n }\n\n int** p4=(int**)malloc(sizeof(int*)*m);\n for(int i=0;i<m;i++){\n p4[i]=(int*)malloc(sizeof(int)*m);\n for(int j=0;j<m;j++){\n p4[i][j]=p3[m-1-j][i];\n }\n }\n\n for(int i=0;i<=n-m;i++){\n for(int j=0;j<=n-m;j++){\n if(match(i,j,w,p1,m)){\n for(int _y=0;_y<m;_y++){\n for(int _x=0;_x<m;_x++){\n if(p1[_y][_x]!=-1){\n int y=_y+i;\n int x=_x+j;\n if(retval->y>y or (retval->y==y and retval->x>x)){\n retval->y=y;\n retval->x=x;\n }\n }\n }\n }\n }\n if(match(i,j,w,p2,m)){\n for(int _y=0;_y<m;_y++){\n for(int _x=0;_x<m;_x++){\n if(p2[_y][_x]!=-1){\n int y=_y+i;\n int x=_x+j;\n if(retval->y>y or (retval->y==y and retval->x>x)){\n retval->y=y;\n retval->x=x;\n }\n }\n }\n }\n }\n if(match(i,j,w,p3,m)){\n for(int _y=0;_y<m;_y++){\n for(int _x=0;_x<m;_x++){\n if(p3[_y][_x]!=-1){\n int y=_y+i;\n int x=_x+j;\n if(retval->y>y or (retval->y==y and retval->x>x)){\n retval->y=y;\n retval->x=x;\n }\n }\n }\n }\n }\n if(match(i,j,w,p4,m)){\n for(int _y=0;_y<m;_y++){\n for(int _x=0;_x<m;_x++){\n if(p4[_y][_x]!=-1){\n int y=_y+i;\n int x=_x+j;\n if(retval->y>y or (retval->y==y and retval->x>x)){\n retval->y=y;\n retval->x=x;\n }\n }\n }\n }\n }\n }\n }\n}\n\nbool match(int i, int j, int** w, int** p, int m){\n for(int y=0;y<m;y++){\n for(int x=0;x<m;x++){\n if(p[y][x]!=-1 and p[y][x]!=w[y+i][x+j]){return false;}\n }\n }\n return true;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4016,
"score_of_the_acc": -1.0303,
"final_rank": 16
},
{
"submission_id": "aoj_0209_4099032",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, m;\nint w[110][110];\nint p[60][60];\nint tmp[60][60];\nint ans_x, ans_y;\n\nvoid rotate() {\n for (int i=0; i<m; i++) {\n for (int j=0; j<m; j++) {\n tmp[j][m-1-i] = p[i][j];\n }\n }\n \n for (int i=0; i<m; i++) {\n for (int j=0; j<m; j++) {\n p[i][j] = tmp[i][j];\n }\n }\n}\n\nvoid check() {\n for (int i=0; i<=n-m; i++) {\n for (int j=0; j<=n-m; j++) {\n bool flag = true;\n \n for (int k=0; k<m; k++) {\n for (int l=0; l<m; l++) {\n if (p[k][l]==-1) {\n continue;\n }\n \n if (p[k][l]!=w[i+k][j+l]) {\n flag = false;\n }\n }\n }\n \n if (flag) {\n for (int k=0; k<m; k++) {\n for (int l=0; l<m; l++) {\n if (p[k][l]!=-1) {\n if (ans_x>i+k) {\n ans_x = i+k, ans_y = j+l;\n }\n else if (ans_x==i+k && ans_y>j+l) {\n ans_y = j+l;\n }\n }\n }\n }\n }\n }\n }\n}\n\nint main() {\n while (true) {\n cin >> n >> m;\n \n if (n==0 && m==0) {\n break;\n }\n \n for (int i=0; i<n; i++) for (int j=0; j<n; j++) cin >> w[i][j];\n for (int i=0; i<m; i++) for (int j=0; j<m; j++) cin >> p[i][j];\n \n ans_x = 1000, ans_y = 1000;\n \n for (int i=0; i<4; i++) {\n check();\n rotate();\n }\n \n if (ans_x==1000) {\n cout << \"NA\" << endl;\n }\n else {\n cout << ans_y+1 << \" \" << ans_x+1 << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3176,
"score_of_the_acc": -0.5945,
"final_rank": 10
},
{
"submission_id": "aoj_0209_3898096",
"code_snippet": "#include<iostream>\nusing namespace std;\nint N,M;\nint W[100][100],p[50][50];\nint get(int i,int j,int r)\n{\n\treturn r==0?p[i][j]:r==1?p[j][M-i-1]:r==2?p[M-i-1][M-j-1]:p[M-j-1][i];\n}\nmain()\n{\n\twhile(cin>>N>>M,N)\n\t{\n\t\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>W[i][j];\n\t\tfor(int i=0;i<M;i++)for(int j=0;j<M;j++)cin>>p[i][j];\n\t\tint ansx=N,ansy=N;\n\t\tfor(int i=0;i<=N-M;i++)for(int j=0;j<=N-M;j++)\n\t\t{\n\t\t\tfor(int r=0;r<4;r++)\n\t\t\t{\n\t\t\t\tbool now=true;\n\t\t\t\tint x=-1,y=-1;\n\t\t\t\tfor(int I=0;now&&I<M;I++)for(int J=0;J<M;J++)\n\t\t\t\t{\n\t\t\t\t\tint a=W[i+I][j+J],b=get(I,J,r);\n\t\t\t\t\tif(b>=0&&b!=a)\n\t\t\t\t\t{\n\t\t\t\t\t\tnow=false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(b>=0&&x<0)x=i+I,y=j+J;\n\t\t\t\t}\n\t\t\t\tif(now)\n\t\t\t\t{\n\t\t\t\t\tif(ansx>x||ansx==x&&ansy>y)ansx=x,ansy=y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(ansx==N)cout<<\"NA\"<<endl;\n\t\telse cout<<ansy+1<<\" \"<<ansx+1<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3024,
"score_of_the_acc": -0.3312,
"final_rank": 2
},
{
"submission_id": "aoj_0209_3018642",
"code_snippet": "#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint n, m;\nint scene[100][100], pict[50][50];\nint x, y;\n\nbool check0(int si, int sj){\n bool first = true;\n for(int i = 0; i < m; i++){\n for(int j = 0; j < m; j++){\n if(pict[i][j] == -1) continue;\n\n if(pict[i][j] == scene[si+i][sj+j]){\n if(first){\n first = false;\n x = sj+j; y = si+i;\n }\n }else{\n return false;\n }\n }\n }\n return true;\n}\n\nbool check90(int si, int sj){\n bool first = true;\n for(int i = 0; i < m; i++){\n for(int j = 0; j < m; j++){\n if(pict[m-1-j][i] == -1) continue;\n\n if(pict[m-1-j][i] == scene[si+i][sj+j]){\n if(first){\n first = false;\n x = sj+j; y = si+i;\n }\n }else{\n return false;\n }\n }\n }\n return true;\n}\n\nbool check180(int si, int sj){\n bool first = true;\n for(int i = 0; i < m; i++){\n for(int j = 0; j < m; j++){\n if(pict[m-1-i][m-1-j] == -1) continue;\n\n if(pict[m-1-i][m-1-j] == scene[si+i][sj+j]){\n if(first){\n first = false;\n x = sj+j; y = si+i;\n }\n }else{\n return false;\n }\n }\n }\n return true;\n}\n\nbool check270(int si, int sj){\n bool first = true;\n for(int i = 0; i < m; i++){\n for(int j = 0; j < m; j++){\n if(pict[j][m-1-i] == -1) continue;\n\n if(pict[j][m-1-i] == scene[si+i][sj+j]){\n if(first){\n first = false;\n x = sj+j; y = si+i;\n }\n }else{\n return false;\n }\n }\n }\n return true;\n}\n\nint main(){\n while(1){\n cin >> n >> m;\n if(n+m == 0) break;\n\n memset(scene, -1, sizeof(scene));\n memset(pict, -1, sizeof(pict));\n\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n cin >> scene[i][j];\n }\n }\n\n for(int i = 0; i < m; i++){\n for(int j = 0; j < m; j++){\n cin >> pict[i][j];\n }\n }\n\n bool cont = true;\n \n // for(int i = 0; i < m; i++){\n // for(int j = 0; j < m; j++){\n // cout << pict[m-1-i][m-1-j] << \" \";\n // }\n // cout << endl;\n // }\n\n for(int i = 0; i <= n-m && cont; i++){\n for(int j = 0; j <= n-m && cont; j++){\n if(check0(i,j)){\n cout << x+1 << \" \" << y+1 << endl;\n cont = false;\n break;\n }\n if(check90(i,j)){\n cout << x+1 << \" \" << y+1 << endl;\n cont = false;\n break;\n }\n if(check180(i,j)){\n cout << x+1 << \" \" << y+1 << endl;\n cont = false;\n break;\n }\n if(check270(i,j)){\n cout << x+1 << \" \" << y+1 << endl;\n cont = false;\n break;\n }\n }\n }\n\n if(cont) cout << \"NA\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3140,
"score_of_the_acc": -0.3862,
"final_rank": 4
},
{
"submission_id": "aoj_0209_2670993",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nvector<vector<int>>rot(vector<vector<int>>v) {\n\tvector<vector<int>>rotated(v);\n\tfor (int i = 0; i < v.size(); ++i) {\n\t\tfor (int j = 0; j < v.size(); ++j) {\n\t\t\trotated[i][j]=v[v.size()-j-1][i];\n\t\t}\n\t}\n\treturn rotated;\n}\n\npair<int,int> check(vector<vector<int>>&f, vector<vector<int>>&p, int l, int u) {\n\tpair<int,int>ans(10000,10000);;\n\tfor (int x = l; x < l + p.size(); ++x) {\n\t\tfor (int y = u; y < u + p.size(); ++y) {\n\t\t\tif (p[y - u][x - l] != -1) {\n\t\t\t\tans=min(ans,make_pair(y,x));\n\t\t\t\tif (f[y][x] != p[y - u][x - l])return make_pair(10000, 10000);\n\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\nint main() {\n\twhile (true) {\n\t\tint N,M;cin>>N>>M;\n\t\tif(!N)break;\n\t\tvector<vector<int>>field(N,vector<int>(N));\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tcin>>field[i][j];\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>>picture(M,vector<int>(M));\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\tcin >> picture[i][j];\n\t\t\t}\n\t\t}\n\t\tpair<int,int>ans(10000,10000);\n\t\tfor (int l = 0; l <= N - M; ++l) {\n\t\t\tfor (int u = 0; u <= N - M; ++u) {\n\t\t\t\tfor (int k = 0; k < 4; ++k) {\n\t\t\t\t\tpicture=rot(picture);\n\t\t\t\t\tans=min(ans,check(field,picture,l,u));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (ans.first == 10000) {\n\t\t\tcout<<\"NA\"<<endl;\n\t\t}\n\t\telse {\n\t\t\tcout<<ans.second+1<<\" \"<<ans.first+1<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 3140,
"score_of_the_acc": -1.3559,
"final_rank": 20
}
] |
aoj_0210_cpp
|
ザ・スクエアーズ
この度、有名なテーマパークに、巨大迷路ザ・スクエアーズが新しく完成しました。 消防署の指導により避難訓練をしなければなりませんが、巨大迷路なだけに訓練にかかる時間を予測することができません。そこで、あなたは以下の仕様をもとに避難訓練シミュレータを開発することになりました。
巨大迷路は図 1 に示すように、横
W
、縦
H
の
W × H
個のマス目で表わされます。各マス目は、通路(白いマス目)、壁(茶色いマス目) 、非常口(緑のマス目)のいずれかです。図中の○は人を表し、その中の英小文字(E、W、S、N)はその人が向いている方角(東西南北)を表しています。図は上方向が北になるように描かれています。
図1
巨大迷路内にいる人は最初、東西南北のいずれかの方向を向いて立っています。各人は 1 秒単位で同時に次に示す手順で移動を試みます。
現在向いている方向の、右、前、左、後のマス目を順番に調べ、最初に見つけた、空いている通路または非常口の方向に向きを変えます。そのようなマス目が無い場合は向きを変えません。
目の前のマス目が空いていて、他の人の目の前のマス目になっていない場合は移動します。同じマス目を目の前のマスとする人が複数いる場合は、そのマス目の、東、北、西、南のマス目にいる人の順で選択された 1 人が移動します。
移動後に非常口に到着した人は、無事避難し迷路内から消えます。
与えられた巨大迷路と人の位置情報を入力とし、全ての人が避難し終える時間を出力するプログラムを作成してください。 脱出に 180 秒より長い時間を要する場合は NA と出力して下さい。 迷路と人の位置情報は、
H
行
W
列の文字によって与えられます。各文字の意味は以下のとおりです。
#
: 壁
.
: 床
X
: 非常口
E
: 東を向いている人
N
: 北を向いている人
W
: 西を向いている人
S
: 南を向いている人
なお、迷路と外部との境界は壁
#
または非常口
X
のいずれかです。また、巨大迷路の中には、人が必ず１人以上います。
Input
複数のデータセットの並びが入力として与えられます。 入力の終わりはゼロふたつの行で示されます。
各データセットは以下の形式で与えられます。
W
H
str
1
str
2
:
str
H
1 行目に迷路の横方向の大きさ
W
、縦方向の大きさ
H
(1 ≤
W, H
≤ 30) が与えられます。続く
H
行に迷路の
i
行目を表す文字列
str
i
(長さ
W
) が与えられます。
データセットの数は 50 を超えません。
Output
入力データセットごとに、全ての人が避難し終える時間を１行に出力します。
Sample Input
10 3
##########
#E.......X
##########
4 4
####
#N.#
#..X
####
5 5
#####
#N..#
###.X
#S..#
#####
6 6
######
#..#X#
#.EE.#
####N#
#....#
######
8 8
##X#####
#....E.#
#####.##
#.#...##
#.W.#..#
#.#.N#.X
#X##.#.#
########
0 0
Output for the Sample Input
8
NA
9
16
10
|
[
{
"submission_id": "aoj_0210_10854015",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\nstring ds = \"ENWS\";\nint dx[4] = { 0, -1, 0, 1 };\nint dy[4] = { 1, 0, -1, 0 };\nint H, W; string s[33]; bool flag[33][33];\nint main() {\n\twhile (cin >> W >> H, H | W) {\n\t\tfor (int i = 0; i < H; i++) cin >> s[i];\n\t\tint ret = -1;\n\t\tfor (int i = 1; i <= 180; i++) {\n\t\t\tfor (int j = 0; j < H; j++) {\n\t\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\t\tflag[j][k] = false;\n\t\t\t\t\tint pd = ds.find(s[j][k]);\n\t\t\t\t\tif (pd == string::npos) continue;\n\t\t\t\t\tfor (int l = 3; l < 7; l++) {\n\t\t\t\t\t\tint tx = j + dx[(pd + l) % 4], ty = k + dy[(pd + l) % 4];\n\t\t\t\t\t\tif (s[tx][ty] == '.' || s[tx][ty] == 'X') {\n\t\t\t\t\t\t\ts[j][k] = ds[(pd + l) % 4];\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int j = 0; j < H; j++) {\n\t\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\t\tif (s[j][k] == '.' || s[j][k] == 'X') {\n\t\t\t\t\t\tfor (int l = 0; l < 4; l++) {\n\t\t\t\t\t\t\tint tx = j + dx[l], ty = k + dy[l];\n\t\t\t\t\t\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W) {\n\t\t\t\t\t\t\t\tint pd = ds.find(s[tx][ty]);\n\t\t\t\t\t\t\t\tif (pd == string::npos || pd != (l + 2) % 4) continue;\n\t\t\t\t\t\t\t\tflag[tx][ty] = true;\n\t\t\t\t\t\t\t\tbreak;\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\t\t\tfor (int j = 0; j < H; j++) {\n\t\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\t\tif (flag[j][k]) {\n\t\t\t\t\t\tint pd = ds.find(s[j][k]);\n\t\t\t\t\t\tint tx = j + dx[pd], ty = k + dy[pd];\n\t\t\t\t\t\tif (s[tx][ty] == '.') swap(s[j][k], s[tx][ty]);\n\t\t\t\t\t\telse s[j][k] = '.';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < H; j++) {\n\t\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\t\tif (ds.find(s[j][k]) != string::npos) cnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (cnt == 0) {\n\t\t\t\tret = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (ret == -1) cout << \"NA\" << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3344,
"score_of_the_acc": -0.8922,
"final_rank": 16
},
{
"submission_id": "aoj_0210_6982032",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int w, h;\n while(cin >> w >> h, w){\n int ans = 181;\n vector<string> A(h);\n for(auto &&s:A)cin >> s;\n auto fin = [&](){\n int cnt = 0;\n for(auto &&s:A){\n cnt += count(s.begin(), s.end(), 'E');\n cnt += count(s.begin(), s.end(), 'N');\n cnt += count(s.begin(), s.end(), 'W');\n cnt += count(s.begin(), s.end(), 'S');\n }\n return cnt == 0;\n };\n vector<char> C = {'E', 'N', 'W', 'S'};\n map<char,int> mp = {{'E', 0}, {'N', 1}, {'W', 2}, {'S', 3}};\n vector<pair<int,int>> dir = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};//進む方向\n vector<vector<vector<bool>>> mov;\n auto ope = [&](int y, int x){\n int dy, dx, s = mp[A[y][x]];\n for(int i = 0; i < 4; i++){\n tie(dy, dx) = dir[(i + s + 3) & 3];\n if(A[y + dy][x + dx] == '#')continue;\n if(A[y + dy][x + dx] == 'E')continue;//ここらへん微妙\n if(A[y + dy][x + dx] == 'N')continue;\n if(A[y + dy][x + dx] == 'S')continue;\n if(A[y + dy][x + dx] == 'W')continue;\n A[y][x] = C[(i + s + 3) & 3];\n break;\n }\n s = mp[A[y][x]];\n tie(dy, dx) = dir[s];\n if(A[y + dy][x + dx] == '.' || A[y + dy][x + dx] == 'X'){\n mov[y + dy][x + dx][(s + 2) & 3] = true;\n }\n };\n for(int i = 0; i <= 180; i++){\n if(fin()){\n ans = i;\n break;\n }\n mov = vector<vector<vector<bool>>>(h, vector<vector<bool>>(w, vector<bool>(4)));\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n if(A[y][x] == '#')continue;\n if(A[y][x] == 'X')continue;\n if(A[y][x] == '.')continue;\n ope(y, x);\n }\n }\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n for(int j = 0; j < 4; j++){\n if(mov[y][x][j]){\n int dy, dx;\n tie(dy, dx) = dir[j];\n if(A[y][x] == '.'){\n swap(A[y][x], A[y + dy][x + dx]);\n }else{\n A[y + dy][x + dx] = '.';\n }\n break;\n }\n }\n }\n }\n }\n if(ans == 181)cout << \"NA\" << '\\n';\n else cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3620,
"score_of_the_acc": -1.25,
"final_rank": 20
},
{
"submission_id": "aoj_0210_4459222",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nvoid solve(int h, int w){\n\n vector<string> G(h);\n vector<vector<char>> out(h, vector<char>(w, 0));\n array<int, 4> dy{0, 1, 0, -1}, dx{-1, 0, 1, 0};\n string D = \"WSEN\";\n for (int i = 0; i < h; ++i) {\n cin >> G[i];\n }\n for (int t = 0; t <= 180; ++t) {\n int cnt = 0;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k < 4; ++k) {\n if(G[i][j] == D[k]) cnt++;\n }\n }\n }\n if(!cnt){\n cout << t << \"\\n\";\n return;\n }\n for (int y = 0; y < h; ++y) {\n for (int x = 0; x < w; ++x) {\n for (int i = 0; i < 4; ++i) {\n if(G[y][x] == D[i]){\n for (int j = 3; j < 7; ++j) {\n\n int dir = (i+j)&3;\n if(G[y+dy[dir]][x+dx[dir]] == '.' || G[y+dy[dir]][x+dx[dir]] == 'X'){\n G[y][x] = D[dir];\n i = 10;\n break;\n }\n }\n }\n }\n }\n }\n for (int dir = 0; dir < 4; ++dir) {\n for (int y = 0; y < h; ++y) {\n for (int x = 0; x < w; ++x) {\n if(G[y][x] == D[dir]){\n if(G[y+dy[dir]][x+dx[dir]] == '.'){\n G[y+dy[dir]][x+dx[dir]] = G[y][x]-'A'+'a';\n G[y][x] = '|';\n }else if(G[y+dy[dir]][x+dx[dir]] == 'X'){\n G[y][x] = '|';\n G[y+dy[dir]][x+dx[dir]] = '$';\n }\n }\n }\n }\n }\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if(islower(G[i][j])){\n G[i][j] = G[i][j]-'a'+'A';\n }else if(G[i][j] == '$'){\n G[i][j] = 'X';\n }else if(G[i][j] == '|'){\n G[i][j] = '.';\n }\n }\n }\n\n }\n puts(\"NA\");\n}\n\nint main() {\n int w, h;\n while(cin >> w >> h, h){\n solve(h, w);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3004,
"score_of_the_acc": -0.7594,
"final_rank": 14
},
{
"submission_id": "aoj_0210_2172066",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nint w, h;\nchar s[30][31], b[30][31];\nmap<char, int>d{ {'N',0},{'E',1},{'S',2},{'W',3} };\nchar rd[] = \"NESW\";\nint dx[]{ -1,0,1,0 }, dy[]{ 0,1,0,-1 }, a[]{ 1,0,3,2 };\nint main() {\n\twhile (scanf(\"%d%d\", &w, &h), h) {\n\t\trep(i, h)scanf(\"%s\", s[i]);\n\t\tfor (int i = 0; i <= 180; i++) {\n\t\t\tbool ok = true;\n\t\t\trep(i, h)rep(j, w)for (auto p : d) {\n\t\t\t\tif (s[i][j] == p.first) { ok = false; break; }\n\t\t\t}\n\t\t\tif (ok) { printf(\"%d\\n\", i); goto g; }\n\t\t\trep(i, h)rep(j, w) {\n\t\t\t\tif (d.find(s[i][j]) == d.end())continue;\n\t\t\t\tint b = d[s[i][j]];\n\t\t\t\trep(k, 4) {\n\t\t\t\t\tint nx = i + dx[(b + a[k]) % 4], ny = j + dy[(b + a[k]) % 4];\n\t\t\t\t\tif (0 <= nx&&nx < h && 0 <= ny&&ny < w && (s[nx][ny] == '.' || s[nx][ny] == 'X')) {\n\t\t\t\t\t\ts[i][j] = rd[(b + a[k]) % 4]; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(i, h)rep(j, w)b[i][j] = s[i][j];\n\t\t\trep(i, h)rep(j, w) {\n\t\t\t\tif (s[i][j] != 'X'&&s[i][j] != '.')continue;\n\t\t\t\trep(k, 4) {\n\t\t\t\t\tint nx = i + dx[a[k]], ny = j + dy[a[k]];\n\t\t\t\t\tif (0 <= nx&&nx < h && 0 <= ny&&ny < w&&d.find(s[nx][ny]) != d.end() && nx + dx[d[s[nx][ny]]] == i&&ny + dy[d[s[nx][ny]]] == j) {\n\t\t\t\t\t\tif (s[i][j] == 'X')b[nx][ny] = '.';\n\t\t\t\t\t\telse swap(b[i][j], b[nx][ny]);\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\trep(i, h)rep(j, w)s[i][j] = b[i][j];\n\t\t}\n\t\tputs(\"NA\");\n\tg:;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3160,
"score_of_the_acc": -1.0703,
"final_rank": 19
},
{
"submission_id": "aoj_0210_2172058",
"code_snippet": "#include<bits/stdc++.h>\n#define MOD 1000000007\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3f\n#define EPS (1e-10)\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int>P;\n\nint w, h;\nchar s[30][31], b[30][31];\nmap<char, int>dir{ {'N',0},{'E',1},{'S',2},{'W',3} };\nchar rd[] = \"NESW\";\nint dx[]{ -1,0,1,0 }, dy[]{ 0,1,0,-1 }, a[]{ 1,0,3,2 };\nint main() {\n\twhile (scanf(\"%d%d\", &w, &h), h) {\n\t\trep(i, h)scanf(\"%s\", s[i]);\n\t\tfor (int i = 0; i <= 180; i++) {\n\t\t\tbool ok = true;\n\t\t\trep(i, h)rep(j, w)for (auto p : dir) {\n\t\t\t\tif (s[i][j] == p.first) { ok = false; break; }\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tprintf(\"%d\\n\", i); goto g;\n\t\t\t}\n\t\t\trep(i, h)rep(j, w) {\n\t\t\t\tif (dir.find(s[i][j]) == dir.end())continue;\n\t\t\t\tint bs = dir[s[i][j]];\n\t\t\t\trep(k, 4) {\n\t\t\t\t\tint nx = i + dx[(bs + a[k]) % 4], ny = j + dy[(bs + a[k]) % 4];\n\t\t\t\t\tif (0 <= nx&&nx < h && 0 <= ny&&ny < w && (s[nx][ny] == '.' || s[nx][ny] == 'X')) {\n\t\t\t\t\t\ts[i][j] = rd[(bs + a[k]) % 4]; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(i, h)rep(j, w)b[i][j] = s[i][j];\n\t\t\trep(i, h)rep(j, w) {\n\t\t\t\tif (s[i][j] != 'X'&&s[i][j] != '.')continue;\n\t\t\t\trep(k, 4) {\n\t\t\t\t\tint nx = i + dx[a[k]], ny = j + dy[a[k]];\n\t\t\t\t\tif (0 <= nx&&nx < h && 0 <= ny&&ny < w&&dir.find(s[nx][ny]) != dir.end() && nx + dx[dir[s[nx][ny]]] == i&&ny + dy[dir[s[nx][ny]]] == j) {\n\t\t\t\t\t\tif (s[i][j] == 'X')b[nx][ny] = '.';\n\t\t\t\t\t\telse swap(b[i][j], b[nx][ny]);\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\trep(i, h)rep(j, w)s[i][j] = b[i][j];\n\t\t}\n\t\tputs(\"NA\");\n\tg:;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3108,
"score_of_the_acc": -1.05,
"final_rank": 17
},
{
"submission_id": "aoj_0210_1887225",
"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 <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++)\nconst int INF = 1<<28;\n\nint W, H, ppl;\nchar m[30][30];\nstring d = \"WSEN\";\nint dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};\n\nbool canMove(int h, int w) {\n\tif(0 <= h && 0 <= w && h < H && w < W)\n\t\tif(m[h][w] == '.' || m[h][w] == 'X')\n\t\t\treturn true;\n\treturn false;\n}\n\nchar decideDirection(int h, int w, char d2) {\n\tREP(i, 4) {\n\t\tint nd = (d.find(d2) + 3 + i) % 4;\n\t\tint nh = h + dy[nd], nw = w + dx[nd];\n\t\tif(canMove(nh, nw)) return d[nd];\n\t}\n\treturn d2;\n}\n\nint main() {\n\twhile(cin >> W >> H, W|H) {\n\t\tppl = 0;\n\t\tREP(i, H) REP(j, W) {\n\t\t\tcin >> m[i][j];\n\t\t\tif(d.find(m[i][j]) != string::npos)\n\t\t\t\tppl++;\n\t\t}\n\n\t\tint cnt = 0;\n\t\twhile(ppl) {\n\t\t\tREP(i, H) REP(j, W) {\n\t\t\t\tif(d.find(m[i][j]) != string::npos) {\n\t\t\t\t\tm[i][j] = decideDirection(i, j ,m[i][j]);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbool chk[30][30];\n\t\t\tmemset(chk, true, sizeof(chk));\n\t\t\tREP(i, 4) REP(j, H) REP(k, W) {\n\t\t\t\tif(m[j][k] == d[i] && chk[j][k]) {\n\t\t\t\t\tint nh = j + dy[i], nw = k + dx[i];\n\t\t\t\t\tif(m[nh][nw] == '.' && chk[nh][nw]) {\n\t\t\t\t\t\tswap(m[j][k], m[nh][nw]);\n\t\t\t\t\t\tchk[nh][nw] = false;\n\t\t\t\t\t}\n\t\t\t\t\telse if(m[nh][nw] == 'X' && chk[nh][nw]) {\n\t\t\t\t\t\tm[j][k] = '.';\n\t\t\t\t\t\tchk[nh][nw] = false;\n\t\t\t\t\t\tppl--;\n\t\t\t\t\t}\n\t\t\t\t\tchk[j][k] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcnt++;\n\t\t\tif(cnt > 180) break;\n\n\t\t\t//debug\n//\t\t\tREP(i, H) {\n//\t\t\t\tREP(j, W)\n//\t\t\t\t\tcout << m[i][j];\n//\t\t\t\tcout << endl;\n//\t\t\t}\n\t\t}\n\t\tif(cnt > 180) cout << \"NA\" << endl;\n\t\telse cout << cnt << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0578,
"final_rank": 5
},
{
"submission_id": "aoj_0210_1839564",
"code_snippet": "#include<bits/stdc++.h>\n#define N 30\nusing namespace std;\nint dy[4]={0,-1,0,1};\nint dx[4]={1,0,-1,0};\nint w,h,ans,cnt,sum;\nbool used[N][N];\nstring s[N];\n\n\nvoid Change_dir(){\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(!('0'<=s[i][j]&&s[i][j]<='3'))continue;\n int dir=s[i][j]-'0';\n for(int k=3;k<=6;k++){\n\tint ndir=(dir+k)%4;\n\tint ny=i+dy[ndir],nx=j+dx[ndir];\n\tif(ny<0||nx<0||h<=ny||w<=nx)continue;\n\tif(s[ny][nx]=='.'||s[ny][nx]=='X'){\n\t s[i][j]=ndir+'0';\n\t break;\n\t}\n }\n }\n }\n}\n\nvoid Change_pls(){\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(!(s[i][j]=='.'||s[i][j]=='X'))continue;\n if(used[i][j])continue;\n for(int k=0;k<4;k++){\n\tint ny=i+dy[k],nx=j+dx[k];\n\tif(ny<0||nx<0||h<=ny||w<=nx)continue;\n\tif(used[ny][nx])continue;\n\tif('0'<=s[ny][nx]&&s[ny][nx]<='3'){\n\t if(s[ny][nx]!=(k+2)%4+'0')continue;\n\t used[i][j]=used[ny][nx]=true;\n\t if(s[i][j]=='.')s[i][j]=s[ny][nx];\n\t else cnt++;\n\t s[ny][nx]='.';\n\t break;\n\t}\n }\n }\n }\n}\n\nint main(){\n while(1){\n cin>>w>>h;\n if(!w&&!h)break;\n ans=cnt=sum=0;\n for(int i=0;i<h;i++)cin>>s[i];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++){\n\tif(s[i][j]=='E')s[i][j]='0',sum++;\n\tif(s[i][j]=='N')s[i][j]='1',sum++;\n\tif(s[i][j]=='W')s[i][j]='2',sum++;\n\tif(s[i][j]=='S')s[i][j]='3',sum++;\n }\n while(1){\n ans++;\n if(ans>180)break;\n Change_dir();\n memset(used,0,sizeof(used));\n Change_pls();\n if(cnt==sum)break;\n }\n if(ans>180)cout<<\"NA\"<<endl;\n else cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1208,
"score_of_the_acc": -0.3078,
"final_rank": 10
},
{
"submission_id": "aoj_0210_1255747",
"code_snippet": "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <unordered_set>\n//#include <unordered_map>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\nnamespace{\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\n}\nint dx[] = {1,0,-1,0};\nint dy[] = {0,-1,0,1};\n \nstring s = \"ENWS\";\n \nint main(){\n int w, h;\n while(cin >> w >> h, w || h){\n VV(char) vv(w, vector<char>(h));\n rep(i,h) rep(j,w) cin >> vv[j][i];\n int res = -1;\n rep(time, 180) {\n int man = 0;\n rep(j,h){\n rep(i,w){\n rep(l,4){\n if(vv[i][j]==s[l]){\n man++;\n rep(k,4) {\n int d = (l+3+k)%4;\n int xx = i+dx[d];\n int yy = j+dy[d];\n if (vv[xx][yy]=='X'||vv[xx][yy]=='.') {\n vv[i][j] = s[d];\n goto OUT;\n }\n }\n }\n }\n OUT:;\n }\n }\n vector< vector<char> > next(w, vector<char>(h));\n next = vv;\n rep(i,w){\n rep(j,h){\n if (vv[i][j] != '.' && vv[i][j] != 'X') continue;\n rep(k,4){\n int xx = i+dx[k];\n int yy = j+dy[k];\n if (xx<0||xx>=w||yy<0||yy>=h) continue;\n \n if (vv[xx][yy] == s[(k+2)%4]){\n if (vv[i][j] == '.')\n next[i][j] = vv[xx][yy];\n else\n man--;\n next[xx][yy] = '.';\n break;\n }\n }\n }\n }\n if (man==0){\n res = time + 1;\n break;\n }\n vv = next;\n }\n if (res>=0){\n cout << res << endl;\n }\n else{\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0703,
"final_rank": 9
},
{
"submission_id": "aoj_0210_1171810",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <iterator>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\n\nstring s[30];\nint h,w;\nint dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1};\n\npair<int,int> NextPoint(int y,int x)\n{\n\tpair<int,int> p;\n\tif(s[y][x] == 'E')\n\t{\n\t\tif(s[y+1][x] == '.' || s[y+1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'S';\n\n\t\t\tp.first = y+1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x+1] == '.' || s[y][x+1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'E';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x+1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y-1][x] == '.' || s[y-1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'N';\n\n\t\t\tp.first = y-1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x-1] == '.' || s[y][x-1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'W';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x-1;\n\t\t\treturn p;\n\t\t}\n\t}\n\telse if(s[y][x] == 'N')\n\t{\n\t\tif(s[y][x+1] == '.' || s[y][x+1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'E';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x+1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y-1][x] == '.' || s[y-1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'N';\n\n\t\t\tp.first = y-1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x-1] == '.' || s[y][x-1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'W';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x-1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y+1][x] == '.' || s[y+1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'S';\n\n\t\t\tp.first = y+1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t}\n\telse if(s[y][x] == 'W')\n\t{\n\t\tif(s[y-1][x] == '.' || s[y-1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'N';\n\n\t\t\tp.first = y-1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x-1] == '.' || s[y][x-1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'W';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x-1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y+1][x] == '.' || s[y+1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'S';\n\n\t\t\tp.first = y+1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x+1] == '.' || s[y][x+1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'E';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x+1;\n\t\t\treturn p;\n\t\t}\n\t}\n\telse if(s[y][x] == 'S')\n\t{\n\t\tif(s[y][x-1] == '.' || s[y][x-1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'W';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x-1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y+1][x] == '.' || s[y+1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'S';\n\n\t\t\tp.first = y+1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x+1] == '.' || s[y][x+1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'E';\n\t\t\tp.first = y;\n\t\t\tp.second = x+1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y-1][x] == '.' || s[y-1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'N';\n\n\t\t\tp.first = y-1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t}\n}\n\nbool can(int y,int x)\n{\n\tif(0 <= y & y < h && 0 <= x && x < w)\n\t{\n\t\treturn true;\n\t}\n\telse return false;\n}\n\nbool isPerson(int y,int x)\n{\n\tif(s[y][x] == 'E' || s[y][x] == 'W' || s[y][x] == 'S' || s[y][x] == 'N')\n\t{\n\t\treturn true;\n\t}\n\telse return false;\n}\n\nbool onPerson(int h,int w)\n{\n\tbool flag = false;\n\n\trep(i,h)\n\t{\n\t\trep(j,w)\n\t\t{\n\t\t\tif(s[i][j] == 'E' || s[i][j] == 'N' || s[i][j] == 'W' || s[i][j] == 'S')\n\t\t\t{\n\t\t\t\tflag = true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn flag;\n}\n\nvoid printS(int h,int w)\n{\n\trep(i,h)\n\t{\n\t\trep(j,w)\n\t\t{\n\t\t\tcout << s[i][j];\n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nint main()\n{\n\tmap<pair<int,int>,int> cmp;\n\n\tcmp[pair<int,int>(0,1)] = 1;\n\tcmp[pair<int,int>(-1,0)] = 2;\n\tcmp[pair<int,int>(0,-1)] = 3;\n\tcmp[pair<int,int>(1,0)] = 4;\n\n\n\twhile(cin >> w >> h)\n\t{\n\t\tif(w == 0 && h == 0) break;\n\n\t\trep(i,h)\n\t\t{\n\t\t\tcin >> s[i];\n\t\t}\n\n\t\tif(!onPerson(h,w))\n\t\t{\n\t\t\tcout << 0 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\n\t\tbool flag = false;\n\n\t\trep(k,180)\n\t\t{\n\t\t\tvector<pair<int,int> > v;\n\t\t\tmap<pair<int,int>,vector<pair<int,int> > > ma;\n\t\t\trep(i,h) \n\t\t\t{\n\t\t\t\trep(j,w) \n\t\t\t\t{\t\n\t\t\t\t\tif(isPerson(i,j)) \n\t\t\t\t\t{\n\t\t\t\t\t\t//v.push_back(NextPoint(i,j));\n\t\t\t\t\t\tma[NextPoint(i,j)].push_back(make_pair(i,j));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\n\t\t\tbool used[30][30];\n\t\t\trep(i,h) rep(j,w) used[i][j] = true;\n\n\t\t\tmap<pair<int,int>,vector<pair<int,int> > >::iterator ite;\n\t\t\tfor(ite = ma.begin();ite != ma.end();ite++)\n\t\t\t{\n\t\t\t\tint nowy = ite->first.first;\n\t\t\t\tint nowx = ite->first.second;\n\n\t\t\t\trep(j,ite->second.size())\n\t\t\t\t{\n\t\t\t\t\tint ny = (ite->second)[j].first;\n\t\t\t\t\tint nx = (ite->second)[j].second;\n\t\t\t\t\n\t\t\t\t\tif(cmp[pair<int,int>(ny-nowy,nx-nowx)] == 1 && used[nowy][nowx] && used[ny][nx])\n\t\t\t\t\t{\n\t\t\t\t\t\tif(s[nowy][nowx] == 'X')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts[ny][nx] = '.';\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse swap(s[ny][nx],s[nowy][nowx]);\n\n\t\t\t\t\t\tused[nowy][nowx] = false;\n\t\t\t\t\t\tused[ny][nx] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\trep(j,ite->second.size())\n\t\t\t\t{\n\t\t\t\t\tint ny = (ite->second)[j].first;\n\t\t\t\t\tint nx = (ite->second)[j].second;\n\n\t\t\t\t\tif(cmp[pair<int,int>(ny-nowy,nx-nowx)] == 2 && used[nowy][nowx] && used[ny][nx])\n\t\t\t\t\t{\n\t\t\t\t\t\tif(s[nowy][nowx] == 'X')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts[ny][nx] = '.';\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse swap(s[ny][nx],s[nowy][nowx]);\n\n\t\t\t\t\t\tused[nowy][nowx] = false;\n\t\t\t\t\t\tused[ny][nx] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(j,ite->second.size())\n\t\t\t\t{\n\t\t\t\t\tint ny = (ite->second)[j].first;\n\t\t\t\t\tint nx = (ite->second)[j].second;\n\n\t\t\t\t\tif(cmp[pair<int,int>(ny-nowy,nx-nowx)] == 3 && used[nowy][nowx] && used[ny][nx])\n\t\t\t\t\t{\n\t\t\t\t\t\tif(s[nowy][nowx] == 'X') s[ny][nx] = '.';\n\t\t\t\t\t\telse swap(s[ny][nx],s[nowy][nowx]);\n\n\t\t\t\t\t\tused[ny][nx] = false;\n\t\t\t\t\t\tused[nowy][nowx] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\trep(j,ite->second.size())\n\t\t\t\t{\n\t\t\t\t\tint ny = (ite->second)[j].first;\n\t\t\t\t\tint nx = (ite->second)[j].second;\n\n\t\t\t\t\tif(cmp[pair<int,int>(ny-nowy,nx-nowx)] == 4 && used[nowy][nowx] && used[ny][nx])\n\t\t\t\t\t{\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(s[nowy][nowx] == 'X')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts[ny][nx] = '.';\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse swap(s[ny][nx],s[nowy][nowx]);\n\n\t\t\t\t\t\tused[nowy][nowx] = false;\n\t\t\t\t\t\tused[ny][nx] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!onPerson(h,w))\n\t\t\t{\n\t\t\t\tcout << k+1 << endl;\n\t\t\t\tflag = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!flag) cout << \"NA\" << endl;\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1236,
"score_of_the_acc": -0.0688,
"final_rank": 8
},
{
"submission_id": "aoj_0210_1171808",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <iterator>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\n\nstring s[30];\nint h,w;\nint dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1};\n\npair<int,int> NextPoint(int y,int x)\n{\n\tpair<int,int> p;\n\tif(s[y][x] == 'E')\n\t{\n\t\tif(s[y+1][x] == '.' || s[y+1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'S';\n\n\t\t\tp.first = y+1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x+1] == '.' || s[y][x+1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'E';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x+1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y-1][x] == '.' || s[y-1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'N';\n\n\t\t\tp.first = y-1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x-1] == '.' || s[y][x-1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'W';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x-1;\n\t\t\treturn p;\n\t\t}\n\t}\n\telse if(s[y][x] == 'N')\n\t{\n\t\tif(s[y][x+1] == '.' || s[y][x+1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'E';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x+1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y-1][x] == '.' || s[y-1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'N';\n\n\t\t\tp.first = y-1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x-1] == '.' || s[y][x-1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'W';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x-1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y+1][x] == '.' || s[y+1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'S';\n\n\t\t\tp.first = y+1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t}\n\telse if(s[y][x] == 'W')\n\t{\n\t\tif(s[y-1][x] == '.' || s[y-1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'N';\n\n\t\t\tp.first = y-1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x-1] == '.' || s[y][x-1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'W';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x-1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y+1][x] == '.' || s[y+1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'S';\n\n\t\t\tp.first = y+1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x+1] == '.' || s[y][x+1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'E';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x+1;\n\t\t\treturn p;\n\t\t}\n\t}\n\telse if(s[y][x] == 'S')\n\t{\n\t\tif(s[y][x-1] == '.' || s[y][x-1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'W';\n\n\t\t\tp.first = y;\n\t\t\tp.second = x-1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y+1][x] == '.' || s[y+1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'S';\n\n\t\t\tp.first = y+1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y][x+1] == '.' || s[y][x+1] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'E';\n\t\t\tp.first = y;\n\t\t\tp.second = x+1;\n\t\t\treturn p;\n\t\t}\n\t\telse if(s[y-1][x] == '.' || s[y-1][x] == 'X')\n\t\t{\n\t\t\ts[y][x] = 'N';\n\n\t\t\tp.first = y-1;\n\t\t\tp.second = x;\n\t\t\treturn p;\n\t\t}\n\t}\n}\n\nbool can(int y,int x)\n{\n\tif(0 <= y & y < h && 0 <= x && x < w)\n\t{\n\t\treturn true;\n\t}\n\telse return false;\n}\n\nbool isPerson(int y,int x)\n{\n\tif(s[y][x] == 'E' || s[y][x] == 'W' || s[y][x] == 'S' || s[y][x] == 'N')\n\t{\n\t\treturn true;\n\t}\n\telse return false;\n}\n\nbool onPerson(int h,int w)\n{\n\tbool flag = false;\n\n\trep(i,h)\n\t{\n\t\trep(j,w)\n\t\t{\n\t\t\tif(s[i][j] == 'E' || s[i][j] == 'N' || s[i][j] == 'W' || s[i][j] == 'S')\n\t\t\t{\n\t\t\t\tflag = true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn flag;\n}\n\nvoid printS(int h,int w)\n{\n\trep(i,h)\n\t{\n\t\trep(j,w)\n\t\t{\n\t\t\tcout << s[i][j];\n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nint main()\n{\n\tmap<pair<int,int>,int> cmp;\n\n\tcmp[pair<int,int>(0,1)] = 1;\n\tcmp[pair<int,int>(-1,0)] = 2;\n\tcmp[pair<int,int>(0,-1)] = 3;\n\tcmp[pair<int,int>(1,0)] = 4;\n\n\n\twhile(cin >> w >> h)\n\t{\n\t\tif(w == 0 && h == 0) break;\n\n\t\trep(i,h)\n\t\t{\n\t\t\tcin >> s[i];\n\t\t}\n\n\t\tif(!onPerson(h,w))\n\t\t{\n\t\t\tcout << 0 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\n\t\tbool flag = false;\n\n\t\trep(k,180)\n\t\t{\n\t\t\tvector<pair<int,int> > v;\n\t\t\tmap<pair<int,int>,vector<pair<int,int> > > ma;\n\t\t\trep(i,h) \n\t\t\t{\n\t\t\t\trep(j,w) \n\t\t\t\t{\t\n\t\t\t\t\tif(isPerson(i,j)) \n\t\t\t\t\t{\n\t\t\t\t\t\t//v.push_back(NextPoint(i,j));\n\t\t\t\t\t\tma[NextPoint(i,j)].push_back(make_pair(i,j));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\n\t\t\tbool used[30][30];\n\t\t\trep(i,h) rep(j,w) used[i][j] = true;\n\n\t\t\tmap<pair<int,int>,vector<pair<int,int> > >::iterator ite;\n\t\t\tfor(ite = ma.begin();ite != ma.end();ite++)\n\t\t\t{\n\t\t\t\tint nowy = ite->first.first;\n\t\t\t\tint nowx = ite->first.second;\n\n\t\t\t\trep(j,ite->second.size())\n\t\t\t\t{\n\t\t\t\t\tint ny = (ite->second)[j].first;\n\t\t\t\t\tint nx = (ite->second)[j].second;\n\t\t\t\t\n\t\t\t\t\tif(cmp[pair<int,int>(ny-nowy,nx-nowx)] == 1 && used[nowy][nowx] && used[ny][nx])\n\t\t\t\t\t{\n\t\t\t\t\t\tif(s[nowy][nowx] == 'X')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts[ny][nx] = '.';\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse swap(s[ny][nx],s[nowy][nowx]);\n\n\t\t\t\t\t\tused[nowy][nowx] = false;\n\t\t\t\t\t\tused[ny][nx] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\trep(j,ite->second.size())\n\t\t\t\t{\n\t\t\t\t\tint ny = (ite->second)[j].first;\n\t\t\t\t\tint nx = (ite->second)[j].second;\n\n\t\t\t\t\tif(cmp[pair<int,int>(ny-nowy,nx-nowx)] == 2 && used[nowy][nowx] && used[ny][nx])\n\t\t\t\t\t{\n\t\t\t\t\t\tif(s[nowy][nowx] == 'X')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts[ny][nx] = '.';\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse swap(s[ny][nx],s[nowy][nowx]);\n\n\t\t\t\t\t\tused[nowy][nowx] = false;\n\t\t\t\t\t\tused[ny][nx] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(j,ite->second.size())\n\t\t\t\t{\n\t\t\t\t\tint ny = (ite->second)[j].first;\n\t\t\t\t\tint nx = (ite->second)[j].second;\n\n\t\t\t\t\tif(cmp[pair<int,int>(ny-nowy,nx-nowx)] == 3 && used[nowy][nowx] && used[ny][nx])\n\t\t\t\t\t{\n\t\t\t\t\t\tif(s[nowy][nowx] == 'X') s[ny][nx] = '.';\n\t\t\t\t\t\telse swap(s[ny][nx],s[nowy][nowx]);\n\n\t\t\t\t\t\tused[ny][nx] = false;\n\t\t\t\t\t\tused[nowy][nowx] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\trep(j,ite->second.size())\n\t\t\t\t{\n\t\t\t\t\tint ny = (ite->second)[j].first;\n\t\t\t\t\tint nx = (ite->second)[j].second;\n\n\t\t\t\t\tif(cmp[pair<int,int>(ny-nowy,nx-nowx)] == 4 && used[nowy][nowx] && used[ny][nx])\n\t\t\t\t\t{\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(s[nowy][nowx] == 'X')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts[ny][nx] = '.';\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse swap(s[ny][nx],s[nowy][nowx]);\n\n\t\t\t\t\t\tused[nowy][nowx] = false;\n\t\t\t\t\t\tused[ny][nx] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!onPerson(h,w))\n\t\t\t{\n\t\t\t\tcout << k+1 << endl;\n\t\t\t\tflag = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\n\t\t\t\n\n\t\t\tif(!onPerson(h,w))\n\t\t\t{\n\t\t\t\tcout << k+1 << endl;\n\t\t\t\tflag = true;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\n\t\tif(!flag) cout << \"NA\" << endl;\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1236,
"score_of_the_acc": -0.3187,
"final_rank": 11
},
{
"submission_id": "aoj_0210_1147856",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\nusing namespace std;\n\nint foo(char c) {\n\tswitch(c) {\n\t\tcase 'N' : return 0;\n\t\tcase 'E' : return 1;\n\t\tcase 'S' : return 2;\n\t\tcase 'W' : return 3;\n\t}\n\treturn -1;\n}\n\nchar bar(int n) {\n\tswitch(n) {\n\t\tcase 0 : return 'N';\n\t\tcase 1 : return 'E';\n\t\tcase 2 : return 'S';\n\t\tcase 3 : return 'W';\n\t}\n\treturn '@';\n}\n\nint dx[] = {1,0,-1,0};\nint dy[] = {0,-1,0,1};\n\nint W, H;\nbool valid(int i, int j) {\n\treturn 0 <= i && i < H && 0 <= j && j < W;\n}\n\nint main() {\n\twhile(cin >> W >> H, W || H) {\n\t\tvector<string> sq;\n\t\tfor(int i = 0; i < H; i++) {\n\t\t\tstring s;\n\t\t\tcin >> s; sq.push_back(s);\n\t\t}\n\n\t\tint ret = -1;\n\t\tfor(int t = 0; t < 180; t++) {\n\t\t\tvector<string> nex;\n\n\t\t\t/* turn */\n\t\t\tfor(int i = 0; i < sq.size(); i++) {\n\t\t\t\tfor(int j = 0; j < sq[i].size(); j++) {\n\t\t\t\t\tif(foo(sq[i][j]) != -1) {\n\t\t\t\t\t\tfor(int k = 0; k < 4; k++) {\n\t\t\t\t\t\t\tint x,y;\n\t\t\t\t\t\t\tint dir = (k + 4 - foo(sq[i][j])) % 4;\n\t\t\t\t\t\t\ty = i + dy[dir];\n\t\t\t\t\t\t\tx = j + dx[dir];\n\t\t\t\t\t\t\tif(!valid(y, x))\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\tif(sq[y][x] == '.' || sq[y][x] == 'X') {\n\t\t\t\t\t\t\t\tsq[i][j] = bar((5 - dir)%4);\n\t\t\t\t\t\t\t\tbreak;\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\t/* debug \n\t\t\tif(t < 20) {\n\t\t\t\tfor(int i = 0; i < sq.size(); i++) {\n\t\t\t\t\tfor(int j = 0; j < sq[i].size(); j++) {\n\t\t\t\t\t\tcout << sq[i][j];\n\t\t\t\t\t} cout << endl;\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\t// */\n\n\t\t\t/* move */\n\t\t\tfor(int i = 0; i < 4; i++) {\n\t\t\t\t/*\n\t\t\t\tif(t < 20)\n\t\t\t\t\tcout << bar((3-i)%4) << endl;\n\t\t\t\t// */\n\t\t\t\tfor(int j = 0; j < sq.size(); j++) {\n\t\t\t\t\tfor(int k = 0; k < sq[j].size(); k++) {\n\t\t\t\t\t\tif(sq[j][k] == bar((3-i)%4)) {\n\t\t\t\t\t\t\tint x, y;\n\t\t\t\t\t\t\tx = k + dx[(i+2)%4];\n\t\t\t\t\t\t\ty = j + dy[(i+2)%4];\n\t\t\t\t\t\t\tif(valid(y,x) && sq[y][x] == '.') {\n\t\t\t\t\t\t\t\tsq[y][x] = (int)sq[j][k] - ('A' - 'a');\n\t\t\t\t\t\t\t\tsq[j][k] = '@';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(valid(y,x) && sq[y][x] == 'X') {\n\t\t\t\t\t\t\t\tsq[y][x] = 'x';\n\t\t\t\t\t\t\t\tsq[j][k] = '@';\n\t\t\t\t\t\t\t\tret = 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}\n\t\t\t/* debug \n\t\t\tif(t < 20) {\n\t\t\t\tfor(int i = 0; i < sq.size(); i++) {\n\t\t\t\t\tfor(int j = 0; j < sq[i].size(); j++) {\n\t\t\t\t\t\tcout << sq[i][j];\n\t\t\t\t\t} cout << endl;\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\t// */\n\n\t\t\tfor(int i = 0; i < sq.size(); i++) {\n\t\t\t\tfor(int j = 0; j < sq[i].size(); j++) {\n\t\t\t\t\tif(sq[i][j] == '@')\n\t\t\t\t\t\tsq[i][j] = '.';\n\t\t\t\t\telse if(sq[i][j] == 'x')\n\t\t\t\t\t\tsq[i][j] = 'X';\n\t\t\t\t\tif(sq[i][j] == 'n' || sq[i][j] == 'e' || sq[i][j] == 'w' || sq[i][j] == 's')\n\t\t\t\t\t\tsq[i][j] = (int)sq[i][j] + 'A' - 'a';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < sq.size(); i++) {\n\t\t\tfor(int j = 0; j < sq.size(); j++) {\n\t\t\t\tif(foo(sq[i][j]) != -1) {\n\t\t\t\t\tret = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(ret == -1)\n\t\t\tcout << \"NA\" << endl;\n\t\telse\n\t\t\tcout << ret + 1 << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -0.0625,
"final_rank": 6
},
{
"submission_id": "aoj_0210_1061585",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <deque>\n#include <string>\n#include <cmath>\n#include <cstdio>\n#define FOR(I,A,B) for(int I =(A);I<(B);++I)\n#define FORE(I,B) for(int I =1;I<=(B);++I)\n#define REP(I,A) FOR(I,0,A)\nconst int dx[]={1,0,-1,0},dy[]={0,-1,0,1};\nconst char dc[]={'E','N','W','S'};\nconst char dcc[]={'e','n','w','s'};\nusing namespace std;\n\nint main() {\n\t// your code goes here\n\tint W,H;\n\twhile (cin >> W >> H && W){\n\tchar tmp;\n\tchar maps[32][32]={};\n\tFORE(i,H)\n\t\tFORE(j,W)\n\t\t\tcin >> maps[i][j];\n\tbool ans;\n\tint next=0;\n\twhile(true){\n\t\tans=false;\n\t\tFORE(j,W)\n\t\t\tFORE(i,H){\n\t\t\t\tREP(k,4)\n\t\t\t\t\tif(maps[i][j]==dc[k]){\n\t\t\t\t\t\tREP(l,4){\n\t\t\t\t\t\t\tint n=(k+l+3)%4;\n\t\t\t\t\t\t\tif(maps[i+dy[n]][j+dx[n]]=='.'||maps[i+dy[n]][j+dx[n]]=='X'){\n\t\t\t\t\t\t\t\tmaps[i][j]=dc[n];\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\tans=true;\n\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t}\n\t\tFORE(i,H)\n\t\t\tFORE(j,W)\n\t\t\t\tif(maps[i][j]=='.'||maps[i][j]=='X'){\n\t\t\t\t\tREP(k,4)\n\t\t\t\t\t\tif(maps[i+dy[k]][j+dx[k]]==dc[(k+2)%4]){\n\n\t\t\t\t\t\t\tif(maps[i][j]=='.')\n\t\t\t\t\t\t\tmaps[i][j]=dcc[(k+2)%4];\n\t\t\t\t\t\t\tmaps[i+dy[k]][j+dx[k]]='x';\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t}\n\t\tFORE(i,H){\n\t\t\tFORE(j,W){\n\t\t\t\tif(maps[i][j]=='x')\n\t\t\t\t\tmaps[i][j]='.';\n\t\t\t\tREP(k,4)\n\t\t\t\t\tif(maps[i][j]==dcc[k])\n\t\t\t\t\t\tmaps[i][j]=dc[k];\n\t\t\t//\tcout << maps[i][j];\n\t\t\t}\n\t//\tcout << endl;\n\t\t}\n\t\tif(!ans || next>180)\n\t\t\tbreak;\n\t\tnext++;\n\t}\n\tif(next>180)\n\tcout << \"NA\" << endl;\n\telse \n\tcout << next << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1164,
"score_of_the_acc": -0.0406,
"final_rank": 2
},
{
"submission_id": "aoj_0210_1006111",
"code_snippet": "#include<iostream>\nusing namespace std;\nint dy[]={-1,0,1,0};\nint dx[]={0,1,0,-1};\nbool isEmpty(char ch){\n if(ch=='.'||ch=='X')return true;\n else return false;\n}\nint change(char ch){\n if(ch=='N')return 0;\n if(ch=='E')return 1;\n if(ch=='S')return 2;\n if(ch=='W')return 3;\n return -1;\n}\nchar change2(int x){\n if(x==0)return 'N';\n if(x==1)return 'E';\n if(x==2)return 'S';\n if(x==3)return 'W';\n return '-';\n}\nchar t[30][30],tmp[30][30];\nint W,H,gy[900],gx[900],size;\n \nint main(){\n while(1){\n cin>>W>>H;\n if(W==0&&H==0)break;\n size=0;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n\tcin>>t[i][j];\n\tif(t[i][j]=='X'){\n\t gy[size]=i;\n\t gx[size]=j;\n\t size++;\n\t}\n }\n }\n\n int ans=0;\n while(1){\n ///////////////////////////////////////////////\n bool flag=false;\n for(int i=0;i<H;i++){\n\tfor(int j=0;j<W;j++){\n\t if(change(t[i][j])==-1)continue;\n\t flag=true;\n\t int dir=change(t[i][j]);\n\t for(int k=5;k>=2;k--){\n\t int ndir=(dir+k)%4;\n\t int ny=i+dy[ndir],nx=j+dx[ndir];\n\t if(isEmpty(t[ny][nx])){\n\t t[i][j]=change2(ndir);\n\t break;\n\t }\n\t }//k\n\t}//j\n }//i\n if(flag==false)break;\n ///////////////////////////////////////////////\n ans++;\n if(ans>180)break;\n /////////////////////////////////////////////// w s e n\n \n for(int i=0;i<H;i++){\n\tfor(int j=0;j<W;j++){\n\t if(change(t[i][j])==-1){\n\t tmp[i][j]=t[i][j];\n\t }else tmp[i][j]='.';\n\t}\n }\n \n for(int k=3;k>=0;k--){\n\tfor(int i=0;i<H;i++){\n\t for(int j=0;j<W;j++){\n\t if(k!=change(t[i][j]))continue;\n\t int ny=i+dy[k],nx=j+dx[k];\n\t if(isEmpty(t[ny][nx])&&isEmpty(tmp[ny][nx])){\n\t tmp[ny][nx]=t[i][j];\n\t }else{\n\t tmp[i][j]=t[i][j];\n\t }\n\t }\n\t}\n }\n \n for(int i=0;i<H;i++){\n\tfor(int j=0;j<W;j++){\n\t t[i][j]=tmp[i][j];\n\t}\n }\n\n for(int i=0;i<size;i++){\n\tt[gy[i]][gx[i]]='X';\n }\n ///////////////////////////////////////////////\n \n }\n if(ans>180)cout<<\"NA\"<<endl;\n else cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1172,
"score_of_the_acc": -0.0437,
"final_rank": 4
},
{
"submission_id": "aoj_0210_1005427",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint m[50][50];\nint w[50][50];\nchar str[50][50];\nint dx[]={0,-1,0,1};\nint dy[]={1,0,-1,0};\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&b,&a),a){\n\t\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\t\tfor(int i=0;i<=180;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\tm[j][k]=-1;\n\t\t}\n\t\tint ret=-1;\n\t\tfor(int i=0;i<a;i++)\n\t\t\tfor(int j=0;j<b;j++){\n\t\t\t\tif(str[i][j]=='E')m[i][j]=0;\n\t\t\t\tif(str[i][j]=='N')m[i][j]=1;\n\t\t\t\tif(str[i][j]=='W')m[i][j]=2;\n\t\t\t\tif(str[i][j]=='S')m[i][j]=3;\n\t\t\t}\n\t\tfor(int i=0;i<180;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\tw[j][k]=0;\n\t\t\t\t\tif(!~m[j][k])continue;\n\t\t\t\t\tfor(int l=0;l<4;l++){\n\t\t\t\t\t\tint tx=j+dx[(m[j][k]+l+3)%4];\n\t\t\t\t\t\tint ty=k+dy[(m[j][k]+l+3)%4];\n\t\t\t\t\t\tif(0<=tx&&tx<a&&0<=ty&&ty<b&&!~m[tx][ty]&&str[tx][ty]!='#'){\n\t\t\t\t\t\t\tm[j][k]=(m[j][k]+l+3)%4;\n\t\t\t\t\t\t\tw[j][k]=1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=0;j<4;j++){\n\t\t\t\tfor(int k=0;k<a;k++){\n\t\t\t\t\tfor(int l=0;l<b;l++){\n\t\t\t\t\t\tif(m[k][l]!=(2+j)%4)continue;\n\t\t\t\t\t\tif(w[k][l]){\n\t\t\t\t\t\t\tint tx=k+dx[m[k][l]];\n\t\t\t\t\t\t\tint ty=l+dy[m[k][l]];\n\t\t\t\t\t\t\tif(!~m[tx][ty]){\n\t\t\t\t\t\t\t\tm[tx][ty]=m[k][l];\n\t\t\t\t\t\t\t\tm[k][l]=-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\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\tif(str[j][k]=='X')m[j][k]=-1;\n\t\t\tbool ok=true;\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\tif(~m[j][k])ok=false;\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\tif(~m[j][k])printf(\"%d\",m[j][k]);else printf(\".\");\n\t\t\t\t}\n\t\t\t\tprintf(\"\\n\");\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t*/\tif(ok){ret=i+1;break;}\n\t\t}\n\t\tif(ret==-1)printf(\"NA\\n\");\n\t\telse printf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1060,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0210_1005139",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nconst string Direction = {\"ENWS\"};\nconst int Next[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};\nenum {Y, X};\n\nint main() {\n int w, h;\n while(cin >> w >> h, w | h) {\n int time;\n vector<string> field(h);\n for(int i = 0; i < h; ++i) cin >> field[i];\n\n for(time = 0; time <= 180; ++time) {\n// cout << time << endl;\n// for(auto& s: field)cout<<s<<endl;\n bool ok = true;\n for(const auto& line: field) for(const auto& c: line)\n if(Direction.find(c) != string::npos) ok = false;\n if(ok) break;\n // turn\n for(int i = 0; i < h; ++i) for(int j = 0; j < w; ++j) {\n int index = Direction.find(field[i][j]);\n if(index == string::npos) continue;\n for(int k = 0; k < 4; ++k) {\n int d = (index + 3 + k) % 4;\n int y = i + Next[d][Y];\n int x = j + Next[d][X];\n if(field[y][x] != '.' && field[y][x] != 'X') continue;\n field[i][j] = Direction[d];\n break;\n }\n }\n // move\n vector<vector<int>> used(h, vector<int>(w, 0));\n for(int i = 0; i < h; ++i) for(int j = 0; j < w; ++j) {\n if(field[i][j] != '.' && field[i][j] != 'X') continue;\n if(used[i][j]) continue;\n for(int d = 0; d < 4; ++d) {\n int y = i + Next[d][Y];\n int x = j + Next[d][X];\n if(y < 0 || h <= y) continue;\n if(x < 0 || w <= x) continue;\n if(field[y][x] != Direction[(d + 2) % 4]) continue;\n if(used[y][x]) continue;\n used[i][j] = 1;\n used[y][x] = 1;\n if(field[i][j] == '.') field[i][j] = field[y][x];\n field[y][x] = '.';\n break;\n }\n }\n }\n\n if(time > 180) cout << \"NA\" << endl;\n else cout << time << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1248,
"score_of_the_acc": -0.3234,
"final_rank": 12
},
{
"submission_id": "aoj_0210_992370",
"code_snippet": "#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\n\nclass Maze {\npublic:\n\tmap<char, char> next;\n\tmap<char, char> prev;\n\tmap<char, pair<int,int>> xy;\n\n\tMaze(vector<string> maze) : maze(maze), rest(-1) {\n\t\tnext = { {'N','E'}, {'E','S'}, {'S','W'}, {'W','N'} };\n\t\tprev = { {'E','N'}, {'S','E'}, {'W','S'}, {'N','W'} };\n\t\txy = { {'N', {0, -1}}, {'E', {1, 0}}, {'S', {0, 1}}, {'W', {-1, 0}} };\n\t\tH = maze.size();\n\t\tW = maze[0].size();\n\t\trest = countPeople();\n\t}\n\n\tvoid move() {\n\t\tchangeDirection();\n\t\tgoAhead();\n\t}\n\n\tint countPeople() {\n\t\tif (0 <= rest) return rest;\n\t\tint count = 0;\n\t\tfor (string str : maze) {\n\t\t\tfor (char c : str) {\n\t\t\t\tcount += isPerson(c);\n\t\t\t}\n\t\t}\n\t\treturn count;\n\t}\n\nprivate:\n\tvector<string> maze;\n\tint H, W;\n\tint rest;\n\n\tbool isPerson(char c) {\n\t\treturn (isalpha(c) && c != 'X');\n\t}\n\n\tbool isPassable(char c) {\n\t\treturn (c == '.' || c == 'X');\n\t}\n\n\tvoid changeDirection() {\n\t\tfor (int i=0; i<H; ++i) {\n\t\t\tfor (int j=0; j<W; ++j) {\n\t\t\t\tif ( ! isPerson(maze[i][j])) continue;\n\t\t\t\tchar dir = next[maze[i][j]];\n\t\t\t\tfor (int k=0; k<4; ++k) {\n\t\t\t\t\tint x = j + xy[dir].first;\n\t\t\t\t\tint y = i + xy[dir].second;\n\t\t\t\t\tif (maze[y][x] == '.' || maze[y][x] == 'X') {\n\t\t\t\t\t\tmaze[i][j] = dir;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tdir = prev[dir];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid goAhead () {\n\t\tfor (int i=0; i<H; ++i) {\n\t\t\tfor (int j=0; j<W; ++j) {\n\t\t\t\tif ( ! isPassable(maze[i][j])) continue;\n\t\t\t\tchar dir = 'E';\n\t\t\t\tfor (int k=0; k<4; ++k) {\n\t\t\t\t\tint x = j + xy[dir].first;\n\t\t\t\t\tint y = i + xy[dir].second;\n\t\t\t\t\tif (0 <= x && x < W && 0 <= y && y < H && maze[y][x] == next[next[dir]]) {\n\t\t\t\t\t\tmaze[y][x] = '*';\n\t\t\t\t\t\tif (maze[i][j] == '.') {\n\t\t\t\t\t\t\tmaze[i][j] = tolower(next[next[dir]]);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\trest --;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tdir = prev[dir];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i=0; i<(int)maze.size(); ++i) {\n\t\t\tfor (int j=0; j<(int)maze[i].size(); ++j) {\n\t\t\t\tif (maze[i][j] == '*') {\n\t\t\t\t\tmaze[i][j] = '.';\n\t\t\t\t} else {\n\t\t\t\t\tmaze[i][j] = toupper(maze[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nint main() {\n\tios::sync_with_stdio(false);\n\n\tint W, H;\n\twhile (cin >> W >> H && (W || H)) {\n\t\tvector<string> input(H);\n\t\tfor (int i=0; i<H; ++i) cin >> input[i];\n\n\t\tMaze maze(input);\n\n\t\tif (maze.countPeople() == 0) {\n\t\t\tcout << 0 << endl;\n\t\t\tcontinue;\n\t\t}\n\n\t\tint second = 0;\n\t\twhile (0 < maze.countPeople() && second <= 180) {\n\t\t\tmaze.move();\n\t\t\tsecond ++;\n\t\t}\n\t\tif (second <= 180) cout << second << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1232,
"score_of_the_acc": -0.8172,
"final_rank": 15
},
{
"submission_id": "aoj_0210_992368",
"code_snippet": "#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\n\nclass Maze {\npublic:\n\tmap<char, char> next;\n\tmap<char, char> prev;\n\tmap<char, pair<int,int>> xy;\n\n\tMaze(vector<string> maze) : maze(maze), rest(-1) {\n\t\tnext = { {'N','E'}, {'E','S'}, {'S','W'}, {'W','N'} };\n\t\tprev = { {'E','N'}, {'S','E'}, {'W','S'}, {'N','W'} };\n\t\txy = { {'N', {0, -1}}, {'E', {1, 0}}, {'S', {0, 1}}, {'W', {-1, 0}} };\n\t\tH = maze.size();\n\t\tW = maze[0].size();\n\t\trest = countPeople();\n\t}\n\n\tvoid move() {\n\t\tchangeDirection();\n\t\tgoAhead();\n\t}\n\n\tint countPeople() {\n\t\tif (0 <= rest) return rest;\n\t\tint count = 0;\n\t\tfor (string str : maze) {\n\t\t\tfor (char c : str) {\n\t\t\t\tcount += isPerson(c);\n\t\t\t}\n\t\t}\n\t\treturn count;\n\t}\n\nprivate:\n\tvector<string> maze;\n\tint H, W;\n\tint rest;\n\n\tbool isPerson(char c) {\n\t\treturn (isalpha(c) && c != 'X');\n\t}\n\n\tbool isPassable(char c) {\n\t\treturn (c == '.' || c == 'X');\n\t}\n\n\tvoid changeDirection() {\n\t\tfor (int i=0; i<H; ++i) {\n\t\t\tfor (int j=0; j<W; ++j) {\n\t\t\t\tif ( ! isPerson(maze[i][j])) continue;\n\t\t\t\tchar dir = next[maze[i][j]];\n\t\t\t\tfor (int k=0; k<4; ++k) {\n\t\t\t\t\tint x = j + xy[dir].first;\n\t\t\t\t\tint y = i + xy[dir].second;\n\t\t\t\t\tif (maze[y][x] == '.' || maze[y][x] == 'X') {\n\t\t\t\t\t\tmaze[i][j] = dir;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tdir = prev[dir];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid goAhead () {\n\t\tfor (int i=0; i<H; ++i) {\n\t\t\tfor (int j=0; j<W; ++j) {\n\t\t\t\tif ( ! isPassable(maze[i][j])) continue;\n\t\t\t\tchar dir = 'E';\n\t\t\t\tfor (int k=0; k<4; ++k) {\n\t\t\t\t\tint x = j + xy[dir].first;\n\t\t\t\t\tint y = i + xy[dir].second;\n\t\t\t\t\tif (0 <= x && x < W && 0 <= y && y < H && maze[y][x] == next[next[dir]]) {\n\t\t\t\t\t\tmaze[y][x] = '*';\n\t\t\t\t\t\tif (maze[i][j] == '.') {\n\t\t\t\t\t\t\tmaze[i][j] = tolower(next[next[dir]]);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\trest --;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tdir = prev[dir];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i=0; i<(int)maze.size(); ++i) {\n\t\t\tfor (int j=0; j<(int)maze[i].size(); ++j) {\n\t\t\t\tif (maze[i][j] == '*') {\n\t\t\t\t\tmaze[i][j] = '.';\n\t\t\t\t} else {\n\t\t\t\t\tmaze[i][j] = toupper(maze[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nint main() {\n\tint W, H;\n\twhile (cin >> W >> H && (W || H)) {\n\t\tvector<string> input(H);\n\t\tfor (int i=0; i<H; ++i) cin >> input[i];\n\n\t\tMaze maze(input);\n\n\t\tif (maze.countPeople() == 0) {\n\t\t\tcout << 0 << endl;\n\t\t\tcontinue;\n\t\t}\n\n\t\tint second = 0;\n\t\twhile (0 < maze.countPeople() && second <= 180) {\n\t\t\tmaze.move();\n\t\t\tsecond ++;\n\t\t}\n\t\tif (second <= 180) cout << second << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1228,
"score_of_the_acc": -1.0656,
"final_rank": 18
},
{
"submission_id": "aoj_0210_831773",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\n#include<string>\nusing namespace std;\ntypedef pair < int , int > Pi;\ntypedef pair < int , Pi > Pii;\n#define fr first\n#define sc second\nconst int dy[][4] = {{1,0,-1,0},{0,-1,0,1},{-1,0,1,0},{0,1,0,-1}};\nconst int dx[][4] = {{0,1,0,-1},{1,0,-1,0},{0,-1,0,1},{-1,0,1,0}};\nconst int dm[][4] = {{3,0,1,2},{0,1,2,3},{1,2,3,0},{2,3,0,1}};\nconst int my[] = { 0, -1, 0, 1}, mx[] = { 1, 0, -1, 0};\nconst int md[] = { 2, 3, 0, 1};\nint w, h;\nchar mas[30][30];\nvector< Pii > vc;\nstring tmp = \"ENWS\";\nint search( int y , int x){\n for(int i = 0 ; i < vc.size() ; i++ ){\n if(Pi(y,x) == vc[i].sc){\n return i;\n }\n }\n return -1;\n}\nvector< Pii > solve(){\n //向き変えるじゃん\n vector< Pii > java;\n for(int i = 0 ; i < vc.size() ; i++ ){\n //向きは毎回変えるじゃん(震え声)\n for(int j = 0 ; j < 4 ; j++ ){\n int yy = vc[i].sc.fr + dy[vc[i].fr][j];\n int xx = vc[i].sc.sc + dx[vc[i].fr][j];\n if(mas[yy][xx] != '#' && search(yy,xx) == -1){\n vc[i].fr = dm[vc[i].fr][j];\n break;\n }\n }\n }\n //動けないひとをプッシュしよう\n bool list[1000] = {};\n for(int i = 0 ; i < h ; i++ ){\n for(int j = 0 ; j < w ; j++ ){\n if(mas[i][j] == '#' || search(i,j) != -1) continue;\n for(int k = 0 ; k < 4 ; k++ ){\n int ny = i + my[k], nx = j + mx[k], iti;\n if((iti = search(ny,nx)) == -1) continue;\n if(vc[iti].fr == md[k]){\n if(mas[i][j] != 'X') java.push_back(Pii(vc[iti].fr,Pi(i,j)));\n list[iti] = true;\n break;\n }\n }\n }\n }\n for(int i = 0 ; i < vc.size() ; i++ ){\n if(!list[i]) java.push_back(vc[i]);\n }\n return java;\n}\nint main(){\n while(cin >> w >> h , w){\n for(int i = 0 ; i < h ; i++ ){\n for(int j = 0 ; j < w ; j++ ){\n cin >> mas[i][j];\n if(tmp.find(mas[i][j]) != string::npos){\n vc.push_back(Pii( tmp.find(mas[i][j]), Pi( i, j)));\n }\n }\n }\n int ret = 0;\n while(ret <= 180 && !vc.empty()){\n vc = solve();\n ret++;\n }\n if(ret == 181) cout << \"NA\" << endl;\n else cout << ret << endl;\n vc.clear();\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1212,
"score_of_the_acc": -0.5594,
"final_rank": 13
},
{
"submission_id": "aoj_0210_681563",
"code_snippet": "#include <iostream>\n#include <cstring>\n\nusing namespace std;\n\nconst int max_size = 31;\n\nvoid p(char a[max_size][max_size], int sizei, int sizej = 0, char *padding = \"\", int offseti = 0, int offsetj = 0){\n\tif(!sizej) sizej = sizei;\n\tfor(int i = 0; i < sizei; i++){\n\t\tfor(int j = 0; j < sizej; j++){\n\t\t\tcout << a[offseti+i][offsetj+j] << padding;\n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nchar dirchr[] = \"ENWS\";\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, -1, 0, 1};\n\nint dirnum(char d){\n\tfor(int i = 0; i < 4; i++){\n\t\tif(dirchr[i] == d) return i;\n\t}\n\t//cout << \"invalid char\" << d << endl;\n\t//exit(0);\n\treturn -1;\n}\n\nvoid changeDirection(char (*_map)[max_size], int i, int j){\n\tint startdir = dirnum(_map[i][j]) + 3; // 現在の向きの右から\n\tfor(int k = 0; k < 4; k++){\n\t\tint dir = (startdir+k)%4;\n\t\tchar destchar = _map[i+dy[dir]][j+dx[dir]];\n\t\tif(destchar == '.' || destchar == 'X'){\n\t\t\t//cout << \"(\" << i << \", \" << j << \"): \" << _map[i][j] << \"->\" << dirchr[dir] << endl;\n\t\t\t_map[i][j] = dirchr[dir];\n\t\t\treturn;\n\t\t}\n\t}\n}\n\nvoid move(char (*_map)[max_size], int i, int j){\n\tint dir = dirnum(_map[i][j]);\n\tchar destchar = _map[i+dy[dir]][j+dx[dir]];\n\tif(destchar == '.'){\n\t\t_map[i+dy[dir]][j+dx[dir]] = _map[i][j];\n\t\t_map[i][j] = 'Z';\n\t}\n\tif(destchar == 'X'){\n\t\t_map[i+dy[dir]][j+dx[dir]] = 'Y'; // 同時脱出制限用\n\t\t_map[i][j] = 'Z';\n\t}\n}\n\nvoid peopleAct(char (*_map)[max_size], int i, int j, void (*func)(char (*)[max_size],int, int), char* filter = \"ENWS\", int filtersize = 4){\n\tfor(int k = 0; k < filtersize; k++){\n\t\tif(_map[i][j] == filter[k]){\n\t\t\t(*func)(_map, i, j);\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nint main(){\n\tchar square[max_size][max_size];\n\n\tint w, h;\n\twhile(cin >> w >> h){\n\t\tif(!w && !h) break;\n\t\tfor(int i = 0; i < h; i++){\n\t\t\tfor(int j = 0; j < w; j++){\n\t\t\t\tcin >> square[i][j];\n\t\t\t}\n\t\t}\n\t\tint time = 0;\n\t\tfor(time = 0; time <= 180; time++){\n\n\t\t\t// 人がいなければ避難終了\n\t\t\tfor(int i = 0; i < h; i++){\n\t\t\t\tfor(int j = 0; j < w; j++){\n\t\t\t\t\tchar c = square[i][j];\n\t\t\t\t\tif(c != '.' && c != '#' && c != 'X'){\n\t\t\t\t\t\tgoto nextloop;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\nnextloop: ;\n\t\t\t// 向きを変える処理\n\t\t\tfor(int i = 0; i < h; i++){\n\t\t\t\tfor(int j = 0; j < w; j++){\n\t\t\t\t\tpeopleAct(square, i, j, changeDirection);\n\t\t\t\t\t//for(int k = 0; k < 4; k++){\n\t\t\t\t\t//\tif(square[i][j] == dirchr[k]){\n\t\t\t\t\t//\t\tchangeDirection(square, i, j);\n\t\t\t\t\t//\t\tbreak;\n\t\t\t\t\t//\t}\n\t\t\t\t\t//}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// 移動する処理\n\t\t\t// 左、下、右、上の順に処理\n\n\t\t\tfor(int i = 0; i < h; i++){\n\t\t\t\tfor(int j = 0; j < w; j++){ // 左から\n\t\t\t\t\tpeopleAct(square, i, j, move, \"W\", 1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = h-1; i >= 0; i--){ // 下から\n\t\t\t\tfor(int j = 0; j < w; j++){\n\t\t\t\t\tpeopleAct(square, i, j, move, \"S\", 1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < h; i++){\n\t\t\t\tfor(int j = w-1; j >= 0; j-- ){ // 右から\n\t\t\t\t\tpeopleAct(square, i, j, move, \"E\", 1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < h; i++){ // 上から\n\t\t\t\tfor(int j = 0; j < w; j++){\n\t\t\t\t\tpeopleAct(square, i, j, move, \"N\", 1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// 後処理\n\t\t\tfor(int i = 0; i < h; i++){\n\t\t\t\tfor(int j = 0; j < w; j++){\n\t\t\t\t\tif(square[i][j] == 'Y'){\n\t\t\t\t\t\tsquare[i][j] = 'X';\n\t\t\t\t\t}\n\t\t\t\t\tif(square[i][j] == 'Z'){\n\t\t\t\t\t\tsquare[i][j] = '.';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//cout << endl;\n\t\t\t//p(square, h, w);\n\t\t\t//getchar();\n\t\t}\n\n\t\t//p(square, h, w);\n\n\t\tif(time <= 180){\n\t\t\tcout << time << endl;\n\t\t}else{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1168,
"score_of_the_acc": -0.0422,
"final_rank": 3
},
{
"submission_id": "aoj_0210_657426",
"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;\n// E, N, W, S\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, -1, 0, 1};\nstring ENWS = \"ENWS\";\n\nint main(){\n int W, H;\n while(cin >> W >> H && W){\n vector<string> grid(H);\n REP(y, H) cin >> grid[y];\n REP(y, H) REP(x, W) if(grid[y][x] == 'X') grid[y][x] = '%';\n int rest = 0;\n REP(y, H) REP(x, W) if(isupper(grid[y][x])) rest++;\n int ans = INF;\n REP(time, 181){\n if(rest == 0) {\n ans = time;\n break;\n }\n REP(y, H) REP(x, W){\n REP(i, 4) if(grid[y][x] == ENWS[i]){\n REP(r, 4){\n int rr = (i + r + 3) % 4;\n int nx = x + dx[rr];\n int ny = y + dy[rr];\n if(valid(nx, ny, W, H) && (grid[ny][nx] == '.' || grid[ny][nx] == '%')){\n grid[y][x] = ENWS[rr];\n goto LOOPOUT;\n }\n }\n }\n LOOPOUT:;\n }\n vector<string> next = grid;\n REP(y, H) REP(x, W) if(grid[y][x] == '.' || grid[y][x] == '%') REP(r, 4){\n int nx = x + dx[r];\n int ny = y + dy[r];\n if(valid(nx, ny, W, H) && grid[ny][nx] == ENWS[(r + 2) % 4]){\n next[ny][nx] = '.';\n if(grid[y][x] == '.') next[y][x] = grid[ny][nx];\n else rest--;\n\n break;\n }\n }\n grid = next;\n }\n if(ans == INF) cout << \"NA\" << endl;\n else cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1224,
"score_of_the_acc": -0.0641,
"final_rank": 7
}
] |
aoj_0211_cpp
|
みんなでジョギング
赤ベコ小学校では、生徒全員が参加する、ちょっと変わったジョギングをします。生徒は、それぞれ独自の周回コースを、自分のペースで走ります。それぞれ自分のコースを 1 周すると小学校に戻ってきます。全員が小学校を同時にスタートしてから、全員が同時に小学校で最初に出会うのは、それぞれ何周したときでしょうか?
生徒の人数
n
、各生徒のコースの 1 周の距離
d
(km) 、各生徒の走る速さ
v
(km/時間)を入力とし、全員が小学校を同時にスタートしてから次に同時に小学校に位置するのは、各生徒がそれぞれ何周したときかを出力するプログラムを作成してください。なお、各生徒は 2
31
-1 周を超えて走ることはありません。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
d
1
v
1
d
2
v
2
:
d
n
v
n
1 行目に生徒の人数
n
(2 ≤
n
≤ 10) が与えられます。続く
n
行に
i
人目の生徒のコースの１周の距離
d
i
(1 ≤
d
i
≤ 10000) と走る速さ
v
i
(1 ≤
v
i
≤ 10000) が与えられます。
データセットの数は 2000 を超えません。
Output
入力データセットごとに、各生徒の周回数を出力します。各生徒の周回数は入力の順番に従ってそれぞれ１行に出力してください。
Sample Input
2
4 3
5 4
5
789 289
166 46
9 4
617 252
972 303
2
8 5
32 20
0
Output for the Sample Input
15
16
1598397732
1209243492
1939462992
1782294192
1360317793
1
1
|
[
{
"submission_id": "aoj_0211_6978139",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct bigint {\n using ll = long long;\n constexpr static long long base = 1000000000;\n constexpr static long long base_digits = 9;\n vector<ll> a;\n ll sign;\n bigint():sign(1){}\n bigint(ll v){*this=v;}\n bigint(const string &s){read(s);}\n void operator=(ll v){\n sign=1;\n if(v<0) sign=-1,v=-v;\n for(;v>0;v=v/base) a.push_back(v%base);\n }\n bigint operator+(const bigint &v) const{\n if(sign==v.sign){\n bigint res=v;\n for(ll i=0,carry=0;i<(ll)max(a.size(),v.a.size())||carry;++i){\n if(i==(ll)res.a.size()) res.a.push_back(0);\n res.a[i]+=carry+(i<(ll)a.size()?a[i]:0);\n carry=res.a[i]>=base;\n if(carry) res.a[i]-=base;\n }\n return res;\n }\n return *this -(-v);\n }\n bigint operator-(const bigint &v) const{\n if(sign==v.sign){\n if(abs()>=v.abs()){\n bigint res=*this;\n for(ll i=0,carry=0;i<(ll)v.a.size()||carry;++i){\n res.a[i]-=carry+(i<(ll)v.a.size()?v.a[i]:0);\n carry=res.a[i]<0;\n if(carry) res.a[i]+=base;\n }\n res.trim();\n return res;\n }\n return -(v-*this);\n }\n return *this+(-v);\n }\n void operator*=(ll v){\n if(v<0) sign=-sign,v=-v;\n for(ll i=0,carry=0;i<(ll)a.size()|| carry;++i){\n if(i ==(ll)a.size()) a.push_back(0);\n ll cur=a[i] *(ll)v+carry;\n carry=(ll)(cur/base);\n a[i]=(ll)(cur%base);\n }\n trim();\n }\n bigint operator*(ll v) const{\n bigint res=*this;\n res *=v;\n return res;\n }\n friend pair<bigint,bigint> divmod(const bigint &a1,const bigint &b1){\n ll norm=base/(b1.a.back()+1);\n bigint a=a1.abs()*norm;\n bigint b=b1.abs()*norm;\n bigint q,r;\n q.a.resize(a.a.size());\n for(ll i=ll(a.a.size())-1;i>=0;i--){\n r *=base;\n r+=a.a[i];\n ll s1=r.a.size()<=b.a.size() ? 0 : r.a[b.a.size()];\n ll s2=r.a.size()<=b.a.size()-1 ? 0 : r.a[b.a.size()-1];\n ll d=((ll)base*s1+s2)/b.a.back();\n r-=b*d;\n while(!r.isZero()&&r<0) r+=b,--d;\n q.a[i]=d;\n }\n q.sign=a1.sign*b1.sign;\n r.sign=a1.sign;\n q.trim();\n r.trim();\n return make_pair(q,r/norm);\n }\n bigint operator/(const bigint &v) const{return divmod(*this,v).first;}\n bigint operator%(const bigint &v) const{return divmod(*this,v).second;}\n void operator/=(ll v){\n if(v<0) sign=-sign,v=-v;\n for(ll i=(ll)a.size()-1,rem=0;i>=0;--i){\n ll cur=a[i]+rem *(ll)base;\n a[i]=(ll)(cur/v);\n rem=(ll)(cur%v);\n }\n trim();\n }\n bigint operator/(ll v) const{bigint res=*this;res/=v;return res;}\n ll operator%(ll v) const{\n if(v<0) v=-v;\n ll m=0;\n for(ll i=ll(a.size())-1;i>=0;--i) m=(a[i]+m *(ll)base)%v;\n return m*sign;\n }\n void operator+=(const bigint &v){*this=*this+v;}\n void operator-=(const bigint &v){*this=*this-v;}\n void operator*=(const bigint &v){*this=*this*v;}\n void operator/=(const bigint &v){*this=*this/v;}\n bool operator<(const bigint &v) const{\n if(sign!=v.sign) return sign<v.sign;\n if(a.size()!=v.a.size()) return a.size()*sign<v.a.size()*v.sign;\n for(ll i=ll(a.size())-1;i>=0;i--){\n if(a[i]!=v.a[i]) return a[i]*sign<v.a[i]*sign;\n }\n return false;\n }\n bool operator>(const bigint &v) const{return v<*this;}\n bool operator<=(const bigint &v) const{return !(v<*this);}\n bool operator>=(const bigint &v) const{return !(*this<v);}\n bool operator==(const bigint &v) const{return !(*this<v)&&!(v<*this);}\n bool operator!=(const bigint &v) const{return *this<v|| v<*this;}\n void trim(){\n while(!a.empty()&&!a.back()) a.pop_back();\n if(a.empty()) sign=1;\n }\n bool isZero() const{return a.empty()||(a.size()==1&&!a[0]);}\n bigint operator-() const{bigint res=*this;res.sign=-sign;return res;}\n bigint abs() const{bigint res=*this;res.sign*=res.sign;return res;}\n ll longValue() const{ll res=0;for(ll i=ll(a.size())-1;i>=0;i--) res=res*base+a[i];return res*sign;}\n friend bigint gcd(const bigint &a,const bigint &b){return b.isZero() ? a : gcd(b,a%b);}\n friend bigint lcm(const bigint &a,const bigint &b){return a/gcd(a,b)*b;}\n void read(const string &s){\n sign=1;\n a.clear();\n ll pos=0;\n while(pos<(ll)s.size()&&(s[pos]=='-'|| s[pos]=='+')){\n if(s[pos]=='-') sign=-sign;\n ++pos;\n }\n for(ll i=s.size()-1;i>=pos;i-=base_digits){\n ll x=0;\n for(ll j=max(pos,i-base_digits+1);j<=i;j++) x=x*10+s[j]-'0';\n a.push_back(x);\n }\n trim();\n }\n friend istream &operator>>(istream &stream,bigint &v){\n string s;\n stream>>s;\n v.read(s);\n return stream;\n }\n friend ostream &operator<<(ostream &stream,const bigint &v){\n if(v.sign==-1) stream<<'-';\n stream<<(v.a.empty()?0:v.a.back());\n for(ll i=(ll)v.a.size()-2;i>=0;--i)\n stream<<setw(base_digits)<<setfill('0')<<v.a[i];\n return stream;\n }\n static vector<ll> convert_base(const vector<ll> &a,ll old_digits,ll new_digits){\n vector<ll> p(max(old_digits,new_digits)+1);\n p[0]=1;\n for(ll i=1;i<(ll)p.size();i++) p[i]=p[i-1]*10;\n vector<ll> res;\n ll cur=0;\n ll cur_digits=0;\n for(ll i=0;i<(ll)a.size();i++){\n cur+=a[i]*p[cur_digits];\n cur_digits+=old_digits;\n while(cur_digits>=new_digits){\n res.push_back(signed(cur%p[new_digits]));\n cur/=p[new_digits];\n cur_digits-=new_digits;\n }\n }\n res.push_back((signed)cur);\n while(!res.empty()&&!res.back()) res.pop_back();\n return res;\n }\n static vector<ll> karatsubaMultiply(const vector<ll> &a,const vector<ll> &b){\n ll n=a.size();\n vector<ll> res(n+n);\n if(n<=32){\n for(ll i=0;i<n;i++)\n for(ll j=0;j<n;j++)\n res[i+j]+=a[i]*b[j];\n return res;\n }\n ll k=n>>1;\n vector<ll> a1(a.begin(),a.begin()+k);\n vector<ll> a2(a.begin()+k,a.end());\n vector<ll> b1(b.begin(),b.begin()+k);\n vector<ll> b2(b.begin()+k,b.end());\n vector<ll> a1b1=karatsubaMultiply(a1,b1);\n vector<ll> a2b2=karatsubaMultiply(a2,b2);\n for(ll i=0;i<k;i++) a2[i]+=a1[i];\n for(ll i=0;i<k;i++) b2[i]+=b1[i];\n vector<ll> r=karatsubaMultiply(a2,b2);\n for(ll i=0;i<(ll)a1b1.size();i++) r[i]-=a1b1[i];\n for(ll i=0;i<(ll)a2b2.size();i++) r[i]-=a2b2[i];\n for(ll i=0;i<(ll)r.size();i++) res[i+k]+=r[i];\n for(ll i=0;i<(ll)a1b1.size();i++) res[i]+=a1b1[i];\n for(ll i=0;i<(ll)a2b2.size();i++) res[i+n]+=a2b2[i];\n return res;\n }\n bigint operator*(const bigint &v) const{\n constexpr static ll nbase = 10000;\n constexpr static ll nbase_digits = 4;\n vector<ll> a=convert_base(this->a,base_digits,nbase_digits);\n vector<ll> b=convert_base(v.a,base_digits,nbase_digits);\n while(a.size()<b.size()) a.push_back(0);\n while(b.size()<a.size()) b.push_back(0);\n while(a.size() &(ll(a.size())-1)) a.push_back(0),b.push_back(0);\n vector<ll> c=karatsubaMultiply(a,b);\n bigint res;\n res.sign=sign*v.sign;\n for(ll i=0,carry=0;i<(ll)c.size();i++){\n ll cur=c[i]+carry;\n res.a.push_back((ll)(cur%nbase));\n carry=(ll)(cur/nbase);\n if(i+1==(int)c.size()&&carry>0) c.push_back(0);\n }\n res.a=convert_base(res.a,nbase_digits,base_digits);\n res.trim();\n return res;\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n;\n using ll = bigint;\n while(cin >> n, n){\n ll v1 = 1, v2 = 1;\n vector<ll> d(n), v(n);\n for(int i = 0; i < n; i++){\n cin >> d[i] >> v[i];\n v2 = v2 / __gcd(v[i], v2) * v[i];\n }\n for(int i = 0; i < n; i++){\n d[i] *= v2 / v[i];\n v1 = v1 / __gcd(d[i], v1) * d[i];\n }\n for(int i = 0; i < n; i++){\n cout << v1 / d[i] << '\\n';\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3420,
"score_of_the_acc": -1.6667,
"final_rank": 20
},
{
"submission_id": "aoj_0211_1936817",
"code_snippet": "/*\n * src.cpp\n *\n * Created on: 2016/07/26\n * Author: joi\n */\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,a) FOR(i,0,a)\n\nconst int MAX_N=10;\n\nint n;\nint d[MAX_N],v[MAX_N];\n\ntypedef long long ll;\n\nll g[MAX_N];\n\nll gcd(ll a,ll b){\n\tif (b==0) return a;\n\treturn gcd(b,a%b);\n}\n\nll lcm(ll a,ll b){\n\treturn a/gcd(a,b)*b;\n}\n\nint main(){\n\tdo{\n\t\tcin>>n;\n\t\tif (n){\n\t\t\tREP(i,n){\n\t\t\t\tcin>>d[i]>>v[i];\n\t\t\t}\n\t\t\tREP(i,n-1){\n\t\t\t\tll a,b;\n\t\t\t\ta=d[0]*v[i+1];\n\t\t\t\tb=d[i+1]*v[0];\n\t\t\t\tg[i]=b/gcd(a,b);\n\t\t\t}\n\t\t\tfor (int i=n-3;i>=0;i--){\n\t\t\t\tg[i]=lcm(g[i],g[i+1]);\n\t\t\t}\n\t\t\tcout<<g[0]<<endl;\n\t\t\tFOR(i,1,n){\n\t\t\t\tcout<<d[0]*v[i]*g[0]/v[0]/d[i]<<endl;\n\t\t\t}\n\t\t}\n\t}while(n);\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0211_1797079",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\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()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst int inf=1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\nll gcd(ll a,ll b){\n\treturn (b==0?a:gcd(b,a%b));\n}\nll lcm(ll a,ll b){\n\treturn a/gcd(a,b)*b;\n}\nint main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tvi a(n),b(n);\n\t\trep(i,n)cin>>a[i]>>b[i];\n\t\trep(i,n){\n\t\t\tll t=gcd(a[i],b[i]);\n\t\t\ta[i]/=t;b[i]/=t;\n\t\t}\n\t\tll g=b[0],l=a[0];\n\t\tloop(i,1,n){\n\t\t\tg=gcd(g,b[i]);\n\t\t\tl=lcm(l,a[i]);\n\t\t}\n\t\trep(i,n)cout<<l/a[i]*(b[i]/g)<<endl;;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0177,
"final_rank": 11
},
{
"submission_id": "aoj_0211_1779619",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <queue>\n#include <vector>\n#include <functional>\n\nusing namespace std;\n\nlong long int gcd(long long int a, long long int b) {\n\tif (b == 0) {\n\t\treturn a;\n\t} else {\n\t\treturn gcd(max(b, a%b), min(b, a%b));\n\t}\n}\n\nlong long int lcm(long long int a, long long int b) {\n\treturn a * b / gcd(a, b);\n}\n\ntypedef pair<long long int, long long int> P;\n\nint main() {\n\tint n;\n\twhile (cin >> n) {\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tlong long int t = 1;\n\t\tvector<long long int> d(n);\n\t\tvector<long long int> v(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> d[i] >> v[i];\n\t\t\tt = lcm(max(v[i]*t, d[i]), min(v[i]*t, d[i])) / v[i];\n\t\t\t//cout << t << endl;\n\t\t}\n\t\tlong long int a = v[0]*t/d[0];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta = gcd(a, v[i]*t/d[i]);\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout <<(v[i]*t/d[i])/a << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0177,
"final_rank": 11
},
{
"submission_id": "aoj_0211_1765126",
"code_snippet": "#include<iostream>\nusing namespace std;\nlong long n,a[100],b[100],c[100];\nlong long gcd1;\nlong long gcd(long long a,long long b){\n\tif(b==0){return a;}\n\treturn gcd(b,a%b);\n}\nint main(){\n\twhile(true){\n\t\tcin>>n;\n\t\tif(n==0){break;}\n\t\tgcd1=1;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>a[i]>>b[i];\n\t\t\tlong long GCD2=gcd(a[i],b[i]);\n\t\t\ta[i]/=GCD2;b[i]/=GCD2;\n\t\t\tlong long GCD=gcd(gcd1,a[i]);\n\t\t\tgcd1=gcd1*a[i]/GCD;\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tc[i]=gcd1*b[i]/a[i];\n\t\t}\n\t\tlong long gcd2=c[0];\n\t\tfor(int i=1;i<n;i++){\n\t\t\tgcd2=gcd(gcd2,c[i]);\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcout<<c[i]/gcd2<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0211_1713422",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <stack>\n#include <queue>\n\nusing namespace std;\n\nunsigned long long int GCD(unsigned long long int a, unsigned long long int b)\n{\n\tif (b == 0)\n\t{\n\t\treturn(a);\n\t}\n\tif (a < b)\n\t{\n\t\treturn(GCD(b, a));\n\t}\n\treturn(GCD(b, a % b));\n}\n\nunsigned long long int LCM(unsigned long long int a, unsigned long long int b)\n{\n\tunsigned long long int gcd = GCD(a, b);\n\treturn(a * b / gcd);\n}\n\nvoid solve()\n{\n\tint n;\n\twhile (cin >> n, n)\n\t{\n\t\tvector<unsigned long long int> d(n);\n\t\tvector<unsigned long long int> v(n);\n\t\tfor (int i = 0; i < n; ++i)\n\t\t{\n\t\t\tcin >> d[i] >> v[i];\n\t\t\tunsigned long long int t = GCD(d[i], v[i]);\n\t\t\td[i] /= t;\n\t\t\tv[i] /= t;\n\t\t}\n\t\tunsigned long long int dk = d[0];\n\t\tunsigned long long int vk = v[0];\n\t\tfor (int i = 1; i < n; ++i)\n\t\t{\n\t\t\tdk = dk * d[i] / GCD(d[i], dk);\n\t\t\tvk = GCD(vk, v[i]);\n\t\t}\n\t\tfor (int i = 0; i < n; ++i)\n\t\t{\n\t\t\tcout << (v[i] / vk) * (dk / d[i]) << endl;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1192,
"score_of_the_acc": -0.0159,
"final_rank": 10
},
{
"submission_id": "aoj_0211_1569585",
"code_snippet": "#include <bits/stdc++.h>\n#define PB push_back\n#define MP make_pair\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define ALL(a) (a).begin(),(a).end()\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\nconst int INF=1e9;\nll gcd(ll a,ll b){\n if(b==0)return a;\n return gcd(b,a%b);\n}\nll lcm(ll a,ll b){\n return a/gcd(a,b)*b;\n}\nint main(){\n ll n,d[10],v[10];\n while(cin>>n&&n){\n REP(i,n){\n cin>>d[i]>>v[i];\n ll a=gcd(d[i],v[i]);\n v[i]/=a;d[i]/=a;\n }\n ll c=1;\n REP(i,n)c=lcm(c,d[i]);\n REP(i,n)v[i]*=(c/d[i]);\n ll ans=v[0];\n REP(i,n)ans=gcd(ans,v[i]);\n REP(i,n)cout<<v[i]/ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0211_1539667",
"code_snippet": "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n#include <cassert>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\n#define maxs(x,y) x=max(x,y)\n#define mins(x,y) x=min(x,y)\n\nll lcm(ll a,ll b){\n\treturn a/__gcd(a,b)*b;\n}\n\nvoid mainmain(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tvector<pll> v(n);\n\t\trep(i,n) cin>>v[i].F>>v[i].S;\n\t\tll t=1;\n\t\trep(i,n){\n\t\t\tt=lcm(t,v[i].F);\n\t\t}\n\t\tvll w(n);\n\t\trep(i,n){\n\t\t\tw[i]=t/v[i].F*v[i].S;\n\t\t}\n\t\tt=w[0];\n\t\trep(i,n){\n\t\t\tt=__gcd(t,w[i]);\n\t\t}\n\t\trep(i,n){\n\t\t\tcout<<w[i]/t<<endl;\n\t\t}\n\t}\n}\n\n\nsigned main() {\n\tios_base::sync_with_stdio(false);\n cin.tie(0);\n \tcout<<fixed<<setprecision(20);\n mainmain();\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1204,
"score_of_the_acc": -0.0212,
"final_rank": 14
},
{
"submission_id": "aoj_0211_1538957",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\n\ntypedef long long lint;\n\nlint gcd(lint a, lint b) { return b != 0 ? gcd(b, a % b) : a; }\n\nlint lcm(lint a, lint b) { return a / gcd(a, b) * b; }\n\nint main() {\n\tint n;\n\t\n\twhile (cin >> n, n) {\n\t\tvector< lint > d(n), v(n);\n\t\t\n\t\tcin >> d[0] >> v[0];\n\t\t\n\t\tlint dd = d[0], vv = v[0];\n\t\t\n\t\tfor_(i,1,n) {\n\t\t\tcin >> d[i] >> v[i];\n\t\t\tlint _lcm_ = lcm(d[i] * vv, v[i] * dd);\n\t\t\tdd = _lcm_ / v[i];\n\t\t}\n\t\t\n\t\tfor_(i,0,n) cout << dd * v[i] / (vv * d[i]) << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0177,
"final_rank": 11
},
{
"submission_id": "aoj_0211_1538879",
"code_snippet": "#include <iostream>\n#include <utility>\n\nusing namespace std;\n\ntypedef unsigned long long BigInt;\n\nBigInt gcd(BigInt a, BigInt b) {\n if (a < b) {\n swap(a, b);\n }\n while (b > 0) {\n a %= b;\n swap(a, b);\n }\n return a;\n}\n\nBigInt lcm(BigInt a, BigInt b) {\n return a * b / gcd(a, b);\n}\n\nint main() {\n int n;\n BigInt dh, vh;\n BigInt d[10], v[10];\n while (true) {\n cin >> n;\n if (n == 0) {\n return 0;\n }\n for (int i = 0; i < n; ++i) {\n cin >> d[i] >> v[i];\n }\n dh = d[0];\n vh = v[0];\n for (int i = 1; i < n; ++i) {\n BigInt y = lcm(v[i] * dh, vh * d[i]);\n BigInt kh = y / (v[i] * dh);\n BigInt z = gcd(dh * kh, vh);\n dh = dh * kh / z;\n vh /= z;\n }\n for (int i = 0; i < n; ++i) {\n cout << dh * v[i] / (d[i] * vh) << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0018,
"final_rank": 4
},
{
"submission_id": "aoj_0211_1491800",
"code_snippet": "#include <iostream>\n\ntypedef unsigned long long ll;\n\nll gcd(ll a, ll b){\n\tif (b == 0)return a;\n\telse return gcd(b, a % b);\n}\n\nll lcm(ll a, ll b){\n\tll c = gcd(a, b);\n\treturn c * (a / c) * (b / c);\n}\n\nint main(){\n\tint n;\n\twhile (std::cin >> n, n){\n\t\tll d[11], v[11];\n\t\tfor (int i = 0; i < n; ++i){\n\t\t\tstd::cin >> d[i] >> v[i];\n\t\t\tll g = gcd(d[i], v[i]);\n\t\t\td[i] /= g, v[i] /= g;\n\t\t}\n\t\tll s = lcm(d[0], d[1]);\n\t\tfor (int i = 2; i < n; ++i)s = lcm(s, d[i]);\n\t\tfor (int i = 0; i < n; ++i)v[i] *= (s / d[i]);\n\t\tll t = gcd(v[0], v[1]);\n\t\tfor (int i = 2; i < n; ++i)t = gcd(t, v[i]);\n\t\tfor (int i = 0; i < n; ++i)std::cout << v[i] / t << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0018,
"final_rank": 4
},
{
"submission_id": "aoj_0211_1474665",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nlong long int gcd(long long int a, long long int b);\nlong long int lcm(long long int a, long long int b);\n\nint main(){\n int n;\n while(cin >> n , n){\n long long int d[11],v[11];\n for(int i=0;i<n;i++){\n cin >> d[i] >> v[i];\n long long int G = gcd(d[i],v[i]);\n d[i] /= G;\n v[i] /= G;\n }\n long long int L = lcm(d[0],d[1]);\n for(int i=2;i<n;i++){\n L = lcm(L,d[i]);\n }\n long long int ans[11];\n for(int i=0;i<n;i++){\n ans[i] = v[i]*(L/d[i]);\n }\n long long int G = gcd(ans[0],ans[1]);\n for(int i=2;i<n;i++){\n G = gcd(G,ans[i]);\n }\n for(int i=0;i<n;i++){\n cout << ans[i] / G << endl;\n }\n }\n}\n\nlong long int gcd(long long int a, long long int b){\n if(b == 0) return a;\n else return gcd(b,a%b);\n}\n\nlong long int lcm(long long int a, long long int b){\n if(b > a) swap(a,b);\n return a * b / gcd(a,b);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1164,
"score_of_the_acc": -0.0035,
"final_rank": 6
},
{
"submission_id": "aoj_0211_1397297",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <queue>\n#include <algorithm>\n#include <set>\n#include <math.h>\n#include <utility>\n#include <stack>\n#include <string.h>\n#include <complex>\nusing namespace std;\nconst int INF = 1<<29;\nconst double EPS = 1e-8;\n\nint d[10],v[10];\nint x[9],y[9];\n\nint gcd(int x, int y){\n return y ? gcd(y, x%y): x;\n}\n\nint lca(int x, int y){\n long long int mul = (long long int)x*y;\n return mul/gcd(x,y);\n}\n\nint main(){\n while(1){\n int n;\n scanf(\"%d\",&n);\n if(!n)break;\n\n for(int i=0;i<n;i++){\n scanf(\"%d%d\",&d[i],&v[i]);\n }\n\n for(int i=0;i<n-1;i++){\n x[i] = d[i+1]*v[0];\n y[i] = d[0]*v[i+1];\n int g = gcd(x[i],y[i]);\n x[i] /= g;\n y[i] /= g;\n //cout << x[i] << \" \" << y[i] << endl;\n }\n\n if(n>2){\n int l = 1;\n for(int i=0;i<n-1;i++){\n l = lca(l, x[i]);\n }\n cout << l << endl;\n for(int i=0;i<n-1;i++){\n cout << l / x[i] * y[i] << endl;\n }\n }else{\n cout << x[0] << endl;\n cout << y[0] << endl;\n }\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.023,
"final_rank": 16
},
{
"submission_id": "aoj_0211_1365144",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define int unsigned long long\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define pb push_back\n#define all(C) (C).begin(),(C).end()\nconst int MAX=10;\nint n;\nint d[MAX],v[MAX];\n\nint gcd(int a,int b){\n return b?gcd(b,a%b):a;\n}\nint lcm(int a,int b){\n return a/gcd(a,b)*b;\n}\n\nvoid solve(){\n rep(i,n){\n cin>>d[i]>>v[i];\n int g=gcd(d[i],v[i]);\n d[i]/=g;v[i]/=g;\n }\n int base=d[0];\n rep(i,n)base=lcm(base,d[i]);\n rep(i,n)v[i]*=(base/d[i]);\n base=v[0];\n rep(i,n)base=gcd(base,v[i]);\n rep(i,n)cout<<v[i]/base<<endl;\n}\nsigned main(){\n cin.tie(0);ios_base::sync_with_stdio(0);\n while(cin>>n&&n)solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0141,
"final_rank": 9
},
{
"submission_id": "aoj_0211_1364871",
"code_snippet": "#include <iostream>\n#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)\n#define rep(x,to) rep2(x,0,to)\nusing namespace std;\n#define ll long long\nll gcd(ll a, ll b) {\n\tif(b==0) return -1;\n\tif(a<b) swap(a,b);\n\twhile(b) {\n\t\tll t = a / b;\n\t\tswap(a-=t*b,b);\n\t}\n\treturn a;\n}\nll lcm(ll a, ll b) {\n\tll c = gcd(a,b);\n\treturn a * b / c;\n}\nint main(){\n\tint n;\n\twhile(cin >> n, n) {\n\t\tll d[10], v[10];\n\t\trep(i,n) {\n\t\t\tcin >> d[i] >> v[i];\n\t\t}\n\t\tll tr = d[0], td = v[0];\n\t\trep2(i,1,n) {\n\t\t\ttr = lcm(tr * v[i], td * d[i]);\n\t\t\ttd *= v[i];\n\t\t\tll div = gcd(tr,td);\n\t\t\ttr /= div, td /= div;\n\t\t}\n\t\trep(i,n) {\n\t\t\tcout << (tr*v[i]) /(d[i]*td) << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1164,
"score_of_the_acc": -0.3369,
"final_rank": 17
},
{
"submission_id": "aoj_0211_1147903",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\ntypedef long long ll;\n\nll gcd(ll a,ll b)\n{\n\tif(b == 0) return a;\n\telse return gcd(b,a%b);\n}\n\nll lcm(ll a,ll b)\n{\n\tif(a == 0 || b == 0) return 0;\n\treturn ((a / gcd(a,b)*b));\n}\n\nint main()\n{\n\tint n;\n\twhile(cin >> n && n)\n\t{\n\t\tvector<pair<ll,ll> > v;\n\t\t\n\t\trep(i,n)\n\t\t{\n\t\t\tll a,b;\n\t\t\tcin >> a >> b;\n\t\t\tv.push_back(make_pair(a,b));\n\t\t}\n\n\t\trep(i,n)\n\t\t{\n\t\t\tll temp = gcd(v[i].first,v[i].second);\n\t\t\tv[i].first /= temp;\n\t\t\tv[i].second /= temp;\n\t\t}\n\n\t\tll t,t2;\n\t\trep(i,n)\n\t\t{\n\t\t\tif(i == 0)\n\t\t\t{\n\t\t\t\tt = v[i].first;\n\t\t\t\tt2 = v[i].second;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tt = lcm(t,v[i].first);\n\t\t\t\tt2 = gcd(t2,v[i].second);\n\t\t\t}\n\t\t}\n\n\t\trep(i,n)\n\t\t{\n\t\t\tll ans = t * v[i].second;\n\t\t\tans /= t2;\n\t\t\tans /= v[i].first;\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1204,
"score_of_the_acc": -0.0212,
"final_rank": 14
},
{
"submission_id": "aoj_0211_1094208",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nlong long gozyo(long long a,long long b){\n if(a<b){\n long long temp=a;\n a=b;\n b=temp;\n }\n while(a%b!=0){\n long long temp=a%b;\n a=b;\n b=temp;\n }\n return b;\n}\n\nmain(){\n int n;\n long long d[11];\n long long v[11];\n long long a[11];\n long long g;\n long long k1,k2,k3;\n long long t1,t2,t3;\n while( (cin >> n),n ){\n for(int i=0;i<n;i++){\n cin >> d[i] >> v[i];\n g= gozyo(d[i],v[i]);\n d[i]/=g;\n v[i]/=g;\n }\n\n\n\n k1=d[0];\n t1=d[0];\n for(int i=1;i<n;i++){\n k1 = gozyo(t1,d[i]);\n t1=t1*d[i]/k1;\n }\n\n for(int i=0;i<n;i++) a[i]=t1/d[i]*v[i];\n\n k2=a[0];\n for(int i=1;i<n;i++) k2 = gozyo(k2,a[i]);\n\n for(int i=0;i<n;i++){\n cout << a[i]/k2 << endl;\n }\n \n\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1164,
"score_of_the_acc": -0.0035,
"final_rank": 6
},
{
"submission_id": "aoj_0211_1037728",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long lint;\n\nlint gcd(lint x, lint y){ return __gcd(x, y); }\nlint lcm(lint x, lint y){ return x / gcd(x, y) * y; }\n\nint main()\n{\n\tint n;\n\twhile (cin >> n, n){\n\t\tvector<pair<lint, lint> > ss;\n\t\tlint l = 1;\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tlint d, v;\n\t\t\tcin >> d >> v;\n\t\t\tlint g = gcd(d, v);\n\t\t\tl = lcm(l, d / g);\n\t\t\tss.push_back(make_pair(d, v));\n\t\t}\n\t\tlint g = l * ss[0].second / ss[0].first;\n\t\tfor (int i = 1; i < n; i++){\n\t\t\tg = gcd(l * ss[i].second / ss[i].first, g);\n\t\t}\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tcout << l * ss[i].second / ss[i].first / g << endl;\n\t\t}\n\t}\n\treturn (0);\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1204,
"score_of_the_acc": -0.6879,
"final_rank": 18
},
{
"submission_id": "aoj_0211_1024232",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\ntypedef long long int llf;\nvector<int> p;\nllf gcd(llf a,llf b){\n\twhile(a!=b){\n\t\tif(max(a,b)%min(a,b)==0)\n\t\treturn min(a,b);\n\t\tif(a>b)\n\t\ta-=b*(a/b);\n\t\telse\n\t\tb-=a*(b/a);\n\t}\n\treturn a;\n}\nllf gcd(llf c[10],int n){\n\tllf d[10];\n\tfor(int i=0;i<n;i++)\n\td[i]=c[i];\n\tllf x=d[0];\n\tfor(int i=1;i<n;i++)\n\tx=gcd(x,d[i]);\n\treturn x;\n}\nllf lcm(llf c[10],int n){\n\tint d[10];\n\tfor(int i=0;i<10;i++)\n\td[i]=c[i];\n\tint times[10000]={};\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<p.size();j++){\n\t\t\tint k=0;\n\t\t\twhile(d[i]%p[j]==0){\n\t\t\t\td[i]/=p[j];\n\t\t\t\tk++;\n\t\t\t}\n\t\t\ttimes[p[j]]=max(times[p[j]],k);\n\t\t}\n\t}\n\tllf ans=1;\n\tfor(int i=0;i<p.size();i++)\n\t\tfor(int j=0;j<times[p[i]];j++)\n\t\t\tans*=p[i];\n\treturn ans;\n}\nint main() {\n\t// your code goes here\n\tp.push_back(2);\n\tfor(int i=3;i<=10000;i++){\n\t\tfor(int j=0;j<p.size();j++){\n\t\t\tif(i%p[j]==0)\n\t\t\tbreak;\n\t\t\tif(j==p.size()-1)\n\t\t\tp.push_back(i);\n\t\t}\n\t}\n\tint n;\n\twhile(cin >> n && n!=0){\n\t\tllf d[10],v[10];\n\t\tfor(int i=0;i<n;i++)\n\t\tcin >> d[i] >> v[i];\n\t\tllf times=lcm(d,n);\n\t\tfor(int i=0;i<n;i++)\n\t\tv[i]*=(times/d[i]);\n\t\tllf c=gcd(v,n);\n\t\tfor(int i=0;i<n;i++)\n\t\tcout << v[i]/c << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1280,
"score_of_the_acc": -1.0548,
"final_rank": 19
},
{
"submission_id": "aoj_0211_1006803",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\n\nstruct data{\n ll d,v;\n void c(){\n ll x = __gcd(d,v);\n d/=x;\n v/=x;\n }\n};\n\nint n;\ndata t[10];\nll u[10],size;\n\nll lcm(ll a,ll b){\n return a/ __gcd(a,b) * b;\n}\n\nll gcd(ll a,ll b){\n return __gcd(a,b);\n}\n\nvoid change(){\n ll x = t[0].d;\n for(int j=1;j<n;j++)x=gcd(x,t[j].d);\n for(int j=0;j<n;j++)t[j].d/=x;\n}\nvoid de();\n\nint main(){\n while(cin>>n&&n){\n for(int i=0;i<n;i++){\n cin>>t[i].d>>t[i].v;\n t[i].c();\n }\n change();\n for(int i=1;i<n;i++){\n for(int j=0;j<n;j++)t[j].d*=t[(j+i)%n].v;\n change();\n }//i\n\n \n for(int i=0;i<n;i++){\n //cout<<t[i].d<<endl;\n \n size=0;\n\n for(int j=1;j<n;j++){\n\tll y = t[(j+i)%n].d;\n\ty = y / gcd(y,t[i].d);\n\tfor(int k=0;k<size;k++)y=y/gcd(y,u[k]);\n\tif(y>1)u[size++]=y;\n }\n\n\n ll ans=1;\n for(int j=0;j<size;j++)ans*=u[j];\n cout<<ans<<endl;\n }\n \n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1164,
"score_of_the_acc": -0.0035,
"final_rank": 6
}
] |
aoj_0214_cpp
|
秋のイルミネーション
四角形が大好きな人が多く住む四角町では、四角形の電光板を組み合わせたイルミネーションで町中を彩るお祭りが開催されます。
この電光板は電気を流すと発光し、発光している板に接している板も発光します。したがって、電光板を何枚使っても、すべてがひとかたまりに接していれば電源がひとつで済むという優れものです。
お祭り実行委員会では、四角形を組み合わせたデザインを町民から募集し多数のイルミネーションを作成します。各イルミネーションは、デザインを構成する四角形の配置によって必要となる電源の個数が変わるため、必要な電源の個数を把握する作業に
大きな手間がかかります。
そこで、
あなたは四角形の配置を調べ、必要な電源の個数を計算するプログラムを作成して実行委員会を手助けすることにしました。
イルミネーションの個数、各イルミネーションを構成する四角形の情報を入力とし、イルミネーションごとに必要な電源の個数を出力するプログラムを作成してください。重なっていたり接していたりする四角形を 1 つのまとまりと考え、1 つのまとまりに対して電源の個数は 1 つと数えてください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
N
M
1
xa
1
ya
1
xb
1
yb
1
xc
1
yc
1
xd
1
yd
1
xa
2
ya
2
xb
2
yb
2
xc
2
yc
2
xd
2
yd
2
:
xa
M
1
ya
M
1
xb
M
1
yb
M
1
xc
M
1
yc
M
1
xd
M
1
yd
M
1
M
2
:
:
M
N
:
:
1 行目にイルミネーションの個数
N
(1 ≤
N
≤ 100) が与えられます。続いて、
N
個のイルミネーションの情報が与えられます。第
i
のイルミネーションの情報として、イルミネーションを構成する四角形の個数
M
i
(1 ≤
M
i
≤ 100) が１行に与えられます。続く
M
i
行に
j
個目の四角形の頂点
xa
j
,
ya
j
,
xb
j
,
yb
j
,
xc
j
,
yc
j
,
xd
j
,
yd
j
(-1000 以上 1000 以下の整数) が与えられます。
入力される四角形の頂点座標は、時計回りの順に従って入力されます。ただし、入力データの四角形はすべて凸な四角形とします。
データセットの数は 10 を超えません。
Output
入力データセットごとに、イルミネーションごとに必要な電源の個数を出力します。出力する電源の個数は各イルミネーションが入力された順番に従ってください。
Sample Input
3
1
0 0 0 1 1 1 1 0
2
0 0 0 1 1 1 1 0
100 100 100 200 200 200 200 100
2
0 0 0 100 100 100 100 0
10 10 10 20 20 20 20 10
2
1
30 40 40 50 40 20 20 10
1
30 40 40 50 40 20 20 10
0
Output for the Sample Input
1
2
1
1
1
|
[
{
"submission_id": "aoj_0214_9337612",
"code_snippet": "#include <bits/stdc++.h>\n\n#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <iterator>\n#include <utility>\n#include <vector>\n\nusing Real = long double;\nconstexpr Real EPS = 1e-10;\nconst Real PI = std::acos(-1);\n\nint sign(Real x) {\n return x < -EPS ? -1 : x > EPS ? 1 : 0;\n}\n\nbool eq(Real lhs, Real rhs) {\n return sign(rhs - lhs) == 0;\n}\n\nbool lte(Real lhs, Real rhs) {\n return sign(rhs - lhs) >= 0;\n}\n\nbool lt(Real lhs, Real rhs) {\n return sign(rhs - lhs) > 0;\n}\n\nbool gte(Real lhs, Real rhs) {\n return lte(rhs, lhs);\n}\n\nbool gt(Real lhs, Real rhs) {\n return lt(rhs, lhs);\n}\n\nstruct Point {\n Real x;\n Real y;\n Point(Real x = 0, Real y = 0): x(x), y(y) {}\n Point& operator+=(Point rhs) {\n this->x += rhs.x;\n this->y += rhs.y;\n return *this;\n }\n Point& operator-=(Point rhs) {\n this->x -= rhs.x;\n this->y -= rhs.y;\n return *this;\n }\n Point& operator*=(Real k) {\n this->x *= k;\n this->y *= k;\n return *this;\n }\n Point& operator/=(Real k) {\n this->x /= k;\n this->y /= k;\n return *this;\n }\n friend Point operator+(Point lhs, Point rhs) {\n return lhs += rhs;\n }\n friend Point operator-(Point lhs, Point rhs) {\n return lhs -= rhs;\n }\n friend Point operator*(Point p, Real k) {\n return p *= k;\n }\n friend Point operator/(Point p, Real k) {\n return p /= k;\n }\n friend Point operator*(Real k, Point p) {\n return p * k;\n }\n friend Point operator/(Real k, Point p) {\n return p / k;\n }\n friend bool operator==(Point lhs, Point rhs) {\n return eq(lhs.x, rhs.x) && eq(lhs.y, rhs.y);\n }\n friend bool operator<(Point lhs, Point rhs) {\n if (eq(lhs.x, rhs.x)) return lt(lhs.y, rhs.y);\n return lt(lhs.x, rhs.x);\n }\n friend bool operator>(Point lhs, Point rhs) {\n return rhs < lhs;\n }\n friend std::istream& operator>>(std::istream& is, Point& p) {\n is >> p.x >> p.y;\n return is;\n }\n friend std::ostream& operator<<(std::ostream& os, Point& p) {\n os << p.x << ' ' << p.y;\n return os;\n }\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = Points;\nusing Vector = Point;\n\nReal norm(Vector p) {\n return p.x * p.x + p.y * p.y;\n}\n\nReal abs(Vector p) {\n return std::sqrt(norm(p));\n}\n\nReal dot(Vector lhs, Vector rhs) {\n return lhs.x * rhs.x + lhs.y * rhs.y;\n}\n\nReal cross(Vector lhs, Vector rhs) {\n return lhs.x * rhs.y - lhs.y * rhs.x;\n}\n\nint ccw(Point p0, Point p1, Point p2) {\n Vector a = p1 - p0;\n Vector b = p2 - p0;\n\n if (cross(a, b) > EPS) return 1;\n\n if (cross(a, b) < -EPS) return -1;\n\n if (dot(a, b) < 0) return 2;\n\n if (norm(a) < norm(b)) return -2;\n\n return 0;\n}\n\nstruct Circle {\n Real r;\n Point c;\n Circle() {}\n Circle(Real r, Point c): r(r), c(c) {}\n};\n\nstruct Segment {\n Segment() {}\n Segment(Point p0, Point p1): p0(p0), p1(p1) {}\n Point p0, p1;\n};\n\nstruct Line {\n Line() {}\n Line(Point p0, Point p1): p0(p0), p1(p1) {}\n explicit Line(Segment s): p0(s.p0), p1(s.p1) {}\n Point p0, p1;\n};\n\nReal distance(Point lhs, Point rhs) {\n return abs(rhs - lhs);\n}\n\nReal distance(Line l, Point p) {\n return std::abs(cross(l.p1 - l.p0, p - l.p0)) / abs(l.p1 - l.p0);\n}\n\nReal distance(Segment s, Point p) {\n if (dot(s.p1 - s.p0, p - s.p0) < 0) {\n return distance(p, s.p0);\n }\n if (dot(s.p0 - s.p1, p - s.p1) < 0) {\n return distance(p, s.p1);\n }\n return distance(Line(s), p);\n}\n\nbool intersect(Segment lhs, Segment rhs) {\n return ccw(lhs.p0, lhs.p1, rhs.p0) * ccw(lhs.p0, lhs.p1, rhs.p1) <= 0\n && ccw(rhs.p0, rhs.p1, lhs.p0) * ccw(rhs.p0, rhs.p1, lhs.p1) <= 0;\n}\n\nbool intersect(Segment s, Point p) {\n return ccw(s.p0, s.p1, p) == 0;\n}\n\nReal distance(Segment lhs, Segment rhs) {\n if (intersect(lhs, rhs)) {\n return Real(0);\n }\n return std::min({distance(lhs, rhs.p0), distance(lhs, rhs.p1), distance(rhs, lhs.p0), distance(rhs, lhs.p1)});\n}\n\nbool parallel(Vector lhs, Vector rhs) {\n return eq(cross(lhs, rhs), 0);\n}\n\nbool parallel(Segment lhs, Segment rhs) {\n return parallel(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nbool parallel(Line lhs, Line rhs) {\n return parallel(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nPoint crosspoint(Line lhs, Line rhs) {\n Real a = cross(lhs.p1 - lhs.p0, rhs.p1 - rhs.p0);\n Real b = cross(lhs.p1 - lhs.p0, lhs.p1 - rhs.p0);\n return rhs.p0 + (rhs.p1 - rhs.p0) * b / a;\n}\n\nbool intersect(Line l, Segment s) {\n return ccw(l.p0, l.p1, s.p0) * ccw(l.p0, l.p1, s.p1) <= 0;\n}\n\nbool intersect(Circle c, Line l) {\n return lte(distance(l, c.c), c.r);\n}\n\nbool intersect(Circle c, Point p) {\n return eq(distance(c.c, p), c.r);\n}\n\nbool internal(Circle c, Point p) {\n return lt(distance(c.c, p), c.r);\n}\n\nbool intersect(Circle c, Segment s) {\n return lte(distance(s, c.c), c.r);\n}\n\nint intersect(Circle lhs, Circle rhs) {\n if (gt(lhs.r, rhs.r)) std::swap(lhs, rhs);\n Real d = distance(lhs.c, rhs.c);\n if (lt(lhs.r + rhs.r, d)) return 4;\n if (eq(lhs.r + rhs.r, d)) return 3;\n if (gt(lhs.r + d, rhs.r)) return 2;\n if (eq(lhs.r + d, rhs.r)) return 1;\n return 0;\n}\n\nbool orthogonal(Vector lhs, Vector rhs) {\n return eq(dot(lhs, rhs), 0);\n}\n\nbool orthogonal(Segment lhs, Segment rhs) {\n return orthogonal(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nbool orthogonal(Line lhs, Line rhs) {\n return orthogonal(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nPoint crosspoint(Segment lhs, Segment rhs) {\n Real d0 = distance(Line(lhs.p0, lhs.p1), rhs.p0);\n Real d1 = distance(Line(lhs.p0, lhs.p1), rhs.p1);\n return rhs.p0 + (rhs.p1 - rhs.p0) * (d0 / (d0 + d1));\n}\n\nReal arg(Vector p) {\n return std::atan2(p.y, p.x);\n}\n\nVector polar(Real a, Real r) {\n return Point(std::cos(r) * a, std::sin(r) * a);\n}\n\nPoint rotate(Point p, Real t) {\n Point v = polar(1, t);\n return Point(p.x * v.x - p.y * v.y, p.x * v.y + p.y * v.x);\n}\n\nReal angle(Point p0, Point p1, Point p2) {\n Real a = arg(p0 - p1);\n Real b = arg(p2 - p1);\n if (gt(a, b)) std::swap(a, b);\n return std::min(b - a, 2 * PI - (b - a));\n}\n\nPoints crosspoint(Circle lhs, Circle rhs) {\n Real d = abs(lhs.c - rhs.c);\n if (eq(d, lhs.r + rhs.r)) return {lhs.c + lhs.r * (rhs.c - lhs.c) / d};\n Real a = std::acos((lhs.r * lhs.r + d * d - rhs.r * rhs.r) / (2 * lhs.r * d));\n Real t = arg(rhs.c - lhs.c);\n return {lhs.c + polar(lhs.r, t + a), lhs.c + polar(lhs.r, t - a)};\n}\n\nPoint projection(Segment s, Point p) {\n Vector a = p - s.p0;\n Vector b = s.p1 - s.p0;\n Real t = dot(a, b) / norm(b);\n return s.p0 + t * b;\n}\n\nPoint projection(Line l, Point p) {\n Vector a = p - l.p0;\n Vector b = l.p1 - l.p0;\n Real t = dot(a, b) / norm(b);\n return l.p0 + t * b;\n}\n\nPoint reflection(Segment s, Point p) {\n return p + (projection(s, p) - p) * Real(2);\n}\n\nPoint reflection(Line l, Point p) {\n return p + (projection(l, p) - p) * Real(2);\n}\n\nPoints crosspoint(Circle c, Line l) {\n Vector p = projection(l, c.c);\n Real t = std::sqrt(c.r * c.r - norm(c.c - p));\n if (eq(t, 0)) return {p};\n Vector e = (l.p1 - l.p0) / abs(l.p1 - l.p0);\n return {p + t * e, p + -t * e};\n}\n\nReal area(Polygon poly) {\n int n = poly.size();\n Real result = 0;\n for (int i = 0; i < n; i++) {\n result += cross(poly[i], poly[(i + 1) % n]);\n }\n return result / 2;\n}\n\nReal perimeter(Polygon poly) {\n int n = poly.size();\n Real result = 0;\n for (int i = 0; i < n; i++) {\n result += abs(poly[i] - poly[(i + 1) % n]);\n }\n return result;\n}\n\nbool convex(Polygon poly) {\n int n = poly.size();\n for (int i = 0; i < n; i++) {\n if (ccw(poly[i], poly[(i + 1) % n], poly[(i + 2) % n]) == -1) return false;\n }\n return true;\n}\n\nint contain(Polygon poly, Point p) {\n int n = poly.size();\n bool parity = false;\n for (int i = 0; i < n; i++) {\n Point a = poly[i] - p;\n Point b = poly[(i + 1) % n] - p;\n if (gt(a.y, b.y)) std::swap(a, b);\n if (lte(a.y, 0) && lt(0, b.y) && lt(cross(a, b), 0)) parity ^= true;\n if (eq(cross(a, b), 0) && lte(dot(a, b), 0)) return 1;\n }\n return (parity ? 2 : 0);\n}\n\nPolygon convex_hull(Points points) {\n std::sort(points.begin(), points.end(), [](Point lhs, Point rhs) {\n if (eq(lhs.x, rhs.x)) return lt(lhs.y, rhs.y);\n return lt(lhs.x, rhs.x);\n });\n int n = points.size();\n Points lower, upper;\n lower.push_back(points[n - 1]);\n lower.push_back(points[n - 2]);\n upper.push_back(points[0]);\n upper.push_back(points[1]);\n for (int i = n - 3; i >= 0; i--) {\n for (int m = lower.size(); m >= 2 && ccw(lower[m - 2], lower[m - 1], points[i]) >= 0; m--) {\n lower.pop_back();\n }\n lower.push_back(points[i]);\n }\n for (int i = 2; i < n; i++) {\n for (int m = upper.size(); m >= 2 && ccw(upper[m - 2], upper[m - 1], points[i]) >= 0; m--) {\n upper.pop_back();\n }\n upper.push_back(points[i]);\n }\n std::reverse(lower.begin(), lower.end());\n std::copy(std::next(upper.rbegin()), std::prev(upper.rend()), std::back_inserter(lower));\n return lower;\n}\n\nPolygon convex_cut(Polygon poly, Line l) {\n int n = poly.size();\n Polygon res;\n for (int i = 0; i < n; i++) {\n Point a = poly[i];\n Point b = poly[(i + 1) % n];\n if (ccw(l.p0, l.p1, a) != -1) res.push_back(a);\n if (ccw(l.p0, l.p1, a) * ccw(l.p0, l.p1, b) == -1) {\n res.push_back(crosspoint(l, Line(a, b)));\n }\n }\n return res;\n}\n\nLine bisector(Point p0, Point p1, Point p2) {\n return Line(p1, p1 + polar(1, angle(p0, p1, p2) / 2));\n}\n\nCircle incircle(Point p0, Point p1, Point p2) {\n Point c = crosspoint(bisector(p0, p1, p2), bisector(p1, p2, p0));\n Real r = std::abs(2 * area({p0, p1, p2}) / perimeter({p0, p1, p2}));\n return Circle(r, c);\n}\n\nLine perpendicular(Line l, Point p) {\n Vector v = l.p1 - l.p0;\n return Line(p, p + Vector(-v.y, v.x));\n}\n\nLine perpendicular_bisector(Segment s) {\n return perpendicular(Line(s), (s.p0 + s.p1) / 2);\n}\n\nCircle circumscribed_circle(Point p0, Point p1, Point p2) {\n Point c = crosspoint(perpendicular_bisector(Segment(p0, p1)), perpendicular_bisector(Segment(p0, p2)));\n return Circle(distance(p0, c), c);\n}\n\nReal area(Circle c) {\n return c.r * c.r * PI;\n}\n\nPoints tangent(Circle c, Point p) {\n return crosspoint(c, Circle(std::sqrt(norm(c.c - p) - c.r * c.r), p));\n}\n\nstruct UnionFind {\n int n;\n int g;\n std::vector<int> data;\n UnionFind(int n): n(n), g(n), data(n, -1) {}\n int leader(int x) {\n if (data[x] < 0) return x;\n return data[x] = leader(data[x]);\n }\n void merge(int lhs, int rhs) {\n lhs = leader(lhs);\n rhs = leader(rhs);\n if (lhs == rhs) return;\n if (data[lhs] < data[rhs]) std::swap(lhs, rhs);\n data[rhs] += data[lhs];\n data[lhs] = rhs;\n g--;\n }\n int group_num() {\n return g;\n }\n};\n\nint solve() {\n int n;\n std::cin >> n;\n if (n == 0) return 1;\n while (n--) {\n int m;\n std::cin >> m;\n std::vector<Polygon> ps;\n for (int i = 0; i < m; i++) {\n Polygon p;\n for (int j = 0; j < 4; j++) {\n Point q;\n std::cin >> q;\n p.push_back(q);\n }\n std::reverse(p.begin(), p.end());\n ps.push_back(p);\n }\n UnionFind uf(m);\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < m; j++) {\n if (i == j) continue;\n\n {\n bool ok = true;\n for (int k = 0; k < 4; k++) {\n ok &= contain(ps[i], ps[j][k]) > 0;\n }\n if (ok) uf.merge(i, j);\n }\n\n {\n bool ok = false;\n for (int k = 0; k < 4; k++) {\n Segment s(ps[i][k], ps[i][(k + 1) % 4]);\n for (int l = 0; l < 4; l++) {\n Segment t(ps[j][l], ps[j][(l + 1) % 4]);\n ok |= intersect(s, t);\n }\n }\n if (ok) uf.merge(i, j);\n }\n }\n }\n std::cout << uf.group_num() << '\\n';\n }\n return 0;\n}\n\nint main() {\n while (!solve())\n ;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3312,
"score_of_the_acc": -1.0769,
"final_rank": 15
},
{
"submission_id": "aoj_0214_4906167",
"code_snippet": "#line 1 \"a.cpp\"\nusing namespace std;\n#line 1 \"/home/kotatsugame/library/datastructure/UF.cpp\"\n#include<vector>\nstruct UF{\n\tint n;\n\tvector<int>parent,rank;\n\tUF(int n_=0):n(n_),parent(n_),rank(n_,1)\n\t{\n\t\tfor(int i=0;i<n_;i++)parent[i]=i;\n\t}\n\tint find(int a){return parent[a]!=a?parent[a]=find(parent[a]):a;}\n\tbool same(int a,int b){return find(a)==find(b);}\n\tbool unite(int a,int b)\n\t{\n\t\ta=find(a),b=find(b);\n\t\tif(a==b)return false;\n\t\tif(rank[a]<rank[b])\n\t\t{\n\t\t\tparent[a]=b;\n\t\t\trank[b]+=rank[a];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tparent[b]=a;\n\t\t\trank[a]+=rank[b];\n\t\t}\n\t\treturn true;\n\t}\n\tint size(int a){return rank[find(a)];}\n};\n#line 1 \"/home/kotatsugame/library/math/point.cpp\"\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<algorithm>\n#line 5 \"/home/kotatsugame/library/math/point.cpp\"\n#include<cmath>\n#include<iomanip>\nconst double EPS=1e-10;\nbool eq(double a,double b){return abs(a-b)<EPS;}\nstruct Point{\n\tdouble x,y;\n\tPoint(double x_=0,double y_=0):x(x_),y(y_){}\n\tPoint operator-()const{return Point(-x,-y);}\n\tPoint operator+(const Point&p)const{return Point(x+p.x,y+p.y);}\n\tPoint operator-(const Point&p)const{return Point(x-p.x,y-p.y);}\n\tPoint operator*(const double k)const{return Point(x*k,y*k);}\n\tPoint operator/(const double k)const{return Point(x/k,y/k);}\n\tbool operator<(const Point&p)const{return eq(x,p.x)?y<p.y:x<p.x;}\n\tbool operator==(const Point&p)const{return eq(x,p.x)&&eq(y,p.y);}\n};\nistream&operator>>(istream&is,Point&p){return is>>p.x>>p.y;}\nostream&operator<<(ostream&os,const Point&p){return os<<fixed<<setprecision(9)<<p.x<<' '<<p.y;}\nstruct Line{\n\tPoint p1,p2;\n\tLine(Point p1_=Point(),Point p2_=Point()):p1(p1_),p2(p2_){}\n};\nstruct Segment:Line{\n\tSegment(Point p1_=Point(),Point p2_=Point()):Line(p1_,p2_){}\n};\nstruct Circle{\n\tPoint o;\n\tdouble r;\n\tCircle(Point o_=Point(),double r_=0):o(o_),r(r_){}\n};\nusing Polygon=vector<Point>;\n//function list begin\nPoint vec(const Line&);\ndouble norm(const Point&);\ndouble norm(const Line&);\ndouble abs(const Point&);\ndouble abs(const Line&);\ndouble arg(const Point&);\ndouble arg(const Line&);\ndouble arg(const Point&,const Point&,const Point&);//a->b->c\nint argtype(const Point&);//(-pi,0]->0,(0,pi]->1\nbool argless(const Point&,const Point&);//sorting points with arg\ndouble dot(const Point&,const Point&);\ndouble cross(const Point&,const Point&);\nPoint polar(const double,const double);\nPoint rotate(const Point&,const double);\nenum{ONLINE_FRONT=-2,CLOCKWISE=-1,ON_SEGMENT=0,COUNTER_CLOCKWISE=1,ONLINE_BACK=2};\nint ccw(const Point&,const Point&);\nint ccw(const Point&,const Point&,const Point&);\nint ccw(const Line&,const Point&);\nbool orthogonal(const Point&,const Point&);\nbool orthogonal(const Line&,const Line&);\nbool parallel(const Point&,const Point&);\nbool parallel(const Line&,const Line&);\nbool intersect(const Line&,const Point&);\nbool intersect(const Line&,const Line&);\nbool intersect(const Segment&,const Point&);\nbool intersect(const Segment&,const Segment&);\nbool intersect(const Line&,const Segment&);\nbool intersect(const Segment&,const Line&);\nbool intersect(const Circle&,const Point&);\nint intersect(const Circle&,const Line&);//count contacts\nint intersect(const Circle&,const Segment&);\nint intersect(const Circle&,const Circle&);//count common tangents\ndouble distance(const Point&,const Point&);\ndouble distance(const Line&,const Point&);\ndouble distance(const Line&,const Line&);\ndouble distance(const Segment&,const Point&);\ndouble distance(const Segment&,const Segment&);\ndouble distance(const Line&,const Segment&);\ndouble distance(const Segment&,const Line&);\ndouble distance(const Circle&,const Point&);\ndouble distance(const Circle&,const Line&);\ndouble distance(const Circle&,const Segment&);\ndouble distance(const Circle&,const Circle&);\nPoint projection(const Line&,const Point&);\nPoint reflection(const Line&,const Point&);\nPoint crosspoint(const Line&,const Line&);\npair<Point,Point>crosspoint(const Circle&,const Line&);\npair<Point,Point>crosspoint(const Circle&,const Segment&);\npair<Point,Point>crosspoint(const Circle&,const Circle&);\npair<Point,Point>tangent(const Circle&,const Point&);\nvector<Line>tangent(const Circle&,const Circle&);\nbool is_convex(const Polygon&);\nPolygon convex_hull(Polygon,bool=false);\nenum{OUT,ON,IN};\nint contain(const Polygon&,const Point&);\nint contain(const Circle&,const Point&);\nint contain(const Circle&,const Segment&);\nPolygon convex_cut(const Polygon&,const Line&);\ndouble diameter(Polygon);\ndouble area(const Polygon&);\ndouble area(const Polygon&,const Line&);\ndouble area(const Polygon&,const Circle&);\n//function list end\nPoint vec(const Line&s){return s.p2-s.p1;}\ndouble norm(const Point&p){return p.x*p.x+p.y*p.y;}\ndouble norm(const Line&s){return norm(vec(s));}\ndouble abs(const Point&p){return hypot(p.x,p.y);}\ndouble abs(const Line&s){return abs(vec(s));}\ndouble arg(const Point&p){return atan2(p.y,p.x);}\ndouble arg(const Line&s){return arg(vec(s));}\ndouble arg(const Point&a,const Point&b,const Point&c){\n\tdouble A=arg(b-a),B=arg(c-b);\n\tdouble theta=abs(A-B);\n\treturn min(theta,2*M_PI-theta);\n}\nint argtype(const Point&a)\n{\n\treturn a.y<-EPS?0:a.y>EPS?1:a.x<0?1:0;\n}\nbool argless(const Point&a,const Point&b)\n{\n\tint at=argtype(a),bt=argtype(b);\n\treturn at!=bt?at<bt:ccw(a,b)>0;\n}\ndouble dot(const Point&a,const Point&b){return a.x*b.x+a.y*b.y;}\ndouble cross(const Point&a,const Point&b){return a.x*b.y-a.y*b.x;}\nPoint polar(const double r,const double theta){return Point(cos(theta),sin(theta))*r;}\nPoint rotate(const Point&p,const double theta){\n\treturn Point(p.x*cos(theta)-p.y*sin(theta),p.x*sin(theta)+p.y*cos(theta));\n}\nint ccw(const Point&a,const Point&b)\n{\n\treturn cross(a,b)>EPS?COUNTER_CLOCKWISE\n\t\t:cross(a,b)<-EPS?CLOCKWISE\n\t\t:dot(a,b)<0?ONLINE_BACK\n\t\t:norm(a)<norm(b)?ONLINE_FRONT\n\t\t:ON_SEGMENT;\n}\nint ccw(const Point&a,const Point&b,const Point&c){return ccw(b-a,c-a);}\nint ccw(const Line&s,const Point&p){return ccw(s.p1,s.p2,p);}\nbool orthogonal(const Point&a,const Point&b){return eq(dot(a,b),0);}\nbool orthogonal(const Line&s,const Line&t){return orthogonal(vec(s),vec(t));}\nbool parallel(const Point&a,const Point&b){return eq(cross(a,b),0);}\nbool parallel(const Line&s,const Line&t){return parallel(vec(s),vec(t));}\nbool intersect(const Line&s,const Point&p){return eq(cross(vec(s),p-s.p1),0);}\nbool intersect(const Line&s,const Line&t){return !parallel(s,t)||intersect(s,t.p1);}\nbool intersect(const Segment&s,const Point&p){return ccw(s,p)==ON_SEGMENT;}\nbool intersect(const Segment&s,const Segment&t){\n\treturn ccw(s,t.p1)*ccw(s,t.p2)<=0&&ccw(t,s.p1)*ccw(t,s.p2)<=0;\n}\nbool intersect(const Line&s,const Segment&t){\n\treturn cross(vec(s),t.p1-s.p1)*cross(vec(s),t.p2-s.p1)<EPS;\n}\nbool intersect(const Segment&s,const Line&t){return intersect(t,s);}\nbool intersect(const Circle&c,const Point&p){return eq(distance(c.o,p),c.r);}\nint intersect(const Circle&c,const Line&s){\n\tdouble d=distance(s,c.o);\n\treturn eq(d,c.r)?1:d<c.r?2:0;\n}\nint intersect(const Circle&c,const Segment&s){\n\tPoint h=projection(s,c.o);\n\tdouble d1=distance(c.o,s.p1),d2=distance(c.o,s.p2);\n\treturn distance(c.o,h)>c.r+EPS?0\n\t\t:d1<c.r-EPS&&d2<c.r-EPS?0\n\t\t:d1<c.r-EPS&&d2>c.r-EPS||d1>c.r-EPS&&d2<c.r-EPS?1\n\t\t:intersect(s,h)?eq(distance(c.o,h),c.r)?1:2\n\t\t:0;\n}\nint intersect(const Circle&a,const Circle&b){\n\tdouble d=distance(a.o,b.o);\n\treturn eq(d,a.r+b.r)?3:d>a.r+b.r?4:eq(d,abs(a.r-b.r))?1:d>abs(a.r-b.r)?2:0;\n}\ndouble distance(const Point&a,const Point&b){return abs(a-b);}\ndouble distance(const Line&s,const Point&p){return distance(p,projection(s,p));}\ndouble distance(const Line&s,const Line&t){return intersect(s,t)?0:distance(s,t.p1);}\ndouble distance(const Segment&s,const Point&p){\n\treturn distance(p,\n\t\tdot(vec(s),p-s.p1)<0?s.p1\n\t\t:dot(-vec(s),p-s.p2)<0?s.p2\n\t\t:projection(s,p)\n\t);\n}\ndouble distance(const Segment&s,const Segment&t){\n\treturn intersect(s,t)?0:min({\n\t\tdistance(s,t.p1),distance(s,t.p2),\n\t\tdistance(t,s.p1),distance(t,s.p2)\n\t});\n}\ndouble distance(const Line&s,const Segment&t){\n\treturn intersect(s,t)?0:min(distance(s,t.p1),distance(s,t.p2));\n}\ndouble distance(const Segment&s,const Line&t){return distance(t,s);}\ndouble distance(const Circle&c,const Point&p){return abs(distance(c.o,p)-c.r);}\ndouble distance(const Circle&c,const Line&s){return max(distance(s,c.o)-c.r,0.);}\ndouble distance(const Circle&c,const Segment&s){\n\treturn intersect(c,s)?0\n\t\t:contain(c,s)?c.r-max(distance(c.o,s.p1),distance(c.o,s.p2))\n\t\t:distance(s,c.o)-c.r;\n}\ndouble distance(const Circle&a,const Circle&b){return max(distance(a.o,b.o)-a.r-b.r,0.);}\nPoint projection(const Line&s,const Point&p){\n\treturn s.p1+vec(s)*dot(p-s.p1,vec(s))/norm(s);\n}\nPoint reflection(const Line&s,const Point&p){return projection(s,p)*2-p;}\nPoint crosspoint(const Line&s,const Line&t){\n\tdouble d1=cross(vec(s),t.p1-s.p1);\n\tdouble d2=-cross(vec(s),t.p2-s.p1);\n\treturn t.p1+vec(t)*(d1/(d1+d2));\n}\npair<Point,Point>crosspoint(const Circle&c,const Line&s){\n\tPoint h=projection(s,c.o);\n\tPoint e=vec(s)/abs(s)*sqrt(c.r*c.r-norm(h-c.o));\n\treturn minmax(h-e,h+e);\n}\npair<Point,Point>crosspoint(const Circle&c,const Segment&s){\n\tpair<Point,Point>p=crosspoint(c,Line(s));\n\treturn intersect(c,s)==2?p\n\t\t:intersect(s,p.first)?make_pair(p.first,p.first)\n\t\t:make_pair(p.second,p.second);\n}\npair<Point,Point>crosspoint(const Circle&a,const Circle&b){\n\tdouble d=distance(a.o,b.o);\n\tdouble alpha=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\n\tdouble theta=arg(b.o-a.o);\n\treturn minmax(a.o+polar(a.r,theta+alpha),a.o+polar(a.r,theta-alpha));\n}\npair<Point,Point>tangent(const Circle&c,const Point&p){\n\treturn crosspoint(c,Circle(p,sqrt(norm(c.o-p)-c.r*c.r)));\n}\nvector<Line>tangent(const Circle&a,const Circle&b){\n\tvector<Line>ret;\n\tdouble g=distance(a.o,b.o);\n\tif(eq(g,0))return ret;\n\tPoint u=(b.o-a.o)/g;\n\tPoint v=rotate(u,M_PI/2);\n\tfor(int s:{-1,1}){\n\t\tdouble h=(a.r+b.r*s)/g;\n\t\tif(eq(h*h,1))ret.emplace_back(a.o+(h>0?u:-u)*a.r,a.o+(h>0?u:-u)*a.r+v);\n\t\telse if(1-h*h>0){\n\t\t\tPoint U=u*h,V=v*sqrt(1-h*h);\n\t\t\tret.emplace_back(a.o+(U+V)*a.r,b.o-(U+V)*b.r*s);\n\t\t\tret.emplace_back(a.o+(U-V)*a.r,b.o-(U-V)*b.r*s);\n\t\t}\n\t}\n\treturn ret;\n}\nbool is_convex(const Polygon&P){\n\tfor(int i=0;i<P.size();i++)\n\t\tif(ccw(P[i],P[(i+1)%P.size()],P[(i+2)%P.size()])==CLOCKWISE)return false;\n\treturn true;\n}\nPolygon convex_hull(Polygon P,bool ONSEG){\n\tif(P.size()<=2)return P;\n\tsort(P.begin(),P.end());\n\tPolygon ret(2*P.size());\n\tint k=0,t;\n\tif(ONSEG){\n\t\tfor(const Point&p:P){\n\t\t\twhile(k>=2&&ccw(ret[k-2],ret[k-1],p)==CLOCKWISE)k--;\n\t\t\tret[k++]=p;\n\t\t}\n\t\tt=k;\n\t\tfor(int i=P.size()-2;i>=0;i--){\n\t\t\twhile(k>=t+1&&ccw(ret[k-2],ret[k-1],P[i])==CLOCKWISE)k--;\n\t\t\tret[k++]=P[i];\n\t\t}\n\t}\n\telse{\n\t\tfor(const Point&p:P){\n\t\t\twhile(k>=2&&ccw(ret[k-2],ret[k-1],p)!=COUNTER_CLOCKWISE)k--;\n\t\t\tret[k++]=p;\n\t\t}\n\t\tt=k;\n\t\tfor(int i=P.size()-2;i>=0;i--){\n\t\t\twhile(k>=t+1&&ccw(ret[k-2],ret[k-1],P[i])!=COUNTER_CLOCKWISE)k--;\n\t\t\tret[k++]=P[i];\n\t\t}\n\t}\n\tret.resize(k-1);\n\tint mi=0;\n\tfor(int i=1;i<k-1;i++)\n\t\tif(eq(ret[mi].y,ret[i].y)?ret[mi].x>ret[i].x:ret[mi].y>ret[i].y)mi=i;\n\trotate(ret.begin(),ret.begin()+mi,ret.end());\n\treturn ret;\n}\nint contain(const Polygon&P,const Point&p){\n\tbool in=false;\n\tfor(int i=0;i<P.size();i++){\n\t\tSegment s(P[i],P[(i+1)%P.size()]);\n\t\tif(intersect(s,p))return ON;\n\t\telse{\n\t\t\tPoint a=s.p1-p,b=s.p2-p;\n\t\t\tif(a.y>b.y)swap(a,b);\n\t\t\tif(a.y<EPS&&EPS<b.y&&cross(a,b)>EPS)in=!in;\n\t\t}\n\t}\n\treturn in?IN:OUT;\n}\nint contain(const Circle&c,const Point&p){\n\tdouble d=distance(c.o,p);\n\treturn eq(d,c.r)?ON:d<c.r?IN:OUT;\n}\nint contain(const Circle&c,const Segment&s){\n\tdouble d1=distance(c.o,s.p1),d2=distance(c.o,s.p2);\n\treturn d1<c.r+EPS&&d2<c.r+EPS?eq(d1,c.r)||eq(d2,c.r)?ON:IN:OUT;\n}\nPolygon convex_cut(const Polygon&P,const Line&s){\n\tPolygon ret;\n\tfor(int i=0;i<P.size();i++){\n\t\tSegment t(P[i],P[(i+1)%P.size()]);\n\t\tif(ccw(s,t.p1)!=CLOCKWISE)ret.push_back(t.p1);\n\t\tif(!parallel(s,t)&&!intersect(s,t.p1)\n\t\t\t&&!intersect(s,t.p2)&&intersect(s,t))ret.push_back(crosspoint(s,t));\n\t}\n\treturn ret;\n}\ndouble diameter(Polygon P){\n\tif(!is_convex(P))P=convex_hull(P);\n\tint mi=0,Mi=0;\n\tfor(int i=1;i<P.size();i++){\n\t\tif(P[i].x<P[mi].x)mi=i;\n\t\tif(P[i].x>P[Mi].x)Mi=i;\n\t}\n\tdouble ret=0;\n\tint sm=mi,sM=Mi;\n\twhile(mi!=sM||Mi!=sm){\n\t\tret=max(ret,norm(P[mi]-P[Mi]));\n\t\tif(cross(P[(mi+1)%P.size()]-P[mi],P[(Mi+1)%P.size()]-P[Mi])<0)mi=(mi+1)%P.size();\n\t\telse Mi=(Mi+1)%P.size();\n\t}\n\treturn sqrt(ret);\n}\ndouble area(const Polygon&P){\n\tdouble ret=0;\n\tfor(int i=0;i<P.size();i++)ret+=cross(P[i],P[(i+1)%P.size()]);\n\treturn ret/2;\n}\ndouble area(const Polygon&P,const Line&s){return area(convex_cut(P,s));}\ndouble area(const Polygon&P,const Circle&c){\n\tdouble ret=0;\n\tfor(int i=0;i<P.size();i++)\n\t{\n\t\tSegment s(P[i],P[(i+1)%P.size()]);\n\t\tif(contain(c,s))ret+=cross(s.p1-c.o,s.p2-c.o);\n\t\telse if(!intersect(c,s)){\n\t\t\tdouble a=arg(s.p2-c.o)-arg(s.p1-c.o);\n\t\t\tif(a>M_PI)a-=2*M_PI;\n\t\t\tif(a<-M_PI)a+=2*M_PI;\n\t\t\tret+=c.r*c.r*a;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpair<Point,Point>p=crosspoint(c,s);\n\t\t\tPoint tmp[4]={s.p1,p.first,p.second,s.p2};\n\t\t\tif(intersect(c,Segment(s.p1,p.first))==2)swap(tmp[1],tmp[2]);\n\t\t\tfor(int j=0;j<3;j++)\n\t\t\t{\n\t\t\t\tSegment t(tmp[j],tmp[j+1]);\n\t\t\t\tif(contain(c,t))ret+=cross(t.p1-c.o,t.p2-c.o);\n\t\t\t\telse{\n\t\t\t\t\tdouble a=arg(t.p2-c.o)-arg(t.p1-c.o);\n\t\t\t\t\tif(a>M_PI)a-=2*M_PI;\n\t\t\t\t\tif(a<-M_PI)a+=2*M_PI;\n\t\t\t\t\tret+=c.r*c.r*a;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn ret/2;\n}\n#line 4 \"a.cpp\"\nint N;\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tfor(;N--;)\n\t\t{\n\t\t\tint M;\n\t\t\tcin>>M;\n\t\t\tvector<Polygon>A(M);\n\t\t\tfor(int i=0;i<M;i++)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<4;j++)\n\t\t\t\t{\n\t\t\t\t\tPoint p;cin>>p;A[i].push_back(p);\n\t\t\t\t}\n\t\t\t}\n\t\t\tUF uf(M);\n\t\t\tint ans=M;\n\t\t\tfor(int i=0;i<M;i++)for(int j=0;j<M;j++)if(i!=j)\n\t\t\t{\n\t\t\t\tfor(int k=0;k<4;k++)\n\t\t\t\t{\n\t\t\t\t\tif(contain(A[i],A[j][k]))ans-=uf.unite(i,j);\n\t\t\t\t\tfor(int l=0;l<4;l++)\n\t\t\t\t\t\tif(intersect(Segment(A[i][k],A[i][(k+1)%4]),Segment(A[j][l],A[j][(l+1)%4])))\n\t\t\t\t\t\t\tans-=uf.unite(i,j);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<ans<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3200,
"score_of_the_acc": -0.945,
"final_rank": 7
},
{
"submission_id": "aoj_0214_4469272",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nusing real = double;\nstatic constexpr real EPS = 1e-10;\nstruct Point {\n real x, y;\n Point& operator+=(const Point a) { x += a.x; y += a.y; return *this; }\n Point& operator-=(const Point a) { x -= a.x; y -= a.y; return *this; }\n Point& operator*=(const real k) { x *= k; y *= k; return *this; }\n Point& operator/=(const real k) { x /= k; y /= k; return *this; }\n Point operator+(const Point a) const {return Point(*this) += a; }\n Point operator-(const Point a) const {return Point(*this) -= a; }\n Point operator*(const real k) const {return Point(*this) *= k; }\n Point operator/(const real k) const {return Point(*this) /= k; }\n bool operator<(const Point &a) const { return (x != a.x ? x < a.x : y < a.y); }\n explicit Point(real a = 0, real b = 0) : x(a), y(b) {};\n};\n\nbool sorty(Point a, Point b){\n return (a.y != b.y ? a.y < b.y : a.x < b.x);\n}\n\nistream& operator>> (istream& s, Point& P){\n s >> P.x >> P.y;\n return s;\n}\n\ninline real dot(Point a, Point b){ return a.x*b.x + a.y*b.y; }\ninline real cross(Point a, Point b){ return a.x*b.y - a.y*b.x; }\ninline real abs(Point a){ return sqrt(dot(a, a)); }\n\n\nreal angle(Point A, Point B){\n return acos(dot(A, B)/abs(A)/abs(B));\n}\n\n\n\nstatic constexpr int COUNTER_CLOCKWISE = 1;\nstatic constexpr int CLOCKWISE = -1;\nstatic constexpr int ONLINE_BACK = 2;\nstatic constexpr int ONLINE_FRONT = -2;\nstatic constexpr int ON_SEGMENT = 0;\n\nint ccw(Point a, Point b, Point c){\n b -= a; c -= a;\n if(cross(b, c) > EPS) return COUNTER_CLOCKWISE;\n if(cross(b, c) < -EPS) return CLOCKWISE;\n if(dot(b, c) < 0) return ONLINE_BACK;\n if(abs(b) < abs(c)) return ONLINE_FRONT;\n return ON_SEGMENT;\n}\nstruct Segment {\n Point a, b;\n Segment(Point x, Point y) : a(x), b(y) {};\n};\n\nstruct Line {\n Point a, b;\n Line(Point x, Point y) : a(x), b(y) {};\n};\n\nstruct Circle{\n Point c; real r;\n Circle(Point c, real r): c(c), r(r) {};\n};\n\nusing Polygon = vector<Point>;\n\nbool intersect(Segment s, 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\nbool intersect(Segment s, Line t){\n int a = ccw(t.a, t.b, s.a), b = ccw(t.a, t.b, s.b);\n return (!(a&1) || !(b&1) || a != b);\n}\n\nPoint polar(double r, double t){\n return Point(r*cos(t), r*sin(t));\n}\n\ndouble arg(Point p){\n return atan2(p.y, p.x);\n}\n\nstatic constexpr int CONTAIN = 0;\nstatic constexpr int INSCRIBE = 1;\nstatic constexpr int INTERSECT = 2;\nstatic constexpr int CIRCUMSCRIBED = 3;\nstatic constexpr int SEPARATE = 4;\n\nint intersect(Circle c1, Circle c2){\n if(c1.r < c2.r) swap(c1, c2);\n real d = abs(c1.c-c2.c);\n real r = c1.r + c2.r;\n if(fabs(d-r) < EPS) return CIRCUMSCRIBED;\n if(d > r) return SEPARATE;\n if(fabs(d+c2.r-c1.r) < EPS) return INSCRIBE;\n if(d+c2.r < c1.r) return CONTAIN;\n return INTERSECT;\n}\n\nreal distance(Line l, Point c){\n return abs(cross(l.b-l.a, c-l.a)/abs(l.b-l.a));\n}\n\n\nreal distance(Segment s, Point c){\n if(dot(s.b-s.a, c-s.a) < EPS) return abs(c-s.a);\n if(dot(s.a-s.b, c-s.b) < EPS) return abs(c-s.b);\n return abs(cross(s.b-s.a, c-s.a)) / abs(s.a-s.b);\n}\n\nreal distance(Segment s, Segment t){\n if(intersect(s, t)) return 0.0;\n return min({distance(s, t.a), distance(s, t.b),\n distance(t, s.a), distance(t, s.b)});\n}\n\n\nPoint project(Line l, Point p){\n Point Q = l.b-l.a;\n return l.a + Q*(dot(p-l.a, Q) / dot(Q, Q));\n}\n\n\nPoint project(Segment s, Point p){\n Point Q = s.b-s.a;\n return s.a + Q*(dot(p-s.a, Q) / dot(Q, Q));\n}\n\nPoint refrect(Segment s, Point p){\n Point Q = project(s, p);\n return Q*2-p;\n}\n\nbool isOrthogonal(Segment s, Segment t){\n return fabs(dot(s.b-s.a, t.b-t.a)) < EPS;\n}\n\nbool isparallel(Segment s, Segment t){\n return fabs(cross(s.b-s.a, t.b-t.a)) < EPS;\n}\n\n\nPoint crossPoint(Segment s, Segment t){\n real d1 = cross(s.b-s.a, t.b-t.a);\n real d2 = cross(s.b-s.a, s.b-t.a);\n if(fabs(d1) < EPS && fabs(d2) < EPS) return t.a;\n return t.a+(t.b-t.a)*d2/d1;\n}\n\nPoint crossPoint(Line s, Line t){\n real d1 = cross(s.b-s.a, t.b-t.a);\n real d2 = cross(s.b-s.a, s.b-t.a);\n if(fabs(d1) < EPS && fabs(d2) < EPS) return t.a;\n return t.a+(t.b-t.a)*d2/d1;\n}\n\nPolygon crossPoint(Circle c, Line l){\n Point p = project(l, c.c), q = (l.b-l.a)/abs(l.b-l.a);\n if(abs(distance(l, c.c)-c.r) < EPS){\n return {p};\n }\n double k = sqrt(c.r*c.r-dot(p-c.c, p-c.c));\n return {p-q*k, p+q*k};\n}\n\nPolygon crossPoint(Circle c, Segment s){\n auto tmp = crossPoint(c, Line(s.a, s.b));\n Polygon ret;\n for (auto &&i : tmp) {\n if(distance(s, i) < EPS) ret.emplace_back(i);\n }\n return ret;\n}\n\n\nPolygon crossPoint(Circle c1, Circle 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 {c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a)};\n}\n\nPolygon tangent(Circle c1, Point p){\n Circle c2 = Circle(p, sqrt(dot(c1.c-p, c1.c-p)-c1.r*c1.r));\n return crossPoint(c1, c2);\n}\nvector<Line> tangent(Circle c1, Circle c2){\n vector<Line> ret;\n if(c1.r < c2.r) swap(c1, c2);\n double k = dot(c1.c-c2.c, c1.c-c2.c);\n if(abs(k) < EPS) return {};\n Point u = (c2.c-c1.c)/sqrt(k);\n Point v(-u.y, u.x);\n for (auto &&i : {-1, 1}) {\n double h = (c1.r+i*c2.r)/sqrt(k);\n if(abs(h*h-1) < EPS){\n ret.emplace_back(c1.c+u*c1.r, c1.c+(u+v)*c1.r);\n }else if(h*h < 1){\n Point u2 = u*h, v2 = v*sqrt(1-h*h);\n ret.emplace_back(c1.c+(u2+v2)*c1.r, c2.c-(u2+v2)*c2.r*i);\n ret.emplace_back(c1.c+(u2-v2)*c1.r, c2.c-(u2-v2)*c2.r*i);\n }\n }\n return ret;\n}\n\nreal area(Polygon v){\n if(v.size() < 3) return 0.0;\n real ans = 0.0;\n for (int i = 0; i < v.size(); ++i) {\n ans += cross(v[i], v[(i+1)%v.size()]);\n }\n return ans/2;\n}\n\nreal area(Circle c, Polygon &v){\n int n = v.size();\n real ans = 0.0;\n Polygon u;\n for (int i = 0; i < n; ++i) {\n u.emplace_back(v[i]);\n auto q = crossPoint(c, Segment(v[i], v[(i+1)%n]));\n for (auto &&j : q) {\n u.emplace_back(j);\n }\n }\n for (int i = 0; i < u.size(); ++i) {\n Point A = u[i]-c.c, B = u[(i+1)%u.size()]-c.c;\n if(abs(A) >= c.r+EPS || abs(B) >= c.r+EPS){\n Point C = polar(1, arg(B)-arg(A));\n ans += c.r*c.r*arg(C)/2;\n }else {\n ans += cross(A, B)/2;\n }\n }\n return ans;\n}\n\nPolygon convex_hull(Polygon v){\n int n = v.size();\n sort(v.begin(),v.end(), sorty);\n int k = 0;\n Polygon ret(n*2);\n for (int i = 0; i < n; ++i) {\n while(k > 1 && cross(ret[k-1]-ret[k-2], v[i]-ret[k-1]) < 0) k--;\n ret[k++] = v[i];\n }\n for(int i = n-2, t=k; i >= 0; i--){\n while(k > t && cross(ret[k-1]-ret[k-2], v[i]-ret[k-1]) < 0) k--;\n ret[k++] = v[i];\n }\n ret.resize(k-1);\n return ret;\n}\n\nbool isconvex(Polygon v){\n int n = v.size();\n for (int i = 0; i < n; ++i) {\n if(ccw(v[(i+n-1)%n], v[i], v[(i+1)%n]) == CLOCKWISE) return false;\n }\n return true;\n}\n\nint contains(Polygon v, Point p){\n int n = v.size();\n bool x = false;\n static constexpr int IN = 2;\n static constexpr int ON = 1;\n static constexpr int OUT = 0;\n for (int i = 0; i < n; ++i) {\n Point a = v[i]-p, b = v[(i+1)%n]-p;\n if(fabs(cross(a, b)) < EPS && dot(a, b) < EPS) return ON;\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?IN:OUT);\n}\n\nreal diameter(Polygon v){\n int n = v.size();\n if(n == 2) return abs(v[0]-v[1]);\n int i = 0, j = 0;\n for (int k = 0; k < n; ++k) {\n if(v[i] < v[k]) i = k;\n if(!(v[j] < v[k])) j = k;\n }\n real ret = 0;\n int si = i, sj = j;\n while(i != sj || j != si){\n ret = max(ret, abs(v[i]-v[j]));\n if(cross(v[(i+1)%n]-v[i], v[(j+1)%n]-v[j]) < 0.0) i = (i+1)%n;\n else j = (j+1)%n;\n }\n return ret;\n}\n\nPolygon convexCut(Polygon v, Line l){\n Polygon q;\n int n = v.size();\n for (int i = 0; i < n; ++i) {\n Point a = v[i], b = v[(i+1)%n];\n if(ccw(l.a, l.b, a) != -1) q.push_back(a);\n if(ccw(l.a, l.b, a)*ccw(l.a, l.b, b) < 0){\n q.push_back(crossPoint(Line(a, b), l));\n }\n }\n return q;\n}\n\nreal closest_pair(Polygon &v, int l = 0, int r = -1){\n if(!(~r)){\n r = v.size();\n sort(v.begin(),v.end());\n }\n if(r - l < 2) {\n return abs(v.front()-v.back());\n }\n int mid = (l+r)/2;\n real p = v[mid].x;\n real d = min(closest_pair(v, l, mid), closest_pair(v, mid, r));\n inplace_merge(v.begin()+l, v.begin()+mid, v.begin()+r, sorty);\n Polygon u;\n for (int i = l; i < r; ++i) {\n if(fabs(v[i].x-p) >= d) continue;\n for (int j = 0; j < u.size(); ++j) {\n real dy = v[i].y-next(u.rbegin(), j)->y;\n if(dy >= d) break;\n d = min(d, abs(v[i]-*next(u.rbegin(), j)));\n }\n u.emplace_back(v[i]);\n }\n return d;\n}\n\nclass UnionFind {\n int n;\n vector<int> uni;\n int forest_size;\npublic:\n explicit UnionFind(int n) : n(n), uni(static_cast<u32>(n), -1), forest_size(n) {};\n\n int root(int a){\n if (uni[a] < 0) return a;\n else return (uni[a] = root(uni[a]));\n }\n\n bool unite(int a, int b) {\n a = root(a);\n b = root(b);\n if(a == b) return false;\n if(uni[a] > uni[b]) swap(a, b);\n uni[a] += uni[b];\n uni[b] = a;\n forest_size--;\n return true;\n }\n int size(){ return forest_size; }\n int size(int i){ return -uni[root(i)]; }\n bool same(int a, int b) { return root(a) == root(b); }\n};\n\nbool solve(){\n int t;\n cin >> t;\n if(!t) return 0;\n while(t--){\n int n;\n cin >> n;\n UnionFind uf(n);\n vector<Polygon> v(n, Polygon(4));\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < 4; ++j) {\n cin >> v[i][j];\n }\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n for (int k = 0; k < 4; ++k) {\n if(contains(v[i], v[j][k])) {\n uf.unite(i, j);\n break;\n }\n for (int l = 0; l < 4; ++l) {\n if(intersect(Segment(v[i][k], v[i][(k+1)&3]), Segment(v[j][l], v[j][(l+1)&3]))) {\n uf.unite(i, j);\n k = l = 4;\n }\n }\n }\n }\n }\n cout << uf.size() << \"\\n\";\n }\n return 1;\n}\n\nint main() {\n while(solve());\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3100,
"score_of_the_acc": -0.8959,
"final_rank": 5
},
{
"submission_id": "aoj_0214_3810073",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<iomanip>\n#include<cmath>\n#include<algorithm>\n#include<cassert>\nusing namespace std;\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nstruct Point;\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\nstruct Circle;\nstruct Segment;\ntypedef Segment Line;\ndouble norm(Point a);\ndouble abs(Point a);\ndouble dot(Vector a, Vector b);\ndouble cross(Vector a, Vector b);\ndouble getDistance(Point a, Point b);\ndouble getDistanceLP(Line l, Point p);\ndouble getDistanceSP(Segment s, Point p);\ndouble getDistance(Segment s1, Segment s2);\nbool isOrthogonal(Vector a, Vector b);\nbool isOrthogonal(Point a1, Point a2, Point b1, Point b2);\nbool isOrthogonal(Segment s1, Segment s2);\nbool isParallel(Vector a, Vector b);\nbool isParallel(Point a1, Point a2, Point b1, Point b2);\nbool isParallel(Segment s1, Segment s2);\nint ccw(Point p0, Point p1, Point p2);\nbool intersect(Point p1, Point p2, Point p3, Point p4);\nbool intersect(Segment s1, Segment s2);\nbool intersect(Circle c, Line l); // 誤差の検証をしていない\nbool intersect(Circle c1, Circle c2); // 誤差の検証をしていない\n\nPoint project(Segment s, Point p);\nPoint reflect(Segment s, Point p);\nPoint getCrossPoint(Segment s1, Segment s2);\npair<Point,Point> getCrossPoints(Circle c, Line l);\npair<Point,Point> getCrossPoints(Circle c1, Circle c2); // 誤差の検証をしていない\npair<Point,Point> getContactPoints(Circle c, Point p); // 接点 点は円の外部\n\ndouble area(Polygon g); // convexでなくてもよい. absを消せば符号付き面積\nbool isConvex(Polygon g); // O(n^2) 線形時間アルゴリズムが存在するらしい\nint contains(Polygon g, Point p);\n\ndouble arg(Vector p); // 偏角\nVector polar(double a, double r); // 極座標系->ベクトル\n\nPolygon andrewScan(Polygon g); // 凸包の辺上の点も含めたければ!=CLOCKWISEを==COUNTER_CLOCKWISEに\ndouble convexDiameter(Polygon g); // gはconvex \n\n\nstruct Point{\n double x, y;\n\n Point(double x = 0, double y = 0) : x(x), y(y) {}\n\n Point operator + (Point p){ return Point(x+p.x, y+p.y); }\n Point operator - (Point p){ return Point(x-p.x, y-p.y); }\n Point operator * (double a){ return Point(a*x, a*y); }\n Point operator / (double a){ return Point(x/a, y/a); }\n\n double abs() { return sqrt(norm()); }\n double norm() { return x*x + y*y; }\n\n bool operator < (const Point &p) const{\n return x != 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;\ntypedef vector<Point> Polygon;\n\nstruct Circle{\n Point c;\n double r;\n Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}\n};\n\nstruct Segment{\n Point p1, p2;\n Segment(Point p1, Point p2) : p1(p1), p2(p2) {}\n};\n\ntypedef Segment Line;\n\n\ndouble norm(Point a){\n return a.x * a.x + a.y * a.y;\n}\n\ndouble abs(Point a){\n return sqrt(norm(a));\n}\n\ndouble dot(Vector a, Vector b){\n return a.x * b.x + a.y * b.y;\n}\n\ndouble cross(Vector a, Vector b){\n return a.x * b.y - a.y * b.x;\n}\n\ndouble getDistance(Point a, Point b){\n return abs(a - b);\n}\n\ndouble getDistanceLP(Line l, Point p){\n return abs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));\n}\n\ndouble getDistanceSP(Segment s, Point p){\n if(dot(s.p2-s.p1, p-s.p1) < 0.0) return abs(p-s.p1);\n if(dot(s.p1-s.p2, p-s.p2) < 0.0) return abs(p-s.p2);\n return getDistanceLP(s, p);\n}\n\ndouble getDistance(Segment s1, Segment s2){\n if(intersect(s1, s2)) return 0.0;\n return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2), \n getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});\n}\n\n\nbool isOrthogonal(Vector a, Vector b){\n return equals(dot(a, b), 0.0);\n}\nbool isOrthogonal(Point a1, Point a2, Point b1, Point b2){\n return isOrthogonal(a1-a2, b1-b2);\n}\nbool isOrthogonal(Segment s1, Segment s2){\n return equals(dot(s1.p2-s1.p1, s2.p2-s2.p1), 0.0);\n}\nbool isParallel(Vector a, Vector b){\n return equals(cross(a, b), 0.0);\n}\nbool isParallel(Point a1, Point a2, Point b1, Point b2){\n return isParallel(a1-a2, b1-b2);\n}\nbool isParallel(Segment s1, Segment s2){\n return equals(cross(s1.p2-s1.p1, s2.p2-s2.p1), 0.0);\n}\n\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2; // p2->p0->p1\nstatic const int ONLINE_FRONT = -2; // p0->p1->p2\nstatic const int ON_SEGMENT = 0; // p0->p2->p1\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 intersect(Point p1, Point p2, Point p3, Point p4){\n return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&\n ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);\n}\nbool intersect(Segment s1, Segment s2){\n return intersect(s1.p1, s1.p2, s2.p1, s2.p2);\n}\nbool intersect(Circle c, Line l){\n return getDistanceLP(l, c.c) < c.r+EPS;\n}\nbool intersect(Circle c1, Circle c2){\n return abs(c1.r-c2.r) <= getDistance(c1.c, c2.c) && getDistance(c1.c, c2.c) < c1.r+c2.r+EPS;\n}\n\nPoint project(Segment s, Point p){\n Vector base = s.p2 - s.p1;\n double r = dot(p - s.p1, base) / norm(base);\n return s.p1 + base * r;\n}\n\nPoint reflect(Segment s, Point p){\n return p + (project(s, p) - p) * 2.0;\n}\n\nPoint getCrossPoint(Segment s1, Segment 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\npair<Point,Point> getCrossPoints(Circle c, Line l){\n assert(intersect(c, l));\n Vector pr = project(l, c.c);\n Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);\n double base = sqrt(c.r * c.r - norm(pr - c.c));\n return make_pair(pr + e*base, pr - e*base);\n}\n\npair<Point,Point> getCrossPoints(Circle c1, Circle c2){\n assert(intersect(c1, c2));\n double d = abs(c1.c - c2.c);\n double a = acos( (c1.r*c1.r + d*d - c2.r*c2.r)/(2*c1.r*d) );\n double t = arg(c2.c - c1.c);\n return make_pair(c1.c + polar(c1.r, t+a), c1.c + polar(c1.r, t-a));\n}\n\npair<Point,Point> getContactPoints(Circle c, Point p){\n assert(c.r < getDistance(c.c, p));\n double d = getDistance(c.c, p);\n return getCrossPoints(c, Circle(p, sqrt(d*d-c.r*c.r)));\n}\n\ndouble area(Polygon g){\n if(g.size() < 3) return 0;\n int n = g.size();\n Point o(0.0, 0.0);\n double s = 0.0;\n for(int i = 0; i < n; i++) s += cross(g[i]-o, g[(i+1)%n]-o);\n return abs(s) / 2.0;\n}\n\nbool isConvex(Polygon g){\n bool ret = true;\n int n = g.size();\n for(int i = 0; i < n; i++){\n for(int j = i+1; j < n; j++){\n if(cross(g[i]-g[(i+n-1)%n], g[j]-g[(i+n-1)%n]) < -EPS || cross(g[(i+1)%n]-g[i], g[j]-g[i]) < -EPS){\n ret = false;\n }\n }\n }\n return ret;\n}\n\nstatic const int IN = 2;\nstatic const int ON = 1;\nstatic const int OUT = 0;\nint contains(Polygon g, Point p){\n int n = g.size();\n bool x = false;\n for(int i = 0; i < n; i++){\n Point a = g[i] - p, b = g[(i+1)%n] - p;\n if(abs(cross(a, b)) < EPS && dot(a, b) < EPS) return ON;\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 ? IN : OUT;\n}\n\n\ndouble arg(Vector p){\n return atan2(p.y, p.x);\n}\n\nVector polar(double a, double r){\n return Point(a * cos(r), a * sin(r));\n}\n\n\nPolygon andrewScan(Polygon g){\n Polygon u, l;\n if(g.size() < 3) return g;\n sort(g.begin(), g.end());\n u.push_back(g[0]);\n u.push_back(g[1]);\n l.push_back(g[g.size()-1]);\n l.push_back(g[g.size()-2]);\n\n // upper\n for(int i = 2; i < g.size(); i++){\n for(int n = u.size(); n >= 2 && ccw(u[n-2], u[n-1], g[i]) != CLOCKWISE; n--){\n u.pop_back();\n }\n u.push_back(g[i]);\n }\n\n // lower\n for(int i = g.size()-3; i >= 0; i--){\n for(int n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], g[i]) != CLOCKWISE; n--){\n l.pop_back();\n }\n l.push_back(g[i]);\n }\n\n reverse(l.begin(), l.end());\n for(int i = u.size()-2; i >= 1; i--) l.push_back(u[i]);\n\n return l;\n}\n\ndouble convexDiameter(Polygon g){\n double d = 0.0;\n int n = g.size();\n int is = 0, js = 0;\n for(int i = 1; i < n; i++){\n if(g[i].y > g[is].y) is = i;\n if(g[i].y < g[js].y) js = i;\n }\n d = getDistance(g[is], g[js]);\n\n int i = is, j = js, maxi = is, maxj = js;\n do{\n if(cross(g[(i+1)%n]-g[i], g[(j+1)%n]-g[j]) >= 0.0) j = (j+1)%n;\n else i = (i+1)%n;\n if(getDistance(g[i], g[j]) > d){\n d = getDistance(g[i], g[j]);\n maxi = i, maxj = j;\n }\n }while(i != is || j != js);\n\n return d; // farthest pair is (maxi, maxj).\n}\n\nstruct UF{\n vector<int> p;\n int n;\n\n UF(int siz){\n n = siz;\n p.resize(n, 0);\n for(int i = 0; i < n; i++) p[i] = i;\n }\n\n int parent(int x){\n if(p[x] != x) p[x] = parent(p[x]);\n return p[x];\n }\n\n void unite(int x, int y){\n x = parent(x), y = parent(y);\n p[x] = y;\n }\n};\n\nint main(){\n int q;\n while(cin >> q, q){\n while(q-- > 0){\n int n;\n cin >> n;\n Polygon g[n];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < 4; j++){\n double x, y;\n cin >> x >> y;\n g[i].push_back(Point(x,y));\n }\n }\n UF uf(n);\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n bool judge = true;\n for(int k = 0; k < 4; k++){\n judge &= contains(g[j], g[i][k])!=0;\n }\n for(int k = 0; k < 4; k++){\n for(int l = 0; l < 4; l++){\n judge |= intersect(g[i][k], g[i][(k+1)%4], g[j][l], g[j][(l+1)%4]);\n if(isParallel(g[i][k], g[i][(k+1)%4], g[j][l], g[j][(l+1)%4])){\n if(ccw(g[j][l], g[j][(l+1)%4], g[i][k]) == ON_SEGMENT) judge = true;\n if(ccw(g[j][l], g[j][(l+1)%4], g[i][(k+1)%4]) == ON_SEGMENT) judge = true;\n }\n }\n }\n if(judge) uf.unite(i, j);\n }\n }\n vector<int> ans;\n for(int i = 0; i < n; i++) ans.push_back(uf.parent(i));\n sort(ans.begin(), ans.end());\n ans.erase(unique(ans.begin(),ans.end()), ans.end());\n cout << ans.size() << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3248,
"score_of_the_acc": -0.9686,
"final_rank": 12
},
{
"submission_id": "aoj_0214_3695835",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\nusing namespace std;\n\n// xy平面上の点(ベクトル)を表現するには、complex型を利用するとよい\ntypedef complex<double> P;\n\n// 辺の表現 (座標を2つ pair でもつ)\ntypedef pair<P, P> L;\n\n// 円の表現 (座標 P と 半径 d で表現する)\ntypedef pair<P, double> C;\n\n// 成分を取り出すのを簡単にする\n#define X real()\n#define Y imag()\n\n// 誤差(epsilon)の定義\n#define EPS (1e-10)\n\n// 2つの要素が等しいかどうか\n#define EQ(a,b) (abs((a) - (b)) < EPS)\n\n// 2つのベクトルが等しいかどうか\n#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )\n\n// m は n より大きい(以上)かどうか\n#define LE(n, m) ((n) < (m) + EPS)\n#define LEQ(n, m) ((n) <= (m) + EPS)\n\n// m は n より小さい(以下)かどうか\n#define GE(n, m) ((n) + EPS > (m))\n#define GEQ(n, m) ((n) + EPS >= (m))\n\n// 2つのベクトルの内積を求める\ndouble dot(P a, P b) {\n return (a.X * b.X + a.Y * b.Y);\n}\n\n// 2つのベクトルの外積を求める\ndouble cross(P a, P b) {\n return (a.X * b.Y - a.Y * b.X);\n}\n\n// Union-Find 木 (Verified: AtCoder Typical Contest 001 B)\nstruct UnionFind {\nprivate:\n const int n;\n int __size;\n vector<int> uf;\npublic:\n // 初期化 UnionFind uni(n) のように宣言すれば良い\n UnionFind(int _n) : n(_n), __size(_n), uf(_n, -1) {}\n // find (木の根を求める)\n int find(int x) {return (uf[x] < 0) ? x : uf[x] = find(uf[x]);}\n // x と y が同じ集合に属するかどうか\n bool same(int x, int y) {return find(x) == find(y);}\n // x が属する集合の要素数\n int size(int x) {return -uf[find(x)];}\n // 集合はいくつあるか\n int size() {return __size;}\n // x と y の属する集合を併合\n void unite(int x, int y) {\n x = find(x); y = find(y);\n if(x == y) return;\n __size--;\n if(uf[y] < uf[x]) swap(x, y);\n uf[x] += uf[y]; uf[y] = x;\n }\n};\n\n// 凸多角形の内部判定 O(log n)\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inCcwConvex(P p, const vector<P> &ps) {\n int n = ps.size();\n P g = (ps[0] + ps[n / 3] + ps[n*2 / 3]) / 3.0;\n if(g == p) return 1;\n P gp = p - g;\n\n int l = 0, r = n;\n while(l + 1 < r) {\n int mid = (l + r) / 2;\n P gl = ps[l] - g;\n P gm = ps[mid] - g;\n if(cross(gl,gm) > 0) {\n if(cross(gl,gp) >= 0 && cross(gm,gp) <= 0) r = mid;\n else l = mid;\n }\n else {\n if(cross(gl,gp) <= 0 && cross(gm,gp) >= 0) l = mid;\n else r = mid;\n }\n }\n r %= n;\n double cr = cross(ps[l] - p, ps[r] - p);\n return EQ(cr, 0) ? 2 : cr < 0 ? 0 : 1;\n}\n\n// ccw (c が直線(線分) ab に対してどのような位置関係か？)\n// Verified: AOJ CGL_1_C: Counter-Clockwise\n// +1 ... a → b で半時計方向に折れて b → c (COUNTER_CLOCKWISE)\n// -1 ... a → b で時計方向に折れて b → c (CLOCKWISE)\n// +2 ... c, a, b がこの順で同一直線状にある場合 (ONLINE_BACK)\n// -2 ... a, b, c がこの順で同一直線状にある場合 ( or a == b ) (ONLINE_FRONT)\n// 0 ... c が線分 ab 上にある場合 (点 a, b 上を含む) (ON_SEGMENT)\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) < 0 ) return +2;\n if( norm(b) < norm(c) ) return -2;\n return 0;\n}\n\n// 線分 a1, a2 と線分 b1, b2 の交差判定\n// Verified: CGL_2_B: Intersection\nbool isec_ss(P a1, P a2, P b1, P b2) {\n return ( ccw(a1,a2,b1) * ccw(a1,a2,b2) <= 0 ) &&\n ( ccw(b1,b2,a1) * ccw(b1,b2,a2) <= 0 );\n}\n\nbool intersect(vector<P> A, vector<P> B) {\n bool res = false;\n for(size_t k=0; k<A.size(); k++) {\n if(inCcwConvex(A[k], B) > 0) {\n res = true;\n }\n }\n\n for(size_t i=0; i<A.size(); i++) {\n for(size_t j=0; j<B.size(); j++) {\n L la(A[i], A[(i+1)%A.size()]), lb(B[j], B[(j+1)%B.size()]);\n if(isec_ss(la.first, la.second, lb.first, lb.second)) res = true;\n }\n }\n return res;\n}\n\nint solve_testcase() {\n int N; cin >> N;\n if(N == 0) return 1;\n\n for(int i=0; i<N; i++) {\n int M; cin >> M;\n UnionFind uf(M);\n vector< vector<P> > polys;\n for(int j=0; j<M; j++) {\n vector<P> p;\n for(int k=0; k<4; k++) {\n double x, y; cin >> x >> y;\n p.emplace_back(x, y);\n }\n reverse(p.begin(), p.end());\n polys.emplace_back(p);\n }\n for(int x=0; x<M; x++) {\n for(int y=0; y<x; y++) {\n if(intersect(polys[x], polys[y]) or intersect(polys[y], polys[x])) {\n uf.unite(x, y);\n }\n }\n }\n cout << uf.size() << endl;\n }\n return 0;\n}\n\nint main() {\n while(!solve_testcase());\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3204,
"score_of_the_acc": -0.947,
"final_rank": 8
},
{
"submission_id": "aoj_0214_3693527",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nstruct UnionFind{\n vector<int> par;\n vector<int> ranks;\n vector<int> size;\n\nprivate:\n void init(int n = 1){\n par.resize(n);\n ranks.resize(n);\n size.resize(n);\n for(int i=0; i<n; i++){\n par[i] = i;\n ranks[i] = 0;\n size[i] = 1;\n }\n }\n\npublic:\n UnionFind(int n = 1){\n init(n);\n }\n\n int find(int x){\n if(par[x] == x) return x;\n else return 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(ranks[x] < ranks[y]) swap(x, y);\n if(ranks[x] == ranks[y]) ranks[x]++;\n par[y] = x;\n size[x] += size[y];\n return ;\n }\n};\n\nstruct Point{\n double x, y;\n Point(double x = 0, double y = 0): x(x), y(y) {}\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 a){\n return Point(a * x, a * y);\n }\n Point operator / (double a){\n return Point(x / a, y / a);\n }\n\n double norm(){\n return x * x + y * y;\n }\n double abs(){\n return sqrt(norm());\n }\n\n bool operator < (const Point &p) const {\n return (x != p.x ? x < p.x : y < p.y);\n }\n\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Segment{\n Point p1, p2;\n Segment(Point p1, Point p2): p1(p1), p2(p2) {}\n};\n\ntypedef Segment Line;\n\ndouble dot(Vector a, Vector b){\n return a.x * b.x + a.y * b.y;\n}\n\ndouble cross(Vector a, Vector b){\n return a.x * b.y - a.y * b.x;\n}\n\ndouble norm(Vector a){\n return a.x * a.x + a.y * a.y;\n}\n\ndouble abs(Vector a){\n return sqrt(norm(a));\n}\n\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(a.norm() < b.norm()) return -2;\n return 0;\n}\n\nbool intersect(Point p1, Point p2, Point p3, Point p4){\n return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);\n}\n\nbool intersect(Segment s1, Segment s2){\n return intersect(s1.p1, s1.p2, s2.p1, s2.p2);\n}\n\nint contains(Polygon g, Point p){\n int n = g.size();\n bool x = false;\n for(int i=0; i<n; i++){\n Point a = g[i] - p;\n Point b = g[(i+1)%n] - p;\n if(abs(cross(a, b)) < EPS && 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\n return (x ? 2 : 0);\n}\n\nint main(){\n while(1){\n int n; cin>>n;\n if(n == 0) return 0;\n while(n--){\n int m; cin>>m;\n vector<Polygon> square(m);\n for(int i=0; i<m; i++){\n for(int j=0; j<4; j++){\n double a, b; cin>>a>>b;\n square[i].emplace_back(a, b);\n }\n }\n\n UnionFind uf(m);\n for(int i=0; i<m; i++){\n for(int j=0; j<m; j++){\n if(i == j) continue;\n\n for(int k=0; k<4; k++){\n for(int l=0; l<4; l++){\n Segment s1 = {square[i][k], square[i][(k+1)%4]};\n Segment s2 = {square[j][l], square[j][(l+1)%4]};\n\n if(intersect(s1, s2)){\n if(!uf.same(i, j)){\n uf.unite(i, j);\n }\n }\n }\n }\n\n if(!uf.same(i, j)){\n int contain = 1;\n for(int k=0; k<4; k++){\n contain *= contains(square[i], square[j][k]);\n }\n\n if(contain != 0){\n uf.unite(i, j);\n }\n\n contain = 1;\n for(int k=0; k<4; k++){\n contain *= contains(square[j], square[i][k]);\n }\n \n if(contain != 0){\n if(!uf.same(i, j)){\n uf.unite(i, j);\n }\n }\n }\n }\n }\n\n set<int> st;\n for(int i=0; i<m; i++){\n st.emplace(uf.find(i));\n }\n\n cout << st.size() << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3076,
"score_of_the_acc": -0.961,
"final_rank": 10
},
{
"submission_id": "aoj_0214_3692959",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nconst int MAX_N = 110;\n\nint par[MAX_N];\nint ranks[MAX_N];\nint ufSize;\n\nvoid init(int n){\n ufSize = n;\n for(int i=0; i<n; i++){\n par[i] = i;\n ranks[i] = 0;\n }\n}\n\nint find(int x){\n if(par[x] == x) return x;\n else return par[x] = find(par[x]);\n}\n\nbool same(int x, int y){\n return find(x) == find(y);\n}\n\nvoid unite(int x, int y){\n x = find(x);\n y = find(y);\n if(x == y) return ;\n ufSize--;\n\n if(ranks[x] < ranks[y]) par[x] = y;\n else par[y] = x;\n\n if(ranks[x] == ranks[y]){\n ranks[x]++;\n }\n}\n\nstruct Point{\n double x, y;\n Point(double x = 0, double y = 0): x(x), y(y) {}\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 a){\n return Point(a * x, a * y);\n }\n Point operator / (double a){\n return Point(x / a, y / a);\n }\n\n double norm(){\n return x * x + y * y;\n }\n double abs(){\n return sqrt(norm());\n }\n\n bool operator < (const Point &p) const {\n return (x != p.x ? x < p.x : y < p.y);\n }\n\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Segment{\n Point p1, p2;\n Segment(Point p1, Point p2): p1(p1), p2(p2) {}\n};\n\ntypedef Segment Line;\n\ndouble dot(Vector a, Vector b){\n return a.x * b.x + a.y * b.y;\n}\n\ndouble cross(Vector a, Vector b){\n return a.x * b.y - a.y * b.x;\n}\n\ndouble norm(Vector a){\n return a.x * a.x + a.y * a.y;\n}\n\ndouble abs(Vector a){\n return sqrt(norm(a));\n}\n\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(a.norm() < b.norm()) return -2;\n return 0;\n}\n\nbool intersect(Point p1, Point p2, Point p3, Point p4){\n return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);\n}\n\nbool intersect(Segment s1, Segment s2){\n return intersect(s1.p1, s1.p2, s2.p1, s2.p2);\n}\n\ndouble getDistanceLP(Line l, Point p){\n return abs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));\n}\n\ndouble getDistanceSP(Segment s, Point p){\n if(dot(s.p2 - s.p1, p - s.p1) < -EPS) return abs(p - s.p1);\n if(dot(s.p1 - s.p2, p - s.p2) < -EPS) return abs(p - s.p2);\n return getDistanceLP(s, p);\n}\n\ndouble getDistance(Segment s1, Segment s2){\n if(intersect(s1, s2)) return 0;\n return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2), getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});\n}\n\nint contains(Polygon g, Point p){\n int n = g.size();\n bool x = false;\n for(int i=0; i<n; i++){\n Point a = g[i] - p;\n Point b = g[(i+1)%n] - p;\n if(abs(cross(a, b)) < EPS && 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\n return (x ? 2 : 0);\n}\n\nint main(){\n while(1){\n int n; cin>>n;\n if(n == 0) return 0;\n while(n--){\n int m; cin>>m;\n vector<double> x1(m), x2(m), x3(m), x4(m), y1(m), y2(m), y3(m), y4(m);\n for(int i=0; i<m; i++){\n cin>>x1[i]>>y1[i]>>x2[i]>>y2[i]>>x3[i]>>y3[i]>>x4[i]>>y4[i];\n }\n\n init(m);\n for(int i=0; i<m; i++){\n for(int j=0; j<m; j++){\n if(i == j) continue;\n\n Segment s1 = {Point(x1[i], y1[i]), Point(x2[i], y2[i])};\n Segment s2 = {Point(x2[i], y2[i]), Point(x3[i], y3[i])};\n Segment s3 = {Point(x3[i], y3[i]), Point(x4[i], y4[i])};\n Segment s4 = {Point(x4[i], y4[i]), Point(x1[i], y1[i])};\n\n vector<Segment> S1;\n S1.emplace_back(s1);\n S1.emplace_back(s2);\n S1.emplace_back(s3);\n S1.emplace_back(s4);\n\n Segment s5 = {Point(x1[j], y1[j]), Point(x2[j], y2[j])};\n Segment s6 = {Point(x2[j], y2[j]), Point(x3[j], y3[j])};\n Segment s7 = {Point(x3[j], y3[j]), Point(x4[j], y4[j])};\n Segment s8 = {Point(x4[j], y4[j]), Point(x1[j], y1[j])};\n \n vector<Segment> S2;\n S2.emplace_back(s5);\n S2.emplace_back(s6);\n S2.emplace_back(s7);\n S2.emplace_back(s8);\n\n for(int k=0; k<4; k++){\n for(int l=0; l<4; l++){\n if(equals(getDistance(S1[k], S2[l]), 0)){\n if(!same(i, j)){\n unite(i, j);\n }\n }\n }\n }\n\n if(!same(i, j)){\n Polygon po1;\n po1.emplace_back(Point(x1[i], y1[i]));\n po1.emplace_back(Point(x2[i], y2[i]));\n po1.emplace_back(Point(x3[i], y3[i]));\n po1.emplace_back(Point(x4[i], y4[i]));\n int contain = 1;\n contain *= contains(po1, Point(x1[j], y1[j]));\n contain *= contains(po1, Point(x2[j], y2[j]));\n contain *= contains(po1, Point(x3[j], y3[j]));\n contain *= contains(po1, Point(x4[j], y4[j]));\n \n if(contain != 0){\n unite(i, j);\n }\n\n Polygon po2;\n po2.emplace_back(Point(x1[j], y1[j]));\n po2.emplace_back(Point(x2[j], y2[j]));\n po2.emplace_back(Point(x3[j], y3[j]));\n po2.emplace_back(Point(x4[j], y4[j]));\n contain = 1;\n contain *= contains(po2, Point(x1[i], y1[i]));\n contain *= contains(po2, Point(x2[i], y2[i]));\n contain *= contains(po2, Point(x3[i], y3[i]));\n contain *= contains(po2, Point(x4[i], y4[i]));\n \n\n if(contain != 0){\n if(!same(i, j)){\n unite(i, j);\n }\n }\n }\n }\n }\n\n cout << ufSize << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3200,
"score_of_the_acc": -1.2527,
"final_rank": 17
},
{
"submission_id": "aoj_0214_3692920",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<ll,ll> mp;\n#define inf 1e9\n#define EPS 1e-10\n\nstruct point{\n\tdouble x,y;\n\tpoint(){}\n\tpoint(double x,double y) :x(x),y(y){}\n\n\tpoint operator - (point p) {return point(x-p.x,y-p.y); }\n\tvoid make() { cin>>x>>y;}\n\tdouble norm() { return x*x+y*y; }\n};\n\ndouble dot(point a,point b){return a.x*b.x + a.y*b.y; }\ndouble cross(point a,point b){ return a.x*b.y - a.y*b.x ;}\n\ntypedef vector<point> polygon;\nint contain(polygon g,point p){\n\tint n = g.size();\n\tbool f = 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( fabs(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) f = !f;\n\t}\n\treturn (f?2:0);\n// iN 2 ON 1OUT 0\n}\nstatic const int CCW_COUNTER_CLOCKWISE = 1;\nstatic const int CCW_CLOCKWISE = -1;\nstatic const int CCW_ONLINE_BACK = 2;\nstatic const int CCW_ONLINE_FRONT = -2;\nstatic const int CCW_ON_SEGMENT = 0;\nint ccw(point p0,point p1,point p2){\n\tpoint a = p1-p0,b = p2-p0;\n\tif(cross(a,b) > EPS) return 1;\n\tif(cross(a,b) < -EPS) return -1;\n\tif(dot(a,b) < -EPS ) return 2;\n\tif(a.norm() < b.norm() ) return -2;\n\treturn 0;\n}\nbool intersect(point a,point b,point c,point d){\n\treturn ( ccw(a,b,c)*ccw(a,b,d) <= 0 && ccw(c,d,a)*ccw(c,d,b) <= 0 );\n}\nstruct disjointset{\n\tvector<int> rank,p;\n\tdisjointset(){}\n\tdisjointset(int size){\n\t\trank.resize(size,0);\n\t\tp.resize(size,0);\n\t\tfor(int i=0;i<size;i++)makeSet(i);\n\t}\n\tvoid makeSet(int x){\n\t\tp[x] = x;\n\t\trank[x] = 0;\n\t}\n\tbool same(int x,int y){\n\t\treturn findSet(x) == findSet(y);\n\t}\n\tvoid unite(int x,int y){\n\t\tlink(findSet(x),findSet(y) );\n\t}\n\tvoid link(int x,int y){\n\t\tif(rank[x] > rank[y]){\n\t\t\tp[y] = x;\n\t\t}else{\t\n\t\t\tp[x] = y;\n\t\t\tif(rank[x] == rank[y] ) rank[y]++;\n\t\t}\n\t}\n\tint findSet(int x){\n\t\tif(x!=p[x]) p[x] = findSet(p[x]);\n\t\treturn p[x];\n\t}\n\n};\n\nint main(){\n\twhile(1){\n\t\tint n;\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tfor(int k=0;k<n;k++){\n\t\t \tint m;\n\t\t\tcin>>m;\n\t\t\tvector<polygon> g(m,vector<point>(4,point(0,0)) );\n\t\t\tfor(int i=0;i<m;i++)for(int j=0;j<4;j++) g[i][j].make();\n\t\t/*\tfor(int i=0;i<m;i++){\n\t\t\t\tfor(int j=0;j<4;j++){\n\t\t\t\t\tcout<<g[i][j].x<<' '<<g[i][j].y;\n\t\t\t\t}\n\t\t\t\tcout<<endl;\n\t\t\t}*/\n\t\t\tdisjointset ds = disjointset(m);\n\t\t\tfor(int i=0;i<m;i++){\n\t\t\t \tpolygon p = g[i];\n\t\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\t \tbool flag = false;\n\t\t\t\t\tfor(int k=0;k<4;k++){\n\t\t\t\t\t\tif( contain(g[j],p[k])!=0 ){\n\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t//cout<<\"ok\"<<endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor(int k =0 ;k<4;k++){\n\t\t\t\t\t\tfor(int l = 0;l<4;l++){\n\t\t\t\t\t\t\tif(intersect(p[k],p[(k+1)%4],g[j][l],g[j][(l+1)%4] ) ){\n\t\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\t\tbreak;\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(flag){\n\t\t\t\t\t ds.unite(i,j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tfor(int i=0;i<m;i++) if(ds.p[i] == i) res++;\n\t\t\tcout<<res<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3244,
"score_of_the_acc": -0.9666,
"final_rank": 11
},
{
"submission_id": "aoj_0214_3692895",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <complex>\nusing namespace std;\n\nusing D = double;\nusing P = complex<D>;\nusing L = pair<P,P>;\nusing Poly = vector<P>;\n\n#define X real()\n#define Y imag()\n\nconst D EPS = 1e-8;\n\nD dot(const P a, const P b){ return a.X*b.X + a.Y*b.Y; }\nD cross(const P a, const 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) < 0) return 2;\n if(norm(b) < norm(c) - EPS) 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,bf)*ccw(af,as,bs) <= 0 and ccw(bf,bs,af)*ccw(bf,bs,as) <= 0);\n}\n\nint in_poly(P a, const Poly &p){\n int n = p.size(), c = 0;\n for(int i = 0; i < n; ++i){\n P s = p[i] - a, t = p[(i+1)%n] - a;\n if(not ccw(s,t,P(0,0))) return 1;\n if(s.Y > t.Y + EPS) swap(s,t);\n if((s.Y*t.Y < 0 or (s.Y*t.Y < EPS and t.Y > EPS)) and cross(s,t) < EPS) ++c;\n }\n if(c%2) return 2;\n return 0;\n}\n\nstruct UnionFind{\nprivate:\n vector<int> data;\npublic:\n int N;\n UnionFind(int n) : data(n,-1), N(n) {}\n bool unite(int x, int y){\n x = find(x);\n y = find(y);\n if(x == y) return false;\n --N;\n if(data[y] < data[x]) swap(x,y);\n data[x] += data[y];\n data[y] = x;\n return x != y;\n }\n int find(int x){\n if(data[x] < 0) return x;\n return (data[x] = find(data[x]));\n }\n};\n\nbool connected(const Poly &A, const Poly &B){\n int n = A.size(), m = B.size();\n for(auto p : A){\n if(in_poly(p,B)) return true;\n }\n for(auto p : B){\n if(in_poly(p,A)) return true;\n }\n for(size_t i = 0; i < A.size(); ++i){\n L a(A[i],A[(i+1)%n]);\n for(size_t j = 0; j < B.size(); ++j){\n L b(B[j],B[(j+1)%m]);\n if(is_cross(a,b)) return true;\n }\n }\n return false;\n}\n\n\nint main(){\n int N;\n while(cin >> N, N){\n for(int i = 0; i < N; ++i){\n vector<Poly> V;\n int M;\n cin >> M;\n UnionFind uf(M);\n for(int j = 0; j < M; ++j){\n Poly pol;\n for(int k = 0; k < 4; ++k){\n D x, y;\n cin >> x >> y;\n pol.emplace_back(x,y);\n }\n V.push_back(pol);\n }\n for(int j = 0; j < M; ++j){\n for(int k = 0; k < j; ++k){\n if(connected(V[j],V[k]))\n uf.unite(k,j);\n }\n }\n cout << uf.N << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3228,
"score_of_the_acc": -0.9587,
"final_rank": 9
},
{
"submission_id": "aoj_0214_3692887",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ld = long double;\nusing point = std::complex<ld>;\nusing polygon = std::vector<point>;\n\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = std::acos(-1.0);\n\nbool comp(point a, point b) {\n return std::real(a) < std::real(b) || (std::real(a) <= std::real(b) && std::imag(a) < std::imag(b));\n}\n\nstd::vector<point> unique(std::vector<point> ps) {\n std::sort(std::begin(ps), std::end(ps), comp);\n std::vector<point> res;\n for(auto& p : ps) {\n if(res.empty() || abs(res.back() - p) > eps) {\n res.push_back(p);\n }\n }\n return res;\n}\n\nld dot(point const& a, point const& b) {\n return std::real(std::conj(a) * b);\n}\nld cross(point const& a, point const& b) {\n return std::imag(std::conj(a) * b);\n}\n\nint ccw(point a, point b, point c) {\n b -= a; c -= a;\n if(cross(b, c) > eps) return 1; // a -> b -> c : counterclockwise\n if(cross(b, c) < -eps) return -1; // a -> b -> c : clockwise\n if(dot(b, c) < 0) return 2; // c -> a -> b : line\n if(std::norm(b) < std::norm(c)) return -2; // a -> b -> c : line\n return 0; // a -> c -> b : line\n}\n\nstruct segment {\n segment() : a(0, 0), b(0, 0) {}\n segment(point a, point b) : a(a), b(b) {}\n point a, b;\n};\n\nstruct line {\n line() : a(0, 0), b(0, 0) {}\n line(point a, point b) : a(a), b(b) {}\n line(segment s) : a(s.a), b(s.b) {}\n point a, b;\n};\n\nstruct circle {\n circle() : p(point(0, 0)), r(0) {}\n circle(point p_, long double r_) : p(p_), r(r_) {}\n point p;\n long double r;\n};\n\nbool isis_ll(line l, line m) {\n return cross(l.b - l.a, m.b - m.a) != 0;\n}\n\nbool isis_ls(line l, segment s) {\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) <= 0;\n}\n\nbool isis_lp(line l, point p) {\n return (std::abs(cross(l.b - p, l.a - p)) < eps);\n}\n\nbool isis_sp(segment s, point p) {\n return (std::abs(s.a - p) + std::abs(s.b - p) - std::abs(s.b - s.a) < eps);\n}\n\nbool isis_ss(segment s, 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\npoint is_ll(line s, line t) {\n point sv = s.b - s.a, tv = t.b - t.a;\n assert(cross(sv, tv) != 0);\n return s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n\npoint is_ss(segment s1, segment s2) {\n assert(isis_ss(s1, s2));\n point sv = s1.b - s1.a, tv = s2.b - s2.a;\n if(cross(sv, tv) == 0) {\n if(std::abs(s1.a - s2.a) < eps || std::abs(s1.a - s2.b) < eps) {\n return s1.a;\n } else {\n return s1.b;\n }\n } else {\n return is_ll(line(s1), line(s2));\n }\n}\n\npoint proj(line l, point p) {\n long double t = dot(p - l.a, l.a - l.b) / std::norm(l.a - l.b);\n return l.a + t * (l.a - l.b);\n}\n\nclass union_find {\npublic:\n union_find(int n) : par(n, -1) {}\n\n int root(int x) {\n return par[x] < 0 ? x : par[x] = root(par[x]);\n }\n\n bool unite(int x, int y) {\n x = root(x); y = root(y);\n if(x == y) return false;\n if(par[x] < par[y]) swap(x, y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n\nprivate:\n vector<int> par;\n};\n\n// 0 -> on, 1 -> in, 2 -> out\nint is_in_polygon(polygon const& poly, point p) {\n const 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 if(isis_sp(segment(p1, p2), p)) {\n return 0;\n }\n sum += arg((p2 - p) / (p1 - p));\n }\n return std::abs(sum) < pi / 2 ? 2 : 1; // @todo: should check < 0.5 ?\n}\n\nbool isis_pp(polygon const& p1, polygon const& p2) {\n const int n = p1.size(), m = p2.size();\n for(int i = 0; i < n; ++i) {\n if(is_in_polygon(p2, p1[i]) != 2) return true;\n }\n for(int i = 0; i < m; ++i) {\n if(is_in_polygon(p1, p2[i]) != 2) return true;\n }\n for(int i = 0; i < n; ++i) {\n segment s1(p1[i], p1[(i + 1) % n]);\n for(int j = 0; j < m; ++j) {\n segment s2(p2[j], p2[(j + 1) % m]);\n if(isis_ss(s1, s2)) return true;\n }\n }\n return false;\n}\n\nint main() {\n int n;\n while(cin >> n, n) {\n for(int _ = 0; _ < n; ++_) {\n int m; cin >> m;\n int ans = m;\n vector<polygon> ps(m);\n union_find uf(m);\n for(int i = 0; i < m; ++i) {\n for(int j = 0; j < 4; ++j) {\n int x, y; cin >> x >> y;\n ps[i].emplace_back(x, y);\n }\n }\n for(int i = 0; i < m; ++i) {\n for(int j = i + 1; j < m; ++j) {\n if(isis_pp(ps[i], ps[j])) {\n ans -= uf.unite(i, j);\n }\n }\n }\n cout << ans << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3132,
"score_of_the_acc": -1.9116,
"final_rank": 20
},
{
"submission_id": "aoj_0214_3254860",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<map>\n#include<set>\n#include<algorithm>\n#include<functional>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cassert>\n#include<ctime>\n#include<utility>\nusing namespace std;\n\n#define mind(a,b) (a>b?b:a)\n#define maxd(a,b) (a>b?a:b)\n#define absd(x) (x<0?-(x):x)\n#define pow2(x) ((x)*(x))\n#define rep(i,n) for(int i=0; i<n; ++i)\n#define repr(i,n) for(int i=n-1; i>=0; --i)\n#define repl(i,s,n) for(int i=s; i<=n; ++i)\n#define replr(i,s,n) for(int i=n; i>=s; --i)\n#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)\n#define repe(e,obj) for(auto e : obj)\n\n#define SP << \" \" <<\n#define COL << \" : \" <<\n#define COM << \", \" <<\n#define ARR << \" -> \" <<\n#define PNT(STR) cout << STR << endl\n#define POS(X,Y) \"(\" << X << \", \" << Y << \")\"\n#define DEB(A) \" (\" << #A << \") \" << A\n#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << \" \"; cout << endl\n#define ALL(V) (V).begin(), (V).end()\n#define INF 1000000007\n#define INFLL 1000000000000000007LL\n#define EPS 1e-9\n\ntypedef unsigned int uint;\ntypedef unsigned long ulong;\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef long double ld;\n#define P_TYPE int\ntypedef pair<P_TYPE, P_TYPE> P;\ntypedef pair<P, P_TYPE> PI;\ntypedef pair<P_TYPE, P> IP;\ntypedef pair<P, P> PP;\ntypedef priority_queue<P, vector<P>, greater<P> > pvqueue;\n\ntypedef int PType;\nstruct Point {\n PType x, y;\n};\n\nPType dot3(Point o, Point a, Point b) {\n return (a.x - o.x) * (b.x - o.x) + (a.y - o.y) * (b.y - o.y);\n}\nPType cross3(Point o, Point a, Point b) {\n return (a.x - o.x) * (b.y - o.y) - (b.x - o.x) * (a.y - o.y);\n}\nPType dist2(Point a, Point b) {\n return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);\n}\n\nbool intersect(Point p0, Point p1, Point q0, Point q1) {\n PType c0 = cross3(p0, p1, q0), c1 = cross3(p0, p1, q1);\n PType d0 = cross3(q0, q1, p0), d1 = cross3(q0, q1, p1);\n if(c0 == 0 && c1 == 0) {\n PType e0 = dot3(p0, p1, q0);\n PType e1 = dot3(p0, p1, q1);\n if( !(e0 < e1) ) {\n swap(e0, e1);\n }\n return e0 <= dist2(p0, p1) && 0 <= e1;\n }\n return c0 * c1 <= 0 && d0 * d1 <= 0;\n}\n\nbool contains(vector<Point> ps, vector<Point> qs) {\n PType p[4];\n for(int i = 0; i < 4; ++i) {\n bool pos = true, neg = true;\n for(int j = 0; j < 4; ++j) {\n PType r = cross3(ps[j], ps[(j+1)%ps.size()], qs[i]);\n if(r < 0) pos = false;\n if(r > 0) neg = false;\n }\n if(pos || neg) {\n return true;\n }\n }\n return false;\n}\n\nbool check(vector<Point> ps, vector<Point> qs) {\n if(contains(ps, qs) || contains(qs, ps)) {\n return true;\n }\n for(int i = 0; i < 4; ++i) {\n for(int j = 0; j < 4; ++j) {\n if(intersect(ps[i], ps[(i+1)%ps.size()], qs[j], qs[(j+1)%qs.size()])) {\n return true;\n }\n }\n }\n return false;\n}\n\n#define M 103\nint parent[M];\nint root(int x) {\n if(x == parent[x]) return x;\n return parent[x] = root(parent[x]);\n}\nvoid unite(int x, int y) {\n int px = root(x), py = root(y);\n if(px < py) {\n parent[py] = px;\n } else {\n parent[px] = py;\n }\n}\n\nint main() {\n int n;\n while(cin >> n && n) {\n rep(i, n) {\n int m; cin >> m;\n rep(j, m) parent[j] = j;\n vector<vector<Point>> ps;\n rep(j, m) {\n vector<Point> p;\n rep(k, 4) {\n int x, y; cin >> x >> y;\n p.push_back(Point{x, y});\n }\n ps.push_back(p);\n }\n rep(i, m) {\n repl(j, i+1, m-1) {\n if(check(ps[i], ps[j])) {\n unite(i, j);\n }\n }\n }\n int res = 0;\n rep(i, m) {\n if(i == root(i)) ++res;\n }\n cout << res << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3088,
"score_of_the_acc": -0.89,
"final_rank": 4
},
{
"submission_id": "aoj_0214_3015280",
"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;\n\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\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\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\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\nvoid dfs(int v, vector<bool> &used, vector<vector<int> > &adj){\n if(used[v]) return;\n used[v] = true;\n for(int nv: adj[v]){\n dfs(nv, used, adj);\n }\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n==0) break;\n \n for(int rep=0; rep<n; rep++){\n int m;\n cin >> m;\n vector<VP> sq(m, VP(4));\n for(int i=0; i<m; i++){\n for(int j=0; j<4; j++){\n int x,y;\n cin >> x >> y;\n sq[i][j] = P(x, y);\n }\n swap(sq[i][0], sq[i][3]);\n swap(sq[i][1], sq[i][2]);\n }\n \n vector<vector<int> > adj(m);\n for(int i=0; i<m; i++){\n for(int j=i+1; j<m; j++){\n bool overlap = false;\n for(int k=0; k<4; k++){\n if(in_poly(sq[i][k], sq[j]) >= 0 || in_poly(sq[j][k], sq[i]) >= 0){\n overlap = true;\n }\n for(int l=0; l<4; l++){\n if(intersectSS(L(sq[i][k], sq[i][(k+1)%4]), L(sq[j][l], sq[j][(l+1)%4]))){\n overlap = true;\n }\n }\n }\n if(overlap){\n adj[i].push_back(j);\n adj[j].push_back(i);\n }\n }\n }\n \n vector<bool> used(m, false);\n int count = 0;\n for(int i=0; i<m; i++){\n if(used[i]) continue;\n dfs(i, used, adj);\n count++;\n }\n cout << count << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3152,
"score_of_the_acc": -0.9214,
"final_rank": 6
},
{
"submission_id": "aoj_0214_2734305",
"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\nclass Point{\npublic:\n\tdouble x,y;\n\n\tPoint(double x = 0,double y = 0):x(x),y(y){}\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\t\treturn x != p.x? x < p.x: y < p.y;\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\nclass Line{\npublic:\n\tPoint p[2];\n\tLine(Point p1,Point p2){\n\t\tp[0] = p1;\n\t\tp[1] = p2;\n\t}\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nint num_sets,num_point,Q;\nint N;\nint boss[100],height[100];\nPolygon info[100];\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint is_same(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[x] > height[y]){\n\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[x] < height[y]){\n\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[x] == height[y]\n\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\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\treturn a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n\treturn a.x*b.x + a.y*b.y;\n}\n\nPoint calc_minus(Point a,Point b){\n\tPoint ret;\n\n\tret.x = a.x-b.x;\n\tret.y = a.y-b.y;\n\n\treturn ret;\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\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 * 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\nbool intersect(const Polygon g1,const Polygon g2){\n\n\tint size_1 = g1.size(),size_2 = g2.size();\n\n\tfor(int i = 0; i < size_1; i++){\n\t\tfor(int k = 0; k < size_2; k++){\n\t\t\tif(is_Cross(Line(g1[i],g1[(i+1)%size_1]),Line(g2[k],g2[(k+1)%size_2]))){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < size_1; i++){\n\t\tif(contains(g2,g1[i]))return true;\n\t}\n\n\tfor(int i = 0; i < size_2; i++){\n\t\tif(contains(g1,g2[i]))return true;\n\t}\n\n\treturn false;\n}\n\nvoid func(){\n\n\tscanf(\"%d\",&N);\n\tfor(int i = 0; i < N; i++){\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t}\n\n\tfor(int i = 0; i < N; i++)info[i].clear();\n\n\tdouble x,y;\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 4; k++){\n\t\t\tscanf(\"%lf %lf\",&x,&y);\n\t\t\tinfo[i].push_back(Point(x,y));\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(i == k)continue;\n\n\t\t\tif(intersect(info[i],info[k])){\n\t\t\t\tunite(i,k);\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tif(get_boss(i) == i)ans++;\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&num_sets);\n\t\tif(num_sets == 0)break;\n\n\t\tfor(int i = 0; i < num_sets; i++)func();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3212,
"score_of_the_acc": -1.1817,
"final_rank": 16
},
{
"submission_id": "aoj_0214_2415788",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < (int)n; i++ )\n#define EPS (1e-8)\nclass Point {\npublic:\n\tdouble x, y;\n\n\tPoint(double x = 0, double y = 0) :\n\t\t\tx(x), y(y) {\n\t}\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 a) {\n\t\treturn Point(x * a, y * a);\n\t}\n};\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\ndouble norm(Vector a) {\n\treturn a.x * a.x + a.y * a.y;\n}\ndouble dot(Vector a, Vector b) {\n\treturn a.x * b.x + a.y * b.y;\n}\ndouble cross(Vector a, Vector b) {\n\treturn a.x * b.y - a.y * b.x;\n}\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;\nint ccw(Point p0, Point p1, Point p2) {\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\tif (cross(a, b) > EPS)\n\t\treturn COUNTER_CLOCKWISE;\n\tif (cross(a, b) < -EPS)\n\t\treturn CLOCKWISE;\n\tif (dot(a, b) < -EPS)\n\t\treturn ONLINE_BACK;\n\tif (norm(a) < norm(b))\n\t\treturn ONLINE_FRONT;\n\treturn ON_SEGMENT;\n}\nbool isIntersect(Point p1, Point p2, Point p3, Point p4) {\n\treturn (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0\n\t\t\t&& ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);\n}\nbool isInside(Polygon pol, Point p) {\n\trep(i, 4)\n\t{\n\t\tif (ccw(pol[i], pol[(i + 1) % 4], p) == COUNTER_CLOCKWISE)\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nbool isIntersectSQ(Polygon p1, Polygon p2) {\n\trep(i, 3)\n\t\trep(j, 3)\n\t\t{\n\t\t\tif (isIntersect(p1[i], p1[i + 1], p2[j], p2[j + 1]))\n\t\t\t\treturn true;\n\t\t}\n\trep(i, 4)\n\t\tif (isInside(p1, p2[i]))\n\t\t\treturn true;\n\trep(i, 4)\n\t\tif (isInside(p2, p1[i]))\n\t\t\treturn true;\n\treturn false;\n}\nPolygon P[100];\nint n, G[100][100];\nbool V[100];\n//??????????????????????????????????????°???????????????????????????\n//?????????V????????¨?????§?????????????´???\\???????????°?????????????????°??????used true?????????\n//???????????£??????????????¨????????????V????????????????????????????????????????????????\n//G????????????????????????????????????????????????from to???????????????????????????V????????????\n//??????G???????????§??§????????£????????????????????????V??????????????????????????§????????£??????????????£?????????\n//?????°??????true??????????????????????????±??????true?????????????????????????????????\n//\n\nvoid dfs(int u) {\n\tV[u] = true;\n\trep(v, n)\n\t\tif (G[u][v] && !V[v])\n\t\t\tdfs(v);\n}\nint compute() {\n\trep(i, n)\n\t\trep(j, n )\n\t\t\tG[i][j] = 0;\n\trep(i, n)\n\t\trep(j, n )\n\t\t\tif (isIntersectSQ(P[i], P[j]))\n\t\t\t\tG[i][j] = 1;\n\trep(i, n)\n\t\tV[i] = false;\n\tint ncomponent = 0;\n\trep(i, n)\n\t{\n\t\tif (V[i])\n\t\t\tcontinue;\n\t\tncomponent++;\n\t\tdfs(i);\n\t}\n\treturn ncomponent;\n}\nint main() {\n\tint N;\n\tdouble x, y;\n\twhile (cin >> N && N) {\n\t\trep(i, N)\n\t\t{\n\t\t\tcin >> n;\n\t\t\trep(j, n)\n\t\t\t{\n\t\t\t\tPolygon pol;\n\t\t\t\trep(k, 4)\n\t\t\t\t{\n\t\t\t\t\tcin >> x >> y;\n\t\t\t\t\tpol.push_back(Point(x, y));\n\t\t\t\t}\n\t\t\t\tP[j] = pol;\n\t\t\t}\n\t\t\tcout << compute() << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3248,
"score_of_the_acc": -0.9686,
"final_rank": 12
},
{
"submission_id": "aoj_0214_2209413",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define rep(i,n) REP(i,0,n)\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\n#define pb push_back\n#define all(r) (r).begin(),(r).end()\n#define rall(r) (r).rbegin(),(r).rend()\n#define fi first\n#define se second\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n \nconst double EPS = 1e-8;\nconst double INF = 1e12;\nconst double PI = acos(-1);\ntypedef complex<double> P;\ntypedef complex<double> point;\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n}\ndouble cross(const P& a, const P& b) {\n\treturn imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n\treturn real(conj(a)*b);\n}\n\nstruct L : public vector<P> {\n\tL(const P &a, const P &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\n\ntypedef vector<P> G;\ntypedef vector<P> polygon;\n\nstruct C {\n\tP p; double r;\n\tC(const P &p, double r) : p(p), r(r) { }\n};\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}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSP(const L &s, const P &p) {\n\treturn abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\n\n\n//polygon??????????¨??????????????????????????????????\nenum { OUT, ON, IN };\nint contains(const G& pol, const P& p){\n\tif(pol.size() < 2) return OUT;\n\tif(intersectSP({pol[0], pol[1]}, p)) return ON;\n\tbool f = cross(pol[1]-pol[0], p - pol[0]) > 0;\n\tfor(int i = 1; i < pol.size(); i++) {\n\t\tauto& now = pol[i];\n\t\tauto& nxt = pol[(i+1) % pol.size()];\n\t\tif(intersectSP({nxt, now}, p)) return ON;\n\t\tif(f^(cross(nxt-now, p-now)>0)) return OUT;\n\t}\n\treturn IN;\n}\n//????????´???????£???????????????????(??????????????£???????????????)\nenum{NO_HIT=0, HIT, A_IN_B, B_IN_A};\nint HitPol_Pol(const polygon& a, const polygon& b){\n\tbool f = true, hit = false;\n\trep(i, a.size()){\n\t\tif(contains(b, a[i]) == OUT) f = false;\n\t\telse hit = true;\n\t}\n\tif(f) return A_IN_B;\n\tf = true;\n\trep(i, b.size()){\n\t\tif(contains(a, b[i]) == OUT) f = false;\n\t\telse hit = true;\n\t}\n\tif(f) return B_IN_A;\n\tif(hit) return HIT;\n\trep(i, a.size()) rep(j, b.size()){\n\t\tL la(curr(a, i), next(a, i)), lb(curr(b, j), next(b, j));\n\t\tif(intersectSS(la, lb)) return HIT;\n\t}\n\treturn NO_HIT;\n}\n\nstruct UFT{ //O(loga(n))\n int n;\n vi d, r;\n UFT(int n) : n(n), d(n, -1), r(n, 0){};\n int root(int i){\n if(d[i] < 0) return i;\n return d[i] = root(d[i]);\n }\n bool same(int x, int y){\n return root(x) == root(y);\n }\n bool unite(int x, int y){\n x = root(x);\n y = root(y);\n if(x == y) return false;\n \n if(r[x] < r[y]) swap(x, y);\n else if(r[x] == r[y]) r[x]++;\n d[x] += d[y];\n d[y] = x;\n return true;\n }\n int size(int i){\n return -d[root(i)];\n }\n};\n\nint main(){\n\tint N;\n\twhile(cin >> N && N) {\n \t\trep(_, N) {\n \t\t\tint m;\n \t\t\tcin >> m;\n \t\t\tUFT uf(m);\n \t\t\tvector<polygon> ps(m);\n \t\t\trep(i, m) {\n \t\t\t\tdouble x, y;\n \t\t\t\trep(j,4) {\n \t\t\t\t\tcin >> x>> y;\n \t\t\t\t\tps[i].pb({x, y});\n \t\t\t\t}\n \t\t\t}\n \t\t\trep(i, m) rep(j, i) {\n \t\t\t\tif(HitPol_Pol(ps[i], ps[j])) uf.unite(i, j);\n \t\t\t}\n \t\t\tint ans = 0;\n \t\t\trep(i, m) if(uf.root(i) == i) ans++;\n \t\t\tcout<<ans<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3156,
"score_of_the_acc": -1.4618,
"final_rank": 19
},
{
"submission_id": "aoj_0214_2178447",
"code_snippet": "#ifndef ___Geometry_Library\n#define ___Geometry_Library\n\n// ------ Includes ------ //\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <utility>\n#include <algorithm>\n\n// ------ Defines ------ //\ntypedef long double GType;\ntypedef std::complex<GType> Point;\ntypedef std::pair<Point, Point> Segment;\n\n// ------ Constants ------ //\nconst GType EPS = 1.0e-10L;\n\n// ------ Functions Level 1 ------ //\nGType dot(const Point& p1, const Point& p2) {\n\treturn (std::conj(p1) * p2).real();\n}\nGType cross(const Point& p1, const Point& p2) {\n\treturn (std::conj(p1) * p2).imag();\n}\nint ccw(const Point& p1, const Point& p2, const Point& p3) {\n\tPoint v1 = p2 - p1, v2 = p3 - p1;\n\tif (cross(v1, v2) > EPS) return +1;\n\tif (cross(v1, v2) < -EPS) return -1;\n\tif (dot(v1, v2) < -EPS) return +2;\n\tif (std::norm(v1) < std::norm(v2)) return -2;\n\treturn 0;\n}\n\n// ------ Functions Level 2 ------ //\nbool intersect(const Segment& s1, const Point& p1, bool segflag) {\n\tif (!segflag) return std::abs(cross(s1.second - p1, s1.first - p1)) < EPS;\n\treturn (std::abs(s1.first - p1) + std::abs(s1.second - p1) - std::abs(s1.second - s1.first)) < EPS;\n}\nbool intersect(const Segment& s1, const Segment& s2, bool segflag) {\n\tif (!segflag) return cross(s1.second - s1.first, s2.first - s1.first) * cross(s1.second - s1.first, s2.second - s1.first) < EPS;\n\treturn (ccw(s1.first, s1.second, s2.first) * ccw(s1.first, s1.second, s2.second) <= 0 && ccw(s2.first, s2.second, s1.first) * ccw(s2.first, s2.second, s1.second) <= 0);\n}\n\n// ------ Functions Level 3 ------ //\nint contain(std::vector<Point> v, Point p) {\n\tbool in = false;\n\tfor (int i = 0; i < v.size(); i++) {\n\t\tPoint a = v[i] - p, b = v[(i + 1 != v.size() ? i + 1 : 0)] - p;\n\t\tif (a.imag() > b.imag()) swap(a, b);\n\t\tif (a.imag() <= EPS && EPS < b.imag() && cross(a, b) < -EPS) in = !in;\n\t\tif (cross(a, b) == 0 && dot(a, b) <= 0) return 1;\n\t}\n\treturn in ? 2 : 0;\n}\n\n#endif\n\n#include <vector>\n#include <numeric>\n#include <algorithm>\n\nclass unionfind {\nprivate:\n\tint size_;\n\tstd::vector<int> parent;\n\tstd::vector<int> rank;\npublic:\n\tunionfind() : size_(0), parent(std::vector<int>()), rank(std::vector<int>()) {};\n\tunionfind(int size__) : size_(size__), parent(std::vector<int>(size_)), rank(std::vector<int>(size_, 0)) {\n\t\tstd::iota(parent.begin(), parent.end(), 0);\n\t}\n\tint size() { return size_; }\n\tint root(int x) {\n\t\tif (parent[x] == x) return x;\n\t\treturn parent[x] = root(parent[x]);\n\t}\n\tbool same(int x, int y) {\n\t\treturn root(x) == root(y);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = root(x); y = root(y);\n\t\tif (x == y) return;\n\t\tif (rank[x] < rank[y]) parent[x] = y;\n\t\telse if (rank[x] > rank[y]) parent[y] = x;\n\t\telse parent[y] = x, rank[x]++;\n\t}\n};\n\n#include <set>\n#include <iostream>\nusing namespace std;\nint Q, N, x, y; vector<Point> p[109];\nint main() {\n\twhile (cin >> Q, Q) {\n\t\twhile (Q--) {\n\t\t\tcin >> N;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tp[i] = vector<Point>(4);\n\t\t\t\tfor (int j = 0; j < 4; j++) {\n\t\t\t\t\tcin >> x >> y;\n\t\t\t\t\tp[i][j] = Point(x, y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tunionfind uf(N);\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\t\tbool flag = false;\n\t\t\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\t\t\tif (contain(p[i], p[j][k])) flag = true;\n\t\t\t\t\t}\n\t\t\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\t\t\tfor (int l = 0; l < 4; l++) {\n\t\t\t\t\t\t\tif (intersect(Segment(p[i][k], p[i][(k + 1) % 4]), Segment(p[j][l], p[j][(l + 1) % 4]), true)) flag = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (flag) uf.unite(i, j);\n\t\t\t\t}\n\t\t\t}\n\t\t\tset<int> ret;\n\t\t\tfor (int i = 0; i < N; i++) ret.insert(uf.root(i));\n\t\t\tcout << ret.size() << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3112,
"score_of_the_acc": -1.4402,
"final_rank": 18
},
{
"submission_id": "aoj_0214_2166157",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<cmath>\nusing namespace std;\nstruct Point { long double px, py; };\nPoint Minus(const Point& a, const Point& b) { return Point{ a.px - b.px,a.py - b.py }; }\nlong double norm(const Point& a) { return a.px * a.px + a.py * a.py; }\nlong double abs(const Point& a) { return sqrtl(norm(a)); }\nlong double arg(const Point& a) { return atan2l(a.py, a.px); }\nlong double dot(const Point& a, const Point& b) { return a.px * b.px + a.py * b.py; }\nlong double crs(const Point& a, const Point& b) { return a.px * b.py - a.py * b.px; }\nint ccw(const Point& p0, const Point& p1, const Point& p2) {\n\tPoint a = Minus(p1, p0), b = Minus(p2, p0);\n\tif (crs(a, b) > 1e-10) return 1;\n\tif (crs(a, b) < -1e-10) return -1;\n\tif (dot(a, b) < -1e-10) return 2;\n\tif (norm(a) < norm(b)) return -2;\n\treturn 0;\n}\nbool its(const Point& p1, const Point& p2, const Point& p3, const Point& p4) { return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0); }\nint contain(vector<Point> v, Point p) {\n\tbool in = false;\n\tfor (int i = 0; i < v.size(); ++i) {\n\t\tPoint a = Minus(v[i], p), b = Minus(v[(i + 1) % v.size()], p);\n\t\tif (a.py > b.py) swap(a, b);\n\t\tif (a.py <= 0 && 0 < b.py)\n\t\t\tif (crs(a, b) < 0) in = !in;\n\t\tif (crs(a, b) == 0 && dot(a, b) <= 0) return 1;\n\t}\n\treturn in ? 2 : 0;\n}\nbool connect(vector<Point>p1, vector<Point>p2) {\n\tfor (int i = 0; i < p1.size(); i++) {\n\t\tfor (int j = 0; j < p2.size(); j++) {\n\t\t\tif (its(p1[i], p1[(i + 1) % p1.size()], p2[j], p2[(j + 1) % p2.size()]) == true)return true;\n\t\t}\n\t}\n\tfor (int i = 0; i < p2.size(); i++) { if (contain(p1, p2[i]) != 0)return true; }\n\tfor (int i = 0; i < p1.size(); i++) { if (contain(p2, p1[i]) != 0)return true; }\n\treturn false;\n}\nvector<Point>r[200]; int n, t; vector<int>X[200]; bool unused[200];\nint main() {\n\twhile (true) {\n\t\tcin >> t; if (t == 0)break;\n\t\tfor (int h = 0; h < t; h++) {\n\t\t\tfor (int i = 0; i < 200; i++) { r[i].clear(); r[i].resize(4); X[i].clear(); unused[i] = false; }\n\t\t\tcin >> n; int cnt = 0;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tcin >> r[cnt][0].px >> r[cnt][0].py >> r[cnt][1].px >> r[cnt][1].py;\n\t\t\t\tcin >> r[cnt][2].px >> r[cnt][2].py >> r[cnt][3].px >> r[cnt][3].py; cnt++;\n\t\t\t}\n\t\t\tfor (int i = 0; i < cnt; i++) {\n\t\t\t\tfor (int j = i + 1; j < cnt; j++) {\n\t\t\t\t\tif (connect(r[i], r[j]) == true) { X[i].push_back(j); X[j].push_back(i); }\n\t\t\t\t}\n\t\t\t}\n\t\t\tqueue<int>Q; int ans = 0;\n\t\t\tfor (int i = 0; i < cnt; i++) {\n\t\t\t\tif (unused[i] == true)continue;\n\t\t\t\tQ.push(i); unused[i] = true; ans++;\n\t\t\t\twhile (!Q.empty()) {\n\t\t\t\t\tint a1 = Q.front(); Q.pop();\n\t\t\t\t\tfor (int j = 0; j < X[a1].size(); j++) {\n\t\t\t\t\t\tif (unused[X[a1][j]] == false) { unused[X[a1][j]] = true; Q.push(X[a1][j]); }\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3188,
"score_of_the_acc": -1.016,
"final_rank": 14
},
{
"submission_id": "aoj_0214_1798881",
"code_snippet": "/*include*/\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<vector>\n#include<cmath>\n#include<cstdio>\n#include<complex>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define rp(a) while(a--)\n#define pb push_back\n#define mp make_pair\n#define it ::iterator\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst double inf=1e8;\nusing namespace std;\ntypedef complex<double> P;\ntypedef vector<P> G;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\n\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n};\nstruct C{\n\tP c;double r;\n\tC(const P &c,double r):c(c),r(r){}\n};\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\n#define diff(P, i) (next(P, i) - curr(P, i))\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t\t//return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b); \n\t}\n\tbool operator == (const P& a, const P& b) {\n\t\treturn a.real()==b.real()&&a.imag()==b.imag();\n\t}\n}\nP pin(){\n\tdouble x,y;\n\tchar d;\n\tcin>>x>>y;\n\tP p(x,y);\n\treturn p;\n}\nvoid PIN(P* a,int n){\n\trep(i,n)a[i]=pin();\n}\ndouble dot(P a,P b){\n\treturn real(conj(a)*b);\n}\ndouble cross(P a,P b){\n\treturn imag(conj(a)*b);\n}\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0;\n}\nP projection(L a,P p){\n\tdouble t=dot(p-a[0],a[0]-a[1])/norm(a[0]-a[1]);\n\treturn a[0]+t*(a[0]-a[1]);\n}\nP reflection(L a,P p){\n\treturn p+2.0*(projection(a,p)-p);\n}\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\ndouble distanceLP(const L &l, const P &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const L &l, const L &m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const L &l, const L &s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const L &s, const P &p) {\n const P r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const L &s, const L &t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n min(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\n/*bool intersectCS(C c,const L &l){\n return (distanceLP(l,c.c) < c.r+EPS &&\n (c.r < abs(c.c-l[0]) + EPS || c.r < abs(c.c-l[1]) + EPS));\n}*/\nint intersectCS(C c,L &l){\n\tif(norm(projection(l,c.c)-c.c)-c.r*c.r>EPS)return 0;\n\tconst double d1=abs(c.c-l[0]),d2=abs(c.c-l[1]);\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 P h=projection(l,c.c);\n\tif(dot(l[0]-h,l[1]-h)<0)return 2;\n\treturn 0;\n}\nP crosspointSS(L a,L b){\n\tdouble t1=abs(cross(a[1]-a[0],b[0]-a[0]));\n\tdouble t2=abs(cross(a[1]-a[0],b[1]-a[0]));\n\treturn b[0]+(b[1]-b[0])*t1/(t1+t2);\n}\nL crosspointCL(C c,L l){\n\tP pr=projection(l,c.c);\n\tP e=(l[1]-l[0])/abs(l[1]-l[0]);\n\tdouble t=sqrt(c.r*c.r-norm(pr-c.c));\n\tP a=pr+t*e;\n\tP b=pr-t*e;\n\tif(b<a)swap(a,b);\n\treturn L(a,b);\n}\nL crosspointCS(C c,L l){\n\tif(intersectCS(c,l)==2)return crosspointCL(c,l);\n\tL ret=crosspointCL(c,l);\n\tif(dot(l[0]-ret[0],l[1]-ret[0])<0)ret[1]=ret[0];\n\telse ret[0]=ret[1];\n\treturn ret;\n}\nL crosspointCC(C a,C b){\n\tP tmp=b.c-a.c;\n\tdouble d=abs(tmp);\n\tdouble q=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\n\tdouble t=arg(tmp);//atan(tmp.imag()/tmp.real());\n\tP p1=a.c+polar(a.r,t+q);\n\tP p2=a.c+polar(a.r,t-q);\n\tif(p2<p1)swap(p1,p2);\n\treturn L(p1,p2);\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 if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\n return m[0] + B / A * (m[1] - m[0]);\n}\ndouble area(const G &g){\n double S =0;\n for(int i =0;i <g.size();i++){\n S +=(cross(g[i],g[(i+1)%g.size()]));\n }\n return abs(S/2.0);\n}\nbool isconvex(const G &g){\n\tint n=g.size();\n\trep(i,n)if(ccw(g[(i+n-1)%n],g[i%n],g[(i+1)%n])==-1)return false;\n\treturn true;\n}\nint inconvex(const G& g, const P& p) {\n\tbool in = false;\n\tint n=g.size();\n\trep(i,n){\n\t\tP a=g[i%n]-p;\n\t\tP b=g[(i+1)%n]-p;\n\t\tif(imag(a)>imag(b))swap(a, b);\n\t\tif(imag(a)<=0&&0<imag(b))if(cross(a,b)<0)in=!in;\n\t\tif(cross(a,b)==0&&dot(a,b)<=0)return 1;//ON\n\t}\n\treturn in?2:0;//IN : OUT;\n}\nG convex_hull(G &ps) {\n int n=ps.size(),k=0;\n\tsort(ps.begin(), ps.end());\n\tG 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])==-1)--k;//<=0 -> ==-1\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])==-1)--k;//\n\tch.resize(k-1);\n\treturn ch;\n}\ndouble convex_diameter(const G &pt) {\n const int n = pt.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(pt[i]) > imag(pt[is])) is = i;\n if (imag(pt[i]) < imag(pt[js])) js = i;\n }\n double maxd = norm(pt[is]-pt[js]);\n\n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\n else i = (i+1) % n;\n if (norm(pt[i]-pt[j]) > maxd) {\n maxd = norm(pt[i]-pt[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}//convex_diameter(g)\nG convex_cut(const G& g, const L& l) {\n G Q;\n for (int i = 0; i < g.size(); ++i) {\n P a= curr(g, i), b= next(g, i);\n if (ccw(l[0], l[1], a) != -1) Q.push_back(a);\n if (ccw(l[0], l[1], a)*ccw(l[0], l[1], b) < 0)\n Q.push_back(crosspointLL(L(a,b), l));\n }\n return Q;\n}\nP turn(P p,double t){\n\treturn p*exp(P(.0,t*PI/180.0));\n}\nvector<L> tangentCC(C a,C b){\n\tif(a.r<b.r)swap(a,b);\n\tdouble d=abs(a.c-b.c);\n\tvector<L>l;\n\tif(d<EPS)return l;\n\tif(a.r+b.r<d-EPS){//hanareteiru\n\t\tdouble t=acos((a.r+b.r)/d);\n\t\tt=t*180/PI;\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t),b.c+turn(b.r/d*(a.c-b.c),t)));\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t),b.c+turn(b.r/d*(a.c-b.c),-t)));\n\t}else if(a.r+b.r<d+EPS){//kuttuiteiru soto\n\t\tP p=a.c+a.r/d*(b.c-a.c);\n\t\tl.pb(L(p,p+turn(b.c-a.c,90)));\n\t}\n\tif(abs(a.r-b.r)<d-EPS){//majiwatteiru\n\t\tdouble t1=acos((a.r-b.r)/d);\n\t\tt1=t1*180/PI;\n\t\tdouble t2=180-t1;\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t1),b.c+turn(b.r/d*(a.c-b.c),-t2)));\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t1),b.c+turn(b.r/d*(a.c-b.c),t2)));\n\t}else if(abs(a.r-b.r)<d+EPS){//kuttuiteiru uti\n\t\tP p=a.c+a.r/d*(b.c-a.c);\n\t\tl.pb(L(p,p+turn(b.c-a.c,90)));\n\t}\n\treturn l;\n}\nvoid printL(const L &out){\n\tprintf(\"%.9f %.9f %.9f %.9f\\n\",out[0].real(),out[0].imag(),out[1].real(),out[1].imag());\n}\nC CIN(){\n\tP p=pin();\n\tdouble r;\n\tcin>>r;\n\treturn C(p,r);\n}\nbool para(L a,L b){\n\treturn (abs(cross(a[1]-a[0],b[1]-b[0]))<EPS);\n}\nstruct UnionFind{\n vector<int> data;\n UnionFind(int size) : data(size, -1) {}\n bool unionSet(int x,int y){\n x=root(x);y=root(y);\n if(x==y)return 0;\n if(data[y]<data[x])swap(x,y);\n data[x]+=data[y],data[y]=x;\n return 1;\n }\n bool findSet(int x,int y){\n return root(x)==root(y);\n }\n int root(int x){\n return data[x]<0 ? x : data[x]=root(data[x]);\n }\n int size(int x){\n return -data[root(x)];\n }\n\tint co(){\n\t\tint c=0;\n\t\trep(i,data.size())if(data[i]<0)c++;\n\t\treturn c;\n\t}\n};\nint main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\twhile(n--){\n\t\t\tint m;cin>>m;\n\t\t\tvector<G>g(m,G(4));\n\t\t\trep(i,m)rep(j,4)g[i][j]=pin();\n\t\t\tUnionFind uf(m);\n\t\t\trep(i,m)loop(j,i+1,m){\n\t\t\t\tbool h=true;\n\t\t\t\trep(k,4)rep(l,4)if(intersectSS(L(g[i][k],g[i][(k+1)%4]),L(g[j][l],g[j][(l+1)%4])))h=false;\n\t\t\t\tif(h){\n\t\t\t\t\tif(inconvex(g[i],g[j][0])||inconvex(g[j],g[i][0]))h=false;\n\t\t\t\t}\n\t\t\t\tif(!h)uf.unionSet(i,j);\n\t\t\t}\n\t\t\tcout<<uf.co()<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1276,
"score_of_the_acc": -0.3846,
"final_rank": 2
},
{
"submission_id": "aoj_0214_1798876",
"code_snippet": "/*include*/\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<vector>\n#include<cmath>\n#include<cstdio>\n#include<complex>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define rp(a) while(a--)\n#define pb push_back\n#define mp make_pair\n#define it ::iterator\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst double inf=1e8;\nusing namespace std;\ntypedef complex<double> P;\ntypedef vector<P> G;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\n\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n};\nstruct C{\n\tP c;double r;\n\tC(const P &c,double r):c(c),r(r){}\n};\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\n#define diff(P, i) (next(P, i) - curr(P, i))\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t\t//return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b); \n\t}\n\tbool operator == (const P& a, const P& b) {\n\t\treturn a.real()==b.real()&&a.imag()==b.imag();\n\t}\n}\nP pin(){\n\tdouble x,y;\n\tchar d;\n\tcin>>x>>y;\n\tP p(x,y);\n\treturn p;\n}\nvoid PIN(P* a,int n){\n\trep(i,n)a[i]=pin();\n}\ndouble dot(P a,P b){\n\treturn real(conj(a)*b);\n}\ndouble cross(P a,P b){\n\treturn imag(conj(a)*b);\n}\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0;\n}\nP projection(L a,P p){\n\tdouble t=dot(p-a[0],a[0]-a[1])/norm(a[0]-a[1]);\n\treturn a[0]+t*(a[0]-a[1]);\n}\nP reflection(L a,P p){\n\treturn p+2.0*(projection(a,p)-p);\n}\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\ndouble distanceLP(const L &l, const P &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const L &l, const L &m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const L &l, const L &s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const L &s, const P &p) {\n const P r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const L &s, const L &t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n min(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\n/*bool intersectCS(C c,const L &l){\n return (distanceLP(l,c.c) < c.r+EPS &&\n (c.r < abs(c.c-l[0]) + EPS || c.r < abs(c.c-l[1]) + EPS));\n}*/\nint intersectCS(C c,L &l){\n\tif(norm(projection(l,c.c)-c.c)-c.r*c.r>EPS)return 0;\n\tconst double d1=abs(c.c-l[0]),d2=abs(c.c-l[1]);\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 P h=projection(l,c.c);\n\tif(dot(l[0]-h,l[1]-h)<0)return 2;\n\treturn 0;\n}\nP crosspointSS(L a,L b){\n\tdouble t1=abs(cross(a[1]-a[0],b[0]-a[0]));\n\tdouble t2=abs(cross(a[1]-a[0],b[1]-a[0]));\n\treturn b[0]+(b[1]-b[0])*t1/(t1+t2);\n}\nL crosspointCL(C c,L l){\n\tP pr=projection(l,c.c);\n\tP e=(l[1]-l[0])/abs(l[1]-l[0]);\n\tdouble t=sqrt(c.r*c.r-norm(pr-c.c));\n\tP a=pr+t*e;\n\tP b=pr-t*e;\n\tif(b<a)swap(a,b);\n\treturn L(a,b);\n}\nL crosspointCS(C c,L l){\n\tif(intersectCS(c,l)==2)return crosspointCL(c,l);\n\tL ret=crosspointCL(c,l);\n\tif(dot(l[0]-ret[0],l[1]-ret[0])<0)ret[1]=ret[0];\n\telse ret[0]=ret[1];\n\treturn ret;\n}\nL crosspointCC(C a,C b){\n\tP tmp=b.c-a.c;\n\tdouble d=abs(tmp);\n\tdouble q=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\n\tdouble t=arg(tmp);//atan(tmp.imag()/tmp.real());\n\tP p1=a.c+polar(a.r,t+q);\n\tP p2=a.c+polar(a.r,t-q);\n\tif(p2<p1)swap(p1,p2);\n\treturn L(p1,p2);\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 if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\n return m[0] + B / A * (m[1] - m[0]);\n}\ndouble area(const G &g){\n double S =0;\n for(int i =0;i <g.size();i++){\n S +=(cross(g[i],g[(i+1)%g.size()]));\n }\n return abs(S/2.0);\n}\nbool isconvex(const G &g){\n\tint n=g.size();\n\trep(i,n)if(ccw(g[(i+n-1)%n],g[i%n],g[(i+1)%n])==-1)return false;\n\treturn true;\n}\nint inconvex(const G& g, const P& p) {\n\tbool in = false;\n\tint n=g.size();\n\trep(i,n){\n\t\tP a=g[i%n]-p;\n\t\tP b=g[(i+1)%n]-p;\n\t\tif(imag(a)>imag(b))swap(a, b);\n\t\tif(imag(a)<=0&&0<imag(b))if(cross(a,b)<0)in=!in;\n\t\tif(cross(a,b)==0&&dot(a,b)<=0)return 1;//ON\n\t}\n\treturn in?2:0;//IN : OUT;\n}\nG convex_hull(G &ps) {\n int n=ps.size(),k=0;\n\tsort(ps.begin(), ps.end());\n\tG 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])==-1)--k;//<=0 -> ==-1\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])==-1)--k;//\n\tch.resize(k-1);\n\treturn ch;\n}\ndouble convex_diameter(const G &pt) {\n const int n = pt.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(pt[i]) > imag(pt[is])) is = i;\n if (imag(pt[i]) < imag(pt[js])) js = i;\n }\n double maxd = norm(pt[is]-pt[js]);\n\n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\n else i = (i+1) % n;\n if (norm(pt[i]-pt[j]) > maxd) {\n maxd = norm(pt[i]-pt[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}//convex_diameter(g)\nG convex_cut(const G& g, const L& l) {\n G Q;\n for (int i = 0; i < g.size(); ++i) {\n P a= curr(g, i), b= next(g, i);\n if (ccw(l[0], l[1], a) != -1) Q.push_back(a);\n if (ccw(l[0], l[1], a)*ccw(l[0], l[1], b) < 0)\n Q.push_back(crosspointLL(L(a,b), l));\n }\n return Q;\n}\nP turn(P p,double t){\n\treturn p*exp(P(.0,t*PI/180.0));\n}\nvector<L> tangentCC(C a,C b){\n\tif(a.r<b.r)swap(a,b);\n\tdouble d=abs(a.c-b.c);\n\tvector<L>l;\n\tif(d<EPS)return l;\n\tif(a.r+b.r<d-EPS){//hanareteiru\n\t\tdouble t=acos((a.r+b.r)/d);\n\t\tt=t*180/PI;\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t),b.c+turn(b.r/d*(a.c-b.c),t)));\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t),b.c+turn(b.r/d*(a.c-b.c),-t)));\n\t}else if(a.r+b.r<d+EPS){//kuttuiteiru soto\n\t\tP p=a.c+a.r/d*(b.c-a.c);\n\t\tl.pb(L(p,p+turn(b.c-a.c,90)));\n\t}\n\tif(abs(a.r-b.r)<d-EPS){//majiwatteiru\n\t\tdouble t1=acos((a.r-b.r)/d);\n\t\tt1=t1*180/PI;\n\t\tdouble t2=180-t1;\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t1),b.c+turn(b.r/d*(a.c-b.c),-t2)));\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t1),b.c+turn(b.r/d*(a.c-b.c),t2)));\n\t}else if(abs(a.r-b.r)<d+EPS){//kuttuiteiru uti\n\t\tP p=a.c+a.r/d*(b.c-a.c);\n\t\tl.pb(L(p,p+turn(b.c-a.c,90)));\n\t}\n\treturn l;\n}\nvoid printL(const L &out){\n\tprintf(\"%.9f %.9f %.9f %.9f\\n\",out[0].real(),out[0].imag(),out[1].real(),out[1].imag());\n}\nC CIN(){\n\tP p=pin();\n\tdouble r;\n\tcin>>r;\n\treturn C(p,r);\n}\nbool para(L a,L b){\n\treturn (abs(cross(a[1]-a[0],b[1]-b[0]))<EPS);\n}\nstruct UnionFind{\n vector<int> data;\n UnionFind(int size) : data(size, -1) {}\n bool unionSet(int x,int y){\n x=root(x);y=root(y);\n if(x==y)return 0;\n if(data[y]<data[x])swap(x,y);\n data[x]+=data[y],data[y]=x;\n return 1;\n }\n bool findSet(int x,int y){\n return root(x)==root(y);\n }\n int root(int x){\n return data[x]<0 ? x : data[x]=root(data[x]);\n }\n int size(int x){\n return -data[root(x)];\n }\n\tint co(){\n\t\tint c=0;\n\t\trep(i,data.size())if(data[i]<0)c++;\n\t\treturn c;\n\t}\n};\nint main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\twhile(n--){\n\t\t\tvector<G>g;\n\t\t\tint m;cin>>m;\n\t\t\trep(j,m){\n\t\t\t\tG t(4);\n\t\t\t\trep(k,4)t[k]=pin();\n\t\t\t\tg.pb(t);\n\t\t\t}\n\t\t\tUnionFind uf(m);\n\t\t\trep(i,m)loop(j,i+1,m){\n\t\t\t\tbool h=true;\n\t\t\t\trep(k,4)if(inconvex(g[i],g[j][k])||inconvex(g[j],g[i][k]))h=false;\n\t\t\t\trep(k,4)rep(l,4)if(intersectSS(L(g[i][k],g[i][(k+1)%4]),L(g[j][l],g[j][(l+1)%4])))h=false;\n\t\t\t\tif(!h)uf.unionSet(i,j);\n\t\t\t}\t\t\n\t\t\tcout<<uf.co()<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 1280,
"score_of_the_acc": -0.4635,
"final_rank": 3
},
{
"submission_id": "aoj_0214_1584448",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<bits/stdc++.h>\nusing namespace std;\n\nconst int COUNTER_CLOCKWISE = +1;\nconst int CLOCKWISE = -1;\nconst int ONLINE_BACK = +2;\nconst int ONLINE_FRONT = -2;\nconst int ON_SEGMENT = 0;\n\nconst double EPS=1e-6;\nconst double INF=1e10;\nconst double PI=acos(-1);\n\ntypedef complex<double> Point;\ntypedef complex<double> Vector;\ntypedef vector<Point> Polygon;\n\nstruct Line\n{\n\tPoint a, b;\n\tLine() {}\n\tLine(const Point &_a, const Point &_b)\n\t{\n\t\ta = _a; b = _b;\n\t}\n};\n\n//Line????????????\nstruct Segment\n{\n\tPoint a, b;\n\tSegment() {}\n\tSegment(const Point &_a, const Point &_b)\n\t{\n\t\ta = _a; b = _b;\n\t}\n};\n\nstruct Circle\n{\n\tPoint c;\n\tdouble r;\n\n\tCircle() {}\n\n\tCircle(const Point &_c, const double &_r)\n\t{\n\t\tc = _c; r = _r;\n\t}\n};\n\nistream& operator >> (istream& is, Point &p)\n{\n\tdouble x, y;\n\tis >> x >> y;\n\tp.real(x); p.imag(y);\n\treturn is;\n}\n\nSegment ToSegment(const Line l)\n{\n\treturn Segment(l.a, l.b);\n}\n\nLine ToLine(const Segment s)\n{\n\treturn Line(s.a, s.b);\n}\n\n//???????¨±???==\nbool equals(const double &a, const double &b);\nbool equals(const Vector &a, const Vector &b);\n\n//Point?????????\nbool comp(const Point &a, const Point &b);\n\n//?§????????????????\ndouble toRad(double a);\ndouble toDeg(double a);\n\n//?????¢??????\nPoint rotate(Point p,double d);\n\n\n//??????\ndouble dot(const Vector &a, const Vector &b);\n\n//??????\ndouble cross(const Vector &a, const Vector &b);\n\n//????§???¢?????¢???\ndouble GetArea(const Polygon &g);\n\n//???????¨???????(O(1))\n//?????¶:????????¨?????°??????\nint CCW(const Point &p0, const Point &p1, const Point &p2);\n\n//??´?????????(O(1))\nbool IsOrthogonal(const Vector &a, const Vector &b);\nbool IsOrthogonal(const Line &l1, const Line &l2);\n\n//????????????(O(1))\nbool IsParallel(const Vector &a, const Vector &b);\nbool IsParallel(const Line &l1, const Line &l2);\n\n//?°???±(O(1))\nPoint Project(const Line &s, const Point &p);\n\n//????°?(O(1))\nPoint Reflect(const Line &s, const Point &p);\n\n//?????¨??´???????????¢\ndouble GetDistance(const Line &l, const Point &p);\n\n//?????¨??????????????¢\ndouble GetDistance(const Segment &s, const Point &p);\n\n//????????¨??????????????¢\ndouble GetDistance(const Segment &s1, const Segment &s2);\n\n//??´?????¨?????????????????????(O(1))\nbool Intersects(const Line &l, const Segment &s);\n\n//??????????????????\nbool Intersects(const Segment &l1, const Segment &l2);\n\n//??´?????¨??´????????????(O(1))\nPoint GetIntersection(const Line &l1, const Line &l2);\n\n//?????¨????????????\n//?????????\n//\t???????????????????????°\nvector<Point> GetIntersection(const Circle &c1, const Circle &c2);\n\n//????§???¢????????????(O(n))\n//?????????\n// 0:???????????????\n// 1:????????????\n// 2:?????????\nint Contains(const Polygon &g, const Point &p);\n\n//??????(O(n))\n//?????????\n//\tx->y????????§???????°??????????????????????????¨???????\nPolygon AndrewScan(Polygon &s);\n\n//???????§???¢?????????(O(n))\nPolygon ConvexCut(const Polygon &g, const Line &l);\n\n\n//-----------------------------------------------------------\n\nbool equals(const double &a, const double &b)\n{\n\treturn abs(a - b) < EPS;\n}\n\nbool equals(const Vector &a, const Vector &b)\n{\n\treturn equals(a.real(), b.real()) && equals(a.imag(), b.imag());\n}\n\nbool comp(const Point &a, const Point &b)\n{\n\treturn equals(a.real(), b.real()) ? a.imag() < b.imag() : a.real() < b.real();\n}\n\ndouble dot(const Vector &a, const Vector &b)\n{\n\treturn a.real()*b.real() + a.imag()*b.imag();\n}\n\ndouble cross(const Vector &a, const Vector &b)\n{\n\treturn a.real()*b.imag() - a.imag()*b.real();\n}\n\ndouble GetArea(const Polygon &g)\n{\n if(g.size()<3)return 0;\n\tdouble res = 0;\n\tfor (int i = 1; i < g.size() - 1; i++)\n\t{\n\t\tres += cross(g[i] - g[0], g[i + 1] - g[0]);\n\t}\n\treturn abs(res / 2);\n}\n\nint CCW(const Point &p0, const Point &p1, const Point &p2)\n{\n\tVector v1 = (Vector)(p1 - p0), v2 = p2 - p0;\n\tif (cross(v1, v2) > EPS) return COUNTER_CLOCKWISE;\n\tif (cross(v1, v2) < -EPS) return CLOCKWISE;\n\tif (dot(v1, v2) < -EPS) return ONLINE_BACK;\n\tif (abs(v1) < abs(v2)) return ONLINE_FRONT;\n\treturn ON_SEGMENT;\n}\n\nbool IsOrthogonal(const Vector &a, const Vector &b)\n{\n\treturn equals(dot(a, b), 0.0);\n}\nbool IsOrthogonal(const Line &l1, const Line &l2)\n{\n\treturn equals(dot(l1.b - l1.a, l2.b - l2.a), 0.0);\n}\n\nbool IsParallel(const Vector &a, const Vector &b)\n{\n\treturn equals(cross(a, b), 0.0);\n}\nbool IsParallel(const Line &l1, const Line &l2)\n{\n\treturn equals(cross(l1.b - l1.a, l2.b - l2.a), 0.0);\n}\n\nPoint Project(const Line &s, const Point &p)\n{\n\tVector v1 = s.b - s.a;\n\tVector v2 = p - s.a;\n\tdouble r = dot(v1, v2) / norm(v1);\n\treturn s.a + v1 * r;\n}\n\nPoint Reflect(const Line &s, const Point &p)\n{\n\treturn p + (Project(s, p) - p) * 2.0;\n}\n\ndouble GetDistance(const Line &l, const Point &p)\n{\n\treturn abs(cross(l.a - l.b, p - l.a) / abs(l.b - l.a));\n}\n\ndouble GetDistance(const Segment &s, const Point &p)\n{\n\tif (dot(s.b - s.a, p - s.a) < 0.0) return abs(p - s.a);\n\tif (dot(s.a - s.b, p - s.b) < 0.0) return abs(p - s.b);\n\treturn GetDistance(ToLine(s), p);\n}\n\ndouble GetDistance(const Segment &s1, const Segment &s2)\n{\n\tif (Intersects(s1, s2)) return 0.0;\n\treturn min(min(GetDistance(s1, s2.a), GetDistance(s1, s2.b)),\n\t\t\t min(GetDistance(s2, s1.a), GetDistance(s2, s1.b)));\n}\n\nbool Intersects(const Line &l, const Segment &s)\n{\n\treturn CCW(l.a, l.b, s.a)*CCW(l.a, l.b, s.b) != 1;\n}\n\nbool Intersects(const Segment &l1, const Segment &l2)\n{\n\treturn CCW(l1.a, l1.b, l2.a)*CCW(l1.a, l1.b, l2.b) <= 0 &&\n\t\tCCW(l2.a, l2.b, l1.a)*CCW(l2.a, l2.b, l1.b) <= 0;\n}\n\nPoint GetIntersection(const Line &l1, const Line &l2)\n{\n\tVector a1 = l1.b - l1.a, a2 = l2.b - l2.a;\n\tVector b1 = l2.a - l1.a, b2 = l1.a - l2.b;\n\tdouble s1 = cross(a1, b1) / 2, s2 = cross(a1, b2) / 2;\n\treturn Point(l2.a.real() + a2.real()*s1 / (s1 + s2), l2.a.imag() + a2.imag()*s1 / (s1 + s2));\n}\n\nvector<Point> GetIntersection(const Circle &c1, const Circle &c2)\n{\n\tvector<Point> res;\n\tdouble d, a, t;\n\td = sqrt(norm((c2.c - c1.c)));\n\tif (d < abs(c1.r - c2.r) || c1.r + c2.r < d) return res; //?????????0\n\ta = acos((c1.r*c1.r + d*d - c2.r*c2.r) / (2 * c1.r*d));\n\tt = atan2(c2.c.imag() - c1.c.imag(), c2.c.real() - c1.c.real());\n\tres.push_back(Point(c1.c.real() + c1.r*cos(t + a), c1.c.imag() + c1.r*sin(t + a)));\n\tres.push_back(Point(c1.c.real() + c1.r*cos(t - a), c1.c.imag() + c1.r*sin(t - a)));\n\tif (equals(res[0], res[1])) res.pop_back(); //?????????1\n\treturn res;\n}\n\nint Contains(const Polygon &g, const Point &p)\n{\n\tLine l = Line(p, Point(INF, p.imag()));\n\tint cnt = 0, n = g.size();\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tVector a = g[i] - p;\n\t\tVector b = g[(i + 1) % n] - p;\n\t\tif (CCW(g[i], g[(i + 1) % n], p) == 0) return 2; //?????????\n\t\tif (a.imag() > b.imag()) swap(a, b);\n\t\tif (a.imag() <= EPS && EPS < b.imag() && cross(a, b) > EPS) cnt++;\n\t}\n\tif ((cnt & 1) == 1) return 1; //????????????\n\treturn 0; //???????????????\n}\n\nPolygon AndrewScan(Polygon &s)\n{\n\tif (s.size() <= 2) return s;\n\tsort(s.begin(), s.end(), comp);\n\tPolygon g;\n\tfor (int i = 0; i < s.size(); i++)\n\t{\n\t\t//CCW?????¨?????????==COUNTER_CLOCKWISE???????????¨???????????????\n\t\tfor (int n = g.size(); n >= 2 && CCW(g[n - 2], g[n - 1], s[i]) != CLOCKWISE; n--)\n\t\t{\n\t\t\tg.pop_back();\n\t\t}\n\t\tg.push_back(s[i]);\n\t}\n\tfor (int i = s.size() - 2; i >= 0; i--)\n\t{\n\t\tfor (int n = g.size(); CCW(g[n - 2], g[n - 1], s[i]) != CLOCKWISE; n--)\n\t\t{\n\t\t\tg.pop_back();\n\t\t}\n\t\tg.push_back(s[i]);\n\t}\n\treverse(g.begin(), g.end());\n\tg.pop_back();\n\treturn g;\n}\n\nPolygon ConvexCut(const Polygon &g, const Line &l)\n{\n\tPolygon res;\n\tfor (int i = 0; i < g.size(); i++)\n\t{\n\t\tSegment s = Segment(g[i], g[(i + 1) % g.size()]);\n\t\tif (CCW(l.a, l.b, s.a) != -1) res.push_back(s.a);\n\t\tif (CCW(l.a, l.b, s.a)*CCW(l.a, l.b, s.b) == -1)\n\t\t\tres.push_back(GetIntersection(l, ToLine(s)));\n\t}\n\treturn res;\n}\n\n\n//Latte\ndouble toRad(double a){return a/180.0*PI;}\ndouble toDeg(double a){return a*180.0/PI;}\nPoint rotate(Point p,double d){\n return Point(p.real()*cos(d)-p.imag()*sin(d),p.real()*sin(d)+p.imag()*cos(d));\n}\n\n//Malta\n\nstruct UF{\n int N;\n vector<int>par,size;\n\n void init(int _N){\n N=_N;\n par.resize(N);\n size.resize(N,1);\n for(int i=0;i<N;i++)par[i]=i;\n }\n\n int find(int x){\n return x==par[x]?x:par[x]=find(par[x]);\n }\n\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y)return;\n if(size[x]<size[y])swap(x,y);\n par[y]=x;\n size[x]+=size[y];\n }\n\n bool same(int x,int y){\n return find(x)==find(y);\n }\n};\n\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nint M;\nvector<Polygon>vec;\n\nbool isok(Polygon &g,Polygon &h){\n bool ret=false;\n rep(i,4){\n Segment s(g[i],g[(i+1)%4]);\n rep(j,4){\n Segment t(h[j],h[(j+1)%4]);\n if(Intersects(s,t))ret=true;\n }\n }\n rep(i,4){\n if(Contains(g,h[i]))ret=true;\n if(Contains(h,g[i]))ret=true;\n }\n return ret;\n}\n\nvoid solve(){\n scanf(\"%d\",&M);\n vec.resize(M,Polygon(4));\n rep(i,M)rep(j,4)cin>>vec[i][j];\n\n UF uf;\n uf.init(M);\n\n rep(i,M)rep(j,M)if(isok(vec[i],vec[j]))uf.unite(i,j);\n\n int ans=0;\n rep(i,M)if(uf.find(i)==i)ans++;\n printf(\"%d\\n\",ans);\n}\n\nsigned main()\n{\n int N;\n while(scanf(\"%d\",&N),N){\n rep(i,N)solve();\n }\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1304,
"score_of_the_acc": -0.1676,
"final_rank": 1
}
] |
aoj_0213_cpp
|
>土地分割
ハウジングメーカーの山田ハウスは、新たな目玉商品として、学校や病院など環境が充実している緑ホームタウンの分譲地を売り出しました。この分譲地は複数の区画に分割されており、好きなだけ購入できますが、購入する区画を合わせた土地の形状は長方形(正方形を含む)でなければなりません。
山田ハウスは、全区画が完売した分譲地を管理するため購入者ごとに境界線を引き、その区画の 1つに購入者番号を書いた看板を設置しておきました。境界線は地面に木の枝で線を引いただけのものであったため、数日後の豪雨により消えてしまい看板だけが残りました。図 1 は看板のあった区画に、その区画を買った購入者番号を記したものです。これでは分譲地がどのように買われたか分かりません。救いは事務所の引き出しにあった購入者番号
b
と購入区画数
k
のメモ(図 2)が見つかったことです。
図１（左）：看板の配置、図2（右）：メモ
プログラマーであるあなたは、プログラムを書いて山田ハウスを助けることになりました。分譲地の大きさ
X × Y
、購入者数
n
、メモの情報
b
、
k
、及び看板の位置情報
s
を入力とし、図 3 に示すように各区画の購入者を出力するプログラムを作成してください。
図3：各区画の購入者
与えられた情報について、以下の場合は NA と出力します。
区画を区別する方法が存在しない場合
区画を区別する方法が複数存在する場合
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロが３つの行で示されます。各データセットは以下の形式で与えられます。
X
Y
n
b
1
k
1
b
2
k
2
:
b
n
k
n
s
11
s
21
...
s
X1
s
12
s
22
...
s
X2
:
s
1Y
s
2Y
...
s
XY
1 行目に
X, Y, n
(1 ≤
X, Y
≤ 10, 1 ≤
n
≤ 15) が与えられます。続く
n
行にメモの
i
行目に書かれた情報
b
i
(1 ≤
b
i
≤
n
),
k
i
(1 ≤
k
i
≤ 100) が与えられます。
続く
Y
行に区画情報の
i
行目の情報
s
ij
が与えられます。
s
ij
は
i
行目の左から
j
番目の区画の看板情報を表します。看板の情報
s
ij
として、その区画に看板が無い場合は 0 、看板がある場合はその区画の購入者番号が与えられます。
データセットの数は 50 を超えません。
Output
入力データセットごとに、購入者情報またはNA を出力します。
Sample Input
5 4 6
1 6
2 4
3 3
4 4
5 1
6 2
0 0 1 0 0
0 0 0 2 0
0 0 0 3 0
0 4 5 0 6
3 3 1
1 9
0 0 1
0 0 0
0 0 0
4 4 4
1 6
2 2
3 4
4 4
0 1 0 0
0 0 0 2
0 0 3 0
0 4 0 0
0 0 0
Output for the Sample Input
1 1 1 2 2
1 1 1 2 2
4 4 3 3 3
4 4 5 6 6
1 1 1
1 1 1
1 1 1
NA
|
[
{
"submission_id": "aoj_0213_7432724",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <unordered_map>\nusing namespace std;\n\n\nbool is_valid_grid(int w, int h, const vector<vector<int>>& grid) {\n\tbool is_valid = true;\n\n\tfor (int y = 0; y < h; y++) {\n\t\tif (!is_valid) {\n\t\t\tbreak;\n\t\t}\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] == 0) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid;\n}\n\nbool is_valid_location(int c_owner_idx, int cw, int ch, int top_left_x, int top_left_y, const vector<vector<int>>& grid) {\n\tbool is_valid = true;\n\n\tfor (int y = top_left_y; y < top_left_y + ch; y++) {\n\t\tif (!is_valid) {\n\t\t\tbreak;\n\t\t}\n\t\tfor (int x = top_left_x; x < top_left_x + cw; x++) {\n\t\t\tif (grid[y][x] != 0 && grid[y][x] != c_owner_idx) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid;\n}\n\n\nvector<vector<int>> search(int w, int h, unordered_map<int, int>& memo, const vector<vector<int>>& grid) {\n\tvector<vector<int>> owner_coord_list;\n\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] > 0) {\n\t\t\t\tvector<int> tmp;\n\n\t\t\t\ttmp.push_back(x);\n\t\t\t\ttmp.push_back(y);\n\t\t\t\ttmp.push_back(grid[y][x]);\n\t\t\t\towner_coord_list.push_back(tmp);\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<vector<int>> result_grid;\n\tvector<pair<int, vector<vector<int>>>> stack;\n\tbool is_valid = true;\n\n\tstack.push_back(pair<int, vector<vector<int>>>(0, grid));\n\twhile (!stack.empty()) {\n\t\tauto s = stack.back();\n\t\tint c_idx = s.first;\n\t\tauto c_grid = s.second;\n\n\t\tstack.pop_back();\n\t\tif (c_idx == owner_coord_list.size()) {\n\t\t\tif (result_grid.size() > 0) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (is_valid_grid(w, h, c_grid)) {\n\t\t\t\tresult_grid = c_grid;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\n\t\tint c_owner_idx = owner_coord_list[c_idx][2];\n\t\tint cx = owner_coord_list[c_idx][0];\n\t\tint cy = owner_coord_list[c_idx][1];\n\t\tint c_num_area = memo[c_owner_idx];\n\t\tint n_idx = c_idx + 1;\n\n\t\tfor (int cw = 1; cw <= c_num_area; cw++) {\n\t\t\tif (c_num_area % cw != 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tint ch = c_num_area / cw;\n\n\t\t\tfor (int top_left_y = cy - ch + 1; top_left_y <= cy; top_left_y++) {\n\t\t\t\tif (top_left_y < 0 || top_left_y + ch > h) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int top_left_x = cx - cw + 1; top_left_x <= cx; top_left_x++) {\n\t\t\t\t\tif (top_left_x < 0 || top_left_x + cw > w) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (is_valid_location(c_owner_idx, cw, ch, top_left_x, top_left_y, c_grid)) {\n\t\t\t\t\t\tvector<vector<int>> n_grid = c_grid;\n\n\t\t\t\t\t\tfor (int y = top_left_y; y < top_left_y + ch; y++) {\n\t\t\t\t\t\t\tfor (int x = top_left_x; x < top_left_x + cw; x++) {\n\t\t\t\t\t\t\t\tn_grid[y][x] = c_owner_idx;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstack.push_back(pair<int, vector<vector<int>>>(n_idx, n_grid));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid ? result_grid : vector<vector<int>>();\n}\n\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tint w = 0;\n\t\tint h = 0;\n\t\tint n = 0;\n\n\t\tcin >> w >> h >> n;\n\n\t\tif (w == 0 && h == 0 && n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tunordered_map<int, int> memo;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint b = 0;\n\t\t\tint k = 0;\n\n\t\t\tcin >> b >> k;\n\t\t\tmemo[b] = k;\n\t\t}\n\n\t\tvector<vector<int>> grid(h, vector<int>(w));\n\n\t\tfor (int y = 0; y < h; y++) {\n\t\t\tfor (int x = 0; x < w; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\n\t\tauto result_grid = search(w, h, memo, grid);\n\n\t\tif (result_grid.empty()) {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse {\n\t\t\tfor (int y = 0; y < h; y++) {\n\t\t\t\tcout << result_grid[y][0];\n\t\t\t\tfor (int x = 1; x < w; x++) {\n\t\t\t\t\tcout << \" \" << result_grid[y][x];\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3180,
"score_of_the_acc": -0.4751,
"final_rank": 11
},
{
"submission_id": "aoj_0213_7432719",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <unordered_map>\nusing namespace std;\n\n\nbool is_valid_grid(int w, int h, const vector<vector<int>>& grid) {\n\tbool is_valid = true;\n\n\tfor (int y = 0; y < h; y++) {\n\t\tif (!is_valid) {\n\t\t\tbreak;\n\t\t}\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] == 0) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid;\n}\n\nbool is_valid_location(int c_owner_idx, int cw, int ch, int top_left_x, int top_left_y, const vector<vector<int>>& grid) {\n\tbool is_valid = true;\n\n\tfor (int y = top_left_y; y < top_left_y + ch; y++) {\n\t\tif (!is_valid) {\n\t\t\tbreak;\n\t\t}\n\t\tfor (int x = top_left_x; x < top_left_x + cw; x++) {\n\t\t\tif (grid[y][x] != 0 && grid[y][x] != c_owner_idx) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid;\n}\n\n\nvector<vector<int>> search(int w, int h, unordered_map<int, int>& memo, const vector<vector<int>>& grid) {\n\tvector<vector<int>> owner_coord_list;\n\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] > 0) {\n\t\t\t\tvector<int> tmp;\n\t\t\t\ttmp.push_back(x);\n\t\t\t\ttmp.push_back(y);\n\t\t\t\ttmp.push_back(grid[y][x]);\n\t\t\t\towner_coord_list.push_back(tmp);\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<vector<int>> result_grid;\n\tvector<pair<int, vector<vector<int>>>> stack;\n\tbool is_valid = true;\n\n\tstack.push_back(pair<int, vector<vector<int>>>(0, grid));\n\twhile (!stack.empty()) {\n\t\tauto s = stack.back();\n\t\tint c_idx = s.first;\n\t\tauto c_grid = s.second;\n\n\t\tstack.pop_back();\n\t\tif (c_idx == owner_coord_list.size()) {\n\t\t\tif (result_grid.size() > 0) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (is_valid_grid(w, h, c_grid)) {\n\t\t\t\tresult_grid = c_grid;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\n\t\tint c_owner_idx = owner_coord_list[c_idx][2];\n\t\tint cx = owner_coord_list[c_idx][0];\n\t\tint cy = owner_coord_list[c_idx][1];\n\t\tint c_num_area = memo[c_owner_idx];\n\t\tint n_idx = c_idx + 1;\n\n\t\tfor (int cw = 1; cw <= c_num_area; cw++) {\n\t\t\tif (c_num_area % cw != 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tint ch = c_num_area / cw;\n\n\t\t\tfor (int top_left_y = cy - ch + 1; top_left_y <= cy; top_left_y++) {\n\t\t\t\tif (top_left_y < 0 || top_left_y + ch > h) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int top_left_x = cx - cw + 1; top_left_x <= cx; top_left_x++) {\n\t\t\t\t\tif (top_left_x < 0 || top_left_x + cw > w) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (is_valid_location(c_owner_idx, cw, ch, top_left_x, top_left_y, c_grid)) {\n\t\t\t\t\t\tvector<vector<int>> n_grid = c_grid;\n\n\t\t\t\t\t\tfor (int y = top_left_y; y < top_left_y + ch; y++) {\n\t\t\t\t\t\t\tfor (int x = top_left_x; x < top_left_x + cw; x++) {\n\t\t\t\t\t\t\t\tn_grid[y][x] = c_owner_idx;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstack.push_back(pair<int, vector<vector<int>>>(n_idx, n_grid));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid ? result_grid : vector<vector<int>>();\n}\n\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tint w = 0;\n\t\tint h = 0;\n\t\tint n = 0;\n\n\t\tcin >> w >> h >> n;\n\n\t\tif (w == 0 && h == 0 && n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tunordered_map<int, int> memo;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint b = 0;\n\t\t\tint k = 0;\n\n\t\t\tcin >> b >> k;\n\t\t\tmemo[b] = k;\n\t\t}\n\n\t\tvector<vector<int>> grid(h, vector<int>(w));\n\n\t\tfor (int y = 0; y < h; y++) {\n\t\t\tfor (int x = 0; x < w; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\n\t\tauto result_grid = search(w, h, memo, grid);\n\t\tif (result_grid.empty()) {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse {\n\t\t\tfor (int y = 0; y < h; y++) {\n\t\t\t\tcout << result_grid[y][0];\n\t\t\t\tfor (int x = 1; x < w; x++) {\n\t\t\t\t\tcout << \" \" << result_grid[y][x];\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3480,
"score_of_the_acc": -0.5281,
"final_rank": 13
},
{
"submission_id": "aoj_0213_7432671",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <unordered_map>\nusing namespace std;\n\n\nbool is_valid_grid(int w, int h, const vector<vector<int>>& grid) {\n\tbool is_valid = true;\n\tfor (int y = 0; y < h; y++) {\n\t\tif (!is_valid) {\n\t\t\tbreak;\n\t\t}\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] == 0) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid;\n}\n\nbool is_valid_location(int c_owner_idx, int cw, int ch, int top_left_x, int top_left_y, const vector<vector<int>>& grid) {\n\tbool is_valid = true;\n\t\n\tfor (int y = top_left_y; y < top_left_y + ch; y++) {\n\t\tif (!is_valid) {\n\t\t\tbreak;\n\t\t}\n\t\tfor (int x = top_left_x; x < top_left_x + cw; x++) {\n\t\t\tif (grid[y][x] != 0 && grid[y][x] != c_owner_idx) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid;\n}\n\n\nvector<vector<int>> search(int w, int h, unordered_map<int, int>& memo, const vector<vector<int>>& grid) {\n\tvector<vector<int>> owner_coord_list;\n\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] > 0) {\n\t\t\t\tvector<int> tmp;\n\t\t\t\ttmp.push_back(x);\n\t\t\t\ttmp.push_back(y);\n\t\t\t\ttmp.push_back(grid[y][x]);\n\t\t\t\towner_coord_list.push_back(tmp);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvector<vector<int>> result_grid;\n\tvector<pair<int, vector<vector<int>>>> stack;\n\tbool is_valid = true;\n\n\tstack.push_back(pair<int, vector<vector<int>>> (0, grid));\n\twhile (!stack.empty()) {\n\t\tauto s = stack.back();\n\t\tint c_idx = s.first;\n\t\tauto c_grid = s.second;\n\n\t\tstack.pop_back();\n\t\tif (c_idx == owner_coord_list.size()) {\n\t\t\tif (result_grid.size() > 0) {\n\t\t\t\tis_valid = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tif (is_valid_grid(w, h, c_grid)) {\n\t\t\t\tresult_grid = c_grid;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\n\t\tint c_owner_idx = owner_coord_list[c_idx][2];\n\t\tint cx = owner_coord_list[c_idx][0];\n\t\tint cy = owner_coord_list[c_idx][1];\n\t\tint c_num_area = memo[c_owner_idx];\n\t\tint n_idx = c_idx + 1;\n\n\t\tfor (int cw = 1; cw <= c_num_area; cw++) {\n\t\t\tif (c_num_area % cw != 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tint ch = c_num_area / cw;\n\n\t\t\tfor (int top_left_y = cy - ch + 1; top_left_y <= cy; top_left_y++) {\n\t\t\t\tif (top_left_y < 0 || top_left_y + ch > h) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tfor (int top_left_x = cx - cw + 1; top_left_x <= cx; top_left_x++) {\n\t\t\t\t\tif (top_left_x < 0 || top_left_x + cw > w) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (is_valid_location(c_owner_idx, cw, ch, top_left_x, top_left_y, c_grid)) {\n\t\t\t\t\t\tvector<vector<int>> n_grid = c_grid;\n\n\t\t\t\t\t\tfor (int y = top_left_y; y < top_left_y + ch; y++) {\n\t\t\t\t\t\t\tfor (int x = top_left_x; x < top_left_x + cw; x++) {\n\t\t\t\t\t\t\t\tn_grid[y][x] = c_owner_idx;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstack.push_back(pair<int, vector<vector<int>>>(n_idx, n_grid));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn is_valid ? result_grid : vector<vector<int>>();\n}\n\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tint w = 0;\n\t\tint h = 0;\n\t\tint n = 0;\n\n\t\tcin >> w >> h >> n;\n\n\t\tif (w == 0 && h == 0 && n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tunordered_map<int, int> memo;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint b = 0;\n\t\t\tint k = 0;\n\n\t\t\tcin >> b >> k;\n\t\t\tmemo[b] = k;\n\t\t}\n\n\t\tvector<vector<int>> grid(h, vector<int>(w));\n\t\tfor (int y = 0; y < h; y++) {\n\t\t\tfor (int x = 0; x < w; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\n\t\tvector<vector<int>> result_grid = search(w, h, memo, grid);\n\t\tif (result_grid.empty()) {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse {\n\t\t\tfor (int y = 0; y < h; y++) {\n\t\t\t\tcout << result_grid[y][0];\n\t\t\t\tfor (int x = 1; x < w; x++) {\n\t\t\t\t\tcout << \" \" << result_grid[y][x];\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3220,
"score_of_the_acc": -0.4821,
"final_rank": 12
},
{
"submission_id": "aoj_0213_4906161",
"code_snippet": "#include<iostream>\nusing namespace std;\nint H,W,N;\nint k[16];\nint x[16],y[16];\nbool found;\nint s[10][10];\nint ans[10][10];\nbool dfs(int id)\n{\n\tif(id>N)\n\t{\n\t\tif(found)return true;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)ans[i][j]=s[i][j];\n\t\tfound=true;\n\t\treturn false;\n\t}\n\tint sum[11][11]={};\n\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t{\n\t\tsum[i+1][j+1]=sum[i+1][j]+sum[i][j+1]-sum[i][j]+(s[i][j]>0);\n\t}\n\tint K=k[id];\n\tfor(int h=1;h<=K;h++)if(K%h==0)\n\t{\n\t\tint w=K/h;\n\t\tif(h>H||w>W)continue;\n\t\tfor(int i=0;i+h<=H;i++)if(i<=x[id]&&x[id]<i+h)\n\t\t{\n\t\t\tfor(int j=0;j+w<=W;j++)if(j<=y[id]&&y[id]<j+w)\n\t\t\t{\n\t\t\t\tif(sum[i+h][j+w]-sum[i][j+w]-sum[i+h][j]+sum[i][j]>1)continue;\n\t\t\t\tfor(int I=0;I<h;I++)for(int J=0;J<w;J++)s[i+I][j+J]=id;\n\t\t\t\tif(dfs(id+1))return true;\n\t\t\t\tfor(int I=0;I<h;I++)for(int J=0;J<w;J++)s[i+I][j+J]=0;\n\t\t\t\ts[x[id]][y[id]]=id;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>W>>H>>N,H)\n\t{\n\t\tint sumk=0;\n\t\tfor(int i=1;i<=N;i++)\n\t\t{\n\t\t\tk[i]=0;\n\t\t\tx[i]=y[i]=-1;\n\t\t}\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint b;\n\t\t\tcin>>b;\n\t\t\tcin>>k[b];\n\t\t\tsumk+=k[b];\n\t\t}\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tcin>>s[i][j];\n\t\t\tif(s[i][j]>0)x[s[i][j]]=i,y[s[i][j]]=j;\n\t\t}\n\t\tif(sumk!=H*W)\n\t\t{\n\t\t\tcout<<\"NA\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tfound=false;\n\t\tif(!dfs(1)&&found)\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<W;j++)cout<<ans[i][j]<<(j+1==W?\"\\n\":\" \");\n\t\t\t}\n\t\t}\n\t\telse cout<<\"NA\"<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3104,
"score_of_the_acc": -0.3366,
"final_rank": 7
},
{
"submission_id": "aoj_0213_4433361",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include <map>\n#include <vector>\n#include <stack>\n#include<string>\n#include<queue>\n#include <regex>\n#include<iomanip>\n\nusing namespace std;\n\nint b[16];\nint s[11][11];\npair<int, int> bPos[11];\n\nclass Area\n{\npublic:\n\tint X, Y;\n\tint data[11][11];\n\tArea() { X = -1; Y = -1; }\n\tArea(int data[11][11], int X, int Y)\n\t{\n\t\tthis->X = X;\n\t\tthis->Y = Y;\n\t\tfor (size_t i = 1; i <= Y; i++)\n\t\t{\n\t\t\tfor (size_t j = 1; j <= X; j++)\n\t\t\t{\n\t\t\t\tthis->data[j][i] = data[j][i];\n\t\t\t}\n\t\t}\n\t}\n\tArea(const Area& area)\n\t{\n\t\tX = area.X;\n\t\tY = area.Y;\n\t\tif (X == -1)\n\t\t\treturn;\n\t\tfor (size_t i = 1; i <= Y; i++)\n\t\t{\n\t\t\tfor (size_t j = 1; j <= X; j++)\n\t\t\t{\n\t\t\t\tdata[j][i] = area.data[j][i];\n\t\t\t}\n\t\t}\n\t}\n\tbool CanAddRect(int x0, int y0, int wid, int hei,int num)\n\t{\n\t\tfor (size_t i = y0; i < y0 + hei; i++)\n\t\t{\n\t\t\tfor (size_t j = x0; j < x0 + wid; j++)\n\t\t\t{\n\t\t\t\tif (data[j][i] != 0 && data[j][i] != num)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tvoid AddRect(int x0, int y0, int wid, int hei,int num)\n\t{\n\t\tfor (size_t i = y0; i < y0 + hei; i++)\n\t\t{\n\t\t\tfor (size_t j = x0; j < x0 + wid; j++)\n\t\t\t{\n\t\t\t\tdata[j][i] = num;\n\t\t\t}\n\t\t}\n\t}\n};\n\nArea BFS(int X, int Y, int n)\n{\n\tqueue<Area> nodes;\n\tArea a0(s, X, Y);\n\tnodes.push(a0);\n\tArea nul;\n\tnodes.push(nul);\n\tint floor = 1;\n\tArea ret;\n\twhile (!nodes.empty())\n\t{\n\t\tArea node = nodes.front();\n\t\tnodes.pop();\n\t\tif (node.X == -1)\n\t\t{\n\t\t\tif (nodes.empty())\n\t\t\t\tbreak;\n\t\t\tfloor++;\n\t\t\tif (floor > n)\n\t\t\t\tbreak;\n\t\t\tArea nul;\n\t\t\tnodes.push(nul); \n\t\t\tcontinue;\n\t\t}\n\t\tint pArea = b[floor];\n\t\tfor (size_t i = 1; i <= pArea; i++)\n\t\t{\n\t\t\tif (pArea % i == 0)\n\t\t\t{\n\t\t\t\tint wid = i;\n\t\t\t\tint hei = pArea / wid;\n\t\t\t\tint x0 = bPos[floor].first;\n\t\t\t\tint y0 = bPos[floor].second;\n\t\t\t\tint minY = max(1, y0 - hei + 1);\n\t\t\t\tint minX = max(1, x0 - wid + 1);\n\t\t\t\tfor (size_t y = minY; y <= y0; y++)\n\t\t\t\t{\n\t\t\t\t\tif (y + hei - 1 > Y)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (size_t x = minX; x <= x0; x++)\n\t\t\t\t\t{\n\t\t\t\t\t\t//\n\t\t\t\t\t\t//cout << \"try put \" << floor << \" at \" << x << \",\" << y << \" \" << wid << \" and \" << hei << endl;\n\t\t\t\t\t\tif (x + wid - 1 <= X && node.CanAddRect(x, y, wid, hei,floor))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t//\n\t\t\t\t\t\t\t//cout << \"put \" << floor << \" at \" << x << \",\" << y << \" \" << wid << \" and \" << hei << endl;\n\t\t\t\t\t\t\tArea newNode(node);\n\t\t\t\t\t\t\tnewNode.AddRect(x, y, wid, hei, floor);\n\t\t\t\t\t\t\tnodes.push(newNode);\n\t\t\t\t\t\t\tif (floor == n)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif (ret.X == -1)\n\t\t\t\t\t\t\t\t\tret = Area(newNode);\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\treturn Area();\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\t\t}\n\t}\n\tif (floor < n)\n\t\treturn Area();\n\telse return ret;\n}\n\nint main()\n{\n\tint X, Y, n;\n\tcin >> X >> Y >> n;\n\twhile (X)\n\t{\n\t\tint no;\n\t\tfor (size_t i = 1; i <= n; i++)\n\t\t{\n\t\t\tcin >> no;\n\t\t\tcin >> b[no];\n\t\t}\n\t\tfor (size_t i = 1; i <= Y; i++)\n\t\t{\n\t\t\tfor (size_t j = 1; j <= X; j++)\n\t\t\t{\n\t\t\t\tcin >> s[j][i];\n\t\t\t\tif (s[j][i] != 0)\n\t\t\t\t\tbPos[s[j][i]] = make_pair(j, i);\n\t\t\t}\n\t\t}\n\t\tArea ret = BFS(X, Y, n);\n\t\tif (ret.X == -1)\n\t\t\tcout << \"NA\" << endl;\n\t\telse\n\t\t{\n\t\t\tfor (size_t i = 1; i <= Y; i++)\n\t\t\t{\n\t\t\t\tfor (size_t j = 1; j <= X; j++)\n\t\t\t\t{\n\t\t\t\t\tcout << ret.data[j][i];\n\t\t\t\t\tif (j < X)\n\t\t\t\t\t\tcout << \" \";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t\tcin >> X >> Y >> n;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 6856,
"score_of_the_acc": -1.025,
"final_rank": 19
},
{
"submission_id": "aoj_0213_4122130",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<functional>\nusing namespace std;\n\nstruct Area{\n int si, ti, sj, tj;\n};\n\nint main(){\n int w, h, n;\n while(cin >> w >> h >> n, w){\n int cnt[n+1];\n for(int i = 1; i <= n; i++){\n int a, b;\n cin >> a >> b;\n cnt[a] = b;\n }\n string s[h][w];\n for(int i = 0; i < h*w; i++) cin >> s[i/w][i%w];\n vector<Area> ok[n+1];\n for(int si = 0; si < h; si++){\n for(int sj = 0; sj < w; sj++){\n for(int ti = si; ti < h; ti++){\n for(int tj = sj; tj < w; tj++){\n string tmp = \"\";\n bool valid = true;\n for(int i = si; i <= ti; i++){\n for(int j = sj; j <= tj; j++){\n if(s[i][j] == \"0\") continue;\n if(tmp != \"\" && tmp != s[i][j]){\n valid = false;\n break;\n }\n tmp = s[i][j];\n }\n if(!valid) break;\n }\n if(tmp != \"\" && valid && (ti-si+1)*(tj-sj+1)==cnt[stoi(tmp)]){\n ok[stoi(tmp)].push_back(Area({si,ti,sj,tj}));\n }\n }\n }\n }\n }\n vector<vector<int>> ans(h, vector<int>(w, 0)), pool(h, vector<int>(w, 0));\n bool na = false;\n function<void(int)> dfs = [&](int ind)->void{\n if(ind == n+1){\n if(pool[0][0] != 0){\n na = true;\n return;\n }\n pool = ans;\n return;\n }\n for(Area a : ok[ind]){\n bool valid = true;\n for(int i = a.si; i <= a.ti; i++){\n for(int j = a.sj; j <= a.tj; j++){\n valid &= ans[i][j] == 0;\n }\n }\n if(!valid) continue;\n for(int i = a.si; i <= a.ti; i++){\n for(int j = a.sj; j <= a.tj; j++){\n ans[i][j] = ind;\n }\n }\n dfs(ind+1);\n for(int i = a.si; i <= a.ti; i++){\n for(int j = a.sj; j <= a.tj; j++){\n ans[i][j] = 0;\n }\n }\n }\n };\n dfs(1);\n if(na || pool[0][0] == 0){\n cout << \"NA\" << endl;\n }else{\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n cout << pool[i][j] << \" \\n\"[j==w-1];\n }\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3192,
"score_of_the_acc": -0.3522,
"final_rank": 8
},
{
"submission_id": "aoj_0213_3666847",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\ntypedef struct position{\n int x, y;\n}position;\nvector<vector<int> > ans2;\nbool fit(vector<vector<int> > &ans, position lu, int h, int w, int val){\n for (int i = lu.y; i < lu.y + h; i++) {\n for (int j = lu.x; j < lu.x + w; j++) {\n if(ans[i][j] != 0 and ans[i][j] != val) return false;\n }\n }\n return true;\n}\n \nbool range(position p, int h, int w, int mh, int mw){\n return ((0 <= p.x and p.x + w - 1 < mw) and\n (0 <= p.y and p.y + h - 1 < mh));\n}\n \nint dfs(vector<vector<int> > &land,\n vector<vector<int> > &ans,\n vector<int> &b,\n vector<int> &k,\n vector<position> &s,\n int depth = 0){\n if(depth == b.size()){\n if(ans2[0][0] != -1) return 100;\n ans2 = ans;\n return 1; \n }\n // std::cout << depth << std::endl;\n int res = 0;\n for (int i = 0; i < k[depth]; i++) {\n int h = 1 + i, w = k[depth]/(i + 1);\n if((k[depth]%(i + 1)) != 0) continue;\n for (int j = 0; j < k[depth]; j++) {\n position lu = s[b[depth]];\n lu.x -= j%w;\n lu.y -= j/w;\n // std::cout << \"lu.x:\" << lu.x << \" lu.y:\" << lu.y << std::endl;\n // std::cout << \"h:\" << h << \" w:\" << w << std::endl;\n // std::cout << \"range:\" << range(lu, h, w, land.size(), land[0].size()) << std::endl;\n if(not range(lu, h, w, land.size(), land[0].size())) continue;\n if(fit(ans, lu, h, w, b[depth])) {\n // ansの更新\n for (int k = lu.y; k < lu.y + h; k++) \n for (int l = lu.x; l < lu.x + w; l++) \n ans[k][l] = b[depth];\n\n // for (int i = 0; i < ans.size(); i++) {\n // for (int j = 0; j < ans[i].size(); j++) {\n // std::cout << ans[i][j];\n // if(j != ans[i].size() - 1) std::cout << \" \";\n // else std::cout << std::endl;\n // }\n // }\n // std::cout << std::endl;\n\n res += dfs(land, ans, b, k, s, depth + 1);\n // ansを戻す．\n for (int k = lu.y; k < lu.y + h; k++) {\n for (int l = lu.x; l < lu.x + w; l++) {\n ans[k][l] = 0;\n if(k == s[b[depth]].y and l == s[b[depth]].x)ans[k][l] = b[depth];\n }\n }\n }\n }\n }\n return res;\n}\n\nint main(){\n int x, y, n;\n ans2.resize(1);\n ans2[0].resize(1, -1);\n while(std::cin >> x >> y >> n){\n if(x == 0) break;\n ans2[0][0] = -1;\n vector<int> b(n), k(n);\n vector<position> s(n + 1, position{-1, -1});\n vector<vector<int> > land(y, vector<int>(x));\n for (int i = 0; i < n; i++) {\n std::cin >> b[i] >> k[i];\n }\n for (int i = 0; i < y; i++) {\n for (int j = 0; j < x; j++) {\n std::cin >> land[i][j];\n if(land[i][j] != 0) s[land[i][j]] = position{j, i};\n }\n }\n vector<vector<int> > ans = land;\n if(dfs(land, ans, b, k, s) == 1){\n for (int i = 0; i < y; i++) {\n for (int j = 0; j < x; j++) {\n std::cout << ans2[i][j];\n if(j != x - 1) std::cout << \" \";\n else std::cout << std::endl;\n }\n }\n }else{\n std::cout << \"NA\" << std::endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3160,
"score_of_the_acc": -0.3715,
"final_rank": 9
},
{
"submission_id": "aoj_0213_3662686",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\n#define chmin(a, b) ((a) = min((a), (b)))\n#define chmax(a, b) ((a) = max((a), (b)))\n#define fs first\n#define sc second\n#define eb emplace_back\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef tuple<int, int, int> T;\n\nconst ll MOD = 1e9 + 7;\nconst ll INF = 1e18;\nconst double pi = acos(-1);\nconst double eps = 1e-10;\n\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, -1, 0, 1};\n\nint x, y, n;\nint ans;\nvector<vector<int>> fians(20, vector<int>(20));\nvector<vector<P>> divi(20);\nvector<P> larger;\n\nvoid dfs(int depth, vector<vector<int>> &s){\n if(depth == n){\n ans++;\n fians = s;\n return ;\n }\n\n if(1 < ans){\n return ;\n }\n\n int K = larger[depth].first;\n int B = larger[depth].second;\n\n for(auto i:divi[B]){\n int h = i.first;\n int w = i.second;\n\n for(int j=0; j+h-1<y; j++){\n for(int k=0; k+w-1<x; k++){\n int l = k;\n int r = k + w - 1;\n int u = j;\n int d = j + h - 1;\n\n bool exist = false;\n bool valid = true;\n auto cs = s;\n for(int i1=u; i1<=d; i1++){\n for(int i2=l; i2<=r; i2++){\n if(cs[i1][i2] == B){\n exist = true;\n }\n else if(cs[i1][i2] != 0){\n valid = false;\n goto END;\n }\n }\n }\n\n END:;\n\n if(exist && valid){\n for(int i1=u; i1<=d; i1++){\n for(int i2=l; i2<=r; i2++){\n cs[i1][i2] = B;\n }\n }\n\n dfs(depth + 1, cs);\n }\n }\n }\n }\n\n return ;\n}\n\nint main(){\n while(1){\n ans = 0;\n larger.clear();\n for(int i=0; i<20; i++){\n divi[i].clear();\n }\n\n cin>>x>>y>>n;\n if(x == 0) return 0;\n \n int sum = 0;\n for(int i=0; i<n; i++){\n int b, k; cin>>b>>k;\n larger.emplace_back(k, b);\n sum += k;\n set<P> st;\n for(int j=1; j*j<=k; j++){\n if(k % j == 0){\n st.emplace(j, k / j);\n st.emplace(k / j, j);\n }\n }\n\n for(auto j:st){\n divi[b].emplace_back(j.first, j.second);\n }\n }\n\n sort(larger.begin(), larger.end(), greater<P>());\n\n vector<vector<int>> s(y, vector<int>(x));\n for(int i=0; i<y; i++){\n for(int j=0; j<x; j++){\n cin>>s[i][j];\n }\n }\n\n if(x * y != sum){\n cout << \"NA\" << endl;\n continue;\n }\n\n dfs(0, s);\n\n if(ans == 1){\n for(int i=0; i<y; i++){\n for(int j=0; j<x; j++){\n cout << fians[i][j] << \" \\n\"[j == x-1];\n }\n }\n }\n else{\n cout << \"NA\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3184,
"score_of_the_acc": -0.6008,
"final_rank": 14
},
{
"submission_id": "aoj_0213_2741133",
"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};\nint W, H, N; \nint b[16], k[16];\nint s[10][10];\nint ans[10][10];\nint used[10][10];\nint TX[20], TY[20];\nclass DFSError {};\nvoid dfs(int idx){\n if(idx == N) {\n if(ans[0][0] != -1) throw DFSError();\n REP(y, H)REP(x, W) ans[y][x] = used[y][x];\n return;\n }\n /*\n printf(\"idx = %d\\n\", idx);\n REP(y, H){\n REP(x, W){\n cout << used[y][x];\n if(x != W - 1) cout << \" \";\n else cout << endl;\n }\n }\n */\n int tx = TX[b[idx] - 1];\n int ty = TY[b[idx] - 1];\n //printf(\"idx = %d tx = %d ty = %d\\n\", idx, tx, ty);\n \n assert(idx < N);\n assert(b[idx] >= 1 && b[idx] <= N);\n assert(tx != -1);\n for(int h = 1; h <= k[idx]; h++) if(k[idx] % h == 0){\n int w = k[idx] / h;\n for(int by = 0; by > -h; by--) for(int bx = 0; bx > -w; bx--){\n int sx = tx + bx;\n int sy = ty + by;\n bool ok = true;\n for(int y = 0; y < h; y++) for(int x = 0; x < w; x++) {\n if(!valid(sx + x, sy + y, W, H) || used[sy + y][sx + x] != -1) ok = false;\n }\n if(ok){\n int tmp[10][10];\n memcpy(tmp, used, sizeof(used));\n for(int y = 0; y < h; y++) for(int x = 0; x < w; x++) {\n used[sy + y][sx + x] = b[idx];\n }\n dfs(idx + 1);\n memcpy(used, tmp, sizeof(used));\n }\n }\n }\n}\n \nint main(){\n while(cin >> W >> H >> N && (W | H | N)){\n REP(i, N) cin >> b[i] >> k[i];\n REP(y, H)REP(x, W) cin >> s[y][x];\n try{\n memset(used, -1, sizeof(used));\n memset(ans, -1, sizeof(ans));\n memset(TX, -1, sizeof(TX));\n memset(TY, -1, sizeof(TY));\n REP(y, H) REP(x, W) if(s[y][x] > 0) TX[s[y][x] - 1] = x, TY[s[y][x] - 1] = y;\n REP(i, N)if(TX[i] == -1){\n /*\n cerr << W << \" \" << H << \" \" << N << endl;\n REP(j, N) cerr << b[j] << \" \" << k[j] << endl;\n REP(y, H) { REP(x, W) cerr << s[y][x] << \" \"; cerr << endl; }\n assert(\"bord is dissapeared\" == \"\");\n */\n throw 0;\n }\n dfs(0);\n if(ans[0][0] == -1) throw DFSError();\n REP(y, H){\n REP(x, W){\n cout << ans[y][x];\n if(x != W - 1) cout << \" \";\n else cout << endl;\n }\n }\n }catch(...){\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 3072,
"score_of_the_acc": -0.756,
"final_rank": 15
},
{
"submission_id": "aoj_0213_2341278",
"code_snippet": "#include <iostream>\n#include <vector>\n\nusing vec = std::vector<int>;\nusing Land = std::vector<std::vector<int>>;\n\nint W, H, N;\nLand s;\nstd::vector<Land> res;\n\nbool check(int h, int w, int a, int b, int num)\n{\n if (h + a > H || w + b > W) {\n return false;\n }\n for (int i = h; i < h + a; i++) {\n for (int j = w; j < w + b; j++) {\n if (s[i][j] != 0 && s[i][j] != num) {\n return false;\n }\n }\n }\n\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n if (h <= i && i < h + a && w <= j && j < w + b) {\n continue;\n }\n if (s[i][j] == num) {\n return false;\n }\n }\n }\n \n return true;\n}\n\nvoid paint(int h, int w, int a, int b, int num)\n{\n for (int i = h; i < h + a; i++) {\n for (int j = w; j < w + b; j++) {\n s[i][j] = num;\n }\n }\n}\n\nvoid dfs(int idx, const vec &b, const vec &k)\n{\n if (idx == N) {\n res.emplace_back(s); \n return;\n } \n \n for (int i = 1; i <= k[idx]; i++) {\n int j = k[idx] / i;\n if (i * j != k[idx]) continue;\n for (int h = 0; h < H; h++) {\n for (int w = 0; w < W; w++) { \n if (check(h, w, i, j, b[idx])) {\n auto tmp = s;\n paint(h, w, i, j, b[idx]);\n dfs(idx + 1, b, k);\n s = tmp;\n }\n }\n }\n }\n}\n\nvoid print(Land &l)\n{\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n if (j > 0) std::cout << \" \"; \n std::cout << l[i][j];\n }\n std::cout << std::endl;\n }\n}\n\nvoid init()\n{\n s.assign(H, std::vector<int>(W));\n res.clear();\n}\n\nint main()\n{\n while (std::cin >> W >> H >> N, W) {\n init();\n vec b(N), k(N);\n for (int i = 0; i < N; i++) {\n std::cin >> b[i] >> k[i];\n }\n\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n std::cin >> s[i][j];\n }\n }\n\n dfs(0, b, k);\n\n if (res.size() != 1) {\n std::cout << \"NA\" << std::endl;\n } else {\n print(res[0]);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 3040,
"score_of_the_acc": -0.8003,
"final_rank": 16
},
{
"submission_id": "aoj_0213_2173292",
"code_snippet": "#include<iostream>\nusing namespace std;\nstruct State{int x[12][12];};\nint H,W,n,b[20],p[20];State S,ans;\nint area(State V,int q){\n\tint mx=100000,my=100000,nx=-1,ny=-1;\n\tfor(int i=0;i<H;i++){\n\t\tfor(int j=0;j<W;j++){\n\t\t\tif(V.x[i][j]!=q)continue;\n\t\t\tmx=min(mx,i);my=min(my,j);nx=max(nx,i);ny=max(ny,j);\n\t\t}\n\t}\n\tfor(int i=mx;i<=nx;i++){\n\t\tfor(int j=my;j<=ny;j++){\n\t\t\tif(V.x[i][j]!=q && V.x[i][j]!=0)return 99999999;\n\t\t}\n\t}\n\treturn (nx-mx+1)*(ny-my+1);\n}\nint solve(State T,int r1,int r2){\n\tif(r2==W){r1++;r2=0;}\n\tif(r1==H){\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tif(area(T,i)!=p[i])return 0;\n\t\t}\n\t\tans=T;return 1;\n\t}\n\tif(T.x[r1][r2]>=1){return solve(T,r1,r2+1);}\n\telse{\n\t\tint ret=0;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tState U=T;U.x[r1][r2]=i;\n\t\t\tif(area(U,i)>p[i])continue;\n\t\t\tret+=solve(U,r1,r2+1);\n\t\t}\n\t\treturn ret;\n\t}\n}\nint main(){\n\twhile(true){\n\t\tcin>>W>>H>>n;if(n==0)break;\n\t\tfor(int i=0;i<n;i++){cin>>b[i];cin>>p[b[i]];}\n\t\tfor(int i=0;i<H;i++){\n\t\t\tfor(int j=0;j<W;j++)cin>>S.x[i][j];\n\t\t}\n\t\tint ret=solve(S,0,0);\n\t\tif(ret==1){\n\t\t\tfor(int i=0;i<H;i++){\n\t\t\t\tfor(int j=0;j<W;j++){\n\t\t\t\t\tif(j)cout<<' ';cout<<ans.x[i][j];\n\t\t\t\t}\n\t\t\t\tcout<<endl;\n\t\t\t}\n\t\t}\n\t\telse cout<<\"NA\"<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 3104,
"score_of_the_acc": -1.1366,
"final_rank": 20
},
{
"submission_id": "aoj_0213_1667731",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#pragma warning(disable:4996)\nusing namespace std;\nvector<long long int> divisor(long long int n) {\n\tvector<long long int> res;\n\tfor (long long int i = 1; i * i <= n; ++i) {\n\t\tif (n % i == 0) {\n\t\t\tres.push_back(i);\n\t\t\tif (i * i != n) res.push_back(n / i);\n\t\t}\n\t}\n\tsort(begin(res), end(res));\n\treturn res;\n}\nint X, Y, n;\nvector<vector<int>>getans(const vector<vector<int>>&field, const int now, const vector<int>&nums,const vector<pair<int,int>>&ps) {\n\tif (now == ps.size())return field;\n\tvector<long long int>divs(divisor(nums[now]));\n\tvector<vector<int>>ans;\n\tconst int fromy = ps[now].first;\n\tconst int fromx = ps[now].second;\n\tfor (const int yrange : divs) {\n\t\tconst int xrange = nums[now] / yrange;\n\t\tint left = max(0, fromx - xrange + 1);\n\t\tint right = min(X-xrange, fromx);\n\t\tint up = max(0, fromy - yrange + 1);\n\t\tint down = min(Y- yrange, fromy);\n\t\tfor (int leftside = left; leftside <= right; ++leftside) {\n\t\t\tfor (int upside = up; upside <= down; ++upside) {\n\t\t\t\tbool ok = true;\n\t\t\t\tfor (int x = leftside; x < leftside+xrange; ++x) {\n\t\t\t\t\tfor (int y = upside; y < upside+yrange; ++y) {\n\t\t\t\t\t\tif (field[y][x] && field[y][x] != now) {\n\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (ok) {\n\t\t\t\t\tvector<vector<int>>nfield(field);\n\t\t\t\t\tfor (int x = leftside; x < leftside + xrange; ++x) {\n\t\t\t\t\t\tfor (int y = upside; y < upside + yrange; ++y) {\n\t\t\t\t\t\t\tnfield[y][x] = now;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tvector<vector<int>>nans(getans(nfield, now + 1, nums, ps));\n\t\t\t\t\tif (!ans.empty()) {\n\t\t\t\t\t\tif (!nans.empty())return vector<vector<int>>();\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tans = nans;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\treturn ans;\n}\nint main() {\n\twhile (1) { cin >> X >> Y >> n;\n\tif (!X)break;\n\t\tvector<int>nums(n+1);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x, y; cin >> x >> y;\n\t\t\tnums[x] = y;\n\t\t}\n\t\tvector<vector<int>>field(Y, vector<int>(X));\n\t\tvector<pair<int, int>>froms(n + 1);\n\t\tfor (int y = 0; y < Y; ++y) {\n\t\t\tfor (int x = 0; x < X; ++x) {\n\t\t\t\tint a; cin >> a;\n\t\t\t\tfield[y][x] = a;\n\t\t\t\tif (a) {\n\t\t\t\t\tfroms[a] = make_pair(y, x);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tauto v=getans(field, 1, nums, froms);\n\t\tif (v.empty()) {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < Y; ++i) {\n\t\t\t\tfor (int j = 0; j < X; ++j) {\n\t\t\t\t\tcout << v[i][j];\n\t\t\t\t\tif (j != X - 1)cout << \" \";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3032,
"score_of_the_acc": -0.3989,
"final_rank": 10
},
{
"submission_id": "aoj_0213_1569715",
"code_snippet": "#include <bits/stdc++.h>\n#define PB push_back\n#define MP make_pair\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define ALL(a) (a).begin(),(a).end()\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\nconst int INF=1e9;\nint cnt;\nint ans[10][10];\nint fld[10][10];\nint X,Y;\nint B[15],K[15],Bx[15],By[15],N;\nvector<int> V[15];\nbool pos(int x,int y){\n return 0<=x&&x<X&&0<=y&&y<Y;\n}\nbool ok(int x,int y,int w,int h,int n){\n REP(i,w)REP(j,h)if(!pos(x+i,y+j)||(fld[x+i][y+j]!=0&&fld[x+i][y+j]!=n)){\n //cout<<i<<\" \"<<j<<\"no\"<<endl;\n return false;\n }\n return true;\n}\nvoid rec(int n){\n if(n==N){\n REP(i,X)REP(j,Y)ans[i][j]=fld[i][j];\n cnt++;\n return;\n }\n int sx,sy;\n //cout<<n<<\" \"<<B[n]<<endl;\n //REP(i,Y)REP(j,X)printf(\"%d%c\",fld[j][i],j==X-1?'\\n':' ');\n REP(i,X)REP(j,Y)if(fld[i][j]==B[n]){sx=i;sy=j;};\n //cout<<sx<<\" \"<<sy<<endl;\n REP(i,V[n].size()){\n //cout<<V[n][i]<<endl;\n for(int x=sx-V[n][i]+1;x<=sx;x++){\n for(int y=sy-K[n]/V[n][i]+1;y<=sy;y++){\n if(ok(x,y,V[n][i],K[n]/V[n][i],B[n])){\n REP(j,V[n][i])REP(k,K[n]/V[n][i])fld[x+j][y+k]=B[n];\n rec(n+1);\n REP(j,V[n][i])REP(k,K[n]/V[n][i]){\n if(x+j==Bx[n]&&y+k==By[n])continue;\n else fld[x+j][y+k]=0;\n }\n }\n }\n }\n }\n return;\n}\nint main(){\n while(cin>>X>>Y>>N&&(X||Y||N)){\n REP(i,15)V[i].clear();\n cnt=0;\n REP(i,N){\n cin>>B[i]>>K[i];\n for(int j=1;j*j<=K[i];j++){\n if(K[i]%j==0){\n V[i].PB(j);\n if(K[i]/j!=j)V[i].PB(K[i]/j);\n }\n }\n }\n REP(i,Y)REP(j,X){\n cin>>fld[j][i];\n if(fld[j][i]!=0){\n REP(k,N)if(B[k]==fld[j][i]){\n Bx[k]=j;By[k]=i;\n }\n }\n }\n rec(0);\n if(cnt==1){\n REP(i,Y)REP(j,X)printf(\"%d%c\",ans[j][i],j==X-1?'\\n':' ');\n }else{\n cout<<\"NA\"<<endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1236,
"score_of_the_acc": -0.1064,
"final_rank": 5
},
{
"submission_id": "aoj_0213_1540450",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <utility>\nusing namespace std;\n\n#define fi first\n#define se second\ntypedef pair<int,int> pii;\n\nint X, Y, n;\nvector<int> v;\nvector<vector<int> > board;\nvector<vector<int> > ans;\nvector<vector<int> > out;\nint ok[10][10][10][10];\nbool use[16];\n\nint solve(int y, int x) {\n\tint res = 0;\n\tif(y >= Y) {\n\t\tout = ans;\n\t\treturn 1;\n\t}\n\tif(ans[y][x]) {\n\t\treturn solve(y+(x+1)/X, (x+1)%X);\n\t}\n\tvector<vector<int> > cpy = ans;\n\tfor(int i = y; i < Y; i++) {\n\t\tfor(int j = x; j < X; j++) {\n\t\t\tif(ok[y][x][i][j] && !use[ok[y][x][i][j]]) {\n\t\t\t\tfor(int k = y; k <= i; k++)\n\t\t\t\t\tfor(int l = x; l <= j; l++)\n\t\t\t\t\t\tans[k][l] = ok[y][x][i][j];\n\t\t\t\tuse[ok[y][x][i][j]] = true;\n\t\t\t\tres += solve(y+(x+1)/X, (x+1)%X);\n\t\t\t\tans = cpy;\n\t\t\t\tuse[ok[y][x][i][j]] = false;\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nint main() {\n\twhile(cin >> X >> Y >> n, X || Y || n) {\n\t\tv.clear(); board.clear(); ans.clear();\n\t\tout.clear();\n\t\tv.resize(n+1);\n\t\tboard.resize(Y);\n\t\tans.resize(Y);\n\t\tfor(int i = 0; i < 10*10*10*10; i++)\n\t\t\tok[0][0][0][i] = 0;\n\t\tfor(int i = 0; i < 16; i++)\n\t\t\tuse[i] = false;\n\t\tfor(int i = 1; i < v.size(); i++) v[i] = -1;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint b, k;\n\t\t\tcin >> b >> k;\n\t\t\tv[b] = k;\n\t\t}\n\t\tfor(int i = 1; i < v.size(); i++) {\n\t\t\tif(v[i] < 0) {\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < Y; i++) {\n\t\t\tboard[i].resize(X);\n\t\t\tans[i].resize(X);\n\t\t\tfor(int j = 0; j < X; j++) {\n\t\t\t\tcin >> board[i][j];\n\t\t\t\tans[i][j] = 0;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < Y; i++) {\n\t\t\tfor(int j = 0; j < X; j++) {\n\t\t\t\tfor(int k = i; k < Y; k++) {\n\t\t\t\t\tfor(int l = j; l < X; l++) {\n\t\t\t\t\t\tint cnt = 0;\n\t\t\t\t\t\tfor(int m = 1; m < v.size(); m++) {\n\t\t\t\t\t\t\tif((k-i+1) * (l-j+1) == v[m]) {\n\t\t\t\t\t\t\t\tbool flg = true;\n\t\t\t\t\t\t\t\tfor(int y = 0; y < Y && flg; y++) {\n\t\t\t\t\t\t\t\t\tfor(int x = 0; x < X && flg; x++) {\n\t\t\t\t\t\t\t\t\t\tif(i <= y && y <= k && j <= x && x <= l) {\n\t\t\t\t\t\t\t\t\t\t\tif(board[y][x] != 0 && board[y][x] != m)\n\t\t\t\t\t\t\t\t\t\t\t\tflg = false;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\t\t\tif(board[y][x] == m)\n\t\t\t\t\t\t\t\t\t\t\t\tflg = false;\n\t\t\t\t\t\t\t\t\t\t}\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\tif(flg) {\n\t\t\t\t\t\t\t\t\tok[i][j][k][l] = m;\n\t\t\t\t\t\t\t\t\tcnt++;\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\tif(cnt != 1) ok[i][j][k][l] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint res = 0;\n\t\tres = solve(0,0);\n\t\tint sum = 0;\n\t\tfor(int i = 0; i < v.size(); i++) sum += v[i];\n\t\tbool flg = true;\n\t\tfor(int i = 0; i < out.size(); i++)\n\t\t\tfor(int j = 0; j < out[i].size(); j++)\n\t\t\t\tflg &= out[i][j] != 0;\n\n\t\tif(res == 1 && sum == X*Y && flg) {\n\t\t\tfor(int i = 0; i < out.size(); i++) {\n\t\t\t\tcout << out[i][0];\n\t\t\t\tfor(int j = 1; j < out[i].size(); j++) {\n\t\t\t\t\tcout << \" \" << out[i][j];\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1292,
"score_of_the_acc": -0.0163,
"final_rank": 2
},
{
"submission_id": "aoj_0213_1397625",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <queue>\n#include <algorithm>\n#include <set>\n#include <math.h>\n#include <utility>\n#include <stack>\n#include <string.h>\n#include <complex>\nusing namespace std;\nconst int INF = 1<<29;\nconst double EPS = 1e-8;\ntypedef vector<int> vec;\ntypedef pair<int,int> P;\n\n\nint field[10][10];\nint ans[10][10];\nint kukaku[15];\nP start[15];\nint X,Y,n;\n\nvoid copy_field(){\n for(int i=0;i<Y;i++){\n for(int j=0;j<X;j++){\n ans[i][j] = field[i][j];\n }\n }\n}\n\nvoid print_field(){\n for(int i=0;i<Y;i++){\n cout << ans[i][0];\n for(int j=1;j<X;j++){\n printf(\" %d\",ans[i][j]);\n }\n printf(\"\\n\");\n }\n}\n\nint dfs(int n_i){\n if(n_i == n){\n copy_field();\n return 1;\n }\n int p = 0;\n for(int tate=1;tate<=kukaku[n_i];tate++){\n if (kukaku[n_i]%tate)continue;\n int yoko = kukaku[n_i] / tate;\n //printf(\"tate=%d yoko=%d\\n\",tate,yoko);\n for(int y=start[n_i].first-tate+1; y<=start[n_i].first; y++){\n for(int x=start[n_i].second-yoko+1; x<=start[n_i].second; x++){\n //printf(\"n_i=%d x=%d y=%d\\n\",n_i,x,y);\n if(!(0<=y&&y+tate-1<Y&&0<=x&&x+yoko-1<X)) continue;\n bool can_paint = true;\n for(int i=0;i<tate;i++){\n for(int j=0;j<yoko;j++){\n if(field[y+i][x+j]==0||field[y+i][x+j]==n_i+1){\n field[y+i][x+j] = n_i+1;\n }else{\n can_paint = false;\n break;\n }\n }\n }\n //printf(\"can_paint=%d\\n\",can_paint);\n if(can_paint){\n p += dfs(n_i+1);\n if(p>1) return p;\n }\n for(int i=0;i<tate;i++){\n for(int j=0;j<yoko;j++){\n if(field[y+i][x+j]==n_i+1){\n field[y+i][x+j] = 0;\n }\n }\n }\n field[start[n_i].first][start[n_i].second] = n_i+1;\n }\n }\n }\n return p;\n}\n\n\nint main(){\n while(1){\n scanf(\"%d%d%d\",&X,&Y,&n);\n if(!X)break;\n\n for(int i=0;i<n;i++){\n int d;\n scanf(\"%d\",&d);\n scanf(\"%d\",&kukaku[d-1]);\n }\n\n for(int i=0;i<Y;i++){\n for(int j=0;j<X;j++){\n scanf(\"%d\",&field[i][j]);\n if(field[i][j]>0){\n start[field[i][j]-1] = P(i,j);\n }\n }\n }\n if(dfs(0)==1){\n print_field();\n }else{\n printf(\"NA\\n\");\n }\n\n //break;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1240,
"score_of_the_acc": -0.0571,
"final_rank": 4
},
{
"submission_id": "aoj_0213_1270151",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint X, Y, n;\nint area[16];\nint used[10][10];\nint ok[10][10];\nint app[10][10];\nint T[16];\n\nint cnt;\n\nbool check(int sy, int sx, int ey, int ex, int k)\n{\n\tint t = T[k];\n\tfor (int i = sy; i < ey; i++){\n\t\tfor (int j = sx; j < ex; j++){\n\t\t\tif (used[i][j] != 0) return false;\n\t\t\tif (app[i][j] != 0 && app[i][j] != k) return false;\n\t\t\tif (app[i][j] == k) t--;\n\t\t}\n\t}\n\treturn t == 0;\n}\n\nvoid Fill(int sy, int sx, int ey, int ex, int k)\n{\n\t//if (k) printf(\"%d %d %d %d %d\\n\", k, sy, sx, ey, ex);\n\t\n\tfor (int i = sy; i < ey; i++){\n\t\tfor (int j = sx; j < ex; j++){\n\t\t\tused[i][j] = k;\n\t\t}\n\t}\n}\n\nvoid search(int k)\n{\n\tif (k > n){\n\t\tcnt++;\n\t\tmemcpy((int*)ok, (int*)used, sizeof(ok));\n\t\t\n\t\t/*for (int i = 0; i < Y; i++){\n\t\t\tfor (int j = 0; j < X; j++){\n\t\t\t\tprintf(\"%d \", ok[i][j]);\n\t\t\t}\n\t\t\tputs(\"\");\n\t\t}*/\n\t\t\n\t\treturn;\n\t}\n\tfor (int i = 0; i < Y; i++){\n\t\tfor (int j = 0; j < X; j++){\n\t\t\tfor (int h = 1; i + h <= Y; h++){\n\t\t\t\tfor (int w = 1; j + w <= X; w++){\n\t\t\t\t\tif (area[k] != h * w) continue;\n\t\t\t\t\tif (!check(i, j, i + h, j + w, k)) continue;\n\t\t\t\t\tFill(i, j, i + h, j + w, k);\n\t\t\t\t\tsearch(k + 1);\n\t\t\t\t\tFill(i, j, i + h, j + w, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid solve()\n{\n\tcnt = 0;\n\tsearch(1);\n\tif (cnt != 1) puts(\"NA\");\n\telse {\n\t\tfor (int i = 0; i < Y; i++){\n\t\t\tfor (int j = 0; j < X; j++){\n\t\t\t\tif (j) printf(\" \");\n\t\t\t\tprintf(\"%d\", ok[i][j]);\n\t\t\t}\n\t\t\tputs(\"\");\n\t\t}\n\t}\n}\n\nint main()\n{\n\twhile (scanf(\"%d %d %d\", &X, &Y, &n), X){\n\t\tmemset(T, 0, sizeof(T));\n\t\t\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tint b, k;\n\t\t\tscanf(\"%d %d\", &b, &k);\n\t\t\tarea[b] = k;\n\t\t}\n\t\tfor (int i = 0; i < Y; i++){\n\t\t\tfor (int j = 0; j < X; j++){\n\t\t\t\tscanf(\"%d\", &app[i][j]);\n\t\t\t\tT[app[i][j]]++;\n\t\t\t}\n\t\t}\n\t\tsolve();\n\t}\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 1200,
"score_of_the_acc": -1,
"final_rank": 18
},
{
"submission_id": "aoj_0213_1256011",
"code_snippet": "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <unordered_set>\n//#include <unordered_map>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\nnamespace{\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\n\nVV(pii) v(101);\nvvint vv;\nint x,y,n;\nvector<pair<int,pii>> in;\nvvint ans;\nint cnt;\nvoid foo(int a){\n\tif(a==n){\n\t\tcnt++;\n\t\tans=vv;\n\t\treturn;\n\t}\n\tint yy=in[a].S.F;\n\tint xx=in[a].S.S;\n\tint tt=in[a].F;\n\trep(i,v[tt].size()){\n\t\tint ty=v[tt][i].F;\n\t\tint tx=v[tt][i].S;\n\t\treep(j,yy-ty+1,yy+1){\n\t\t\treep(k,xx-tx+1,xx+1){\n\t\t\t\tif(j<0||j+ty-1>=y||k<0||k+tx-1>=x) continue;\n\t\t\t\tbool f=true;\n\t\t\t\treep(jj,j,j+ty){\n\t\t\t\t\treep(kk,k,k+tx){\n\t\t\t\t\t\tif(vv[jj][kk]!=0&&vv[jj][kk]!=a+1){\n\t\t\t\t\t\t\tf=false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(f){\n\t\t\t\t\treep(jj,j,j+ty){\n\t\t\t\t\t\treep(kk,k,k+tx){\n\t\t\t\t\t\t\tvv[jj][kk]=a+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfoo(a+1);\n\t\t\t\t\treep(jj,j,j+ty){\n\t\t\t\t\t\treep(kk,k,k+tx){\n\t\t\t\t\t\t\tvv[jj][kk]=0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tvv[yy][xx]=a+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nvoid mainmain(){\n\treep(i,1,11){\n\t\treep(j,1,11){\n\t\t\tv[i*j].PB(pii(i,j));\n\t\t\tv[i*j].PB(pii(j,i));\n\t\t}\n\t}\n\trep(i,101){\n\t\tsort(ALL(v[i]));\n\t\tv[i].erase(unique(ALL(v[i])),v[i].end());\n\t}\n\twhile(cin>>x>>y>>n,x||y||n){\n\t\tin=vector<pair<int,pii>>(n);\n\t\tinitvv(vv,y,x);\n\t\trep(i,n){\n\t\t\tint t;\n\t\t\tcin>>t;\n\t\t\tcin>>in[t-1].F;\n\t\t}\n\t\trep(i,y){\n\t\t\trep(j,x){\n\t\t\t\tcin>>vv[i][j];\n\t\t\t\tif(vv[i][j]!=0){\n\t\t\t\t\tin[vv[i][j]-1].S.F=i;\n\t\t\t\t\tin[vv[i][j]-1].S.S=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt=0;\n\t\tfoo(0);\n\t\tif(cnt==1){\n\t\t\trep(i,ans.size()){\n\t\t\t\trep(j,ans[i].size()){\n\t\t\t\t\tif(j) cout<<\" \";\n\t\t\t\t\tcout<<ans[i][j];\n\t\t\t\t}\n\t\t\t\tcout<<endl;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\telse{\n\t\t\tcout<<\"NA\"<<endl;\n\t\t}\n\t}\n}\n\n\n\n}\nmain() try{\n mainmain();\n}\ncatch(...){\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1224,
"score_of_the_acc": -0.0292,
"final_rank": 3
},
{
"submission_id": "aoj_0213_1216181",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nint stage_w,stage_h,total_buyers;\nint ans[50][50];\n\nvoid disp(int stage[50][50]){\n for(int y = 0; y < stage_h; y++){\n for(int x = 0; x < stage_w; x++){\n printf(\"%d%s\",stage[y][x], x == stage_w - 1 ? \"\" : \" \");\n }\n printf(\"\\n\");\n }\n}\n\nbool check(int stage[50][50]){\n for(int y = 0; y < stage_h; y++){\n for(int x = 0; x < stage_w; x++){\n if(stage[y][x] == 0) return false;\n }\n }\n memcpy(ans,stage,sizeof(int)*50*50);\n return true;\n}\n\nint dfs(int id,int areas[50],P occupied[50],int stage[50][50]){\n if(id > total_buyers){\n return check(stage) ? 1 : 0;\n }\n\n int res = 0;\n for(int w = 1; w <= areas[id]; w++){\n int h = areas[id] / w;\n if(h * w != areas[id]) continue;\n int cx = occupied[id].first;\n int cy = occupied[id].second;\n\n for(int lx = cx - w + 1; lx <= cx; lx++){\n if(lx < 0) continue;\n\n int rx = lx + w - 1;\n\n if(rx >= stage_w) continue;\n for(int ly = cy - h + 1; ly <= cy; ly++){\n if(ly < 0) continue;\n\n int ry = ly + h - 1;\n if(ry >= stage_h) continue;\n\n int prev[50][50];\n memcpy(prev,stage,sizeof(int)*50*50);\n for(int x = lx; x <= rx; x++){\n for(int y = ly; y <= ry; y++){\n if(stage[y][x] == 0){\n stage[y][x] = id;\n }\n else if(stage[y][x] != id){\n goto fail;\n }\n }\n }\n res += dfs(id + 1,areas,occupied,stage);\n fail:;\n memcpy(stage,prev,sizeof(int)*50*50);\n }\n }\n }\n\n return res;\n}\n\nint main(){\n\n while(~scanf(\"%d %d %d\",&stage_w,&stage_h,&total_buyers)){\n if(stage_w == 0 && stage_h == 0) break;\n\n int stage[50][50];\n int areas[50];\n for(int buyer_i = 0; buyer_i < total_buyers; buyer_i++){\n int id;\n int area;\n scanf(\"%d %d\",&id,&area);\n areas[id] = area;\n }\n\n P occupied[50];\n for(int y = 0; y < stage_h; y++){\n for(int x = 0; x < stage_w; x++){\n scanf(\"%d\",&stage[y][x]);\n if(stage[y][x] != 0){\n occupied[stage[y][x]] = P(x,y);\n }\n }\n }\n\n if(dfs(1,areas,occupied,stage) == 1){\n disp(ans);\n }\n else{\n printf(\"NA\\n\");\n }\n }\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 1372,
"score_of_the_acc": -0.8554,
"final_rank": 17
},
{
"submission_id": "aoj_0213_1173142",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <map>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\n\nint h,w,n;\nmap<int,int> ma;\nmap<int,pair<int,int> > p;\nvector<vector<int> > v;\n\nbool can(int i,int j,int ny,int nx)\n{\n\tif(0 <= i && ny <= h && 0 <= j && nx <= w)\n\t{\n\t\treturn true;\n\t}\n\telse return false;\n}\n\nbool canSet(int num,int y,int x,int y2,int x2)\n{\n\tbool flag = true;\n\n\tREP(i,y,y2)\n\t{\n\t\tREP(j,x,x2)\n\t\t{\n\t\t\tif(v[i][j] != 0)\n\t\t\t{ \n\t\t\t\tflag = false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn flag;\n}\n\nvoid set(int num,int y,int x,int y2,int x2)\n{\n\tREP(i,y,y2)\n\t{\n\t\tREP(j,x,x2)\n\t\t{\n\t\t\tv[i][j] = num;\n\t\t}\n\t}\n}\n\nint cnt = 0;\nvector<vector<int> > v2;\n\nvoid dfs(int num)\n{\n\tif(num == 0)\n\t{\n\t\tif(cnt == 0)\n\t\t{\n\t\t\tbool flag = true;\n\t\t\trep(i,h)\n\t\t\t{\n\t\t\t\trep(j,w)\n\t\t\t\t{\n\t\t\t\t\tif(v[i][j] == 0) flag = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(flag)\n\t\t\t{\n\t\t\t\tv2.resize(h);\n\t\t\t\trep(i,h) v2[i].resize(w);\n\t\t\t\trep(i,h) rep(j,w) v2[i][j] = v[i][j];\n\t\t\t\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tbool flag = true;\n\n\t\t\trep(i,h)\n\t\t\t{\n\t\t\t\trep(j,w)\n\t\t\t\t{\n\t\t\t\t\tif(v[i][j] == 0) flag = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(flag)\n\t\t\t{\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tREP(y,1,ma[num]+1)\n\t\t{\n\t\t\tif(ma[num]%y == 0)\n\t\t\t{\n\t\t\t\tint x = ma[num]/y;\n\t\t\t\tREP(i,p[num].first-y+1,p[num].first+1)\n\t\t\t\t{\n\t\t\t\t\tREP(j,p[num].second-x+1,p[num].second+1)\n\t\t\t\t\t{\n\t\t\t\t\t\tint ny = i+y;\n\t\t\t\t\t\tint nx = j+x;\n\n\t\t\t\t\t\tif(can(i,j,ny,nx))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tv[p[num].first][p[num].second] = 0;\n\t\t\t\t\t\t\tif(canSet(num,i,j,ny,nx))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tset(num,i,j,ny,nx);\n\t\t\t\t\t\t\t\tdfs(num-1);\n\t\t\t\t\t\t\t\tset(0,i,j,ny,nx);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tv[p[num].first][p[num].second] = num;\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\nint main()\n{\n\twhile(cin >> w >> h >> n)\n\t{\n\t\tif(h == 0 && w == 0 && n == 0) break;\n\n\t\tv.resize(h);\n\t\trep(i,h) v[i].clear();\n\n\t\tma.clear();\n\t\tp.clear();\n\t\tcnt = 0;\n\n\t\trep(i,n)\n\t\t{\n\t\t\tint a,b;\n\t\t\tcin >> a >> b;\n\t\t\tma[a] = b;\n\t\t}\n\n\t\tv.resize(n);\n\t\trep(i,h)\n\t\t{\n\t\t\trep(j,w)\n\t\t\t{\n\t\t\t\tint temp;\n\t\t\t\tcin >> temp;\n\t\t\t\tv[i].push_back(temp);\n\n\t\t\t\tif(1 <= temp && temp <= 15)\n\t\t\t\t{\n\t\t\t\t\tp[temp] = pair<int,int>(i,j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdfs(n);\n\n\t\tif(cnt == 1)\n\t\t{\n\t\t\trep(i,h)\n\t\t\t{\n\t\t\t\trep(j,w)\n\t\t\t\t{\n\t\t\t\t\tcout << v2[i][j];\n\t\t\t\t\tif(j != w-1) cout << \" \";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1232,
"score_of_the_acc": -0.1307,
"final_rank": 6
},
{
"submission_id": "aoj_0213_1168783",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <map>\nusing namespace std;\n\nint X, Y, n;\nint id[20], k[20], sx[20], sy[20];\nint bd[10][10], ans[10][10];\nvector<pair<int,int> > area[101];\n\nint dfs(int u) {\n\tif (u == n) {\n\t\tmemcpy(ans, bd, sizeof ans);\n\t\treturn 1;\n\t}\n\tint h, w, tx, ty, lx, rx, uy, dy;\n\ttx = sx[id[u]];\n\tty = sy[id[u]];\n\tbd[ty][tx] = 0;\n\tint ret = 0;\n\tfor (int i=0; i<(int)area[k[u]].size(); ++i) {\n\t\th = area[k[u]][i].first;\n\t\tw = area[k[u]][i].second;\n\t\tlx = max(tx-w+1, 0);\n\t\trx = min(tx+w-1, X-1);\n\t\tuy = max(ty-h+1, 0);\n\t\tdy = min(ty+h-1, Y-1);\n\t\tif (rx-lx+1 < w || dy-uy+1 < h) continue;\n\t\tfor (int y=uy; y+h-1<=dy; ++y) {\n\t\t\tfor (int x=lx; x+w-1<=rx; ++x) {\n\t\t\t\tbool ok = true;\n\t\t\t\tfor (int y2=y; y2<y+h && ok; ++y2) {\n\t\t\t\t\tfor (int x2=x; x2<x+w; ++x2) {\n\t\t\t\t\t\tif (bd[y2][x2] != 0) {\n\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif ( ! ok) continue;\n\t\t\t\tfor (int y2=y; y2<y+h; ++y2) {\n\t\t\t\t\tfor (int x2=x; x2<x+w; ++x2) {\n\t\t\t\t\t\tbd[y2][x2] = id[u];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tret += dfs(u+1);\n\t\t\t\tfor (int y2=y; y2<y+h; ++y2) {\n\t\t\t\t\tfor (int x2=x; x2<x+w; ++x2) {\n\t\t\t\t\t\tbd[y2][x2] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (2 <= ret) return 2;\n\t\t\t}\n\t\t}\n\t}\n\tbd[ty][tx] = id[u];\n\treturn ret;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tfor (int i=1; i<=10; ++i) {\n\t\tfor (int j=1; j<=10; ++j) {\n\t\t\tarea[i*j].push_back(make_pair(i, j));\n\t\t}\n\t}\n\twhile (cin >> X >> Y >> n, X) {\n\t\tint sum = 0;\n\t\tfor (int i=0; i<n; ++i) {\n\t\t\tcin >> id[i] >> k[i];\n\t\t\tsum += k[i];\n\t\t}\n\t\tfor (int i=0; i<Y; ++i) {\n\t\t\tfor (int j=0; j<X; ++j) {\n\t\t\t\tcin >> bd[i][j];\n\t\t\t\tif (bd[i][j] != 0) {\n\t\t\t\t\tsx[bd[i][j]] = j;\n\t\t\t\t\tsy[bd[i][j]] = i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint res = dfs(0);\n\t\tif (X * Y != sum || res == 0 || 2 <= res) {\n\t\t\tcout << \"NA\\n\";\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int i=0; i<Y; ++i) {\n\t\t\tfor (int j=0; j<X; ++j) {\n\t\t\t\tcout << (j == 0 ? \"\" : \" \") << ans[i][j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0014,
"final_rank": 1
}
] |
aoj_0212_cpp
|
高速バス
A 君は高校の休みを利用して、高速バス(以下、「バス」 )で一人旅をする計画を立てています。まず、A 君は一番行ってみたい町を選んでそこを目的地にしました。次に出発地から目的地までバスを乗り継いでいくルートを決めなければなりません。乗り継ぎをするときは、バスを降りてから別のバスに乗り換えるので、それぞれのバスの乗車券が必要になります。
A 君は親戚のおじさんからバスの割引券を何枚かもらいました。 この券を 1 枚使うと乗車券 1 枚を半額で購入できます。例えば、図 1 の出発地5から目的地1へ行く場合には、5→4→6→2→1と5→3→1の二つの経路が考えられます。割引券が 2 枚あるとすると、交通費を最も安くするには5→4→6→2→1の経路をたどった場合、4→6と6→2の路線に割引を利用し、合計料金は 4600円となります。一方、5→3→1の経路をたどった場合、5→3と3→1の路線に割引を利用し、合計料金は 3750 円となります。
A 君は観光にお金を回したいので、交通費はできるだけ少なくしようと考えています。そこで A 君は、出発地から目的地までの最も安い交通費を求めるプログラムを作成することにしました。
図1
割引券の枚数、バスがつなぐ町の数、バスの路線数、各バスの路線情報を入力とし、出発地から目的地までの最も安い交通費を出力するプログラムを作成してください。各バスは双方向に同一料金で運行しています。また、町の数を
n
とすると、町にはそれぞれ異なる 1 から
n
までの番号が振られています。出発地から目的地までの経路は必ず存在するものとします。
Input
複数のデータセットの並びが入力として与えられます。 入力の終わりはゼロが５つの行で示されます。
各データセットは以下の形式で与えられます。
c
n
m
s
d
a
1
b
1
f
1
a
2
b
2
f
2
:
a
m
b
m
f
m
1 行目に割引券の枚数
c
(1 ≤
c
≤ 10)、バスがつなぐ町の数
n
(2 ≤
n
≤ 100)、バスの路線数
m
(1 ≤
m
≤ 500)、出発地の町番号
s
と目的地の町番号
d
(
s ≠ d
) が与えられます。
続く
m
行に第
i
のバスの路線情報
a
i
, b
i
, f
i
(1 ≤
a
i
, b
i
≤
n
, 1000 ≤
f
i
≤ 10000) が与えられます。
a
i
, b
i
はバスの路線の始点と終点の町番号、
f
i
はこの路線の料金を表す100 刻みの整数です。
データセットの数は 100 を超えません。
Output
入力データセットごとに、最も安い交通費を１行に出力します。
Sample Input
1 3 3 1 3
1 3 2000
1 2 1000
2 3 1000
2 3 3 1 3
1 3 2300
1 2 1000
2 3 1200
2 6 6 5 1
1 2 1500
1 3 4500
2 6 2000
5 4 1000
6 4 2200
3 5 3000
0 0 0 0 0
Output for the Sample Input
1000
1100
3750
|
[
{
"submission_id": "aoj_0212_4374621",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nconst int INF = 1e7;\nint Cost[101][101], DpMoney[11][101];\nbool Used[11][101];\n\n\nvoid solve(int ticket, int n, int start) {\n\tint u, v;\n\n\tfor (int i = 0; i < 11; ++i) {\n\t\tfill(DpMoney[i], DpMoney[i] + 101, INF);\n\t\tfill(Used[i], Used[i] + 101, false);\n\t}\n\n\tDpMoney[0][start] = 0;\n\twhile (true) {\n\t\tu = -1;\n\t\tfor (int i = 0; i <= ticket; ++i) {\n\t\t\tfor (int j = 1; j <= n; ++j) {\n\t\t\t\tif (!Used[i][j] && (u == -1 || DpMoney[i][j] < DpMoney[u][v])) {\n\t\t\t\t\tu = i;\n\t\t\t\t\tv = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (u == -1) {\n\t\t\tbreak;\n\t\t}\n\t\tUsed[u][v] = true;\n\n\t\tfor (int k = 1; k <= n; ++k) {\n\t\t\tDpMoney[u][k] = min(DpMoney[u][k], DpMoney[u][v] + Cost[v][k]);\n\t\t\tif (u + 1 <= ticket) {\n\t\t\t\tDpMoney[u + 1][k] = min(DpMoney[u + 1][k], DpMoney[u][v] + Cost[v][k] / 2);\n\t\t\t}\n\t\t}\n\t}\n\t\n}\n\nint main() {\n\tint c, n, m, s, d, a, b, f;\n\n\twhile (cin >> c >> n >> m >> s >> d, c) {\n\t\tfor (int i = 0; i < 101; ++i) {\n\t\t\tfill(Cost[i], Cost[i] + 101, INF);\n\t\t}\n\t\tfor (int i = 0; i < m; ++i) {\n\t\t\tcin >> a >> b >> f;\n\t\t\tCost[a][b] = f;\n\t\t\tCost[b][a] = f;\n\t\t}\n\t\tsolve(c, n, s);\n\t\tf = INF;\n\t\tfor (int i = 0; i <= c; ++i) {\n\t\t\tf = min(f, DpMoney[i][d]);\n\t\t}\n\t\tcout << f << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3168,
"score_of_the_acc": -0.0532,
"final_rank": 12
},
{
"submission_id": "aoj_0212_4339418",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\n#define INF 1000010;\n\nusing namespace std;\n\n\nint main(void){\n long c,n,m,s,d;\n while(true){\n cin>>c>>n>>m>>s>>d;\n if(c==0 and n==0 and m==0 and s==0 and d==0)break;\n d--;\n s--;\n\n long a,b,f;\n map<long,long> costs[n];\n for(int i=0;i<m;i++){\n cin>>a>>b>>f;\n a--;\n b--;\n costs[a][b]=f;\n costs[b][a]=f;\n }\n map<long,long> dist[n];\n for(long i=0;i<n;i++){\n for(long j=0;j<=c;j++){\n dist[i][j]=INF;\n }\n }\n dist[s][0]=0;\n\n vector<long> next,_next;\n next.push_back(s);\n while(next.empty()==false){\n _next.clear();\n for(auto iter=next.begin();iter!=next.end();iter++){\n long city=*iter;\n for(auto iter2=costs[city].begin();iter2!=costs[city].end();iter2++){\n long next_city=iter2->first;\n long fee=iter2->second;\n for(long ticket=0;ticket<=c;ticket++){\n if(dist[next_city][ticket]>dist[city][ticket]+fee){\n dist[next_city][ticket]=dist[city][ticket]+fee;\n _next.push_back(next_city);\n }\n }\n for(long ticket=1;ticket<=c;ticket++){\n if(dist[next_city][ticket]>dist[city][ticket-1]+fee/2){\n dist[next_city][ticket]=dist[city][ticket-1]+fee/2;\n _next.push_back(next_city);\n }\n }\n }\n }\n\n sort(_next.begin(),_next.end());\n _next.erase(unique(_next.begin(),_next.end()),_next.end());\n next.clear();\n copy(_next.begin(),_next.end(),back_inserter(next));\n\n }\n long retval=INF;\n for(long ticket=0;ticket<=c;ticket++){\n retval=min(dist[d][ticket],retval);\n }\n cout<<retval<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3240,
"score_of_the_acc": -0.0238,
"final_rank": 5
},
{
"submission_id": "aoj_0212_4082929",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int, int> P;\n#define INF 1000000\n\nint main() {\n while (true) {\n int c, n, m, s, d;\n cin >> c >> n >> m >> s >> d;\n \n if (c==0 && n==0 && m==0 && s==0 && d==0) {\n break;\n }\n \n s -= 1;\n d -= 1;\n \n vector<P> adj_list[n*(c+1)];\n \n for (int i=0; i<m; i++) {\n int ai, bi, fi;\n cin >> ai >> bi >> fi;\n ai -= 1;\n bi -= 1;\n \n for (int j=0; j<=c; j++) {\n adj_list[ai*(c+1)+j].push_back(P(bi*(c+1)+j, fi));\n adj_list[bi*(c+1)+j].push_back(P(ai*(c+1)+j, fi));\n \n if (j>0) {\n adj_list[ai*(c+1)+j].push_back(P(bi*(c+1)+j-1, fi/2));\n adj_list[bi*(c+1)+j].push_back(P(ai*(c+1)+j-1, fi/2));\n }\n }\n }\n \n priority_queue<P, vector<P>, greater<P>> pq;\n int dist[n*(c+1)];\n \n for (int i=0; i<n*(c+1); i++) {\n dist[i] = INF;\n }\n \n dist[s*(c+1)+c] = 0;\n pq.push(P(0, s*(c+1)+c));\n \n while (pq.size()) {\n P p = pq.top();\n pq.pop();\n \n int d = p.first;\n int v = p.second;\n \n if (dist[v]<d) {\n continue;\n }\n \n for (int i=0; i<adj_list[v].size(); i++) {\n int nv = adj_list[v][i].first;\n int w = adj_list[v][i].second;\n \n if (dist[nv]>dist[v]+w) {\n dist[nv] = dist[v]+w;\n pq.push(P(dist[nv], nv));\n }\n }\n }\n \n int ans = INF;\n \n for (int i=0; i<=c; i++) {\n ans = min(ans, dist[d*(c+1)+i]);\n }\n \n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3240,
"score_of_the_acc": -0.0238,
"final_rank": 5
},
{
"submission_id": "aoj_0212_4061087",
"code_snippet": "/**\n * code generated by JHelper\n * More info: https://github.com/AlexeyDmitriev/JHelper\n * @author aajisaka\n */\n\n#include<bits/stdc++.h>\n\nusing namespace std;\n\nvoid debug_out() { cerr << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\n#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n#define all(v) v.begin(), v.end()\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\n\nusing ll = long long;\nusing P = pair<ll, ll>;\n\nconstexpr double PI = 3.14159265358979323846;\nmt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());\n\nclass HighwayExpressBus {\npublic:\n void solve(istream& cin, ostream& cout) {\n SPEED;\n while(true) {\n int c, n, m, s, d; cin >> c >> n >> m >> s >> d;\n s--; d--;\n if (c==0) return;\n\n vector<P> graph[(c+1)*n];\n int cost[(c+1)*n];\n rep(i, (c+1)*n) {\n cost[i] = INT_MAX/2;\n }\n\n while(m--) {\n int a, b, f; cin >> a >> b >> f;\n a--; b--;\n rep(i, c+1) {\n graph[a+i*n].emplace_back(b+i*n, f);\n graph[b+i*n].emplace_back(a+i*n, f);\n }\n rep(i, c) {\n graph[a+i*n].emplace_back(b+(i+1)*n, f/2);\n graph[b+i*n].emplace_back(a+(i+1)*n, f/2);\n }\n }\n\n priority_queue<P, vector<P>, greater<>> que;\n que.emplace(0, s);\n cost[s] = 0;\n while(!que.empty()) {\n auto p = que.top(); que.pop();\n if (p.first > cost[p.second]) continue;\n for(const auto& e: graph[p.second]) {\n if (cost[e.first] > p.first + e.second) {\n cost[e.first] = p.first + e.second;\n que.emplace(cost[e.first], e.first);\n }\n }\n }\n\n int ans = INT_MAX;\n rep(i, c+1) {\n chmin(ans, cost[d+n*i]);\n }\n cout << ans << endl;\n }\n\n }\n};\n\nsigned main() {\n HighwayExpressBus solver;\n std::istream& in(std::cin);\n std::ostream& out(std::cout);\n solver.solve(in, out);\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3320,
"score_of_the_acc": -0.0294,
"final_rank": 7
},
{
"submission_id": "aoj_0212_4061086",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <numeric>\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\n#define REP(i,n) for(long long i = 0; i < (n); i++)\n#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)\n#define ALL(obj) (obj).begin(),(obj).end()\n#define SPEED cin.tie(0);ios::sync_with_stdio(false);\n\ntemplate<class T> using V = vector<T>;\ntemplate<class T, class U> using P = pair<T, U>;\n\nconst ll MOD = (ll)1e9 + 7;\nconst ll MOD2 = 998244353;\nconst ll HIGHINF = (ll)1e18;\nconst ll LOWINF = (ll)1e15;\nconst long double PI = 3.1415926535897932384626433;\n\ntemplate <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}\ntemplate <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << \"{\"; for (auto &x : obj) o << \" {\" << x.first << \" : \" << x.second << \"}\" << \",\"; o << \" }\"; return o;}\ntemplate <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << \"{\"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? \", \" : \"\") << *itr; o << \"}\"; return o;}\ntemplate <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << \"{\"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? \", \" : \"\") << *itr; o << \"}\"; return o;}\ntemplate <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << \"{\"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? \", \" : \"\") << obj[i]; o << \"}\"; return o;}\ntemplate <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << \"{\" << obj.first << \", \" << obj.second << \"}\"; return o;}\ntemplate <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << \"{\"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? \", \" : \"\") << *itr; o << \"}\"; return o;}\nvoid print(void) {cout << endl;}\ntemplate <class Head> void print(Head&& head) {cout << head;print();}\ntemplate <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << \" \";print(forward<Tail>(tail)...);}\ntemplate <class T> void chmax(T& a, const T b){a=max<T>(a,b);}\ntemplate <class T> void chmin(T& a, const T b){a=min<T>(a,b);}\nvoid YN(bool flg) {cout << ((flg) ? \"YES\" : \"NO\") << endl;}\nvoid Yn(bool flg) {cout << ((flg) ? \"Yes\" : \"No\") << endl;}\nvoid yn(bool flg) {cout << ((flg) ? \"yes\" : \"no\") << endl;}\n\ntemplate<class T> class Dijkstra {\npublic:\n int N;\n T inf;\n vector<T> cost;\n vector<vector<pair<T, int>>> edge;\n \n Dijkstra(const int N, T inf) : N(N), inf(inf),cost(N), edge(N) {\n }\n \n void make_edge(int from, int to, T w) {\n edge[from].push_back({ w,to });\n }\n \n void solve(int start) {\n for(int i = 0; i < N; ++i) cost[i] = inf;\n \n priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;\n cost[start] = 0;\n pq.push({ 0,start });\n \n while (!pq.empty()) {\n T v = pq.top().first;\n int from = pq.top().second;\n pq.pop();\n for (auto u : edge[from]) {\n T w = v + u.first;\n int to = u.second;\n if (w < cost[to]) {\n cost[to] = w;\n pq.push({ w,to });\n }\n }\n }\n return;\n }\n};\n\nint main() {\n while(1){\n ll c,n,m,s,d;\n cin >> c >> n >> m >> s >> d;\n if(c==0){\n return 0;\n }\n s--,d--;\n Dijkstra<ll> dijk((c+1)*n,LOWINF);\n for(int i = 0; i < m; ++i){\n int a,b; cin >> a >> b;\n a--,b--;\n ll w; cin >> w;\n for(int i = 0; i < c; ++i){\n dijk.make_edge(i*n+a, (i+1)*n+b, w/2);\n dijk.make_edge(i*n+b, (i+1)*n+a, w/2);\n }\n for(int i = 0; i <= c; ++i){\n dijk.make_edge(i*n+a, i*n+b, w);\n dijk.make_edge(i*n+b, i*n+a, w);\n }\n }\n dijk.solve(s);\n ll ans = LOWINF;\n for(int i = 0; i <= c; ++i) chmin(ans,dijk.cost[i*n+d]);\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3392,
"score_of_the_acc": -0.0344,
"final_rank": 8
},
{
"submission_id": "aoj_0212_3697791",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define inf 1000000000\n#define INF 1000000000000000\n#define ll long long\n#define ull unsigned long long\n#define M (int)(1e9+7)\n#define P pair<int,int>\n#define PLL pair<ll,ll>\n#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)\n#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)\n#define rep(i,n) FOR(i,0,n)\n#define rrep(i,n) RFOR(i,n,0)\n#define all(a) a.begin(),a.end()\n#define IN(a,n) rep(i,n){ cin>>a[i]; }\nconst int vx[4] = {0,1,0,-1};\nconst int vy[4] = {1,0,-1,0};\n#define PI 3.14159265\n#define F first\n#define S second\n#define PB push_back\n#define EB emplace_back\n#define int ll\nvoid init(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n}\n\n\n\ntemplate< typename T >\nstruct edge {\n int src, to;\n T cost;\n\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\n\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\n\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n\n operator int() const { return to; }\n};\n\ntemplate< typename T >\nusing Edges = vector< edge< T > >;\ntemplate< typename T >\nusing WG = vector< Edges< T > >;\nusing UG = vector< vector< int > >;\ntemplate< typename T >\nusing Matrix = vector< vector< T > >;\n\n\n\ntemplate< typename T >\nvector<T> dijkstra(WG<T> &g,int s){\n const auto lim = numeric_limits<T>::max();\n vector<T> dist(g.size(),lim);\n using Pi = pair<T,int>;\n priority_queue<Pi,vector<Pi>,greater<Pi>> q;\n dist[s] = 0;\n q.emplace(dist[s],s);\n while(!q.empty()){\n T cost;\n int idx;\n tie(cost,idx) = q.top();\n q.pop();\n if(dist[idx] < cost) continue;\n for( auto &e : g[idx]){\n auto next_cost = cost + e.cost;\n if(dist[e.to] <= next_cost) continue;\n dist[e.to] = next_cost;\n q.emplace(dist[e.to],e.to);\n }\n }\n return dist;\n}\n\n\nint c,n,m,s,d;\n\nmain(){\n while(true){\n cin>>c>>n>>m>>s>>d;\n if(n==0) break;\n\n s--;d--;\n WG<int> es(n*(c+1));\n\n rep(k,m){\n int a,b,f;\n cin>>a>>b>>f;\n a--;b--;\n rep(i,c+1){\n es[a*(c+1)+i].PB(edge<int>(b*(c+1)+i,f));\n es[b*(c+1)+i].PB(edge<int>(a*(c+1)+i,f));\n }\n FOR(i,1,c+1){\n es[a*(c+1)+i].PB(edge<int>(b*(c+1)+i-1,f/2));\n es[b*(c+1)+i].PB(edge<int>(a*(c+1)+i-1,f/2));\n }\n }\n\n vector<int> res=dijkstra(es,s*(c+1)+c);\n\n int ans=INF;\n rep(i,c+1){\n //cout<<res[d*(c+1)+i]<<endl;\n ans=min(ans,res[d*(c+1)+i]);\n }\n\n cout<<ans<<endl;\n\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3396,
"score_of_the_acc": -0.0347,
"final_rank": 9
},
{
"submission_id": "aoj_0212_3668335",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<utility>\n#include<queue>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < (n); i++)\ntypedef pair<int,int> pii;\ntypedef pair<int,pii> pip;\n\nclass Dijkstra{\nprivate:\n struct edge {int to,cost;};\n vector<vector<edge> > g;\n int n;\n\npublic:\n Dijkstra(int size){\n g.resize(size);\n n = size;\n }\n vector<vector<int> > dist;\n void add(int a, int b, int c){\n edge e1 = {b,c}, e2 = {a,c};\n g[a].push_back(e1);\n g[b].push_back(e2);\n }\n int calc(int s,int t,int ma){\n priority_queue<pip,vector<pip>,greater<pip> > q;\n int n = g.size();\n dist = vector<vector<int> > (n, vector<int>(ma+1,1e9));\n dist[s][0] = 0;\n q.push(pip(0,pii(s,0)));\n while(!q.empty()){\n pip p = q.top();\n q.pop();\n int c = p.first;\n pii node = p.second;\n if(dist[node.first][node.second] < c)continue;\n rep(i,g[node.first].size()){\n edge e = g[node.first][i];\n if(dist[e.to][node.second] > dist[node.first][node.second] + e.cost){\n dist[e.to][node.second] = dist[node.first][node.second] + e.cost;\n q.push(pip(dist[e.to][node.second],pii(e.to,node.second)));\n }\n if(node.second < ma){\n if(dist[e.to][node.second+1] > dist[node.first][node.second] + e.cost/2){\n dist[e.to][node.second+1] = dist[node.first][node.second] + e.cost/2;\n q.push(pip(dist[e.to][node.second+1],pii(e.to,node.second+1)));\n }\n }\n }\n }\n int ret = 1e9;\n rep(i,ma+1)ret = min(ret, dist[t][i]);\n return ret;\n }\n};\n\nint main(){\n int c,n,m,s,d;\n while(cin >> c >> n >> m >> s >> d, n){\n Dijkstra dij(n);\n rep(i,m){\n int a,b,f;\n cin >> a >> b >> f;\n dij.add(a-1,b-1,f);\n }\n cout << dij.calc(s-1,d-1,c) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3184,
"score_of_the_acc": -0.0199,
"final_rank": 4
},
{
"submission_id": "aoj_0212_3662289",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nstruct line {\n ll a, b, f;\n};\nusing pllll = pair<ll, ll>;\nusing pl6 = pair<ll, pair<ll, ll>>;\nstruct edge {\n ll dstb, dstc, cost;\n};\nint main() {\n \n ll c, n, m, s, d;\n while (cin >> c >> n >> m >> s >> d, c) {\n\n s--; d--;\n\n vector<line> l(m, line{0, 0, 0});\n for (ll i = 0; i < m; i++) {\n cin >> l[i].a >> l[i].b >> l[i].f;\n l[i].a--; l[i].b--;\n if (l[i].a > l[i].b) swap(l[i].a, l[i].b);\n }\n\n sort(l.begin(), l.end(), [](line &i, line &j) -> bool {\n if (i.a != j.a) return i.a < j.a;\n else if (i.b != j.b) return i.b < j.b;\n else return i.f < j.f;\n });\n\n // 被った路線はなかったことに\n for (ll i = m; --i; ) {\n if (l[i].a == l[i-1].a && l[i].b == l[i-1].b) {\n l.erase(l.begin() + i);\n }\n }\n m = l.size();\n\n \n // 無向グラフを構築\n vector<vector<vector<edge>>> g(n, vector<vector<edge>>(c+1));\n for (ll i = m; i--; ) {\n ll a = l[i].a;\n ll b = l[i].b;\n ll f = l[i].f;\n for (ll c0 = c; c0 >= 0; c0--) {\n g[a][c0].push_back(edge{b, c0, f});\n g[b][c0].push_back(edge{a, c0, f});\n if (c0 > 0) {\n g[a][c0].push_back(edge{b, c0-1, f/2});\n g[b][c0].push_back(edge{a, c0-1, f/2});\n }\n }\n }\n\n // 拡張Dijkstra\n vector<vector<ll>> dp(n, vector<ll>(c+1, 0x7FFFFFFFLL));\n vector<vector<bool>> determined(n, vector<bool>(c+1, false));\n priority_queue<pl6, vector<pl6>, greater<pl6>> q;\n q.push(pl6(0, pllll(s, c)));\n dp[s][c] = 0;\n while (!q.empty()) {\n pl6 cv = q.top(); q.pop();\n pllll v = cv.second;\n ll vf = dp[v.first][v.second];\n if (determined[v.first][v.second]) continue;\n determined[v.first][v.second] = true;\n for (edge &ed : g[v.first][v.second]) {\n if (determined[ed.dstb][ed.dstc]) continue;\n if (vf + ed.cost < dp[ed.dstb][ed.dstc]) {\n q.push(pl6(vf + ed.cost, pllll(ed.dstb, ed.dstc)));\n dp[ed.dstb][ed.dstc] = vf + ed.cost;\n }\n }\n }\n\n ll ans = 0x7FFFFFFFLL;\n for (ll i = 0; i <= c; i++) {\n ans = min(ans, dp[d][i]);\n }\n cout << ans << endl;\n\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3620,
"score_of_the_acc": -0.0504,
"final_rank": 11
},
{
"submission_id": "aoj_0212_3661916",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <tuple>\n#include <queue>\n\nusing namespace std;\n\n#define int long long\n\nclass Solver {\n};\n\nsigned main() {\n\twhile (true) {\n\t\tint c, n, m, s, d;\n\t\tcin >> c >> n >> m >> s >> d;\n\t\ts--;\n\t\td--;\n\t\tif (c == 0)break;\n\n\t\tvector<vector<vector<tuple<int, int, int>>>> graph(c + 1,\n\t\t\tvector<vector<tuple<int, int, int>>>(n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint a, b, f;\n\t\t\tcin >> a >> b >> f;\n\t\t\ta--;\n\t\t\tb--;\n\t\t\tfor (int i = 0; i <= c; i++) {\n\t\t\t\tgraph[i][a].emplace_back(make_tuple(i, b, f));\n\t\t\t\tgraph[i][b].emplace_back(make_tuple(i, a, f));\n\t\t\t\tif (i < c) {\n\t\t\t\t\tgraph[i][a].emplace_back(make_tuple(i + 1, b, f/2));\n\t\t\t\t\tgraph[i][b].emplace_back(make_tuple(i + 1, a, f/2));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpriority_queue<tuple<int, int, int>> que;\n\t\tvector<vector<int>> dist(c + 1, vector<int>(n, 1e9));\n\t\tque.emplace(make_tuple(0, s, 0));\n\t\twhile (que.size() > 0) {\n\t\t\tint cnt = get<0>(que.top());\n\t\t\tint pos = get<1>(que.top());\n\t\t\tint distance = get<2>(que.top());\n\t\t\tque.pop();\n\t\t\tif (dist[cnt][pos] <= distance)continue;\n\n\t\t\tdist[cnt][pos] = distance;\n\t\t\tfor (int i = 0; i < graph[cnt][pos].size(); i++) {\n\t\t\t\tint cnt_t = get<0>(graph[cnt][pos][i]);\n\t\t\t\tint pos_t = get<1>(graph[cnt][pos][i]);\n\t\t\t\tint distance_t = get<2>(graph[cnt][pos][i]);\n\t\t\t\tdistance_t += distance;\n\n\t\t\t\tif (dist[cnt_t][pos_t] <= distance_t)continue;\n\n\t\t\t\tque.emplace(make_tuple(cnt_t, pos_t, distance_t));\n\t\t\t}\n\t\t}\n\n\t\tint res = 1e9;\n\t\tfor (int i = 0; i <= c; i++)res = min(res, dist[i][d]);\n\t\tcout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3868,
"score_of_the_acc": -0.2746,
"final_rank": 13
},
{
"submission_id": "aoj_0212_3661909",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\n#define int long long int\nconst int INF = 1001001001001001LL;\n\nint di[] = {-1, 0, 1, 0, -1, 1, 1, -1};\nint dj[] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nvector<int> dijk(int s, int v, vector<vector<pair<int, int>>> adjlist){\n priority_queue <pair<int, int>> wait;\n vector<int> result(v, INF);\n\n result[s] = 0;\n wait.push(make_pair(0,s));\n\n while(!wait.empty()){\n int nowpoint = wait.top().second;\n int nowcost = -wait.top().first;\n wait.pop();\n\n if(result[nowpoint] < nowcost) continue;\n\n for(int i = 0; i < adjlist[nowpoint].size(); i++){\n int nextpoint = adjlist[nowpoint][i].second;\n int nextcost = nowcost + adjlist[nowpoint][i].first;\n if(result[nextpoint] > nextcost){\n result[nextpoint] = nextcost;\n wait.push(make_pair(-nextcost, nextpoint));\n }\n }\n }\n return result;\n}\n\n\n\nsigned main(){\n \n\n while(1){\n int c, n, m, s, t; cin >> c >> n >> m >> s >> t;\n s--;\n t--;\n if(!n) break;\n vector<vector<int> > toNode(n, vector<int> (c + 1));\n int num = 0;\n for(int i = 0; i < n; i++){\n for(int j = 0; j <= c; j++){\n toNode[i][j] = num;\n num++;\n }\n }\n\n vector<vector<pair<int, int>>> adj(num);\n\n for(int i = 0; i < m; i++){\n int a, b, f; cin >> a >> b >> f;\n a--;\n b--;\n\n for(int iii = 0; iii < 2; iii++){\n\n for(int j = 0; j <= c; j++){\n \n int cur = toNode[a][j];\n // 使わない\n int nxt = toNode[b][j];\n adj[cur].push_back({f, nxt});\n \n nxt = toNode[b][j + 1];\n // 使う\n if(j != c){\n adj[cur].push_back({f / 2, nxt});\n }\n }\n swap(a, b);\n }\n }\n\n \n int ans = INF;\n int S = toNode[s][0];\n vector<int> result = dijk(S, num, adj);\n for(int j = 0; j <= c; j++){\n int G = toNode[t][j];\n ans = min(ans, result[G]);\n }\n\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3452,
"score_of_the_acc": -0.0386,
"final_rank": 10
},
{
"submission_id": "aoj_0212_3555882",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <queue>\n#include <bitset>\n#include <set>\n#include <map>\n#include <stack>\n#include <list>\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define SORT(c) sort((c).begin(),(c).end())\n#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())\n\nconst float PI = 3.1415926;\nstatic const int INFTY = (1<<30);\nstatic const int WHITE = 0;\nstatic const int GRAY = 1;\nstatic const int BLACK = 2;\nstatic const int MAX = 100;\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\n\nint c, n, m, s, d;\nint C[101][101], D[101][101];\nint DP[101][16];\n\n// co=割引券, cost=現在の値段\nvoid solve(int st, int co, int cost) {\n if (st == d-1) {\n return;\n }\n // 次の町探し\n rep(i, n) {\n if (i == st || C[st][i] == INFTY) {\n continue;\n }\n int tmp = cost + C[st][i];\n int tmp2 = cost + C[st][i]/2;\n if (DP[i][co] > tmp) {\n DP[i][co] = tmp;\n solve(i, co, tmp);\n }\n if (co < c && DP[i][co+1] > tmp2) {\n DP[i][co+1] = tmp2;\n solve(i, co+1, tmp2);\n }\n }\n}\n\n\nint main() {\n while (cin >> c >> n >> m >> s >> d, c) {\n rep(i, n) {\n rep(j, n) {\n C[i][j] = INFTY;\n D[i][j] = INFTY;\n }\n rep (q, c+1) {\n DP[i][q] = INFTY;\n }\n }\n rep(i, m) {\n int a,b,f;\n cin >> a >> b >> f;\n C[a-1][b-1] = f;\n C[b-1][a-1] = f;\n }\n solve(s-1, 0, 0);\n int res = INFTY;\n rep(i, c+1) {\n res = min(res, DP[d-1][i]);\n }\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 3168,
"score_of_the_acc": -0.3521,
"final_rank": 17
},
{
"submission_id": "aoj_0212_3120344",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<queue>\n#include<vector>\n#include<cstring>\nusing namespace std;\n\nconst int INF = 1<<30;\nint c, n, m, s, d, a, b, f;\nint path[101][101];\nint dp[101][11] = {};\n\nvoid solve(){\n // { cost, {source, ticket} }\n priority_queue<pair<int, pair<int,int>>> pq;\n pq.push({0, {s, c}});\n dp[s][c] = 0;\n\n while(!pq.empty()){\n auto p = pq.top(); pq.pop();\n int cost = -p.first;\n int source = p.second.first;\n int ticket = p.second.second;\n\n for(int dst = 0; dst < n; dst++){\n if(path[source][dst] == 0) continue;\n\n if(dp[dst][ticket] > cost + path[source][dst]){\n dp[dst][ticket] = cost + path[source][dst];\n pq.push({-dp[dst][ticket], {dst, ticket}});\n }\n\n if(ticket > 0 && dp[dst][ticket-1] > cost + path[source][dst]/2){\n dp[dst][ticket-1] = cost + path[source][dst]/2;\n pq.push({-dp[dst][ticket-1], {dst, ticket-1}});\n }\n }\n }\n}\n\nint main(){\n while(cin >> c >> n >> m >> s >> d){\n if(c + n + m + s + d == 0) break;\n\n s--; d--;\n // initialize\n memset(path, 0, sizeof(path));\n for(int i = 0; i < 101; i++){\n for(int j = 0; j < 11; j++){\n dp[i][j] = INF;\n }\n }\n\n for(int i = 0; i < m; i++){\n cin >> a >> b >> f;\n a--; b--;\n path[a][b] = path[b][a] = f;\n }\n\n solve();\n\n int ans = INF;\n for(int ticket = 0; ticket <= c; ticket++) ans = min(ans, dp[d][ticket]);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3140,
"score_of_the_acc": -0.0168,
"final_rank": 3
},
{
"submission_id": "aoj_0212_3000274",
"code_snippet": "#include <bits/stdc++.h>\n#define range(i, a, b) for(int i = (a); i < (b); i++)\n#define rep(i, a) range(i, 0, a)\nusing namespace std;\n\n#define to first\n#define dist second\n\nconst int INF = 1e9;\n\nint main() {\n int c, n, m, s, d;\n while (cin >> c >> n >> m >> s >> d, c) {\n s--, d--;\n vector <vector <pair <int, int>>> G(n);\n rep (i, m) {\n int a, b, f;\n cin >> a >> b >> f;\n a--, b--;\n G[a].emplace_back(b, f);\n G[b].emplace_back(a, f);\n }\n\n // state -> (dist, now, num of ticket)\n using state = tuple <int, int, int>;\n priority_queue <state> que;\n vector <vector <int>> dp(n, vector <int> (c + 1, INF));\n dp[s][0] = 0;\n que.emplace(0, s, 0);\n\n while (!que.empty()) {\n state p = que.top(); que.pop();\n int dist, now, numOfTicket;\n tie(dist, now, numOfTicket) = p;\n\n for (auto & next : G[now]) {\n if (numOfTicket < c && dp[next.to][numOfTicket + 1] > dist + next.dist / 2) {\n dp[next.to][numOfTicket + 1] = dist + next.dist / 2;\n que.emplace(dp[next.to][numOfTicket + 1], next.to, numOfTicket + 1);\n }\n if (dp[next.to][numOfTicket] > dist + next.dist) {\n dp[next.to][numOfTicket] = dist + next.dist;\n que.emplace(dp[next.to][numOfTicket], next.to, numOfTicket);\n }\n }\n }\n int ans = INF;\n rep (i, c + 1) ans = min(ans, dp[d][i]);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 3148,
"score_of_the_acc": -0.3162,
"final_rank": 15
},
{
"submission_id": "aoj_0212_2999125",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <bitset>\n#include <map>\n#include <tuple>\n#include <unordered_map>\n#include <list>\n#include <numeric>\n#include <utility>\n#include <iterator>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n#include <ctime>\n#include <cassert>\n\n#define INF 1000000000\n#define LINF 9000000000000000000\n#define mod 1000000007\n\n#define rep(i,n) for(int i=0;i<int(n);i++)\n#define rrep(i,n) for(int i=n-1;i>=0;i--)\n#define REP(i,a,b) for(int i=(a);i<int(b);i++)\n#define all(x) (x).begin(),x.end()\n#define pb push_back\n#define mp make_pair\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<int> vi;\ntypedef vector<long long>vll;\ntypedef pair<int,int> pi;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nint ddx[8]={-1,-1,0,1,1,1,0,-1};\nint ddy[8]={0,1,1,1,0,-1,-1,-1};\nbool debug=false;\n\n/*---------------------------------------------------*/\n\n/* 現在地 コスト 使った枚数 */\ntypedef tuple<int,int,int> tp;\ntypedef pair<ll,ll> P;\n\n/* 町 使った割引券の数 */\nll dist[105][15];\nvector<P> G[105];\nconst ll MAX=LLONG_MAX/10;\n\nvoid init(){\n for(int i=0;i<105;i++){\n G[i].clear();\n for(int j=0;j<15;j++){\n dist[i][j]=MAX;\n }\n }\n}\n\nvoid solve(int c,int n,int m,int s,int d){\n init();\n int a,b,f;\n for(int i=0;i<m;i++){\n cin>>a>>b>>f;\n G[a].push_back(mp(b,f));\n G[b].push_back(mp(a,f));\n }\n\n /* 現在地 使った枚数 */\n priority_queue<tp,vector<tp>,greater<tp> > que;\n que.push(make_tuple(s,0,0));\n dist[s][0] = 0;\n while(que.size()){\n ll now,cost,num;\n tie(now,cost,num)=que.top();que.pop();\n if(dist[now][num]<cost)continue;\n for(auto x : G[now]){ \n /* 割引券を使わない */\n if(cost+x.second<dist[x.first][num]){\n dist[x.first][num] = cost+x.second;\n que.push(make_tuple(x.first,dist[x.first][num],num));\n }\n /* 割引券が残っていたら使う */\n if(num<c&&cost+x.second/2<dist[x.first][num+1]){\n dist[x.first][num+1] = cost+x.second/2;\n // cout<<now<<\" \"<<x.first<<\" = \"<< dist[x.first][num+1] << endl;\n que.push(make_tuple(x.first,dist[x.first][num+1],num+1));\n }\n }\n }\n\n ll ans=LLONG_MAX;\n for(int i=0;i<15;i++)\n ans=min(ans,dist[d][i]);\n ans=min(ans,dist[d][c]);\n \n cout<<ans<<endl;\n}\n\n\nint main(){\n int c,n,m,s,d;\n while(cin>>c>>n>>m>>s>>d,c|n|m|s|d){\n solve(c,n,m,s,d);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3120,
"score_of_the_acc": -0.0154,
"final_rank": 2
},
{
"submission_id": "aoj_0212_2690887",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define M 100000007\n#define ff first.first\n#define fs first.second;\ntypedef pair<int,int> P;\ntypedef pair<P,int> Pi;\nint main(void){\n\tint c,n,m,s,d;\n\twhile(1){\n\t\tcin>>c>>n>>m>>s>>d;\n\t\tif(n==0)break;\n\t\tvector<P> cost[n+1];\n\t\tfor(int i=0;i<m;i++){\n\t\t\tint a,b,l;\n\t\t\tcin>>a>>b>>l;\n\t\t\tcost[a].push_back(P(b,l)); cost[b].push_back(P(a,l));\n\t\t}\n\t\tint leng[c+1][n+1];\n\t\tpriority_queue<Pi> que;\n\t\tfor(int i=0;i<=c;i++) fill(leng[i],leng[i]+n+1,M);\n\t\tfor(int i=0;i<=c;i++) leng[i][s]=0;\n\t\tque.push(Pi(P(0,0),s));\n\t\twhile(!que.empty()){\n\t\t\tPi p=que.top(); que.pop();\n\t\t\tint v=p.second,w=p.fs;\n\t\t\tif(leng[w][v]<p.ff) continue;\n\t\t\tfor(int i=0;i<cost[v].size();i++){\n\t\t\t\tP x=cost[v][i];\n\t\t\t\tint t=leng[w][v]+x.second;\n\t\t\t\tif(leng[w][x.first]>t){\n\t\t\t\t\tleng[w][x.first]=t;\n\t\t\t\t\tque.push(Pi(P(t,w),x.first));\n\t\t\t\t}\n\t\t\t\tt-=x.second/2;\n\t\t\t\tif(w<c&&leng[w+1][x.first]>t){\n\t\t\t\t\tleng[w+1][x.first]=t;\n\t\t\t\t\tque.push(Pi(P(t,w+1),x.first));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint mi=M;\n\t\tfor(int i=0;i<=c;i++) mi=min(mi,leng[i][d]);\n\t\tcout<<mi<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 3116,
"score_of_the_acc": -0.337,
"final_rank": 16
},
{
"submission_id": "aoj_0212_2669042",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long; using pii = pair<int, int>;\nconst int MOD = (int)1e9 + 7, INF = (1 << 27); const ll INFLL = (1LL << 55);\n#define FOR(i,a,b) for(int (i)=(a);i<(int)(b);i++)\n#define rep(i,n) FOR(i,0,n)\ntemplate<typename T> void dbg(T x) { cout << x << \"\\n\"; }\ntemplate<typename T, typename U> static void chmin(T &x, U y) { if (y < x) x = y; }\ntemplate<typename T, typename U> static void chmax(T &x, U y) { if (x < y) x = y; }\n\n\nint n, m;\n\n// O(n^2)\nusing Dist = int;\nconst int VMAX = 110;\nDist cost[VMAX][VMAX];\nDist d[12][VMAX];\nvoid dijkstra(int s, int a) {\n d[a][s] = 0;\n vector<int> used(n, 0);\n while (1) {\n int v = -1;\n for (int to = 0; to < n; to++) {\n if (used[to]) continue;\n if (v == -1 || d[a][to] < d[a][v]) v = to;\n }\n if (v == -1) break;\n used[v] = 1;\n for (int to = 0; to < n; to++) {\n Dist nd = d[a][v] + cost[v][to];\n if (a > 0) chmin(nd, d[a - 1][v] + cost[v][to] / 2);\n if (nd < d[a][to]) d[a][to] = nd;\n }\n }\n}\n\nvoid init() {\n fill_n(*d, 12 * VMAX, INF);\n fill_n(*cost, VMAX * VMAX, INF);\n}\n\nint main() {\n int c, s, t;\n while (cin >> c >> n >> m >> s >> t, c) {\n init();\n s--; t--;\n rep(i, m) {\n int a, b, f; cin >> a >> b >> f;\n a--; b--;\n cost[a][b] = cost[b][a] = f;\n }\n rep(a, c + 1) dijkstra(s, a);\n cout << d[c][t] << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3104,
"score_of_the_acc": -0.0143,
"final_rank": 1
},
{
"submission_id": "aoj_0212_2582498",
"code_snippet": "# include <iostream>\n# include <algorithm>\n# include <vector>\n# include <string>\n# include <set>\n# include <map>\n# include <cmath>\n# include <iomanip>\n# include <functional>\n# include <utility>\n# include <stack>\n# include <queue>\n# include <list>\n# include <bitset>\n# include <complex>\n# include <numeric>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\nconstexpr long long MOD = 10007;\nconstexpr int INF = 2000000000;\nconstexpr int HINF = INF / 2;\nconstexpr double DINF = 100000000000000000.0;\nconstexpr long long LINF = 9223372036854775807;\nconstexpr long long HLINF = 4500000000000000000;\nconst double PI = acos(-1);\n\ntypedef std::pair<int, int> P;\ntypedef pair<int, P> pp;\n\nconst int smax = 100100;\n\nvector<P> edge[smax];\nint c, n, m, s, d; // c...??????????????° n...?????? m...??? s...????????? d...?????? \nLL v[15][smax]; //15....max of tickets\n\nint solve() {\n\tv[c][s] = 0; //?????????\n\tpriority_queue<pp, vector<pp>, greater<pp> > q;\n\tq.push(pp(0, P(s, c))); //cost,now,ticket(now)\n\twhile (!q.empty()) {\n\t\tpp V = q.top();\n\t\tq.pop();\n\t\tint now_v = V.second.first;\n\t\tint now_t = V.second.second;\n\t\tif (v[now_t][now_v] < V.first) continue; //v.first(?????????)???v[now_t][now_v]???????????§????????£???????????????????????§?????????\n\n\t\t\t\t\t\t\t\t\t\t\t\t //not use tickets\n\t\tfor (int i = 0; i<edge[now_v].size(); i++) {\n\t\t\tif (v[now_t][edge[now_v][i].first] > v[now_t][now_v] + edge[now_v][i].second) {\n\t\t\t\tv[now_t][edge[now_v][i].first] = v[now_t][now_v] + edge[now_v][i].second;\n\t\t\t\tq.push(pp(v[now_t][now_v] + edge[now_v][i].second, P(edge[now_v][i].first, now_t)));\n\t\t\t}\n\t\t}\n\n\t\t// use tickets\n\t\tif (now_v > 0) {\n\t\t\tfor (int i = 0; i<edge[now_v].size(); i++) {\n\t\t\t\tP p = edge[now_v][i];\n\t\t\t\tint next_c = p.second / 2;\n\t\t\t\tif (now_t == 0)continue;\n\t\t\t\tif (v[now_t - 1][p.first] > v[now_t][now_v] + next_c) {\n\t\t\t\t\tv[now_t - 1][p.first] = v[now_t][now_v] + next_c;\n\t\t\t\t\tq.push(pp(v[now_t - 1][p.first], P(p.first, now_t - 1)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tLL ans = INF;\n\tfor (int i = 0; i<c + 1; i++) {\n\t\tans = min(ans, v[i][d]);\n\t}\n\treturn ans;\n}\n\nint main(void) {\n\twhile (cin >> c >> n >> m >> s >> d && c | n | m | s | d) {\n\t\tfor (int i= 0; i < smax;i++) edge[i].clear();\n\t\tfill(v[0], v[0] + 15 * smax, INF);\n\t\tfor (int i = 0; i < m;i++) {\n\t\t\tint a, b, f;\n\t\t\tcin >> a >> b >> f;\n\t\t\tedge[a].push_back(P(b, f));\n\t\t\tedge[b].push_back(P(a, f));\n\t\t}\n\t\tcout << solve() << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 17192,
"score_of_the_acc": -1.2529,
"final_rank": 20
},
{
"submission_id": "aoj_0212_2339393",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<math.h>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<map>\n#define REP(i, N) for(ll i = 0; i < N; ++i)\n#define FOR(i, a, b) for(ll i = a; i < b; ++i)\n#define ALL(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (long long)1000000000\n#define MOD 1000000007\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\nint main(void) {\n\twhile(true) {\n\t\tll c, n, m, s, d;\n\t\tcin>>c>>n>>m>>s>>d;\n\t\tif(c == 0 && n == 0 && m == 0 && s == 0 && d == 0) break;\n\t\t--s;\n\t\t--d;\n\t\tvector<vector<P> > p(n);\n\t\tvector<vector<ll> > dir(n, vector<ll>(c + 1, INF * INF));\n\t\tREP(i, m) {\n\t\t\tint a, b, f;\n\t\t\tcin>>a>>b>>f;\n\t\t\t--a;\n\t\t\t--b;\n\t\t\tp[a].pb(P(b, f));\n\t\t\tp[b].pb(P(a, f));\n\t\t}\n\t\tpriority_queue<pair<P, ll> > que;\n\t\tque.push(pair<P, ll>(P(0, s), c));\n\t\tdir[s][c] = 0;\n\t\twhile(!que.empty()) {\n\t\t\tpair<P, ll> np = que.top();\n\t\t\tque.pop();\n\t\t\tif(dir[np.first.second][np.second] != np.first.first) continue;\n\t\t\tREP(i, p[np.first.second].size()) {\n\t\t\t\tif(dir[p[np.first.second][i].first][np.second] > dir[np.first.second][np.second] + p[np.first.second][i].second) {\n\t\t\t\t\tdir[p[np.first.second][i].first][np.second] = dir[np.first.second][np.second] + p[np.first.second][i].second;\n\t\t\t\t\tque.push(pair<P, ll>(P(dir[p[np.first.second][i].first][np.second], p[np.first.second][i].first), np.second));\n\t\t\t\t}\n\t\t\t\tif(np.second > 0 && dir[p[np.first.second][i].first][np.second - 1] > dir[np.first.second][np.second] + p[np.first.second][i].second / 2) {\n\t\t\t\t\tdir[p[np.first.second][i].first][np.second - 1] = dir[np.first.second][np.second] + p[np.first.second][i].second / 2;\n\t\t\t\t\tque.push(pair<P, ll>(P(dir[p[np.first.second][i].first][np.second - 1], p[np.first.second][i].first), np.second - 1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tll res = INF * INF;\n\t\tREP(i, c + 1) {\n\t\t\tres = min(res, dir[d][i]);\n\t\t}\n\t\tcout<<res<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 3188,
"score_of_the_acc": -0.365,
"final_rank": 18
},
{
"submission_id": "aoj_0212_2309073",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1000000000;\n\nstruct Edge{\n int to,cost;\n};\n\nstruct Node{\n int val,num;\n};\n\nstruct P{\n int val,num,c;\n bool operator<(const P &r)const{\n return val < r.val;\n }\n};\n\n\n\n\nint main(){\n int c,n,m,s,d;\n \n while(1){\n cin >> c >> n >> m >> s >> d;\n s--;d--;\n if(c == 0 && n == 0 && m == 0 && s == -1 && d == -1)break;\n vector<Edge>edge[105];\n Node node[11][105];\n \n priority_queue<P> que;\n for(int i = 0; i < m; i++){\n int a,b,c;\n cin >> a >> b >> c;\n a--;b--;\n edge[a].push_back((Edge){b,c});\n edge[b].push_back((Edge){a,c});\n }\n\n\n for(int i = 0; i < 11; i++){\n for(int j = 0; j < n; j++){\n node[i][j].val = INF;\n node[i][j].num = j;\n }\n }\n\n node[c][s].val = 0;\n \n que.push((P){0,s,c});\n\n while(!que.empty()){\n int val = que.top().val;\n int now = que.top().num;\n int ticket = que.top().c;\n que.pop();\n \n if(ticket){\n for(int i = 0; i < edge[now].size(); i++){\n\tint next = edge[now][i].to;\n\tint cost = edge[now][i].cost;\n\n\tif(node[ticket - 1][next].val > node[ticket][now].val + cost / 2){\n\t node[ticket - 1][next].val = node[ticket][now].val + cost / 2;\n\t que.push((P){node[ticket - 1][next].val,next,ticket - 1});\n\t}\n } \n }\n\n for(int i = 0; i < edge[now].size(); i++){\n int next = edge[now][i].to;\n int cost = edge[now][i].cost;\n \n if(node[ticket][next].val > node[ticket][now].val + cost){\n\tnode[ticket][next].val = node[ticket][now].val + cost;\n\tque.push((P){node[ticket][next].val,next,ticket});\n }\n }\n }\n \n int ans = INF;\n\n for(int i = 0; i < c; i++){\n ans = min(ans,node[i][d].val);\n }\n\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 3036,
"score_of_the_acc": -0.3084,
"final_rank": 14
},
{
"submission_id": "aoj_0212_2140466",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\ntypedef long long int ll;\n\nusing namespace std;\n\nint minimum,min_past_num,num_ticket,num_town,m,start,goal;\n\n\nstruct Info{\n Info(){\n current_town = 0;\n index = 0;\n }\n bool visited[102];\n int current_town,index,costs[102],visited_town[101];\n};\n\nstruct Data{\n\tData(int arg_to,int arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to,cost;\n};\n\nvector<Data> V[101];\n\nvoid func(Info info){\n\n int sum = 0,limit;\n\n if(info.current_town == goal || minimum != 2000000000)\n {\n\n \tlimit = min(num_ticket,info.index);\n\n \tfor(int i = 0; i < limit; i++){\n \t\tsum += info.costs[i]/2;\n \t}\n\n \tfor(int i = limit; i < info.index; i++){\n \t\tsum += info.costs[i];\n \t}\n\n\t\tif(info.current_town == goal){\n\t\t\tminimum = min(minimum,sum);\n\t\t\treturn;\n\t\t}else{\n\t\t\tif(sum >= minimum){\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n }\n\n int calc;\n for(int i = 0; i < V[info.current_town].size(); i++){\n if(info.visited[V[info.current_town][i].to] == false){\n Info new_info;\n for(int k = 1; k <= num_town; k++)new_info.visited[k] = info.visited[k];\n new_info.visited[V[info.current_town][i].to] = true;\n new_info.current_town = V[info.current_town][i].to;\n\n if(info.index == 0 || V[info.current_town][i].cost > info.costs[0]){\n \tnew_info.costs[0] = V[info.current_town][i].cost;\n \tfor(int k = 1; k <= info.index; k++){\n \t\tnew_info.costs[k] = info.costs[k-1];\n \t}\n }else if(V[info.current_town][i].cost <= info.costs[info.index-1]){\n \tfor(int k = 0; k < info.index; k++){\n \t\tnew_info.costs[k] = info.costs[k];\n \t}\n \tnew_info.costs[info.index] = V[info.current_town][i].cost;\n }else{\n \tfor(calc = 0; info.costs[calc] >= V[info.current_town][i].cost;calc++)new_info.costs[calc] = info.costs[calc];\n\t\t\t\tnew_info.costs[calc] = V[info.current_town][i].cost;\n\t\t\t\tcalc++;\n\t\t\t\tfor(;calc-1 < info.index;calc++)new_info.costs[calc] = info.costs[calc-1];\n }\n new_info.index = info.index+1;\n func(new_info);\n\n }\n }\n}\n\nint main(){\n\n int from,to,fee;\n\n while(true){\n scanf(\"%d %d %d %d %d\",&num_ticket,&num_town,&m,&start,&goal);\n if(num_ticket == 0 && num_town == 0 && m == 0 && start == 0 && goal == 0)break;\n\n minimum = 2000000000;\n\n for(int i = 1; i <= num_town; i++)V[i].clear();\n\n for(int i = 0; i < m; i++){\n scanf(\"%d %d %d\",&from,&to,&fee);\n\n V[from].push_back(Data(to,fee));\n V[to].push_back(Data(from,fee));\n }\n\n Info info;\n for(int i = 1; i <= num_town;i++)info.visited[i] = false;\n\n info.current_town = start;\n info.visited[start] = true;\n\n func(info);\n\n printf(\"%d\\n\",minimum);\n }\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 880,
"memory_kb": 2900,
"score_of_the_acc": -1,
"final_rank": 19
}
] |
aoj_0218_cpp
|
クラス分け
会津進学塾では、生徒が塾に入る際に実力テストを行ってクラス分けをします。テストは数学、英語、国語の 3 科目行い、生徒を A,B,C クラスにクラス分けします。A クラスのレベルが一番高く、順に低くなっていきます。
クラス分けの判断は以下の表に基づきます。
条件
クラス
100 点の科目がある
A
数学と英語の平均点が 90 点以上
A
3 科目の平均点が 80 点以上
A
3 科目の平均点が 70 点以上
B
3 科目の平均点が 50 点以上で数学か英語が 80 点以上
B
上の条件を満たさない
C
複数の条件を満たす場合は、よりレベルの高いクラスに分けられます。
生徒の人数
n
(1 ≤
n
≤ 10000)、各生徒の数学の点数
pm
i
(0 ≤
pm
i
≤ 100)、英語の点数
pe
i
(0 ≤
pe
i
≤ 100)、国語の点数
pj
i
(0 ≤
pj
i
≤ 100) を入力とし、各生徒のクラスA,B,C (半角英字) を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
pm
1
pe
1
pj
1
pm
2
pe
2
pj
2
:
pm
n
pe
n
pj
n
入力はすべて整数で与えられます。データセットの数は 1000 を超えません。
Output
入力データセットごとに、各生徒のクラスを順番に出力します。
Sample Input
4
100 70 20
98 86 55
80 34 36
65 79 65
2
99 81 20
66 72 90
0
Output for the Sample Input
A
A
B
C
A
B
|
[
{
"submission_id": "aoj_0218_1947180",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<functional>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<iostream>\nusing namespace std;\nint main(void)\n{\n\tint a,b,c;\n\tint i,j;\n\tint n;\n\twhile(1) {\n\t\tcin >> n;\n\t\tif(n==0)break;\n\t\tfor(i=0;i<n;i++) {\n\t\t\tcin >>a>>b>>c;\n\t\t\tif(a==100 || b==100 || c==100) cout<<\"A\"<<endl;\n\t\t\telse if((a+b)/2>=90) cout<<\"A\"<<endl;\n\t\t\telse if((a+b+c)/3>=80) cout<<\"A\"<<endl;\n\t\t\telse if((a+b+c)/3>=70) cout<<\"B\"<<endl;\n\t\t\telse if((a+b+c)/3>=50 && a>=80 || b>=80) cout<<\"B\"<<endl;\n\t\t\telse cout<<\"C\"<<endl;\n\t\t}\n\t}\n\texit(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0588,
"final_rank": 2
},
{
"submission_id": "aoj_0218_1940119",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(void){\n\n\twhile(1){\n\t\tint n,pm,pe,pj,pme,pmej,k[10000];\n\t\tcin >> n;\n\t\tif(n==0)break;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin >> pm >> pe >> pj;\n\t\t\tpme=(pm+pe)/2;\n\t\t\tpmej=(pm+pe+pj)/3;\n\t\t\tif(pm==100||pe==100||pj==100||pme>=90||pmej>=80)k[i]=1;\n\t\t\telse if(pmej>=70||pmej>=50&&(pm>=80||pe>=80))k[i]=2;\n\t\t\telse k[i]=3;\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(k[i]==1)cout << \"A\" << endl;\n\t\t\telse if(k[i]==2)cout << \"B\" << endl;\n\t\t\telse cout << \"C\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0588,
"final_rank": 2
},
{
"submission_id": "aoj_0218_1785536",
"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\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 1000000007\n#define EPS 1e-10\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\n\nint n;\ndouble a, b, c;\nchar ans;\n\nint main(){\n\twhile (cin >> n&&n){\n\t\tREP(i, n){\n\t\t\tcin >> a >> b >> c;\n\t\t\tif (a == 100 || b == 100 || c == 100 ||\n\t\t\t\t(a + b) / 2 >= 90 || (a + b + c) / 3 >= 80){\n\t\t\t\tans = 'A';\n\t\t\t}\n\t\t\telse if ((a + b + c) / 3 >= 70 \n\t\t\t\t|| ((a >= 80 || b >= 80) && (a + b + c) / 3 >= 50)){\n\t\t\t\tans = 'B';\n\t\t\t}\n\t\t\telse ans = 'C';\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -1,
"final_rank": 7
},
{
"submission_id": "aoj_0218_1719288",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n\tint n,m,e,j;\n\tchar z;\n\twhile(true){\n\tcin>>n;\n\tif(n==0)\n\t\tbreak;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>m>>e>>j;\n\t\tz='C';\n\t\tif(m+e+j>=210)\n\t\t\tz='B';\n\t\tif(m+e+j>=150&&(m>=80||e>=80))\n\t\t\tz='B';\n\t\tif(m==100||e==100||j==100)\n\t\t\tz='A';\n\t\tif(m+e>=180)\n\t\t\tz='A';\n\t\tif(m+e+j>=240)\n\t\t\tz='A';\n\t\tcout<<z<<endl;\n\t}\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0218_1657868",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\twhile(cin >> n && n)\n\t{\n\t\twhile(n--)\n\t\t{\n\t\t\tint a,b,c;\n\t\t\tcin >> a >> b >> c;\n\t\t\tint ava=(a+b+c)/3;\n\n\t\t\tif( a==100 || b==100 || c==100 || (a+b)/2>=90 || ava>=80 )cout<<\"A\"<<endl;\n\t\t\telse if(ava>=70 || ( ava>=50 && (a>=80||b>=80)))cout<<\"B\"<<endl;\t\n\t\t\telse cout << \"C\" << endl;\n\t\t}\n\t}\t\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0588,
"final_rank": 2
},
{
"submission_id": "aoj_0218_1538784",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint main() {\n int n, pm, pe, pj;\n while (true) {\n cin >> n;\n if (n == 0) {\n return 0;\n }\n for (int i = 0; i < n; ++i) {\n cin >> pm >> pe >> pj;\n if ((pm == 100 or pe == 100 or pj == 100) or (pm + pe >= 180)\n or (pm + pe + pj >= 240)) {\n cout << \"A\" << endl;\n } else if ((pm + pe + pj >= 210)\n or (pm + pe + pj >= 150 and (pm >= 80 or pe >= 80))) {\n cout << \"B\" << endl;\n } else {\n cout << \"C\" << endl;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0588,
"final_rank": 2
},
{
"submission_id": "aoj_0218_1446371",
"code_snippet": "#include <cstdio>\n#include <stdio.h>\n#include <iostream>\n#include <iomanip>\n#include <string> \n#include <vector> \nusing namespace std;\n\nint main(){\n\tint n;\n\twhile(cin >> n){\n\tif(n == 0){break;}\n\tint t[100],tt[200],i,ii;\n\tstring ans[1000];\n\ti = 1;\n\tfor(i = 1;n >= i;i++){\n\t\t\t//cout << i << endl;\n\t\t\tcin >> t[1] >> t[2] >> t[3];\n\t\t\ttt[1] = ( t[1] + t[2] ) / 2;\n\t\t\ttt[2] = ( t[1] + t[2] + t[3]) / 3;\n\t\t\tif(t[1] == 100 or t[2] == 100 or t[3] == 100 or tt[1] >= 90 or tt[2] >= 80){\n\t\t\t\tans[i] = \"A\";\n\t\t\t}else if(tt[2] >= 70){\n\t\t\t\tans[i] = \"B\";\n\t\t\t}else if(tt[2] >= 50 and t[1] >= 80 or tt[2] >= 50 and t[2] >= 80){\n\t\t\t\tans[i] = \"B\";\n\t\t\t}else{\n\t\t\t\tans[i] = \"C\";\n\t\t\t}\n\t}\n\tii = 1;\n\t//cout << \"OK\" << endl;\n\tfor(ii = 1;n >= ii;ii++){\n\t\tcout << ans[ii] << endl;\n\t}\n}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1192,
"score_of_the_acc": -0.5882,
"final_rank": 6
}
] |
aoj_0215_cpp
|
パチモンクリーチャー
某国で
大人気のゲーム、パチモンクリーチャーが日本でリメイクされて発売されました。 ゲームが大好きなあなたは、 このゲームを
何度もプレイするうちにどうしたら最速でクリアできるのか考えるようになりました。しかし、いくら考えても最速の攻略方法がわからなかったあなたは、どれだけ早くゲームをクリアできるかを求めるプログラムを作成することにしました。
ゲームの詳細は以下の通りです。
パチモンクリーチャー(以下、パチクリ)という生物が多く存在する世界がゲームの舞台です。各パチクリは、火属性、氷属性、木属性、土属性、水属性の 5 種類の属性のいずれか１つの属性を持ちます。ゲームの主人公は、ゲーム開始時に好きな属性のパチクリ一匹を冒険のパートナーとして選びます。そのパチクリと共にゴールを目指し、ゴールにいるライバルを倒してパチクリマスターになることがゲームの目的です。
しかし、ライバルを倒すためには全属性のパチクリがいないと勝てないので、途中で全属性のパチクリを捕まえなければなりません。パチクリを捕まえるには属性がカギとなります。火属性のパチクリは氷属性のパチクリを捕まえることができ、同様に、氷属性は木属性、木属性は土属性、土属性は水属性、水属性は火属性を捕まえることができます。属性の関連は以下の図のようになります。
以下の図はゲームが行われるマップの一例を表しています。
主人公はパチクリを一匹もってスタート地点である「S」から出発し、一マスずつ移動しながらゴール地点である「G」を目指します。その途中で、最初に持っているパチクリ以外の 4 つの属性のパチクリを捕まえ、ゴール地点であるマス目に移動するとゲーム終了となります。
主人公は、今いるマス目から、辺を共有する隣のマス目に移動することができ、それを一回の移動と数えます。主人公がパチクリのいるマスに移動した場合、そのパチクリを捕まえられる属性のパチクリを持っていればそのパチクリを捕まえたことになります。そのマスにいるパチクリを捕まえられるかの可否にかかわらず、すべてのマスに何度でも移動することができます。
マップの大きさ(横方向の列数、縦方向の行数)とマップの初期状態を入力とし、初めに選んだパチクリの属性と、それ以外の 4 つの属性のパチクリを捕まえるのにかかる、スタート地点からゴール地点に至る最小移動数を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終りはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
W
H
c
11
c
12
...
c
1W
c
21
c
22
...
c
2W
:
c
H1
c
H2
...
c
HW
1 行目にマップの横方向の列数
W
と縦方向の行数
H
(2 ≤
W, H
≤ 1000) が与えられます。続く
H
行にマップの
i
行目の情報が与えられます。入力されるマップには各マスの状態が与えられます。 「S」は主人公のスタート地点を、 「G」はゴール地点を、「1」「2」「3」「4」「5」はそこにいるパチクリの属性を( 1:火属性、 2:氷属性、 3:木属性、 4:土属性、 5:水属性 をそれぞれ表します)、 「.(ピリオド) 」は何もないマスをそれぞれ表します。
各属性のパチクリの数はそれぞれ 0 以上 1000 以下とします。
データセットの数は140 を超えません。また、データセットの 80 % について、
W, H
は100 を超えません。
Output
入力データセットごとに、最初に選んだパチクリの属性と最小移動数を１行に出力します。なお、どのように初めのパチクリを選んでも、どのような経路で移動してもそれら 4 つの属性のパチクリを捕まえることができない場合は NA と出力してください。 また、最小移動数が同じになるような最初のパチクリの選び方が複数ある場合は、属性の数字が小さいものを出力してください。
Sample Input
6 6
S.1..4
3..5..
..4.1.
4....5
.2.32.
5.1..G
3 2
...
S.G
0 0
Output for the Sample Input
2 10
NA
|
[
{
"submission_id": "aoj_0215_10781553",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int W, H;\n while (cin >> W >> H) {\n if (W == 0 && H == 0) break;\n\n vector<string> g(H);\n for (int r = 0; r < H; ++r) cin >> g[r];\n\n int sr = -1, sc = -1, gr = -1, gc = -1;\n int cnt[6] = {0}; // сколько клеток с типом 1..5\n\n for (int r = 0; r < H; ++r)\n for (int c = 0; c < W; ++c) {\n char ch = g[r][c];\n if (ch == 'S') { sr = r; sc = c; }\n else if (ch == 'G') { gr = r; gc = c; }\n else if ('1' <= ch && ch <= '5') cnt[ch - '0']++;\n }\n\n\n int ok = 0;\n for (int t = 1; t <= 5; ++t)\n if (cnt[t] == 0) { ok++; }\n\n if(ok>=2) {\n cout << \"NA\\n\";\n continue;\n }\n int bestStart = -1;\n int bestDist = INT_MAX;\n const int dr[4] = {-1, 1, 0, 0};\n const int dc[4] = {0, 0, -1, 1};\n\n // Перебираем стартовую стихию s = 1..5\n for (int s = 1; s <= 5; ++s) {\n\n\n vector<vector<array<int,5>>> dist(H, vector<array<int,5>>(W));\n for (int r = 0; r < H; ++r)\n for (int c = 0; c < W; ++c)\n for (int k = 0; k < 5; ++k)\n dist[r][c][k] = -1;\n\n queue<tuple<int,int,int>> q;\n dist[sr][sc][0] = 0;\n q.emplace(sr, sc, 0);\n\n int reached = -1;\n\n while (!q.empty()) {\n auto [r, c, k] = q.front(); q.pop();\n\n if (r == gr && c == gc && k == 4) {\n reached = dist[r][c][k];\n break; // BFS: это минимум для данного s\n }\n\n int nextType = ((s - 1 + (k + 1)) % 5) + 1; // 1..5\n\n for (int mv = 0; mv < 4; ++mv) {\n int nr = r + dr[mv], nc = c + dc[mv];\n if (nr < 0 || nr >= H || nc < 0 || nc >= W) continue;\n\n int nk = k;\n char ch = g[nr][nc];\n if (k < 4 && ch >= '1' && ch <= '5') {\n if (ch - '0' == nextType) nk = k + 1;\n }\n\n if (dist[nr][nc][nk] == -1) {\n dist[nr][nc][nk] = dist[r][c][k] + 1;\n q.emplace(nr, nc, nk);\n }\n }\n }\n\n if (reached != -1) {\n if (reached < bestDist || (reached == bestDist && s < bestStart)) {\n bestDist = reached;\n bestStart = s;\n }\n }\n }\n\n \n cout << bestStart << ' ' << bestDist << '\\n';\n \n }\n}",
"accuracy": 1,
"time_ms": 2670,
"memory_kb": 23984,
"score_of_the_acc": -0.9801,
"final_rank": 18
},
{
"submission_id": "aoj_0215_10781535",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int W, H;\n while (cin >> W >> H) {\n if (W == 0 && H == 0) break;\n\n vector<string> g(H);\n for (int r = 0; r < H; ++r) cin >> g[r];\n\n int sr = -1, sc = -1, gr = -1, gc = -1;\n int cnt[6] = {0}; // сколько клеток с типом 1..5\n\n for (int r = 0; r < H; ++r)\n for (int c = 0; c < W; ++c) {\n char ch = g[r][c];\n if (ch == 'S') { sr = r; sc = c; }\n else if (ch == 'G') { gr = r; gc = c; }\n else if ('1' <= ch && ch <= '5') cnt[ch - '0']++;\n }\n\n const int dr[4] = {-1, 1, 0, 0};\n const int dc[4] = {0, 0, -1, 1};\n\n int bestStart = -1;\n int bestDist = INT_MAX;\n int ok = 0;\n for (int t = 1; t <= 5; ++t)\n if (cnt[t] == 0) { ok++; }\n \n if(ok>=2) {\n cout << \"NA\\n\";\n continue;\n }\n // Перебираем стартовую стихию s = 1..5\n for (int s = 1; s <= 5; ++s) {\n \n // Быстрая отсечка: 4 остальные стихи должны присутствовать\n\n // dist[r][c][k], k=0..4 — сколько стихий подряд собрано\n vector<vector<array<int,5>>> dist(H, vector<array<int,5>>(W));\n for (int r = 0; r < H; ++r)\n for (int c = 0; c < W; ++c)\n for (int k = 0; k < 5; ++k)\n dist[r][c][k] = -1;\n\n queue<tuple<int,int,int>> q;\n dist[sr][sc][0] = 0;\n q.emplace(sr, sc, 0);\n\n int reached = -1;\n\n while (!q.empty()) {\n auto [r, c, k] = q.front(); q.pop();\n\n if (r == gr && c == gc && k == 4) {\n reached = dist[r][c][k];\n break; // BFS: это минимум для данного s\n }\n\n int nextType = ((s - 1 + (k + 1)) % 5) + 1; // 1..5\n\n for (int mv = 0; mv < 4; ++mv) {\n int nr = r + dr[mv], nc = c + dc[mv];\n if (nr < 0 || nr >= H || nc < 0 || nc >= W) continue;\n\n int nk = k;\n char ch = g[nr][nc];\n if (k < 4 && ch >= '1' && ch <= '5') {\n if (ch - '0' == nextType) nk = k + 1;\n }\n\n if (dist[nr][nc][nk] == -1) {\n dist[nr][nc][nk] = dist[r][c][k] + 1;\n q.emplace(nr, nc, nk);\n }\n }\n }\n\n if (reached != -1) {\n if (reached < bestDist || (reached == bestDist && s < bestStart)) {\n bestDist = reached;\n bestStart = s;\n }\n }\n }\n\n if (bestStart == -1) {\n cout << \"NA\\n\";\n } else {\n cout << bestStart << ' ' << bestDist << '\\n';\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2620,
"memory_kb": 23996,
"score_of_the_acc": -0.9659,
"final_rank": 16
},
{
"submission_id": "aoj_0215_10781533",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int W, H;\n while (cin >> W >> H) {\n if (W == 0 && H == 0) break;\n\n vector<string> g(H);\n for (int r = 0; r < H; ++r) cin >> g[r];\n\n int sr = -1, sc = -1, gr = -1, gc = -1;\n int cnt[6] = {0}; // сколько клеток с типом 1..5\n\n for (int r = 0; r < H; ++r)\n for (int c = 0; c < W; ++c) {\n char ch = g[r][c];\n if (ch == 'S') { sr = r; sc = c; }\n else if (ch == 'G') { gr = r; gc = c; }\n else if ('1' <= ch && ch <= '5') cnt[ch - '0']++;\n }\n\n const int dr[4] = {-1, 1, 0, 0};\n const int dc[4] = {0, 0, -1, 1};\n\n int bestStart = -1;\n int bestDist = INT_MAX;\n\n // Перебираем стартовую стихию s = 1..5\n for (int s = 1; s <= 5; ++s) {\n // Быстрая отсечка: 4 остальные стихи должны присутствовать\n bool ok = true;\n for (int t = 1; t <= 5; ++t) if (t != s) {\n if (cnt[t] == 0) { ok = false; break; }\n }\n if (!ok) continue;\n\n // dist[r][c][k], k=0..4 — сколько стихий подряд собрано\n vector<vector<array<int,5>>> dist(H, vector<array<int,5>>(W));\n for (int r = 0; r < H; ++r)\n for (int c = 0; c < W; ++c)\n for (int k = 0; k < 5; ++k)\n dist[r][c][k] = -1;\n\n queue<tuple<int,int,int>> q;\n dist[sr][sc][0] = 0;\n q.emplace(sr, sc, 0);\n\n int reached = -1;\n\n while (!q.empty()) {\n auto [r, c, k] = q.front(); q.pop();\n\n if (r == gr && c == gc && k == 4) {\n reached = dist[r][c][k];\n break; // BFS: это минимум для данного s\n }\n\n int nextType = ((s - 1 + (k + 1)) % 5) + 1; // 1..5\n\n for (int mv = 0; mv < 4; ++mv) {\n int nr = r + dr[mv], nc = c + dc[mv];\n if (nr < 0 || nr >= H || nc < 0 || nc >= W) continue;\n\n int nk = k;\n char ch = g[nr][nc];\n if (k < 4 && ch >= '1' && ch <= '5') {\n if (ch - '0' == nextType) nk = k + 1;\n }\n\n if (dist[nr][nc][nk] == -1) {\n dist[nr][nc][nk] = dist[r][c][k] + 1;\n q.emplace(nr, nc, nk);\n }\n }\n }\n\n if (reached != -1) {\n if (reached < bestDist || (reached == bestDist && s < bestStart)) {\n bestDist = reached;\n bestStart = s;\n }\n }\n }\n\n if (bestStart == -1) {\n cout << \"NA\\n\";\n } else {\n cout << bestStart << ' ' << bestDist << '\\n';\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2630,
"memory_kb": 24052,
"score_of_the_acc": -0.9696,
"final_rank": 17
},
{
"submission_id": "aoj_0215_10780113",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int W, H;\n while (cin >> W >> H) {\n if (W == 0 && H == 0) break;\n\n vector<string> grid(H);\n for (int r = 0; r < H; ++r) cin >> grid[r];\n\n int sr = -1, sc = -1, gr = -1, gc = -1;\n array<int, 6> cnt{}; // счётчики типов 1..5\n for (int r = 0; r < H; ++r) {\n for (int c = 0; c < W; ++c) {\n char ch = grid[r][c];\n if (ch == 'S') { sr = r; sc = c; }\n else if (ch == 'G') { gr = r; gc = c; }\n else if (ch >= '1' && ch <= '5') cnt[ch - '0']++;\n }\n }\n\n auto inside = [&](int r, int c) -> bool {\n return 0 <= r && r < H && 0 <= c && c < W;\n };\n const int N = W * H; // клеток на слой\n const int LAYERS = 5; // k = 0..4 (сколько стихий собрано)\n auto enc = [&](int r, int c, int k) -> int { return k * N + r * W + c; };\n\n const int dr[4] = {-1, 1, 0, 0};\n const int dc[4] = {0, 0, -1, 1};\n\n long long bestDist = LLONG_MAX;\n int bestStart = -1;\n\n for (int s = 1; s <= 5; ++s) {\n // Быстрая отсечка: все 4 остальные стихии должны присутствовать\n bool ok = true;\n for (int t = 1; t <= 5; ++t) if (t != s) {\n if (cnt[t] == 0) { ok = false; break; }\n }\n if (!ok) continue;\n\n vector<int> dist(LAYERS * N, -1);\n queue<int> q;\n\n int start = enc(sr, sc, 0);\n dist[start] = 0;\n q.push(start);\n\n int reachedDist = -1;\n\n while (!q.empty()) {\n int idx = q.front(); q.pop();\n int k = idx / N;\n int rc = idx % N;\n int r = rc / W;\n int c = rc % W;\n\n if (r == gr && c == gc && k == 4) {\n reachedDist = dist[idx];\n break; // BFS обеспечивает минимум\n }\n\n int nextType = ((s - 1 + k + 1) % 5) + 1; // следующая требуемая стихия (1..5)\n\n for (int mv = 0; mv < 4; ++mv) {\n int nr = r + dr[mv], nc = c + dc[mv];\n if (!inside(nr, nc)) continue;\n\n int nk = k;\n char ch = grid[nr][nc];\n if (k < 4 && ch >= '1' && ch <= '5') {\n int t = ch - '0';\n if (t == nextType) nk = k + 1; // поймали следующую стихию\n }\n\n int nidx = enc(nr, nc, nk);\n if (dist[nidx] == -1) {\n dist[nidx] = dist[idx] + 1;\n q.push(nidx);\n }\n }\n }\n\n if (reachedDist != -1) {\n if (reachedDist < bestDist || (reachedDist == bestDist && s < bestStart)) {\n bestDist = reachedDist;\n bestStart = s;\n }\n }\n }\n\n if (bestStart == -1) {\n cout << \"NA\\n\";\n } else {\n cout << bestStart << ' ' << bestDist << '\\n';\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 3630,
"memory_kb": 53072,
"score_of_the_acc": -1.6664,
"final_rank": 19
},
{
"submission_id": "aoj_0215_10779271",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct FastQueue {\n // очередь индексов (int), без накладных расходов std::queue\n vector<int> data;\n size_t head = 0;\n void clear() { data.clear(); head = 0; }\n bool empty() const { return head >= data.size(); }\n void push(int x) { data.push_back(x); }\n int pop() { return data[head++]; }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int W, H;\n while ( (cin >> W >> H) ) {\n if (W == 0 && H == 0) break;\n\n vector<string> grid(H);\n for (int r = 0; r < H; ++r) cin >> grid[r];\n\n int sr = -1, sc = -1, gr = -1, gc = -1;\n array<int,6> cnt{}; // сколько клеток с типом 1..5\n for (int r = 0; r < H; ++r)\n for (int c = 0; c < W; ++c) {\n char ch = grid[r][c];\n if (ch == 'S') { sr = r; sc = c; }\n else if (ch == 'G') { gr = r; gc = c; }\n else if ('1' <= ch && ch <= '5') cnt[ch - '0']++;\n }\n\n auto inside = [&](int r, int c)->bool {\n return 0 <= r && r < H && 0 <= c && c < W;\n };\n const int N = W * H;\n const int LAYERS = 5; // k = 0..4\n\n // Кодирование состояния: idx = k*N + r*W + c\n auto enc = [&](int r, int c, int k)->int { return k * N + r * W + c; };\n\n // движение по сторонам\n const int dr[4] = {-1, 1, 0, 0};\n const int dc[4] = {0, 0, -1, 1};\n\n long long bestDist = LLONG_MAX;\n int bestStart = -1;\n\n // пробуем все стартовые стихии s = 1..5\n for (int s = 1; s <= 5; ++s) {\n // Быстрая проверка: 4 остальные стихии должны существовать на карте\n bool okCounts = true;\n for (int t = 1; t <= 5; ++t) if (t != s) {\n if (cnt[t] == 0) { okCounts = false; break; }\n }\n if (!okCounts) continue;\n\n // dist: -1 = не посещено; иначе число ходов\n vector<int> dist(LAYERS * N, -1);\n FastQueue q; q.clear();\n\n int startIdx = enc(sr, sc, 0);\n dist[startIdx] = 0;\n q.push(startIdx);\n\n int targetIdxDist = -1;\n\n while (!q.empty()) {\n int idx = q.pop();\n int k = idx / N;\n int rem = idx % N;\n int r = rem / W;\n int c = rem % W;\n\n if (r == gr && c == gc && k == 4) {\n targetIdxDist = dist[idx];\n break; // BFS гарантирует минимум\n }\n\n int nextType = ((s - 1 + k + 1) % 5) + 1; // 1..5\n\n for (int mv = 0; mv < 4; ++mv) {\n int nr = r + dr[mv], nc = c + dc[mv];\n if (!inside(nr, nc)) continue;\n char ch = grid[nr][nc];\n\n int nk = k;\n if (k < 4 && ch >= '1' && ch <= '5') {\n int t = ch - '0';\n if (t == nextType) nk = k + 1; // поймали «следующую» стихию\n }\n int nidx = enc(nr, nc, nk);\n if (dist[nidx] == -1) {\n dist[nidx] = dist[idx] + 1;\n q.push(nidx);\n }\n }\n }\n\n if (targetIdxDist != -1) {\n if (targetIdxDist < bestDist || (targetIdxDist == bestDist && s < bestStart)) {\n bestDist = targetIdxDist;\n bestStart = s;\n }\n }\n }\n\n if (bestStart == -1) {\n cout << \"NA\\n\";\n } else {\n cout << bestStart << \" \" << bestDist << \"\\n\";\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 3750,
"memory_kb": 74308,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0215_6979056",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int w, h;\n while(cin >> w >> h, h){\n vector<string> A(h);\n int sy, sx, gy, gx, y1, x1, y2, x2, p = -1;\n deque<vector<pair<int,int>>> dq(5);\n for(int y = 0; y < h; y++){\n cin >> A[y];\n for(int x = 0; x < w; x++){\n if(A[y][x] == 'S')sy = y, sx = x;\n if(A[y][x] == 'G')gy = y, gx = x;\n if(A[y][x] >= '1' && A[y][x] <= '5'){\n dq[A[y][x] - '1'].emplace_back(y, x);\n }\n }\n }\n int ans = 1 << 30, d;\n for(int i = 0; i < 5; i++){\n vector<vector<int>> dp(5);\n for(int j = 0; j < 5; j++)dp[j].resize(dq[j].size(), 1 << 30);\n for(int j = 0; j < dq[1].size(); j++){\n tie(y1, x1) = dq[1][j];\n dp[1][j] = abs(y1 - sy) + abs(x1 - sx);\n }\n for(int j = 1; j < 4; j++){\n for(int k = 0; k < dp[j].size(); k++){\n tie(y1, x1) = dq[j][k];\n for(int l = 0; l < dp[j + 1].size(); l++){\n tie(y2, x2) = dq[j + 1][l];\n dp[j + 1][l] = min(dp[j + 1][l], dp[j][k] + abs(y2 - y1) + abs(x2 - x1));\n }\n }\n }\n d = 1 << 30;\n for(int j = 0; j < dp[4].size(); j++){\n tie(y1, x1) = dq[4][j];\n d = min(d, dp[4][j] + abs(y1 - gy) + abs(x1 - gx));\n }\n if(d < ans){\n ans = d;\n p = i + 1;\n }\n dq.push_back(dq.front());\n dq.pop_front();\n }\n if(p == -1)cout << \"NA\" << '\\n';\n else cout << p << \" \" << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 4428,
"score_of_the_acc": -0.016,
"final_rank": 1
},
{
"submission_id": "aoj_0215_6354400",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst unsigned int inf = 0xffffffff;\n\nclass PcInfo {\npublic:\n\tint x;\n\tint y;\n\tunsigned int num_moves;\n\npublic:\n\tPcInfo() : x(-1), y(-1), num_moves(inf) {\n\t}\n\n\t~PcInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint width = -1;\n\t\tint height = -1;\n\t\tconst int num_pc = 5;\n\t\tint start_x = -1;\n\t\tint start_y = -1;\n\t\tint goal_x = -1;\n\t\tint goal_y = -1;\n\t\tint num_absent_pc = 0;\n\t\tunsigned int min_num_moves = inf;\n\t\tint min_num_moves_idx = -1;\n\t\tvector<vector<PcInfo>> pc_infos(num_pc);\n\t\tvector<int> init_pc_idx_vec;\n\t\tstring buf;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tcin >> buf;\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif ('1' <= buf[x] && buf[x] <= '5') {\n\t\t\t\t\tPcInfo pc_info;\n\t\t\t\t\tint pc_idx = buf[x] - '1';\n\n\t\t\t\t\tpc_info.x = x;\n\t\t\t\t\tpc_info.y = y;\n\t\t\t\t\tpc_infos[pc_idx].push_back(pc_info);\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == '.') {\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == 'S') {\n\t\t\t\t\tstart_x = x;\n\t\t\t\t\tstart_y = y;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tgoal_x = x;\n\t\t\t\t\tgoal_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\tif (pc_infos[i].empty()) {\n\t\t\t\tnum_absent_pc++;\n\t\t\t}\n\t\t}\n\n\t\tif (num_absent_pc >= 2) {\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (num_absent_pc == 1) {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tif (pc_infos[i].empty()) {\n\t\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\tfor (int& init_pc_idx : init_pc_idx_vec) {\n\t\t\tint next_pc_idx = (init_pc_idx + 1) % num_pc;\n\t\t\tint last_pc_idx = (init_pc_idx + num_pc - 1) % num_pc;\n\t\t\tunsigned int total_moves = inf;\n\t\t\tvector<PcInfo>& next_pc_info_vec = pc_infos[next_pc_idx];\n\n\t\t\tfor (vector<PcInfo>& tmp_pc_info_vec : pc_infos) {\n\t\t\t\tfor (PcInfo& pc_info : tmp_pc_info_vec) {\n\t\t\t\t\tpc_info.num_moves = inf;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (PcInfo& next_pc_info : next_pc_info_vec) {\n\t\t\t\tnext_pc_info.num_moves = abs(next_pc_info.x - start_x) + abs(next_pc_info.y - start_y);\n\t\t\t}\n\n\t\t\tfor (int i = 1; i < num_pc; i++) {\n\t\t\t\tint cur_pc_idx = (init_pc_idx + i) % num_pc;\n\t\t\t\tint next_pc_idx = (cur_pc_idx + 1) % num_pc;\n\n\t\t\t\tfor (PcInfo& cur_pc_info : pc_infos[cur_pc_idx]) {\n\t\t\t\t\tfor (PcInfo& next_pc_info : pc_infos[next_pc_idx]) {\n\t\t\t\t\t\tunsigned int num_moves = cur_pc_info.num_moves + abs(next_pc_info.x - cur_pc_info.x) + abs(next_pc_info.y - cur_pc_info.y);\n\n\t\t\t\t\t\tif (next_pc_info.num_moves > num_moves) {\n\t\t\t\t\t\t\tnext_pc_info.num_moves = num_moves;\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 (PcInfo& pc_info : pc_infos[last_pc_idx]) {\n\t\t\t\tunsigned int num_moves = pc_info.num_moves + abs(goal_x - pc_info.x) + abs(goal_y - pc_info.y);\n\n\t\t\t\tif (total_moves > num_moves) {\n\t\t\t\t\ttotal_moves = num_moves;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (min_num_moves > total_moves) {\n\t\t\t\tmin_num_moves = total_moves;\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t\telse if (min_num_moves == total_moves && min_num_moves_idx > init_pc_idx) {\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t}\n\t\tcout << min_num_moves_idx + 1 << \" \" << min_num_moves << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 3292,
"score_of_the_acc": -0.0663,
"final_rank": 4
},
{
"submission_id": "aoj_0215_6354388",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst unsigned int inf = 0xffffffff;\n\nclass PcInfo {\npublic:\n\tint x;\n\tint y;\n\tunsigned int num_moves;\n\npublic:\n\tPcInfo() : x(-1), y(-1), num_moves(inf) {\n\t}\n\n\t~PcInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint width = -1;\n\t\tint height = -1;\n\t\tconst int num_pc = 5;\n\t\tint start_x = -1;\n\t\tint start_y = -1;\n\t\tint goal_x = -1;\n\t\tint goal_y = -1;\n\t\tint num_absent_pc = 0;\n\t\tunsigned int min_num_moves = inf;\n\t\tint min_num_moves_idx = -1;\n\t\tvector<vector<PcInfo>> pc_infos(num_pc);\n\t\tvector<int> init_pc_idx_vec;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tstring buf;\n\n\t\t\tcin >> buf;\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif ('1' <= buf[x] && buf[x] <= '5') {\n\t\t\t\t\tPcInfo pc_info;\n\t\t\t\t\tint pc_idx = buf[x] - '1';\n\n\t\t\t\t\tpc_info.x = x;\n\t\t\t\t\tpc_info.y = y;\n\t\t\t\t\tpc_infos[pc_idx].push_back(pc_info);\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == '.') {\n\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == 'S') {\n\t\t\t\t\tstart_x = x;\n\t\t\t\t\tstart_y = y;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tgoal_x = x;\n\t\t\t\t\tgoal_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\tif (pc_infos[i].empty()) {\n\t\t\t\tnum_absent_pc++;\n\t\t\t}\n\t\t}\n\n\t\tif (num_absent_pc >= 2) {\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (num_absent_pc == 1) {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tif (pc_infos[i].empty()) {\n\t\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\tfor (int& init_pc_idx : init_pc_idx_vec) {\n\t\t\tint next_pc_idx = (init_pc_idx + 1) % num_pc;\n\t\t\tint last_pc_idx = (init_pc_idx + num_pc - 1) % num_pc;\n\t\t\tunsigned int total_moves = inf;\n\t\t\tvector<PcInfo>& next_pc_info_vec = pc_infos[next_pc_idx];\n\n\t\t\tfor (vector<PcInfo>& tmp_pc_info_vec : pc_infos) {\n\t\t\t\tfor (PcInfo& pc_info : tmp_pc_info_vec) {\n\t\t\t\t\tpc_info.num_moves = inf;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (PcInfo& next_pc_info : next_pc_info_vec) {\n\t\t\t\tnext_pc_info.num_moves = abs(next_pc_info.x - start_x) + abs(next_pc_info.y - start_y);\n\t\t\t}\n\n\t\t\tfor (int i = 1; i < num_pc; i++) {\n\t\t\t\tint cur_pc_idx = (init_pc_idx + i) % num_pc;\n\t\t\t\tint next_pc_idx = (cur_pc_idx + 1) % num_pc;\n\n\t\t\t\tfor (PcInfo& cur_pc_info : pc_infos[cur_pc_idx]) {\n\t\t\t\t\tfor (PcInfo& next_pc_info : pc_infos[next_pc_idx]) {\n\t\t\t\t\t\tunsigned int num_moves = cur_pc_info.num_moves + abs(next_pc_info.x - cur_pc_info.x) + abs(next_pc_info.y - cur_pc_info.y);\n\n\t\t\t\t\t\tif (next_pc_info.num_moves > num_moves) {\n\t\t\t\t\t\t\tnext_pc_info.num_moves = num_moves;\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 (PcInfo& pc_info : pc_infos[last_pc_idx]) {\n\t\t\t\tunsigned int num_moves = pc_info.num_moves + abs(goal_x - pc_info.x) + abs(goal_y - pc_info.y);\n\n\t\t\t\tif (total_moves > num_moves) {\n\t\t\t\t\ttotal_moves = num_moves;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (min_num_moves > total_moves) {\n\t\t\t\tmin_num_moves = total_moves;\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t\telse if (min_num_moves == total_moves && min_num_moves_idx > init_pc_idx) {\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t}\n\t\tcout << min_num_moves_idx + 1 << \" \" << min_num_moves << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 3364,
"score_of_the_acc": -0.0673,
"final_rank": 5
},
{
"submission_id": "aoj_0215_6354386",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst unsigned int inf = 0xffffffff;\n\nclass PcInfo {\npublic:\n\tint x;\n\tint y;\n\tunsigned int num_moves;\n\npublic:\n\tPcInfo() : x(-1), y(-1), num_moves(inf) {\n\t}\n\n\t~PcInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint width = -1;\n\tint height = -1;\n\tconst int num_pc = 5;\n\tint start_x = -1;\n\tint start_y = -1;\n\tint goal_x = -1;\n\tint goal_y = -1;\n\n\twhile (true) {\n\t\tint num_absent_pc = 0;\n\t\tunsigned int min_num_moves = inf;\n\t\tint min_num_moves_idx = -1;\n\t\tvector<vector<PcInfo>> pc_infos(num_pc);\n\t\tvector<int> init_pc_idx_vec;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tstring buf;\n\n\t\t\tcin >> buf;\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif ('1' <= buf[x] && buf[x] <= '5') {\n\t\t\t\t\tPcInfo pc_info;\n\t\t\t\t\tint pc_idx = buf[x] - '1';\n\n\t\t\t\t\tpc_info.x = x;\n\t\t\t\t\tpc_info.y = y;\n\t\t\t\t\tpc_infos[pc_idx].push_back(pc_info);\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == '.') {\n\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == 'S') {\n\t\t\t\t\tstart_x = x;\n\t\t\t\t\tstart_y = y;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tgoal_x = x;\n\t\t\t\t\tgoal_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\tif (pc_infos[i].empty()) {\n\t\t\t\tnum_absent_pc++;\n\t\t\t}\n\t\t}\n\n\t\tif (num_absent_pc >= 2) {\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (num_absent_pc == 1) {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tif (pc_infos[i].empty()) {\n\t\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\tfor (int& init_pc_idx : init_pc_idx_vec) {\n\t\t\tint next_pc_idx = (init_pc_idx + 1) % num_pc;\n\t\t\tint last_pc_idx = (init_pc_idx + num_pc - 1) % num_pc;\n\t\t\tunsigned int total_moves = inf;\n\t\t\tvector<PcInfo>& next_pc_info_vec = pc_infos[next_pc_idx];\n\n\t\t\tfor (vector<PcInfo>& tmp_pc_info_vec : pc_infos) {\n\t\t\t\tfor (PcInfo& pc_info : tmp_pc_info_vec) {\n\t\t\t\t\tpc_info.num_moves = inf;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (PcInfo& next_pc_info : next_pc_info_vec) {\n\t\t\t\tnext_pc_info.num_moves = abs(next_pc_info.x - start_x) + abs(next_pc_info.y - start_y);\n\t\t\t}\n\n\t\t\tfor (int i = 1; i < num_pc; i++) {\n\t\t\t\tint cur_pc_idx = (init_pc_idx + i) % num_pc;\n\t\t\t\tint next_pc_idx = (cur_pc_idx + 1) % num_pc;\n\n\t\t\t\tfor (PcInfo& cur_pc_info : pc_infos[cur_pc_idx]) {\n\t\t\t\t\tfor (PcInfo& next_pc_info : pc_infos[next_pc_idx]) {\n\t\t\t\t\t\tunsigned int num_moves = cur_pc_info.num_moves + abs(next_pc_info.x - cur_pc_info.x) + abs(next_pc_info.y - cur_pc_info.y);\n\n\t\t\t\t\t\tif (next_pc_info.num_moves > num_moves) {\n\t\t\t\t\t\t\tnext_pc_info.num_moves = num_moves;\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 (PcInfo& pc_info : pc_infos[last_pc_idx]) {\n\t\t\t\tunsigned int num_moves = pc_info.num_moves + abs(goal_x - pc_info.x) + abs(goal_y - pc_info.y);\n\n\t\t\t\tif (total_moves > num_moves) {\n\t\t\t\t\ttotal_moves = num_moves;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (min_num_moves > total_moves) {\n\t\t\t\tmin_num_moves = total_moves;\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t\telse if (min_num_moves == total_moves && min_num_moves_idx > init_pc_idx) {\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t}\n\t\tcout << min_num_moves_idx + 1 << \" \" << min_num_moves << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 3420,
"score_of_the_acc": -0.071,
"final_rank": 6
},
{
"submission_id": "aoj_0215_6354376",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst unsigned int inf = 0xffffffff;\n\nclass PcInfo {\npublic:\n\tint x;\n\tint y;\n\tunsigned int num_moves;\n\npublic:\n\tPcInfo() : x(-1), y(-1), num_moves(inf) {\n\t}\n\n\t~PcInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint width = -1;\n\t\tint height = -1;\n\t\tconst int num_pc = 5;\n\t\tint start_x = -1;\n\t\tint start_y = -1;\n\t\tint goal_x = -1;\n\t\tint goal_y = -1;\n\t\tint num_absent_pc = 0;\n\t\tunsigned int min_num_moves = inf;\n\t\tint min_num_moves_idx = -1;\n\t\tvector<vector<PcInfo>> pc_info_vec(num_pc);\n\t\tvector<int> init_pc_idx_vec;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tstring buf;\n\n\t\t\tcin >> buf;\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif ('1' <= buf[x] && buf[x] <= '5') {\n\t\t\t\t\tPcInfo pc_info;\n\t\t\t\t\tint pc_idx = buf[x] - '1';\n\n\t\t\t\t\tpc_info.x = x;\n\t\t\t\t\tpc_info.y = y;\n\t\t\t\t\tpc_info_vec[pc_idx].push_back(pc_info);\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == '.') {\n\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == 'S') {\n\t\t\t\t\tstart_x = x;\n\t\t\t\t\tstart_y = y;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tgoal_x = x;\n\t\t\t\t\tgoal_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\tif (pc_info_vec[i].empty()) {\n\t\t\t\tnum_absent_pc++;\n\t\t\t}\n\t\t}\n\n\t\tif (num_absent_pc >= 2) {\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (num_absent_pc == 1) {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tif (pc_info_vec[i].empty()) {\n\t\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\tfor (int &init_pc_idx: init_pc_idx_vec) {\n\t\t\tint next_pc_idx = (init_pc_idx + 1) % num_pc;\n\t\t\tint last_pc_idx = (init_pc_idx + num_pc - 1) % num_pc;\n\t\t\tunsigned int total_moves = inf;\n\t\t\tvector<PcInfo>& next_pc_info_vec = pc_info_vec[next_pc_idx];\n\n\t\t\tfor (vector<PcInfo> &tmp_pc_info_vec: pc_info_vec) {\n\t\t\t\tfor (PcInfo &pc_info: tmp_pc_info_vec) {\n\t\t\t\t\tpc_info.num_moves = inf;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (PcInfo& next_pc_info: next_pc_info_vec) {\n\t\t\t\tnext_pc_info.num_moves = abs(next_pc_info.x - start_x) + abs(next_pc_info.y - start_y);\n\t\t\t}\n\n\t\t\tfor (int i = 1; i < num_pc; i++) {\n\t\t\t\tint cur_pc_idx = (init_pc_idx + i) % num_pc;\n\t\t\t\tint next_pc_idx = (cur_pc_idx + 1) % num_pc;\n\n\t\t\t\tfor (PcInfo& cur_pc_info: pc_info_vec[cur_pc_idx]) {\n\t\t\t\t\tfor (PcInfo& next_pc_info: pc_info_vec[next_pc_idx]) {\n\t\t\t\t\t\tunsigned int num_moves = cur_pc_info.num_moves + abs(next_pc_info.x - cur_pc_info.x) + abs(next_pc_info.y - cur_pc_info.y);\n\n\t\t\t\t\t\tif (next_pc_info.num_moves > num_moves) {\n\t\t\t\t\t\t\tnext_pc_info.num_moves = num_moves;\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 (PcInfo& pc_info: pc_info_vec[last_pc_idx]) {\n\t\t\t\tunsigned int num_moves = pc_info.num_moves + abs(goal_x - pc_info.x) + abs(goal_y - pc_info.y);\n\n\t\t\t\tif (total_moves > num_moves) {\n\t\t\t\t\ttotal_moves = num_moves;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (min_num_moves > total_moves) {\n\t\t\t\tmin_num_moves = total_moves;\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t\telse if (min_num_moves == total_moves && min_num_moves_idx > init_pc_idx) {\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t}\n\t\tcout << min_num_moves_idx + 1 << \" \" << min_num_moves << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 3440,
"score_of_the_acc": -0.0712,
"final_rank": 7
},
{
"submission_id": "aoj_0215_6354342",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst unsigned int inf = 0xffffffff;\n\nclass PcInfo {\npublic:\n\tint x;\n\tint y;\n\tunsigned int num_moves;\n\npublic:\n\tPcInfo() : x(-1), y(-1), num_moves(inf) {\n\t}\n\n\t~PcInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint width = -1;\n\t\tint height = -1;\n\t\tconst int num_pc = 5;\n\t\tint start_x = -1;\n\t\tint start_y = -1;\n\t\tint goal_x = -1;\n\t\tint goal_y = -1;\n\t\tint num_exists_pc = 0;\n\t\tunsigned int min_num_moves = inf;\n\t\tint min_num_moves_idx = -1;\n\t\tvector<vector<PcInfo>> pc_info_vec(num_pc);\n\t\tvector<int> init_pc_idx_vec;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tstring buf;\n\n\t\t\tcin >> buf;\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif ('1' <= buf[x] && buf[x] <= '5') {\n\t\t\t\t\tPcInfo pc_info;\n\t\t\t\t\tint pc_idx = buf[x] - '1';\n\n\t\t\t\t\tpc_info.x = x;\n\t\t\t\t\tpc_info.y = y;\n\t\t\t\t\tpc_info_vec[pc_idx].push_back(pc_info);\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == '.') {\n\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == 'S') {\n\t\t\t\t\tstart_x = x;\n\t\t\t\t\tstart_y = y;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tgoal_x = x;\n\t\t\t\t\tgoal_y = y;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\tif (!pc_info_vec[i].empty()) {\n\t\t\t\tnum_exists_pc++;\n\t\t\t}\n\t\t}\n\n\t\tif (num_pc - num_exists_pc >= 2) {\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (num_pc - num_exists_pc == 1) {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tif (pc_info_vec[i].empty()) {\n\t\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < init_pc_idx_vec.size(); i++) {\n\t\t\tint init_pc_idx = init_pc_idx_vec[i];\n\t\t\tint next_pc_idx = (init_pc_idx + 1) % num_pc;\n\t\t\tint last_pc_idx = (init_pc_idx + num_pc - 1) % num_pc;\n\t\t\tunsigned int total_moves = inf;\n\t\t\tvector<PcInfo>& next_pc_info_vec = pc_info_vec[next_pc_idx];\n\n\t\t\tfor (int j = 0; j < num_pc; j++) {\n\t\t\t\tfor (int k = 0; k < pc_info_vec[j].size(); k++) {\n\t\t\t\t\tpc_info_vec[j][k].num_moves = inf;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int j = 0; j < next_pc_info_vec.size(); j++) {\n\t\t\t\tPcInfo& next_pc_info = next_pc_info_vec[j];\n\n\t\t\t\tnext_pc_info.num_moves = abs(next_pc_info.x - start_x) + abs(next_pc_info.y - start_y);\n\t\t\t}\n\n\t\t\tfor (int j = 1; j < num_pc; j++) {\n\t\t\t\tint cur_pc_idx = (init_pc_idx + j) % num_pc;\n\t\t\t\tint next_pc_idx = (cur_pc_idx + 1) % num_pc;\n\n\t\t\t\tfor (int k = 0; k < pc_info_vec[cur_pc_idx].size(); k++) {\n\t\t\t\t\tPcInfo& cur_pc_info = pc_info_vec[cur_pc_idx][k];\n\n\t\t\t\t\tfor (int l = 0; l < pc_info_vec[next_pc_idx].size(); l++) {\n\t\t\t\t\t\tPcInfo& next_pc_info = pc_info_vec[next_pc_idx][l];\n\t\t\t\t\t\tunsigned int num_moves = cur_pc_info.num_moves + abs(next_pc_info.x - cur_pc_info.x) + abs(next_pc_info.y - cur_pc_info.y);\n\n\t\t\t\t\t\tif (next_pc_info.num_moves > num_moves) {\n\t\t\t\t\t\t\tnext_pc_info.num_moves = num_moves;\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 j = 0; j < pc_info_vec[last_pc_idx].size(); j++) {\n\t\t\t\tPcInfo& pc_info = pc_info_vec[last_pc_idx][j];\n\t\t\t\tunsigned int num_moves = pc_info.num_moves + abs(goal_x - pc_info.x) + abs(goal_y - pc_info.y);\n\n\t\t\t\tif (total_moves > num_moves) {\n\t\t\t\t\ttotal_moves = num_moves;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (min_num_moves > total_moves) {\n\t\t\t\tmin_num_moves = total_moves;\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t\telse if (min_num_moves == total_moves && min_num_moves_idx > init_pc_idx) {\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t}\n\t\tcout << min_num_moves_idx + 1 << \" \" << min_num_moves << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 3540,
"score_of_the_acc": -0.0554,
"final_rank": 3
},
{
"submission_id": "aoj_0215_6353710",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\nconst ll inf = 0xffffffff;\n\nclass PcInfo {\npublic:\n\tint x;\n\tint y;\n\tll num_moves;\n\npublic:\n\tPcInfo() : x(-1), y(-1), num_moves(inf) {\n\t}\n\n\t~PcInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint width = -1;\n\t\tint height = -1;\n\t\tconst int num_pc = 5;\n\t\tint start_x = -1;\n\t\tint start_y = -1;\n\t\tint goal_x = -1;\n\t\tint goal_y = -1;\n\t\tint num_exists_pc = 0;\n\t\tll min_num_moves = inf;\n\t\tint min_num_moves_idx = -1;\n\t\tvector<vector<PcInfo>> pc_info_vec(num_pc);\n\t\tvector<int> init_pc_idx_vec;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tstring buf;\n\n\t\t\tcin >> buf;\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif ('1' <= buf[x] && buf[x] <= '5') {\n\t\t\t\t\tPcInfo pc_info;\n\t\t\t\t\tint pc_idx = buf[x] - '1';\n\n\t\t\t\t\tpc_info.x = x;\n\t\t\t\t\tpc_info.y = y;\n\t\t\t\t\tpc_info_vec[pc_idx].push_back(pc_info);\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == '.') {\n\n\t\t\t\t}\n\t\t\t\telse if (buf[x] == 'S') {\n\t\t\t\t\tstart_x = x;\n\t\t\t\t\tstart_y = y;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tgoal_x = x;\n\t\t\t\t\tgoal_y = y;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\tif (!pc_info_vec[i].empty()) {\n\t\t\t\tnum_exists_pc++;\n\t\t\t}\n\t\t}\n\n\t\tif (num_pc - num_exists_pc >= 2) {\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (num_pc - num_exists_pc == 1) {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tif (pc_info_vec[i].empty()) {\n\t\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < num_pc; i++) {\n\t\t\t\tinit_pc_idx_vec.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < init_pc_idx_vec.size(); i++) {\n\t\t\tint init_pc_idx = init_pc_idx_vec[i];\n\t\t\tint next_pc_idx = (init_pc_idx + 1) % num_pc;\n\t\t\tint last_pc_idx = (init_pc_idx + num_pc - 1) % num_pc;\n\t\t\tll total_moves = inf;\n\t\t\tvector<PcInfo>& next_pc_info_vec = pc_info_vec[next_pc_idx];\n\n\t\t\tfor (int j = 0; j < num_pc; j++) {\n\t\t\t\tfor (int k = 0; k < pc_info_vec[j].size(); k++) {\n\t\t\t\t\tpc_info_vec[j][k].num_moves = inf;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int j = 0; j < next_pc_info_vec.size(); j++) {\n\t\t\t\tPcInfo& next_pc_info = next_pc_info_vec[j];\n\n\t\t\t\tnext_pc_info.num_moves = abs(next_pc_info.x - start_x) + abs(next_pc_info.y - start_y);\n\t\t\t}\n\n\t\t\tfor (int j = 1; j < num_pc; j++) {\n\t\t\t\tint cur_pc_idx = (init_pc_idx + j) % num_pc;\n\t\t\t\tint next_pc_idx = (cur_pc_idx + 1) % num_pc;\n\n\t\t\t\tfor (int k = 0; k < pc_info_vec[cur_pc_idx].size(); k++) {\n\t\t\t\t\tPcInfo& cur_pc_info = pc_info_vec[cur_pc_idx][k];\n\n\t\t\t\t\tfor (int l = 0; l < pc_info_vec[next_pc_idx].size(); l++) {\n\t\t\t\t\t\tPcInfo& next_pc_info = pc_info_vec[next_pc_idx][l];\n\t\t\t\t\t\tll num_moves = cur_pc_info.num_moves + abs(next_pc_info.x - cur_pc_info.x) + abs(next_pc_info.y - cur_pc_info.y);\n\n\t\t\t\t\t\tif (next_pc_info.num_moves > num_moves) {\n\t\t\t\t\t\t\tnext_pc_info.num_moves = num_moves;\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 j = 0; j < pc_info_vec[last_pc_idx].size(); j++) {\n\t\t\t\tPcInfo& pc_info = pc_info_vec[last_pc_idx][j];\n\t\t\t\tll num_moves = pc_info.num_moves + abs(goal_x - pc_info.x) + abs(goal_y - pc_info.y);\n\n\t\t\t\tif (total_moves > num_moves) {\n\t\t\t\t\ttotal_moves = num_moves;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (min_num_moves > total_moves) {\n\t\t\t\tmin_num_moves = total_moves;\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t\telse if (min_num_moves == total_moves && min_num_moves_idx > init_pc_idx) {\n\t\t\t\tmin_num_moves_idx = init_pc_idx;\n\t\t\t}\n\t\t}\n\t\tcout << min_num_moves_idx + 1 << \" \" << min_num_moves << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 3492,
"score_of_the_acc": -0.0547,
"final_rank": 2
},
{
"submission_id": "aoj_0215_5210424",
"code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <vector>\n#include <set>\n#include <unordered_set>\n#include <algorithm>\n#include <cmath>\n#include <cstdlib>\nusing namespace std;\n#define INF 1000010\n\npair<int,int> get(int W, int H, char** c);\n\nstruct Pachimon {\n int x;\n int y;\n int dist;\n bool operator==(const Pachimon &p) const {\n return x==p.x and y==p.y and dist==p.dist;\n }\n bool operator<(const Pachimon &p) const {\n if(x<p.x) return true;\n else if(x>p.x) return false;\n else if(y<p.y) return true;\n else if(y>p.y) return false;\n else return (dist<p.dist);\n }\n} typedef Pachimon;\n\nint distance(Pachimon p1, Pachimon p2);\n\n\nint main(void){\n while(1) {\n int W,H;\n cin>>W>>H;\n if(W==0 and H==0) {break;}\n char** c=new char*[H];\n for(int i=0; i<H; i++) {\n c[i]=new char[W];\n }\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n cin>>c[i][j];\n }\n }\n auto p=get(W,H,c);\n if(p.second==INF) {\n cout<<\"NA\"<<endl;\n }\n else{\n cout<<p.first+1<<\" \"<<p.second<<endl;\n }\n for(int i=0; i<H; i++) {\n delete[] c[i];\n }\n delete[] c;\n }\n return 0;\n}\n\n\npair<int,int> get(int W,int H, char** c){\n vector<Pachimon>* pachimons = new vector<Pachimon> [5];\n Pachimon S,G;\n for(int i=0; i<5; i++) {\n pachimons[i].clear();\n }\n\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n switch(c[i][j]) {\n Pachimon p;\n case '1':\n p.x=i;\n p.y=j;\n p.dist=INF;\n pachimons[0].push_back(p);\n break;\n case '2':\n p.x=i;\n p.y=j;\n p.dist=INF;\n pachimons[1].push_back(p);\n break;\n case '3':\n p.x=i;\n p.y=j;\n p.dist=INF;\n pachimons[2].push_back(p);\n break;\n case '4':\n p.x=i;\n p.y=j;\n p.dist=INF;\n pachimons[3].push_back(p);\n break;\n case '5':\n p.x=i;\n p.y=j;\n p.dist=INF;\n pachimons[4].push_back(p);\n break;\n case 'S':\n S.x=i;\n S.y=j;\n S.dist=0;\n break;\n case 'G':\n G.x=i;\n G.y=j;\n G.dist=INF;\n break;\n default:\n ;\n }\n }\n }\n\n int retval=INF;\n int min_first_select;\n for(int first_select=0; first_select<5; first_select++) {\n for(int i=0; i<5; i++) {\n for(auto iter=pachimons[i].begin(); iter!=pachimons[i].end(); iter++) {\n (*iter).dist=INF;\n }\n }\n G.dist=INF;\n for(auto iter=pachimons[(first_select+1)%5].begin(); iter!=pachimons[(first_select+1)%5].end(); iter++) {\n (*iter).dist=min((*iter).dist,distance(S,*iter));\n }\n for(int i=0; i<5; i++) {\n for(auto iter=pachimons[(first_select+1+i)%5].begin(); iter!=pachimons[(first_select+1+i)%5].end(); iter++) {\n for(auto iter2=pachimons[(first_select+1+i+1)%5].begin(); iter2!=pachimons[(first_select+1+i+1)%5].end(); iter2++) {\n (*iter2).dist=min((*iter2).dist,distance(*iter,*iter2));\n }\n }\n }\n for(auto iter=pachimons[(first_select+4)%5].begin(); iter!=pachimons[(first_select+4)%5].end(); iter++) {\n G.dist=min(G.dist,distance(*iter,G));\n }\n if(G.dist<retval){\n min_first_select=first_select;\n retval=G.dist;\n }\n }\n\n return make_pair(min_first_select,retval);\n\n};\n\nint distance(Pachimon p1, Pachimon p2){\n return abs(p1.x - p2.x) + abs(p1.y - p2.y) + p1.dist;\n}",
"accuracy": 1,
"time_ms": 940,
"memory_kb": 5364,
"score_of_the_acc": -0.2194,
"final_rank": 12
},
{
"submission_id": "aoj_0215_4578469",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint W, H, StartId, Ans;\nchar MapData[1000][1000];\nvector<pair<int, int> > CreatureInfo[7];\nint DpCount[5][1001];\n\nconst int INF = 2e9;\n\n\nvoid clearDpArray() {\n\tfor (int j = 0; j < 5; ++j) {\n\t\tfor (int k = 0; k < 1001; ++k) {\n\t\t\tDpCount[j][k] = INF;\n\t\t}\n\t}\n}\n\nvoid solve() {\n\tint currentId, nextId, nextIdSize, next2Id, next2IdSize, xLen, yLen, currentLen;\n\n\tAns = INF;\n\tfor (currentId = 0; currentId <= 4; ++currentId) {\n\t\tclearDpArray();\n\n\t\tnextId = (currentId + 1) % 5;\n\t\tnextIdSize = CreatureInfo[nextId].size();\n\t\tfor (int i = 0; i < nextIdSize; ++i) {\n\t\t\txLen = abs(CreatureInfo[5][0].second - CreatureInfo[nextId][i].second);\n\t\t\tyLen = abs(CreatureInfo[5][0].first - CreatureInfo[nextId][i].first);\n\t\t\tDpCount[1][i] = xLen + yLen;\n\t\t}\n\n\t\tfor (int cnt = 2; cnt <= 4; ++cnt) {\n\t\t\tnext2Id = (nextId + 1) % 5;\n\t\t\tnext2IdSize = CreatureInfo[next2Id].size();\n\t\t\tfor (int i = 0; i < nextIdSize; ++i) {\n\t\t\t\tfor (int j = 0; j < next2IdSize; ++j) {\n\t\t\t\t\txLen = abs(CreatureInfo[next2Id][j].second - CreatureInfo[nextId][i].second);\n\t\t\t\t\tyLen = abs(CreatureInfo[next2Id][j].first - CreatureInfo[nextId][i].first);\n\t\t\t\t\tDpCount[cnt][j] = min(DpCount[cnt][j], DpCount[cnt - 1][i] + xLen + yLen);\n\t\t\t\t}\n\t\t\t}\n\t\t\tnextId = (nextId + 1) % 5;\n\t\t\tnextIdSize = CreatureInfo[nextId].size();\n\t\t}\n\n\t\tfor (int i = 0; i < nextIdSize; ++i) {\n\t\t\txLen = abs(CreatureInfo[6][0].second - CreatureInfo[nextId][i].second);\n\t\t\tyLen = abs(CreatureInfo[6][0].first - CreatureInfo[nextId][i].first);\n\t\t\tcurrentLen = DpCount[4][i] + xLen + yLen;\n\t\t\tif (currentLen < Ans) {\n\t\t\t\tAns = currentLen;\n\t\t\t\tStartId = currentId + 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (Ans == INF) {\n\t\tcout << \"NA\" << endl;\n\t\treturn;\n\t}\n\tcout << StartId << \" \" << Ans << endl;\n}\n\nint main() {\n\tchar ch;\n\n\twhile (cin >> W >> H, W) {\n\t\tfor (int i = 0; i < 7; ++i) {\n\t\t\tCreatureInfo[i].clear();\n\t\t}\n\n\t\tmemset(MapData, '\\0', sizeof(MapData));\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tcin >> ch;\n\t\t\t\tif (ch == 'S') {\n\t\t\t\t\tCreatureInfo[5].push_back(make_pair(i, j));\n\t\t\t\t}\n\t\t\t\telse if (ch == 'G') {\n\t\t\t\t\tCreatureInfo[6].push_back(make_pair(i, j));\n\t\t\t\t}\n\t\t\t\telse if (ch >= '1' && ch <= '5') {\n\t\t\t\t\tCreatureInfo[ch-'1'].push_back(make_pair(i, j));\n\t\t\t\t}\n\t\t\t\tMapData[i][j] = ch;\n\t\t\t}\n\t\t}\n\t\tsolve();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 790,
"memory_kb": 4124,
"score_of_the_acc": -0.1587,
"final_rank": 10
},
{
"submission_id": "aoj_0215_4577974",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint W, H, StartId, Ans;\nchar MapData[1000][1000];\nvector<pair<int,int> > CreatureInfo[7];\nint DpCount[5][5][1001];\n\n\nvoid clearDpCount() {\n\tfor (int i = 0; i < 5; ++i) {\n\t\tfor (int j = 0; j < 5; ++j) {\n\t\t\tfor (int k = 0; k < 1001; ++k) {\n\t\t\t\tDpCount[i][j][k] = -1;\n\t\t\t}\n\t\t}\n\t}\n}\n\nint judge(int gotTotal, int gotId, int gotNum) {\n\tint xLen, yLen, cntOfNextId, ans;\n\n\tif (DpCount[gotTotal][gotId][gotNum] != -1) {\n\t\treturn DpCount[gotTotal][gotId][gotNum];\n\t}\n\n\tif (gotTotal == 4) {\n\t\txLen = abs(CreatureInfo[6][0].second - CreatureInfo[gotId][gotNum].second);\n\t\tyLen = abs(CreatureInfo[6][0].first - CreatureInfo[gotId][gotNum].first);\n\t\treturn xLen + yLen;\n\t}\n\n\tans = 2e9;\n\tcntOfNextId = CreatureInfo[gotId + 1].size();\n\tfor (int i = 0; i < cntOfNextId; ++i) {\n\t\txLen = abs(CreatureInfo[gotId + 1][i].second - CreatureInfo[gotId][gotNum].second);\n\t\tyLen = abs(CreatureInfo[gotId + 1][i].first - CreatureInfo[gotId][gotNum].first);\n\t\tans = min(ans, judge(gotTotal + 1, gotId + 1, i) + xLen + yLen);\n\t}\n\n\tDpCount[gotTotal][gotId][gotNum] = ans;\n\treturn ans;\n}\n\nvoid solve() {\n\tint currentCnt;\n\n\tAns = 2e9;\n\tfor (int id = 1; id <= 5; ++id) {\n\t\tclearDpCount();\n\t\trotate(CreatureInfo + 1, CreatureInfo + 2, CreatureInfo + 6);\n\n\t\tcurrentCnt = judge(0, 0, 0);\n\t\tif (currentCnt < Ans) {\n\t\t\tAns = currentCnt;\n\t\t\tStartId = id;\n\t\t}\n\t}\n\n\tif (Ans == 2e9) {\n\t\tcout << \"NA\" << endl;\n\t\treturn;\n\t}\n\tcout << StartId << \" \" << Ans << endl;\n}\n\nvoid show() {\n\tcout << \"Map:\" << endl;\n\tfor (int i = 0; i < H; ++i) {\n\t\tfor (int j = 0; j < W; ++j) {\n\t\t\tcout<<MapData[i][j];\n\t\t}\n\t\tcout << endl;\n\t}\n\n\tcout << \"Creature:\" << endl;\n\tfor (int i = 0; i < 7; ++i) {\n\t\tcout << \"num_\" << i << endl;\n\t\tfor (int j = 0; j < CreatureInfo[i].size(); ++j) {\n\t\t\tcout << \" \" << CreatureInfo[i][j].first << \" \" << CreatureInfo[i][j].second << endl;\n\t\t}\n\t}\n}\n\nint main() {\n\tchar ch;\n\n\twhile (cin >> W >> H, W) {\n\t\tfor (int i = 0; i < 7; ++i) {\n\t\t\tCreatureInfo[i].clear();\n\t\t}\n\n\t\tmemset(MapData, '\\0', sizeof(MapData));\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tcin >> ch;\n\t\t\t\tif (ch == 'S') {\n\t\t\t\t\tCreatureInfo[0].push_back(make_pair(i, j));\n\t\t\t\t} else if (ch == 'G') {\n\t\t\t\t\tCreatureInfo[6].push_back(make_pair(i, j));\n\t\t\t\t} else if (ch >= '1' && ch <= '5') {\n\t\t\t\t\tCreatureInfo[ch-'0'].push_back(make_pair(i, j));\n\t\t\t\t}\n\t\t\t\tMapData[i][j] = ch;\n\t\t\t}\n\t\t}\n\t\t//show();\n\t\tsolve();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 1110,
"memory_kb": 4224,
"score_of_the_acc": -0.2523,
"final_rank": 14
},
{
"submission_id": "aoj_0215_4471187",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nvoid solve(int w, int h){\n int sy = 0, sx = 0, gy = 0, gx = 0;\n vector<vector<int>> ys(5), xs(5);\n for (int i = 0; i < h; ++i) {\n string s;\n cin >> s;\n for (int j = 0; j < w; ++j) {\n if(s[j] == 'S') sy = i, sx = j;\n else if(s[j] == 'G') gy = i, gx = j;\n else if(isdigit(s[j])){\n ys[s[j]-'1'].emplace_back(i);\n xs[s[j]-'1'].emplace_back(j);\n }\n }\n }\n vector<vector<int>> dp(5);\n for (int i = 0; i < 5; ++i) {\n dp[i].resize(ys[i].size());\n }\n int ans = INF<int>, cur = 0;\n for (int i = 0; i < 5; ++i) {\n for (int j = 0; j < 5; ++j) {\n fill(dp[j].begin(),dp[j].end(), INF<int>);\n }\n int st = (i+1)%5;\n for (int j = 0; j < dp[st].size(); ++j) {\n dp[st][j] = abs(sy-ys[st][j])+abs(sx-xs[st][j]);\n }\n for (int _ = 0; _ < 3; ++_) {\n int stt = (st+1)%5;\n for (int j = 0; j < dp[st].size(); ++j) {\n for (int k = 0; k < dp[stt].size(); ++k) {\n chmin(dp[stt][k], dp[st][j]+abs(ys[st][j]-ys[stt][k])+abs(xs[st][j]-xs[stt][k]));\n }\n }\n st = stt;\n }\n for (int j = 0; j < dp[st].size(); ++j) {\n int dist = dp[st][j]+abs(gy-ys[st][j])+abs(gx-xs[st][j]);\n if(ans > dist){\n ans = dist;\n cur = i;\n }\n }\n }\n if(ans == INF<int>)puts(\"NA\");\n else printf(\"%d %d\\n\", cur+1, ans);\n}\n\nint main() {\n int w, h;\n while(cin >> w >> h, w){\n solve(w, h);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 580,
"memory_kb": 3336,
"score_of_the_acc": -0.0871,
"final_rank": 8
},
{
"submission_id": "aoj_0215_4091066",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int, int> P;\n#define INF 1000000\n\nint main() {\n while (true) {\n int W, H; cin >> W >> H;\n \n if (W==0 && H==0) {\n break;\n }\n \n char c[H][W];\n vector<P> pos[7];\n int sx, sy, gx, gy;\n \n for (int i=0; i<H; i++) {\n for (int j=0; j<W; j++) {\n cin >> c[i][j];\n \n if (c[i][j]=='S') {\n sx=i, sy=j;\n pos[0].push_back(P(i, j));\n }\n else if (c[i][j]=='G') {\n gx=i, gy=j;\n pos[6].push_back(P(i, j));\n }\n else if (c[i][j]!='.') {\n pos[c[i][j]-'0'].push_back(P(i, j));\n }\n }\n }\n \n int dp[6][H][W];\n \n for (int i=0; i<6; i++) {\n for (int j=0; j<H; j++) {\n for (int k=0; k<W; k++) {\n dp[i][j][k] = INF;\n }\n }\n }\n \n dp[0][sx][sy] = 0;\n int ans0;\n int ans1 = INF;\n \n for (int i=1; i<=5; i++) {\n int now = 0;\n\n for (int j=1; j<=5; j++) {\n int next;\n \n if (j==5) {\n next = 6;\n }\n else if (i+j==5) {\n next = 5;\n }\n else {\n next = (i+j)%5;\n }\n \n for (int k=0; k<pos[now].size(); k++) {\n for (int l=0; l<pos[next].size(); l++) {\n int x1=pos[now][k].first, y1=pos[now][k].second;\n int x2=pos[next][l].first, y2=pos[next][l].second;\n \n dp[j][x2][y2] = min(dp[j][x2][y2], dp[j-1][x1][y1]+abs(x1-x2)+abs(y1-y2));\n }\n }\n \n now = next;\n }\n\n if (ans1>dp[5][gx][gy]) {\n ans0 = i;\n ans1 = dp[5][gx][gy];\n }\n }\n \n if (ans1==INF) {\n cout << \"NA\" << endl;\n }\n else {\n cout << ans0 << \" \" << ans1 << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 940,
"memory_kb": 27556,
"score_of_the_acc": -0.5319,
"final_rank": 15
},
{
"submission_id": "aoj_0215_3723405",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\ntypedef pair<ll, P> P3;\ntypedef pair<P ,P> PP;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int IINF = INT_MAX;\nconstexpr ll LLINF = LLONG_MAX;\n\nint w, h, si, sj, gi, gj;\nint dp[1005][1005];\nstring s[1005];\nvector<P> pos[5];\n\nint rec(int i, int j, int S, int pre){\n if(S==(1<<5)-1){\n return abs(i-gi)+abs(j-gj);\n }\n if(dp[i][j] != -1) return dp[i][j];\n int res = IINF/3, m = (pre+1)%5;\n for(auto p : pos[m]){\n int pi = p.first, pj = p.second;\n res = min(res, rec(pi, pj, S|(1<<m), m) + abs(i-pi) + abs(j-pj));\n }\n return dp[i][j] = res;\n}\n\nint main() {\n while(cin >> w >> h, w){\n for(int i=0;i<h;i++) cin >> s[i];\n for(int i=0;i<5;i++) pos[i].clear();\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(s[i][j] != '.'){\n if(s[i][j]=='S'){\n si = i;\n sj = j;\n }\n else if(s[i][j]=='G'){\n gi = i;\n gj = j;\n }\n else{\n pos[s[i][j]-'1'].push_back({i,j});\n }\n }\n }\n }\n bool ok = true;\n for(int i=0,cnt=0;i<5;i++){\n if(pos[i].size()==0)cnt++;\n if(cnt>=2){\n cout << \"NA\" << endl;\n ok = false;\n break;\n }\n }\n if(!ok) continue;\n int ans=IINF, id=0;\n for(int i=0;i<5;i++){\n for(int i=0;i<h;i++) fill(dp[i], dp[i]+w, -1);\n int tmp = rec(si, sj, 1<<i, i);\n if(tmp < ans){\n ans = tmp;\n id = i+1;\n }\n }\n cout << id << \" \" << ans << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 920,
"memory_kb": 8108,
"score_of_the_acc": -0.2523,
"final_rank": 13
},
{
"submission_id": "aoj_0215_3425976",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n#define inRange(x,a,b) (a <= x && x <= b)\n\ninline int dist(int si, int sj, int gi, int gj){\n return abs(si-gi)+abs(sj-gj);\n}\n\nconst int INF = 1<<30;\n\nint main(){\n int w, h;\n while(cin >> w >> h, w+h){\n vector<pair<int,int>> vp[5];\n int si, sj, gi, gj;\n char mat[h][w];\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n cin >> mat[i][j];\n if(mat[i][j] == 'S') si = i, sj = j;\n if(mat[i][j] == 'G') gi = i, gj = j;\n if(inRange(mat[i][j],'1','5')){\n vp[mat[i][j]-'1'].push_back({i,j});\n }\n }\n }\n int ans = -1, score = INF;\n for(int i = 0; i < 5; i++){\n vector<vector<int>> dp(4, vector<int>(1000,INF));\n for(int j = 0; j < vp[(i+1)%5].size(); j++){\n dp[0][j] = dist(si,sj,vp[(i+1)%5][j].first,vp[(i+1)%5][j].second);\n }\n for(int j = 0; j < 3; j++){\n int from = (i+1+j)%5, to = (i+1+j+1)%5;\n for(int k = 0; k < vp[from].size(); k++){\n for(int l = 0; l < vp[to].size(); l++){\n dp[j+1][l] = min(dp[j+1][l], dp[j][k]+dist(vp[from][k].first, vp[from][k].second, vp[to][l].first, vp[to][l].second));\n }\n }\n }\n int tmp = INF;\n for(int j = 0; j < vp[(i+4)%5].size(); j++){\n tmp = min(tmp, dp[3][j] + dist(vp[(i+4)%5][j].first, vp[(i+4)%5][j].second, gi, gj));\n }\n if(score > tmp){\n score = tmp;\n ans = i;\n }\n }\n if(score == INF) cout << \"NA\" << endl;\n else cout << ans+1 << \" \" << score << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 4212,
"score_of_the_acc": -0.1542,
"final_rank": 9
},
{
"submission_id": "aoj_0215_3324662",
"code_snippet": "#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\n#define FOE(i,a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT_ON(bit, i) (bit & (1LL << i))\n\ntypedef long long LL;\ntemplate<typename T> using V = std::vector<T>;\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\ntemplate<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;\n\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \" \";} std::cout << v[i];} std::cout << \"\\n\"; }\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\ntemplate<class T> inline std::vector<T> unique(std::vector<T> v) {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n return v;\n}\n\nconst int INF = 1 << 30;\nconst double EPS = 1e-9;\nconst std::string YES = \"YES\", Yes = \"Yes\", NO = \"NO\", No = \"No\";\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\n\nusing namespace std;\n\nvoid solve(VV<int> route_list, int H, int W, VV<pair<int, int>> f) {\n\n int ans = INF;\n LL mini_dist = INF;\n FOR(r, 0, route_list.size()) {\n\n VV<LL> dist(H, V<LL>(W, INF));\n dist[f[5][0].first][f[5][0].second] = 0; // start\n\n FOR(i, 1, route_list[r].size()) {\n int now_c = route_list[r][i - 1];\n int next_c = route_list[r][i];\n\n FOE(p1, f[now_c]) {\n int y = p1.first;\n int x = p1.second;\n\n FOE(p2, f[next_c]) {\n int ny = p2.first;\n int nx = p2.second;\n dist[ny][nx] = min(dist[ny][nx], dist[y][x] + abs(ny - y) + abs(nx - x));\n }\n }\n }\n\n LL d = dist[f[6][0].first][f[6][0].second];\n int first = route_list[r][1];\n if (first == 0) {\n first = 5;\n }\n if (d < mini_dist) {\n ans = first;\n mini_dist = d;\n }\n else if (d == mini_dist) {\n ans = min(ans, first);\n }\n }\n\n if (mini_dist == INF) {\n print(\"NA\");\n }\n else {\n cout << ans << \" \" << mini_dist << endl;\n }\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (true) {\n int W, H;\n cin >> W >> H;\n if (W + H == 0) {\n break;\n }\n\n VV<pair<int, int>> f(7);\n FOR(y, 0, H) {\n string s;\n cin >> s;\n FOR(x, 0, W) {\n if (s[x] == 'S') {\n f[5].emplace_back(make_pair(y, x));\n }\n else if (s[x] == 'G') {\n f[6].emplace_back(make_pair(y, x));\n }\n else if (s[x] == '.') {\n }\n else {\n f[(s[x] - '0') - 1].emplace_back(make_pair(y, x));\n }\n }\n }\n\n VV<int> route;\n FOR(i, 0, 5) {\n V<int> r = {5};\n FOR(j, 0, 4) {\n r.emplace_back((i + j) % 5);\n }\n r.emplace_back(6);\n route.emplace_back(r);\n }\n\n solve(route, H, W, f);\n }\n\n}",
"accuracy": 1,
"time_ms": 600,
"memory_kb": 10816,
"score_of_the_acc": -0.1982,
"final_rank": 11
}
] |
aoj_0217_cpp
|
ウォーキング
会津リバーサイドホスピタルでは、リハビリと健康増進のため、入院患者が一日二回のウォーキングを行っています。元気に退院するために、ウォーキングで体力を回復しようと頑張る人が日に日に増えきたことから、院長が「一日で一番長い距離を歩いた人にプレゼントをあげよう!」という企画を立ち上げました。
患者の数
n
(1 ≤
n
≤ 10000)、それぞれの患者の番号
p
i
(1 ≤
p
i
≤ 10000)、一回目に歩いた距離
d1
i
、二回目に歩いた距離
d2
i
(0 ≤
d1
i
,
d2
i
≤ 5000) を入力とし、歩いた距離の合計が最も長い患者の番号とその距離を出力するプログラムを作成してください。ただし、一日に歩いた距離が同じ患者はいないものとします。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
p
1
d1
1
d2
1
p
2
d1
2
d2
2
:
p
n
d1
n
d2
n
入力はすべて整数で与えられます。データセットの数は50 を超えません。
Output
入力データセットごとに、最も長い合計距離を歩いた患者の番号とその歩いた距離を１行に出力します。
Sample Input
5
263 2345 2504
1 3210 1985
5000 1501 4132
10000 503 3107
51 1758 2690
3
345 5000 2396
7 3910 1590
6789 2525 3616
0
Output for the Sample Input
5000 5633
345 7396
|
[
{
"submission_id": "aoj_0217_10866878",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint n, p, d1, d2, m, mnum;\n\twhile (1) {\n\t\tcin >> n;\n\t\tif (n == 0) break;\n\t\tm = 0;\n\t\twhile (n--) {\n\t\t\tcin >> p >> d1 >> d2;\n\t\t\tif (m < d1 + d2) {\n\t\t\t\tm = d1 + d2;\n\t\t\t\tmnum = p;\n\t\t\t}\n\t\t}\n\t\tcout << mnum << ' ' << m << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3456,
"score_of_the_acc": -0.8387,
"final_rank": 7
},
{
"submission_id": "aoj_0217_10845908",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n for(int N;cin>>N,N!=0;){\n\n int ans,ma=0;\n rep(i,N){\n int p,a,b;\n cin>>p>>a>>b;\n if(chmax(ma, a+b)) ans=p;\n }\n cout<<ans<<\" \"<<ma<<\"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3456,
"score_of_the_acc": -0.4387,
"final_rank": 2
},
{
"submission_id": "aoj_0217_10834257",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n int n;\n\n while(1){\n cin >> n;\n if(n==0) break;\n int p,d1,d2,sum,max_sum=0,ans;\n for(int i=0;i<n;i++){\n cin >> p >> d1 >> d2;\n sum = d1+d2;\n if(sum>max_sum){\n ans = p;\n max_sum = sum;\n }\n }\n cout << ans << \" \" << max_sum << endl;\n }\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3288,
"score_of_the_acc": -0.8727,
"final_rank": 9
},
{
"submission_id": "aoj_0217_9639134",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<n;i++)\nconst ll inf=1e18;\n\nint main(){\n int n;cin >> n;\n while(n!=0){\n map<int,ll> sm;\n vector<int> patient(n);\n rep(i,n){\n int p;cin >> p;\n int d1,d2;cin >> d1 >> d2;\n p--;\n patient[i]=p;\n sm[p]=d1+d2;\n }\n int respatient;\n ll ressm=-1;\n rep(i,n){\n if(ressm<sm[patient[i]]){\n ressm=sm[patient[i]];\n respatient=patient[i];\n }\n }\n cout << respatient+1 << \" \" << ressm << endl;\n cin >> n;\n }\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 4024,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0217_9108739",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, p, d1, d2;\n cin >> n;\n if (n == 0) return 1;\n ll max_d=-inf, max_p=-1;\n rep(i, n) {\n cin >> p >> d1 >> d2;\n if (chmax(max_d, d1+d2)) {\n max_p = p;\n }\n }\n print(max_p, max_d);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3332,
"score_of_the_acc": -0.4162,
"final_rank": 1
},
{
"submission_id": "aoj_0217_8575165",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\nint main(){\n for(int i=1;i<=59;i++){\n int n,p[10009],d[10009],D[10009];\n cin>>n;\n if(n==0) break;\n for(int j=1;j<=n;j++){\n cin>>p[j]>>d[j]>>D[j];\n }\n int A=0;\n int P;\n for(int j=1;j<=n;j++){\n if(d[j]+D[j]>A) {\n A=d[j]+D[j];\n P=p[j];\n }\n }\n cout<<P<<\" \"<<A<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3304,
"score_of_the_acc": -0.8885,
"final_rank": 10
},
{
"submission_id": "aoj_0217_8234343",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n int main(){\n\n for(int a=0;a<55;a++){\n int n;\n cin >> n;\n if(n==0)break;\n std::vector<int> v(15000);\n std::vector<int> ans(15000);\n for(int s=0;s<n;s++){\n int p,d1,d2;\n cin >> p >> d1 >> d2;\n v[p]=d1+d2;\n ans[p]=v[p];\n\n }\n\n sort(v.begin(), v.end(),greater<int>());\n int as = v[0];\n int x;\n for(int f=0;f<10200;f++){\n if(ans[f]==v[0])x = f;\n }\n cout << x << \" \" << v[0] << endl;\n }\n\n \n\n\n }",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3228,
"score_of_the_acc": -1.1134,
"final_rank": 18
},
{
"submission_id": "aoj_0217_8204866",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(void){\n int i, n, p, d1, d2, w;\n while (true) {\n cin >> n;\n if (n == 0) break;\n int pMax = 0, wMax = 0;\n for (i = 0; i < n; i++) {\n cin >> p >> d1 >> d2;\n if ((d1 + d2) > wMax) {\n wMax = d1 + d2;\n pMax = p;\n }\n }\n cout << pMax << \" \" << wMax << endl;\n }\n \n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3012,
"score_of_the_acc": -0.8,
"final_rank": 5
},
{
"submission_id": "aoj_0217_8072901",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n while (cin >> n, n) {\n vector<pair<int,int>> v(n);\n for (int i = 0; i < n; ++i) {\n int a,b,c; cin >> a >> b >> c;\n v[i] = {b+c, a};\n }\n sort(v.rbegin(), v.rend());\n cout << v[0].second << \" \" << v[0].first << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3388,
"score_of_the_acc": -0.5715,
"final_rank": 4
},
{
"submission_id": "aoj_0217_7429571",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n, p, d1, d2;\n while (cin >> n, n) {\n cin >> p >> d1 >> d2;\n int s = p, t = d1 + d2;\n n--;\n while (n--) {\n cin >> p >> d1 >> d2;\n if (d1 + d2 > t) {\n s = p, t = d1 + d2;\n }\n }\n cout << s << \" \" << t << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3336,
"score_of_the_acc": -0.9202,
"final_rank": 14
},
{
"submission_id": "aoj_0217_7180529",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vvvvvll = vector<vvvvll>;\nusing vvvvvvll = vector<vvvvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vvvvb = vector<vvvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vvvvd = vector<vvvd>;\nusing vvvvvd = vector<vvvvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (a == 0)return b;\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\nll sqrtz(ll N) {\n ll L = 0;\n ll R = sqrt(N) + 10000;\n while (abs(R - L) > 1) {\n ll mid = (R + L) / 2;\n if (mid * mid <= N)L = mid;\n else R = mid;\n }\n return L;\n\n}\n\n/*\nusing mint = modint998244353;\n//using Mint = modint;\nvector<mint> fact, factinv, inv;\nconst ll mod = 998244353;\nvoid prenCkModp(ll n) {\n fact.resize(n + 5);\n factinv.resize(n + 5);\n inv.resize(n + 5);\n fact[0] = fact[1] = 1;\n factinv[0] = factinv[1] = 1;\n inv[1] = 1;\n for (ll i = 2; i < n + 5; i++) {\n fact[i] = (fact[i - 1] * i);\n inv[i] = mod - (inv[mod % i] * (mod / i));\n factinv[i] = (factinv[i - 1] * inv[i]);\n }\n\n}\n\nmint nCk(ll n, ll k) {\n if (n < k || k < 0) return 0;\n return fact[n] * (factinv[k] * factinv[n - k]);\n}\n*/\n\ntemplate<class T>\nvector<vector<T>> mul(vector<vector<T>> A, vector<vector<T>> B) {\n ll N = A.size();\n vector<vector<T>> res(N, vector<T>(N, 0));\n rep(i, N)rep(j, N)rep(k, N) {\n res[i][j] += A[i][k] * B[k][j];\n }\n return res;\n}\n\nvll S(vll V,ll A){\n A--;\n vll res;\n res.push_back(V[A]);\n rep(i,V.size()){\n if(i!=A)res.push_back(V[i]);\n }\n return res;\n}\n\nint main() {\n\n \n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n \n ll N;\n while(1){\n cin>>N;\n if(N==0)return 0;\n ll M=-1;\n ll an=-10;\n rep(i,N){\n ll p,a,b;\n cin>>p>>a>>b;\n if(chmax(M,a+b))an=p;\n }\n cout<<an<<\" \"<<M<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3460,
"score_of_the_acc": -0.5427,
"final_rank": 3
},
{
"submission_id": "aoj_0217_6952982",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;\n while(1){\n int max=0,max_p=0,d1,d2,p;\n cin >> n;\n if(n==0){\n break;\n }\n for(int i=0; i<n; i++){\n cin >> p >> d1 >> d2;\n if((d1+d2)>max){\n max=d1+d2;\n max_p=p;\n }\n }\n cout << max_p << \" \" << max << endl;\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3108,
"score_of_the_acc": -0.8949,
"final_rank": 11
},
{
"submission_id": "aoj_0217_6943696",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int a,b,c,d,e,f;\nwhile(true){\n cin>>a;\n if(a==0){\n break;\n }\n e=0;f=0;\n for(int i=0;i<a;i+=1){\n cin>>b>>c>>d;\n if(f<c+d){\n e=b;f=c+d;\n }\n }\n cout<<e<<\" \"<<f<<endl;\n}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3064,
"score_of_the_acc": -0.8514,
"final_rank": 8
},
{
"submission_id": "aoj_0217_6937083",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < n; i++)\n#define rrep(i,a,b) for(int i = a; i < b; i++)\n#define all(A) (A).begin(),(A).end()\n#define MOD 1000000007\n#define grt greater<int>()\n#define mfor(i,M) for(auto i = M.begin(); i != M.end(); i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\nll INF = 1LL<<60;\ntypedef vector<vector<ll> > Graph;\n\nint main(void){\n\twhile(1){\n\t\tvector<int> D(10101,0);\n\t\tint n,p,d,d2; cin >> n;\n\t\tif(n == 0) break;\n\t\trep(i,n){\n\t\t\tcin >> p >> d >> d2;\n\t\t\tD[p] += d+d2;\n\t\t}\n\t\tint M = 0,s = 0;\n\t\trep(i,10101) if(D[i] > s) M = i,s = D[i];\n\t\tcout << M << \" \" << s << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3116,
"score_of_the_acc": -0.9028,
"final_rank": 12
},
{
"submission_id": "aoj_0217_6838402",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(void){\n ll n,x,y,p,d1,d2,i;\n while(cin>>n){\n if(n==0){\n return 0;\n }\n for(i=x=0;i<n;i++){\n cin>>p>>d1>>d2;\n if(x<d1+d2){\n x=d1+d2;\n y=p;\n }\n }\n cout<<y<<\" \"<<x<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3324,
"score_of_the_acc": -0.9083,
"final_rank": 13
},
{
"submission_id": "aoj_0217_6406181",
"code_snippet": "#pragma region Template\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\nusing vll = vector<ll>;\nusing vvi = vector<vector<int>>;\nusing vvll = vector<vector<ll>>;\nusing vpi = vector<pair<int,int>>;\nusing vpll = vector<pair<ll,ll>>;\nusing vs = vector<string>;\nusing pi = pair<int,int>;\nusing pll = pair<ll,ll>;\n#define fi first\n#define se second\n#define pb push_back\n#define fore(p,a) for (auto p : a)\n#define overload4(a,b,c,d,name,...) name\n#define rep1(n) for (ll i = 0; i < ll(n); ++i)\n#define rep2(i,n) for (ll i = 0; i < ll(n); ++i)\n#define rep3(i,a,b) for (ll i = a; i < ll(b); ++i)\n#define rep4(i,a,b,c) for (ll i = a; i < ll(b); i += c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for (ll i = n; i--;)\n#define rrep2(i,n) for (ll i = n; i--;)\n#define rrep3(i,a,b) for (ll i = b; i-- > (a);)\n#define rrep4(i,a,b,c) for (ll i = (a) + ((b) - (a) - 1) / (c) * (c); i >= (a); i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define all(container) begin(container), end(container)\n#define rall(container) rbegin(container), rend(container)\n#define Vvll(name,row,column) vvll name(row, vll (column))\n#define Max(...) max({__VA_ARGS__})\n#define Min(...) min({__VA_ARGS__})\n#define fin exit(0)\nconst int INF = 1001001001;\nconst ll LINF = 1LL << 60;\nconst double PI = acos(-1);\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; }\nll fact(ll x) { return x == 0 ? 1 : x * fact(x - 1); }\nll comb(ll n, ll r) { if (r == 0 || r == n) return 1; else if (r == 1) return n; return comb(n - 1, r - 1) + comb(n - 1, r); }\nvoid prfl(double x) { printf(\"%.15f\\n\", x); }\nbool ise(ll x) { return x % 2 == 0; }\nbool dv(ll waru, ll warareru) { return warareru % waru == 0; }\nint ci(char c) { return c - '0'; }\nchar ic(int i) { return '0' + i; }\n#pragma endregion\n\nint main() {\n while (1) {\n int n;\n cin >> n;\n if (n == 0) fin;\n vpi a(n);\n rep(n) {\n int x, y, z;\n cin >> x >> y >> z;\n a[i].fi = y + z, a[i].se = x;\n }\n sort(all(a));\n cout << a.back().se << ' ' << a.back().fi << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3552,
"score_of_the_acc": -1.2336,
"final_rank": 19
},
{
"submission_id": "aoj_0217_6063468",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n while(true) {\n int n;\n cin >> n;\n if(n == 0) return 0;\n vector<pair<int,int>>tmp(n);\n for(int i = 0; i < n; i++) {\n int p,d1,d2;\n cin >> p >> d1 >> d2;\n tmp[i] = {d1+d2,p};\n }\n sort(tmp.rbegin(),tmp.rend());\n cout << tmp[0].second << \" \" << tmp[0].first << endl;\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3300,
"score_of_the_acc": -0.9846,
"final_rank": 16
},
{
"submission_id": "aoj_0217_5830710",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<set>\n#include<bitset>\n#include<vector>\n#include<string>\n#include <iomanip>\n#include <deque>\n#include<list>\n#include<cmath>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\nusing ll=long long;\nusing P=pair<int,int>;\nusing P_S=pair<int,string>;\nusing P_D=pair<double,int>;\nusing T=tuple<int,int,char,ll,string>;\n\nint main()\n{\n while(1)\n {\n int n;\n cin>>n;\n if(n==0) break;\n int max_m=-1,ans=0;\n rep(i,n){\n int p,d1,d2;\n cin>>p>>d1>>d2;\n int sum=d1+d2;\n if(sum>max_m){\n max_m=sum;\n ans=p;\n }\n }\n cout<<ans<<\" \"<<max_m<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3016,
"score_of_the_acc": -0.804,
"final_rank": 6
},
{
"submission_id": "aoj_0217_5745433",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n int n;\n cin >> n;\n if(n == 0) break;\n vector<pair<int,int> > vec(n);\n for(int i=0;i<n;i++){\n int p,d1,d2;\n cin >> p >> d1 >> d2;\n vec[i] = make_pair(d1+d2,p);\n }\n sort(vec.rbegin(),vec.rend());\n cout << vec[0].second << \" \" << vec[0].first<< endl;\n }\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3160,
"score_of_the_acc": -1.0462,
"final_rank": 17
},
{
"submission_id": "aoj_0217_5725272",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tint p,d1,d2,mx=0,ans;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>p>>d1>>d2;\n\t\t\tif(d1+d2>mx){\n\t\t\t\tmx=d1+d2;\n\t\t\t\tans=p;\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<' '<<mx<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3356,
"score_of_the_acc": -0.9399,
"final_rank": 15
}
] |
aoj_0219_cpp
|
ヒストグラム
テンアイスクリームという名前のアイスクリーム屋さんがあります。このお店では常に 10 種類のアイスクリームが店頭に並ぶようにしています。お店の店長は商品開発の参考にするために、アイスクリームの売れ具合を表すグラフを毎日作成しています。
そんな店長のために、あなたは各アイスクリームの販売数をグラフで表示するプログラムを作成することになりました。
一日に販売されるアイスクリームの総数と売れたアイスクリームの番号を入力とし、アイスクリームの種類ごとに販売した数だけ * (半角アスタリスク) を出力するプログラムを作成してください。ただし、アイスクリームの種類を 0 から 9 までの整数で表わします。また、販売個数がゼロのアイスクリームは、- (半角ハイフン) をひとつ出力します。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
c
1
c
2
:
c
n
1 行目に一日に販売されるアイスクリームの総数
n
(1 ≤
n
≤ 10000) が与えられます。続く
n
行に第
i
のアイスクリームの種類
c
i
(0 ≤
c
i
≤ 9) が与えられます。
データセットの数は 20 を超えません。
Output
入力データセットごとに、各アイスクリームの種類の番号順に販売数を出力します。
Sample Input
15
2
6
7
0
1
9
8
7
3
8
9
4
8
2
2
3
9
1
5
0
Output for the Sample Input
*
*
***
*
*
-
*
**
***
**
-
*
-
-
-
*
-
-
-
*
|
[
{
"submission_id": "aoj_0219_1968567",
"code_snippet": "#include<stdio.h>\n#include<iostream>\nusing namespace std;\n\nint main(){\n\twhile(1){\n\t\tint n,a,u[10]={0,1,2,3,4,5,6,7,8,9},p[10]={};\n\t\tcin >> n;\n\t\tif(n==0)return 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin >> a;\n\t\t\tfor(int i=0;i<10;i++){\n\t\t\t\tif(a==u[i])p[i]=p[i]+1;\n\t\t\t\t/*cout << \"p[\"<< i << \"]=\" << p[i];*/ \n\t\t\t}\n\t\t\t/*cout << endl;*/\n\t\t}\n\t\t/*for(int i=0;i<10;i++){\n\t\t\tcout << \"p[\"<< i << \"]=\" << p[i]; \n\t\t}*/\n\t\tfor(int r=0;r<10;r++){\n\t\t\tif(p[r]==0){cout << \"-\";}\n\t\t\telse if(p[r]!=0){\n\t\t\t\tfor(int i=0;i<p[r];i++){\n\t\t\t\t\tcout << \"*\";\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1953485",
"code_snippet": "#include<stdio.h>\nint main(void)\n{\n int n, i, masatoy[10000];\n int str[10] = { 0,0,0,0,0,0,0,0,0,0 }, k;\n scanf(\"%d\", &n);\n while (n > 0) {\n for (i = 0; i < n; i++) {\n scanf(\"%d\", &masatoy[i]);\n for (k = 0; k <= 9; k++) {\n if (masatoy[i] == k) {\n str[k]++;\n }\n }\n\n }\n for (i = 0; i <= 9; i++) {\n if (str[i] == 0) {\n printf(\"-\\n\");\n }\n else {\n for (k = 0; k < str[i]; k++) {\n printf(\"*\");\n }\n printf(\"\\n\");\n }\n\n }\n scanf(\"%d\", &n);\n for (i = 0; i <=9; i++) {\n str[i] = 0; \n \n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1036,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0219_1950355",
"code_snippet": "/*\n * src.cpp\n *\n * Created on: 2016/08/04\n * Author: joi\n */\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,a) FOR(i,0,a)\n\nint N;\n\nint cnt[10];\n\nint main(){\n\tdo{\n\t\tcin>>N;\n\t\tif (N){\n\t\t\tfill(cnt,cnt+10,0);\n\t\t\tREP(i,N){\n\t\t\t\tint a;\n\t\t\t\tcin>>a;\n\t\t\t\tcnt[a]++;\n\t\t\t}\n\t\t\tREP(i,10){\n\t\t\t\tif (cnt[i]==0){\n\t\t\t\t\tcout<<'-'<<endl;\n\t\t\t\t}else{\n\t\t\t\t\tREP(j,cnt[i]){\n\t\t\t\t\t\tcout<<'*';\n\t\t\t\t\t}\n\t\t\t\t\tcout<<endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}while (N);\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1947209",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<functional>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<iostream>\nusing namespace std;\nint main(void)\n{\n\tint n,i,j;\n\tint ice[9],p;\n\twhile(1) {\n\t\tcin >> n;\n\t\tif(n==0)break;\n\t\tfor(i=0;i<=9;i++) ice[i]=0;\n\t\tfor(i=0;i<n;i++) {\n\t\t\tcin >>p;\n\t\t\tice[p]++;\n\t\t}\n\t\tfor(i=0;i<=9;i++) {\n\t\t\tif(ice[i]>0) {\n\t\t\t\tfor(j=0;j<ice[i];j++) {\n\t\t\t\t\tcout << \"*\";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\telse cout << \"-\" << endl;\n\t\t}\n\t}\n\texit(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1935164",
"code_snippet": "#include <iostream>\nusing namespace std;\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0219\n\nint main() {\n\tint n;\n\twhile (cin >> n) {\n\t\tif (n == 0) break;\n\t\tint arr[10] = {0};\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint a;\n\t\t\tcin >> a;\n\t\t\tarr[a]++;\n\t\t}\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tif (arr[i] == 0) cout << \"-\";\n\t\t\tfor (int j = 0; j < arr[i]; j++) cout << \"*\";\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1887354",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n;\n\tint ice[10000];\n\tint k[16];\n\n\twhile(cin >>n,n){\n\n\t\tfor(int i=0;i<16;i++){\n\t\t\tk[i]=0;\n\t\t}\n\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin >>ice[i];\n\t\t}\n\n\n\t\tfor(int i=0;i<n;i++){\n\t\t\tswitch(ice[i]){\n\t\t\t\tcase 0: k[0]++; break;\n\t\t\t\tcase 1: k[1]++; break;\n\t\t\t\tcase 2: k[2]++; break;\n\t\t\t\tcase 3: k[3]++; break;\n\t\t\t\tcase 4: k[4]++; break;\n\t\t\t\tcase 5: k[5]++; break;\n\t\t\t\tcase 6: k[6]++; break;\n\t\t\t\tcase 7: k[7]++; break;\n\t\t\t\tcase 8: k[8]++; break;\n\t\t\t\tcase 9: k[9]++; break;\n\t\t\t}\n\t\t}\n/*\n\t\tcout <<endl;\n\t\tfor(int i=0;i<10;i++)\n\t\t\tcout << k[i] <<endl;\n*/\t\t\n\n\t\tfor(int i=0;i<10;i++){\n\t\t\tif(k[i] > 0){\n\t\t\t\tfor(int j=0;j<k[i];j++){\n\t\t\t\t\tcout <<\"*\";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}else {\n\t\t\t\tcout <<\"-\" <<endl;\n\t\t\t}\n\t\t}\n\n\t}\n\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1192,
"score_of_the_acc": -1,
"final_rank": 20
},
{
"submission_id": "aoj_0219_1865609",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n\tint n,t,i,j;\n\twhile(cin>>n,n){\n\t\tint c[10]={0};\n\t\tfor(i=0;i<n;i++)cin>>t,c[t]++;\n\t\tfor(i=0;i<10;i++){if(!c[i])cout<<'-';else for(j=0;j<c[i];j++)cout<<'*';cout<<endl;}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1865607",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n\tint n,t;\n\twhile(cin>>n,n){\n\t\tint c[10]={0};\n\t\tfor(int i=0;i<n;i++)cin>>t,c[t]++;\n\t\tfor(int i=0;i<10;i++){if(!c[i])cout<<'-';else for(int j=0;j<c[i];j++)cout<<'*';cout<<endl;}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1865596",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n,t;\n\twhile(cin>>n,n){\n\t\tint c[10];fill(c,c+10,0);\n\t\tfor(int i=0;i<n;i++)cin>>t,c[t]++;\n\t\tfor(int i=0;i<10;i++){if(!c[i])cout<<'-';else for(int j=0;j<c[i];j++)cout<<'*';cout<<endl;}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1844979",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\t\n\twhile (cin >> n, n){\n\t\tint ice[10] = {0};\n\t\tint num;\n\t\t\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tcin >> num;\n\t\t\tice[num]++;\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < 10; i++){\n\t\t\tif (ice[i]){\n\t\t\t\tfor (int j = 0; j < ice[i]; j++){\n\t\t\t\t\tcout << \"*\";\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << \"-\";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\t\n\treturn (0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1816002",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main(){\n\tint kai, aicec;\n\tint aice[11] = { 100, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; //??????\n\tint count[11] = { 0 };\n\tcin >> kai;\n\twhile (kai != 0){//???????????¶\n\t\tfor (int i = 0; i < kai; i++){\n\t\t\tcin >> aicec;\n\t\t\tfor (int l = 1; l <= 10; l++){//??????\n\t\t\t\tif (aice[l] == aicec) count[l]++;//????????????\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= 10; i++){\n\t\t\tif (count[i] == 0)cout << \"-\" << endl;\n\t\t\telse {\n\t\t\t\tfor (int l = 0; l < count[i]; l++){\n\t\t\t\t\tcout << \"*\";\n\t\t\t\t}cout << endl;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= 10; i++) count[i] = 0;\n\t\tcin >> kai;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1815978",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n\n\tint n;\n\n\twhile (cin >> n && n != 0){\n\n\t\tint kind[10] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };\n\n\t\tfor (int i = 0; i < n; i++){\n\n\t\t\tint k;\n\t\t\tcin >> k;\n\t\t\tkind[k]++;\n\t\t}\n\n\t\tfor (int i = 0; i < 10; i++){\n\n\t\t\tif (kind[i] != 0){\n\n\t\t\t\tfor (int j = 0; j < kind[i]; j++){\n\t\t\t\t\tcout << '*';\n\t\t\t\t}\n\t\t\t}\n\n\t\t\telse cout << '-';\n\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1785557",
"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\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 1000000007\n#define EPS 1e-10\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\n\nint co[100];\nint n, a;\n\nint main(){\n\twhile (cin >> n&&n){\n\t\tREP(i, 10)co[i] = 0;\n\t\tREP(i, n){\n\t\t\tcin >> a;\n\t\t\tco[a]++;\n\t\t}\n\t\tREP(i, 10){\n\t\t\tif (co[i] == 0){\n\t\t\t\tcout << \"-\" << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tREP(j, co[i])cout << \"*\";\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1776434",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int n;\n\n while (cin >> n && n != 0){\n int a[10];\n for (int i = 0; i < 10; i++) a[i] = 0;\n for (int i = 0; i < n; i++){\n int s;\n cin >> s;\n a[s]++;\n }\n for (int i = 0; i < 10; i++){\n if (a[i] == 0){\n cout << '-';\n }\n while (a[i]--){\n cout << '*';\n }\n cout << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1756795",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int n;\n\n while (cin >> n, n){\n int num[10], m;\n for (int i = 0; i < 10; i++) num[i] = 0;\n for (int i = 0; i < n; i++){\n cin >> m;\n num[m]++;\n }\n for (int i = 0; i < 10; i++){\n if (num[i] == 0) cout << '-' << endl;\n else {\n for (int j = 0; j < num[i]; j++){\n cout << '*';\n }\n cout << endl;\n }\n }\n }\n return (0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1719293",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n\tint n,a,b[10];\n\twhile(true){\n\tcin>>n;\n\tif(n==0)\n\t\tbreak;\n\tfor(int i=0;i<10;i++)\n\t\tb[i]=0;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a;\n\t\tb[a]++;\n\t}\n\tfor(int i=0;i<10;i++){\n\t\tif(b[i]==0)\n\t\t\tcout<<\"-\"<<endl;\n\t\telse{\n\t\tfor(int j=0;j<b[i];j++)\n\t\t\tcout<<\"*\";\n\t\tcout<<endl;\n\t\t}\n\t}\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1620250",
"code_snippet": "#include<iostream>\n#include<cstring>\nusing namespace std;\nint n, a[10], x;\nint main() {\n\twhile (true) {\n\t\tcin >> n;\n\t\tif (n == 0) { break; }\n\t\tmemset(a, 0, sizeof(a));\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> x;\n\t\t\ta[x]++;\n\t\t}\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tif (a[i] == 0) { cout << '-' << endl; }\n\t\t\telse {\n\t\t\t\tfor (int j = 0; j < a[i]; j++) { cout << '*'; }\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1148,
"score_of_the_acc": -0.7179,
"final_rank": 2
},
{
"submission_id": "aoj_0219_1550542",
"code_snippet": "#include<iostream>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\nusing namespace std;\n\nint main(){\n\tint n,cnt;\n\tint dt[10];\n\twhile(cin>>n,n){\n\t\trep(i,10)dt[i]=0;\n\t\trep(i,n){\n\t\t\tcin>>cnt;\n\t\t\tdt[cnt]++;\n\t\t}\n\t\trep(i,10){\n\t\t\tif(dt[i]==0)cout<<\"-\";\n\t\t\telse rep(j,dt[i])cout<<\"*\";\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1540259",
"code_snippet": "#include<iostream>\n#include<string.h>\n#include<vector>\n#include<list>\n#include<stdio.h>\n#include<math.h>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) range(i,0,b)\n#define debug(x) cout << \"debug \" << x << endl;\nusing namespace std;\n\nint main(){\n int n, inp;\n while(cin >> n,n){\n int ice[15] = {0};\n rep(i,n){\n cin >> inp;\n ice[inp]++;\n }\n rep(i,10){\n if(ice[i] == 0){\n cout << '-';\n }else{\n rep(j, ice[i]){\n cout << '*';\n }\n }\n cout << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
},
{
"submission_id": "aoj_0219_1540134",
"code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<vector>\n#include<cmath>\n#include<cstdio>\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 it ::iterator\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double ESP=1e-10;\nusing namespace std;\nint main(){\n int n;\n while(cin>>n,n){\n int out[10]={0};\n rep(i,n){\n int a;cin>>a;\n out[a]++;\n }\n rep(i,10){if(out[i])rep(j,out[i])cout<<'*';else cout<<'-';cout<<endl;}\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1152,
"score_of_the_acc": -0.7436,
"final_rank": 3
}
] |
aoj_0221_cpp
|
FizzBuzz
「Fizz Buzz」と言われる数字を使ったゲームがあります。このゲームは複数のプレイヤーで数字を1 から順にひとつずつ数え上げていくもので、各プレイヤーは直前のプレイヤーが発言した次の数字をひとつだけ発言します。その時、3 で割り切れる場合は 「Fizz」, 5 で割り切れる場合は 「Buzz」、両者で割り切れる場合は「FizzBuzz」と数の代わりに発言しなければなりません。例えば、最初の 16 までの発言は以下のようになります。
1, 2, Fizz, 4, Buzz, Fizz, 7, 8, Fizz, Buzz, 11, Fizz, 13, 14, FizzBuzz, 16, ・・・
太郎君は友達と「Fizz Buzz」をして遊ぶことにしました。太郎君たちはルールを次のように決めました。
「間違えた人は脱落する。その次の人は間違えた数の次の数から始める。つまり、1, 2, 3 と発言した場合、3 で間違えたので次は 4 から始めることになる。」
このルールに従ってゲームを行うのですが、ゲームに慣れていないため、間違えたことに気付かないことがあり、公平な判断ができません。そこであなたは太郎君たちがこのゲームを楽しめるように、決められた発言回数が終わった時点で残っていた人を出力するプログラムを作成することにしました。
プレイヤー数、ゲーム中に発言された回数、それぞれの発言を入力とし、入力が終わった時点で残っているプレイヤーの番号を小さい順に出力するプログラムを作成してください。ただし、プレイヤーには 1 から番号が割り振られており、発言順番も 1 番目のプレイヤーから順に行い、一通り発言が終わると、再度 1 番目のプレイヤーから発言することとします。順番の回ってきたプレイヤーが既に脱落している場合は、その次のプレイヤーが発言します。また、このプログラムは、プレイヤーが一人になった時点で、その後の発言を無視しなければなりません。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。
各データセットは以下の形式で与えられます。
m
n
s
1
s
2
:
s
n
1 行目にプレイヤー数
m
(2 ≤
m
≤ 1000) と発言回数
n
(1 ≤
n
≤ 10000) が与えられます。
続く
n
行に
i
番目の発言
s
1
が与えられます。
s
i
は整数、Fizz、Buzz、または FizzBuzz を示す文字列（8文字以下）です。
データセットの数は 50 を超えません。
Output
入力データセットごとに、指定された発言回数まで入力されたときに残っているプレイヤーの番号を小さい順に出力します。
Sample Input
5 7
1
2
Fizz
4
Buzz
6
7
3 5
1
2
3
4
5
0 0
Output for the Sample Input
2 3 4 5
1
|
[
{
"submission_id": "aoj_0221_10867037",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint n, m;\n\twhile (1) {\n\t\tcin >> m >> n;\n\t\tif (m == 0) break;\n\t\tvector<string> words(n);\n\t\tvector<int> player(m);\n\t\tint t = 1;\n\t\tfor (auto& i : player) i = t++;\n\t\tfor (auto& i : words) cin >> i;\n\t\tfor (int i = 1, j = 0; i <= n; i++) {\n\t\t\tif (player.size() == 1) break;\n\t\t\tif (i % 15 == 0) {\n\t\t\t\tif (words[i - 1] != \"FizzBuzz\") player.erase(player.begin() + j);\n\t\t\t\telse j++;\n\t\t\t}\n\t\t\telse if (i % 3 == 0) {\n\t\t\t\tif (words[i - 1] != \"Fizz\") player.erase(player.begin() + j);\n\t\t\t\telse j++;\n\t\t\t}\n\t\t\telse if (i % 5 == 0) {\n\t\t\t\tif (words[i - 1] != \"Buzz\") player.erase(player.begin() + j);\n\t\t\t\telse j++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tstring tmp;\n\t\t\t\tt = i;\n\t\t\t\twhile (t) {\n\t\t\t\t\ttmp.push_back(t % 10 + '0');\n\t\t\t\t\tt /= 10;\n\t\t\t\t}\n\t\t\t\treverse(tmp.begin(), tmp.end());\n\t\t\t\tif (words[i - 1] != tmp) player.erase(player.begin() + j);\n\t\t\t\telse j++;\n\t\t\t}\n\t\t\tj %= player.size();\n\t\t}\n\t\tfor (int i = 0; i < player.size() - 1; i++) {\n\t\t\tcout << player[i] << ' ';\n\t\t}\n\t\tcout << player[player.size() - 1] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3856,
"score_of_the_acc": -0.8054,
"final_rank": 16
},
{
"submission_id": "aoj_0221_10481398",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(ll i = 0; i < (n); ++i)\n#define fi first\n#define se second\n#define v(T) vector<T>\n#define pb push_back\n#define eb emplace_back\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\nconst long double PI = acos(-1.0);\nconst ll mod = 1e9+7;\n//const ll mod = 998244353;\nconst int INF = 1e9+50;\nconst ll INFL = 1e15;\nconst int di[] = {1,0,-1,0};\nconst int dj[] = {0,1,0,-1};\ntemplate<typename T>istream& operator>>(istream&i,v(T)&v){rep(j,v.size())i>>v[j];return i;}\ntemplate<typename T>ostream& operator<<(ostream&o,const v(T)&v){rep(j,v.size())o<<v[j]<<endl;return o;}\nll max(ll a, ll b) {if(a < b) return b; else return a;}\nll min(ll a, ll b) {if(a > b) return b; else return a;}\nll gcd(ll a, ll b) {if(a == 0 || b == 0) return max(a,b); else if(a%b==0)return b;else return gcd(b,a%b);}\nll lcm(ll a, ll b) {return a/gcd(a,b)*b;}\nvoid chmax(ll &a, ll b) {if(a < b) a = b;}\nvoid chmin(ll &a, ll b) {if(a > b) a = b;}\n\n\n\n\n\nint main() {\n while(1) {\n int m, n;\n cin >> m >> n;\n if(m == 0 && n == 0) break;\n\n vi vec(n+1,0);\n rep(i,n) {\n string s;\n cin >> s;\n if(s == \"Fizz\") vec[i+1] = 100000;\n else if(s == \"Buzz\") vec[i+1] = 200000;\n else if(s == \"FizzBuzz\") vec[i+1] = 300000;\n else {\n rep(j,s.size()) {\n int k = s[j]-'0';\n vec[i+1] += k * pow(10, s.size()-j-1);\n }\n }\n }\n\n vi p(m+1,0);\n int i = 1;\n int cur = 1;\n int cnt = m;\n while(i <= n && cnt != 1) {\n if(p[cur] == -1) {\n cur++;\n if(cur == m+1) cur = 1;\n continue;\n }\n\n int val = i;\n if(i % 15 == 0) val = 300000;\n else if(i % 5 == 0) val = 200000;\n else if(i % 3 == 0) val = 100000;\n\n if(val != vec[i]) {\n p[cur] = -1;\n cnt--;\n }\n \n i++;\n cur++;\n if(cur == m+1) cur = 1;\n }\n\n int k = 0;\n rep(i,m) {\n if(p[i+1] == 0) {\n if(k) cout << \" \";\n k++;\n cout << i+1;\n }\n }\n cout << endl;\n }\n}\n// g++ test.cpp && ./a.out",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3848,
"score_of_the_acc": -0.828,
"final_rank": 17
},
{
"submission_id": "aoj_0221_10480607",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cmath>\n#include<cstring>\n\nusing namespace std;\n\n#define FIZZ 10000000\n#define BUZZ 20000000\n#define FIZZBUZZ 30000000\n\nint x[100000], y[10000], n, m, num, turn, C, cnt, L; string S; char T[11] = \"0123456789\";\nint main() {\n\twhile (true) {\n\t\tmemset(x, 0, sizeof(x));\n\t\tmemset(y, 0, sizeof(y));\n\t\tnum = 1; turn = 1; cnt = 0;\n\t\tcin >> n >> m; L = n;\n\t\tif (n == 0 && m == 0) { break; }\n\t\tfor (int i = 1; i <= m; i++) { \n\t\t\tcin >> S; \n\t\t\tif (S == \"Fizz\") { x[i] = FIZZ; }\n\t\t\telse if (S == \"Buzz\") { x[i] = BUZZ; }\n\t\t\telse if (S == \"FizzBuzz\") { x[i] = FIZZBUZZ; }\n\t\t\telse if (S.size() >= 10) { x[i] = -1; }\n\t\t\telse {\n\t\t\t\tfor (int j = 0; j < S.size(); j++) {\n\t\t\t\t\tfor (int k = 0; k < 10; k++) {\n\t\t\t\t\t\tif (S[j] == T[k]) { x[i] += (int)pow(10, S.size() - j - 1)*k; goto E; }\n\t\t\t\t\t}\n\t\t\t\t\tx[i] = 0; goto F;\n\t\t\t\tE:;\n\t\t\t\t}\n\t\t\tF:;\n\t\t\t}\n\t\t}\n\t\twhile (num <= m && L > 1) {\n\t\t\tif (y[turn] == 1) { goto G; }\n\t\t\tif (num % 15 == 0) { C = FIZZBUZZ; }\n\t\t\telse if (num % 5 == 0) { C = BUZZ; }\n\t\t\telse if (num % 3 == 0) { C = FIZZ; }\n\t\t\telse { C = num; }\n\t\t\tif (C != x[num]) { y[turn] = 1; L--; }\n\t\t\tnum++;\n\t\tG:;\n\t\t\tturn++;\n\t\t\tif (turn > n) { turn -= n; }\n\t\t}\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tif (y[i] == 0) {\n\t\t\t\tif (cnt >= 1) { cout << ' '; }\n\t\t\t\tcout << i;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4056,
"score_of_the_acc": -1.0303,
"final_rank": 19
},
{
"submission_id": "aoj_0221_10107639",
"code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\n#include <vector>\n#include <set>\n\nvoid solve() {\n while(1) {\n int M, N; cin >> M >> N;\n\n if (M == 0 and N == 0) break;\n\n set<int> player_set;\n for(int n=1; n<=M; n++) player_set.insert(n);\n\n auto now = player_set.begin();\n for(int n=1; n<=N; n++) {\n if (player_set.size() == 1) {\n string s; cin>>s;\n continue;\n }\n\n if (n%15 == 0) {\n string s; cin >> s;\n if (s != \"FizzBuzz\") {\n now = player_set.erase(now);\n }\n else {\n advance(now, 1);\n }\n if (now == player_set.end()) now = player_set.begin();\n }\n else if (n%5 == 0) {\n string s; cin >> s;\n if (s != \"Buzz\") {\n now = player_set.erase(now);\n }\n else {\n advance(now, 1);\n }\n if (now == player_set.end()) now = player_set.begin();\n }\n else if (n%3 == 0) {\n string s; cin >> s;\n if (s != \"Fizz\") {\n now = player_set.erase(now);\n }\n else {\n advance(now, 1);\n }\n if (now == player_set.end()) now = player_set.begin();\n }\n else {\n int s; cin >> s;\n if (s != n) {\n now = player_set.erase(now);\n }\n else {\n advance(now, 1);\n }\n if (now == player_set.end()) now = player_set.begin();\n }\n }\n\n // 残っている人間を出力\n vector<int> players = vector<int>(player_set.begin(), player_set.end());\n for(int i=0; i<players.size(); i++) {\n cout << players.at(i);\n if (i == players.size()-1) cout << endl;\n else cout << \" \";\n }\n }\n}\n\nint main() {\n solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3388,
"score_of_the_acc": -0.3805,
"final_rank": 7
},
{
"submission_id": "aoj_0221_9647776",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n\n int n, m;\n\n const string fizz = \"Fizz\";\n const string buzz = \"Buzz\";\n const string fizzbuzz = \"FizzBuzz\";\n while (cin >> m >> n)\n {\n if (n == 0 && m == 0)\n break;\n\n vector<string> v(n);\n for (int i = 0; i < n; i++)\n cin >> v[i];\n\n vector<int> ans(m, 0);\n int player = 0;\n int cnt = 0;\n for (int i = 1; i <= n; i++)\n {\n string should = \"\";\n if (i % 15 == 0)\n should = fizzbuzz;\n else if (i % 3 == 0)\n should = fizz;\n else if (i % 5 == 0)\n should = buzz;\n else\n should = to_string(i);\n\n if (cnt < m - 1)\n {\n if (v[i - 1] != should)\n {\n ans[player % m]++;\n cnt++;\n }\n\n player++;\n while (ans[player % m])\n player++;\n }\n }\n\n bool ok = false;\n for (int i = 0; i < m; i++)\n {\n if (!ans[i])\n {\n if (ok)\n cout << \" \";\n cout << i + 1;\n ok = true;\n }\n }\n cout << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3900,
"score_of_the_acc": -0.8482,
"final_rank": 18
},
{
"submission_id": "aoj_0221_9111791",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int m, n;\n while (cin >> m >> n, m) {\n int rem = m;\n set<int> st;\n for (int i = 0; i < m; i++) {\n st.insert(i + 1);\n }\n auto it = st.begin();\n for (int i = 1; i <= n; i++) {\n string s, t;\n cin >> s;\n if (rem == 1) continue;\n if (i % 15 == 0) t = \"FizzBuzz\";\n else if (i % 3 == 0) t = \"Fizz\";\n else if (i % 5 == 0) t = \"Buzz\";\n else t = to_string(i);\n if (s != t) {\n it = st.erase(it);\n rem -= 1;\n if (it == st.end()) it = st.begin();\n } else {\n it++;\n if (it == st.end()) it = st.begin();\n }\n }\n bool f = false;\n for (auto id : st) {\n if (f) cout << \" \";\n cout << id;\n f = true;\n }\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3460,
"score_of_the_acc": -0.4202,
"final_rank": 8
},
{
"submission_id": "aoj_0221_8575282",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <string>\nusing namespace std;\nint main(){\n for(int i=1;i<=59;i++){\n int n,m;\n int Y;\n cin>>m>>n;\n Y=m;\n if(m==0&&n==0) break;\n string s[10009];\n queue<int> T;\n for(int j=1;j<=n;j++) cin>>s[j];\n for(int j=1;j<=m;j++) T.push(j);\n for(int j=1;j<=n;j++){\n if(Y==1) break;\n int J=j;\n string CA=std::to_string(J);\n if(j%3==0) CA=\"Fizz\";\n if(j%5==0) CA=\"Buzz\";\n if(j%3==0&&j%5==0) CA=\"FizzBuzz\";\n if(s[j]==CA) {\n T.push(T.front());\n T.pop();\n }\n else {\n T.pop();\n Y--;\n }\n }\n int A[1009];\n for(int j=1;j<=m;j++){\n if(T.empty()) {\n break;\n }\n A[j]=T.front();\n T.pop();\n }\n sort(A+1,A+Y+1);\n for(int j=1;j<=Y;j++){\n if(j<Y) cout<<A[j]<<\" \";\n else cout<<A[j];\n }\n cout<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3588,
"score_of_the_acc": -0.5751,
"final_rank": 13
},
{
"submission_id": "aoj_0221_6943857",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n string a;\n string b;\n int c,d;\n int e;\n int rest;\n int turn;\n int digit;\n int count;\nwhile (true){\n cin>>c>>d;\n if(c==0){\n break;\n }\n vector<int> member(c);\n rest=1;\n turn=0;\n digit=1;\n for(int i=0;i<c;i+=1){\n member.at(i)=i+1;\n }\n for(int i=1;i<=d;i+=1){\n if(i==10||i==100||i==1000||i==10000){\n digit+=1;\n }\n cin>>a;\n if(rest==1){\n if(i%5==0||i%3==0){\n if(i%15==0){\n if(a!=\"FizzBuzz\"){\n member.at(turn)=0;\n }\n }else\n if(i%5==0){\n if(a!=\"Buzz\"){\n member.at(turn)=0;\n }\n }else\n if(i%3==0){\n if(a!=\"Fizz\"){\n member.at(turn)=0;\n }\n }\n }else{\n if(digit==a.size()){\n b=a;\n for(int j=0,k=i;j<digit;j+=1){\n b.at(digit-1-j)=k%10+'0';\n k/=10;\n }\n if(b!=a){\n member.at(turn)=0;\n }\n }else{\n member.at(turn)=0;\n }\n }\n e=turn;\n do{\n turn=(turn+1)%c;\n }while(member.at(turn)==0);\n if(e==turn){\n rest=0;\n }\n }\n }\n count=0;\n for(int i=0;i<c;i+=1){\n if(member.at(i)!=0){\n if(count==0){\n cout<<member.at(i);\n count+=1;\n }else{\n cout<<' '<<member.at(i); \n }\n }\n }\n cout<<endl;\n}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3052,
"score_of_the_acc": -0.084,
"final_rank": 1
},
{
"submission_id": "aoj_0221_6891589",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nll n,m,num;\nbool tf[10000];\nint main(void){\n while(cin>>n>>m,n){\n num=n;\n for(ll i=0;i<n;i++){\n tf[i]=true;\n }\n ll i=0,j=1;\n for(;num>1 && j<=m;j++){\n string s;\n cin>>s;\n string t=to_string(j);\n if(j%15==0){\n t=\"FizzBuzz\";\n }else if(j%5==0){\n t=\"Buzz\";\n }else if(j%3==0){\n t=\"Fizz\";\n }\n if(s!=t){\n num--,tf[i]=false;\n }\n i=(i+1)%n;\n while(!tf[i]){\n i=(i+1)%n;\n }\n }\n for(;j<=m;j++){\n string s;\n cin>>s;\n }\n ll k=0;\n for(ll i=0;i<n;i++){\n if(tf[i]){\n cout<<(k++ ? \" \" : \"\")<<i+1;\n }\n }\n cout<<\"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3472,
"score_of_the_acc": -0.4622,
"final_rank": 9
},
{
"submission_id": "aoj_0221_5747034",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n int m,n;\n cin >> m >> n;\n if(m == 0 && n == 0) break;\n queue<int> que;\n for(int i=1;i<=m;i++) que.push(i);\n for(int i=1;i<=n;i++){\n string S;\n cin >> S;\n if(que.size() == 1) continue;\n if(i%15 == 0){\n if(S == \"FizzBuzz\"){\n int t = que.front();\n que.pop();\n que.push(t);\n }\n else que.pop();\n }\n else if(i%5 == 0){\n if(S == \"Buzz\"){\n int t = que.front();\n que.pop();\n que.push(t);\n }\n else que.pop();\n }\n else if(i%3 == 0){\n if(S == \"Fizz\"){\n int t = que.front();\n que.pop();\n que.push(t);\n }\n else que.pop();\n }\n else{\n int s = 0;\n for(int j=0;j<S.size();j++) s = s*10+S[j]-'0';\n if(s == i){\n int t = que.front();\n que.pop();\n que.push(t);\n }\n else que.pop();\n }\n }\n vector<int> ans(0);\n while(!que.empty()){\n ans.push_back(que.front());\n que.pop();\n }\n sort(ans.begin(),ans.end());\n cout << ans[0];\n for(int i=1;i<ans.size();i++) cout << \" \" << ans[i];\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3124,
"score_of_the_acc": -0.1843,
"final_rank": 3
},
{
"submission_id": "aoj_0221_5742480",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<sstream>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nsigned main(){\n\tint m,n;\n\twhile(cin>>m>>n,m){\n\t\tbool dead[1000]={};\n\t\tint tmp=0,rem=m;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\tstring t;\n\t\t\tif(i%15==0)\n\t\t\t\tt=\"FizzBuzz\";\n\t\t\telse if(i%5==0)\n\t\t\t\tt=\"Buzz\";\n\t\t\telse if(i%3==0)\n\t\t\t\tt=\"Fizz\";\n\t\t\telse\n\t\t\t\tt=to_string(i);\n\t\t\tif(s!=t){\n\t\t\t\tdead[tmp]=1;\n\t\t\t\trem--;\n\t\t\t\tif(rem==1){\n\t\t\t\t\tfor(int j=0;j<n-i;j++)\n\t\t\t\t\t\tcin>>s;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttmp=(tmp+1)%m;\n\t\t\twhile(dead[tmp])\n\t\t\t\ttmp=(tmp+1)%m;\n\t\t}\n\t\tbool fst=1;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tif(dead[i])\n\t\t\t\tcontinue;\n\t\t\tif(fst)\n\t\t\t\tfst=0;\n\t\t\telse\n\t\t\t\tcout<<' ';\n\t\t\tcout<<i+1;\n\t\t}\n\t\tcout<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3332,
"score_of_the_acc": -0.326,
"final_rank": 6
},
{
"submission_id": "aoj_0221_5701150",
"code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcount(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define umap unordered_map\n#define uset unordered_set\nusing namespace std;\nusing ll = long long;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\n//入力系\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\n//出力系\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\n//デバッグ系\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint main(){\n while(1){\n INT(n,m);\n if(m==0)return 0;\n string s;\n int j=0,cnt=0;\n vector<bool> t(n,false);\n for(int i=1;i<=m;i++){\n cin>>s;\n if(cnt==n-1)continue;\n if(i%15==0){\n if(s!=\"FizzBuzz\"){t[j%n]=true;cnt++;}\n }else if(i%5==0){\n if(s!=\"Buzz\"){t[j%n]=true;cnt++;}\n }else if(i%3==0){\n if(s!=\"Fizz\"){t[j%n]=true;cnt++;}\n }else{\n if(stoi(s)!=i){t[j%n]=true;cnt++;}\n }\n if(cnt==n-1)continue;\n j++;\n while(t[j%n])j++;\n }\n vector<int> ans;\n rep(i,n){\n if(!t[i])ans.push_back(i+1);\n }\n if(ans.empty())continue;\n out(ans);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3556,
"score_of_the_acc": -0.5136,
"final_rank": 11
},
{
"submission_id": "aoj_0221_5401732",
"code_snippet": "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n int m, n;\n while (cin >> m >> n, m || n)\n {\n bool p[1000] = {};\n string s, check;\n int remain = m, num = 0;\n for (int i = 1; i <= n; ++i)\n {\n cin >> s;\n if (remain == 1)\n continue;\n if (i % 15 == 0)\n check = \"FizzBuzz\";\n else if (i % 5 == 0)\n check = \"Buzz\";\n else if (i % 3 == 0)\n check = \"Fizz\";\n else\n check = to_string(i);\n if (s != check)\n {\n p[num] = true;\n --remain;\n }\n else\n num = (num + 1) % m;\n while (p[num])\n num = (num + 1) % m;\n }\n for (int i = 0; i < m; ++i)\n {\n if (!p[i])\n {\n cout << i + 1;\n --remain;\n if (remain != 0)\n cout << \" \";\n }\n }\n cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3196,
"score_of_the_acc": -0.224,
"final_rank": 4
},
{
"submission_id": "aoj_0221_5260968",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\nusing namespace std;\nusing P = pair<int,int>;\nusing ll = long long;\n\nconst long double EPS = 1e-10;\nconst int MAX = 1010;\nbool alive[MAX];\n\nint main(){\n\n int m,n;\n string s;\n while(true){\n cin >> m >> n;\n if(m == 0 && n == 0)\n break;\n for(int i = 0 ; i < m ; i++)\n alive[i] = true;\n int turn = 0;\n int remain = m;\n for(int i = 1 ; i <= n ; i++){\n cin >> s;\n if(remain == 1);\n else if(i % 15 == 0){\n if(s != \"FizzBuzz\"){\n alive[turn] = false;\n remain--;\n }\n }\n else if(i % 5 == 0){\n if(s != \"Buzz\"){\n alive[turn] = false;\n remain--;\n }\n }\n else if(i % 3 == 0){\n if(s != \"Fizz\"){\n alive[turn] = false;\n remain--;\n }\n }\n else{\n if(s != to_string(i)){\n alive[turn] = false;\n remain--;\n }\n }\n turn = (turn+1)%m;\n while(!alive[turn])\n turn = (turn+1)%m;\n }\n bool first = true;\n for(int i = 0 ; i < m ; i++){\n if(alive[i]){\n if(first){\n cout << i+1;\n first = false;\n }\n else\n cout << \" \" << i+1;\n }\n }\n cout << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 3228,
"score_of_the_acc": -1.1946,
"final_rank": 20
},
{
"submission_id": "aoj_0221_4844339",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n vector<bool> ok(m);\n for(int i=0; i<m; i++){\n string s;\n cin >> s;\n string a = \"\";\n int j = i+1;\n if(j%3!=0 and j%5!=0){\n a = to_string(j);\n }\n if(j%3 == 0) a += \"Fizz\";\n if(j%5 == 0) a += \"Buzz\";\n if(s == a) ok[i] = true;\n }\n vector<bool> rem(n, true);\n int count = 0;\n int pos = 0;\n for(int i=0; i<m; i++){\n if(!ok[i]){\n rem[pos] = false;\n count++;\n if(count == n-1) break;\n }\n do{\n pos = (pos+1)%n;\n }while(!rem[pos]);\n }\n vector<int> ans;\n for(int i=0; i<n; i++){\n if(rem[i]) ans.push_back(i+1);\n }\n for(int i=0; i<(int)ans.size()-1; i++){\n cout << ans[i] << \" \";\n }\n cout << ans.back() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3228,
"score_of_the_acc": -0.3158,
"final_rank": 5
},
{
"submission_id": "aoj_0221_4733558",
"code_snippet": "#include<string>\n#include<sstream>\n#include<iostream>\nusing namespace std;\nint main(){\n\tfor(int m,n;cin>>m>>n,m;){\n\t\tstatic bool flg[1000];\n\t\tstatic int bef[1000],nxt[1000];\n\t\tfor(int i=0;i<m;i++)\tflg[i]=true,bef[i]=(i+m-1)%m,nxt[i]=(i+1)%m;\n\t\tint pos=0,num=m;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tstring s;\tcin>>s;\n\t\t\tif(num==1)\tcontinue;\n\t\t\tbool ok=1;\n\t\t\tif(i%15==0){\tif(s!=\"FizzBuzz\")\tok=0;\t}\n\t\t\telse if(i%3==0){\tif(s!=\"Fizz\")\tok=0;\t}\n\t\t\telse if(i%5==0){\tif(s!=\"Buzz\")\tok=0;\t}\n\t\t\telse{\n\t\t\t\tstringstream ss;\tss<<i;\n\t\t\t\tif(s!=ss.str())\tok=0;\n\t\t\t}\n\t\t\tif(!ok){\n\t\t\t\tflg[pos]=0;\n\t\t\t\tint tmpb=bef[pos],tmpn=nxt[pos];\n\t\t\t\tbef[tmpn]=tmpb;\n\t\t\t\tnxt[tmpb]=tmpn;\n\t\t\t\tnum--;\n\t\t\t}pos=nxt[pos];\n\t\t}\n\t\tfor(int i=0,j=0;i<m;i++)if(flg[i])\tcout<<(j++?\" \":\"\")<<i+1;\n\t\tcout<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3028,
"score_of_the_acc": -0.1515,
"final_rank": 2
},
{
"submission_id": "aoj_0221_4594321",
"code_snippet": "#include <iostream>\n#include <string>\n#include <list>\n\nstd::string getFizzBuzz(int n)\n{\n\tif (n % 15 == 0)\n\t{\n\t\treturn \"FizzBuzz\";\n\t}\n\telse if (n % 5 == 0)\n\t{\n\t\treturn \"Buzz\";\n\t}\n\telse if (n % 3 == 0)\n\t{\n\t\treturn \"Fizz\";\n\t}\n\telse\n\t{\n\t\treturn std::to_string(n);\n\t}\n}\n\nvoid fizzbuzz(int m, int n)\n{\n\tstd::list<int> lst;\n\n\tfor (int i = 1; i <= m; ++i)\n\t{\n\t\tlst.push_back(i);\n\t}\n\n\tfor (int i = 1; i <= n; ++i)\n\t{\n\t\tstd::string rem;\n\t\tstd::cin >> rem;\n\n\t\tif (lst.size() <= 1)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tint player = *(lst.begin());\n\t\tlst.pop_front();\n\n\t\tstd::string ret = getFizzBuzz(i);\n\n\t\tif (rem == ret)\n\t\t{\n\t\t\tlst.push_back(player);\n\t\t}\n\t}\n\n\tlst.sort();\n\tfor (auto itr = lst.begin(); itr != lst.end(); ++itr)\n\t{\n\t\tif (itr != lst.begin())\n\t\t{\n\t\t\tstd::cout << \" \";\n\t\t}\n\t\tstd::cout << *itr;\n\t}\n\tstd::cout << std::endl;\n\n\treturn;\n}\n\nint main(void)\n{\n\tint m;\n\tint n;\n\n\twhile (std::cin >> m >> n && m != 0 && n != 0)\n\t{\n\t\tfizzbuzz(m, n);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3216,
"score_of_the_acc": -0.5465,
"final_rank": 12
},
{
"submission_id": "aoj_0221_4594288",
"code_snippet": "#include <iostream>\n#include <string>\n#include <list>\n\nstd::string getFizzBuzzString(int n)\n{\n\tif (n % 15 == 0)\n\t{\n\t\treturn \"FizzBuzz\";\n\t}\n\telse if (n % 5 == 0)\n\t{\n\t\treturn \"Buzz\";\n\t}\n\telse if (n % 3 == 0)\n\t{\n\t\treturn \"Fizz\";\n\t}\n\telse\n\t{\n\t\treturn std::to_string(n);\n\t}\n}\n\nvoid fizzbuzz(int m, int n)\n{\n\tstd::list<int> lst;\n\n\tfor (int i = 1; i <= m; ++i)\n\t{\n\t\tlst.push_back(i);\n\t}\n\n\tfor (int i = 1; i <= n; ++i)\n\t{\n\t\tstd::string rem;\n\t\tstd::cin >> rem;\n\n\t\tif (lst.size() <= 1)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tint player = *(lst.begin());\n\t\tlst.pop_front();\n\n\t\tstd::string ret = getFizzBuzzString(i);\n\n\t\tif (rem == ret)\n\t\t{\n\t\t\tlst.push_back(player);\n\t\t}\n\t}\n\n\tlst.sort();\n\tfor (auto itr = lst.begin(); itr != lst.end(); ++itr)\n\t{\n\t\tif (itr != lst.begin())\n\t\t{\n\t\t\tstd::cout << \" \";\n\t\t}\n\t\tstd::cout << *itr;\n\t}\n\tstd::cout << std::endl;\n\n\treturn;\n}\n\nint main(void)\n{\n\tint m;\n\tint n;\n\n\twhile (std::cin >> m >> n && m != 0 && n != 0)\n\t{\n\t\tfizzbuzz(m, n);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3280,
"score_of_the_acc": -0.6088,
"final_rank": 15
},
{
"submission_id": "aoj_0221_4594286",
"code_snippet": "#include <iostream>\n#include <string>\n#include <list>\n\nstd::string getFizzBuzzString(int n)\n{\n\tif (n % 15 == 0)\n\t{\n\t\treturn \"FizzBuzz\";\n\t}\n\telse if (n % 5 == 0)\n\t{\n\t\treturn \"Buzz\";\n\t}\n\telse if (n % 3 == 0)\n\t{\n\t\treturn \"Fizz\";\n\t}\n\telse\n\t{\n\t\treturn std::to_string(n);\n\t}\n}\n\nvoid fizzbuzz(int m, int n)\n{\n\tstd::list<int> lst;\n\n\tfor (int i = 1; i <= m; ++i)\n\t{\n\t\tlst.push_back(i);\n\t}\n\n\tfor (int i = 1; i <= n; ++i)\n\t{\n\t\tstd::string rem;\n\t\tstd::cin >> rem;\n\n\t\tif (lst.size() <= 1)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tint player = *(lst.begin());\n\t\tlst.pop_front();\n\n\t\tstd::string ret = getFizzBuzzString(i);\n\n\t\tif (rem == ret)\n\t\t{\n\t\t\tlst.push_back(player);\n\t\t}\n\t}\n\n\tlst.sort();\n\tfor (auto itr = lst.begin(); itr != lst.end(); ++itr)\n\t{\n\t\tif (itr != lst.begin())\n\t\t{\n\t\t\tstd::cout << \" \";\n\t\t}\n\t\tstd::cout << *itr;\n\t}\n\tstd::cout << std::endl;\n\n\treturn;\n}\n\nint main(void)\n{\n\tint m;\n\tint n;\n\n\twhile (std::cin >> m >> n && m != 0 && n != 0)\n\t{\n\t\tfizzbuzz(m, n);\n\t}\n\tstd::cin >> m;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3240,
"score_of_the_acc": -0.6002,
"final_rank": 14
},
{
"submission_id": "aoj_0221_4594217",
"code_snippet": "#include <iostream>\n#include <string>\n#include <list>\n\nstd::string getFizzBuzzString(int n)\n{\n\tif (n % 15 == 0)\n\t{\n\t\treturn \"FizzBuzz\";\n\t}\n\telse if (n % 5 == 0)\n\t{\n\t\treturn \"Buzz\";\n\t}\n\telse if (n % 3 == 0)\n\t{\n\t\treturn \"Fizz\";\n\t}\n\telse\n\t{\n\t\treturn std::to_string(n);\n\t}\n}\n\nvoid fizzbuzz(int m, int n)\n{\n\tstd::list<int> lst;\n\n\tfor (int i = 1; i <= m; ++i)\n\t{\n\t\tlst.push_back(i);\n\t}\n\n\tfor (int i = 1; i <= n; ++i)\n\t{\n\t\tstd::string rem;\n\t\tstd::cin >> rem;\n\n\t\tif (lst.size() <= 1)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tint player = *(lst.begin());\n\t\tlst.pop_front();\n\n\t\tstd::string ret = getFizzBuzzString(i);\n\n\t\tif (rem == ret)\n\t\t{\n\t\t\tlst.push_back(player);\n\t\t}\n\t}\n\n\tlst.sort();\n\tfor (auto itr = lst.begin(); itr != lst.end(); ++itr)\n\t{\n\t\tif (itr != lst.begin())\n\t\t{\n\t\t\tstd::cout << \" \";\n\t\t}\n\t\tstd::cout << *itr;\n\t}\n\tstd::cout << std::endl;\n\n\treturn;\n}\n\nint main(void)\n{\n\tint m;\n\tint n;\n\n\twhile (true)\n\t{\n\t\tstd::cin >> m >> n;\n\n\t\tif (m == 0 && n == 0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tfizzbuzz(m, n);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3164,
"score_of_the_acc": -0.4959,
"final_rank": 10
}
] |
aoj_0222_cpp
|
四つ子素数
(
a, a+2, a+6, a+8
) のように並んだ 4 つの素数の組を四つ子素数といいます。四つ子素数を構成する四つの素数のうち、最大の数をその四つ子素数の大きさと呼びます。例えば、最も小さい大きさの四つ子素数は、(5, 7, 11, 13) の組であり、その大きさは 13 です。次に大きい四つ子素数は、(11, 13, 17, 19) の組で、その大きさは 19 です。
整数
n
(13 ≤
n
≤ 10,000,000) を入力とし、大きさが
n
以下になるような四つ子素数のうち、最大となるものの大きさを出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットとして１つの整数
n
が１行に与えられます。
データセットの数は 2000 を超えません。
Output
入力データセットごとに、最大となる四つ子素数の大きさを1行に出力します。
Sample Input
13
14
15
16
17
18
19
20
10000
0
Output for the Sample Input
13
13
13
13
13
13
19
19
9439
|
[
{
"submission_id": "aoj_0222_10867077",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint n;\n\tvector<bool> isprime(10000000, true);\n\tisprime[0] = false;\n\tfor (int i = 2; i * i <= 10000000; i++) {\n\t\tif (isprime[i - 1]) {\n\t\t\tfor (int j = 2 * i - 1; j < 10000000; j += i) isprime[j] = false;\n\t\t}\n\t}\n\twhile (1) {\n\t\tcin >> n;\n\t\tif (n == 0) break;\n\t\tfor (int i = n - 8; i >= 2; i--) {\n\t\t\tif (isprime[i - 1]) {\n\t\t\t\tif (isprime[i + 1]) {\n\t\t\t\t\tif (isprime[i + 5]) {\n\t\t\t\t\t\tif (isprime[i + 7]) {\n\t\t\t\t\t\t\tcout << i + 8 << endl;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4608,
"score_of_the_acc": -0.0846,
"final_rank": 2
},
{
"submission_id": "aoj_0222_10853306",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nint main() {\n vector<int> prime;\n vector<bool> is_prime(1e7+1, true);\n is_prime[0] = is_prime[1] = false;\n for(int i=2; i<is_prime.size(); ++i) {\n if(is_prime[i]) {\n prime.push_back(i);\n for(int j=i+i; j<is_prime.size(); j+=i) {\n is_prime[j] = false;\n }\n }\n }\n vector<int> quad;\n for(int i=3; i<prime.size(); ++i) {\n if(prime[i] == prime[i-1] + 2 && prime[i] == prime[i-2] + 6 && prime[i] == prime[i-3] + 8) {\n quad.push_back(prime[i]);\n }\n }\n int n;\n while(cin >> n, n) {\n cout << *(upper_bound(quad.begin(), quad.end(), n) - 1) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 10288,
"score_of_the_acc": -0.2266,
"final_rank": 6
},
{
"submission_id": "aoj_0222_10845967",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n\n vector<int> p(10000001,1);\n p[0]=p[1]=0;\n for(int i=2;i<=10000000;i++){\n if(!p[i]) continue;\n for(int j=i*2;j<=10000000;j+=i){\n p[j]=0;\n }\n }\n\n vector<int> v;\n for(int i=1;i<=10000000-8;i++){\n if(p[i]&&p[i+2]&&p[i+6]&&p[i+8]) v.push_back(i+8);\n }\n\n for(int n;cin>>n,n!=0;){\n cout<<*prev(upper_bound(all(v), n))<<\"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 42488,
"score_of_the_acc": -1.4415,
"final_rank": 20
},
{
"submission_id": "aoj_0222_9047285",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nconst int N = 10000000;\nbool f[N];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n f[0] = f[1] = true;\n vector<int> res;\n for (int i = 2; i < N; i++) {\n if (f[i]) continue;\n for (int j = i + i; j < N; j += i) {\n f[j] = true;\n }\n if (i >= 8 and !f[i] and !f[i - 2] and !f[i - 6] and !f[i - 8]) res.push_back(i);\n }\n int n;\n while (cin >> n, n) {\n auto it = lower_bound(res.begin(), res.end(), n + 1) - res.begin();\n cout << res[it - 1] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 13152,
"score_of_the_acc": -0.1825,
"final_rank": 5
},
{
"submission_id": "aoj_0222_8896698",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n const int lim = 10000050;\n vector<bool> isprime(lim, true);\n isprime[0] = isprime[1] = false;\n for(int i = 2; i < lim; i++){\n if(!isprime[i]) continue;\n for(int j = i+i; j < lim; j += i) isprime[j] = false;\n }\n\n vector<int> ans;\n for(int i = 2; i < lim; i++){\n if(isprime[i] && isprime[i+2] && isprime[i+6] && isprime[i+8]){\n ans.emplace_back(i+8);\n }\n }\n\n while(true){\n int n; cin >> n;\n if(n == 0) break;\n\n int ac = -1, wa = ans.size();\n while(wa-ac > 1){\n int wj = (wa+ac)/2;\n (ans[wj] <= n ? ac : wa) = wj;\n }\n cout << ans[ac] << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3936,
"score_of_the_acc": -0.2308,
"final_rank": 7
},
{
"submission_id": "aoj_0222_7180490",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vvvvvll = vector<vvvvll>;\nusing vvvvvvll = vector<vvvvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vvvvb = vector<vvvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vvvvd = vector<vvvd>;\nusing vvvvvd = vector<vvvvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (a == 0)return b;\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\nll sqrtz(ll N) {\n ll L = 0;\n ll R = sqrt(N) + 10000;\n while (abs(R - L) > 1) {\n ll mid = (R + L) / 2;\n if (mid * mid <= N)L = mid;\n else R = mid;\n }\n return L;\n\n}\n\n/*\nusing mint = modint998244353;\n//using Mint = modint;\nvector<mint> fact, factinv, inv;\nconst ll mod = 998244353;\nvoid prenCkModp(ll n) {\n fact.resize(n + 5);\n factinv.resize(n + 5);\n inv.resize(n + 5);\n fact[0] = fact[1] = 1;\n factinv[0] = factinv[1] = 1;\n inv[1] = 1;\n for (ll i = 2; i < n + 5; i++) {\n fact[i] = (fact[i - 1] * i);\n inv[i] = mod - (inv[mod % i] * (mod / i));\n factinv[i] = (factinv[i - 1] * inv[i]);\n }\n\n}\n\nmint nCk(ll n, ll k) {\n if (n < k || k < 0) return 0;\n return fact[n] * (factinv[k] * factinv[n - k]);\n}\n*/\n\ntemplate<class T>\nvector<vector<T>> mul(vector<vector<T>> A, vector<vector<T>> B) {\n ll N = A.size();\n vector<vector<T>> res(N, vector<T>(N, 0));\n rep(i, N)rep(j, N)rep(k, N) {\n res[i][j] += A[i][k] * B[k][j];\n }\n return res;\n}\n\nvll S(vll V,ll A){\n A--;\n vll res;\n res.push_back(V[A]);\n rep(i,V.size()){\n if(i!=A)res.push_back(V[i]);\n }\n return res;\n}\n\nint main() {\n\n \n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n \n ll INF=1e7+10;\n vb P(INF,1);\n P[0]=P[1]=0;\n rep(i,INF)if(P[i])for(int j=i+i;j<INF;j+=i)P[j]=0;\n vll M;\n rep(i,INF)if(P[i]&&P[i+2]&&P[i+6]&&P[i+8])M.push_back(i+8);\n while(1){\n cin>>INF;\n if(INF==0)return 0;\n auto p=upper_bound(all(M),INF);\n p--;\n cout<<*p<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4060,
"score_of_the_acc": -0.1553,
"final_rank": 3
},
{
"submission_id": "aoj_0222_6888968",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nbitset<10000001> bs;\nint main(void){\n bs.set();\n ll i,j;\n for(i=2;i<sqrt(10000001);i++){\n if(bs[i]){\n for(j=i*i;j<10000001;j+=i){\n bs[j]=0;\n }\n }\n }\n while(cin>>i,i){\n i-=(i-1)%6;\n while(!(bs[i] && bs[i-2] && bs[i-6] && bs[i-8])){\n i-=6;\n }\n cout<<i<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4660,
"score_of_the_acc": -0.0083,
"final_rank": 1
},
{
"submission_id": "aoj_0222_6634276",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n// 1 以上 N 以下の整数が素数かどうかを返す\nvector<bool> Eratosthenes(int N) {\n // テーブル\n vector<bool> isprime(N+1, true);\n\n // 0, 1 は予めふるい落としておく\n isprime[0] = isprime[1] = false;\n\n // ふるい\n for (int p = 2; p <= N; ++p) {\n // すでに合成数であるものはスキップする\n if (!isprime[p]) continue;\n\n // p 以外の p の倍数から素数ラベルを剥奪\n for (int q = p * 2; q <= N; q += p) {\n isprime[q] = false;\n }\n }\n\n // 1 以上 N 以下の整数が素数かどうか\n return isprime;\n}\nint main(){\n vector<bool> isprime = Eratosthenes(10000000);\n vector<int> ans(10000001);\n ans[13] = 13;\n for(int i = 14; i <= 10000000; i++){\n ans[i] = ans[i-1];\n if(isprime[i] && isprime[i-2] && isprime[i-6] && isprime[i-8]) ans[i] = i;\n }\n \n while(true){\n int x;\n cin >> x;\n if(x == 0) return 0;\n cout << ans[x] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 42852,
"score_of_the_acc": -0.6765,
"final_rank": 17
},
{
"submission_id": "aoj_0222_6080394",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <vector>\nusing namespace std;\n \nvoid makeprime(vector<bool>&prime,int N){\n \n prime[0]=prime[1]=false;\n prime[2]=prime[3]=true;\n int i=2;\n while (true){\n if (i*2>=N) \n break;\n else{\n prime[i*2]=false;\n i+=1;\n }\n }\n i=0;\n while(true){\n if (3+2*i>=N)break;\n int j=2;\n if (prime[3+2*i]==true){\n while ((3+2*i)*j<N){\n prime[(3+2*i)*j]=false;\n j+=1;\n }\n }\n i+=1;\n }\n}\n\nint main(void){\nlong N=10000001;\nvector<bool>prime(N,true);\n\nmakeprime(prime,N);\n\n int n;\n while (true){\n cin>>n;\n if (n==0) return 0;\n int m=n;\n while (true){\n if (prime[m]==true and prime[m-2]==true and prime[m-6]==true and prime[m-8]==true){\n std::cout << m << std::endl;\n break;\n }else\n m-=1;\n \n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3944,
"score_of_the_acc": -0.2309,
"final_rank": 8
},
{
"submission_id": "aoj_0222_5834873",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nbool prime[10000001];\nint ans[10000001];\nsigned main(){\n\tfor(int i=2;i<=10000000;i++)\n\t\tprime[i]=1;\n\tfor(int i=2;i*i<=10000000;i++)\n\t\tif(prime[i])\n\t\t\tfor(int j=i*i;j<=10000000;j+=i)\n\t\t\t\tprime[j]=0;\n\tfor(int i=8;i<=10000000;i++){\n\t\tif(prime[i-8]&&prime[i-6]&&prime[i-2]&&prime[i])\n\t\t\tans[i]=i;\n\t\telse\n\t\t\tans[i]=ans[i-1];\n\t}\n\tint n;\n\twhile(cin>>n,n)\n\t\tcout<<ans[n]<<endl;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 91252,
"score_of_the_acc": -1.0769,
"final_rank": 19
},
{
"submission_id": "aoj_0222_5745469",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n vector<bool> IsPrime(10000001,true);\n for(int i=2;i<=10000000;i++){\n if(!IsPrime[i]) continue;\n for(int j=i*2;j<=10000000;j+=i) IsPrime[j] = false;\n }\n vector<int> ans(10000001,0);\n for(int i=13;i<=10000000;i++){\n if(IsPrime[i] && IsPrime[i-2] && IsPrime[i-6] && IsPrime[i-8]) ans[i] = i;\n else ans[i] = ans[i-1];\n }\n for(;;){\n int n;\n cin >> n;\n if(n == 0) break;\n cout << ans[n] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 42964,
"score_of_the_acc": -0.9085,
"final_rank": 18
},
{
"submission_id": "aoj_0222_5701617",
"code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcount(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define umap unordered_map\n#define uset unordered_set\nusing namespace std;\nusing ll = long long;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\n//入力系\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\n//出力系\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\n//デバッグ系\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint main(){\n int m=10000000;\n vector<bool> p(m+1,true);\n set<int> S;\n p[0]=p[1]=false;\n for(int i=2;i<=m;i++){\n if(!p[i])continue;\n if(i>=13&&p[i]&&p[i-2]&&p[i-6]&&p[i-8]){\n S.insert(i);\n }\n for(int j=2*i;j<=m;j+=i){\n p[j]=false;\n }\n }\n int n;\n while(1){\n in(n);\n if(n==0)return 0;\n auto it=S.upper_bound(n);\n it--;\n out(*it);\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4160,
"score_of_the_acc": -0.1564,
"final_rank": 4
},
{
"submission_id": "aoj_0222_5514660",
"code_snippet": "#define _USE_MATH_DEFIMES\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <deque>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <regex>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\nconst int MOD = 1'000'000'007;\nconst int MOD2 = 998'244'353;\nconst int INF = 1'000'000'000; //1e9\nconst int NIL = -1;\nconst long long LINF = 1'000'000'000'000'000'000; // 1e18\nconst long double EPS = 1E-10;\n\ntemplate<class T, class S> inline bool chmax(T &a, const S &b){\n if(a < b){\n a = b; return true;\n }\n return false;\n}\ntemplate<class T, class S> inline bool chmin(T &a, const S &b){\n if(b < a){\n a = b; return true;\n }\n return false;\n}\n\n\n\n\n\n\n\n\nstd::vector<bool> isPrime;\n\nvoid Eratosthenes(int n){\n if(n + 1 <= int(isPrime.size())) return;\n isPrime.resize(n+1, true);\n isPrime[0] = isPrime[1] = false;\n\n for(int i = 2; i * i <= n; ++i){\n if(isPrime[i]){\n for(int j = i; i * j <= n; ++j)\n isPrime[i*j] = false;\n }\n }\n}\n\nint main(){\n Eratosthenes(10'000'001);\n int n;\n std::vector<int> ans(10'000'001);\n ans[13] = 13;\n for(int i{14}; i <= 10'000'000; ++i){\n ans[i] = ans[i-1];\n if(isPrime[i] && isPrime[i-2] && isPrime[i-6] && isPrime[i-8]){\n ans[i] = i;\n }\n }\n while(1){\n std::cin >> n;\n if(!n) return 0;\n std::cout << ans[n] << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 42928,
"score_of_the_acc": -0.5235,
"final_rank": 15
},
{
"submission_id": "aoj_0222_5262320",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\nusing namespace std;\nusing P = pair<int,int>;\nusing ll = long long;\n\nconst long double EPS = 1e-10;\nconst int MAX = 10000100;\nbool prime[MAX];\n\nvoid eratosthenes(){\n for(int i = 0 ; i < MAX ; i++)\n prime[i] = true;\n prime[0] = prime[1] = false;\n for(int i = 4 ; i < MAX ; i += 2)\n prime[i] = false;\n for(int i = 3 ; i < (int)sqrt(MAX) ; i += 2){\n if(prime[i]){\n for(int j = i*2 ; j < MAX ; j += i)\n prime[j] = false;\n }\n }\n}\n\nint main(){\n\n ll n;\n\n eratosthenes();\n while(true){\n cin >> n;\n if(n == 0)\n break;\n for(int i = n ; i >= 8 ; i--){\n if(prime[i]&&prime[i-2]&&prime[i-6]&&prime[i-8]){\n cout << i << endl;\n break;\n }\n }\n }\n\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 12856,
"score_of_the_acc": -0.3329,
"final_rank": 12
},
{
"submission_id": "aoj_0222_5251819",
"code_snippet": "//#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"avx,avx2,fma\")\n//#pragma GCC optimization (\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n\n#define ll long long\n#define ld long double\n#define mod 1000000007\n#define pb push_back\n#define inf 1000000000000000000\n#define ff first\n#define ss second\n#define deb(x) cout<<#x<<\" \"<<x<<\"\\n\"\n#define Clear(x) memset(x,0,sizeof(x))\n#define all(x) (x).begin(),(x).end()\n\nvoid checkpoint1()\n{\n\t/******think more code less******/\n\tios_base::sync_with_stdio(false);\n\tcin.tie(NULL);\n\t\n}\n\nbool comp(pair< ll,ll > &a,pair< ll,ll > &b)\n{\n\tif(a.ff!=b.ff)\n\t\treturn a.ff<b.ff;\n\telse\n\t{\n\t\tif(a.ss>b.ss)\n\t\t\treturn b.ss<a.ss;\n\t\telse if(a.ss<b.ss)\n\t\t\treturn a.ss<b.ss;\n\t}\n\treturn a.ff>b.ff;\n}\n\nll powe(ll a,ll b)\n{\n\tll res=1;\n\twhile(b>0)\n\t{\n\t\tif(b&1)\n\t\t{\n\t\t\tres*=a;\n\t\t\tres%=mod;\n\t\t}\n\t\ta*=a;\n\t\ta%=mod;\n\t\tb>>=1;\n\t}\n\treturn res;\n}\nbool p[10000001];\n\nvoid terminAtor()\n{\n\tp[0]=p[1]=1;\n\tvector<ll> a;\n\tfor(ll i=2;i<10000001;i++)\n\t{\n\t if(p[i]==0)\n\t {\n\t a.pb(i);\n\t for(ll j=i*i;j<10000001;j+=i)\n\t p[j]=1;\n\t }\n\t}\n\t\n\tll n;\n\twhile(cin>>n)\n\t{\n\t auto it=lower_bound(all(a),n);\n\t ll m;\n\t if(it==a.end()){\n\t m=a.size();\n\t m--;\n\t }\n\t else\n\t {\n\t m=it-a.begin();\n\t }\n\t while(m>0)\n\t {\n\t if(a[m]>n)\n\t m--;\n\t if(p[a[m]]==0&&p[a[m]-2]==0&&p[a[m]-6]==0&&p[a[m]-8]==0)\n\t {\n\t cout<<a[m]<<\"\\n\";\n\t break;\n\t }\n\t m--;\n\t }\n\t}\n\n}\n\nint main()\n{\t\n\tcheckpoint1();\n/********************************************************/\t\n\t\n/*******************************************************/\t\n\t\n\tterminAtor();\n\n\n/*******************************************************/\t\n\t\n/*******************************************************/\t\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 20828,
"score_of_the_acc": -0.4242,
"final_rank": 14
},
{
"submission_id": "aoj_0222_4982264",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nconst int m = 10000000;\nbool np[m + 1];\nint main() {\n init();\n\n for (int i = 2; i <= m; ++i) {\n if (np[i])continue;\n for (int j = i * 2; j <= m; j += i)\n np[j] = true;\n }\n\n for (int n; cin >> n, n;) {\n for (;; --n)if (!(np[n] || np[n - 2] || np[n - 6] || np[n - 8])) {\n print(n);\n break;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 13056,
"score_of_the_acc": -0.2583,
"final_rank": 11
},
{
"submission_id": "aoj_0222_4982259",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#define line cout << \"-----------------------------\\n\"\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nconst int m = 10000000;\nbool np[m + 1];\nint main() {\n init();\n\n for (int i = 2; i <= m; ++i) {\n if (np[i])continue;\n for (int j = i * 2; j <= m; j += i)\n np[j] = true;\n }\n\n for (int n; cin >> n, n;) {\n for (;; --n)if (!(np[n] || np[n - 2] || np[n - 6] || np[n - 8])) {\n print(n);\n break;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 12904,
"score_of_the_acc": -0.5642,
"final_rank": 16
},
{
"submission_id": "aoj_0222_4982256",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nconst int m = 10000000;\nbool np[m + 1];\nint main() {\n init();\n\n for (int i = 2; i <= m; ++i) {\n if (np[i])continue;\n for (int j = i * 2; j <= m; j += i)\n np[j] = true;\n }\n\n for (int n; cin >> n, n;) {\n for (;; --n)if (!(np[n] || np[n - 2] || np[n - 6] || np[n - 8])) {\n print(n);\n break;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 12984,
"score_of_the_acc": -0.2575,
"final_rank": 9
},
{
"submission_id": "aoj_0222_4982254",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#define line cout << \"-----------------------------\\n\"\n#ifdef _DEBUG\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nconst int m = 10000000;\nbool np[m + 1];\nint main() {\n init();\n\n for (int i = 2; i <= m; ++i) {\n if (np[i])continue;\n for (int j = i * 2; j <= m; j += i)\n np[j] = true;\n }\n\n for (int n; cin >> n, n;) {\n for (;; --n)if (!(np[n] || np[n - 2] || np[n - 6] || np[n - 8])) {\n print(n);\n break;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 12984,
"score_of_the_acc": -0.2575,
"final_rank": 9
},
{
"submission_id": "aoj_0222_4982246",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#define line cout << \"-----------------------------\\n\"\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nconst int m = 10000000;\nbool np[m + 1];\nint main() {\n init();\n\n VI p;\n for (int i = 2; i <= m; ++i) {\n if (np[i])continue;\n if (13 <= i && !(np[i] || np[i - 2] || np[i - 6] || np[i - 8]))\n p.emplace_back(i);\n for (int j = i * 2; j <= m; j += i)\n np[j] = true;\n }\n\n for (int n; cin >> n, n;)\n print(*--upper_bound(all(p), n));\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 13120,
"score_of_the_acc": -0.336,
"final_rank": 13
}
] |
aoj_0225_cpp
|
こぶたぬきつねこ
A子さんの家に親戚のB男君がやってきました。彼は3歳で歌が大好きです。彼は幼稚園でならった「こぶたぬきつねこ」(山本直純作詞・作曲)という歌を一生懸命に歌っています。この歌では、4つのことば「こぶた」 「たぬき」 「きつね」「ねこ」が順にしりとりになっていて、さらに最後の音と最初の音が同じになっています。B男君は、A子さんに、同じようなしりとりが、B男君が言った単語から作れるか教えて欲しいと言われました。
そこで、A子さんを助けるために、与えられた単語から、その単語をすべて使って、順にしりとりをつくり、その上で、 第1 の単語の最初の文字と最終の単語の最後の文字が同じであるようにできるか否かを判定するプログラムを作成しましょう。
n
個の単語を入力とし、それらの単語の組からしりとりを作成できるか否かを判定し、可能な場合はOK と、不可能な場合は NG と出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
word
1
word
2
:
word
n
1 行目に単語の個数
n
(2 ≤
n
≤ 10000) が与えられます。続く
n
行に
n
個の単語
word
i
(32 文字以下の半角英小文字だけからなる文字列) が与えられます。
データセットの数は 50 を超えません。
Output
入力データセットごとに、判定結果を１行に出力します。
Sample Input
5
apple
yellow
georgia
king
email
7
apple
yellow
georgia
king
email
wink
lucky
0
Output for the Sample Input
NG
OK
|
[
{
"submission_id": "aoj_0225_10849095",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint dfs(int v, vector<vector<int>> const& es, vector<bool>& visited) {\n int res = 1;\n visited[v] = true;\n for(int i=0; i<es[v].size(); ++i) {\n if(!visited[es[v][i]]) {\n res += dfs(es[v][i], es, visited);\n }\n }\n return res;\n}\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<int> first(26), last(26);\n vector<vector<int>> edge(26);\n vector<bool> visited(26);\n set<char> appear;\n for(int i=0; i<n; ++i) {\n string s;\n cin >> s;\n first[s[0] - 'a']++;\n last[s.back() - 'a']++;\n edge[s[0]-'a'].push_back(s.back() - 'a');\n appear.insert(s[0]-'a');\n appear.insert(s.back()-'a');\n }\n bool ok = dfs(*appear.begin(), edge, visited) == appear.size();\n for(int i=0; i<26; ++i) {\n ok &= first[i] == last[i];\n }\n if(ok) {\n cout << \"OK\" << endl;\n } else {\n cout << \"NG\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3540,
"score_of_the_acc": -0.613,
"final_rank": 12
},
{
"submission_id": "aoj_0225_6899846",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nll n;\nstring s;\nint main(void){\n while(cin>>n,n){\n ll a[26][26]={},b[26]={},c[26][26],d1=0,d2=0,e1=0,e2=0;\n for(ll i=0;i<n;i++){\n cin>>s;\n a[s[0]-'a'][s[s.size()-1]-'a']++;\n b[s[0]-'a']++;\n b[s[s.size()-1]-'a']++;\n }\n for(ll i=0;i<26;i++){\n for(ll j=0;j<26;j++){\n e1+=a[i][j];\n e2+=a[j][i];\n }\n if(e1!=e2){\n d1++;\n }\n e1=e2=0;\n }\n if(!d1){\n for(ll i=0;i<26;i++){\n for(ll j=0;j<26;j++){\n c[i][j]=(a[i][j] ? 1 : 1e9);\n }\n }\n }\n if(!d1){\n for(ll k=0;k<26;k++){\n for(ll i=0;i<26;i++){\n for(ll j=0;j<26;j++){\n c[i][j]=min(c[i][j],c[i][k]+c[k][j]);\n }\n }\n }\n }\n if(!d1){\n for(ll i=0;i<26;i++){\n for(ll j=0;j<26;j++){\n if(i!=j && b[i] && b[j] && c[i][j]==1e9){\n d2++;\n }\n }\n }\n }\n cout<<((d1 || d2) ? \"NG\\n\" : \"OK\\n\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3124,
"score_of_the_acc": -0.1609,
"final_rank": 2
},
{
"submission_id": "aoj_0225_6704469",
"code_snippet": "// common part begin\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <cfenv>\n#include <cfloat>\n#include <chrono>\n#include <cinttypes>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <fstream>\n#include <functional>\n#include <initializer_list>\n#include <iomanip>\n#include <ios>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <streambuf>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <typeinfo>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n#define INF (1ll) << 60\n#define rep(i, n) for (long long i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntypedef long double ld;\ntypedef long long ll;\ntypedef unsigned long long ull;\nvoid chmax(ll &a, ll b)\n{\n if (a < b)\n a = b;\n}\nvoid chmin(ll &a, ll b)\n{\n if (a > b)\n {\n a = b;\n }\n}\n// common part end\n#define hi_ cout << \"hi\" << endl;\n#define yes cout << \"yes\" << endl\n#define no cout << \"no\" << endl\n#define Yes cout << \"Yes\" << endl\n#define No cout << \"No\" << endl\n#define llV(name, size) \\\n std::vector<long long> name(size); \\\n for (unsigned int i = 0; i < size; i++) \\\n cin >> name[i]\n#define die(x) \\\n cout << x << endl; \\\n return 0;\nclass Print\n{\npublic:\n Print() {}\n};\n\nvoid operator<<(Print p, vector<ll> v)\n{\n for (auto i : v)\n cout << i << \" \";\n cout << endl;\n}\n\nvoid operator<<(Print p, vector<vector<ll>> v)\n{\n for (auto i : v)\n {\n for (auto j : i)\n {\n cout << j << \" \";\n }\n cout << endl;\n }\n}\n\nvoid operator<<(Print p, ull x)\n{\n cout << x << endl;\n}\nvoid operator<<(Print p, vector<ull> v)\n{\n for (auto i : v)\n cout << i << \" \";\n cout << endl;\n}\n\nvoid operator<<(Print p, vector<vector<ull>> v)\n{\n for (auto i : v)\n {\n for (auto j : i)\n {\n cout << j << \" \";\n }\n cout << endl;\n }\n}\n\nvoid operator<<(Print p, ll x)\n{\n cout << x << endl;\n}\n\nvoid operator<<(Print p, string s)\n{\n cout << s << endl;\n}\nvoid operator<<(Print p, vector<string> s)\n{\n for (auto i : s)\n cout << i << endl;\n}\n\nvoid operator<<(Print p, vector<pair<pair<ll, ll>, ll>> v)\n{\n for (auto i : v)\n {\n cout << i.first.first << \" \" << i.first.second << \" \" << i.second << endl;\n }\n}\nvoid operator<<(Print p, vector<pair<ll, pair<ll, ll>>> v)\n{\n for (auto i : v)\n {\n cout << i.first << \" \" << i.second.first << \" \" << i.second.second << endl;\n }\n}\nvoid operator<<(Print p, pair<ll, ll> v)\n{\n cout << v.first << \" \" << v.second << endl;\n}\n\nPrint print;\n\n// //0-1 dfs\n// class Maze\n// {\n// public:\n// vector<vector<ll>> G;\n// ll H, W;\n// function<vector<pair<pair<ll, ll>, ll>>(pair<ll, ll>)> destination;\n// Maze(vector<vector<ll>> G_, function<vector<pair<pair<ll, ll>, ll>>( pair<ll, ll>)> destination_) : G(G_), H(G_.size()), W(G_.at(0).size()), destination(destination_)\n// {\n// }\n\n// void solve(pair<ll, ll> S, pair<ll, ll> T)\n// {\n// deque<pair<pair<ll, ll>, ll>> q;\n// q.push({S, 0});\n// while (!q.empty())\n// {\n// pair<ll, ll> now = q.front().first;\n// ll c = q.front().second;\n// q.pop();\n// auto next = destination(now);\n// for (auto n : next)\n// {\n\n// }\n// }\n// }\n// };\n// class Maze01\n// {\n// public:\n// vector<vector<ll>> G;\n// function<vector<pair<pair<ll, ll>, ll>>(pair<ll, ll>)> destination;\n// ll H, W;\n// // 1 is # 0 is .\n// Maze01(vector<vector<ll>> G_, function<vector<pair<pair<ll, ll>, ll>>(pair<ll, ll>)> destination_) : G(G_), H(G.size()), W(G.at(0).size()), destination(destination_)\n// {\n// }\n\n// vector<vector<ll>> solve(pair<ll, ll> S)\n// {\n// if (G[S.first][S.second] == 1)\n// return vector<vector<ll>>(H, vector<ll>(W, INF));\n// deque<pair<pair<ll, ll>, ll>> q;\n// q.push_back({S, 0});\n// vector<vector<ll>> dis(H, vector<ll>(W, INF));\n// dis[S.first][S.second] = 0;\n// while (!q.empty())\n// {\n// auto now = q.front();\n// q.pop_front();\n// auto next = destination(now.first);\n// for (auto n : next)\n// {\n// ll h = n.first.first;\n// ll w = n.first.second;\n// ll c = n.second;\n// if (h < 0 || H <= h || w < 0 || w >= W)\n// {\n// continue;\n// }\n// if (dis[h][w] != INF)\n// continue;\n// if (G[h][w] == 1)\n// continue;\n// dis[h][w] = dis[now.first.first][now.first.second] + c;\n// if (c)\n// {\n// q.push_back({{h, w}, c});\n// }\n// else\n// {\n// q.push_front({{h, w}, c});\n// }\n// }\n// }\n// return dis;\n// }\n// };\n\n// class Maze\n// {\n// public:\n// vector<vector<ll>> G;\n// function<vector<pair<ll, ll>>(pair<ll, ll>)> destination;\n// ll H, W;\n// // 1 is # 0 is .\n// Maze(vector<vector<ll>> G_, function<vector<pair<ll, ll>>(pair<ll, ll>)> destination_) : G(G_), H(G.size()), W(G.at(0).size()), destination(destination_)\n// {\n// }\n\n// vector<vector<ll>> solve(pair<ll, ll> S)\n// {\n// if (G[S.first][S.second] == 1)\n// return vector<vector<ll>>(H, vector<ll>(W, INF));\n// queue<pair<ll, ll>> q;\n// q.push(S);\n// vector<vector<ll>> dis(H, vector<ll>(W, INF));\n// dis[S.first][S.second] = 0;\n// while (!q.empty())\n// {\n// auto now = q.front();\n// q.pop();\n// auto next = destination(now);\n// for (auto n : next)\n// {\n// if (n.first < 0 || H <= n.first || n.second < 0 || n.second >= W)\n// {\n// continue;\n// }\n// if (dis[n.first][n.second] != INF)\n// continue;\n// if (G[n.first][n.second] == 1)\n// continue;\n// dis[n.first][n.second] = dis[now.first][now.second] + 1;\n// q.push({n.first, n.second});\n// }\n// }\n// return dis;\n// }\n// };\ntemplate <typename T>\nmap<T, T> prime_factor(T n)\n{\n map<T, T> ret;\n for (T i = 2; i * i <= n; i++)\n {\n T tmp = 0;\n while (n % i == 0)\n {\n tmp++;\n n /= i;\n }\n ret[i] = tmp;\n }\n if (n != 1)\n ret[n] = 1;\n return ret;\n}\nconst int N_MAX = 2000000;\nll spf[N_MAX]; // smallest prime factors\nvoid prepare_factorize()\n{\n rep(i, N_MAX) spf[i] = i;\n for (int p = 2; p * p <= N_MAX; p++)\n {\n for (int i = p; i < N_MAX; i += p)\n {\n if (spf[i] == i)\n spf[i] = p;\n }\n }\n}\n\n// 素因数分解\n// その素因数が何個あるかのmapを返す\nmap<ll, ll> factorize_fast(ll n)\n{\n if (spf[1] == 0)\n {\n // p(\"please initialize\");\n exit(0);\n }\n map<ll, ll> mp;\n while (n != 1)\n {\n ll p = spf[n];\n mp[p]++;\n n /= p;\n }\n return mp;\n}\n\n// 約数の種類数\n// 6 => 1, 2, 3, 6なので4\nll yaku(ll n)\n{\n auto mp = factorize_fast(n);\n ll ret = 1;\n for (auto pa : mp)\n {\n ret *= (pa.second + 1);\n }\n return ret;\n}\n\nclass SCC\n{\npublic:\n vector<ll> used;\n vector<ll> rused;\n vector<vector<ll>> G;\n vector<vector<ll>> rG;\n vector<ll> vs;\n vector<ll> cmp;\n vector<vector<ll>> groups; // groupごとの要素を記録。\n ll N;\n SCC(ll N_, vector<vector<ll>> G_) : N(N_), used(N_), rused(N_), G(G_), rG(N_), cmp(N_, -1), groups(N_)\n {\n rep(i, N)\n {\n for (auto e : G[i])\n {\n rG[e].push_back(i);\n }\n }\n }\n void dfs(ll now)\n {\n used[now] = 1;\n for (auto e : G[now])\n {\n if (used[e])\n continue;\n dfs(e);\n }\n vs.push_back(now);\n }\n void rdfs(ll now, ll k)\n {\n rused[now] = 1;\n cmp[now] = k;\n groups[k].push_back(now);\n for (auto e : rG[now])\n {\n if (rused[e])\n continue;\n rdfs(e, k);\n }\n }\n ll scc()\n {\n ll k = 0;\n rep(i, N)\n {\n if (!used[i])\n dfs(i);\n }\n for (ll i = vs.size() - 1; i >= 0; i--)\n {\n if (!rused[vs[i]])\n {\n rdfs(vs[i], k);\n k++;\n }\n }\n return k;\n }\n};\n\ntemplate <int MOD>\nstruct ModInt\n{\n static const int Mod = MOD;\n unsigned x;\n ModInt() : x(0) {}\n ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\n ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\n int get() const { return (int)x; }\n ModInt &operator+=(ModInt that)\n {\n if ((x += that.x) >= MOD)\n x -= MOD;\n return *this;\n }\n ModInt &operator-=(ModInt that)\n {\n if ((x += MOD - that.x) >= MOD)\n x -= MOD;\n return *this;\n }\n ModInt &operator*=(ModInt that)\n {\n x = (unsigned long long)x * that.x % MOD;\n return *this;\n }\n ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }\n ModInt operator+(ModInt that) const { return ModInt(*this) += that; }\n ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }\n ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }\n ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }\n ModInt inverse() const\n {\n long long a = x, b = MOD, u = 1, v = 0;\n while (b)\n {\n long long t = a / b;\n a -= t * b;\n std::swap(a, b);\n u -= t * v;\n std::swap(u, v);\n }\n return ModInt(u);\n }\n bool operator==(ModInt that) const { return x == that.x; }\n bool operator!=(ModInt that) const { return x != that.x; }\n ModInt operator-() const\n {\n ModInt t;\n t.x = x == 0 ? 0 : Mod - x;\n return t;\n }\n};\n\ntemplate <int MOD>\nostream &operator<<(ostream &st, const ModInt<MOD> a)\n{\n st << a.get();\n return st;\n};\n\ntemplate <int MOD>\nModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k)\n{\n ModInt<MOD> r = 1;\n while (k)\n {\n if (k & 1)\n r *= a;\n a *= a;\n k >>= 1;\n }\n return r;\n}\n\ntypedef ModInt<1000000000 + 7> mint1_7;\ntypedef ModInt<998244353> mint9_3;\nclass CC\n{\npublic:\n vector<ll> used;\n vector<vector<ll>> G;\n vector<vector<ll>> groups; // groupごとの要素を記録。\n ll N;\n CC(ll N_, vector<vector<ll>> G_) : N(N_), used(N_), G(G_), groups(N_)\n {\n }\n void dfs(ll now, ll group)\n {\n groups[group].push_back(now);\n used[now] = 1;\n for (auto e : G[now])\n {\n if (used[e])\n continue;\n dfs(e, group);\n }\n }\n\n ll cc()\n {\n ll k = 0;\n rep(i, N)\n {\n if (!used[i])\n {\n dfs(i, k);\n k++;\n }\n }\n return k;\n }\n};\nint main()\n{\n while (true)\n {\n ll n;\n cin >> n;\n vector<ll> out_deg(26),in_deg(26);\n vector<vector<ll>> G(26);\n if (n == 0)\n break;\n rep(i, n)\n {\n string S;\n cin >> S;\n ll u = S[0] - 97;\n ll t = S[S.length() - 1] - 97;\n out_deg[u]++;\n in_deg[t]++;\n G[u].push_back(t);\n G[t].push_back(u);\n }\n CC S(G.size(), G);\n ll c = 0;\n rep(i, G.size()) if (G[i].size() == 0) c++;\n ll k = S.cc();\n if (k - c != 1)\n {\n cout << \"NG\" << endl;\n continue;\n }\n // print<<in_deg;print<<out_deg;\n bool flag = true;\n rep(i, 26) if ((in_deg[i]!=out_deg[i])) flag = false;\n if (flag)\n {\n cout << \"OK\" << endl;\n }\n else\n {\n cout << \"NG\" << endl;\n }\n\n }\n}\n\n// memo\n// igaito maniau",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3540,
"score_of_the_acc": -0.613,
"final_rank": 12
},
{
"submission_id": "aoj_0225_5858703",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nstruct UnionFind{\n vector<int> par,siz;\n UnionFind(int n):par(n,-1),siz(n,1){}\n int root(int x){\n if(par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n bool issame(int x,int y){\n if(root(x) == root(y)) return true;\n else return false;\n }\n bool unite(int x,int y){\n x = root(x);\n y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) swap(x,y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n int size(int x){\n return siz[root(x)];\n }\n};\n\nint main(){\n for(;;){\n int N;\n cin >> N;\n if(N == 0) break;\n UnionFind uf(26);\n vector<bool> appear(26,false);\n vector<vector<int>> C(26,vector<int>(2,0));\n for(int i=0;i<N;i++){\n string word;\n cin >> word;\n char a = word[0];\n char b = word.back();\n uf.unite(a-'a',b-'a');\n appear[a-'a'] = true;\n appear[b-'a'] = true;\n C[a-'a'][0]++;\n C[b-'a'][1]++;\n }\n bool allsame = true;\n for(int i=0;i<26;i++) if(C[i][0] != C[i][1]) allsame = false;\n vector<bool> seen(N,false);\n int cnt = 0;\n for(int i=0;i<26;i++){\n if(!appear[i]) continue;\n if(seen[uf.root(i)]) continue;\n seen[uf.root(i)] = true;\n cnt++;\n }\n if(allsame && cnt == 1) cout << \"OK\" << endl;\n else cout << \"NG\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3464,
"score_of_the_acc": -0.5304,
"final_rank": 9
},
{
"submission_id": "aoj_0225_5792681",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing pint = pair<int,int>;\nvoid solve(int);\n\nint main()\n{\n\twhile(true) {\n\t\tint N; cin >> N;\n\t\tif(N == 0) return 0;\n\t\telse solve(N);\n\t}\n}\n\nclass UnionFind{\n private:\n\tvector<int> data;\n public:\n\tUnionFind(int n) : data(n,-1) {}\n\tint root(int i) { return data[i] < 0 ? i : data[i] = root(data[i]); }\n\tint size(int i) { return -data[root(i)]; }\n\tbool same(int x, int y) {return root(x) == root(y); }\n\tbool connected() {return size(0) == (int)data.size(); }\n\n\tbool unit(int i,int j){\n\t\ti = root(i);\n\t\tj = root(j);\n\t\tif(i != j){\n\t\t\tdata[i] += data[j];\n\t\t\tdata[j] = i;\n\t\t}\n\t\treturn i != j;\n\t}\n};\n\nvoid solve(int N)\n{\n\tint AL = 26;\n\tvector<int> in(AL), ot(AL);\n\tUnionFind uf(AL);\n\tchar c;\n\tfor(int i = 0; i < N; i++) {\n\t\tstring s; cin >> s;\n\t\tot[s[0] - 'a']++;\n\t\tin[s.back() - 'a']++;\n\t\tuf.unit(s[0] - 'a', s.back() - 'a');\n\t\tc = s[0] - 'a';\n\t}\n\t\n\tbool ok = true;\n\tfor(int i = 0; i < AL; i++) if(ot[i] != in[i]) ok = false;\n\tfor(int i = 0; i < AL; i++) if(uf.root(i) != uf.root(c) && uf.size(i) != 1)ok = false;\n\tcout << (ok ? \"OK\" : \"NG\") << endl;\n\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3488,
"score_of_the_acc": -0.5565,
"final_rank": 11
},
{
"submission_id": "aoj_0225_4962442",
"code_snippet": "#include<bits//stdc++.h>\nusing namespace std;\nint n,in[26],out[26];\nbool d[26][26],used[26];\nvoid f(int u){\n if(used[u])return;\n\tused[u]=1;\n\tfor(int i=0;i<26;i++){\n\t\tif(!d[u][i])continue;\n\t\tf(i);\n\t}\n}\nmain(){\n\twhile(cin>>n,n){\n\t for(int i=0;i<26;i++){\n\t in[i]=out[i]=0;used[i]=1;\n\t for(int j=0;j<26;j++)d[i][j]=0;\n\t }\n\t int st;\n\t for(int i=0;i<n;i++){\n\t\t string s;cin>>s;\n\t\t int a=s[0]-'a',b=s[s.size()-1]-'a';\n\t\t if(i==0)st=a;\n\t\t in[a]++;out[b]++;\n\t\t d[a][b]=d[b][a]=1;used[a]=used[b]=0;\n\t\t}\n\t\tf(st);\n\t\tbool ok=1;\n\t\tfor(int i=0;i<26;i++)ok&=in[i]==out[i]&&used[i];\n\t\tcout<<(ok?\"OK\":\"NG\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3136,
"score_of_the_acc": -0.6739,
"final_rank": 16
},
{
"submission_id": "aoj_0225_4844367",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct UnionFind{\n vector<int> v;\n int cc;\n \n UnionFind(int n): v(n, -1), cc(n){}\n int root(int x){\n if(v[x] < 0) return x;\n return v[x] = root(v[x]);\n }\n bool is_same(int x, int y){\n return root(x) == root(y);\n }\n bool unite(int x, int y){\n x = root(x);\n y = root(y);\n if(x == y) return false;\n if(v[y] < v[x]) swap(x, y);\n v[x] += v[y];\n v[y] = x;\n cc--;\n return true;\n }\n int size(int x){\n return -v[root(x)];\n }\n};\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<int> d(26, 0);\n vector<bool> used(26, false);\n UnionFind uf(26);\n for(int i=0; i<n; i++){\n string s;\n cin >> s;\n int a = s[0]-'a';\n int b = s.back()-'a';\n d[a]++;\n d[b]--;\n uf.unite(a, b);\n used[a] = used[b] = true;\n }\n bool ok = true;\n for(int i=0; i<26; i++){\n if(d[i]!=0) ok = false;\n }\n int num = 0;\n for(int i=0; i<26; i++){\n if(used[i]) num++;\n }\n if(uf.cc > 26-num+1) ok = false;\n if(ok){\n cout << \"OK\" << endl;\n }else{\n cout << \"NG\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3012,
"score_of_the_acc": -0.5391,
"final_rank": 10
},
{
"submission_id": "aoj_0225_4609974",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n\nbool visited[26], g[26][26];\nint in[26], out[26];\n\nvoid dfs(int v) {\n visited[v] = true;\n for (int u = 0; u < 26; u++) {\n if (visited[u]) continue;\n if (!g[v][u]) continue;\n dfs(u);\n }\n}\n\nint main() {\n int n;\n while (cin >> n && n) {\n for (int i = 0; i < 26; i++) {\n visited[i] = false;\n in[i] = out[i] = 0;\n for (int j = 0; j < 26; j++) {\n g[i][j] = false;\n }\n }\n for (int i = 0; i < n; i++) {\n string s;\n cin >> s;\n in[s.back() - 'a']++;\n out[s.front() - 'a']++;\n g[s.front() - 'a'][s.back() - 'a'] = true;\n }\n for (int i = 0; i < 26; i++) {\n if (in[i] == 0 && out[i] == 0) continue;\n dfs(i);\n break;\n }\n bool flag = true;\n for (int i = 0; i < 26; i++) {\n if (in[i] == 0 && out[i] == 0) continue;\n if (!visited[i]) flag = false;\n }\n for (int i = 0; i < 26; i++) {\n if (in[i] != out[i]) flag = false;\n }\n if (flag) cout << \"OK\" << endl;\n else cout << \"NG\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3188,
"score_of_the_acc": -0.7304,
"final_rank": 18
},
{
"submission_id": "aoj_0225_4482113",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\nusing namespace std;\n#define reps(i,b,n) for(int i = b ; i < (int)n ; ++i )\n#define rep(i,n) reps(i,0,n)\nbool flg[26];\nint buff[26];\nvector<int> vc[26];\nvoid dfs(int c){\n flg[c] = false;\n rep(i,vc[c].size()) if(flg[vc[c][i]]) dfs(vc[c][i]);\n}\nint main(){\n int n;\n string str;\n while(cin >> n , n){\n bool ok = true;\n rep(i,26)vc[i].clear();\n fill_n(flg,26,false);\n fill_n(buff,26,0);\n int l,r;\n rep(i,n){\n cin >> str;\n l = str[0] - 'a' , r = str[str.size()-1] - 'a';\n vc[l].push_back(r);\n buff[l]++ , buff[r]--;\n flg[l] = flg[r] = true;\n }\n dfs(l);\n rep(i,26){\n if(flg[i]||buff[i]){\n ok = false;\n break;\n }\n }\n cout << (ok ? \"OK\" : \"NG\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3228,
"score_of_the_acc": -0.2739,
"final_rank": 6
},
{
"submission_id": "aoj_0225_4474067",
"code_snippet": "#include <iostream>\n#include <vector>\n#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))\nusing namespace std;\nint main() {\n while (true) {\n int n; cin >> n;\n if (n == 0) break;\n bool g[26][26] = {};\n bool used[26] = {};\n int d[26] = {}; // relative degree\n repeat (i,n) {\n string s; cin >> s;\n int x = s.front() - 'a';\n int y = s.back() - 'a';\n used[x] = true;\n used[y] = true;\n g[x][y] = true;\n d[x] += 1;\n d[y] -= 1;\n }\n repeat (k,26) { // warshall floyd\n repeat (i,26) {\n repeat (j,26) {\n if (g[i][k] and g[k][j]) g[i][j] = true;\n }\n }\n }\n bool ans = true;\n repeat (i,26) {\n if (d[i] != 0) ans = false; // eulerlian cycle\n }\n repeat (i,26) if (used[i]) {\n repeat (j,26) if (used[j]) {\n if (not g[i][j]) {\n ans = false; // not connected\n }\n }\n }\n cout << (ans ? \"OK\" : \"NG\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3084,
"score_of_the_acc": -0.6174,
"final_rank": 15
},
{
"submission_id": "aoj_0225_4434401",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint WordsDegree[26];\nbool Route[26][26], UsedHead[26], UsedTail[26];\n\n\nbool judgeSide() {\n\tfor (int i = 0; i < 26;++i) {\n\t\tif (WordsDegree[i] != 0) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool judgeCircle() {\n\tfor (int k = 0; k < 26; ++k) {\n\t\tfor (int i = 0; i < 26; ++i) {\n\t\t\tfor (int j = 0; j < 26; ++j) {\n\t\t\t\tif (Route[i][k] && Route[k][j]) {\n\t\t\t\t\tRoute[i][j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int i = 0; i < 26; ++i) {\n\t\tif (!UsedHead[i]) {\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 0; j < 26; ++j) {\n\t\t\tif (!UsedTail[j]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (!Route[i][j]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nint main() {\n\tint n,head,tail;\n\tstring str;\n\n\twhile (cin >> n, n) {\n\t\tmemset(WordsDegree, 0, sizeof(WordsDegree));\n\t\tmemset(Route, false, sizeof(Route));\n\t\tmemset(UsedHead, false, sizeof(UsedHead));\n\t\tmemset(UsedTail, false, sizeof(UsedTail));\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tcin >> str;\n\t\t\t//cout << \"head:\" << str.front() << \" tail:\" << str.back() << endl;\n\t\t\t//head = str.front() - 'a';\n\t\t\t//tail = str.back() - 'a';\n\t\t\thead = str[0] - 'a';\n\t\t\ttail = str[str.size() - 1] - 'a';\n\t\t\t++WordsDegree[head];\n\t\t\t--WordsDegree[tail];\n\t\t\tRoute[head][tail] = true;\n\t\t\tUsedHead[head] = true;\n\t\t\tUsedTail[tail] = true;\n\t\t}\n\t\tif (judgeSide() && judgeCircle()) {\n\t\t\tcout << \"OK\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"NG\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3156,
"score_of_the_acc": -0.1957,
"final_rank": 5
},
{
"submission_id": "aoj_0225_4381048",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nclass UnionFind {\n int n;\n vector<int> uni;\n int forest_size;\npublic:\n explicit UnionFind(int n) : n(n), uni(static_cast<u32>(n), -1), forest_size(n) {};\n\n int root(int a){\n if (uni[a] < 0) return a;\n else return (uni[a] = root(uni[a]));\n }\n\n bool unite(int a, int b) {\n a = root(a);\n b = root(b);\n if(a == b) return false;\n if(uni[a] > uni[b]) swap(a, b);\n uni[a] += uni[b];\n uni[b] = a;\n forest_size--;\n return true;\n }\n int size(){ return forest_size; }\n int size(int i){ return -uni[root(i)]; }\n bool same(int a, int b) { return root(a) == root(b); }\n};\n\nint main() {\n int n;\n while(cin >> n, n){\n array<int, 256> cnt{};\n int a = 0;\n fill(cnt.begin(), cnt.end(), -1);\n vector<int> in(26), out(26);\n UnionFind uf(26);\n for (int i = 0; i < n; ++i) {\n string s;\n cin >> s;\n if(!~cnt[s.front()]) cnt[s.front()] = a++;\n if(!~cnt[s.back()]) cnt[s.back()] = a++;\n uf.unite(cnt[s.front()], cnt[s.back()]);\n in[cnt[s.front()]]++;\n out[cnt[s.back()]]++;\n }\n int ok = 1;\n for (int i = 0; i < a; ++i) {\n if(in[i] != out[i]) ok = 0;\n }\n if(uf.size(0) == a && ok) puts(\"OK\");\n else puts(\"NG\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2976,
"score_of_the_acc": -0.5,
"final_rank": 8
},
{
"submission_id": "aoj_0225_4183244",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef vector<int> vi;\ntypedef vector<vector<int>> vvi;\n\nbool circuit(vvi &to) {\n int in[26] = {}, ou[26] = {};\n for (int i=0; i<(int)to.size(); ++i) {\n for (int j: to[i]) {\n in[i] ++;\n ou[j] ++;\n }\n }\n for (int i=0; i<26; ++i) {\n if (in[i] != ou[i]) return false;\n }\n return true;\n}\n\nbool connected(vvi &to) {\n int s = 0;\n while (to[s].empty()) s ++;\n bool used[26] = {};\n stack<int> st;\n st.push(s);\n while ( ! st.empty()) {\n int t = st.top();\n st.pop();\n if (used[t]) continue;\n used[t] = true;\n for (int u: to[t]) st.push(u);\n }\n for (int i=0; i<(int)to.size(); ++i) {\n for (int j: to[i]) {\n if ( ! used[i] || ! used[j]) return false;\n }\n }\n return true;\n}\n\nint main() {\n int N;\n while (cin >> N, N) {\n vvi to(26);\n string s;\n for (int i=0; i<N; ++i) {\n cin >> s;\n to[s[0]-'a'].push_back(s.back()-'a');\n }\n if (circuit(to) && connected(to)) {\n cout << \"OK\\n\";\n } else {\n cout << \"NG\\n\";\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3020,
"score_of_the_acc": -0.0478,
"final_rank": 1
},
{
"submission_id": "aoj_0225_4089818",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvector<int> G[26];\nbool flag[26];\nbool visited[26];\nint degree[26];\n\nvoid dfs(int v) {\n visited[v] = true;\n \n for (int i=0; i<G[v].size(); i++) {\n if (!visited[G[v][i]]) {\n dfs(G[v][i]);\n }\n }\n}\n\nint main() {\n while (true) {\n int n; cin >> n;\n \n if (n==0) {\n break;\n }\n \n for (int i=0; i<26; i++) {\n G[i].clear();\n }\n \n for (int i=0; i<26; i++) {\n flag[i] = false;\n visited[i] = false;\n degree[i] = 0;\n }\n \n int s, t;\n \n for (int i=0; i<n; i++) {\n string w; cin >> w;\n s = w[0]-'a';\n t = w[w.size()-1]-'a';\n G[s].push_back(t);\n flag[s] = true;\n flag[t] = true;\n degree[s]++;\n degree[t]--;\n }\n \n dfs(s);\n \n bool judge = true;\n \n for (int i=0; i<26; i++) {\n if (flag[i] && !visited[i]) {\n judge &= false;\n }\n \n if (degree[i]!=0) {\n judge &= false;\n }\n }\n \n if (judge) {\n cout << \"OK\" << endl;\n }\n else {\n cout << \"NG\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3216,
"score_of_the_acc": -0.7609,
"final_rank": 19
},
{
"submission_id": "aoj_0225_3961206",
"code_snippet": "#pragma GCC optimize (\"O3\")\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <queue>\n#include <set>\n#include <algorithm>\n#include <numeric>\n#include <list>\nusing namespace std;\n\nusing QWORD = uint64_t;\nusing SQWORD = int64_t;\nusing DWORD = uint32_t;\nusing SDWORD = int32_t;\nusing WORD = uint16_t;\nusing SWORD = int16_t;\nusing BYTE = uint8_t;\nusing SBYTE = int8_t;\nusing DOUBLE = double;\nusing FLOAT = float;\n\n#define MIN_SDWORD (-2147483648)\n#define MAX_SDWORD (2147483647)\n#define MIN_SBYTE (-128)\n#define MAX_SBYTE (127)\n\n#define MIN_SQWORD (0x8000000000000000)\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\n\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\n#define MAX_DWORD (0xFFFFFFFF)\n#define MAX_WORD (0xFFFF)\n#define MAX_BYTE (0xFF)\n\n#define MAX_DOUBLE (1.0e+308)\n#define DOUBLE_EPS (1.0e-12)\n#define MIN_DOUBLE_N (-1.0e+308)\n\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\n\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\n\n#define BYTE_BITS (8)\n#define WORD_BITS (16)\n#define DWORD_BITS (32)\n#define QWORD_BITS (64)\n\nstatic inline void inputStringSpSeparated(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c) || (' ' == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\nstatic inline void inputString(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\n\nstatic inline SQWORD inputSQWORD(void)\n{\n SQWORD sqNumber = 0;\n SQWORD sqMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n sqMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n sqNumber *= 10LL;\n sqNumber += (SQWORD)(c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return sqNumber * sqMultiplier;\n }\n }\n }\n}\n\n\nstatic inline SDWORD inputSDWORD(void)\n{\n SDWORD lNumber = 0;\n SDWORD lMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n lMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n lNumber *= 10;\n lNumber += (c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return lNumber * lMultiplier;\n }\n }\n }\n}\n\nstatic inline DOUBLE inputFP(void)\n{\n DOUBLE dInt = 0.0;\n DOUBLE dFrac = 0.0;\n DOUBLE dMultiplier = 1.0;\n DWORD dwFpCnt = 0;\n DOUBLE *pdCur = &dInt;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n dMultiplier = -1;\n }\n }\n if ('.' == c) {\n pdCur = &dFrac;\n } else if (('0' <= c) && (c <= '9')) {\n (*pdCur) *= 10;\n (*pdCur) += (DOUBLE)(c - '0');\n bRead = true;\n if (pdCur == &dFrac) {\n dwFpCnt++;\n }\n } else {\n if (bRead) {\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\n }\n }\n }\n}\n\n/*----------------------------------------------*/\n/**\n * mod による操作ライブラリ\n */\n#define ANS_MOD (1000000007)\n\nclass MODINT {\n static SQWORD MOD;\n SQWORD m_x;\n\npublic:\n MODINT(SQWORD val) {\n m_x = (val % MOD + MOD) % MOD;\n };\n MODINT() {\n m_x = 0;\n }\n static void Init(SQWORD sqMod) {\n MOD = sqMod;\n }\n\n\tMODINT& operator+= (const MODINT a)\n {\n m_x = (m_x + a.m_x) % MOD; \n return *this;\n };\n\tMODINT& operator-= (const MODINT a)\n { \n m_x = (m_x - a.m_x + MOD) % MOD; \n return *this;\n };\n\tMODINT& operator*= (const MODINT a)\n {\n m_x = (m_x * a.m_x) % MOD;\n return *this;\n };\n MODINT pow(SQWORD t) const {\n if (!t) return 1;\n MODINT a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\tMODINT operator+ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res += a);\n\t}\n\tMODINT operator- (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res -= a);\n\t}\n\tMODINT operator* (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res *= a);\n\t}\n\tMODINT operator/ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res /= a);\n\t}\n\n /* 逆元 */\n MODINT inv() const {\n return pow(MOD-2);\n }\n\n /* 除算 */\n MODINT& operator/=(const MODINT a) {\n return (*this) *= a.inv();\n } \n\n /* 整数版 */\n\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\n\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\n\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\n\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\n\n SQWORD getVal() { return m_x; };\n};\nSQWORD MODINT::MOD = ANS_MOD;\n\n\ntypedef struct {\n vector<DWORD> vdwPar;\n vector<DWORD> vdwRank;\n vector<DWORD> vdwCnt;\n DWORD dwSize;\n\n void initUnionFind(\n DWORD dwSize)\n {\n dwSize = dwSize;\n vdwPar.resize(dwSize);\n vdwRank.resize(dwSize);\n vdwCnt.resize(dwSize);\n \n for (DWORD dwIdx = 0; dwIdx < dwSize; dwIdx++) {\n vdwPar[dwIdx] = dwIdx;\n vdwRank[dwIdx] = 0;\n vdwCnt[dwIdx] = 1;\n }\n }\n\n DWORD ufGetCnt(DWORD sqIdx) {\n return vdwCnt[ufGetParent(sqIdx)];\n }\n\n\n DWORD ufGetParent(DWORD dwIdx) const\n {\n return vdwPar[dwIdx];\n }\n\n DWORD ufGetRank(DWORD dwIdx) const\n {\n return vdwRank[dwIdx];\n }\n\n void ufSetParent(DWORD dwIdx, DWORD dwParent)\n {\n vdwPar[dwIdx] = dwParent; \n if (ufGetRank(dwIdx) == ufGetRank(dwParent)) {\n (vdwRank[dwParent])++;\n }\n }\n\n DWORD ufGetRoot(DWORD dwIdx) const\n {\n if (ufGetParent(dwIdx) == dwIdx) {\n return dwIdx;\n } else {\n DWORD dwParent = ufGetParent(dwIdx);\n DWORD dwRoot = ufGetRoot(dwParent);\n return dwRoot;\n }\n }\n\n bool ufUnite(DWORD dwX, DWORD dwY)\n {\n DWORD dwRootX = ufGetRoot(dwX);\n DWORD dwRootY = ufGetRoot(dwY);\n\n if (dwRootX == dwRootY) {\n return false;\n }\n\n if (ufGetRank(dwRootX) < ufGetRank(dwRootY)) {\n ufSetParent(dwRootX, dwRootY);\n (vdwCnt[dwRootY]) += (vdwCnt[dwRootX]);\n } else {\n ufSetParent(dwRootY, dwRootX);\n (vdwCnt[dwRootX]) += (vdwCnt[dwRootY]);\n }\n\n return true;\n }\n\n bool ufIsSame(DWORD dwX, DWORD dwY) const\n {\n return (ufGetRoot(dwX) == ufGetRoot(dwY));\n }\n} ST_UNION_FIND;\n\n/*----------------------------------------------*/\n#define MAX_ALPHABETS (26)\n\nbool solve(void)\n{\n SQWORD sqN = inputSQWORD();\n ST_UNION_FIND uf;\n\n uf.initUnionFind(MAX_ALPHABETS);\n if (0 == sqN) {\n return false;\n }\n\n vector<SQWORD> vecsqIn(MAX_ALPHABETS, 0);\n vector<SQWORD> vecsqOut(MAX_ALPHABETS, 0);\n \n SQWORD sqBeginIdx = 0;\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\n string strS;\n cin >> strS;\n\n SQWORD sqFront = strS.front() - 'a';\n SQWORD sqTail = strS.back() - 'a';\n\n vecsqIn[sqTail]++;\n vecsqOut[sqFront]++;\n\n uf.ufUnite(sqFront, sqTail);\n }\n\n SQWORD sqParent = -1;\n for (SQWORD sqAlph = 0; sqAlph < MAX_ALPHABETS; sqAlph++) {\n if ((0 < vecsqOut[sqAlph]) || (0 < vecsqIn[sqAlph])) {\n if (-1 == sqParent) {\n sqParent = uf.ufGetRoot(sqAlph);\n } else {\n if (sqParent != uf.ufGetRoot(sqAlph)) {\n printf(\"NG\\n\");\n return true;\n }\n }\n }\n }\n\n for (SQWORD sqAlph = 0; sqAlph < MAX_ALPHABETS; sqAlph++) {\n if (vecsqOut[sqAlph] != vecsqIn[sqAlph]) {\n printf(\"NG\\n\");\n return true;\n }\n }\n printf(\"OK\\n\");\n return true;\n}\n\n\nint main(void)\n{\n while(1) {\n bool bRet = solve();\n if (!bRet) {\n break;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3080,
"score_of_the_acc": -0.613,
"final_rank": 12
},
{
"submission_id": "aoj_0225_3961070",
"code_snippet": "//#include \"pch.h\"\n//#include \"stdafx.h\"\n#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <math.h>\n#include <string>\n#include <cstring>\n#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long int ll;\n#define BIG_NUM 2000000000\nusing namespace std;\n\nstruct Info{\n\n\tInfo(){\n\t\tleft = right = 'X';\n\t\tindex = 0;\n\t}\n\n\tInfo(char arg_left,char arg_right,int arg_index){\n\t\tleft = arg_left;\n\t\tright = arg_right;\n\t\tindex = arg_index;\n\t}\n\tchar left,right;\n\tint index;\n};\n\nbool check[10000];\nvector<Info> V[26];\n\nvoid dfs(char left){\n\tfor(int i = 0; i < V[left - 'a'].size(); i++){\n\t\tif(check[V[left - 'a'][i].index] == false){\n\t\t\tcheck[V[left - 'a'][i].index] = true;\n\t\t\tdfs(V[left - 'a'][i].right);\n\t\t}\n\t}\n}\n\nint execOne(){\n\n\tint N,num_left[26],num_right[26];\n\n\tbool FLG;\n\n\tchar last,final_start;\n\tstring buf;\n\n\twhile(true){\n\t\tcin >> N;\n\t\tif(N == 0)break;\n\n\t\tFLG = true;\n\n\t\tfor(int i = 0; i < 26; i++){\n\t\t\tV[i].clear();\n\t\t\tnum_left[i] = 0;\n\t\t\tnum_right[i] = 0;\n\t\t}\n\t\tfor(int i = 0; i < N; i++)check[i] = false;\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tcin >> buf;\n\t\t\tnum_left[buf[0] - 'a']++;\n\t\t\tfor(int k = 0; buf[k] != '\\0'; k++)last = buf[k];\n\t\t\tnum_right[last - 'a']++;\n\t\t\tV[buf[0]-'a'].push_back(Info(buf[0],last,i));\n\t\t\tfinal_start = buf[0];\n\t\t}\n\n\t\tfor(int i = 0; i < 26; i++){\n\t\t\tif(num_left[i] != num_right[i]){\n\t\t\t\tprintf(\"NG\\n\");\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!FLG)continue;\n\n\t\tcheck[V[final_start - 'a'][0].index] = true;\n\t\tdfs(V[final_start - 'a'][0].right);\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(check[i] == false){\n\t\t\t\tprintf(\"NG\\n\");\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!FLG)continue;\n\n\t\tprintf(\"OK\\n\");\n\n\t}\n\n\treturn 0;\n}\n\n#if 0\n/*-----------------------------------------------------------------------------\n ライブラリ\n -------------------------------------------------------------------------------*/\n#if 0\n// 3次元\nvector<vector<vector<SDWORD>>> XXX(AAA, vector<vector<SDWORD>>(BBBB, vector<SDWORD>(CCC, -1)));\n#endif\n\n#if 0\n// 降順ソート\nsort(getValue.rbegin(), getValue.rend());\n#endif\n\n#if 0\n// 2分探索\nauto position = lower_bound(getValue.begin(), getValue.end(), 0);\t// 0以上の要素位置を探す\nint idx_lower = distance(getValue.begin(), position);\t\t\t\t// 0以上の要素インデックス\nint eraseNum = MIN(idx_lower, delCnt);\t\t\t\t\t\t\t\t// 要素位置が個数になる\nif (0 < eraseNum) {\n\tgetValue.erase(getValue.begin(), getValue.begin() + eraseNum);\n}\n#endif\n\n/*-----------------------------------------------------------------------------\n 定義\n -------------------------------------------------------------------------------*/\n#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))\n#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))\n#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))\n#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))\n\n#define INF\t\t\t\t2e9\n#define MOD\t\t\t\t(1000 * 1000 * 1000 + 7)\n#define MIN(a, b)\t\t((a) < (b) ? a : b)\n#define MAX(a, b)\t\t((a) > (b) ? a : b)\n#define CeilN(x, n)\t\t(((((DWORD)(x))+((n)-1))/n)*n)\t/* Nの倍数に切り上げ */\n#define FloorN(x, n)\t((x)-(x)%(n))\t\t\t\t\t/* Nの倍数に切り下げ */\n#define IsOdd(x)\t\t(((x)&0x01UL) == 0x01UL)\t\t\t\n#define IsEven(x)\t\t(!IsOdd((x)))\t\t\t\t\t\t\n\n#define ArrayLength(x)\t( sizeof( x ) / sizeof( x[ 0 ] ) )\n#define\tArrayEnd(a)\t\t(&(a)[ArrayLength(a)])\t\t\t\n#define\tArrayLast(a)\t(&(a)[ArrayLength(a) - 1])\t\t\n#define MAX_BYTE\t\t(255)\n#define MIN_BYTE\t\t(0)\n#define MAX_WORD\t\t(65535)\n#define MIN_WORD\t\t(0)\n#define MAX_SWORD\t\t(32767)\n#define MIN_SWORD\t\t(-32768)\n#define MAX_DWORD\t\t(0xFFFFFFFF)\n#define MIN_DWORD\t\t(0)\n#define\tMAX_SDWORD\t\t((SDWORD)0x7FFFFFFF)\n#define\tMIN_SDWORD\t\t((SDWORD)0x80000000)\n#define\tMAX_QWORD\t\t((QWORD)0xFFFFFFFFFFFFFFFF)\n#define\tMIN_QWORD\t\t((QWORD)0x0000000000000000)\n#define\tMAX_SQWORD\t\t((SQWORD)0x7FFFFFFFFFFFFFFF)\n#define\tMIN_SQWORD\t\t((SQWORD)0x8000000000000000)\n\n#define\tBitSetV(Val,Bit)\t\t((Val) |= (Bit))\t\t\t\n#define\tBitClrV(Val,Bit)\t\t((Val) &= (~(Bit)))\t\t\t\n#define\tBitTstV(Val,Bit)\t\t((Val) & (Bit))\t\t\t\t\n#define\tBitInvV(Val,Bit)\t\t((Val) ^= (Bit))\t\t\t\n#define\tBitTstVVal(Val, Bit)\t(BitTstV((Val), (Bit)) == (Bit))\t\n\ntypedef short\t\t\t\t\tSWORD;\ntypedef long\t\t\t\t\tSDWORD;\ntypedef long long\t\t\t\tSQWORD;\ntypedef unsigned short\t\t\tWORD;\ntypedef unsigned long\t\t\tDWORD;\ntypedef unsigned long long int\tQWORD;\ntypedef pair<int, int> P;\n\n/*-----------------------------------------------------------------------------\n パラメータ定義\n -------------------------------------------------------------------------------*/\n#define N_MAX\t(10)\n#define K_MAX\t(10)\n#define M_MAX\t(1000)\n#define H_MAX\t(1000)\n#define W_MAX\t(1000)\n/*-----------------------------------------------------------------------------\n 処理\n -------------------------------------------------------------------------------*/\n///\nstruct wordInfo {\n\twordInfo() {\n\t\tindex = 0;\n\t\tto = 'Z';\n\t}\n\n\twordInfo(int a, char b) {\n\t\tindex = a;\n\t\tto = b;\n\t}\n\tint\tindex;\n\tint to;\n};\nvector<bool>\t\texecResult;\nvector<wordInfo>\twordList[26];\n\n/// dfs\nvoid dfs(int topWord)\n{\n\t//\tvector<wordInfo> &wordOne = wordList[topWord];\n\n\tfor (size_t i = 0; i < wordList[topWord].size(); i++) {\n\t\tif (!execResult[wordList[topWord][i].index]) {\n\t\t\texecResult[wordList[topWord][i].index] = true;\n\t\t\tdfs(wordList[topWord][i].to);\n\t\t}\n\t}\n}\n\n/// 1塊判定\nbool execOne(int n)\n{\n\tint lastWord;\n\tint topNum[26];\n\tint endNum[26];\n\n\t// 初期化\n\tREP(i, 26) {\n\t\twordList[i].clear();\n\t\ttopNum[i] = 0;\n\t\tendNum[i] = 0;\n\t}\n\texecResult.resize(n, false);\n\n\t// 入力\n\tREP(i, n) {\n\t\tstring strOne;\n//\t\tconst char *pStrOne = strOne.c_str();\n\t\tcin >> strOne;\n\t\tint topWord = *strOne.begin() - 'a';\n\t\tint endWord = *(strOne.end() - 1) - 'a';\n\t\ttopNum[topWord]++;\n\t\tendNum[endWord]++;\n\t\twordList[topWord].push_back(wordInfo(i, endWord));\n\t\tlastWord = endWord;\n\t}\n\n\t// 先頭と末尾の数は一緒のはず\n\tREP(i, n) {\n\t\tif (topNum[i] != endNum[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t// dfs\n\texecResult[n - 1] = true;\n\tdfs(lastWord);\n\n\t// 結果チェック\n\tREP(i, n) {\n\t\tif (!execResult[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n#endif\n\n/// メイン\nint main()\n{\n\texecOne();\n\t/*\n\twhile (1) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tif (execOne(n)) {\n\t\t\tcout << \"OK\" << endl;\n\t\t} else {\n\t\t\tcout << \"NG\" << endl;\n\t\t}\n\t}\n\n\tcout << endl;*/\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3140,
"score_of_the_acc": -0.1783,
"final_rank": 4
},
{
"submission_id": "aoj_0225_3961030",
"code_snippet": "//#include \"pch.h\"\n//#include \"stdafx.h\"\n#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <math.h>\n#include <string>\n#include <cstring>\n#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long int ll;\n#define BIG_NUM 2000000000\nusing namespace std;\n\nstruct Info{\n\n\tInfo(){\n\t\tleft = right = 'X';\n\t\tindex = 0;\n\t}\n\n\tInfo(char arg_left,char arg_right,int arg_index){\n\t\tleft = arg_left;\n\t\tright = arg_right;\n\t\tindex = arg_index;\n\t}\n\tchar left,right;\n\tint index;\n};\n\nbool check[10000];\nvector<Info> V[26];\n\nvoid dfs(char left){\n\tfor(int i = 0; i < V[left - 'a'].size(); i++){\n\t\tif(check[V[left - 'a'][i].index] == false){\n\t\t\tcheck[V[left - 'a'][i].index] = true;\n\t\t\tdfs(V[left - 'a'][i].right);\n\t\t}\n\t}\n}\n\nint main(){\n\n\tint N,num_left[26],num_right[26];\n\n\tbool FLG;\n\n\tchar last,final_start;\n\tstring buf;\n\n\twhile(true){\n\t\tcin >> N;\n\t\tif(N == 0)break;\n\n\t\tFLG = true;\n\n\t\tfor(int i = 0; i < 26; i++){\n\t\t\tV[i].clear();\n\t\t\tnum_left[i] = 0;\n\t\t\tnum_right[i] = 0;\n\t\t}\n\t\tfor(int i = 0; i < N; i++)check[i] = false;\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tcin >> buf;\n\t\t\tnum_left[buf[0] - 'a']++;\n\t\t\tfor(int k = 0; buf[k] != '\\0'; k++)last = buf[k];\n\t\t\tnum_right[last - 'a']++;\n\t\t\tV[buf[0]-'a'].push_back(Info(buf[0],last,i));\n\t\t\tfinal_start = buf[0];\n\t\t}\n\n\t\tfor(int i = 0; i < 26; i++){\n\t\t\tif(num_left[i] != num_right[i]){\n\t\t\t\tprintf(\"NG\\n\");\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!FLG)continue;\n\n\t\tcheck[V[final_start - 'a'][0].index] = true;\n\t\tdfs(V[final_start - 'a'][0].right);\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(check[i] == false){\n\t\t\t\tprintf(\"NG\\n\");\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!FLG)continue;\n\n\t\tprintf(\"OK\\n\");\n\n\t}\n\n\treturn 0;\n}\n\n#if 0\n/*-----------------------------------------------------------------------------\n ライブラリ\n -------------------------------------------------------------------------------*/\n#if 0\n// 3次元\nvector<vector<vector<SDWORD>>> XXX(AAA, vector<vector<SDWORD>>(BBBB, vector<SDWORD>(CCC, -1)));\n#endif\n\n#if 0\n// 降順ソート\nsort(getValue.rbegin(), getValue.rend());\n#endif\n\n#if 0\n// 2分探索\nauto position = lower_bound(getValue.begin(), getValue.end(), 0);\t// 0以上の要素位置を探す\nint idx_lower = distance(getValue.begin(), position);\t\t\t\t// 0以上の要素インデックス\nint eraseNum = MIN(idx_lower, delCnt);\t\t\t\t\t\t\t\t// 要素位置が個数になる\nif (0 < eraseNum) {\n\tgetValue.erase(getValue.begin(), getValue.begin() + eraseNum);\n}\n#endif\n\n/*-----------------------------------------------------------------------------\n 定義\n -------------------------------------------------------------------------------*/\n#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))\n#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))\n#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))\n#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))\n\n#define INF\t\t\t\t2e9\n#define MOD\t\t\t\t(1000 * 1000 * 1000 + 7)\n#define MIN(a, b)\t\t((a) < (b) ? a : b)\n#define MAX(a, b)\t\t((a) > (b) ? a : b)\n#define CeilN(x, n)\t\t(((((DWORD)(x))+((n)-1))/n)*n)\t/* Nの倍数に切り上げ */\n#define FloorN(x, n)\t((x)-(x)%(n))\t\t\t\t\t/* Nの倍数に切り下げ */\n#define IsOdd(x)\t\t(((x)&0x01UL) == 0x01UL)\t\t\t\n#define IsEven(x)\t\t(!IsOdd((x)))\t\t\t\t\t\t\n\n#define ArrayLength(x)\t( sizeof( x ) / sizeof( x[ 0 ] ) )\n#define\tArrayEnd(a)\t\t(&(a)[ArrayLength(a)])\t\t\t\n#define\tArrayLast(a)\t(&(a)[ArrayLength(a) - 1])\t\t\n#define MAX_BYTE\t\t(255)\n#define MIN_BYTE\t\t(0)\n#define MAX_WORD\t\t(65535)\n#define MIN_WORD\t\t(0)\n#define MAX_SWORD\t\t(32767)\n#define MIN_SWORD\t\t(-32768)\n#define MAX_DWORD\t\t(0xFFFFFFFF)\n#define MIN_DWORD\t\t(0)\n#define\tMAX_SDWORD\t\t((SDWORD)0x7FFFFFFF)\n#define\tMIN_SDWORD\t\t((SDWORD)0x80000000)\n#define\tMAX_QWORD\t\t((QWORD)0xFFFFFFFFFFFFFFFF)\n#define\tMIN_QWORD\t\t((QWORD)0x0000000000000000)\n#define\tMAX_SQWORD\t\t((SQWORD)0x7FFFFFFFFFFFFFFF)\n#define\tMIN_SQWORD\t\t((SQWORD)0x8000000000000000)\n\n#define\tBitSetV(Val,Bit)\t\t((Val) |= (Bit))\t\t\t\n#define\tBitClrV(Val,Bit)\t\t((Val) &= (~(Bit)))\t\t\t\n#define\tBitTstV(Val,Bit)\t\t((Val) & (Bit))\t\t\t\t\n#define\tBitInvV(Val,Bit)\t\t((Val) ^= (Bit))\t\t\t\n#define\tBitTstVVal(Val, Bit)\t(BitTstV((Val), (Bit)) == (Bit))\t\n\ntypedef short\t\t\t\t\tSWORD;\ntypedef long\t\t\t\t\tSDWORD;\ntypedef long long\t\t\t\tSQWORD;\ntypedef unsigned short\t\t\tWORD;\ntypedef unsigned long\t\t\tDWORD;\ntypedef unsigned long long int\tQWORD;\ntypedef pair<int, int> P;\n\n/*-----------------------------------------------------------------------------\n パラメータ定義\n -------------------------------------------------------------------------------*/\n#define N_MAX\t(10)\n#define K_MAX\t(10)\n#define M_MAX\t(1000)\n#define H_MAX\t(1000)\n#define W_MAX\t(1000)\n/*-----------------------------------------------------------------------------\n 処理\n -------------------------------------------------------------------------------*/\n///\nstruct wordInfo {\n\twordInfo() {\n\t\tindex = 0;\n\t\tto = 'Z';\n\t}\n\n\twordInfo(int a, char b) {\n\t\tindex = a;\n\t\tto = b;\n\t}\n\tint\tindex;\n\tint to;\n};\nvector<bool>\t\texecResult;\nvector<wordInfo>\twordList[26];\n\n/// dfs\nvoid dfs(int topWord)\n{\n\t//\tvector<wordInfo> &wordOne = wordList[topWord];\n\n\tfor (size_t i = 0; i < wordList[topWord].size(); i++) {\n\t\tif (!execResult[wordList[topWord][i].index]) {\n\t\t\texecResult[wordList[topWord][i].index] = true;\n\t\t\tdfs(wordList[topWord][i].to);\n\t\t}\n\t}\n}\n\n/// 1塊判定\nbool execOne(int n)\n{\n\tint lastWord;\n\tint topNum[26];\n\tint endNum[26];\n\n\t// 初期化\n\tREP(i, 26) {\n\t\twordList[i].clear();\n\t\ttopNum[i] = 0;\n\t\tendNum[i] = 0;\n\t}\n\texecResult.resize(n, false);\n\n\t// 入力\n\tREP(i, n) {\n\t\tstring strOne;\n//\t\tconst char *pStrOne = strOne.c_str();\n\t\tcin >> strOne;\n\t\tint topWord = *strOne.begin() - 'a';\n\t\tint endWord = *(strOne.end() - 1) - 'a';\n\t\ttopNum[topWord]++;\n\t\tendNum[endWord]++;\n\t\twordList[topWord].push_back(wordInfo(i, endWord));\n\t\tlastWord = endWord;\n\t}\n\n\t// 先頭と末尾の数は一緒のはず\n\tREP(i, n) {\n\t\tif (topNum[i] != endNum[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t// dfs\n\texecResult[n - 1] = true;\n\tdfs(lastWord);\n\n\t// 結果チェック\n\tREP(i, n) {\n\t\tif (!execResult[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/// メイン\nint main()\n{\n\twhile (1) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tif (execOne(n)) {\n\t\t\tcout << \"OK\" << endl;\n\t\t} else {\n\t\t\tcout << \"NG\" << endl;\n\t\t}\n\t}\n\n\tcout << endl;\n\treturn 0;\n}\n\n\n#endif",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3324,
"score_of_the_acc": -0.3783,
"final_rank": 7
},
{
"submission_id": "aoj_0225_3960845",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nclass UnionFind {\n\tvector<int> data;\n\tint root(int a) {\n\t\treturn data[a] < 0 ? a : data[a] = root(data[a]);\n\t}\npublic:\n\tUnionFind(int n) : data(n, -1) {}\n\tbool Find(int a, int b) {\n\t\treturn root(a) == root(b);\n\t}\n\tvoid Union(int a, int b) {\n\t\ta = root(a);\n\t\tb = root(b);\n\t\tif (a == b) return;\n\t\tif (data[a] < data[b]) {\n\t\t\tdata[a] += data[b];\n\t\t\tdata[b] = a;\n\t\t}\n\t\telse {\n\t\t\tdata[b] += data[a];\n\t\t\tdata[a] = b;\n\t\t}\n\t}\n\tint Size(int a) {\n\t\treturn -data[root(a)];\n\t}\n};\n\n\nint main()\n{\n\tint n;\n\tstring word;\n\twhile (cin >> n, n) {\n\t\tint cnt = 0;\n\t\tvector<int> s(26), e(26), used(26);\n\t\tUnionFind uf(26);\n\t\twhile (n--) {\n\t\t\tcin >> word;\n\t\t\tint f = word.front() - 'a', b = word.back() - 'a';\n\t\t\ts[f]++;\n\t\t\te[b]++;\n\t\t\tuf.Union(f, b);\n\t\t\tif (!used[f]) {\n\t\t\t\tcnt++;\n\t\t\t\tused[f] = 1;\n\t\t\t}\n\t\t\tif (!used[b]) {\n\t\t\t\tcnt++;\n\t\t\t\tused[b] = 1;\n\t\t\t}\n\t\t}\n\t\tbool res = true;\n\t\tfor (int i = 0; i < 26; i++) {\n\t\t\tif (s[i] != e[i]) {\n\t\t\t\tres = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcout << (res && uf.Size(word.front() - 'a') == cnt ? \"OK\" : \"NG\") << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3132,
"score_of_the_acc": -0.1696,
"final_rank": 3
},
{
"submission_id": "aoj_0225_3823266",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cctype>\n#include<utility>\n#include<string>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<map>\n#include<set>\n#include<climits>\n\n#define REP(i, n) for(int i = 0;i < n;i++)\n#define REPR(i, n) for(int i = n;i >= 0;i--)\n#define FOR(i, m, n) for(int i = m;i < n;i++)\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\n#define SORT(v, n) sort(v, v+n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define llong long long\n#define pb(a) push_back(a)\n\nusing namespace std;\n\ntypedef long long int ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\n\ntemplate<typename T>\nvector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T, typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n\treturn vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\n}\ntemplate<typename T, typename V>\ntypename enable_if<is_class<T>::value == 0>::type\nfill_v(T& t, const V& v) { t = v; }\ntemplate<typename T, typename V>\ntypename enable_if<is_class<T>::value != 0>::type\nfill_v(T& t, const V& v) {\n\tfor (auto& e : t) fill_v(e, v);\n}\n\n\n#define ARRAY_MAX 100005\nconst int INF = INT32_MAX / 3;\nconst ll MOD = 1e9 + 7;\n\nint dx[4] = { 1,0,0,-1 };\nint dy[4] = { 0,1,-1,0 };\n\n\n/******************************************************************************************/\n\n\nvector<int> G[30];\nint st = 0;\nint check[30];\nint cnt[30];\n\nvoid dfs(int now) {\n\n\t\n\tcheck[now] = 1;\n\t\n\tfor (auto itr : G[now]) {\n\n\t\tif (check[itr] == 1)continue;\n\t\tdfs(itr);\n\t}\n}\n\n\n\nint main() {\n\n\tint n;\n\twhile (cin >> n, n) {\n\n\t\tbool ok = true;\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\tG[s[0] - 'a'].push_back(s.back() - 'a');\n\t\t\tcnt[s[0] - 'a']++;\n\t\t\tcnt[s.back() - 'a']--;\n\t\t}\n\n\t\t//入次数，出次数のチェック\n\t\tfor (int i = 0; i < 26; i++)\n\t\t{\n\t\t\tif (cnt[i] != 0) {\n\t\t\t\tok = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < 26; i++) {\n\t\t\tif (G[i].size() > 0) {\n\t\t\t\tdfs(i);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\n\t\tfor (int i = 0; i < 26; i++) {\n\t\t\tif (G[i].size() > 0 && !check[i]) {\n\t\t\t\tok = false;\n\t\t\t}\n\t\t}\n\n\t\tif (ok) {\n\t\t\tcout << \"OK\" << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"NG\" << endl;\n\t\t}\n\n\t\t\n\t\tfor (int i = 0; i < 30; i++)\n\t\t{\n\t\t\tcnt[i] = 0;\n\t\t\tcheck[i] = 0;\n\t\t\tG[i].clear();\n\t\t}\n\t}\n\n\t\n\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3180,
"score_of_the_acc": -0.7217,
"final_rank": 17
},
{
"submission_id": "aoj_0225_3821273",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nusing Graph = vector<vector<int>>;\n\nclass StronglyConnectedComponents {\n private:\n const Graph &graph;\n Graph g, rg;\n deque<int> order;\n deque<bool> used;\n vector<int> num_components;\n\n void dfs(int v) {\n used[v] = true;\n for (auto to : g[v]) {\n if (!used[to])\n dfs(to);\n }\n order.push_front(v);\n }\n\n void rdfs(int v, int k) {\n num_components[v] = k;\n for (auto to : rg[v]) {\n if (num_components[to] == -1)\n rdfs(to, k);\n }\n }\n\n public:\n StronglyConnectedComponents(Graph &graph)\n : graph(graph), g(graph.size()), rg(graph.size()), used(graph.size()),\n num_components(graph.size(), -1) {\n for (int i = 0; i < graph.size(); i++) {\n for (auto e : graph[i]) {\n g[i].push_back((int)e);\n rg[(int)e].push_back(i);\n }\n }\n }\n\n int operator[](int v) { return num_components[v]; }\n\n int decompose() {\n for (int v = 0; v < (int)g.size(); v++) {\n if (used[v])\n continue;\n dfs(v);\n }\n\n int k = 0;\n for (int v : order) {\n if (num_components[v] != -1)\n continue;\n rdfs(v, k);\n k++;\n }\n\n return k;\n }\n};\n\nint main(){\n int n;\n while(cin >> n, n > 0){\n vector<string> v;\n map<char, int> mp1, mp2;\n for(int i=0;i<n;++i){\n string s;\n cin >> s;\n v.push_back(s);\n mp1[s[0]]++;\n mp2[s.back()]++;\n }\n bool ok = true;\n for(char c='a';c<='z';++c){\n if(mp1[c] != mp2[c])ok = false;\n }\n if(!ok){\n cout << \"NG\" << endl;\n continue;\n }\n Graph graph(n, vector<int>());\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n if(i==j)continue;\n if(v[i].back() == v[j][0]){\n graph[i].push_back(j);\n }\n }\n }\n StronglyConnectedComponents scc(graph);\n scc.decompose();\n set<int> st;\n for(int i=0;i<n;++i){\n st.insert(scc[i]);\n }\n if(st.size() > 1)cout << \"NG\";\n else cout << \"OK\";\n cout << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3896,
"score_of_the_acc": -2,
"final_rank": 20
}
] |
aoj_0226_cpp
|
ヒットアンドブロー
太郎君と花子さんはヒットアンドブローで遊ぶことにしました。ヒットアンドブローのルールは、以下の通りです。
出題者と回答者に分かれて行う。
出題者は、重複した数を含まない 4 桁の数字(正解)を決める。
回答者は、その 4 桁の数字(回答)を言い当てる。
回答に対して、出題者はヒットとブローの数でヒントを与える。
回答と正解を比べて、数と桁位置の両方が同じであることをヒットと呼び、数だけが同じで桁位置が異なることをブローと呼ぶ。たとえば、正解が 1234 で、回答が 1354 なら、出題者は「2 ヒット、1 ブロー」というヒントを与え、正解までこれを繰り返す。
出題者と回答者は交代してゲームを行い、より少ない回答で正解を言い当てた方を勝ちとする。
太郎君と花子さんは、ヒットの数とブローの数をその都度判断することが少し面倒に感じているようです。そんな二人のために、ヒットの数とブローの数が即座に分かるプログラムを作成してあげましょう。
正解
r
と回答
a
を入力とし、ヒットの数とブローの数を出力するプログラムを作成してください。
r
、
a
はそれぞれ 0 から 9 の数字 4 つからなる数字の列です。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットとして、
r
と
a
が空白区切りで１行に与えられます。
データセットの数は 12000 を超えません。
Output
入力データセットごとに、ヒットの数とブローの数を１行に出力します。
Sample Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output for the Sample Input
0 0
2 1
4 0
1 3
0 3
|
[
{
"submission_id": "aoj_0226_6103106",
"code_snippet": "// 2021/12/07 Tazoe\n\n#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint main()\n{\n\twhile(true){\n\t\tchar r[5], a[5];\n\t\tcin >> r >> a;\n\n\t\tif(strcmp(r,\"0\")==0 && strcmp(a,\"0\")==0)\n\t\t\tbreak;\n\n\t\tint h = 0, b = 0;\n\n\t\tfor(int i=0; i<4; i++){\n\t\t\tfor(int j=0; j<4; j++){\n\t\t\t\tif(r[i]==a[j]){\n\t\t\t\t\tif(i==j){\n\t\t\t\t\t\th++;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tb++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << h << ' ' << b << '\\n';\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3088,
"score_of_the_acc": -0.55,
"final_rank": 10
},
{
"submission_id": "aoj_0226_4875044",
"code_snippet": "#include <iostream>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\nint hit(string a, string r);\nint blow(string a, string r);\n\nint main(void){\n\n string a;\n string r;\n while(cin>>r>>a){\n if(r==\"0\" and a==\"0\"){\n return 0;\n }\n cout<<hit(a,r)<<\" \"<<blow(a,r)<<endl;\n }\n}\n\n\nint hit(string a, string r){\n int hit_count=0;\n for(int i=0;i<4;i++){\n if(a[i]==r[i]){\n hit_count++;\n }\n }\n return hit_count;\n}\nint blow(string a, string r){\n set<char> a_s,r_s,mul;\n for(int i=0;i<4;i++){\n a_s.insert(a[i]);\n r_s.insert(r[i]);\n }\n set_intersection(a_s.begin(),a_s.end(),r_s.begin(),r_s.end(),inserter(mul,mul.end()));\n return mul.size()-hit(a,r);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3060,
"score_of_the_acc": -0.375,
"final_rank": 5
},
{
"submission_id": "aoj_0226_4552716",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <set>\nusing namespace std;\n\n\nint main() {\n\n string a, b;\n int hit, blow;\n for (;;) {\n set<char> s;\n cin >> a >> b;\n if (a.size() == 1 && b.size() == 1) break;\n hit = blow = 0;\n for (int i = 0; i < 4; i++) s.insert(b[i]);\n for (int i = 0; i < 4; i++) {\n if (a[i] == b[i]) hit++;\n else if (s.find(a[i]) != s.end()) blow++;\n }\n cout << hit << \" \" << blow << endl;\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3072,
"score_of_the_acc": -0.45,
"final_rank": 6
},
{
"submission_id": "aoj_0226_4452295",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<iostream>\n#include<string>\n\nusing namespace std;\n\nint main() \n{\n\tstring r, a;\n\tcin >> r >> a;\n\twhile (r.length() != 1)\n\t{\n\t\tint h = 0, b = 0;\n\t\tfor (size_t i = 0; i < 4; i++)\n\t\t{\n\t\t\tfor (size_t j = 0; j < 4; j++)\n\t\t\t{\n\t\t\t\tif (r[i] == a[j])\n\t\t\t\t{\n\t\t\t\t\tif (i == j)\n\t\t\t\t\t\th++;\n\t\t\t\t\telse\n\t\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << h << \" \" << b << endl;\n\t\tcin >> r >> a;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3100,
"score_of_the_acc": -0.625,
"final_rank": 12
},
{
"submission_id": "aoj_0226_4084473",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n while (true) {\n int r, a;\n cin >> r >> a;\n \n if (r==0 && a==0) {\n break;\n }\n \n int rn[4], an[4];\n \n rn[0] = r/1000;\n rn[1] = (r/100)%10;\n rn[2] = (r/10)%10;\n rn[3] = r%10;\n \n an[0] = a/1000;\n an[1] = (a/100)%10;\n an[2] = (a/10)%10;\n an[3] = a%10;\n \n int hit = 0;\n int blow = 0;\n \n bool is_hit[4];\n \n for (int i=0; i<4; i++) {\n is_hit[i] = false;\n }\n \n for (int i=0; i<4; i++) {\n if (rn[i]==an[i]) {\n hit++;\n is_hit[i] = true;\n }\n }\n \n for (int i=0; i<4; i++) {\n if (!(is_hit[i])) {\n for (int j=0; j<4; j++) {\n if (!(is_hit[j]) && rn[i]==an[j]) {\n blow++;\n }\n }\n }\n }\n \n cout << hit << \" \" << blow << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3016,
"score_of_the_acc": -0.1,
"final_rank": 2
},
{
"submission_id": "aoj_0226_4081706",
"code_snippet": "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n while (1) {\n string r, a;\n\n cin >> r >> a;\n if (r == \"0\" && a == \"0\") break;\n int hit = 0, blow = 0;\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 4; j++) {\n if (r[i] == a[j] && i == j) hit++;\n if (r[i] == a[j] && i != j) blow++;\n }\n }\n cout << hit << \" \" << blow << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3040,
"score_of_the_acc": -0.25,
"final_rank": 4
},
{
"submission_id": "aoj_0226_4042221",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void) {\n int r,a,r1,r2,r3,r4,a1,a2,a3,a4,hit=0,blow=0;\n while (cin>>r>>a) {\n if (r==0&&a==0) {\n break;\n } else {\n r1=r/1000;\n r2=(r-r1*1000)/100;\n r3=(r-r1*1000-r2*100)/10;\n r4=r-r1*1000-r2*100-r3*10;\n a1=a/1000;\n a2=(a-a1*1000)/100;\n a3=(a-a1*1000-a2*100)/10;\n a4=a-a1*1000-a2*100-a3*10;\n if (r1==a1) {\n hit++;\n } else if (r1==a2||r1==a3||r1==a4) {\n blow++;\n }\n if (r2==a2) {\n hit++;\n } else if (r2==a1||r2==a3||r2==a4) {\n blow++;\n }\n if (r3==a3) {\n hit++;\n } else if (r3==a1||r3==a2||r3==a4) {\n blow++;\n }\n if (r4==a4) {\n hit++;\n } else if (r4==a1||r4==a2||r4==a3) {\n blow++;\n }\n }\n cout<<hit<<\" \"<<blow<<endl;\n hit=0;\n blow=0;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3032,
"score_of_the_acc": -0.2,
"final_rank": 3
},
{
"submission_id": "aoj_0226_3923324",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n string S,T;\n while(cin >> S >> T, S != \"0\" && T != \"0\"){\n set<char> st;\n for(char& c : S) st.insert(c);\n\n int hit = 0;\n int blow = 0;\n for(int i = 0; i < T.size(); i++){\n if(S[i] == T[i]) hit++;\n else blow += st.count(T[i]);\n }\n\n cout << hit << \" \" << blow << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3108,
"score_of_the_acc": -0.675,
"final_rank": 13
},
{
"submission_id": "aoj_0226_3722708",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n\nusing namespace std;\n\nclass Solver{};\n\nint main() {\n\twhile (true) {\n\t\tint r, a;\n\t\tcin >> r >> a;\n\t\tif (r == 0)break;\n\n\t\tmap<int, int> mp;\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tint div = pow(10, i);\n\t\t\tmp.emplace((r / div) % 10, i);\n\t\t}\n\n\t\tint h = 0;\n\t\tint b = 0;\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tint div = pow(10, i);\n\t\t\tint val = (a / div) % 10;\n\t\t\tif (mp.find(val) != mp.end()) {\n\t\t\t\tif (mp[val] == i)h++;\n\t\t\t\telse b++;\n\t\t\t}\n\t\t}\n\n\t\tcout << h << \" \" << b << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3132,
"score_of_the_acc": -0.825,
"final_rank": 14
},
{
"submission_id": "aoj_0226_3722706",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst double eps=1e-9;\ntypedef vector<int> vi;\ntypedef long long ll;\nstring a,b;\nint main(void)\n{\n while(cin >> a >> b && a!=\"0\") {\n int hit=0,blow=0;\n set<int> st;\n for (int i = 0; i < 4; i++) {\n st.insert(int(a[i]-'0'));\n }\n for(int i=0;i<4;i++)\n {\n if(a[i]==b[i])\n {\n hit++;\n continue;\n }\n else\n {\n auto it=st.find(int(b[i]-'0'));\n if(it!=st.end()) blow++;\n }\n }\n cout << hit << ' ' << blow << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.9,
"final_rank": 16
},
{
"submission_id": "aoj_0226_3722705",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define pp pair<int,int>\n#define ll long long\n#define ld long double\nint inf=100000000;\nll INF=5000000000000000000;\nll MOD=1000000007;\n\n\nint main() {\n while (true){\n string a,b;\n cin >> a >> b;\n if (a==\"0\") break;\n int h=0,k=0;\n rep(i,4){\n rep(j,4){\n if (a.at(i)==b.at(j) && i==j) h++;\n else if (a.at(i)==b.at(j)) k++;\n }\n }\n cout << h << \" \" << k << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.9,
"final_rank": 16
},
{
"submission_id": "aoj_0226_3722697",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <string>\nusing namespace std;\n\nint solve_testcase() {\n string s, t; cin >> s >> t;\n if(s == \"0\" and t == \"0\") return 1;\n\n int blow = 0, hit = 0;\n vector<bool> seen(4, false);\n vector<bool> A(10), B(10);\n for(int k=0; k<4; k++) {\n if(s[k] == t[k]) {\n hit++;\n }\n else {\n A[ s[k] - '0' ] = true;\n B[ t[k] - '0' ] = true;\n }\n }\n\n for(int i=0; i<10; i++) {\n if(A[i] and B[i]) blow++;\n }\n\n cout << hit << \" \" << blow << endl;\n return 0;\n}\n\nint main() {\n while(!solve_testcase());\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3080,
"score_of_the_acc": -0.5,
"final_rank": 8
},
{
"submission_id": "aoj_0226_3676889",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(void){\n int R, A; //正解と回答\n\n while(true){\n cin >> R >> A;\n if(R == 0 && A == 0) break;\n\n int r[4], a[4]; //４桁の数字を分解するための箱\n for(int i = 0; i < 4; i++){\n r[3 - i] = R % 10;\n a[3 - i] = A % 10;\n R /= 10;\n A /= 10;\n }\n\n int c_hit = 0; //ヒットの数を数える\n int c_blow = 0; //ブローの数を数える\n\n for(int i = 0; i < 4; i++){\n if(r[i] == a[i])\n c_hit++;\n for(int j = 0; j < 4; j++){\n if(i != j) \n if(r[i] == a[j]) c_blow++;\n }\n }\n cout << c_hit << \" \" << c_blow << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3084,
"score_of_the_acc": -0.525,
"final_rank": 9
},
{
"submission_id": "aoj_0226_3436664",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i, n) for(int i=0; i<(n); ++i)\n#define FOR(i, m, n) for(int i=(m); i<(n); ++i)\n#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define Cout(x) cout << (x) << endl\n#define Cout2(x, y) cout << (x) << \" \" << (y) << endl\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define forauto(i, a) for(auto i : a)cout << i << \" \"; puts(\"\");\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef vector<LL> VL;\ntypedef vector<string> VS;\ntypedef vector<bool> VB;\ntypedef vector<vector<int>> VVI;\ntypedef pair<int, int> PII;\nconst int inf = 1e9;\nconst double pi = acos(-1.0);\n\n\nint main() {\n\tstring a, b;\n\twhile (cin >> a >> b && (a != \"0\" || b != \"0\")) {\n\n\t\tint a1 = 0, a2 = 0;\n\t\trep(i, 4)a1 += a[i] == b[i];\n\t\trep(i, 10)a2 += min(count(all(a), '0' + i), count(all(b), '0' + i));\n\t\tCout2(a1, a2 - a1);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3140,
"score_of_the_acc": -0.875,
"final_rank": 15
},
{
"submission_id": "aoj_0226_3361774",
"code_snippet": "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n\t\n\tstring t1, t2;\n\n\twhile (cin >> t1 >> t2 && t1 != \"0\" && t2 != \"0\") {\n\n\t\tint h = 0, b = 0;\n\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tfor (int j = 0; j < 4; j++) {\n\n\t\t\t\tif (t1[i] == t2[j] && i == j)\n\t\t\t\t\th++;\n\n\t\t\t\telse if (t1[i] == t2[j] && i != j)\n\t\t\t\t\tb++;\n\t\t\t}\n\t\t}\n\n\t\tcout << h << \" \" << b << \"\\n\";\n\t\t\n\t}\n\n\treturn 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3160,
"score_of_the_acc": -1,
"final_rank": 20
},
{
"submission_id": "aoj_0226_3356866",
"code_snippet": "#include <iostream>\n#include <cstdlib>\nusing namespace std;\n\nint main()\n{\t\n\tchar r[5], a[5];\n\n\tcin >> r >> a;\n\n\twhile (atoi(r) != 0 || atoi(a) != 0) {\n\t\tint h = 0, b = 0;\n\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tfor(int j = 0; j < 4; j++)\n\t\t\t\tif (r[i] == a[j]) {\n\t\t\t\t\tif (i == j)\n\t\t\t\t\t\th++;\n\t\t\t\t\telse\n\t\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t}\n\n\t\tcout << h << \" \" << b << endl;\n\t\tcin >> r >> a;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3000,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0226_3328747",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n string s, t;\n int j[10];\n\n while( cin >> s >> t )\n {\n if( s == \"0\" && t == \"0\" )\n break;\n for( int i = 0; i < 10; i++ )\n j[i] = 0;\n\n int hit = 0, blow = 0;\n for( int i = 0; i < 4; i++ )\n {\n if( s[i] == t[i] )\n hit++;\n j[s[i]-'0']++;\n j[t[i]-'0']++;\n }\n for( int i = 0; i < 10; i++ )\n if( j[i] == 2 )\n blow++;\n cout << hit << \" \" << blow - hit << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.9,
"final_rank": 16
},
{
"submission_id": "aoj_0226_3178228",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint main() {\n\tstring a, b,keta[5];\n\tint ans[4],kt[5];\n\twhile (1) {\n\t\tfor (int i = 0; i <= 5; i++) {\n\t\t\tkt[i] = 1;\n\t\t}\n\t\tcin >> a >> b;\n\t\tif (a == \"0\"&&b == \"0\") {\n\t\t\tgoto a;\n\t\t}\n\t\tfor(int i=0;i<=3;i++){\n\t\t\tketa[i] = a[i];\n\t\t}\n\t\tans[1] = 0;\n\t\tans[2] = 0;\n\t\tfor (int i = 0; i <= 3; i++) {\n\t\t\tif (a[i] == b[i]) {\n\t\t\t\tans[1] = ans[1] + 1;\n\t\t\t\tkt[i] = 0;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i <= 3; i++) {\n\t\t\tfor (int z = 0; z <= 3; z++) {\n\t\t\t\tif (a[i] == b[z]) {\n\t\t\t\t\tif (kt[z]) {\n\t\t\t\t\t\tans[2] = ans[2] + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans[1] << \" \" << ans[2] << endl;\n\t}\na:;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3088,
"score_of_the_acc": -0.55,
"final_rank": 10
},
{
"submission_id": "aoj_0226_2904362",
"code_snippet": "#include <iostream>\n#include <vector>\nint usage(int a, int digit = 0) {\n\tif (digit == 4) return 0;\n\treturn (1 << (a % 10)) + usage(a / 10, digit + 1);\n}\nint hit(int a, int b) {\n\tint res = 0;\n\tfor (auto i = 0; i < 4; ++i) {\n\t\tres += (a % 10 == b % 10) ? 1 : 0;\n\t\ta /= 10; b /= 10;\n\t}\n\treturn res;\n}\nint brow(int a, int b) {\n\tint ua = usage(a); int ub = usage(b);\n\tint res = -hit(a, b);\n\tfor (auto i = 0; i < 10; ++i) {\n\t\tres += (ua & ub & 1);\n\t\tua >>= 1; ub >>= 1;\n\t}\n\treturn res;\n}\nint main() {\n\tint a, b;\n\tstd::cin >> a >> b;\n\twhile (a != 0 && b != 0) {\n\t\tstd::cout << hit(a, b) << ' ' << brow(a, b) << std::endl;\n\t\tstd::cin >> a >> b;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3072,
"score_of_the_acc": -0.45,
"final_rank": 6
},
{
"submission_id": "aoj_0226_2894160",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\n string s,k;\n\n while(1){\n\n\tcin>>s>>k;\n\n\tif(s == \"0\" && k == \"0\")\n\t break;\n\n\tint hit=0;\n\tint blow=0;\n\t\n\tfor(int i=0;i<4;++i){\n\n\t if(s[i] == k[i])\n\t\thit++;\n\n\t else{\n\t\tfor(int j=0;j<4;++j){\n\n\t\t if(s[i]==k[j]){\n\t\t\tblow++;\n\t\t\tbreak;\n\t\t }\n\t\t}\n\t\t\n\t }\n\t\n\t}\n\n\tcout<<hit<<\" \"<<blow<<endl;\n\t\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3156,
"score_of_the_acc": -0.975,
"final_rank": 19
}
] |
aoj_0223_cpp
|
迷子の双子
たかゆき君とかずゆき君は仲良しの双子ですが、行動が真逆です。 例えば、たかゆき君が西に行けば、かずゆき君は東へ行き、かずゆき君が北へ行けば、たかゆき君は南へ行きます。 現在 2 人はデパートに来ており、別々の場所にいます。真逆に移動してしまう 2 人ができるだけ早く出会うためにはどうしたらよいでしょうか?
デパートは横
W
個 × 縦
H
個のマスで構成されるグリッドで表され、2 人は単位時間に東西南北に 1 マス分移動することができます。ただし、グリッドの範囲外や障害物のあるマスに移動することはできません。
図のように、グリッドのマスの位置は座標 (
x
,
y
) で表されます。
グリッドの情報と 2 人の初期位置を入力とし、2 人が出会うまでの最短の時間を出力するプログラムを作成してください。出会うことができない場合や、出会うのに 100 以上の時間を要する場合は、NA と出力してください。グリッドの情報は、
H
行
W
列の数字、2 人の位置情報は座標によって与えられます。
移動後にたかゆき君かかずゆき君のうち、どちらか一方が障害物やグリッドの範囲外に位置してしまうときには、移動ができないので、障害物やグリッドの範囲外に位置する方は元の場所に戻りますが、そうでない方は元の場所に戻ることなく動くことができます。
なお、2 人が出会うとは、移動後に 2 人が同じマスに止まることを言います。2 人がすれ違っても、出会ったことにはなりません。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。
各データセットは以下の形式で与えられます。
W
H
tx
ty
kx
ky
d
11
d
21
...
d
W1
d
12
d
22
...
d
W2
:
d
1H
d
2H
...
d
WH
1 行目にデパートの大きさ
W
,
H
(1 ≤
W, H
≤ 50) が与えられます。2 行目にたかゆき君の初期位置
tx, ty
、3 行目にかずゆき君の初期位置
kx, ky
が与えられます。
続く
H
行にデパートの情報が与えられます。
d
i,j
はマス (
i, j
) の種類を表し、0 のとき移動可能なマス、1 のとき障害物があるマスを表します。
データセットの数は 100 を超えません。
Output
入力データセットごとに、最短の時間を１行に出力します。
Sample Input
6 6
2 4
6 2
0 0 0 0 1 0
0 1 0 0 0 0
0 1 0 0 0 0
0 0 0 1 0 0
0 0 0 0 0 1
0 0 0 0 0 0
3 3
1 1
3 3
0 0 0
0 1 0
0 0 0
0 0
Output for the Sample Input
3
NA
|
[
{
"submission_id": "aoj_0223_10853988",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing vi = vector<int>;\nusing vvi = vector<vi>;\n\nconstexpr int INF = 1e9;\n\nint main() {\n using state = tuple<int, int, int, int, int>;\n\n int W, H;\n while(cin >> W >> H, W) {\n int tx, ty, kx, ky;\n cin >> tx >> ty >> kx >> ky;\n tx--; ty--; kx--; ky--;\n vector<vector<int>> v(H, vector<int>(W));\n for(int i=0; i<H; ++i) {\n for(int j=0; j<W; ++j) {\n cin >> v[i][j];\n }\n }\n vector<vector<vvi>> d(H, vector<vvi>(W, vvi(H, vi(W, INF))));\n d[ty][tx][ky][kx] = 0;\n queue<state> que;\n que.push(make_tuple(0, ty, tx, ky, kx));\n int dx[4] = {0, -1, 0, 1},\n dy[4] = {1, 0, -1, 0};\n auto check = [&v, W, H](int y, int x) {\n return 0 <= y && y < H && 0 <= x && x < W && v[y][x] == 0;\n };\n while(!que.empty()) {\n int cd, y1, x1, y2, x2;\n tie(cd, y1, x1, y2, x2) = que.front();\n que.pop();\n for(int i=0; i<4; ++i) {\n int ny1 = y1+dy[i], nx1 = x1+dx[i];\n if(!check(ny1, nx1)) {\n ny1 = y1;\n nx1 = x1;\n }\n int ny2 = y2-dy[i], nx2 = x2-dx[i];\n if(!check(ny2, nx2)) {\n ny2 = y2;\n nx2 = x2;\n }\n if(d[ny1][nx1][ny2][nx2] > cd + 1 && cd + 1 < 100) {\n d[ny1][nx1][ny2][nx2] = cd + 1;\n que.push(make_tuple(cd+1, ny1, nx1, ny2, nx2));\n }\n }\n }\n int res = INF;\n for(int i=0; i<H; ++i) {\n for(int j=0; j<W; ++j) {\n res = min(res, d[i][j][i][j]);\n }\n }\n if(res == INF) {\n cout << \"NA\" << endl;\n } else {\n cout << res << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 1880,
"memory_kb": 32860,
"score_of_the_acc": -1.1225,
"final_rank": 8
},
{
"submission_id": "aoj_0223_10846074",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n for(int W,H;cin>>W>>H,W!=0;){\n int tx,ty,kx,ky;\n cin>>tx>>ty>>kx>>ky;\n ty--;tx--;ky--;kx--;\n\n vector A(H,vector<int>(W,0));\n rep(i,H)rep(j,W)cin>>A[i][j];\n\n vector dp(H,vector<vector<vector<int>>>(W,vector<vector<int>>(H,vector<int>(W,1e9))));\n dp[ty][tx][ky][kx]=0;\n queue<array<int,4>> q;\n q.push({ty,tx,ky,kx});\n while(!q.empty()){\n auto [y1,x1,y2,x2]=q.front();\n q.pop();\n vector<int> dd={0,1,0,-1,0};\n rep(i,4){\n int ny1=y1+dd[i];\n int nx1=x1+dd[i+1];\n int ny2=y2+dd[(i+2)%4];\n int nx2=x2+dd[(i+3)%4];\n\n if(ny1<0||H<=ny1||nx1<0||W<=nx1||A[ny1][nx1]) ny1=y1,nx1=x1;\n if(ny2<0||H<=ny2||nx2<0||W<=nx2||A[ny2][nx2]) ny2=y2,nx2=x2;\n if(dp[ny1][nx1][ny2][nx2]!=1e9) continue;\n dp[ny1][nx1][ny2][nx2]=dp[y1][x1][y2][x2]+1;\n q.push({ny1,nx1,ny2,nx2});\n }\n }\n int ans=1e9;\n rep(i,H)rep(j,W) chmin(ans, dp[i][j][i][j]); \n if(ans>=100) cout<<\"NA\\n\";\n else cout<<ans<<\"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 2710,
"memory_kb": 32964,
"score_of_the_acc": -1.4401,
"final_rank": 16
},
{
"submission_id": "aoj_0223_9678744",
"code_snippet": "#pragma region Macros\n \n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2,popcnt\")\n \n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n \n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n// #define int ll\n#define endl '\\n'\n \n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n \n// #define next asdnext\n// #define prev asdprev\n \nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n \nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n \n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n bool operator <(const Edge& e) { return this->cost < e.cost; }\n bool operator >(const Edge& e) { return this->cost > e.cost; }\n};\n \nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n \nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int() {\n return dist_x(rng);\n }\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nnamespace bit_function {\n using i64 = ll;\n // using i64 = uint64_t;\n // bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\n i64 lrmask(int l, int r) { return (1LL << r) - (1LL << l); }\n i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\n i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n \n i64 popcount(i64 x) { return __builtin_popcountll(x); }\n i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); }\n i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみ\n i64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうる\n bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\n bool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n //bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); }\n \n int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\n int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n int next_bit(i64 x, int k) { // upper_bound\n x >>= (k + 1);\n int pos = k + 1;\n while (x > 0) {\n if (x & 1) return pos;\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int prev_bit(i64 x, int k) {\n // k = min(k, bit_width(x)); ?\n int pos = 0;\n while (x > 0 && pos < k) {\n if (x & 1) {\n if (pos < k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int kth_bit(i64 x, int k) { // kは1-indexed\n int pos = 0, cnt = 0;\n while (x > 0) {\n if (x & 1) {\n cnt++;\n if (cnt == k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\n i64 lsb(i64 x) { return (x & -x); } // mask\n \n int countl_zero(i64 x) { return __builtin_clzll(x); }\n int countl_one(i64 x) { // countl_oneと定義が異なるので注意\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n }\n int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64\n int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n // int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x));\n\n i64 l_one(i64 x) { // 最上位で連なってる1のmask\n if (x == 0) return 0;\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; }\n return ret;\n }\n \n int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bit\n int ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); }\n i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msb\n i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n \n i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\n i64 rotr(i64 x, int k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\n i64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n }\n // i64 bit_reverse(i64 x, int l, int r) {}\n \n bool is_palindrome(i64 x) { return x == bit_reverse(x); }\n bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\n i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\n i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカット\n \n i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\n i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\n i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\n i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\n i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n \n i64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n }\n} using namespace bit_function;\n\nnamespace util_function {\n namespace Std = std;\n __int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n // assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n // assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n }\n int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n }\n int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n return x - y * per(x, y);\n } // https://yukicoder.me/problems/no/2781\n int floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n }\n int ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n }\n int round(int x, int y) { // (ld)(x/y)を小数点第1位について四捨五入\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n }\n int round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0 && k >= 0);\n if (k == 0) return (x * 2 + y) / (y * 2);\n x /= y * POW(10, k - 1);\n if (x % 10 >= 5) return (x + 10 - x % 10) * POW(10, k - 1);\n return x * POW(10, k - 1);\n }\n int round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = x / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n }\n ld round(ld x, int k) { // xを10^kの位に関して四捨五入. to_string(x, k)優先\n // x += EPS;\n ld d = pow(10, -k);\n return Std::round(x * d) / d;\n }\n ld floor(ld x, int k) { // xを10^kの位に関してflooring\n // x += EPS;\n ld d = pow(10, -k);\n return Std::floor(x * d) / d; // 未verify\n }\n ld ceil(ld x, int k) { // xを10^kの位に関してceiling\n // x -= EPS;\n ld d = pow(10, -k);\n return Std::ceil(x * d) / d; // 未verify\n }\n // int kth(int x, int y, int k) { // x / yの10^kの位の桁\n // }\n int floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return Std::floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n }\n int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return Std::ceil(x / y);\n // ceil(x) = floor(x + 1)\n }\n int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return Std::floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -Std::floor(x / fabs(y));\n if (x < 0 && y < 0) return Std::floor(x / y) + (x - Std::floor(x/y)*y < -EPS);\n return Std::floor(x / y) - (x - Std::floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n }\n ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n }\n int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\n int modf(ld x) {\n if (x < 0) return ceill(x);\n else return floorl(x);\n }\n // 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\n int seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n }\n int seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n }\n\n int floor_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now <= x) {\n now *= base;\n if (now <= x) ret++;\n }\n return ret;\n }\n int ceil_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now < x) {\n now *= base;\n ret++;\n }\n return ret;\n }\n\n template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n }\n template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n }\n \n template <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n }\n template <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n }\n template <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - Std::max({a, b, c}) - Std::min({a, b, c});\n }\n template <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) if (a > b) swap(a, b);\n else if (b > a) swap(b, a);\n }\n template <typename T, typename... Args>\n void Sort(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.begin(), vec.end());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n template <typename T, typename... Args>\n void Sortr(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.rbegin(), vec.rend());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n\n istream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n }\n ostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n }\n \n __int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n }\n __int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n __int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n }\n \n string to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n \n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n }\n string to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n }\n string to_string(char c) { string s = \"\"; s += c; return s; }\n} using namespace util_function;\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n \n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\ntemplate<typename T>\nclass Compress { // 試験運用, バグったらTをintにする\npublic:\n int sz = 0;\n // gp_hash_table<T, int, custom_hash> Z;\n // gp_hash_table<int, T, custom_hash> UZ;\n unordered_map<T, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, T> UZ; // 圧縮した値 -> 元の値\n \n Compress() {}\n Compress(const vector<T> &V, T base = 0) {\n this->sz = base;\n set<T> s(V.begin(), V.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, T base = 0) {\n this->sz = base;\n vector<T> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<T> s(V3.begin(), V3.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, T base = 0) {\n this->sz = base;\n vector<T> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<T> s(V4.begin(), V4.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2,\n const vector<T> &V3, const vector<T> &V4, T base = 0) {\n this->sz = base;\n vector<T> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<T> s(V5.begin(), V5.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n vector<int> zip(const vector<T> &V) {\n vector<int> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[V[i]];\n }\n return ret;\n }\n \n vector<T> unzip(const vector<int> &V) {\n vector<T> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[V[i]];\n }\n return ret;\n }\n \n int size() { return sz; }\n \n T encode(int x) { return Z[x]; }\n int decode(T x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n \nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n \ntemplate<typename T> struct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<T> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n \ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n \n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n\n friend istream &operator >>(istream &is, Modint& x) {\n int t; is >> t; x = t; return (is);\n }\n friend ostream &operator <<(ostream &os, const Modint& x) {\n return os << x.val;\n }\n};\nusing mint = Modint<MOD>;\n \nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n// int modinv(__int128_t x, int mod) { // \n// assert(mod > 0);\n// // assert(x > 0);\n// if (x == 1 or x == 0) return 1;\n// return mod - modinv(mod % x, mod) * (mod / x) % mod;\n// }\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n \nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint FACinv(int N) {\n if (N < 0) return 0; return _finv[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint COMinv(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _finv[N] * _fac[K] * _fac[N - K];\n}\nmint MCOM(const vector<int> &V) {\n int N = 0;\n for (int i = 0; i < V.size(); i++) N += V[i];\n mint ret = _fac[N];\n for (int i = 0; i < V.size(); i++) ret *= _finv[V[i]];\n return ret;\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n \n#pragma endregion\n\nint H, W;\nbool isvalid(int x, int y) {\n if (x >= 0 && x < H && y >= 0 && y < W) return true;\n else return false;\n}\n\nint dist[50][50][50][50];\nsigned main() {\n while (cin >> W >> H, W) {\n int x1, y1, x2, y2;\n cin >> y1 >> x1 >> y2 >> x2;\n y1--; x1--; y2--; x2--;\n vector<vector<int>> A(H, vector<int>(W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n cin >> A[i][j];\n }\n }\n\n const int inf = H*W*H*W + 1;\n\n // dist[i][j] := 人1がマスi, 人2がマスjにいるような状態までの距離\n for (int i = 0; i < 50; i++) {\n for (int j = 0; j < 50; j++) {\n for (int k = 0; k < 50; k++) {\n for (int l = 0; l < 50; l++) {\n dist[i][j][k][l] = inf;\n }\n }\n }\n }\n dist[x1][y1][x2][y2] = 0;\n\n queue<tuple<int, int, int, int>> qu;\n qu.emplace(x1, y1, x2, y2);\n\n while (qu.size()) {\n auto[i1, j1, i2, j2] = qu.front();\n qu.pop();\n \n for (int k = 0; k < 4; k++) {\n int ni1 = i1 + dx[k];\n int nj1 = j1 + dy[k];\n if (!isvalid(ni1, nj1) or A[ni1][nj1] == 1) { // 人1の行き先がない場合はその場に留まる\n ni1 = i1; nj1 = j1;\n }\n\n int ni2 = i2 + dx[(k + 2) % 4];\n int nj2 = j2 + dy[(k + 2) % 4];\n if (!isvalid(ni2, nj2) or A[ni2][nj2] == 1) { // 人2の行き先がない場合はその場に留まる\n ni2 = i2; nj2 = j2;\n }\n\n if (dist[ni1][nj1][ni2][nj2] > dist[i1][j1][i2][j2] + 1) {\n dist[ni1][nj1][ni2][nj2] = dist[i1][j1][i2][j2] + 1;\n qu.emplace(ni1, nj1, ni2, nj2);\n if (ni1 == ni2 && nj1 == nj2) {\n qu = queue<tuple<int, int, int, int>>();\n break;\n }\n }\n }\n }\n\n int ans = inf;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n ans = min(ans, dist[i][j][i][j]);\n }\n }\n if (ans >= min(100, inf)) cout << \"NA\" << endl;\n else cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 28024,
"score_of_the_acc": -0.3691,
"final_rank": 3
},
{
"submission_id": "aoj_0223_7096787",
"code_snippet": "#line 1 \"library/my_template.hpp\"\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\n\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n// https://trap.jp/post/1224/\n#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)\n#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)\n#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)\n#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))\n#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)\n#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\n#define FOR_R(...) \\\n overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\n\n#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))\n#define all(x) x.begin(), x.end()\n#define len(x) ll(x.size())\n#define elif else if\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n\ntemplate <typename T, typename U>\nT SUM(const vector<U> &A) {\n T sum = 0;\n for (auto &&a: A) sum += a;\n return sum;\n}\n\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)))\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n\nint popcnt(int x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(ll x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT pick(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\n\ntemplate <typename T>\nT pick(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(pqg<T> &que) {\n assert(que.size());\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(vc<T> &que) {\n assert(que.size());\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename T, typename U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <typename T, typename U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <typename T, typename U>\npair<T, T> divmod(T x, U y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng) {\n assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return ok;\n}\n\ntemplate <typename F>\ndouble binary_search_real(F check, double ok, double ng, int iter = 100) {\n FOR(iter) {\n double x = (ok + ng) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return (ok + ng) / 2;\n}\n\ntemplate <class T, class S>\ninline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\ntemplate <class T, class S>\ninline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n FOR(i, S.size()) { A[i] = S[i] - first_char; }\n return A;\n}\n\ntemplate <typename T, typename U>\nvector<T> cumsum(vector<U> &A, int off = 1) {\n int N = A.size();\n vector<T> B(N + 1);\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\ntemplate <typename CNT, typename T>\nvc<CNT> bincount(const vc<T> &A, int size) {\n vc<CNT> C(size);\n for (auto &&x: A) { ++C[x]; }\n return C;\n}\n\n// stable\ntemplate <typename T>\nvector<int> argsort(const vector<T> &A) {\n vector<int> ids(A.size());\n iota(all(ids), 0);\n sort(all(ids),\n [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\n int n = len(I);\n vc<T> B(n);\n FOR(i, n) B[i] = A[I[i]];\n return B;\n}\n#line 1 \"library/other/io.hpp\"\n// based on yosupo's fastio\n#include <unistd.h>\n\nnamespace detail {\ntemplate <typename T, decltype(&T::is_modint) = &T::is_modint>\nstd::true_type check_value(int);\ntemplate <typename T>\nstd::false_type check_value(long);\n} // namespace detail\n\ntemplate <typename T>\nstruct is_modint : decltype(detail::check_value<T>(0)) {};\ntemplate <typename T>\nusing is_modint_t = enable_if_t<is_modint<T>::value>;\ntemplate <typename T>\nusing is_not_modint_t = enable_if_t<!is_modint<T>::value>;\n\nstruct Scanner {\n FILE *fp;\n char line[(1 << 15) + 1];\n size_t st = 0, ed = 0;\n void reread() {\n memmove(line, line + st, ed - st);\n ed -= st;\n st = 0;\n ed += fread(line + ed, 1, (1 << 15) - ed, fp);\n line[ed] = '\\0';\n }\n bool succ() {\n while (true) {\n if (st == ed) {\n reread();\n if (st == ed) return false;\n }\n while (st != ed && isspace(line[st])) st++;\n if (st != ed) break;\n }\n if (ed - st <= 50) {\n bool sep = false;\n for (size_t i = st; i < ed; i++) {\n if (isspace(line[i])) {\n sep = true;\n break;\n }\n }\n if (!sep) reread();\n }\n return true;\n }\n template <class T, enable_if_t<is_same<T, string>::value, int> = 0>\n bool read_single(T &ref) {\n if (!succ()) return false;\n while (true) {\n size_t sz = 0;\n while (st + sz < ed && !isspace(line[st + sz])) sz++;\n ref.append(line + st, sz);\n st += sz;\n if (!sz || st != ed) break;\n reread();\n }\n return true;\n }\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\n bool read_single(T &ref) {\n if (!succ()) return false;\n bool neg = false;\n if (line[st] == '-') {\n neg = true;\n st++;\n }\n ref = T(0);\n while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }\n if (neg) ref = -ref;\n return true;\n }\n template <class T, is_modint_t<T> * = nullptr>\n bool read_single(T &ref) {\n long long val = 0;\n bool f = read_single(val);\n ref = T(val);\n return f;\n }\n bool read_single(double &ref) {\n string s;\n if (!read_single(s)) return false;\n ref = std::stod(s);\n return true;\n }\n bool read_single(char &ref) {\n string s;\n if (!read_single(s) || s.size() != 1) return false;\n ref = s[0];\n return true;\n }\n template <class T>\n bool read_single(vector<T> &ref) {\n for (auto &d: ref) {\n if (!read_single(d)) return false;\n }\n return true;\n }\n template <class T, class U>\n bool read_single(pair<T, U> &p) {\n return (read_single(p.first) && read_single(p.second));\n }\n template <class A, class B, class C>\n bool read_single(tuple<A, B, C> &p) {\n return (read_single(get<0>(p)) && read_single(get<1>(p))\n && read_single(get<2>(p)));\n }\n template <class A, class B, class C, class D>\n bool read_single(tuple<A, B, C, D> &p) {\n return (read_single(get<0>(p)) && read_single(get<1>(p))\n && read_single(get<2>(p)) && read_single(get<3>(p)));\n }\n void read() {}\n template <class H, class... T>\n void read(H &h, T &... t) {\n bool f = read_single(h);\n assert(f);\n read(t...);\n }\n Scanner(FILE *fp) : fp(fp) {}\n};\n\nstruct Printer {\n Printer(FILE *_fp) : fp(_fp) {}\n ~Printer() { flush(); }\n\n static constexpr size_t SIZE = 1 << 15;\n FILE *fp;\n char line[SIZE], small[50];\n size_t pos = 0;\n void flush() {\n fwrite(line, 1, pos, fp);\n pos = 0;\n }\n void write(const char &val) {\n if (pos == SIZE) flush();\n line[pos++] = val;\n }\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\n void write(T val) {\n if (pos > (1 << 15) - 50) flush();\n if (val == 0) {\n write('0');\n return;\n }\n if (val < 0) {\n write('-');\n val = -val; // todo min\n }\n size_t len = 0;\n while (val) {\n small[len++] = char(0x30 | (val % 10));\n val /= 10;\n }\n for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }\n pos += len;\n }\n void write(const string &s) {\n for (char c: s) write(c);\n }\n void write(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++) write(s[i]);\n }\n void write(const double &x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << x;\n string s = oss.str();\n write(s);\n }\n void write(const long double &x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << x;\n string s = oss.str();\n write(s);\n }\n template <class T, is_modint_t<T> * = nullptr>\n void write(T &ref) {\n write(ref.val);\n }\n template <class T>\n void write(const vector<T> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) write(' ');\n write(val[i]);\n }\n }\n template <class T, class U>\n void write(const pair<T, U> &val) {\n write(val.first);\n write(' ');\n write(val.second);\n }\n template <class A, class B, class C>\n void write(const tuple<A, B, C> &val) {\n auto &[a, b, c] = val;\n write(a), write(' '), write(b), write(' '), write(c);\n }\n template <class A, class B, class C, class D>\n void write(const tuple<A, B, C, D> &val) {\n auto &[a, b, c, d] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);\n }\n template <class A, class B, class C, class D, class E>\n void write(const tuple<A, B, C, D, E> &val) {\n auto &[a, b, c, d, e] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);\n }\n template <class A, class B, class C, class D, class E, class F>\n void write(const tuple<A, B, C, D, E, F> &val) {\n auto &[a, b, c, d, e, f] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);\n }\n template <class T, size_t S>\n void write(const array<T, S> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) write(' ');\n write(val[i]);\n }\n }\n void write(i128 val) {\n string s;\n bool negative = 0;\n if(val < 0){\n negative = 1;\n val = -val;\n }\n while (val) {\n s += '0' + int(val % 10);\n val /= 10;\n }\n if(negative) s += \"-\";\n reverse(all(s));\n if (len(s) == 0) s = \"0\";\n write(s);\n }\n};\n\nScanner scanner = Scanner(stdin);\nPrinter printer = Printer(stdout);\n\nvoid flush() { printer.flush(); }\nvoid print() { printer.write('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n printer.write(head);\n if (sizeof...(Tail)) printer.write(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid read() {}\ntemplate <class Head, class... Tail>\nvoid read(Head &head, Tail &... tail) {\n scanner.read(head);\n read(tail...);\n}\n\n#define INT(...) \\\n int __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define CHAR(...) \\\n char __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n read(__VA_ARGS__)\n\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n read(name)\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n read(name)\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\n#line 3 \"main.cpp\"\n\nvoid solve() {\n auto solve = [&](ll H, ll W) -> void {\n LL(ay, ax, by, bx);\n --ay, --ax, --by, --bx;\n VV(int, G, H, W);\n auto isin = [&](ll x, ll y) -> bool {\n return (0 <= x && x < H && 0 <= y && y < W && G[x][y] == 0);\n };\n ll dx[] = {1, 0, -1, 0};\n ll dy[] = {0, 1, 0, -1};\n const ll INF = 1LL << 60;\n vvvv(ll, dp, H, W, H, W, INF);\n using T = tuple<int, int, int, int>;\n deque<T> que;\n auto add = [&](int x1, int y1, int x2, int y2, int d) -> void {\n if (chmin(dp[x1][y1][x2][y2], d)) { que.eb(x1, y1, x2, y2); }\n };\n add(ax, ay, bx, by, 0);\n while (len(que)) {\n auto [x1, y1, x2, y2] = pick(que);\n FOR(d, 4) {\n ll nx1 = x1 + dx[d];\n ll ny1 = y1 + dy[d];\n ll nx2 = x2 - dx[d];\n ll ny2 = y2 - dy[d];\n if (!isin(nx1, ny1)) nx1 = x1, ny1 = y1;\n if (!isin(nx2, ny2)) nx2 = x2, ny2 = y2;\n add(nx1, ny1, nx2, ny2, dp[x1][y1][x2][y2] + 1);\n }\n }\n ll ANS = INF;\n FOR(x, H) FOR(y, W) chmin(ANS, dp[x][y][x][y]);\n if (ANS == INF)\n print(\"NA\");\n else\n print(ANS);\n };\n\n while (1) {\n LL(W, H);\n if (H + W == 0) break;\n solve(H, W);\n }\n}\n\nsigned main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << setprecision(15);\n\n solve();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 2730,
"memory_kb": 58204,
"score_of_the_acc": -1.9464,
"final_rank": 20
},
{
"submission_id": "aoj_0223_7065652",
"code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define ALL(x) (x).begin(), (x).end()\n\nusing namespace std;\n\ntemplate <typename T>\nT &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T>\nT &chmax(T &a, const T &b) { return a = max(a, b); }\n\nusing ll = long long;\nusing ld = long double;\n\nconst int INF = 1e9;\nconst ld eps = 1e-9, pi = acos(-1.0);\n\nint w, h;\nvector<vector<int>> d;\nvector<vector<vector<vector<int>>>> flg;\nint movel(int x, int y)\n{\n if (d[x - 1][y] == 1)\n return x;\n return x - 1;\n}\nint mover(int x, int y)\n{\n if (d[x + 1][y] == 1)\n return x;\n return x + 1;\n}\nint moveu(int x, int y)\n{\n if (d[x][y - 1] == 1)\n return y;\n return y - 1;\n}\nint moved(int x, int y)\n{\n if (d[x][y + 1] == 1)\n return y;\n return y + 1;\n}\n\nint bfs(int tx, int ty, int kx, int ky)\n{\n flg.assign(w + 2, vector<vector<vector<int>>>(h + 2, vector<vector<int>>(w + 2, vector<int>(h + 2, 0))));\n queue<vector<int>> q;\n q.push({tx, ty, kx, ky, 0});\n flg[tx][ty][kx][ky] = 1;\n\n while (!q.empty())\n {\n int vtx = q.front()[0];\n int vty = q.front()[1];\n int vkx = q.front()[2];\n int vky = q.front()[3];\n int vcnt = q.front()[4];\n q.pop();\n\n if (vtx == vkx && vty == vky)\n return vcnt;\n if (vcnt + 1 + 1 <= 100)\n {\n if (1 != flg[mover(vtx, vty)][vty][movel(vkx, vky)][vky])\n {\n q.push({mover(vtx, vty), vty, movel(vkx, vky), vky, vcnt + 1});\n flg[mover(vtx, vty)][vty][movel(vkx, vky)][vky] = 1;\n }\n if (1 != flg[movel(vtx, vty)][vty][mover(vkx, vky)][vky])\n {\n q.push({movel(vtx, vty), vty, mover(vkx, vky), vky, vcnt + 1});\n flg[mover(vtx, vty)][vty][movel(vkx, vky)][vky] = 1;\n }\n if (1 != flg[vtx][moveu(vtx, vty)][vkx][moved(vkx, vky)])\n {\n q.push({vtx, moveu(vtx, vty), vkx, moved(vkx, vky), vcnt + 1});\n flg[vtx][moveu(vtx, vty)][vkx][moved(vkx, vky)] = 1;\n }\n if (1 != flg[vtx][moved(vtx, vty)][vkx][moveu(vkx, vky)])\n {\n q.push({vtx, moved(vtx, vty), vkx, moveu(vkx, vky), vcnt + 1});\n flg[vtx][moved(vtx, vty)][vkx][moveu(vkx, vky)] = 1;\n }\n }\n }\n return -1;\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (1)\n {\n cin >> w >> h;\n if (w == 0)\n break;\n\n int tx, ty, kx, ky;\n cin >> tx >> ty;\n cin >> kx >> ky;\n d.assign(w + 2, vector<int>(h + 2, 1));\n for (int i = 1; i <= h; i++)\n {\n for (int j = 1; j <= w; j++)\n {\n cin >> d[j][i];\n }\n }\n int ans = bfs(tx, ty, kx, ky);\n if (ans == -1)\n {\n cout << \"NA\" << endl;\n }\n else\n {\n cout << ans << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 47272,
"score_of_the_acc": -0.7875,
"final_rank": 7
},
{
"submission_id": "aoj_0223_6976791",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int w, h;\n while(cin >> w >> h, h){\n vector<vector<int>> A(h, vector<int>(w));\n int sy, sx, ty, tx, y1, y2, x1, x2, ny1, ny2, nx1, nx2;\n cin >> sx >> sy >> tx >> ty;\n sx--, sy--, tx--, ty--;\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n cin >> A[y][x];\n }\n }\n vector<vector<vector<vector<int>>>> dp(h, vector<vector<vector<int>>>(w, \n vector<vector<int>>(h, vector<int>(w, 1 << 30))));\n queue<tuple<int,int,int,int>> nxt;\n dp[sy][sx][ty][tx] = 0;\n nxt.emplace(sy, sx, ty, tx);\n int ans = -1;\n while(!nxt.empty()){\n tie(y1, x1, y2, x2) = nxt.front();\n nxt.pop();\n if(y1 == y2 && x1 == x2){\n ans = dp[y1][x1][y2][x2];\n break;\n }\n for(int i = 0; i < 4; i++){\n int dy = (i == 0) - (i == 1);\n int dx = (i == 2) - (i == 3);\n if(y1 + dy < 0 || y1 + dy >= h || x1 + dx < 0 || x1 + dx >= w || A[y1 + dy][x1 + dx] == 1){\n ny1 = y1, nx1 = x1;\n }else{\n ny1 = y1 + dy, nx1 = x1 + dx;\n }\n if(y2 - dy < 0 || y2 - dy >= h || x2 - dx < 0 || x2 - dx >= w || A[y2 - dy][x2 - dx] == 1){\n ny2 = y2, nx2 = x2;\n }else{\n ny2 = y2 - dy, nx2 = x2 - dx;\n }\n if(dp[y1][x1][y2][x2] + 1 < dp[ny1][nx1][ny2][nx2]){\n dp[ny1][nx1][ny2][nx2] = dp[y1][x1][y2][x2] + 1;\n nxt.emplace(ny1, nx1, ny2, nx2);\n }\n }\n }\n if(ans == -1)cout << \"NA\" << '\\n';\n else cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 32296,
"score_of_the_acc": -0.503,
"final_rank": 5
},
{
"submission_id": "aoj_0223_5851883",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<unordered_set>\n#include<unordered_map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\n#include<complex>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\nconstexpr int mod=1e9+7;\nconstexpr int Mod=998244353;\nconstexpr int inf=mod;\nconstexpr ll linf=(ll)mod*mod;\nstruct fastio{\n\tfastio(){\n\t\tcin.tie(0);\n\t\tios::sync_with_stdio(0);\n\t\tcout<<fixed<<setprecision(20);\n\t};\n}fio;\ntemplate<class T>\nbool chmax(T&a,const T&b){\n\tif(a<b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\ntemplate<class T>\nbool chmin(T&a,const T&b){\n\tif(a>b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\ntypedef pair<int,int>P;\nconstexpr int dx[]={1,0,0,-1},dy[]={0,1,-1,0};\nint dist[2500][2500];\nint main(){\n\tint h,w;\n\twhile(cin>>w>>h,h){\n\t\tint tx,ty,kx,ky;\n\t\tbool d[50][50];\n\t\tcin>>ty>>tx>>ky>>kx;\n\t\tty--,tx--,ky--,kx--;\n\t\tfor(int i=0;i<h;i++)\n\t\t\tfor(int j=0;j<w;j++)\n\t\t\t\tcin>>d[i][j];\n\t\tfor(int i=0;i<h*w;i++)\n\t\t\tfor(int j=0;j<h*w;j++)\n\t\t\t\tdist[i][j]=-1;\n\t\tqueue<P>que;\n\t\tque.push({tx*w+ty,kx*w+ky});\n\t\tdist[tx*w+ty][kx*w+ky]=0;\n\t\tbool fnd=0;\n\t\twhile(!que.empty()){\n\t\t\ttx=que.front().first/w;\n\t\t\tty=que.front().first%w;\n\t\t\tkx=que.front().second/w;\n\t\t\tky=que.front().second%w;\n\t\t\tque.pop();\n\t\t\tif(tx==kx&&ty==ky){\n\t\t\t\tcout<<dist[tx*w+ty][kx*w+ky]<<endl;\n\t\t\t\tfnd=1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tint ntx=tx+dx[i],nty=ty+dy[i],nkx=kx+dx[3-i],nky=ky+dy[3-i];\n\t\t\t\tif(ntx<0||h<=ntx||nty<0||w<=nty||d[ntx][nty]){\n\t\t\t\t\tntx-=dx[i];\n\t\t\t\t\tnty-=dy[i];\n\t\t\t\t}\n\t\t\t\tif(nkx<0||h<=nkx||nky<0||w<=nky||d[nkx][nky]){\n\t\t\t\t\tnkx-=dx[3-i];\n\t\t\t\t\tnky-=dy[3-i];\n\t\t\t\t}\n\t\t\t\tif(dist[ntx*w+nty][nkx*w+nky]==-1){\n\t\t\t\t\tdist[ntx*w+nty][nkx*w+nky]=dist[tx*w+ty][kx*w+ky]+1;\n\t\t\t\t\tque.push({ntx*w+nty,nkx*w+nky});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!fnd)\n\t\t\tcout<<\"NA\"<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 27940,
"score_of_the_acc": -0.3485,
"final_rank": 2
},
{
"submission_id": "aoj_0223_4982310",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint d[50][50];\nint main() {\n init();\n\n queue<tuple<int, int, int, int>> bfs;\n int dy[] = { -1,0,0,1 }, dx[] = { 0,-1,1,0 };\n int rdy[] = { 1,0,0,-1 }, rdx[] = { 0,1,-1,0 };\n auto dp = vec<int>(0, 0, 0, 0);\n for (int w, h; cin >> w >> h, w;) {\n int tx, ty, kx, ky; cin >> tx >> ty >> kx >> ky;\n --tx, --ty, --kx, --ky;\n FOR(i, 0, h)FOR(j, 0, w)cin >> d[i][j];\n defvec<int>(INF, h, w, h, w).swap(dp);\n dp[ty][tx][ky][kx] = 0;\n bfs.emplace(ty, tx, ky, kx);\n while (!bfs.empty()) {\n tie(ty, tx, ky, kx) = bfs.front();\n bfs.pop();\n FOR(i, 0, 4) {\n int nty = ty + dy[i], ntx = tx + dx[i];\n if (out(nty, ntx))nty = ty, ntx = tx;\n if (d[nty][ntx])nty = ty, ntx = tx;\n int nky = ky + rdy[i], nkx = kx + rdx[i];\n if (out(nky, nkx))nky = ky, nkx = kx;\n if (d[nky][nkx])nky = ky, nkx = kx;\n if (chmin(dp[nty][ntx][nky][nkx], dp[ty][tx][ky][kx] + 1) && dp[nty][ntx][nky][nkx] < 49)\n bfs.emplace(nty, ntx, nky, nkx);\n }\n }\n int ans = INF;\n FOR(i, 0, h)FOR(j, 0, w)chmin(ans, dp[i][j][i][j]);\n if (ans == INF)print(\"NA\");\n else print(ans);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 700,
"memory_kb": 60776,
"score_of_the_acc": -1.2254,
"final_rank": 12
},
{
"submission_id": "aoj_0223_4982309",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint main() {\n init();\n\n queue<tuple<int, int, int, int>> bfs;\n int dy[] = { -1,0,0,1 }, dx[] = { 0,-1,1,0 };\n int rdy[] = { 1,0,0,-1 }, rdx[] = { 0,1,-1,0 };\n auto d = vec<int>(0, 0);\n auto dp = vec<int>(0, 0, 0, 0);\n for (int w, h; cin >> w >> h, w;) {\n int tx, ty, kx, ky; cin >> tx >> ty >> kx >> ky;\n --tx, --ty, --kx, --ky;\n vec<int>(h, w).swap(d); cin >> d;\n defvec<int>(INF, h, w, h, w).swap(dp);\n dp[ty][tx][ky][kx] = 0;\n bfs.emplace(ty, tx, ky, kx);\n while (!bfs.empty()) {\n tie(ty, tx, ky, kx) = bfs.front();\n bfs.pop();\n FOR(i, 0, 4) {\n int nty = ty + dy[i], ntx = tx + dx[i];\n if (out(nty, ntx))nty = ty, ntx = tx;\n if (d[nty][ntx])nty = ty, ntx = tx;\n int nky = ky + rdy[i], nkx = kx + rdx[i];\n if (out(nky, nkx))nky = ky, nkx = kx;\n if (d[nky][nkx])nky = ky, nkx = kx;\n if (chmin(dp[nty][ntx][nky][nkx], dp[ty][tx][ky][kx] + 1) && dp[nty][ntx][nky][nkx] < 49)\n bfs.emplace(nty, ntx, nky, nkx);\n }\n }\n int ans = INF;\n FOR(i, 0, h)FOR(j, 0, w)chmin(ans, dp[i][j][i][j]);\n if (ans == INF)print(\"NA\");\n else print(ans);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 60816,
"score_of_the_acc": -1.2224,
"final_rank": 10
},
{
"submission_id": "aoj_0223_4982307",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint main() {\n init();\n\n queue<tuple<int, int, int, int>> bfs;\n int dy[] = { -1,0,0,1 }, dx[] = { 0,-1,1,0 };\n int rdy[] = { 1,0,0,-1 }, rdx[] = { 0,1,-1,0 };\n auto d = vec<int>(0, 0);\n auto dp = vec<int>(0, 0, 0, 0);\n for (int w, h; cin >> w >> h, w;) {\n int tx, ty, kx, ky; cin >> tx >> ty >> kx >> ky;\n --tx, --ty, --kx, --ky;\n vec<int>(h, w).swap(d); cin >> d;\n defvec<int>(INF, h, w, h, w).swap(dp);\n dp[ty][tx][ky][kx] = 0;\n bfs.emplace(ty, tx, ky, kx);\n while (!bfs.empty()) {\n tie(ty, tx, ky, kx) = bfs.front();\n bfs.pop();\n if (dp[ty][tx][ky][kx] == 49)continue;\n FOR(i, 0, 4) {\n int nty = ty + dy[i], ntx = tx + dx[i];\n if (out(nty, ntx))nty = ty, ntx = tx;\n if (d[nty][ntx])nty = ty, ntx = tx;\n int nky = ky + rdy[i], nkx = kx + rdx[i];\n if (out(nky, nkx))nky = ky, nkx = kx;\n if (d[nky][nkx])nky = ky, nkx = kx;\n if (chmin(dp[nty][ntx][nky][nkx], dp[ty][tx][ky][kx] + 1))\n bfs.emplace(nty, ntx, nky, nkx);\n }\n }\n int ans = INF;\n FOR(i, 0, h)FOR(j, 0, w)chmin(ans, dp[i][j][i][j]);\n if (ans == INF)print(\"NA\");\n else print(ans);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 60908,
"score_of_the_acc": -1.2242,
"final_rank": 11
},
{
"submission_id": "aoj_0223_4982300",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint main() {\n init();\n\n queue<tuple<int, int, int, int>> bfs;\n int dy[] = { -1,0,0,1 }, dx[] = { 0,-1,1,0 };\n int rdy[] = { 1,0,0,-1 }, rdx[] = { 0,1,-1,0 };\n auto d = vec<int>(0, 0);\n auto dp = vec<int>(0, 0, 0, 0);\n for (int w, h; cin >> w >> h, w;) {\n int tx, ty, kx, ky; cin >> tx >> ty >> kx >> ky;\n --tx, --ty, --kx, --ky;\n vec<int>(h, w).swap(d); cin >> d;\n defvec<int>(INF, h, w, h, w).swap(dp);\n dp[ty][tx][ky][kx] = 0;\n bfs.emplace(ty, tx, ky, kx);\n while (!bfs.empty()) {\n tie(ty, tx, ky, kx) = bfs.front();\n bfs.pop();\n if (dp[ty][tx][ky][kx] == 50)continue;\n FOR(i, 0, 4) {\n int nty = ty + dy[i], ntx = tx + dx[i];\n if (out(nty, ntx))nty = ty, ntx = tx;\n if (d[nty][ntx])nty = ty, ntx = tx;\n int nky = ky + rdy[i], nkx = kx + rdx[i];\n if (out(nky, nkx))nky = ky, nkx = kx;\n if (d[nky][nkx])nky = ky, nkx = kx;\n if (chmin(dp[nty][ntx][nky][nkx], dp[ty][tx][ky][kx] + 1))\n bfs.emplace(nty, ntx, nky, nkx);\n }\n }\n int ans = INF;\n FOR(i, 0, h)FOR(j, 0, w)chmin(ans, dp[i][j][i][j]);\n if (ans == INF)print(\"NA\");\n else print(ans);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 740,
"memory_kb": 60740,
"score_of_the_acc": -1.2399,
"final_rank": 13
},
{
"submission_id": "aoj_0223_4982299",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint main() {\n init();\n\n queue<tuple<int, int, int, int>> bfs;\n int dy[] = { -1,0,0,1 }, dx[] = { 0,-1,1,0 };\n int rdy[] = { 1,0,0,-1 }, rdx[] = { 0,1,-1,0 };\n auto d = vec<int>(0, 0);\n auto dp = vec<int>(0, 0, 0, 0);\n for (int w, h; cin >> w >> h, w;) {\n int tx, ty, kx, ky; cin >> tx >> ty >> kx >> ky;\n --tx, --ty, --kx, --ky;\n vec<int>(h, w).swap(d); cin >> d;\n defvec<int>(INF, h, w, h, w).swap(dp);\n dp[ty][tx][ky][kx] = 0;\n bfs.emplace(ty, tx, ky, kx);\n while (!bfs.empty()) {\n tie(ty, tx, ky, kx) = bfs.front();\n bfs.pop();\n if (dp[ty][tx][ky][kx] == 80)continue;\n FOR(i, 0, 4) {\n int nty = ty + dy[i], ntx = tx + dx[i];\n if (out(nty, ntx))nty = ty, ntx = tx;\n if (d[nty][ntx])nty = ty, ntx = tx;\n int nky = ky + rdy[i], nkx = kx + rdx[i];\n if (out(nky, nkx))nky = ky, nkx = kx;\n if (d[nky][nkx])nky = ky, nkx = kx;\n if (chmin(dp[nty][ntx][nky][nkx], dp[ty][tx][ky][kx] + 1))\n bfs.emplace(nty, ntx, nky, nkx);\n }\n }\n int ans = INF;\n FOR(i, 0, h)FOR(j, 0, w)chmin(ans, dp[i][j][i][j]);\n if (ans == INF)print(\"NA\");\n else print(ans);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 1730,
"memory_kb": 60792,
"score_of_the_acc": -1.6173,
"final_rank": 18
},
{
"submission_id": "aoj_0223_4982297",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint main() {\n init();\n\n queue<tuple<int, int, int, int>> bfs;\n int dy[] = { -1,0,0,1 }, dx[] = { 0,-1,1,0 };\n int rdy[] = { 1,0,0,-1 }, rdx[] = { 0,1,-1,0 };\n auto d = vec<int>(0, 0);\n auto dp = vec<int>(0, 0, 0, 0);\n for (int w, h; cin >> w >> h, w;) {\n int tx, ty, kx, ky; cin >> tx >> ty >> kx >> ky;\n --tx, --ty, --kx, --ky;\n vec<int>(h, w).swap(d); cin >> d;\n defvec<int>(INF, h, w, h, w).swap(dp);\n dp[ty][tx][ky][kx] = 0;\n bfs.emplace(ty, tx, ky, kx);\n while (!bfs.empty()) {\n tie(ty, tx, ky, kx) = bfs.front();\n bfs.pop();\n if (dp[ty][tx][ky][kx] == 99)continue;\n FOR(i, 0, 4) {\n int nty = ty + dy[i], ntx = tx + dx[i];\n if (out(nty, ntx))nty = ty, ntx = tx;\n if (d[nty][ntx])nty = ty, ntx = tx;\n int nky = ky + rdy[i], nkx = kx + rdx[i];\n if (out(nky, nkx))nky = ky, nkx = kx;\n if (d[nky][nkx])nky = ky, nkx = kx;\n if (chmin(dp[nty][ntx][nky][nkx], dp[ty][tx][ky][kx] + 1))\n bfs.emplace(nty, ntx, nky, nkx);\n }\n }\n int ans = INF;\n FOR(i, 0, h)FOR(j, 0, w)chmin(ans, dp[i][j][i][j]);\n if (ans == INF)print(\"NA\");\n else print(ans);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 2190,
"memory_kb": 60916,
"score_of_the_acc": -1.7947,
"final_rank": 19
},
{
"submission_id": "aoj_0223_4982293",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint main() {\n init();\n\n queue<tuple<int, int, int, int>> bfs;\n int dy[] = { -1,0,0,1 }, dx[] = { 0,-1,1,0 };\n int rdy[] = { 1,0,0,-1 }, rdx[] = { 0,1,-1,0 };\n for (int w, h; cin >> w >> h, w;) {\n int tx, ty, kx, ky; cin >> tx >> ty >> kx >> ky;\n --tx, --ty, --kx, --ky;\n auto d = vec<int>(h, w); cin >> d;\n auto dp = defvec<int>(INF, h, w, h, w);\n dp[ty][tx][ky][kx] = 0;\n bfs.emplace(ty, tx, ky, kx);\n while (!bfs.empty()) {\n tie(ty, tx, ky, kx) = bfs.front();\n bfs.pop();\n if (dp[ty][tx][ky][kx] == 99)continue;\n FOR(i, 0, 4) {\n int nty = ty + dy[i], ntx = tx + dx[i];\n if (out(nty, ntx))nty = ty, ntx = tx;\n if (d[nty][ntx])nty = ty, ntx = tx;\n int nky = ky + rdy[i], nkx = kx + rdx[i];\n if (out(nky, nkx))nky = ky, nkx = kx;\n if (d[nky][nkx])nky = ky, nkx = kx;\n if (chmin(dp[nty][ntx][nky][nkx], dp[ty][tx][ky][kx] + 1))\n bfs.emplace(nty, ntx, nky, nkx);\n }\n }\n int ans = INF;\n FOR(i, 0, h)FOR(j, 0, w)chmin(ans, dp[i][j][i][j]);\n if (ans == INF)print(\"NA\");\n else print(ans);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 2060,
"memory_kb": 32728,
"score_of_the_acc": -1.1883,
"final_rank": 9
},
{
"submission_id": "aoj_0223_4981720",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).endf()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).endf())\n#define SORT(c) sort((c).begin(), (c).endf())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-4, PI = acos(-1);\n//ここから編集 \ntypedef string::const_iterator State;\nint dxy[5]={-1,0,1,0,-1};\nint dp[55][55][55][55];\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n int W, H;\n while(cin >> W >> H, W&&H){\n int tx,ty,kx,ky;\n cin>>tx>>ty>>kx>>ky;\n tx--; ty--; kx--; ky--;\n\n vector<vector<int>> f(H, vector<int>(W)); \n REP(i,H) REP(j,W)cin >> f[i][j];\n REP(i,55)REP(j,55)REP(k,55)REP(l,55) dp[i][j][k][l] = INT_MAX;\n dp[ty][tx][ky][kx] = 0;\n\n queue<pair<int, int>> q;\n q.push({ty*W+tx, ky*W+kx});\n while(q.size()){\n auto p = q.front();\n q.pop();\n int sy = p.first/W, sx = p.first%W;\n int ssy = p.second/W, ssx = p.second%W;\n for(int i=0; i<4; i++){\n int ny = sy + dxy[i], nx = sx + dxy[i+1];\n int nny,nnx;\n if(i==0){nny = ssy+1;nnx=ssx;}\n else if(i==1){nny=ssy;nnx=ssx-1;}\n else if(i==2){nny=ssy-1;nnx=ssx;}\n else{nny=ssy;nnx=ssx+1;}\n\n if(!(ny >= 0 && ny < H && nx >= 0 && nx < W && f[ny][nx] != 1)){\n ny = sy, nx = sx;\n }\n if(!(nny >= 0 && nny < H && nnx >= 0 && nnx < W && f[nny][nnx] != 1)){\n nny = ssy, nnx = ssx;\n }\n\n if(dp[ny][nx][nny][nnx] == INT_MAX){\n dp[ny][nx][nny][nnx] = dp[sy][sx][ssy][ssx] + 1;\n q.push(make_pair(ny*W+nx, nny*W+nnx));\n }\n }\n }\n int ans = INT_MAX;\n for(int i=0; i<H; i++){\n for(int j=0; j<W; j++){\n ans = min(ans, dp[i][j][i][j]);\n }\n }\n if(ans >= 100) cout << \"NA\" << endl;\n else cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 2620,
"memory_kb": 39108,
"score_of_the_acc": -1.5273,
"final_rank": 17
},
{
"submission_id": "aoj_0223_4844450",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\nusing namespace std;\nconst int inf = 1e9;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\nstruct st{\n int sy,sx,ty,tx;\n st(int sy, int sx, int ty, int tx):sy(sy),sx(sx),ty(ty),tx(tx){}\n};\nint dp[52][52][52][52];\n\nint main(){\n while(1){\n int w,h;\n cin >> w >> h;\n if(w == 0) break;\n\n int sx,sy,tx,ty;\n cin >> sx >> sy >> tx >> ty;\n vector<vector<int>> g(h+2, vector<int>(w+2, 1));\n for(int i=1; i<=h; i++){\n for(int j=1; j<=w; j++){\n cin >> g[i][j];\n }\n }\n \n queue<st> wait;\n wait.push(st(sy, sx, ty, tx));\n for(int i=0; i<h+2; i++){\n for(int j=0; j<w+2; j++){\n for(int k=0; k<h+2; k++){\n for(int l=0; l<w+2; l++){\n dp[i][j][k][l] = inf;\n }\n }\n }\n }\n dp[sy][sx][ty][tx] = 0;\n int ans = inf;\n while(!wait.empty()){\n int sy = wait.front().sy;\n int sx = wait.front().sx;\n int ty = wait.front().ty;\n int tx = wait.front().tx;\n wait.pop();\n if(sy==ty and sx==tx){\n ans = dp[sy][sx][ty][tx];\n break;\n }\n for(int d=0; d<4; d++){\n int nsy = sy +dy[d];\n int nsx = sx +dx[d];\n int nty = ty +dy[(d+2)%4];\n int ntx = tx +dx[(d+2)%4];\n if(g[nsy][nsx] == 1){\n nsy = sy;\n nsx = sx;\n }\n if(g[nty][ntx] == 1){\n nty = ty;\n ntx = tx;\n }\n if(dp[nsy][nsx][nty][ntx] == inf){\n dp[nsy][nsx][nty][ntx] = dp[sy][sx][ty][tx] +1;\n wait.push(st(nsy, nsx, nty, ntx));\n }\n }\n }\n if(ans >= 100){\n cout << \"NA\" << endl;\n }else{\n cout << ans << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 31784,
"score_of_the_acc": -0.451,
"final_rank": 4
},
{
"submission_id": "aoj_0223_4821474",
"code_snippet": "#include \"bits/stdc++.h\"\n\n// Begin Header {{{\n#pragma region\nusing namespace std;\nusing imax = intmax_t;\nusing usize = size_t;\nusing ld = long double;\n\n#ifndef DEBUG\n#define dump(...)\n#endif\n\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)\n#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)\n#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)\n#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)\n#define let const auto\n\nconstexpr size_t operator\"\"_zu(unsigned long long value) { return value; };\nconstexpr intmax_t operator\"\"_jd(unsigned long long value) { return value; };\nconstexpr uintmax_t operator\"\"_ju(unsigned long long value) { return value; };\n\nconstexpr int INF = 0x3f3f3f3f;\nconstexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;\n\ntemplate <class T, class Compare = less<>>\nusing MaxHeap = priority_queue<T, vector<T>, Compare>;\ntemplate <class T, class Compare = greater<>>\nusing MinHeap = priority_queue<T, vector<T>, Compare>;\n\ninline void input() {}\ntemplate <class Head, class... Tail>\ninline void input(Head&& head, Tail&&... tail) {\n cin >> head;\n input(forward<Tail>(tail)...);\n}\n\ntemplate <class Container, class Value = typename Container::value_type,\n enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>\ninline istream& operator>>(istream &is, Container &vs) {\n for (auto &v: vs) is >> v;\n return is;\n}\n\ninline void output() { cout << \"\\n\"; }\ntemplate <class Head, class... Tail>\ninline void output(Head&& head, Tail&&... tail) {\n cout << head;\n if (sizeof...(tail)) cout << \" \";\n output(forward<Tail>(tail)...);\n}\n\ntemplate <class Container, class Value = typename Container::value_type,\n enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>\ninline ostream& operator<<(ostream &os, const Container &vs) {\n static constexpr const char *delim[] = {\" \", \"\"};\n for (auto it = begin(vs); it != end(vs); ++it) {\n os << delim[it == begin(vs)] << *it;\n }\n return os;\n}\n\ntemplate <class Iterator>\ninline void join(const Iterator &Begin, const Iterator &End, const string &delim = \"\\n\", const string &last = \"\\n\") {\n for (auto it = Begin; it != End; ++it) {\n cout << ((it == Begin) ? \"\" : delim) << *it;\n }\n cout << last;\n}\n\ntemplate <class T>\ninline vector<T> makeVector(const T &initValue, size_t sz) {\n return vector<T>(sz, initValue);\n}\n\ntemplate <class T, class... Args>\ninline auto makeVector(const T &initValue, size_t sz, Args... args) {\n return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));\n}\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\ntemplate <class Container>\nstruct reverse_t {\n Container &c;\n reverse_t(Container &c) : c(c) {}\n auto begin() { return c.rbegin(); }\n auto end() { return c.rend(); }\n};\n\ntemplate <class Container>\nauto reversed(Container &c) {\n return reverse_t<Container>(c);\n}\n\ntemplate <class T>\ninline bool chmax(T &a, const T &b) noexcept {\n return b > a && (a = b, true);\n}\n\ntemplate <class T>\ninline bool chmin(T &a, const T &b) noexcept {\n return b < a && (a = b, true);\n}\n\ntemplate <class T>\ninline T diff(const T &a, const T &b) noexcept {\n return a < b ? b - a : a - b;\n}\n\nvoid ioinit() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n clog << fixed << setprecision(10);\n}\n#pragma endregion\n// }}} End Header\n\nstruct Position {\n pair<int, int> t;\n pair<int, int> k;\n\n // bool operator<(const Position& rhs) const {\n // return make_pair(t, k) < make_pair(rhs.t, rhs.k);\n // }\n};\n\nsigned main() {\n ioinit();\n\n int W, H;\n while (cin >> W >> H, W) {\n var(int, tx, ty);\n var(int, kx, ky);\n tx--, ty--;\n kx--, ky--;\n auto grid = makeVector<int>(0, H, W);\n input(grid);\n\n array<int, 4> dy {0, -1, 0, 1};\n array<int, 4> dx {1, 0, -1, 0};\n array<int, 4> rdy {0, 1, 0, -1};\n array<int, 4> rdx {-1, 0, 1, 0};\n\n const auto able = [&](int y, int x) -> bool {\n return (0 <= y && y < H && 0 <= x && x < W && grid[y][x] == 0);\n };\n\n const auto start_t = make_pair(ty, tx);\n const auto start_k = make_pair(ky, kx);\n const Position start {start_t, start_k};\n\n queue<Position> que;\n que.emplace(start);\n\n auto min_dist = makeVector<int>(INF, H, W, H, W);\n min_dist[ty][tx][ky][kx] = 0;\n\n int res = INF;\n\n while (!que.empty()) {\n const Position state = que.front();\n que.pop();\n const int cur_dist = min_dist[state.t.first][state.t.second][state.k.first][state.k.second];\n if (cur_dist >= 100) continue;\n if (state.t == state.k) {\n chmin(res, cur_dist);\n continue;\n }\n rep(dir, 0, 4) {\n const int new_ty = state.t.first + dy[dir];\n const int new_tx = state.t.second + dx[dir];\n const int new_ky = state.k.first + rdy[dir];\n const int new_kx = state.k.second + rdx[dir];\n if (!able(new_ty, new_tx) && !able(new_ky, new_kx)) continue;\n const auto new_t = (able(new_ty, new_tx) ? make_pair(new_ty, new_tx) : make_pair(state.t.first, state.t.second));\n const auto new_k = (able(new_ky, new_kx) ? make_pair(new_ky, new_kx) : make_pair(state.k.first, state.k.second));\n const Position new_state {new_t, new_k};\n const int new_dist = cur_dist + 1;\n if (chmin(min_dist[new_t.first][new_t.second][new_k.first][new_k.second], new_dist)) {\n que.emplace(new_state);\n }\n }\n }\n\n if (res == INF) {\n output(\"NA\");\n } else {\n output(res);\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 2480,
"memory_kb": 32360,
"score_of_the_acc": -1.3407,
"final_rank": 15
},
{
"submission_id": "aoj_0223_4660661",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass Position {\npublic:\n\tint tx, ty, kx, ky;\n\tint cnt;\n\n\tPosition() {\n\t\ttx = ty = kx = ky = cnt = 0;\n\t}\n\n\tPosition(int x1, int y1, int x2, int y2) : tx(x1), ty(y1), kx(x2), ky(y2) {\n\t\tcnt = 0;\n\t}\n};\n\nint W, H, Ans;\nint MapData[50][50];\nint Dx[4] = { 1,0,-1,0 };\nint Dy[4] = { 0,1,0,-1 };\nbool Visited[50][50][50][50];\n\nbool solve(int x1, int y1, int x2, int y2) {\n\tint curTx, curTy, curKx, curKy, nextTx, nextTy, nextKx, nextKy;\n\tqueue<Position> positionList;\n\tPosition curPos, next;\n\n\tmemset(Visited, false, sizeof(Visited));\n\tpositionList.push(Position(x1, y1, x2, y2));\n\twhile (!positionList.empty()) {\n\t\tcurPos = positionList.front();\n\t\tpositionList.pop();\n\n\t\tif (curPos.cnt == 100) {\n\t\t\treturn false;\n\t\t}\n\t\tcurTx = curPos.tx;\n\t\tcurTy = curPos.ty;\n\t\tcurKx = curPos.kx;\n\t\tcurKy = curPos.ky;\n\t\tif (curTx == curKx && curTy == curKy) {\n\t\t\tAns = curPos.cnt;\n\t\t\treturn true;\n\t\t}\n\t\tif (Visited[curTx][curTy][curKx][curKy]) {\n\t\t\tcontinue;\n\t\t}\n\t\tVisited[curTx][curTy][curKx][curKy] = true;\n\t\tnext.cnt = curPos.cnt + 1;\n\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tnextTx = curTx + Dx[i];\n\t\t\tnextTy = curTy + Dy[i];\n\t\t\tnextKx = curKx - Dx[i];\n\t\t\tnextKy = curKy - Dy[i];\n\t\t\tif (nextTx < 0 || nextTx > W - 1 || nextTy < 0 || nextTy > H - 1 || MapData[nextTy][nextTx] == 1) {\n\t\t\t\tnext.tx = curTx;\n\t\t\t\tnext.ty = curTy;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnext.tx = nextTx;\n\t\t\t\tnext.ty = nextTy;\n\t\t\t}\n\n\t\t\tif (nextKx < 0 || nextKx > W - 1 || nextKy < 0 || nextKy > H - 1 || MapData[nextKy][nextKx] == 1) {\n\t\t\t\tnext.kx = curKx;\n\t\t\t\tnext.ky = curKy;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnext.kx = nextKx;\n\t\t\t\tnext.ky = nextKy;\n\t\t\t}\n\t\t\tpositionList.push(next);\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint main() {\n\tint x1, y1, x2, y2;\n\n\twhile (cin >> W >> H, W) {\n\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tcin >> MapData[i][j];\n\t\t\t}\n\t\t}\n\t\tif (solve(--x1, --y1, --x2, --y2)) {\n\t\t\tcout << Ans << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 10304,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0223_4610059",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n\nusing T = tuple<int, int, int, int>;\n\nconst int INF = 1001001001;\n\nint w, h;\nbool grid[55][55];\nint ti[55][55][55][55];\nint dx[4] = { 0, 0, -1, 1 }, dy[4] = { -1, 1, 0, 0 };\n\nbool f(int y, int x) {\n if (0 <= y && y < h && 0 <= x && x < w && !grid[y][x]) return true;\n return false;\n}\n\nint main() {\n while (cin >> w >> h && !(w == 0 && h == 0)) {\n int tx, ty, kx, ky;\n cin >> tx >> ty >> kx >> ky;\n tx--; ty--; kx--; ky--;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n cin >> grid[i][j];\n }\n }\n for (int i = 0; i < 55; i++) {\n for (int j = 0; j < 55; j++) {\n for (int k = 0; k < 55; k++) {\n for (int l = 0; l < 55; l++) {\n ti[i][j][k][l] = INF;\n }\n }\n }\n }\n queue<T> que;\n que.push(T(ty, tx, ky, kx));\n ti[ty][tx][ky][kx] = 0;\n int gy, gx;\n bool flag = false;\n while (!flag && que.size()) {\n T t = que.front(); que.pop();\n int cty = get<0>(t), ctx = get<1>(t);\n int cky = get<2>(t), ckx = get<3>(t);\n for (int i = 0; i < 4; i++) {\n int nty = cty + dy[i], ntx = ctx + dx[i];\n if (!f(nty, ntx)) nty = cty, ntx = ctx;\n int nky = cky - dy[i], nkx = ckx - dx[i];\n if (!f(nky, nkx)) nky = cky, nkx = ckx;\n if (ti[nty][ntx][nky][nkx] <= ti[cty][ctx][cky][ckx] + 1) continue;\n ti[nty][ntx][nky][nkx] = ti[cty][ctx][cky][ckx] + 1;\n if (nty == nky && ntx == nkx) {\n gy = nty, gx = ntx;\n flag = true;\n break;\n }\n que.push(T(nty, ntx, nky, nkx));\n }\n }\n int ans = ti[gy][gx][gy][gx];\n if (ans < 100) cout << ans << endl;\n else cout << \"NA\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 450,
"memory_kb": 38956,
"score_of_the_acc": -0.6992,
"final_rank": 6
},
{
"submission_id": "aoj_0223_4608263",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nstruct coor {\n int x, y;\n coor(const int& y_ = 0, const int& x_ = 0) : y(y_), x(x_) {}\n bool operator==(coor& a) { return x == a.x && y == a.y;}\n bool in(int& H, int&W){\n return 0 <= y && y < H && 0 <= x && x < W; \n }\n};\n\nconst int dy[4] = {1,-1, 0, 0};\nconst int dx[4] = {0, 0, 1, -1};\nint dist[51][51][51][51];\n\nvoid ClearDist(){\n #define rep(i, N) for(int i = 0; i < N; i++)\n \n const int N = 51;\n rep(a,N)rep(b,N)rep(c,N)rep(d,N) dist[a][b][c][d] = -1;\n}\n\nint solve(int W, int H){\n int tx, ty;\n int kx, ky;\n cin >> tx >> ty; tx--, ty--;\n cin >> kx >> ky; kx--, ky--;\n vector<vector<int>> grid(H, vector<int>(W));\n for(int h = 0; h < H; h++){\n for(int w = 0; w < W; w++){\n cin >> grid[h][w];\n }\n }\n \n ClearDist();\n dist[ty][tx][ky][kx] = 0;\n coor taka = coor(ty, tx);\n coor kazu = coor(ky, kx);\n int ans = (taka == kazu ? 0 : 100);\n queue<pair<coor, coor>> que;\n que.push({taka, kazu});\n \n while(!que.empty()){\n tie(taka, kazu) = que.front();\n que.pop();\n\n for(int i = 0; i < 4; i++){\n coor n_taka = coor(taka.y + dy[i], taka.x + dx[i]);\n coor n_kazu = coor(kazu.y - dy[i], kazu.x - dx[i]);\n \n if(!n_taka.in(H, W) && !n_kazu.in(H, W)) continue;\n\n if(!n_taka.in(H, W) || grid[n_taka.y][n_taka.x] == 1) n_taka = taka;\n if(!n_kazu.in(H, W) || grid[n_kazu.y][n_kazu.x] == 1) n_kazu = kazu;\n if(n_taka == taka && n_kazu == kazu) continue;\n\n int& nxt = dist[n_taka.y][n_taka.x][n_kazu.y][n_kazu.x];\n if(nxt != -1) continue;\n\n nxt = dist[taka.y][taka.x][kazu.y][kazu.x] + 1;\n if(n_taka == n_kazu) ans = min(ans, nxt);\n if(nxt < 100) que.push({n_taka, n_kazu});\n }\n \n }\n \n return ans;\n}\n\nint main(){\n int W, H;\n while(cin >> W >> H, W != 0){\n int ans = solve(W, H);\n if(ans >= 100) cout << \"NA\" << endl;\n else cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 2570,
"memory_kb": 30232,
"score_of_the_acc": -1.3329,
"final_rank": 14
}
] |
aoj_0224_cpp
|
自転車でダイエット
A さんは甘いものが大好きですが、最近は奥さんからダイエットするように言われています。ある日、A さんが自宅から市役所に出かけるとき、奥さんは自転車で行くことを勧めました。そこでA さんはしぶしぶ自転車に乗って出かけましたが、甘い物の好きな A さんは、途中にあるケーキ屋さんに立ち寄りケーキの食べ歩きをしようと思いつきました。
自転車をこげば走行距離に応じてカロリーが消費されますが、ケーキを食べればその分カロリーが摂取されます。正味の消費カロリーは、自転車をこいで消費したカロリーからケーキを食べて摂取したカロリーを引いた値になります。したがって、正味の消費カロリーが 0 より小さくなることもあります。
ケーキ屋さんでケーキを買ったら、 Aさんはその場でケーキを全部食べてしまいます。 Aさんがすべてのケーキ屋さんに立ち寄るとは限りませんが、ケーキ屋さんが存在する地点を通るときには、必ず立ち寄ってケーキを 1 つ買って食べるものとします。ただし、同じケーキ屋さんの前を何度も通るのはさすがに気がひけるので、各ケーキ屋さんに訪れられるのは 1 回だけとします。また、目的地の市役所をいったん通り過ぎてからケーキ屋さんに立ち寄り、その後で市役所に戻って用を済ませてもよいものとし、ケーキ屋さん以外は何度訪れても良いものとします。
A さんの自宅から市役所までの地図情報と、その途中にあるケーキ屋さんで食べられるケーキのカロリーの一覧、単位距離の走行による消費カロリーを入力とし、自宅を出発してから市役所に入るまでの正味の消費カロリーの最小値を出力するプログラムを作成してください。
地図には、A さんの自宅と市役所、ケーキ屋さんとランドマーク(目印)になる建物が書かれています。地図を表す入力データは、A さんの自宅、市役所、ケーキ屋さんとランドマークの各地点の間をつなぐ道があるとき、2 つの地点を表す記号とその間の距離からなる行を含みます。たとえば、5 番目のケーキ屋さんと 3 番目のランドマークの間の距離が 10 なら、入力データは以下のような行を含みます。
C5 L3 10
このようにケーキ屋さんには C、ランドマークには L を番号の前につけて表します。また、A さんの自宅は H、市役所は D で表します。入力データに 2 つの地点とその間の距離が与えられているなら、2 地点の間をどちら向きにも進めます。たとえば、上の例ではケーキ屋さんからランドマークへも、その逆向きへも進むことができます。また、自宅から市役所までは必ずたどり着けるものとします。それ以外に与えられる入力データは、ケーキ屋さんの数
m
、ランドマークの数
n
、単位距離あたりの消費カロリー
k
、 1 番目のケーキ屋さんから
m
番目のケーキ屋さんまでのそれぞれで買えるケーキのカロリーを表す
m
個のデータ、距離のデータの総数
d
です。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりは四つの 0 の行で示されます。
各データセットは以下の形式で与えられます。
m
n
k
d
c
1
c
2
...
c
m
s
1
t
1
e
1
s
2
t
2
e
2
:
s
d
t
d
e
d
1 行目にケーキ屋さんの数
m
(1 ≤
m
≤ 6)、 ランドマークの数
n
(1 ≤
n
≤ 100) 、単位距離あたりの消費カロリー
k
(1 ≤
k
≤ 5)、距離のデータの総数
d
(5 ≤
d
≤ 256) が与えられます。
2 行目に各ケーキ屋で買うケーキのカロリー
c
i
(1 ≤
c
i
≤ 100) が与えられます。
続く
d
行に
i
番目の 2 つの地点間の距離データ
s
i
,
t
i
,
e
i
(1 ≤
e
i
≤ 20) が与えられます。
データセットの数は 100 を超えません。
Output
入力データセットごとに、全体の消費カロリーの最小値を１行に出力します。
Sample Input
1 1 2 5
35
H L1 5
C1 D 6
C1 H 12
L1 D 10
C1 L1 20
2 1 4 6
100 70
H L1 5
C1 L1 12
C1 D 11
C2 L1 7
C2 D 15
L1 D 8
0 0 0 0
Output for the Sample Input
1
-2
|
[
{
"submission_id": "aoj_0224_10849606",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int INF = 1e9;\n\nstruct edge {\n int from, to, weight;\n};\n\nint main() {\n int m, n, k, d;\n while(cin >> m >> n >> k >> d, m) {\n vector<int> c(m);\n for(int i=0; i<m; ++i) {\n cin >> c[i];\n }\n auto get_id = [m, n](string const& s) {\n if(s[0] == 'H') {\n return 0;\n } else if(s[0] == 'C') {\n return s[1] - '0';\n } else if(s[0] == 'L') {\n return stoi(s.substr(1)) + m;\n } else {\n return m+n+1;\n }\n };\n vector<vector<int>> cost(1 << m, vector<int>(m+n+2, INF));\n vector<edge> es;\n for(int i=0; i<d; ++i) {\n string s, t;\n int e;\n cin >> s >> t >> e;\n int a = get_id(s), b = get_id(t);\n es.push_back((edge){a, b, e*k});\n es.push_back((edge){b, a, e*k});\n }\n\n cost[0][0] = 0;\n while(true) {\n bool update = false;\n for(int i=0; i<(1<<m); ++i) {\n for(int j=0; j<2*d; ++j) {\n edge e = es[j];\n if(cost[i][e.from] == INF) {\n continue;\n }\n if(1 <= e.to && e.to <= m) {\n if(!(i >> (e.to - 1) & 1) && cost[i | 1 << (e.to - 1)][e.to] > cost[i][e.from] + e.weight - c[e.to-1]) {\n cost[i | 1 << (e.to - 1)][e.to] = cost[i][e.from] + e.weight - c[e.to-1];\n update = true;\n } \n } else if(cost[i][e.to] > cost[i][e.from] + e.weight) {\n cost[i][e.to] = cost[i][e.from] + e.weight;\n update = true;\n }\n }\n }\n if(!update) {\n break;\n }\n }\n int res = INF;\n for(int i=0; i<(1<<m); ++i) {\n res = min(res, cost[i][m+n+1]);\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3448,
"score_of_the_acc": -1.0908,
"final_rank": 18
},
{
"submission_id": "aoj_0224_6977532",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int m, n, k, d, e, v, u, w, S;\n while(cin >> m >> n >> k >> d, m){\n vector<int> c(m);\n for(auto &&v:c)cin >> v;\n auto f = [&](string s){\n if(s[0] == 'C')return stoi(s.substr(1, s.size() - 1)) - 1;\n if(s[0] == 'L')return stoi(s.substr(1, s.size() - 1)) - 1 + m;\n if(s == \"H\")return m + n;\n return m + n + 1;\n };\n vector<vector<pair<int,int>>> g(n + m + 2);\n string s, t;\n while(d--){\n cin >> s >> t >> e;\n g[f(s)].emplace_back(f(t), k * e);\n g[f(t)].emplace_back(f(s), k * e);\n }\n priority_queue<tuple<int,int>, vector<tuple<int,int,int>>, greater<tuple<int,int,int>>> pq;\n vector<vector<int>> dp(n + m + 2, vector<int>(1 << m, 1 << 30));\n pq.emplace(0, n + m, 0);\n dp[n + m][0] = 0;\n while(!pq.empty()){\n tie(d, v, S) = pq.top();\n pq.pop();\n if(d > dp[v][S])continue;\n for(auto &&pa:g[v]){\n tie(u, w) = pa;\n int T = S;\n if(u < m){\n if(S >> u & 1)continue;\n T |= 1 << u;\n }\n if(dp[v][S] + w >= dp[u][T])continue;\n dp[u][T] = dp[v][S] + w;\n pq.emplace(dp[u][T], u, T);\n }\n }\n int ans = 1 << 30;\n for(int i = 0; i < (1 << m); i++){\n int sumv = 0;\n for(int j = 0; j < m; j++){\n if(i >> j & 1)sumv -= c[j];\n }\n sumv += dp.back()[i];\n ans = min(ans, sumv);\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3336,
"score_of_the_acc": -0.8686,
"final_rank": 11
},
{
"submission_id": "aoj_0224_5101853",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 205\n#define MAX 7\n\nstruct Edge{\n\tvoid set(int arg_from,int arg_to,int arg_dist){\n\t\tfrom = arg_from;\n\t\tto = arg_to;\n\t\tdist = arg_dist;\n\t}\n\tint from,to,dist;\n};\n\nint POW[MAX];\nint value[6];\nint num_cake,num_land,k,E;\nint index_cake[6],index_land[105],rev_cake[SIZE];\nint min_dist[SIZE][64];\nbool is_cake[SIZE];\nEdge edge[1000];\n\n\nvoid func(){\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tis_cake[i] = false;\n\t}\n\n\tint start = 0,goal = 1;\n\tint index = 2;\n\tfor(int i = 0; i < num_cake; i++){\n\n\t\tis_cake[index] = true;\n\t\trev_cake[index] = i;\n\t\tindex_cake[i] = index++;\n\t}\n\tfor(int i = 0; i < num_land; i++){\n\n\t\tindex_land[i] = index++;\n\t}\n\n\tfor(int i = 0; i < num_cake; i++){\n\n\t\tscanf(\"%d\",&value[i]);\n\t}\n\n\tchar A[10],B[10];\n\tint from,to;\n\tint dist,tmp;\n\n\tint num_edge = 0;\n\n\tfor(int loop = 0; loop < E; loop++){\n\n\t\tscanf(\"%s %s %d\",A,B,&dist);\n\n\t\tswitch(A[0]){\n\t\tcase 'C':\n\t\t\ttmp = 0;\n\t\t\tfor(int i = 1; A[i] != '\\0'; i++){\n\n\t\t\t\ttmp = 10*tmp+(A[i]-'0');\n\t\t\t}\n\t\t\ttmp--;\n\t\t\tfrom = index_cake[tmp];\n\n\t\t\tbreak;\n\t\tcase 'L':\n\t\t\ttmp = 0;\n\t\t\tfor(int i = 1; A[i] != '\\0'; i++){\n\n\t\t\t\ttmp = 10*tmp+(A[i]-'0');\n\t\t\t}\n\t\t\ttmp--;\n\t\t\tfrom = index_land[tmp];\n\n\t\t\tbreak;\n\t\tcase 'H':\n\t\t\tfrom = start;\n\t\t\tbreak;\n\t\tcase 'D':\n\t\t\tfrom = goal;\n\t\t\tbreak;\n\t\t}\n\n\n\t\tswitch(B[0]){\n\t\tcase 'C':\n\t\t\ttmp = 0;\n\t\t\tfor(int i = 1; B[i] != '\\0'; i++){\n\n\t\t\t\ttmp = 10*tmp+(B[i]-'0');\n\t\t\t}\n\t\t\ttmp--;\n\t\t\tto = index_cake[tmp];\n\n\t\t\tbreak;\n\t\tcase 'L':\n\t\t\ttmp = 0;\n\t\t\tfor(int i = 1; B[i] != '\\0'; i++){\n\n\t\t\t\ttmp = 10*tmp+(B[i]-'0');\n\t\t\t}\n\t\t\ttmp--;\n\t\t\tto = index_land[tmp];\n\n\t\t\tbreak;\n\t\tcase 'H':\n\t\t\tto = start;\n\t\t\tbreak;\n\t\tcase 'D':\n\t\t\tto = goal;\n\t\t\tbreak;\n\t\t}\n\n\t\tint work_cost = k*dist;\n\t\tif(is_cake[from]){\n\n\t\t\tint tmp_index = rev_cake[from];\n\t\t\twork_cost -= value[tmp_index];\n\n\t\t}\n\n\t\tedge[num_edge++].set(from,to,work_cost);\n\n\t\twork_cost = k*dist;\n\t\tif(is_cake[to]){\n\n\t\t\tint tmp_index = rev_cake[to];\n\t\t\twork_cost -= value[tmp_index];\n\t\t}\n\n\t\tedge[num_edge++].set(to,from,work_cost);\n\t}\n\n\tfor(int i = 0; i < index; i++){\n\t\tfor(int k = 0; k < POW[num_cake]; k++){\n\n\t\t\tmin_dist[i][k] = BIG_NUM;\n\t\t}\n\t}\n\n\tmin_dist[start][0] = 0;\n\n\tbool updated;\n\n\t//負辺を持つのでベルマンフォード\n\n\tfor(int i = 0; i < index; i++){\n\t\tupdated = false;\n\t\tfor(int k = 0; k < num_edge; k++){\n\t\t\tEdge e = edge[k];\n\t\t\tfor(int state = 0; state < POW[num_cake]; state++){\n\t\t\t\tif(min_dist[e.from][state] == BIG_NUM)continue;\n\n\t\t\t\tint next_node = e.to;\n\t\t\t\tint next_state = state;\n\t\t\t\tif(is_cake[e.to]){\n\t\t\t\t\tint tmp_index = rev_cake[e.to];\n\t\t\t\t\tif(state & POW[tmp_index])continue;\n\n\t\t\t\t\tnext_state = state+POW[tmp_index];\n\t\t\t\t}\n\t\t\t\tint next_dist = min_dist[e.from][state]+e.dist;\n\n\t\t\t\tif(min_dist[next_node][next_state] > next_dist){\n\t\t\t\t\tmin_dist[next_node][next_state] = next_dist;\n\t\t\t\t\tupdated = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!updated)break;\n\t}\n\n\tint ans = BIG_NUM;\n\tfor(int state = 0; state < POW[num_cake]; state++){\n\n\t\tans = min(ans,min_dist[goal][state]);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\twhile(true){\n\n\t\tscanf(\"%d %d %d %d\",&num_cake,&num_land,&k,&E);\n\t\tif(num_cake == 0)break;\n\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3260,
"score_of_the_acc": -0.7856,
"final_rank": 8
},
{
"submission_id": "aoj_0224_5101844",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 205\n#define MAX 7\n\nstruct Edge{\n\tvoid set(int arg_from,int arg_to,int arg_dist){\n\t\tfrom = arg_from;\n\t\tto = arg_to;\n\t\tdist = arg_dist;\n\t}\n\tint from,to,dist;\n};\n\nint POW[MAX];\nint value[6];\nint num_cake,num_land,k,E;\nint index_cake[6],index_land[105],rev_cake[SIZE];\nint min_dist[SIZE][64];\nbool is_cake[SIZE];\nEdge edge[1000];\n\n\nvoid func(){\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tis_cake[i] = false;\n\t}\n\n\tint start = 0,goal = 1;\n\tint index = 2;\n\tfor(int i = 0; i < num_cake; i++){\n\n\t\tis_cake[index] = true;\n\t\trev_cake[index] = i;\n\t\tindex_cake[i] = index++;\n\t}\n\tfor(int i = 0; i < num_land; i++){\n\n\t\tindex_land[i] = index++;\n\t}\n\n\tfor(int i = 0; i < num_cake; i++){\n\n\t\tscanf(\"%d\",&value[i]);\n\t}\n\n\tchar A[10],B[10];\n\tint from,to;\n\tint dist,tmp;\n\n\tint num_edge = 0;\n\n\tfor(int loop = 0; loop < E; loop++){\n\n\t\tscanf(\"%s %s %d\",A,B,&dist);\n\n\t\tswitch(A[0]){\n\t\tcase 'C':\n\t\t\ttmp = 0;\n\t\t\tfor(int i = 1; A[i] != '\\0'; i++){\n\n\t\t\t\ttmp = 10*tmp+(A[i]-'0');\n\t\t\t}\n\t\t\ttmp--;\n\t\t\tfrom = index_cake[tmp];\n\n\t\t\tbreak;\n\t\tcase 'L':\n\t\t\ttmp = 0;\n\t\t\tfor(int i = 1; A[i] != '\\0'; i++){\n\n\t\t\t\ttmp = 10*tmp+(A[i]-'0');\n\t\t\t}\n\t\t\ttmp--;\n\t\t\tfrom = index_land[tmp];\n\n\t\t\tbreak;\n\t\tcase 'H':\n\t\t\tfrom = start;\n\t\t\tbreak;\n\t\tcase 'D':\n\t\t\tfrom = goal;\n\t\t\tbreak;\n\t\t}\n\n\n\t\tswitch(B[0]){\n\t\tcase 'C':\n\t\t\ttmp = 0;\n\t\t\tfor(int i = 1; B[i] != '\\0'; i++){\n\n\t\t\t\ttmp = 10*tmp+(B[i]-'0');\n\t\t\t}\n\t\t\ttmp--;\n\t\t\tto = index_cake[tmp];\n\n\t\t\tbreak;\n\t\tcase 'L':\n\t\t\ttmp = 0;\n\t\t\tfor(int i = 1; B[i] != '\\0'; i++){\n\n\t\t\t\ttmp = 10*tmp+(B[i]-'0');\n\t\t\t}\n\t\t\ttmp--;\n\t\t\tto = index_land[tmp];\n\n\t\t\tbreak;\n\t\tcase 'H':\n\t\t\tto = start;\n\t\t\tbreak;\n\t\tcase 'D':\n\t\t\tto = goal;\n\t\t\tbreak;\n\t\t}\n\n\t\tint work_cost = k*dist;\n\t\tif(is_cake[from]){\n\n\t\t\tint tmp_index = rev_cake[from];\n\t\t\twork_cost -= value[tmp_index];\n\n\t\t}\n\n\t\tedge[num_edge++].set(from,to,work_cost);\n\n\t\twork_cost = k*dist;\n\t\tif(is_cake[to]){\n\n\t\t\tint tmp_index = rev_cake[to];\n\t\t\twork_cost -= value[tmp_index];\n\t\t}\n\n\t\tedge[num_edge++].set(to,from,work_cost);\n\t}\n\n\tfor(int i = 0; i < index; i++){\n\t\tfor(int k = 0; k < POW[num_cake]; k++){\n\n\t\t\tmin_dist[i][k] = BIG_NUM;\n\t\t}\n\t}\n\n\tmin_dist[start][0] = 0;\n\n\tbool updated;\n\n\tfor(int i = 0; i < index; i++){\n\t\tupdated = false;\n\t\tfor(int k = 0; k < num_edge; k++){\n\t\t\tEdge e = edge[k];\n\t\t\tfor(int state = 0; state < POW[num_cake]; state++){\n\t\t\t\tif(min_dist[e.from][state] == BIG_NUM)continue;\n\n\t\t\t\tint next_node = e.to;\n\t\t\t\tint next_state = state;\n\t\t\t\tif(is_cake[e.to]){\n\t\t\t\t\tint tmp_index = rev_cake[e.to];\n\t\t\t\t\tif(state & POW[tmp_index])continue;\n\n\t\t\t\t\tnext_state = state+POW[tmp_index];\n\t\t\t\t}\n\t\t\t\tint next_dist = min_dist[e.from][state]+e.dist;\n\n\t\t\t\tif(min_dist[next_node][next_state] > next_dist){\n\t\t\t\t\tmin_dist[next_node][next_state] = next_dist;\n\t\t\t\t\tupdated = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!updated)break;\n\t}\n\n\tint ans = BIG_NUM;\n\tfor(int state = 0; state < POW[num_cake]; state++){\n\n\t\tans = min(ans,min_dist[goal][state]);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\twhile(true){\n\n\t\tscanf(\"%d %d %d %d\",&num_cake,&num_land,&k,&E);\n\t\tif(num_cake == 0)break;\n\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3160,
"score_of_the_acc": -0.6764,
"final_rank": 5
},
{
"submission_id": "aoj_0224_4982371",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint m, n;\nint parse(string s) {\n if (s == \"H\")return m + n;\n if (s == \"D\")return m + n + 1;\n return stoi(s.substr(1)) + (s[0] == 'C' ? 0 : m) - 1;\n}\n\nint main() {\n init();\n\n for (int k, d; cin >> m >> n >> k >> d, m;) {\n int v = m + n + 2;\n VI c(m); cin >> c;\n VI a(d * 2), b(d * 2), e(d * 2);\n FOR(i, 0, d) {\n string s, t; cin >> s >> t >> e[i];\n a[i] = parse(s), b[i] = parse(t);\n e[i] *= k;\n a[d + i] = b[i], b[d + i] = a[i], e[d + i] = e[i];\n }\n\n int start = v - 2, goal = v - 1;\n auto dp = defvec<int>(INF, 1 << m, v);\n dp[0][start] = 0;\n bool f = true;;\n for (int _ = 0; _ < (1 << m) * v && f; ++_) {\n f = false;\n FOR(bit, 0, 1 << m)FOR(i, 0, d * 2) {\n if (dp[bit][a[i]] == INF)continue;\n if (b[i] < m) {\n if (!(bit & (1 << b[i])))f |= chmin(dp[bit | (1 << b[i])][b[i]], dp[bit][a[i]] + e[i] - c[b[i]]);\n }\n else f |= chmin(dp[bit][b[i]], dp[bit][a[i]] + e[i]);\n }\n }\n\n int ans = INF;\n FOR(i, 0, 1 << m)chmin(ans, dp[i][goal]);\n print(ans);\n }\n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3436,
"score_of_the_acc": -0.9777,
"final_rank": 15
},
{
"submission_id": "aoj_0224_4982369",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint m, n;\nint parse(string s) {\n if (s == \"H\")return m + n;\n if (s == \"D\")return m + n + 1;\n return stoi(s.substr(1)) + (s[0] == 'C' ? 0 : m) - 1;\n}\n\nint main() {\n init();\n\n for (int k, d; cin >> m >> n >> k >> d, m;) {\n int v = m + n + 2;\n VI c(m); cin >> c;\n VI a(d * 2), b(d * 2), e(d * 2);\n FOR(i, 0, d) {\n string s, t; cin >> s >> t >> e[i];\n a[i] = parse(s), b[i] = parse(t);\n e[i] *= k;\n a[d + i] = b[i], b[d + i] = a[i], e[d + i] = e[i];\n }\n\n int start = v - 2, goal = v - 1;\n auto dp = defvec<int>(INF, 1 << m, v);\n dp[0][start] = 0;\n for (bool f = true; f;) {\n f = false;\n FOR(bit, 0, 1 << m)FOR(i, 0, d * 2) {\n if (dp[bit][a[i]] == INF)continue;\n if (b[i] < m) {\n if (!(bit & (1 << b[i])))f |= chmin(dp[bit | (1 << b[i])][b[i]], dp[bit][a[i]] + e[i] - c[b[i]]);\n }\n else f |= chmin(dp[bit][b[i]], dp[bit][a[i]] + e[i]);\n }\n }\n\n int ans = INF;\n FOR(i, 0, 1 << m)chmin(ans, dp[i][goal]);\n print(ans);\n }\n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3440,
"score_of_the_acc": -0.9821,
"final_rank": 16
},
{
"submission_id": "aoj_0224_4982360",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint m, n;\nint parse(string s) {\n if (s == \"H\")return m + n;\n if (s == \"D\")return m + n + 1;\n return stoi(s.substr(1)) + (s[0] == 'C' ? 0 : m) - 1;\n}\n\nint main() {\n init();\n\n for (int k, d; cin >> m >> n >> k >> d, m;) {\n int v = m + n + 2;\n VI c(m); cin >> c;\n vector<vector<pair<int, int>>> g(v);\n FOR(i, 0, d) {\n string s, t; int e; cin >> s >> t >> e;\n int a = parse(s), b = parse(t);\n e *= k;\n g[a].emplace_back(b, e);\n g[b].emplace_back(a, e);\n }\n\n int start = v - 2, goal = v - 1;\n auto dp = defvec<int>(INF, 1 << m, v);\n dp[0][start] = 0;\n for (bool f = true; f;) {\n f = false;\n FOR(bit, 0, 1 << m)FOR(cur, 0, v) {\n if (dp[bit][cur] == INF)continue;\n for (auto [to, cost] : g[cur]) {\n if (to < m) {\n if (!(bit & (1 << to)))f |= chmin(dp[bit | (1 << to)][to], dp[bit][cur] + cost - c[to]);\n }\n else f |= chmin(dp[bit][to], dp[bit][cur] + cost);\n }\n }\n }\n\n int ans = INF;\n FOR(i, 0, 1 << m)chmin(ans, dp[i][goal]);\n print(ans);\n }\n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3288,
"score_of_the_acc": -0.7162,
"final_rank": 7
},
{
"submission_id": "aoj_0224_4982355",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint m, n;\nint parse(string s) {\n if (s == \"H\")return m + n;\n if (s == \"D\")return m + n + 1;\n return stoi(s.substr(1)) + (s[0] == 'C' ? 0 : m) - 1;\n}\n\nint main() {\n init();\n\n for (int k, d; cin >> m >> n >> k >> d, m;) {\n int v = m + n + 2;\n VI c(m); cin >> c;\n vector<vector<pair<int, int>>> g(v);\n FOR(i, 0, d) {\n string s, t; int e; cin >> s >> t >> e;\n int a = parse(s), b = parse(t);\n e *= k;\n g[a].emplace_back(b, e);\n g[b].emplace_back(a, e);\n }\n\n int start = v - 2, goal = v - 1;\n auto dp = defvec<int>(INF, 1 << m, v);\n dp[0][start] = 0;\n FOR(_, 0, v)FOR(bit, 0, 1 << m)FOR(cur, 0, v) {\n if (dp[bit][cur] == INF)continue;\n for (auto [to, cost] : g[cur]) {\n if (to < m) {\n if (!(bit & (1 << to)))chmin(dp[bit | (1 << to)][to], dp[bit][cur] + cost - c[to]);\n }\n else chmin(dp[bit][to], dp[bit][cur] + cost);\n }\n }\n\n int ans = INF;\n FOR(i, 0, 1 << m)chmin(ans, dp[i][goal]);\n print(ans);\n }\n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3548,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0224_4981653",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).endf()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).endf())\n#define SORT(c) sort((c).begin(), (c).endf())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-4, PI = acos(-1);\n//ここから編集 \ntypedef string::const_iterator State;\nint dist[210][(1<<6)];\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n int m, n, k, d;\n while(cin >> m >> n >> k >> d, m&&n&&k&&d){\n vector<int> c(m);\n REP(i,m) cin >> c[i];\n map<string, int> mp;\n mp[\"H\"] = 0;\n mp[\"D\"] = 1;\n int cnt = 2;\n for(int i=1; i<=n; i++){\n string s = \"L\";\n s += to_string(i);\n mp[s] = cnt++;\n }\n for(int i=1; i<=m; i++){\n string s = \"C\";\n s += to_string(i);\n mp[s] = cnt++;\n }\n\n vector<vector<pair<int, int>>> g(mp.size());\n REP(i,d){\n string s, t;\n cin >> s >> t;\n int c; cin >> c;\n g[mp[s]].push_back({mp[t], c});\n g[mp[t]].push_back({mp[s], c});\n }\n\n REP(i,210) REP(j,1<<6) dist[i][j] = INT_MAX;\n dist[0][0] = 0;\n\n priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> pq;\n pq.push(make_pair(0, make_pair(0, 0)));\n\n while(pq.size()){\n auto p = pq.top();\n pq.pop();\n\n if(dist[p.second.first][p.second.second] < p.first) continue;\n int v = p.second.first;\n int mask = p.second.second;\n \n for(auto e: g[v]){\n int u = e.first;\n if(u>=n+2){\n int tmp = u-(n+2);\n if(mask >> tmp&1) continue;\n\n if(dist[u][mask | (1<<tmp)] > dist[v][mask] + k*e.second - c[tmp]){\n dist[u][mask | (1<<tmp)] = dist[v][mask] + k*e.second - c[tmp];\n pq.push(make_pair(dist[u][mask | (1<<tmp)], make_pair(u, mask|(1<<tmp))));\n }\n }else{\n if(dist[u][mask] > dist[v][mask] + k*e.second){\n dist[u][mask] = dist[v][mask] + k*e.second;\n pq.push(make_pair(dist[u][mask], make_pair(u, mask)));\n }\n }\n }\n }\n int ans = INT_MAX;\n for(int i=0; i<(1<<m); i++){\n ans = min(ans, dist[1][i]);\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3336,
"score_of_the_acc": -0.9686,
"final_rank": 13
},
{
"submission_id": "aoj_0224_4844421",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <queue>\nusing namespace std;\nconst int inf = 1e9;\n\nint stoidx(string &s, int n, int m){\n if(s[0] == 'C') return stoi(s.substr(1, (int)s.length()-1)) -1;\n if(s[0] == 'L') return stoi(s.substr(1, (int)s.length()-1)) -1 +m;\n if(s == \"H\") return m+n;\n return m+n+1;\n}\n\nint main(){\n while(1){\n int m,n,k,d;\n cin >> m >> n >> k >> d;\n if(n == 0) break;\n\n vector<int> cal(m);\n for(int i=0; i<m; i++){\n cin >> cal[i];\n }\n vector<vector<pair<int,int>>> g(n+m+2);\n for(int i=0; i<d; i++){\n string s,t;\n int e;\n cin >> s >> t >> e;\n int si=stoidx(s, n, m);\n int ti=stoidx(t, n, m);\n e *= k;\n g[si].emplace_back(ti, e);\n g[ti].emplace_back(si, e);\n }\n\n priority_queue<pair<int, pair<int,int>>> wait;\n wait.push({0, {n+m, 0}});\n vector<vector<int>> dp(n+m+2, vector<int>(1<<m, inf));\n dp[n+m][0] = 0;\n while(!wait.empty()){\n int c = -wait.top().first;\n int p = wait.top().second.first;\n int s = wait.top().second.second;\n wait.pop();\n if(c > dp[p][s]) continue;\n for(auto next: g[p]){\n int np = next.first;\n int nc = c +next.second;\n int ns = s;\n if(np < m){\n nc -= cal[np];\n ns |= 1<<np;\n if(ns == s) continue;\n }\n if(nc < dp[np][ns]){\n dp[np][ns] = nc;\n wait.push({-nc, {np, ns}});\n }\n }\n }\n cout << *min_element(dp[n+m+1].begin(), dp[n+m+1].end()) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3344,
"score_of_the_acc": -0.9773,
"final_rank": 14
},
{
"submission_id": "aoj_0224_4604312",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n\nusing T = tuple<int, int, int>;\nconst int INF = 1001001001;\n\nstruct edge { int to, cost; };\n\nint m, n, k, d;\nint c[11];\nvector<edge> g[111];\nint dp[111][1 << 6];\n\nint f(string s) {\n if (s == \"H\") return 0;\n if (s == \"D\") return n + m + 1;\n if (s[0] == 'C') return (s[1] - '0') + n;\n if (s[0] == 'L') {\n string x = s.substr(1, s.size() - 1);\n return stoi(x);\n }\n}\n\nvoid dijkstra(int s) {\n priority_queue<T, vector<T>, greater<T>> que;\n for (int i = 0; i < 111; i++) {\n for (int bit = 0; bit < (1 << 6); bit++) {\n dp[i][bit] = INF;\n }\n }\n dp[s][(1 << m) - 1] = 0;\n que.push(T(0, s, (1 << m) - 1));\n while (que.size()) {\n T t = que.top(); que.pop();\n int v = get<1>(t);\n int bit = get<2>(t);\n for (auto e : g[v]) {\n int u = -1;\n bool flag = true;\n for (int i = n + 1; i <= n + m; i++) {\n if (e.to == i) {\n if (bit >> (i - n - 1) & 1) u = i - n - 1;\n else {\n flag = false;\n break;\n }\n }\n }\n if (!flag) continue;\n if (u == -1) {\n if (dp[e.to][bit] > dp[v][bit] + e.cost) {\n dp[e.to][bit] = dp[v][bit] + e.cost;\n que.push(T(dp[e.to][bit], e.to, bit));\n }\n } else {\n if (dp[e.to][bit ^ (1 << u)] > dp[v][bit] + e.cost - c[u]) {\n dp[e.to][bit ^ (1 << u)] = dp[v][bit] + e.cost - c[u];\n que.push(T(dp[e.to][bit ^ (1 << u)], e.to, bit ^ (1 << u)));\n }\n }\n\n }\n }\n}\n\nint main() {\n while (cin >> m >> n >> k >> d && (m != 0 || n != 0 || k != 0 || d != 0)) {\n vector<edge> vec[111];\n swap(g, vec);\n for (int i = 0; i < m; i++) cin >> c[i];\n for (int i = 0; i < d; i++) {\n string s, t;\n int e;\n cin >> s >> t >> e;\n g[f(s)].push_back(edge{ f(t), e * k });\n g[f(t)].push_back(edge{ f(s), e * k });\n }\n dijkstra(f(\"H\"));\n int ans = INF;\n for (int bit = 0; bit < (1 << m); bit++) {\n ans = min(ans, dp[f(\"D\")][bit]);\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3372,
"score_of_the_acc": -1.1079,
"final_rank": 19
},
{
"submission_id": "aoj_0224_4384189",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\n\nbool solve(){\n int m, n, k, d;\n cin >> m >> n >> k >> d;\n if(!m) return 0;\n map<string, int> a;\n a[\"H\"] = 0;\n for (int i = 0; i < m; ++i) a[string(\"C\")+to_string(i+1)] = i+1;\n for (int i = 0; i < n; ++i) a[string(\"L\")+to_string(i+1)] = i+m+1;\n a[\"D\"] = n+m+1;\n vector<int> C(m);\n for (auto &&j : C) scanf(\"%d\", &j);\n vector<vector<pair<int, int>>> G(n+m+2);\n for (int i = 0; i < d; ++i) {\n string S, T; int x;\n cin >> S >> T >> x;\n int s = a[S], t = a[T];\n G[s].emplace_back(t, x*k);\n G[t].emplace_back(s, x*k);\n }\n vector<int> dp((n+m+2) << m, INF<int>);\n priority_queue<pair<int, int>,vector<pair<int, int>>,greater<>> Q;\n dp[0] = 0;\n Q.emplace(0, 0);\n int mask = (1 << m)-1;\n while(!Q.empty()){\n int cost; int i;\n tie(cost, i) = Q.top(); Q.pop();\n int down = i & mask, up = i >> m;\n if(dp[i] < cost) continue;\n for (auto &&e : G[up]) {\n auto cost2 = cost + e.second;\n if(1 <= e.first && e.first <= m){\n if((1 << (e.first-1)) & i) continue;;\n int to = down | (1 << (e.first-1)) | (e.first << m);\n if(dp[to] <= cost2) continue;\n dp[to] = cost2;\n Q.emplace(dp[to], to);\n }else {\n int to = down | (e.first << m);\n if(dp[to] <= cost2) continue;\n dp[to] = cost2;\n Q.emplace(dp[to], to);\n }\n }\n }\n int ans = INF<int>;\n for (int i = 0; i < (1 << m); ++i) {\n int val = dp[(n+m+1) << m | i];\n for (int j = 0; j < m; ++j) {\n if(i & (1 << j)){\n val -= C[j];\n }\n }\n ans = min(ans, val);\n }\n cout << ans << \"\\n\";\n return 1;\n}\n\nint main() {\n while(solve());\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3360,
"score_of_the_acc": -0.9948,
"final_rank": 17
},
{
"submission_id": "aoj_0224_4173352",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<int,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1<<30;\nconstexpr ll MOD = ll(1e9)+7;\nconstexpr int di[] = {0,1,0,-1};\nconstexpr int dj[] = {1,0,-1,0};\n\nbool solve(){\n int N, M, K, E, V;\n cin >> M >> N >> K >> E;\n if(M == 0) return false;\n V = N+M+2;\n vector<vector<P> > g(V);\n vector<int> C(M);\n for(int i=0;i<M;i++){\n cin >> C[i];\n }\n for(int i=0;i<E;i++){\n string s[2];\n int si[2], d;\n cin >> s[0] >> s[1] >> d;\n for(int j=0;j<2;j++){\n if(s[j]==\"H\") si[j] = 0;\n if(s[j]==\"D\") si[j] = N+1;\n if(s[j][0]=='L') si[j] = stoi(s[j].substr(1,int(s[j].size())-1));\n if(s[j][0]=='C') si[j] = stoi(s[j].substr(1,int(s[j].size())-1))+N+1;\n }\n g[si[0]].push_back(P(si[1], d));\n g[si[1]].push_back(P(si[0], d));\n }\n vector<vector<int> > dist(1<<M, vector<int>(V, INF));\n dist[0][0] = 0;\n for(int S=0;S<1<<M;S++){\n priority_queue<P,vector<P>,greater<P> > que;\n for(int i=0;i<V;i++){\n que.push(P(dist[S][i],i));\n }\n while(!que.empty()){\n P p = que.top();\n que.pop();\n int v = p.second;\n if(dist[S][v] < p.first) continue;\n for(auto e : g[v]){\n int u = e.first, d = e.second;\n if(u < N+2){\n if(dist[S][u] > dist[S][v] + d*K){\n dist[S][u] = dist[S][v] + d*K;\n que.push(P(dist[S][u], u));\n }\n }else{\n int idx = u-(N+2);\n if((S>>idx)&1) continue;\n int T = S|(1<<idx);\n if(dist[T][u] > dist[S][v] + d*K - C[idx]){\n dist[T][u] = dist[S][v] + d*K - C[idx];\n }\n }\n }\n }\n }\n int ans = INF;\n for(int S=0;S<1<<M;S++){\n ans = min(ans, dist[S][N+1]);\n }\n cout << ans << endl;\n return true;\n}\n\nint main(){\n while(solve());\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3220,
"score_of_the_acc": -0.8419,
"final_rank": 10
},
{
"submission_id": "aoj_0224_4069629",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <list>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <cassert>\n#include <random>\nint factorial(int n) {\n\treturn n == 0 ? 1 : n * factorial(n - 1);\n}\nint main() {\n\twhile (true) {\n\t\tint m, n, k, d; std::cin >> m >> n >> k >> d; if (m == 0 && n == 0) break;\n\t\tstd::vector<int> calories(m); for (auto& c : calories) std::cin >> c;\n\t\tstd::vector<std::vector<int>> distances(m + n + 2, std::vector<int>(m + n + 2, INT_MAX));\n\t\tfor (auto i = 0; i < d; ++i) {\n\t\t\tstd::string s, t; int e; std::cin >> s >> t >> e;\n\t\t\tint from = -1, to = -1;\n\t\t\tswitch (s.front()) {\n\t\t\tcase 'H': from = n + m; break;\n\t\t\tcase 'D': from = n + m + 1; break;\n\t\t\tcase 'C': from = std::stoi(s.substr(1)) - 1; break;\n\t\t\tcase 'L': from = std::stoi(s.substr(1)) + m - 1; break;\n\t\t\tdefault: break;\n\t\t\t}\n\t\t\tswitch (t.front()) {\n\t\t\tcase 'H': to = n + m; break;\n\t\t\tcase 'D': to = n + m + 1; break;\n\t\t\tcase 'C': to = std::stoi(t.substr(1)) - 1; break;\n\t\t\tcase 'L': to = std::stoi(t.substr(1)) + m - 1; break;\n\t\t\tdefault: break;\n\t\t\t}\n\t\t\tdistances[from][to] = distances[to][from] = std::min(distances[from][to], e * k);\n\t\t}\n\t\tfor (auto i = 0; i < distances.size(); ++i) distances[i][i] = 0;\n\t\tfor (auto k = m; k < distances.size(); ++k) {\n\t\t\tfor (auto i = 0; i < distances.size(); ++i) if (distances[i][k] != INT_MAX) {\n\t\t\t\tfor (auto j = 0; j < distances.size(); ++j) if (distances[k][j] != INT_MAX) {\n\t\t\t\t\tdistances[i][j] = std::min(distances[i][j], distances[i][k] + distances[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint min_calory = distances[n + m][n + m + 1];\n\t\tstd::vector<int> cake_shops(m); std::iota(cake_shops.begin(), cake_shops.end(), 0);\n\t\tfor (auto _i = factorial(m); _i > 0; --_i) {\n\t\t\tint prev = n + m;\n\t\t\tint distance = 0;\n\t\t\tfor (auto i = 0; i < m; ++i) if (distances[prev][cake_shops[i]] != INT_MAX) {\n\t\t\t\tdistance += distances[prev][cake_shops[i]] - calories[cake_shops[i]];\n\t\t\t\tprev = cake_shops[i];\n\t\t\t\tif (distances[prev][n + m + 1] != INT_MAX) min_calory = std::min(min_calory, distance + distances[prev][n + m + 1]);\n\t\t\t}\n\t\t\tstd::next_permutation(cake_shops.begin(), cake_shops.end());\n\t\t}\n\t\tstd::cout << min_calory << std::endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3112,
"score_of_the_acc": -0.624,
"final_rank": 2
},
{
"submission_id": "aoj_0224_3864011",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\nusing namespace std;\n\nconst int INF = 1<<28;\nconst int START = 108;\nconst int GOAL = 109;\n\nint enc(string s){\n if(s == \"H\") return START;\n else if(s == \"D\") return GOAL;\n char c = s[0];\n int x = stoi(s.substr(1));\n return (c == 'C' ? 0 : 6) + x-1;\n}\n\nint main(){\n int m, n, k, d;\n while(cin >> m >> n >> k >> d, m+n+k+d){\n vector<pair<int,int>> vp[110];\n vector<int> cake(m);\n for(int i = 0; i < m; i++) cin >> cake[i];\n while(d-- > 0){\n string a, b;\n int c;\n cin >> a >> b >> c;\n int from = enc(a), to = enc(b);\n c *= k;\n vp[from].push_back({to, c});\n vp[to].push_back({from, c});\n }\n vector<vector<int>> dp(110, vector<int>(1<<m, INF));\n dp[START][0] = 0;\n\n for(int loop = 0; loop < 110*64; loop++){\n bool update = false;\n for(int pos = 0; pos < 110; pos++){\n for(pair<int,int> p : vp[pos]){\n for(int bit = 0; bit < 1<<m; bit++){\n if(dp[pos][bit] == INF) continue;\n int next = p.first, ncost = dp[pos][bit]+p.second;\n if(next < m){\n if((bit>>next&1)==0 && ncost-cake[next] < dp[next][bit^(1<<next)]){\n dp[next][bit^(1<<next)] = ncost-cake[next];\n update = true;\n }\n continue;\n }\n if(ncost < dp[next][bit]){\n dp[next][bit] = ncost;\n update = true;\n }\n }\n }\n }\n if(!update) break;\n }\n\n int ans = 1<<30;\n for(int i = 0; i < 1<<m; i++){\n ans = min(ans, dp[GOAL][i]);\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3128,
"score_of_the_acc": -0.6415,
"final_rank": 3
},
{
"submission_id": "aoj_0224_3045882",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstring>\n#include<queue>\nusing namespace std;\nint m,n,k,d;\nint f(string s)\n{\n\tif(s==\"H\")return 0;\n\telse if(s==\"D\")return m+n+1;\n\telse if(s[0]=='C')return s[1]-'0';\n\telse return stoi(s.substr(1))+m;\n}\nmain()\n{\n\twhile(cin>>m>>n>>k>>d,d)\n\t{\n\t\tint c[6];for(int i=0;i<m;i++)cin>>c[i];\n\t\tvector<vector<pair<int,int> > >G(m+n+2);\n\t\tfor(int i=0;i<d;i++)\n\t\t{\n\t\t\tstring ss,tt;int e;cin>>ss>>tt>>e;\n\t\t\tint s=f(ss),t=f(tt);\n\t\t\tG[s].push_back(make_pair(t,e*k));\n\t\t\tG[t].push_back(make_pair(s,e*k));\n\t\t}\n\t\tvector<vector<int> >d(m+n+2,vector<int>(1<<m,1e9));\n\t\tpriority_queue<pair<int,pair<int,int> > >P;\n\t\td[0][0]=0;\n\t\tP.push(make_pair(0,make_pair(0,0)));\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tint D=-P.top().first,u=P.top().second.first,L=P.top().second.second;\n\t\t\tP.pop();\n\t\t\tif(d[u][L]<D)continue;\n\t\t\tfor(int i=0;i<G[u].size();i++)\n\t\t\t{\n\t\t\t\tint v=G[u][i].first,cost=G[u][i].second;\n\t\t\t\tint next=L;\n\t\t\t\tif(v>=1&&v<=m)\n\t\t\t\t{\n\t\t\t\t\tif(L&1<<v-1)continue;\n\t\t\t\t\tnext|=1<<v-1;\n\t\t\t\t}\n\t\t\t\tif(d[v][next]>D+cost)\n\t\t\t\t{\n\t\t\t\t\td[v][next]=D+cost;\n\t\t\t\t\tP.push(make_pair(-d[v][next],make_pair(v,next)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<int>sc(1<<m,0);\n\t\tfor(int i=0;i<1<<m;i++)\n\t\t{\n\t\t\tfor(int j=0;j<m;j++)if(i&1<<j)sc[i]+=c[j];\n\t\t}\n\t\tint ans=1e9;\n\t\tfor(int i=0;i<1<<m;i++)\n\t\t{\n\t\t\tans=min(ans,d[m+n+1][i]-sc[i]);\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3096,
"score_of_the_acc": -0.7066,
"final_rank": 6
},
{
"submission_id": "aoj_0224_2480316",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\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 Data{\n\tData(int arg_to,int arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to,cost;\n};\n\nint M,N,K,D;\nint POW[7] = {1,2,4,8,16,32,64};\n\nint getNUM(char buf[5]){\n\n\tint ret = 0;\n\tfor(int i = 1; buf[i] != '\\0'; i++){\n\t\tret = 10*ret + (buf[i]-'0');\n\t}\n\tret--;\n\n\tswitch(buf[0]){\n\tcase 'L':\n\t\treturn ret+M+2;\n\tcase 'C':\n\t\treturn ret+2;\n\tcase 'H':\n\t\treturn 0;\n\tcase 'D':\n\t\treturn 1;\n\t}\n\n\treturn -1; //must not reach here\n}\n\nvoid func(){\n\n\tint cake_value[M],min_Cost[M+N+2][POW[M]];\n\n\tfor(int i = 0; i < M+N+2; i++){\n\t\tfor(int k = 0; k < POW[M]; k++)min_Cost[i][k] = BIG_NUM;\n\t}\n\n\tvector<Data> V[M+N+2];\n\n\tfor(int i = 0; i < M; i++)scanf(\"%d\",&cake_value[i]);\n\n\tchar left[5],right[5];\n\tint cost,left_num,right_num;\n\n\tfor(int loop = 0; loop < D; loop++){\n\t\tscanf(\"%s %s %d\",left,right,&cost);\n\n\t\tleft_num = getNUM(left);\n\t\tright_num = getNUM(right);\n\n\t\tif(left[0] != 'C' && right[0] != 'C'){\n\t\t\tV[left_num].push_back(Data(right_num,K*cost));\n\t\t\tV[right_num].push_back(Data(left_num,K*cost));\n\t\t}else if(left[0] == 'C' && right[0] != 'C'){\n\t\t\tV[left_num].push_back(Data(right_num,K*cost));\n\t\t\tV[right_num].push_back(Data(left_num,K*cost-cake_value[left_num-2]));\n\t\t}else if(left[0] != 'C' && right[0] == 'C'){\n\t\t\tV[left_num].push_back(Data(right_num,K*cost-cake_value[right_num-2]));\n\t\t\tV[right_num].push_back(Data(left_num,K*cost));\n\t\t}else{\n\t\t\tV[left_num].push_back(Data(right_num,K*cost-cake_value[right_num-2]));\n\t\t\tV[right_num].push_back(Data(left_num,K*cost-cake_value[left_num-2]));\n\t\t}\n\t}\n\n\tmin_Cost[0][0] = 0;\n\n\tbool updated;\n\tint next_state;\n\n\tfor(int loop = 0; loop < N+M+2; loop++){\n\t\tupdated = false;\n\n\t\tfor(int from = 0; from < N+M+2; from++){\n\t\t\tfor(int i = 0; i < V[from].size();i++){\n\t\t\t\tfor(int state = 0; state < POW[M];state++){\n\t\t\t\t\tif(min_Cost[from][state] != BIG_NUM){\n\t\t\t\t\t\tif(V[from][i].to >= 2 && V[from][i].to <= 2+M-1){\n\t\t\t\t\t\t\tif(state & (1 << (V[from][i].to-2))){\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tnext_state = state + POW[V[from][i].to-2];\n\t\t\t\t\t\t\t\tif(min_Cost[V[from][i].to][next_state] > min_Cost[from][state] + V[from][i].cost){\n\t\t\t\t\t\t\t\t\tmin_Cost[V[from][i].to][next_state] = min_Cost[from][state] + V[from][i].cost;\n\t\t\t\t\t\t\t\t\tupdated = true;\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{\n\t\t\t\t\t\t\tif(min_Cost[V[from][i].to][state] > min_Cost[from][state] + V[from][i].cost){\n\t\t\t\t\t\t\t\tmin_Cost[V[from][i].to][state] = min_Cost[from][state] + V[from][i].cost;\n\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(!updated)break;\n\t}\n\n\tint ans = BIG_NUM;\n\tfor(int i = 0; i < POW[M];i++)ans = min(ans,min_Cost[1][i]);\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&M,&N,&K,&D);\n\t\tif(M == 0 && N == 0 && K == 0 && D == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2632,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0224_2463583",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<functional>\n#include<string>\n#include<stdlib.h>\n\nusing namespace std;\ntypedef pair<int, int> Pi;\ntypedef pair<int, Pi> Ti;\nconst int INF = 10000000;\n\nint m, n, k, d;\nint cake_cal[6];\nvector<vector<Pi>> edge;\n//home := 0 cake_shop := 1 ~ m landmark := m+1 ~ m+n city_holl := m+n+1\n\nint djk(int s, int g) {\n\tint d[128][1 << 6];//d[i][j] i:= Node j:= Visited node's memo by bits \n\tfor (int i = 0; i < m + n + 2; i++)for (int j = 0; j < (1 << 6); j++)d[i][j] = INF;\n\td[s][0] = 0;\n\tpriority_queue<Ti, vector<Ti>, greater<Ti>> pq;//cost Node bit\n\tpq.push(make_pair(0, make_pair(s, 0)));\n\twhile (pq.size()) {\n\t\tTi tmp = pq.top(); pq.pop();\n\t\tint N = tmp.second.first, bit = tmp.second.second;\n\t\tif (d[N][bit] < tmp.first)continue;\n\t\tfor (int i = 0; i < edge[N].size(); i++) {\n\t\t\tint to = edge[N][i].first, cost = edge[N][i].second;\n\t\t\tif (to >= 1 && to <= m) {\n\t\t\t\t//??±???????±?????????°\n\t\t\t\tif ((bit >> (to - 1)) & 1)continue;//?????§????????£??????????????°\n\t\t\t\tif (d[to][bit | 1 << (to - 1)] > d[N][bit] + cost - cake_cal[to - 1]) {\n\t\t\t\t\t//??????????????¨???????????????????????§??????????????§???????????????\n\t\t\t\t\td[to][bit | 1 << (to - 1)] = d[N][bit] + cost - cake_cal[to - 1];\n\t\t\t\t\tpq.push(make_pair(d[to][bit | 1 << (to - 1)],\n\t\t\t\t\t\tmake_pair(to, bit | 1 << (to - 1))\n\t\t\t\t\t));\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\t//??????????????????????????°\n\t\t\t\tif (d[to][bit] > d[N][bit] + cost) {\n\t\t\t\t\td[to][bit] = d[N][bit] + cost;\n\t\t\t\t\tpq.push(make_pair(d[to][bit], make_pair(to, bit)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint res = INF;\n\tfor (int i = 0; i < (1 << 6); i++)res = min(res, d[g][i]);\n\treturn res;\n}\n\nint conv(const char *s1){\n\tif (s1[0] == 'H') return (0);\n\tif (s1[0] == 'D') return (m + n + 1);\n\tif (s1[0] == 'C') return (atoi(s1 + 1));\n\treturn (atoi(s1 + 1) + m);\n}\n\n\nint main() {\n\twhile (cin >> m >> n >> k >> d, m + m + k + d) {\n\t\tfor (int i = 0; i < m; i++)cin >> cake_cal[i];\n\t\tedge.resize(2 + m + n);\n\t\t//??±?????????????????????????????????????????±???????±????????????????\n\t\tfor (int i = 0; i < d; i++) {\n\t\t\tstring s1, s2; int cost;\n\t\t\tcin >> s1 >> s2 >> cost;\n\t\t\tedge[conv(s1.c_str())].push_back(make_pair(conv(s2.c_str()), cost * k));\n\t\t\tedge[conv(s2.c_str())].push_back(make_pair(conv(s1.c_str()), cost * k));\n\t\t}\n\t\tcout << djk(0, m + n + 1) << endl;\n\t\tedge.clear();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3332,
"score_of_the_acc": -0.9642,
"final_rank": 12
},
{
"submission_id": "aoj_0224_2424260",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define REP(i, a, b) for ( int i = a; i < b; i++ )\n#define rep(i, n) REP(i, 0, n)\n#define INFTY (1<<21)\nint m, n, k, d, C[7], G[110][110], N, D[110][64];\nint getID(string str) {if (str == \"H\")return 0;\n\tif (str == \"D\")return N - 1;\n\tstring num = str.substr(1, str.size() - 1);\n\tif (str[0] == 'C')return atoi(num.c_str());\n\treturn atoi(num.c_str()) + m;\n}\nbool isC(int x) {\n\treturn 1 <= x && x <= m;}\nint bellman() {\n\trep(i, N)\n\t\trep(j, (1<<m))\n\t\t\tD[i][j] = INFTY;\n\tD[0][0] = 0;\n\trep(o, N*(1<<m))\n\t{\n\t\tbool change = false;\n\t\trep(u, N)\n\t\t\trep(v, N)\n\t\t\t{\n\t\t\t\tif (u == v || G[u][v] == INFTY)\n\t\t\t\t\tcontinue;\n\t\t\t\trep(b, (1<<m))\n\t\t\t\t{\n\t\t\t\t\tif (isC(v) && (b & (1 << (v - 1))) != 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tif (isC(v)) {\n\t\t\t\t\t\tif (D[u][b] + G[u][v] - C[v]\n\t\t\t\t\t\t\t\t< D[v][b | (1 << (v - 1))]) {\n\t\t\t\t\t\t\tD[v][b | (1 << (v - 1))] = D[u][b] + G[u][v] - C[v];\n\t\t\t\t\t\t\tchange = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (D[u][b] + G[u][v] < D[v][b]) {\n\t\t\t\t\t\t\tD[v][b] = D[u][b] + G[u][v];\n\t\t\t\t\t\t\tchange = 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\tif (!change)\n\t\t\tbreak;\n\t}\n\tint minv = INFTY;\n\trep(i, (1<<m))\n\t\tminv = min(minv, D[N - 1][i]);\n\treturn minv;\n}\nint main() {\n\tstring source, target;\n\tint cost;\n\twhile (cin >> m >> n >> k >> d && m) {\n\t\tN = 2 + n + m;\n\t\tREP(i, 1, m+1)\n\t\t\tcin >> C[i];\n\t\trep(i, N)\n\t\t\trep(j, N)\n\t\t\t\tG[i][j] = INFTY;\n\t\trep(i, d)\n\t\t{\n\t\t\tcin >> source >> target >> cost;\n\t\t\tint s = getID(source);\n\t\t\tint t = getID(target);\n\t\t\tG[t][s] = G[s][t] = min(G[s][t], cost * k);\n\t\t}\n\t\tcout << bellman() << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3136,
"score_of_the_acc": -0.6502,
"final_rank": 4
},
{
"submission_id": "aoj_0224_2416490",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n#define fi first\n#define se second\n\ntemplate<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<int, pii> pip;\nconst ll INF = 1ll<<29;\nconst ll MOD = 1000000007;\nconst double EPS = 1e-9;\n\nint dp[1<<6][110];\nint m, n, k, d;\nvector<pii> g[110]; // [0,m):??±???????±?, [m,m+n):??????????????????, m+n:??????, m+n+1:?????????\nint c[6];\n\nint input() {\n\tchar ch;\n\tint num;\n\tscanf(\" %c\", &ch);\n\tif (ch == 'H') return m + n;\n\tif (ch == 'D') return m + n + 1;\n\tscanf(\"%d\", &num);\n\t\n\tint res = num - 1;\n\tif (ch == 'L') res += m;\n\treturn res;\n}\n\nint main() {\n\twhile (cin >> m >> n >> k >> d, m || n || k || d) {\n\t\tREP(i, m) scanf(\"%d\", c + i);\n\t\t\n\t\tREP(i, m + n + 2) g[i].clear();\n\t\t\n\t\tREP(i, d) {\n\t\t\tint u = input();\n\t\t\tint v = input();\n\t\t\tint e; scanf(\"%d\", &e);\n\t\t\t\n\t\t\tg[u].push_back(pii(v, e * k));\n\t\t\tg[v].push_back(pii(u, e * k));\n\t\t}\n\t\t\n\t\t\n\t\tfill(dp[0], dp[1<<m], INF);\n\t\tpriority_queue<pip, vector<pip>, greater<pip> > pq;\n\t\tpq.push(pip(0, pii(0, m + n)));\n\t\tdp[0][m + n] = 0;\n\t\t\n\t\twhile (!pq.empty()) {\n\t\t\tpip now = pq.top(); pq.pop();\n\t\t\t\n\t\t\tint s = now.se.fi;\n\t\t\tint u = now.se.se;\n\t\t\t\n\t\t\tREP(i, g[u].size()) {\n\t\t\t\tint v = g[u][i].fi;\n\t\t\t\tint nc = now.fi + g[u][i].se;\n\t\t\t\t\n\t\t\t\tif (v < m && s >> v & 1) continue;\n\t\t\t\tint ns = s;\n\t\t\t\tif (v < m) ns |= 1<<v;\n\t\t\t\t\n\t\t\t\tif (!chmin(dp[ns][v], nc)) continue;\n\t\t\t\tpq.push(pip(nc, pii(ns, v)));\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans = INF;\n\t\tREP(i, 1 << m) if (dp[i][n + m + 1] != INF) {\n\t\t\tint sum = 0;\n\t\t\tREP(j, m) if (i >> j & 1) sum += c[j];\n\t\t\tchmin(ans, dp[i][n + m + 1] - sum);\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3180,
"score_of_the_acc": -0.7983,
"final_rank": 9
}
] |
aoj_0230_cpp
|
忍者のビル登り
忍者のあつしさんは、毎日朝早くから夜遅くまで忍者ビルの屋上から町を警備しています。この忍者ビルは、隣接する 2 つの同じ階数のビルであり、あつしさんは警備のために、ビルとビルの間をジャンプしながら屋上へ向かうことを日課としています。
この 2 つのビルは頻繁に清掃が行われるため、ビル登りの助けとなるはしごや障害となる滑りやすい部分があります。 しかも、はしごや滑りやすい部分の位置は毎日変わります。 そのためあつしさんは、屋上へ向かう方法を毎日考えなければいけません。
あつしさんは二つ並んだ同じ階数のビルの壁を跳び移りながら、ビルの屋上を目指します。ジャンプ
はどちらか一方のビルの1階から始められます。向かい側のビルへジャンプするときには、同じ階・1つ上の階・2 つ上の階の、いずれかに飛び移ることができます。
壁には以下の 3 種類があり、それぞれの壁にジャンプした後の移動が決まっています。
0. 普通の壁: 上下の移動はしない。次のジャンプはそこから行う。
1. はしご: はしごは 2 つ以上の階にまたがってかかっており、今いるはしごの一番上まで移動する。次のジャンプはそこから行う。
2. すべる壁: 普通の壁かはしごの一番上まで滑り落ちる。次のジャンプはそこから行う。
また、壁は 1 階から屋上のすぐ下の最上階まであり、屋上へはそのビルの最上階からのみ行くことが
できます。また、ビルの最下階の壁はすべる壁にはなりません。
2 つのビルの階数
n
と 2 つのビルの壁の種類を入力とし、最少で何回目のジャンプで最上階までたどり着き、屋上まで行くことができるかを出力するプログラムを作成してください。なお、どちらのビルの屋上にたどり着いてもよいものとします。ただし、あつしさんがどちらのビルの屋上へもたどり着けない場合は“NA”と出力してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。
各データセットは以下の形式で与えられます。
n
a
1
a
2
...
a
n
b
1
b
2
...
b
n
１行目にビルの階数
n
(3 ≤
n
≤ 100) が与えられます。２行目に１ つ目のビルの 1 階から
n
階までの壁の情報
a
i
、３行目に２つ目のビルの 1 階から
n
階までの壁の情報
b
i
が与えられます。
a
i
, b
i
は
i
階目の壁の情報を表し、0 が普通の壁、1 がはしご(
i
階と
i
+1 階にまたがる)、2 がすべる壁を表します。
データセットの数は 60 を超えません。
Output
入力データセットごとに、ジャンプの回数を１行に出力します。
Sample Input
8
0 0 0 2 2 2 0 0
1 1 1 1 0 0 0 0
4
1 1 2 2
0 0 2 2
0
Output for the Sample Input
4
NA
|
[
{
"submission_id": "aoj_0230_2456702",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint a[101],b[101],d[201][201],n;\nmain(){\n\twhile(cin>>n,n){\n\t\tr(i,201)r(j,201)d[i][j]=1e8;\n\t\tr(i,n)cin>>a[i];\n\t\tr(i,n)cin>>b[i];\n\t\tr(i,n){\n\t\t\tif(a[i]==1){\n\t\t\t\tif(i>0&&a[i-1]==1)d[i][i-1]=0;\n\t\t\t\tif(i+1<n&&a[i+1]==1)d[i][i+1]=0;\n\t\t\t}\n\t\t\tif(a[i]==2){\n\t\t\t\td[i][i-1]=0;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint j=i;\n\t\t\t\tif(j+2<n)d[i][j+100+2]=1;\n\t\t\t\tif(j+1<n)d[i][j+100+1]=1;\n\t\t\t\td[i][j+100]=1;\n\t\t\t}\n\t\t}\n\t\tr(i,n){\n\t\t\tif(b[i]==1){\n\t\t\t\tif(i>0&&b[i-1]==1)d[i+100][i+100-1]=0;\n\t\t\t\tif(i+1<n&&b[i+1]==1)d[i+100][i+100+1]=0;\n\t\t\t}\n\t\t\tif(b[i]==2){\n\t\t\t\td[i+100][i+100-1]=0;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint j=i;\n\t\t\t\tif(j+2<n)d[i+100][j+2]=1;\n\t\t\t\tif(j+1<n)d[i+100][j+1]=1;\n\t\t\t\td[i+100][j]=1;\n\t\t\t}\n\t\t}\n\t\tr(k,201)r(i,201)r(j,201)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n\t\tint ans1=1e8,ans2=1e8,ans;\n\t\tif(b[n-1]!=2)ans1=min(d[0][n+100-1],d[100][n+100-1]);\n\t\tif(a[n-1]!=2)ans2=min(d[0][n-1],d[100][n-1]);\n\t\tans=min(ans1,ans2);\n\t\tif(ans==1e8)cout<<\"NA\"<<endl;\n\t\telse cout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 3256,
"score_of_the_acc": -2,
"final_rank": 8
},
{
"submission_id": "aoj_0230_1570407",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint main()\n{\n\t\n\twhile(true){\n\t\tint N;\n\t\tint Num[200];\n\t\tscanf(\"%d\",&N);\n\t\tif(N==0)break;\n\t\tfor(int i=0;i<2*N;i++)scanf(\"%d\",&Num[i]);\n\t\tbool G[200][200];\n\t\tfor(int i=0;i<2*N;i++){\n\t\t\tfor(int j=0;j<2*N;j++){\n\t\t\t\tG[i][j]=false;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<N;i++){\n\t\t\tif(Num[i]==0){\n\t\t\t\tfor(int k=i+N;k<i+N+3&&k<2*N;k++){\n\t\t\t\t\tif(Num[k]==1){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j<2*N&&Num[j]==1){\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j-1]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse if(Num[k]==2){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j>=N+1&&Num[j]==2){\n\t\t\t\t\t\t\tj--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tG[i][k]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(Num[i]==1){\n\t\t\t\tint l=i;\n\t\t\t\twhile(l<N&&Num[l]==1){\n\t\t\t\t\tl++;\n\t\t\t\t}\n\t\t\t\tl--;\n\t\t\t\tfor(int k=l+N;k<l+N+3&&k<2*N;k++){\n\t\t\t\t\tif(Num[k]==1){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j<2*N&&Num[j]==1){\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j-1]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse if(Num[k]==2){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j>=N+1&&Num[j]==2){\n\t\t\t\t\t\t\tj--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tG[i][k]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint l=i;\n\t\t\t\twhile(l>=1&&Num[l]==2)l--;\n\t\t\t\tfor(int k=l+N;k<l+N+3&&k<2*N;k++){\n\t\t\t\t\tif(Num[k]==1){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j<2*N&&Num[j]==1){\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j-1]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse if(Num[k]==2){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j>=N+1&&Num[j]==2){\n\t\t\t\t\t\t\tj--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tG[i][k]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=N;i<2*N;i++){\n\t\t\tif(Num[i]==0){\n\t\t\t\tfor(int k=i-N;k<i-N+3&&k<N;k++){\n\t\t\t\t\tif(Num[k]==1){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j<N&&Num[j]==1){\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j-1]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse if(Num[k]==2){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j>=1&&Num[j]==2){\n\t\t\t\t\t\t\tj--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tG[i][k]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(Num[i]==1){\n\t\t\t\tint l=i;\n\t\t\t\twhile(l<2*N&&Num[l]==1){\n\t\t\t\t\tl++;\n\t\t\t\t}\n\t\t\t\tl--;\n\t\t\t\tfor(int k=l-N;k<l-N+3&&k<N;k++){\n\t\t\t\t\tif(Num[k]==1){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j<N&&Num[j]==1){\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j-1]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse if(Num[k]==2){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j>=1&&Num[j]==2){\n\t\t\t\t\t\t\tj--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tG[i][k]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint l=i;\n\t\t\t\twhile(l>=N+1&&Num[l]==2)l--;\n\t\t\t\tfor(int k=l-N;k<l-N+3&&k<N;k++){\n\t\t\t\t\tif(Num[k]==1){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j<N&&Num[j]==1){\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j-1]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse if(Num[k]==2){\n\t\t\t\t\t\tint j=k;\n\t\t\t\t\t\twhile(j>=1&&Num[j]==2){\n\t\t\t\t\t\t\tj--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tG[i][j]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tG[i][k]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint SS[200];\n\t\tfor(int i=0;i<200;i++)SS[i]=1000;\n\t\tSS[0]=0;SS[N]=0;\n\t\tif(Num[0]==1){\n\t\t\tint I=0;\n\t\t\twhile(Num[I]==1&&I<N){\n\t\t\t\tSS[I]=0;\n\t\t\t\tI++;\n\t\t\t}\n\t\t\tSS[I]=1000;\n\t\t}\n\t\tif(Num[N]==1){\n\t\t\tint I=N;\n\t\t\twhile(Num[I]==1&&I<2*N){\n\t\t\t\tSS[I]=0;\n\t\t\t\tI++;\n\t\t\t}\n\t\t\t\n\t\t\tSS[I]=1000;\n\t\t}\n\t\tfor(int k=0;k<2*N;k++){\n\t\t\tfor(int i=0;i<2*N;i++){\n\t\t\t\tfor(int j=0;j<2*N;j++){\n\t\t\t\t\tif(G[j][i]){\n\t\t\t\t\t\tSS[i]=min(SS[i],SS[j]+1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans=min(SS[N-1],SS[2*N-1]);\n\t\tif(ans==1000)printf(\"NA\\n\");\n\t\telse printf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 1240,
"score_of_the_acc": -0.593,
"final_rank": 5
},
{
"submission_id": "aoj_0230_1234239",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n\tint n;\n\twhile(cin >> n, n) {\n\t\tint bill[2][128] = {0};\n\t\tint edge[256][256];\n\t\tconst int INF = 512;\n\t\tfor(int i = 0; i < 256; i++) {\n\t\t\tfor(int j = 0; j < 256; j++) {\n\t\t\t\tedge[i][j] = INF;\n\t\t\t}\n\t\t\tedge[i][i] = 0;\n\t\t}\n\n\t\tfor(int i = 0; i < 2; i++)\n\t\t\tfor(int j = 0; j < n; j++)\n\t\t\t\tcin >> bill[i][j];\n\n\t\tfor(int i = 0; i < 2; i++) {\n\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\tfor(int k = 0; k < 3; k++) {\n\t\t\t\t\tif(j + k < n && (bill[i][j] == 0 || (bill[i][j] == 1 && bill[i][j+1] != 1))) {\n\t\t\t\t\t\tedge[n*i + j][n*(!i) + j + k] = 1;\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 < 2; i++) {\n\t\t\tfor(int j = 1; j < n; j++) {\n\t\t\t\tif(bill[i][j-1] == 1 && bill[i][j] == 1)\n\t\t\t\t\tedge[n*i + j-1][n*i + j] = 0;\n\t\t\t\telse if(bill[i][j] == 2)\n\t\t\t\t\tedge[n*i + j][n*i + j-1] = 0;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < 2 * n; i++) {\n\t\t\tfor(int j = 0; j < 2 * n; j++) {\n\t\t\t\tfor(int k = 0; k < 2 * n; k++) {\n\t\t\t\t\tedge[j][k] = min(edge[j][k], edge[j][i] + edge[i][k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint res = INF;\n\t\tif(bill[0][n-1] != 2) {\n\t\t\tres = min(res, min(edge[0][n-1], edge[n][n-1]));\n\t\t}\n\t\tif(bill[1][n-1] != 2) {\n\t\t\tres = min(res, min(edge[0][2*n-1], edge[n][2*n-1]));\n\t\t}\n\n\t\tif(res == INF)\n\t\t\tcout << \"NA\" << endl;\n\t\telse\n\t\t\tcout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1416,
"score_of_the_acc": -0.7379,
"final_rank": 6
},
{
"submission_id": "aoj_0230_1169992",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <climits>\n#include <algorithm>\n#include <map>\nusing namespace std;\n\nconst int INF = 1e7;\nstruct Edge { int from, to, cost; };\n\nint main() {\n int n;\n while (cin >> n, n) {\n vector<int> a(2*n);\n for (int i=0; i<2*n; ++i) cin >> a[i];\n\n vector<Edge> edges;\n for (int i=0; i<2*n; ++i) {\n if (a[i] == 0 || (a[i] == 1 && (i%n == n-1 || a[i+1] != 1))) {\n edges.push_back((Edge){i, (i+n)%(2*n), 1});\n if (i%n == n-1) continue;\n edges.push_back((Edge){i, (i+n)%(2*n)+1, 1});\n if (i%n == n-2) continue;\n edges.push_back((Edge){i, (i+n)%(2*n)+2, 1});\n } else if (a[i] == 1) {\n edges.push_back((Edge){i, i+1, 0});\n } else if (a[i] == 2) {\n edges.push_back((Edge){i, i-1, 0});\n }\n }\n\n int d[200];\n fill(d, d+200, INF);\n d[0] = d[n] = 0;\n for (int k=0; k<600; ++k) {\n for (int i=0; i<(int)edges.size(); ++i) {\n d[edges[i].to] = min(d[edges[i].to], d[edges[i].from] + edges[i].cost);\n }\n }\n\n int ans = INF;\n if (a[n-1] != 2) ans = min(ans, d[n-1]);\n if (a[2*n-1] != 2) ans = min(ans, d[2*n-1]);\n if (ans == INF) {\n cout << \"NA\" << endl;\n } else {\n cout << ans << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1232,
"score_of_the_acc": -0.3784,
"final_rank": 2
},
{
"submission_id": "aoj_0230_1101979",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <set>\n#include <cstring>\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,j) FOR(i,0,j)\n#define mp std::make_pair\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef std::pair<int,int> P;\ntypedef std::pair<int,P> State;\n\nconst int INF = 1001001001;\n\n// S N E W(南北東西)\nconst int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};\n\nint N;\nint bills[2][100];\nbool used[2][100][1000];\n\nint rec(int bill, int floor, int t){\n if(floor == N-1 && bills[bill][floor] != 2){return t;}\n if(t >= 1000){return INF;}\n if(used[bill][floor][t]){return INF;}\n\n used[bill][floor][t] = true;\n\n int res = INF;\n if(bills[bill][floor] == 0){\n res = std::min(rec(!bill, floor, t+1), rec(!bill, floor+1, t+1));\n if(floor+2 < N){res = std::min(res, rec(!bill, floor+2, t+1));}\n }else if(bills[bill][floor] == 1){\n int nextFloor = floor;\n while(true){\n if(nextFloor + 1 == N || bills[bill][nextFloor+1] != 1){\n break;\n }else{\n nextFloor += 1;\n }\n }\n\n if(nextFloor == N-1){return t;}\n res = rec(!bill, nextFloor, t+1);\n res = std::min(res, rec(!bill, nextFloor+1, t+1));\n if(nextFloor+2 < N){res = std::min(res, rec(!bill, nextFloor+2, t+1));}\n }else{\n int nextFloor = floor;\n while(bills[bill][nextFloor] == 2){\n nextFloor -= 1;\n }\n\n // if(nextFloor+1 < N && !bill == 1 && nextFloor+1 == 4){printf(\"%d, %d, %d\\n\", bill, floor, t);}\n res = rec(!bill, nextFloor, t+1);\n if(nextFloor+1 < N){res = std::min(res, rec(!bill, nextFloor+1, t+1));}\n if(nextFloor+2 < N){res = std::min(res, rec(!bill, nextFloor+2, t+1));}\n }\n return res;\n}\n\nint main(){\n while(std::cin >> N, N){\n REP(i, 2){\n REP(j, N){\n std::cin >> bills[i][j];\n }\n }\n\n memset(used, 0, sizeof(used));\n int res = rec(1, 0, 0);\n memset(used, 0, sizeof(used));\n res = std::min(res, rec(0, 0, 0));\n\n if(res != INF){\n std::cout << res << std::endl;\n }else{\n std::cout << \"NA\" << std::endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1408,
"score_of_the_acc": -0.5839,
"final_rank": 4
},
{
"submission_id": "aoj_0230_1062730",
"code_snippet": "#include <iostream>\n#include <cstring>\n#include <vector>\n#include <queue>\n#include <map>\n#include <algorithm>\n#define fr first\n#define sc second\n#define INF (2 << 28)\nusing namespace std;\n\ntypedef pair<int, bool> iP;\ntypedef pair<int, iP> iiP;\n\nint n, b[2][101];\nint used[2][101][201];\n\nint Dijkstra(){\n \n fill_n(**used, 2 * 101 * 201, INF);\n priority_queue<iiP, vector<iiP>, greater<iiP> > que;\n used[0][0][0] = 0, used[1][0][0] = 0;\n que.push(iiP(0, iP(0, false))), que.push(iiP(0, iP(0, true)));\n while(!que.empty()){\n iiP p = que.top(); que.pop();\n int cnt = p.fr, y = p.sc.fr;\n bool judge = p.sc.sc;\n \n //cout << p.sc.sc << \" \" << p.sc.fr << \" \" << p.fr << endl;\n if(p.sc.fr == n-1 && b[judge][y] != 2) return cnt;\n\n int c = 0;\n if(b[judge][y] == 1){\n while(b[judge][y + c] == 1 && y + c < n) c++;\n c--;\n if(y + c == n-1) return cnt;\n }\n else if(b[judge][y] == 2){\n while(b[judge][y + c] == 2) c--;\n }\n for(int i = 0; i < 3; i++){\n if(y + c + i < n && cnt + 1 < used[!judge][y + c + i][cnt + 1]){\n\tque.push(iiP(cnt + 1, iP(y + c + i, !judge)));\n\tused[!judge][y + c + i][cnt + 1] = cnt + 1;\n }\n }\n }\n return INF;\n\n} \n\nint main(){\n \n while(cin >> n, n){\n for(int j = 0; j < 2; j++){\n for(int i = 0; i < n; i++) cin >> b[j][i];\n }\n \n int d = Dijkstra();\n if(d == INF) cout << \"NA\" << endl;\n else cout << d << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1364,
"score_of_the_acc": -0.4189,
"final_rank": 3
},
{
"submission_id": "aoj_0230_336516",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <ctime>\n#include <cassert>\n#include <iostream>\n#include <cctype>\n#include <sstream>\n#include <string>\n#include <list>\n#include <vector>\n#include <queue>\n#include <set>\n#include <stack>\n#include <map>\n#include <utility>\n#include <numeric>\n#include <algorithm>\n#include <iterator>\n#include <bitset>\n#include <complex>\n#include <fstream>\n#include <iomanip>\nusing namespace std;\ntypedef long long ll;\nconst double EPS = 1e-9;\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\n#define rep(i, n) REP(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define MSG(a) cout << (#a) << \" \" << (a) << endl;\n#define REP(i, x, n) for(int i = x; i < n; i++)\ntemplate<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }\ntemplate<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }\ntemplate<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }\n\nconst int INF = (1 << 30) / 2;\n\nint main()\n{\n\tint n;\n\n\twhile(cin >> n && n)\n\t{\n\t\tvector<vint> v(2, vint(n));\n\t\tvector<vint> d((n + 1) * 2, vint((n + 1) * 2, INF));\n\n\t\trep(i, 2) rep(j, n)\n\t\t\tcin >> v[i][j];\n\n\n\t\trep(i, (n + 1))\n\t\t\td[i][i] = 0;\n\n\t\t// ツつサツづェツつシツづェツづ個湘ェツ渉環つゥツづァ1ツ偲ィツづ督楪達ツづつォツづゥツづつアツづォツづ可陛督づーツ陳」ツづゥ\n\t\trep(y, n) rep(x, 2)\n\t\t{\n\t\t\tif(v[x][y] != 2)\n\t\t\t{\n\t\t\t\tfor(int c = 0; c < 3 && y + c < n; c++)\n\t\t\t\t{\n\t\t\t\t\tint ny = y + c, nx = (x + 1) % 2;\n\t\t\t\t\td[y * 2 + x][ny * 2 + nx] = 1;\n\t\t\t\t}\n\n\t\t\t\tif(v[x][y] == 1)\n\t\t\t\t{\n\t\t\t\t\tif(y + 1 < n && v[x][y + 1] == 1)\n\t\t\t\t\t\td[y * 2 + x][(y + 1) * 2 + x] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(0 <= y - 1 && v[x][y - 1] == 2)\n\t\t\t\t\td[y * 2 + x][(y - 1) * 2 + x] = 0;\n\t\t\t}\n\t\t}\n\n\t\t// ツ催終ツマツスツつゥツづァツ陛督づーツ陳」ツづゥ\n\t\tif(v[0][n - 1] != 2) d[(n - 1) * 2][n * 2 + 1] = 0;\n\t\tif(v[1][n - 1] != 2) d[(n - 1) * 2 + 1][n * 2] = 0;\n\n\n\t\t\n\t\t// ツδ渉ーツシツδδδ仰フツδ債イツドツづ催短ツ仰猟猟」ツづーツ出ツつキ\n\t\trep(k, 2 * (n + 1)) rep(i, 2 * (n + 1)) rep(j, 2 * (n + 1))\n\t\t\t\tchmin(d[i][j], d[i][k] + d[k][j]);\n\n\n\t\t// ツづつソツづァツつゥツづァツづつソツづァツづ可行ツつュツづ個つェツ暗ェツ氾板短ツつ「ツつゥ\n\t\tint res = min(min(d[0][2 * n], d[0][2 * n + 1]), min(d[1][2 * n], d[1][2 * n + 1]));\n\n\n\t\tif(res == INF)\n\t\t\tcout << \"NA\" << endl;\n\t\telse\n\t\t\tcout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 0,
"score_of_the_acc": -0.8788,
"final_rank": 7
},
{
"submission_id": "aoj_0230_264119",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include <algorithm>\n\nint mymax=1000000000;\nvoid moveCheck(int moves[101],int bill[101],int n){\n\tfor(int i=0;i<n-1;i++){\n\t\t//òqðoé\n\t\tif(bill[i]==1 && bill[i+1]==1){\n\t\t\tmoves[i+1]=std::min(moves[i],moves[i+1]);\n\t\t\tmoves[i]=mymax;\n\t\t}\n\t}\n\tfor(int i=n-1;i>=1;i--){\n\t\t//éÇð~èé\n\t\tif(bill[i]==2){\n\t\t\tmoves[i-1]=std::min(moves[i],moves[i-1]);\n\t\t\tmoves[i]=mymax;\n\t\t}\n\t}\n}\n\nvoid jumpMove(int moves[2][101],int n,int now){\n\tint next=(now+1)%2;\n\tfor(int i=0;i<n-1;i++){\n\t\tfor(int k=0;k<3;k++){\n\t\t\tif(i+k>=n) continue;\n\t\t\tmoves[next][i+k]=std::min(moves[next][i+k],moves[now][i]+1);\n\t\t}\n\t}\n}\n\nvoid setData(int n){\n\tint bills[2][101];\n\tint moves[2][101];\n\tfor(int i=0;i<2*n;i++){\n\t\tscanf(\"%d\",&bills[i/n][i%n]);\n\t\tmoves[i/n][i%n]=mymax;\n\t}\n\tmoves[0][0]=moves[1][0]=0;\n \n int ans=mymax;\n\tmoveCheck(moves[0],bills[0],n);//¢«Èè͵²ÅBÅ«éÂ\\«ðl¶\n\tmoveCheck(moves[1],bills[1],n);\n\t\n\tfor(int i=0;i<2*n+3;i++){\n\t\tans=std::min(moves[0][n-1],moves[1][n-1]);\n\t\tjumpMove(moves,n,0);//0ÔÚÌr©çPÔÚÌrÖÌÚ®\n\t\tmoveCheck(moves[1],bills[1],n);\n\t\tjumpMove(moves,n,1);//1ÔÚ¯ã\n\t\tmoveCheck(moves[0],bills[0],n);\n\t}\n\tif(ans==mymax){\n\t\tprintf(\"NA\\n\");\n\t}else{\n\t\tprintf(\"%d\\n\",ans);\n\t}\n}\n\nint main(){\n\tint n;\n\twhile(1){\n\t\tscanf(\"%d\",&n);\n\t\tif(n==0) break;\n\t\tsetData(n);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_0233_cpp
|
図書整理
数の表わし方には色々な種類があり、私たちが普段使っている 10 進数は一つの代表的なものでしかありません。コンピュータ関連の知識がある人には、2 進数、16 進数あたりはとても身近なものです。
N さんは司書資格を活かして司書の仕事に就きました。最初の仕事は図書整理です。この図書館では、一冊ごとに一貫して番号が与えられており、それに従って本を整理しています。
この図書館では本の番号をマイナス十進数で表すことになっています。
マイナス十進数は、
a
n
a
n−1
a
n−2
...
a
2
a
1
a
0
(各
a
i
は 0~9 の数字) と表記する方法であり、この数は次の数を表します。
a
n
×(−10)
n
+ a
n−1
×(−10)
n−1
+
...
+ a
2
×(−10)
2
+ a
1
×(−10)
1
+ a
0
×(−10)
0
たとえば、マイナス十進数の 2156 は、以下のとおり十進数の-1944 に対応しています。
2×(-10)
3
+ 1×(-10)
2
+ 5×(-10)
1
+ 6×(-10)
0
=
2×(-1000) + 1×(100) + 5×(-10) + 6×(1) =
-2000 + 100 - 50 + 6 = -1944
十進数の番号をマイナス十進数に直すのは大変なので、N さんは大変不自由な思いをしています。
本の番号を入力とし、 この番号のマイナス十進数表記を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットとして、本の番号を表す整数
A
(-2
31
≤
A
< 2
31
) が１行に与えられます。
データセットの数は 1200 を超えません。
Output
入力データセットごとに、番号のマイナス十進数表記を１行に出力します。
Sample Input
9
10
-10
-1944
-305432133
0
Output for the Sample Input
9
190
10
2156
1715573947
|
[
{
"submission_id": "aoj_0233_2432947",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n#define fi first\n#define se second\n\ntemplate<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<int, pii> pip;\n\nconst ll INF = 1ll<<29;\nconst ll MOD = 1000000007;\nconst double EPS = 1e-9;\n\nint main() {\n\tll N;\n\twhile (cin >> N, N) {\n\t\tll b[14] = {};\n\t\t\n\t\tb[0] = 1;\n\t\tFOR(i, 1, 14) b[i] = b[i - 1] * -10;\n\t\t\n\t\tqueue<pll> que[14];\n\t\tque[13].push(pll(N, 0));\n\t\t\n\t\tfor (int i = 13; i > 0; i--) {\n\t\t\twhile (!que[i].empty()) {\n\t\t\t\tpll now = que[i].front(); que[i].pop();\n\t\t\t\t\n\t\t\t\tll dif = now.fi;\n\t\t\t\t\n\t\t\t\tREP(j, 10) {\n\t\t\t\t\tll ndif = dif - b[i] * j;\n\t\t\t\t\tint nk = log10(abs(ndif)) + 1;\n\t\t\t\t\t\n\t\t\t\t\tif (i >= nk) que[i - 1].push(pll(ndif, now.se + abs(b[i]) * j));\n \n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tll ans = -1;\n\t\twhile (!que[0].empty()) {\n\t\t\tpii now = que[0].front(); que[0].pop();\n\t\t\tif (now.fi >= 0) ans = now.se + now.fi;\n\t\t}\n\t\t\n\t\t\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3332,
"score_of_the_acc": -0.0628,
"final_rank": 5
},
{
"submission_id": "aoj_0233_2104056",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nvector<pair<long long, long long>>v1, v2;\nlong long power[16], power2[16];\nlong long solve(long long F, int p) {\n\tlong long sum = 0;\n\tfor (int i = p; i < p + 6; i++)sum += power[i] * ((F / power2[i - p]) % 10);\n\treturn sum;\n}\nint main() {\n\tpower[0] = 1; for (int i = 1; i < 16; i++)power[i] = power[i - 1] * (-10);\n\tpower2[0] = 1; for (int i = 1; i < 16; i++)power2[i] = power2[i - 1] * (+10);\n\tfor (int i = 0; i < 10000; i++) { v1.push_back(make_pair(solve(i, 0), i)); }\n\tfor (int i = -999999; i < 1000000; i++) { v2.push_back(make_pair(solve(i, 4), i)); }\n\tsort(v2.begin(), v2.end());\n\twhile (true) {\n\t\tlong long r; cin >> r; if (r == 0)break;\n\t\tfor (int i = 0; i < 10000; i++) {\n\t\t\tlong long pos1 = lower_bound(v2.begin(), v2.end(), make_pair((r - v1[i].first), 0LL)) - v2.begin();\n\t\t\tif (pos1 < v2.size() && v2[pos1].first == (r - v1[i].first)) { cout << i + v2[pos1].second * 10000 << endl; }\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 400,
"memory_kb": 35784,
"score_of_the_acc": -2,
"final_rank": 7
},
{
"submission_id": "aoj_0233_2103151",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nlong long n;\nint main() {\n\tvector<pair<long long, int> > vr;\n\tfor (int i = 0; i < 1000000; i++) {\n\t\tstring s = to_string(i);\n\t\tint sum = 0;\n\t\tfor (int j = 0; j < s.size(); j++) sum = sum * -10 + (s[j] - 48);\n\t\tvr.push_back(make_pair(sum, i));\n\t}\n\tsort(vr.begin(), vr.end());\n\tvector<long long> vr2;\n\tfor (pair<long long, int> i : vr) vr2.push_back(i.first);\n\twhile (cin >> n, n) {\n\t\tfor (int i = 0; ; i++) {\n\t\t\tlong long sum = 0;\n\t\t\tstring s = to_string(i);\n\t\t\tfor (int j = 0; j < s.size(); j++) sum = sum * -10 + (s[j] - 48);\n\t\t\tsum *= 1000000;\n\t\t\tint ptr = lower_bound(vr2.begin(), vr2.end(), n - sum) - vr2.begin();\n\t\t\tif (ptr < vr2.size() && vr2[ptr] == n - sum) {\n\t\t\t\tcout << i * 1000000 + vr[ptr].second << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 34492,
"score_of_the_acc": -1.3473,
"final_rank": 6
},
{
"submission_id": "aoj_0233_1227675",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\n\ntypedef long long lint;\n\nlint n, ans, lb[10], ub[10], ten[10], k;\n\nbool isok(int cans) {\n\tint k = 0, nn = 0;\n\t\n\twhile (cans > 0) {\n\t\tint x = cans % 10;\n\t\tnn += x * ten[k];\n\t\tcans /= 10;\n\t\t++k;\n\t}\n\t\n\treturn n == nn;\n}\n\nbool rec(int x, int cans, int i) {\n\tif (i > k) {\n\t\tif (isok(cans)) {\n\t\t\tans = cans;\n\t\t\treturn 1;\n\t\t} else {\n\t\t\treturn 0;\n\t\t}\n\t}\n\t\n\tint xx = x < 0 ? -x : x, ii = i;\n\twhile (ii--) xx /= 10;\n\tint p = xx % 10;\n\t\n\tif (rec(x - ten[i] * p, cans + p * (i % 2 ? -ten[i] : ten[i]), i + 1)) return 1;\n\tif (rec(x - ten[i] * (10 - p), cans + (10 - p) * (i % 2 ? -ten[i] : ten[i]), i + 1)) return 1;\n\treturn 0;\n}\n\nint main() {\n\tlb[0] = 0; ub[0] = 9;\n\tlint mn = 0, mx = 9, add = -90;\n\t\n\tfor_(i,1,10) {\n\t\tif (i % 2) {\n\t\t\tlb[i] = mn + add;\n\t\t\tub[i] = mn - 1;\n\t\t\tmn = lb[i];\n\t\t} else {\n\t\t\tlb[i] = mx + 1;\n\t\t\tub[i] = mx + add;\n\t\t\tmx = ub[i];\n\t\t}\n\t\tadd *= -10;\n\t}\n\t\n\tten[0] = 1;\n\tfor_(i,1,10) ten[i] = ten[i-1] * -10;\n\t\n\twhile (cin >> n, n) {\n\t\tk = 0;\n\t\twhile (n < lb[k] || n > ub[k]) ++k;\n\t\trec(n, 0, 0);\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0233_1201270",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\twhile(cin >> n && n)\n\t{\n\t\tstring s = \"\";\n\n\t\twhile(n != 0)\n\t\t{\n\t\t\tint t = n;\n\n\t\t\tif(n < 0) t *= -1;\n\t\t\tt %= 10;\n\n\t\t\tif(n < 0) t = (10 - t)%10;\n\n\t\t\tstringstream ss;\n\t\t\tss << t;\n\t\t\ts += ss.str();\n\n\t\t\tn = (n - t) / -10;\n\t\t}\n\n\t\treverse(s.begin(),s.end());\n\t\tcout << s << endl;\n\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -0.0018,
"final_rank": 4
},
{
"submission_id": "aoj_0233_954481",
"code_snippet": "#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 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\nconst int INF = 10000000;\nint dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};\nusing namespace std;\ntypedef long long ll;\ntypedef pair<double, double> P;\n\n/** Problem0233 : Book Arrangement **/\nint main() {\n\tint n;\n\twhile (cin>>n, n) {\n\t\tstring ans;\n\t\twhile (1) {\n\t\t\tint t = n%10;\n\t\t\tn/=-10;\n\t\t\tif (t>=0)\n\t\t\t\tans+='0'+t;\n\t\t\telse {\n\t\t\t\tans+='0'+(t+10);\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tif (n==0)\n\t\t\t\tbreak;\n\t\t}\n\t\treverse(ans.begin(), ans.end());\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1192,
"score_of_the_acc": -0.001,
"final_rank": 2
},
{
"submission_id": "aoj_0233_782515",
"code_snippet": "#include<iostream>\n\nusing namespace std;\n\n/*\n convert n(10-base) to res('base'-base)\n\n when you want to convert 150(10-base) into x(-2-base) call convert(150,2)\n */\n\nstring convert(long long n, int base){\n string res;\n if(n==0) return \"0\";\n long long a,b;\n int t=0;\n for(;n;t++){\n t=t&1;\n a=n/base;\n b=n-a*base;\n if(b<0&&t==0){\n b+=base; a-=1;\n }else if(t==1&&b>0){\n b-=base; a+=1;\n }\n if(b<0)b=-b;\n res=\" \"+res;\n res[0]=b+'0';\n n=a;\n }\n return res;\n}\n\nint main(){\n int n;\n while(cin >> n && n){\n cout << convert(n,10) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.0013,
"final_rank": 3
}
] |
aoj_0227_cpp
|
お客様大感謝祭
悪天候が続き野菜の価格が高騰する中、セブンマートではお客様に野菜のまとめ買いセールを実施しています。 日ごろなかなか店頭に並ばない野菜もお手頃価格で手に入るとあって、 店内はとても賑わっています。
ある日、松長団地に住む仲良し 3 人組がセブンマートの広告を手に話に花を咲かせていました。今回のセールは「お客様大感謝祭」と銘打っただけに、袋詰めした野菜の中で最も安いものが無料になるのが目玉となっています。広告を読んでみると、どうやら以下のようなセールのようです。
1 つの袋には
m
個まで野菜を詰められる。
野菜が
m
個詰めてある袋については、その中で最も安い野菜が無料となる。
野菜の個数が
m
個に達しない袋は割引の対象外。
3人は早速セブンマートへ買い物に行きました。
買い物が終わり、 お店の外で待ち合わせた 3 人は安くてたくさん購入できたことに満足した様子で話をしていると、どうやら 3 人とも同じ野菜を購入していたことが分かりました。ある一人が、「本当に安いわよねぇ。これでXXX円だもの!」と言うと、もう一人は、「え?私はそれより**円高かったわ!どうして?」と驚き、また、残りの一人はレシートを見て自分が一番安く購入したことに気付きました。
さて、どのように袋詰めすれば購入価格を一番安くできるでしょうか。 購入する野菜の個数、袋に入る野菜の個数、各野菜の値段を入力とし、最低購入価格を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。
各データセットは以下の形式で与えられます。
n
m
p
1
p
2
...
p
n
1 行目に購入する野菜の個数
n
(1 ≤
n
≤ 1000) と袋に入る野菜の個数
m
(1 ≤
m
≤ 1000) が与えられます。２行目に各野菜の値段
p
i
(10 ≤
p
i
≤ 10000) が与えられます。
データセットの数は 100 を超えません。
Output
入力データセットごとに、最低購入価格を１行に出力します。
Sample Input
4 2
50 40 100 80
7 3
400 300 100 700 200 600 500
0 0
Output for the Sample Input
150
2100
|
[
{
"submission_id": "aoj_0227_3202796",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main() {\n\tint a, b, date[11111],date2[11111],dai,kk,ans;\n\twhile (1) {\n\t\tcin >> a >> b;\n\t\tif (a == 0 && b == 0) {\n\t\t\tgoto a;\n\t\t}\n\t\tans = 0;\n\t\tfor (int i = 1; i <= a; i++) {\n\t\t\tcin >> date[i];\n\t\t\tans += date[i];\n\t\t}\n\t\tfor (int i = 1; i <= a; i++) {\n\t\t\tdai = 0;\n\t\t\tfor (int z = 1; z <= a; z++) {\n\t\t\t\tif (dai <= date[z]) {\n\t\t\t\t\tdai = date[z];\n\t\t\t\t\tkk = z;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdate[kk] = 0;\n\t\t\tdate2[i] = dai;\n\t\t}\n\t\tint ok = 0;\n\t\twhile(ok<= a-b) {\n\t\t\tok = ok + b;\n\t\t\tans -= date2[ok];\n\t\t}\n\t\tcout << ans << endl;\n\t}\na:;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3124,
"score_of_the_acc": -1.2368,
"final_rank": 18
},
{
"submission_id": "aoj_0227_2879339",
"code_snippet": "#include<iostream>\n#include<utility>\nusing namespace std;\n\nvoid selectionsort(int A[], int N){\n int minj;\n for(int i=N-1;i>=0;i--){\n minj = i;\n for(int j=i-1;j>=0;j--){\n if(A[j]<A[minj]) minj = j;\n }\n if(minj != i){\n swap(A[minj], A[i]);\n }\n }\n}\n\nint main(){\n int n, m;\n while(1){\n int sum = 0;\n cin>>n>>m;\n if(!(n * m)) return 0;\n int P[1000];\n for(int i=0;i<n;i++){\n cin>>P[i];\n sum += P[i];\n }\n selectionsort(P, n);\n for(int i=1;i<=n/m;i++){\n sum -= P[i*m-1];\n }\n cout<<sum<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3064,
"score_of_the_acc": -1.4585,
"final_rank": 20
},
{
"submission_id": "aoj_0227_2876707",
"code_snippet": "#include\"iostream\"\nusing namespace std;\nint main() {\n\twhile (1) {\n\t\tint n, m,p[10000],sum=0;\n\t\tcin >> n >> m;\n\t\t\n\t\tif (n == 0 && m == 0)break;\n\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tcin >> p[i];\n\t}\n\n\t\tfor (int j = 0; j < n - 1; j++) {\n\t\t\tfor (int i = 1; i < n ; i++) {\n\t\t\t\tif (p[i] < p[i + 1]) {\n\t\t\t\t\tswap(p[i], p[i + 1]);\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\t\t\tif (i%m != 0) {\n\t\t\t\t\t\tsum += p[i];\n\t\t\t\t\t}\n\n\t\t\t}\n\t\t\n\t\tcout << sum << endl;\n\t}\n\t\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3084,
"score_of_the_acc": -1.2179,
"final_rank": 17
},
{
"submission_id": "aoj_0227_2875569",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n,m,temp;\n\twhile(1){\n\t\tcin >> n >> m;\n\t\tint a[n+1],sum=0;\n\t\tif(n==m && n==0) break;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin >> a[i];\n\t\t}\n\t\tfor(int i=1;i<n;i++){\n\t\t\tfor(int j=i+1;j<n+1;j++){\n\t\t\t\tif(a[i]<a[j]){\n\t\t\t\t\ttemp=a[i];\n\t\t\t\t\ta[i]=a[j];\n\t\t\t\t\ta[j]=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<n+1;i++){\n\t\t\tif(i%m!=0){\n\t\t\t\tsum+=a[i];\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2948,
"score_of_the_acc": -1.1538,
"final_rank": 13
},
{
"submission_id": "aoj_0227_2875487",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nwhile(1){\n int n,m;\n int p[10000];\n int sum=0;\n cin>>n>>m;\n if(n==0 && m==0) break;\n for(int i=0;i<n;i++){\n cin>>p[i];\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<n-1;j++){\n if(p[j]<p[j+1]) swap(p[j],p[j+1]);\n }\n }\n for(int i=0;i<n;i++){\n if(i%m==m-1) p[i]=0;\n }\n for(int i=0;i<n;i++){\n sum+=p[i];\n }\n cout<<sum<<endl;\n}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3060,
"score_of_the_acc": -1.2066,
"final_rank": 15
},
{
"submission_id": "aoj_0227_2875226",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint p[1010];\n\nint main(){\n\twhile(1){\n\t\tint n,m,t=0;\n\t\tcin>>n>>m;\n\t\tif(n==0&&m==0) break;\n\t\tfor(int i=0;i<n;i++) cin>>p[i];\n\t\tint f=1;\n\t\twhile(f==1){\n\t\t\tf=0;\n\t\t\tfor(int j=0;j<n-1;j++){\n\t\t\t\tif(p[j]<p[j+1]){\n\t\t\t\t\tswap(p[j],p[j+1]);\n\t\t\t\t\tf=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<=n/m;i++){\n\t\t\tp[i*m-1]=0;\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tt+=p[i];\n\t\t}\n\t\tcout<<t<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3072,
"score_of_the_acc": -1.2123,
"final_rank": 16
},
{
"submission_id": "aoj_0227_2240280",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n\tint n,m;\n\tint vegetable[10001];\n\twhile(cin>>n>>m){\n\t\tif(n+m==0)break;\n\t\tfor(int i=0 ; i<n ; i++ )\n\t\t\tcin>>vegetable[i];\n\t\t//sort__\n\t\tfor(int i=0 ; i<n ; i++ ){\n\t\t\tfor(int j=i+1 ; j<n ; j++ ){\n\t\t\t\tif( vegetable[i] < vegetable[j] ){\n\t\t\t\t\tint tmp=vegetable[i];\n\t\t\t\t\tvegetable[i]=vegetable[j];\n\t\t\t\t\tvegetable[j]=tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//_sort.\n\t\tint x=n/m;\n\t\tint y=n%m;\n\t\tint sum=0;\n\t\tint tmp;\n\t\tfor(int i=n-y ; i<n ; i++ )\n\t\t\tsum+=vegetable[i];\n\t\tfor(int i=0 ; i<n-y ; i++ ){\n\t\t\tif((i+1)%m){\n\t\t\t\tsum+=vegetable[i];\n\t\t\t}\n\t\t}\n\t\tcout<< sum << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2988,
"score_of_the_acc": -1.1726,
"final_rank": 14
},
{
"submission_id": "aoj_0227_2082609",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n#include <math.h>\n#include <queue>\n\nusing namespace std;\n\nint main(){\n\n\tint n,m,table[1000],sum;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&n,&m);\n\t\tif(n == 0 && m == 0)break;\n\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tscanf(\"%d\",&table[i]);\n\t\t}\n\n\t\tfor(int i = 1; i <= n-1; i++){\n\t\t\tfor(int k = n-1; k >= i; k--){\n\t\t\t\tif(table[k] > table[k-1])swap(table[k],table[k-1]);\n\t\t\t}\n\t\t}\n\n\t\tsum = 0;\n\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tif(i%m != m-1){\n\t\t\t\tsum += table[i];\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",sum);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2676,
"score_of_the_acc": -0.7755,
"final_rank": 10
},
{
"submission_id": "aoj_0227_1993746",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint main()\n{\n\twhile (1) {\n\t\tint a,b;\n\t\tcin >> a>>b;\n\t\tif (a == 0&&b==0)break;\n\t\tvector<int>s(a);\n\t\tfor (int c = 0; c < a; c++) {\n\t\t\tcin >> s[c];\n\t\t}\n\t\tsort(s.begin(), s.end());\n\t\tint goukei = 0;\n\t\tfor (int e = 0; e < a; e++) {\n\t\t\tif ((e + 1) % b != 0)goukei += s[s.size() - 1 - e];\n\t\t}\n\t\tcout << goukei << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3152,
"score_of_the_acc": -1,
"final_rank": 11
},
{
"submission_id": "aoj_0227_1956115",
"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 itrep(it, a) for(it = (a).begin(); it != (a).end(); it++)\n#define all(a) (a).begin(), (a).end()\n#define debug(x) cout << \"debug \" << x << endl;\n#define INF (1 << 30)\nusing namespace std;\n\nint main(){\n int n,m;\n while(cin >> n >> m, n||m){\n int a[1005], ans = 0;\n rep(i,n) cin >> a[i];\n sort(a, a + n, greater<int>());\n rep(i,n){\n if(i % m != m - 1) ans+=a[i];\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1180,
"score_of_the_acc": -0.0698,
"final_rank": 2
},
{
"submission_id": "aoj_0227_1950882",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#include <boost/tokenizer.hpp>\n#include <boost/lexical_cast.hpp>\n#include <vector>\n#include <list>\n\nusing namespace std;\nusing namespace boost;\n\n\nint main(int argc, char* argv[])\n{\n\tusing sprtr = char_separator<char>;\n\tusing tknzr = tokenizer<sprtr>;\n\tsprtr sep(\" \", \"\", keep_empty_tokens);\n\n\tint f, mf, mo;\n\n\tstring line;\n\twhile(1) {\n\n\t\tint n, m;\n\t\t{\n\t\t\tgetline(cin, line);\n\t\t\ttknzr tkns(line, sep);\n\t\t\tauto it = tkns.begin();\n\t\t\tn = lexical_cast<int>(*it++);\n\t\t\tm = lexical_cast<int>(*it);\n\t\t}\n\n\t\tif( n == 0 && m == 0 ) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tlist<int> ps;\t\t\n\t\t{\n\t\t\tgetline(cin, line);\n\t\t\ttknzr tkns(line, sep);\n\t\t\tfor( auto p : tkns ) {\n\t\t\t\t//cout << p << endl;\n\t\t\t\tps.push_back(lexical_cast<int>(p));\n\t\t\t}\n\t\t}\n\n\t\tps.sort(greater<int>());\n\n\t\tint div = n / m;\n\t\tint mod = n % m;\n\n\t\tint sum = 0;\n\t\tauto it = ps.begin();\n\t\tfor( int i = 0; i < div; i++ ) {\n\t\t\tfor( int j = 0; j < m; j++ ) {\n\t\t\t\tauto p = *it++;\n\t\t\t\tif( j == m-1 ) continue;\n\t\t\t\tsum += p;\n\t\t\t}\n\t\t}\n\n\t\tif( mod ) {\n\t\t\tfor( int i = 0; i < mod; i++ ) {\n\t\t\t\tauto p = *it++;\n\t\t\t\tsum += p;\t\t\t \n\t\t\t}\n\t\t}\n\n\t\tcout << sum << endl;\n\n\t\tps.clear();\n\t\t\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3136,
"score_of_the_acc": -1.2425,
"final_rank": 19
},
{
"submission_id": "aoj_0227_1950847",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n int n,m,q;\n ll res;\n vector<ll> v;\n while(true) {\n cin >> n >> m;\n if(n == 0) break;\n v.clear();\n res = 0;\n for(int i = 0; i < n; i++){\n cin >> q;\n v.push_back(q);\n }\n sort(v.begin(), v.end(), greater<int>());\n for(int i=0; i < n; i++) {\n if(i % m != m - 1)\n res += v[i];\n }\n cout << res << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": -0.0925,
"final_rank": 3
},
{
"submission_id": "aoj_0227_1946741",
"code_snippet": "#include<stdio.h>\nint main(void)\n{\n\tint a,s,d[2000],f,g,h,i,j;\n\tscanf(\"%d %d\",&a,&s);\n\twhile(a!=0&&s!=0){\n\t\tfor(i=1;i<=a;i++){\n\t\t\tscanf(\"%d\",&d[i]);\n\t\t}\n\t\tfor(i=1;i<=a;i++){\n\t\t\tfor(j=i;j<=a;j++){\n\t\t\t\tif(d[i]<d[j]){\n\t\t\t\t\tf=d[i];\n\t\t\t\t\td[i]=d[j];\n\t\t\t\t\td[j]=f;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tg=0;\n\t\th=0;\n\t\tfor(i=1;i<=a;i++){\n\t\t\tif(g==s-1){\n\t\t\t\tg=0;\n\t\t\t\td[i]=0;\n\t\t\t}\n\t\t\telse if(g!=s-1){\n\t\t\t\tg++;\n\t\t\t\th+=d[i];\n\t\t\t}\n\t\t\t//printf(\"%d %d\\n\",g,d[i]);\n\t\t}\n\t\tprintf(\"%d\\n\",h);\n\tscanf(\"%d %d\",&a,&s);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1036,
"score_of_the_acc": -0.2519,
"final_rank": 8
},
{
"submission_id": "aoj_0227_1919766",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nint main()\n{\n\tint n,m;\n\twhile(cin>>n>>m&&n)\n\t{\n\t\tvector<int> a;\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tint x;\n\t\t\tcin>>x;\n\t\t\ta.push_back(x);\n\t\t}\n\t\tsort(a.begin(),a.end());\n\t\tfor(int i=0;i<n%m;i++)\n\t\t{\n\t\t\tans+=a[0];;\n\t\t\ta.erase(a.begin());\n\t\t}\n\t\tn-=n%m;\n\t\tfor(int i=0;i<a.size();i++)ans+=a[i];\n\t\tfor(int i=0;i<n/m;i++)\n\t\t{\n\t\t\tans-=a[i*m];\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\t\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1232,
"score_of_the_acc": -0.0943,
"final_rank": 5
},
{
"submission_id": "aoj_0227_1913033",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n,m;\n while(cin>>n>>m,n,m){\n int vege[1000];\n for(int i=0;i<n;i++)cin>>vege[i];\n sort(vege,vege+n);\n for(int i=1;n-m*i>=0;i++)vege[n-m*i]=0;\n for(int i=1;i<n;i++)vege[0]+=vege[i];\n cout<<vege[0]<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1176,
"score_of_the_acc": -0.0679,
"final_rank": 1
},
{
"submission_id": "aoj_0227_1907822",
"code_snippet": "#include<iostream>\n#include<queue>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\nusing namespace std;\n\nint main(){\n\tint n,m,dt;\n\twhile(1){\n\t\tcin>>n>>m;\n\t\tif(!(n&&m))break;\n\t\tpriority_queue<int> que;\n\t\trep(i,n){cin>>dt;que.push(dt);}\n\t\tint cnt=0,sum=0;\n\t\twhile(!que.empty()){\n\t\t\tcnt++;\n\t\t\tif(cnt!=m)sum+=que.top();\n\t\t\telse cnt=0;\n\t\t\tque.pop();\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": -0.0925,
"final_rank": 3
},
{
"submission_id": "aoj_0227_1847092",
"code_snippet": "#include<stdio.h>\nint main(){\n int m,n,a[1000],i,k,st,c;\n while(1){\n c=0;\n scanf(\"%d%d\",&n,&m);\n if(n==0&&m==0)break;\n k=n;\n for(i=0;i<n;i++){\n scanf(\"%d\",&a[i]);\n }\n while(k!=0){\n for(i=1;i<k;i++){\n\tif(a[i-1]>a[i]){\n\t st=a[i];\n\ta[i]=a[i-1];\n\ta[i-1]=st;\n\t}\n }\n\tk--;\n }\n for(i=n;i>=0;i-=m){\n a[i]=0;\n }\n for(i=0;i<n;i++){\n c+=a[i];\n }\n printf(\"%d\\n\",c);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1032,
"score_of_the_acc": -0.25,
"final_rank": 7
},
{
"submission_id": "aoj_0227_1846990",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main(){\n while(1){\n int ans=0,n,m,p[1001]={};\n cin>>n>>m;\n if(n==0 && m==0)break;\n for(int i=0;i<n;i++)\n cin>>p[i];\n \n for(int j=0;j<n;j++) \n for(int i=0;i<n;i++)\n\tif(p[i]<p[i+1])swap(p[i],p[i+1]);\n\n for(int i=0;i<n;i++){\n if((i+1)%m==0)p[i]=0;\n ans+=p[i];\n }\n\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1160,
"score_of_the_acc": -1.0604,
"final_rank": 12
},
{
"submission_id": "aoj_0227_1846299",
"code_snippet": "#include <iostream>\n#include <list>\n\nint main() {\n int num,bag,sum;\n\t\n while(std::cin >> num >> bag){\n\t\n if(num!=0 && bag!=0){\n std::list<int> beg;\n for(int i=0;i<num;++i){\n\tint price;\n\tstd::cin >> price;\n\tbeg.push_back(price);\n }\n beg.sort(std::greater<int>());\n sum=0;\n\t \n for(int i=1;beg.empty()!=true;i++){\t \n if(i%bag != 0){\n sum+=beg.front();\n }\t\n beg.pop_front();\n }\n std::cout << sum << std::endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1224,
"score_of_the_acc": -0.3406,
"final_rank": 9
},
{
"submission_id": "aoj_0227_1844261",
"code_snippet": "#include <iostream>\n#include <queue>\n\nint main(){\n while (true) {\n int n; // I will buy n vegetables.\n int m; // One bag contains m vegetables.\n\n std::cin >> n >> m;\n if ( n==0 && m==0 ) {\n return 0;\n }\n\n // input vegetable's cost.\n std::priority_queue<int> buy;\t // the first item in 'buy' is the most expensive.\n int in;\n for (int i=0; i < n ; ++i) {\n std::cin >> in;\n buy.push(in);\n }\n\n int cost = 0; // How much must I pay?\n int x = 1; // This is the 'x'th vegetable in the bag.\n while ( ! buy.empty() ) {\n // the 'm'th item in the bag is free!\n if ( x > m-1 ) {\n x = 1;\n }else{\n cost += buy.top();\n ++x;\n }\n buy.pop();\n }\n\n // output\n std::cout << cost << std::endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1232,
"score_of_the_acc": -0.0943,
"final_rank": 5
}
] |
aoj_0232_cpp
|
人生ゲーム
太郎君は、おもちゃ屋さんに会津ホビー社製の人生ゲームを買いに行きました。人生ゲームは、マス目の書かれたボードとルーレットを使って遊びます。ボードには図のようにスタート地点とゴール地点が一つずつあり、それらはひとつながりのマス目でつながっています。最初に、コマはスタート地点のマスに置かれ、ルーレットを回して出た数によってコマを進めます。マスによっては、そこに止まったり通過したりすることでお金を得たり、コマの位置を変えたりするイベントマスがあります。最終的な勝敗は、コマがゴール地点に到達した時点の所持金の多寡で決まります。
この会社の人生ゲームの面白いところは、ルーレットの出る目の大きさ、ゴールまでのマスの数、イベントマスの配置がひとつひとつパッケージごとに異なるところです。それらはケースに書かれており、それを読むことで確認することができます。お金を最も得られる人生ゲームを選びたい太郎君は、得るお金の期待値が一番大きいものを買いたがっています。そこであなたは、太郎君のゲーム選びを手伝うことにしました。
ルーレットは、円周を
X
等分に区分され、それぞれに
V
1
、
V
2
、...、
V
X
という値が記入されているとします。ボードには、0 番、1 番、...、
Y
番と番号がふられたマス目があり、順番につながっています。マス目の中には、イベントマスと呼ばれる特別なマスが
Z
個あり、そこに到達すると特別な動作を行います。イベントマスのマス目の番号は
N
i
で与えられます。イベントマスには 1 ~ 3 の種類 (
E
i
) があり、それぞれ次の動作が行われます。
種類 (
E
i
)
特別動作
値 (
A
i
) の範囲
1
指定の値
A
i
だけ先へ進む
1~10
2
指定の値
A
i
の金額を得る
1~100
3
指定の値
A
i
の金額を支払う
1~100
最初の所持金は 0 円で、第 0 マス目からスタートし、第
Y
マス目に到達するとゴールとなります。ゴールを越えた場合もゴールと見なします。スタートとゴールにイベントは無く、1 マスに複数のイベントが重なることはありません。イベントによって進んだ先のマスのイベントは無視します。所持金が 0 円より少なくなる場合は 0 円とします。
例えば、ある人生ゲームで得られるお金の期待値は以下のように計算できます。
この例では、スタート、イベントマス(100 円入手) 、ゴールの 3 つのマスと、1 か 2 が出るルーレットからなる人生ゲームが表されています。まず、1 回目にルーレットを回した時、1 が出ればイベントマスに到達し、所持金は 100 円になります。一方、2 が出た場合はゴールに到達し、所持金は 0 円のままです。これらはどちらも 2 分の 1 の確率で起こります。
さらに、1 回目でイベントマスに到達した場合は 2 回目のルーレットを回しますが、どの値が出てもゴールに到達し、所持金はどの場合も 100 円です。
このように、全部で 3 通りのゴールの仕方があります。ゴールした時点の所持金に着目すると、0 円になる場合が 1 通りでその確率は 2 分の 1、100 円になる場合が 2 通りでその確率が 4 分の 1 です。この場合、ゴールでの所持金の期待値は、ゴールの仕方ごとの (所持金 × その確率) を足した値であり、この人生ゲームの期待値は 50 円になります。
ルーレットの情報とボードの情報を入力とし、ゴール時の所持金の期待値を出力するプログラムを作成してください。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロみっつの行で示されます。各データセットは以下の形式で与えられます。
X
Y
Z
V
1
V
2
...
V
X
N
1
E
1
A
1
N
2
E
2
A
2
:
N
Z
E
Z
A
Z
X
(1 ≤
X
≤ 4)、
V
i
(1 ≤
V
i
≤ 10)、
Y
(1 ≤
Y
≤ 50)、
N
i
(1 ≤
N
i
≤
Y
-1)、
Z
(0 ≤
Z
≤
Y
-1)、
E
i
(1 ≤
E
i
≤ 3)、
A
i
(1 ≤
A
i
≤ 100) は整数で与えられます。
データセットの数は 100 を超えません。
Output
入力データセットごとに、最終的な所持金の期待値を１行に出力します。なお、所持金の期待値は小数点以下切り捨ての整数で出力してください。
Sample Input
1 2 0
1
1 2 1
1
1 2 100
1 2 1
2
1 2 100
2 2 1
1 2
1 2 100
4 5 3
1 2 3 4
1 1 2
2 2 100
4 3 60
0 0 0
Output for the Sample Input
0
100
0
50
20
|
[
{
"submission_id": "aoj_0232_8892978",
"code_snippet": "#include <iostream>\n\n#include <cstring>\n\nusing namespace std;\n\n\n\n#define rep(i, n) for(int i = 0;i < n;i++)\n\n\n\nint X, Y, Z;\n\nint V[4];\n\nstruct Cell\n\n{\n\n int N, E, A;\n\n};\n\nCell cells[51];\n\n\n\nfloat dp[51][50 * 100];\n\n\n\nint main() {\n\n while(true) {\n\n cin >> X >> Y >> Z;\n\n if(!X && !Y && !Z) break;\n\n\n\n rep(i, X) cin >> V[i];\n\n\n\n memset(cells, 0, sizeof(int) * 3 * (Y + 1));\n\n rep(i, Z) {\n\n Cell cell;\n\n cin >> cell.N >> cell.E >> cell.A;\n\n cells[cell.N] = cell;\n\n }\n\n\n\n rep(i, Y + 1) {\n\n rep(j, 100 * Y) {\n\n dp[i][j] = 0.0;\n\n }\n\n }\n\n dp[0][0] = 1.0;\n\n\n\n rep(i, Y) {\n\n rep(j, 100 * Y) {\n\n if(dp[i][j] == 0.0) continue;\n\n\n\n rep(k, X) {\n\n int money = j, current = i + V[k];\n\n if(current > Y) current = Y;\n\n Cell &cell = cells[current];\n\n switch(cell.E) {\n\n case 1:\n\n current += cell.A;\n\n break;\n\n case 2:\n\n money += cell.A;\n\n break;\n\n case 3:\n\n money -= cell.A;\n\n if(money < 0) money = 0;\n\n break;\n\n }\n\n if(current > Y) current = Y;\n\n dp[current][money] += dp[i][j] / X;\n\n }\n\n }\n\n }\n\n /*\n\n rep(i, Y + 1) {\n\n rep(j, 101) {\n\n cout.width(4);\n\n cout << dp[i][j];\n\n }\n\n cout << endl;\n\n }\n\n */\n\n\n\n float ans = 0.0;\n\n rep(i, 100 * Y) {\n\n ans += dp[Y][i] * i;\n\n }\n\n cout << (int)ans << endl;\n\n }\n\n\n\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4056,
"score_of_the_acc": -0.0433,
"final_rank": 1
},
{
"submission_id": "aoj_0232_6982090",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int X, Y, Z;\n while(cin >> X >> Y >> Z, Y){\n vector<int> V(X);\n vector<array<int,3>> mas(Y + 1, {0, 0, 0});\n for(auto &&v:V)cin >> v;\n int N, E, A;\n while(Z--){\n cin >> N >> E >> A;\n mas[N][--E] += A;\n }\n vector<vector<double>> dp(Y + 1, vector<double>(5001, -1));\n function<double(int,int)> rec = [&](int v, int c){\n if(v >= Y)return double(c);\n if(dp[v][c] != -1)return dp[v][c];\n double res = 0;\n for(auto adv:V){\n res += rec(v + adv + mas[v][0], max(0, c + mas[v][1] - mas[v][2]));\n }\n return dp[v][c] = res / X;\n };\n cout << int(rec(0, 0)) << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5108,
"score_of_the_acc": -0.4688,
"final_rank": 10
},
{
"submission_id": "aoj_0232_6982089",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int X, Y, Z;\n while(cin >> X >> Y >> Z, Y){\n vector<int> V(X);\n vector<array<int,3>> mas(Y + 1, {0, 0, 0});\n for(auto &&v:V)cin >> v;\n int N, E, A;\n while(Z--){\n cin >> N >> E >> A;\n mas[N][--E] += A;\n }\n vector<vector<double>> dp(Y + 1, vector<double>(5001, -1));\n function<double(int,int)> rec = [&](int v, int c){\n if(v >= Y)return double(c);\n if(dp[v][c] != -1)return dp[v][c];\n //if(mas[v][0])return dp[v][c] = rec(v + mas[v][0], c);\n double res = 0;\n for(auto adv:V){\n res += rec(v + adv + mas[v][0], max(0, c + mas[v][1] - mas[v][2]));\n }\n res /= X;\n return dp[v][c] = res;\n };\n cout << int(floor(rec(0, 0))) << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5152,
"score_of_the_acc": -0.4797,
"final_rank": 11
},
{
"submission_id": "aoj_0232_6404621",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <unordered_map>\n\nusing namespace std;\n\nconst int move_forward = 1;\nconst int get_money = 2;\nconst int lose_money = 3;\n\n\nint solve(const vector<pair<int, int>>& c_vec, const vector<int>& v_vec, const int x, const int y) {\n\tvector<unordered_map<int, double>> dp(y + 1);\n\tdouble expected_money = 0.0;\n\n\tdp[0][0] = 1.0;\n\n\tfor (int i = 0; i < y; i++) {\n\t\tfor (const auto &m : dp[i]) {\n\t\t\tint c_money = m.first;\n\t\t\tdouble prob = m.second;\n\t\t\t\n\t\t\tfor (const int& v : v_vec) {\n\t\t\t\tint j = i + v;\n\t\t\t\tint e = -1;\n\t\t\t\tint a = -1;\n\t\t\t\tint n_money = c_money;\n\n\t\t\t\tj = min(j, y);\n\t\t\t\te = c_vec[j].first;\n\t\t\t\ta = c_vec[j].second;\n\n\t\t\t\tif (e == move_forward) {\n\t\t\t\t\tj += a;\n\t\t\t\t\tj = min(j, y);\n\t\t\t\t}\n\t\t\t\telse if (e == get_money) {\n\t\t\t\t\tn_money += a;\n\t\t\t\t}\n\t\t\t\telse if (e == lose_money) {\n\t\t\t\t\tn_money = max(0, n_money - a);\n\t\t\t\t}\n\n\t\t\t\tif (dp[j].count(n_money) == 0) {\n\t\t\t\t\tdp[j][n_money] = prob / x;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tdp[j][n_money] += prob / x;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (auto it = dp[y].begin(); it != dp[y].end(); it++) {\n\t\texpected_money += it->first * it->second;\n\t}\n\n\treturn int(expected_money);\n}\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint z = -1;\n\t\tint v = -1;\n\t\tint n = -1;\n\t\tint e = -1;\n\t\tint a = -1;\n\t\tvector<pair<int, int>> c_vec;\n\t\tvector<int> v_vec;\n\n\t\tif (true) {\n\t\t//if (false) {\n\t\t\tcin >> x >> y >> z;\n\t\t\tif (x == 0 && y == 0 && z == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < x; i++) {\n\t\t\t\tcin >> v;\n\t\t\t\tv_vec.push_back(v);\n\t\t\t}\n\n\t\t\tc_vec.resize(y + 1, pair<int, int>(0, 0));\n\t\t\tfor (int i = 0; i < z; i++) {\n\t\t\t\tcin >> n >> e >> a;\n\t\t\t\tc_vec[n].first = e;\n\t\t\t\tc_vec[n].second = a;\n\t\t\t}\n\t\t}\n\n\t\tcout << solve(c_vec, v_vec, x, y) << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3996,
"score_of_the_acc": -0.2785,
"final_rank": 3
},
{
"submission_id": "aoj_0232_6404620",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n\n\nusing namespace std;\ntypedef long long ll;\n\nconst int move_forward = 1;\nconst int get_money = 2;\nconst int lose_money = 3;\n\n\nll solve(const vector<pair<int, int>>& c_vec, const vector<int>& v_vec, const int x, const int y) {\n\tvector<unordered_map<int, double>> dp(y + 1);\n\tdouble expected_money = 0.0;\n\n\tdp[0][0] = 1.0;\n\n\tfor (int i = 0; i < y; i++) {\n\t\tfor (const auto &m : dp[i]) {\n\t\t\tint c_money = m.first;\n\t\t\tdouble prob = m.second;\n\t\t\t\n\t\t\tfor (const int& v : v_vec) {\n\t\t\t\tint j = i + v;\n\t\t\t\tint e = -1;\n\t\t\t\tint a = -1;\n\t\t\t\tint n_money = c_money;\n\n\t\t\t\tj = min(j, y);\n\t\t\t\te = c_vec[j].first;\n\t\t\t\ta = c_vec[j].second;\n\n\t\t\t\tif (e == move_forward) {\n\t\t\t\t\tj += a;\n\t\t\t\t\tj = min(j, y);\n\t\t\t\t}\n\t\t\t\telse if (e == get_money) {\n\t\t\t\t\tn_money += a;\n\t\t\t\t}\n\t\t\t\telse if (e == lose_money) {\n\t\t\t\t\tn_money = max(0, n_money - a);\n\t\t\t\t}\n\n\t\t\t\tif (dp[j].count(n_money) == 0) {\n\t\t\t\t\tdp[j][n_money] = prob / x;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tdp[j][n_money] += prob / x;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (auto it = dp[y].begin(); it != dp[y].end(); it++) {\n\t\texpected_money += it->first * it->second;\n\t}\n\n\treturn int(expected_money);\n}\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint z = -1;\n\t\tint v = -1;\n\t\tint n = -1;\n\t\tint e = -1;\n\t\tint a = -1;\n\t\tvector<pair<int, int>> c_vec;\n\t\tvector<int> v_vec;\n\n\t\tif (true) {\n\t\t//if (false) {\n\t\t\tcin >> x >> y >> z;\n\t\t\tif (x == 0 && y == 0 && z == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < x; i++) {\n\t\t\t\tcin >> v;\n\t\t\t\tv_vec.push_back(v);\n\t\t\t}\n\n\t\t\tc_vec.resize(y + 1, pair<int, int>(0, 0));\n\t\t\tfor (int i = 0; i < z; i++) {\n\t\t\t\tcin >> n >> e >> a;\n\t\t\t\tc_vec[n].first = e;\n\t\t\t\tc_vec[n].second = a;\n\t\t\t}\n\t\t}\n\t\t//else {\n\t\t//\trandom_device rd;\n\t\t//\t//make_random_data(rd(), x, y, z, c_vec, v_vec);\n\t\t//\tmake_random_data(20220315, x, y, z, c_vec, v_vec);\n\t\t//}\n\n\t\tcout << solve(c_vec, v_vec, x, y) << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3880,
"score_of_the_acc": -0.25,
"final_rank": 2
},
{
"submission_id": "aoj_0232_5404546",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n while(1){\n int x,y,z;\n cin >> x >> y >> z;\n if(x == 0) break;\n\n vector<int> v(x);\n for(int i=0; i<x; i++){\n cin >> v[i];\n }\n vector<int> e(y+1, 0), a(y+1, 0);\n for(int i=0; i<z; i++){\n int idx;\n cin >> idx;\n cin >> e[idx] >> a[idx];\n }\n\n vector<vector<double>> dp(y+1, vector<double>(z*100+1, 0));\n dp[0][0] = 1;\n for(int i=0; i<y; i++){\n for(int j: v){\n int pos = min(i+j, y);\n int add = 0;\n if(e[pos] == 1){\n pos = min(pos+a[pos], y);\n }else if(e[pos] == 2){\n add += a[pos];\n }else if(e[pos] == 3){\n add -= a[pos];\n }\n for(int k=0; k<z*100+1; k++){\n int money = max(k+add, 0);\n if(money > z*100) continue;\n dp[pos][money] += dp[i][k]/x;\n }\n }\n }\n double ans = 0;\n for(int k=0; k<=z*100; k++){\n ans += dp[y][k]*k;\n }\n cout << (int)(ans+1e-5) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 5024,
"score_of_the_acc": -0.6148,
"final_rank": 12
},
{
"submission_id": "aoj_0232_4955341",
"code_snippet": "#include \"bits/stdc++.h\"\n#define int long long\n#define rep(i, n) for (int i = 0; i < (int)(n); i++) // [0, b)\n#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) // [a, b)\n#define rep3(i, a, b) for (int i = (int)(a); i >= (int)(b); i--) // reversed [a, b] so [b, b-1, ... a]\n#define FOR(i, a) for (auto &i: a)\n#define ALL(obj) begin(obj), end(obj)\n#define MAX(x) *max_element(ALL(x))\n#define MIN(x) *min_element(ALL(x))\n#define SUM(x) accumulate(ALL(x), 0LL)\n#define LOWER_BOUND(A, key) distance(A.begin(), lower_bound(ALL(A), key))\n#define UPPER_BOUND(A, key) distance(A.begin(), upper_bound(ALL(A), key))\n\nusing namespace std;\nconst int MOD = (int)(1e9 + 7);\nconst int INF = (int)(1e13 + 7);\nconst double EPS = 1e-14;\nconst double PI = acos(-1);\n\nint CEIL(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); } //ceil() for int\nint mod(int a, int b) { return a >= 0 ? a % b : a - (b * CEIL(a, b)); } //always return positive num\nint pow_mod(int a, int b) { //return x^y in order(log(y))\n int res = 1;\n for (a %= MOD; b; a = a * a % MOD, b >>= 1)\n if (b & 1) res = res * a % MOD;\n return res;\n}\n\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while (1) {\n int X, Y, Z;\n cin >> X >> Y >> Z;\n if (X == 0) break;\n vector<int> V(X);\n rep(i, X) cin >> V[i];\n vector<vector<double>> dp(Y + 10, vector<double>(5000 + 100, 0));\n vector<vector<double>> NEA(Y + 10, vector<double>{});\n rep(i, Z) {\n int N;\n double E, A;\n cin >> N >> E >> A;\n NEA[N] = {E, A};\n }\n dp[0][0] = 1;\n rep(i, Y) {\n rep(j, 5000 + 10) {\n FOR(k, V) {\n if (dp[i][j] != 0) {\n int to = min(i + k, Y);\n if (NEA[to].size()) {\n int E = NEA[to][0];\n int A = NEA[to][1];\n if (E == 1) {\n dp[min(Y, to + A)][j] += dp[i][j] / (double)X;\n } else if (E == 2) {\n dp[to][j + A] += dp[i][j] / (double)X;\n } else {\n dp[to][max(j - A, 0LL)] += dp[i][j] / (double)X;\n }\n } else {\n dp[to][j] += dp[i][j] / (double)X;\n }\n }\n }\n }\n }\n double ans = 0;\n rep(i, 5000 + 10) {\n ans += dp[Y][i] * (double)i;\n }\n cout << (int)(floor(ans)) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 5556,
"score_of_the_acc": -0.9124,
"final_rank": 14
},
{
"submission_id": "aoj_0232_4955337",
"code_snippet": "#include \"bits/stdc++.h\"\n#define int long long\n#define rep(i, n) for (int i = 0; i < (int)(n); i++) // [0, b)\n#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) // [a, b)\n#define rep3(i, a, b) for (int i = (int)(a); i >= (int)(b); i--) // reversed [a, b] so [b, b-1, ... a]\n#define FOR(i, a) for (auto &i: a)\n#define ALL(obj) begin(obj), end(obj)\n#define MAX(x) *max_element(ALL(x))\n#define MIN(x) *min_element(ALL(x))\n#define SUM(x) accumulate(ALL(x), 0LL)\n#define LOWER_BOUND(A, key) distance(A.begin(), lower_bound(ALL(A), key))\n#define UPPER_BOUND(A, key) distance(A.begin(), upper_bound(ALL(A), key))\n\nusing namespace std;\nconst int MOD = (int)(1e9 + 7);\nconst int INF = (int)(1e13 + 7);\nconst double EPS = 1e-14;\nconst double PI = acos(-1);\n\nint CEIL(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); } //ceil() for int\nint mod(int a, int b) { return a >= 0 ? a % b : a - (b * CEIL(a, b)); } //always return positive num\nint pow_mod(int a, int b) { //return x^y in order(log(y))\n int res = 1;\n for (a %= MOD; b; a = a * a % MOD, b >>= 1)\n if (b & 1) res = res * a % MOD;\n return res;\n}\n\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while (1) {\n int X, Y, Z;\n cin >> X >> Y >> Z;\n if (X == 0) break;\n vector<int> V(X);\n rep(i, X) cin >> V[i];\n vector<vector<double>> dp(Y + 10, vector<double>(5000 + 100, 0));\n vector<vector<double>> dp2(Y + 10, vector<double>(5000 + 100, 0));\n vector<vector<double>> NEA(Y + 10, vector<double>{});\n rep(i, Z) {\n int N;\n double E, A;\n cin >> N >> E >> A;\n NEA[N] = {E, A};\n }\n dp[0][0] = 1;\n rep(i, Y) {\n rep(j, 5000 + 10) {\n FOR(k, V) {\n if (dp[i][j] != 0) {\n int to = min(i + k, Y);\n if (NEA[to].size()) {\n int E = NEA[to][0];\n int A = NEA[to][1];\n if (E == 1) {\n dp[min(Y, to + A)][j] += dp[i][j] / (double)X;\n } else if (E == 2) {\n dp[to][j + A] += dp[i][j] / (double)X;\n } else {\n dp[to][max(j - A, 0LL)] += dp[i][j] / (double)X;\n }\n } else {\n dp[to][j] += dp[i][j] / (double)X;\n }\n }\n }\n }\n }\n rep(j, 5000 + 10) {\n dp[Y][j] += dp2[Y][j];\n }\n double ans = 0;\n rep(i, 5000 + 10) {\n ans += dp[Y][i] * (double)i;\n }\n cout << (int)(floor(ans)) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 7884,
"score_of_the_acc": -1.5686,
"final_rank": 20
},
{
"submission_id": "aoj_0232_4955282",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n#define LOCAL\nusing namespace std;\n//using namespace atcoder;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing ll = long long;\n//#define int long long\nusing P = pair<int,int>;\nusing P3 = pair<int,P>;\n//#########################################\nint x,y,z;\nvoid solve(){\n vector<vector<double>> dp(55,vector<double>(55*100));\n vector<int> v(x);\n rep(i,x)cin >> v[i];\n vector<P> res(55,P(-1,-1));\n rep(i,z){\n int n,e,a;cin >> n >> e >> a;\n // n--;\n res[n] = P(e,a);\n }\n dp[0][0] = 1;\n double mul = 1.0;\n rep(i,y)rep(j,55*100){\n // dp[i] = max(dp[i],0.0);\n mul /= (double)x;\n rep(masu,x){\n int next = i + v[masu];\n double val = 0;\n if(res[next].first == 1){\n next = next + res[next].second;\n dp[min(y,next)][j] += dp[i][j]/(double)x;\n continue;\n }\n else if(res[next].first == 2){\n val = (double)res[next].second;\n }\n else if(res[next].first == 3){\n val = -(double)res[next].second;\n }\n if(j+(int)val < 55*100)dp[min(y,next)][max(0,j+(int)val)] += dp[i][j]/(double)x;\n }\n }\n double tmp = 0;\n rep(i,55*100)tmp += dp[y][i]*(double)i;\n int ret = tmp/1;\n cout << ret << \"\\n\";\n}\nint main(){\n while(1){\n cin >> x >> y >> z;\n if(x == 0 && y == 0 && z == 0)return 0;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 5456,
"score_of_the_acc": -1.3878,
"final_rank": 18
},
{
"submission_id": "aoj_0232_4955102",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\ndouble dp[100][5000];\nint n, m, K, p[100], q[100], d[100], a, b, c;\n\nint main() {\n\twhile (1) {\n\t\trep(i,100){\n\t\t\tp[i] = 0; q[i] = 0;\n\t\t\trep(j,5000) dp[i][j] = 0;\n\t\t}\n\t\tcin>>n>>m>>K; if(n == 0) break;\n\n\t\trep(i,n) cin>>d[i];\n\t\trep(i,K){\n\t\t\tcin>>a>>b>>c; p[a] = b; q[a] = c;\n\t\t}\n\n\t\tdp[0][0] = 1;\n\t\trep(i,m){\n\t\t\trep(j,5000){\n\t\t\t\tif (dp[i][j] == 0.0)continue;\n\n\t\t\t\trep(k,n){\n\t\t\t\t\tint to = min(i + d[k], m);\n\t\t\t\t\tif (p[to] == 0)dp[to][j] += dp[i][j] / n;\n\t\t\t\t\tif (p[to] == 1)dp[min(to + q[to], m)][j] += dp[i][j] / n;\n\t\t\t\t\tif (p[to] == 2)dp[to][j + q[to]] += dp[i][j] / n;\n\t\t\t\t\tif (p[to] == 3)dp[to][max(j - q[to], 0)] += dp[i][j] / n;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdouble ans = 0;\n\t\tfor (int i = 0; i < 5000; i++) ans += i*dp[m][i];\n\t\tcout << int(ans) << '\\n';\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 6996,
"score_of_the_acc": -0.8501,
"final_rank": 13
},
{
"submission_id": "aoj_0232_4507048",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint X, Y, Z;\nint V[4],EventInfo[51][2];\ndouble DpMoney[4901][51];\n\n\nvoid solve() {\n\tint currentNode, currentMoney;\n\n\tDpMoney[0][0] = 1.0;\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < 4901; ++j) {\n\t\t\tif (DpMoney[j][i] == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int k = 0; k < X; ++k) {\t\n\t\t\t\tcurrentNode = min(Y, i + V[k]);\n\t\t\t\tcurrentMoney = j;\n\t\t\t\tswitch (EventInfo[currentNode][0]) {\n\t\t\t\t\tcase 1:currentNode = min(Y, currentNode + EventInfo[currentNode][1]); break;\n\t\t\t\t\tcase 2:currentMoney += EventInfo[currentNode][1]; break;\n\t\t\t\t\tcase 3:currentMoney = max(0, currentMoney - EventInfo[currentNode][1]); break;\n\t\t\t\t\tdefault:break;\n\t\t\t\t}\n\t\t\t\tDpMoney[currentMoney][currentNode] += DpMoney[j][i] / X;\n\t\t\t}\n\t\t}\n\t}\n\n}\n\nint main() {\n\tint n, e, a;\n\tdouble total;\n\n\twhile (cin >> X >> Y >> Z, X) {\n\t\tfor (int i = 0; i < X; ++i) {\n\t\t\tcin >> V[i];\n\t\t}\n\t\tmemset(EventInfo, 0, sizeof(EventInfo));\n\t\tfor (int i = 0; i < Z; ++i) {\n\t\t\tcin >> n >> e >> a;\n\t\t\tEventInfo[n][0] = e;\n\t\t\tEventInfo[n][1] = a;\n\t\t}\n\t\tmemset(DpMoney, 0, sizeof(DpMoney));\n\t\tsolve();\n\t\ttotal = 0;\n\t\tfor (int i = 0; i < 4901; ++i) {\n\t\t\ttotal += i*DpMoney[i][Y];\n\t\t}\n\t\tcout << (int)total << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4936,
"score_of_the_acc": -0.3432,
"final_rank": 5
},
{
"submission_id": "aoj_0232_4507047",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint X, Y, Z;\nint V[4],EventInfo[51][2];\ndouble DpMoney[5000][51];\n\n\nvoid solve() {\n\tint currentNode, currentMoney;\n\n\tDpMoney[0][0] = 1.0;\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < 5000; ++j) {\n\t\t\tif (DpMoney[j][i] == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int k = 0; k < X; ++k) {\t\n\t\t\t\tcurrentNode = min(Y, i + V[k]);\n\t\t\t\tcurrentMoney = j;\n\t\t\t\tswitch (EventInfo[currentNode][0]) {\n\t\t\t\t\tcase 1:currentNode = min(Y, currentNode + EventInfo[currentNode][1]); break;\n\t\t\t\t\tcase 2:currentMoney += EventInfo[currentNode][1]; break;\n\t\t\t\t\tcase 3:currentMoney = max(0, currentMoney - EventInfo[currentNode][1]); break;\n\t\t\t\t\tdefault:break;\n\t\t\t\t}\n\t\t\t\tDpMoney[currentMoney][currentNode] += DpMoney[j][i] / X;\n\t\t\t}\n\t\t}\n\t}\n\n}\n\nint main() {\n\tint n, e, a;\n\tdouble total;\n\n\twhile (cin >> X >> Y >> Z, X) {\n\t\tfor (int i = 0; i < X; ++i) {\n\t\t\tcin >> V[i];\n\t\t}\n\t\tmemset(EventInfo, 0, sizeof(EventInfo));\n\t\tfor (int i = 0; i < Z; ++i) {\n\t\t\tcin >> n >> e >> a;\n\t\t\tEventInfo[n][0] = e;\n\t\t\tEventInfo[n][1] = a;\n\t\t}\n\t\tmemset(DpMoney, 0, sizeof(DpMoney));\n\t\tsolve();\n\t\ttotal = 0;\n\t\tfor (int i = 0; i < 5000; ++i) {\n\t\t\ttotal += i*DpMoney[i][Y];\n\t\t}\n\t\tcout << (int)total << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4992,
"score_of_the_acc": -0.357,
"final_rank": 7
},
{
"submission_id": "aoj_0232_4507040",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint X, Y, Z;\nint V[4],EventInfo[51][2];\ndouble DpMoney[5001][51];\n\n\nvoid solve() {\n\tint currentNode, currentMoney;\n\n\tDpMoney[0][0] = 1.0;\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < 5001; ++j) {\n\t\t\tif (DpMoney[j][i] == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int k = 0; k < X; ++k) {\t\n\t\t\t\tcurrentNode = min(Y, i + V[k]);\n\t\t\t\tcurrentMoney = j;\n\t\t\t\tswitch (EventInfo[currentNode][0]) {\n\t\t\t\t\tcase 1:currentNode = min(Y, currentNode + EventInfo[currentNode][1]); break;\n\t\t\t\t\tcase 2:currentMoney += EventInfo[currentNode][1]; break;\n\t\t\t\t\tcase 3:currentMoney = max(0, currentMoney - EventInfo[currentNode][1]); break;\n\t\t\t\t\tdefault:break;\n\t\t\t\t}\n\t\t\t\tDpMoney[currentMoney][currentNode] += DpMoney[j][i] / X;\n\t\t\t}\n\t\t}\n\t}\n\n}\n\nint main() {\n\tint n, e, a;\n\tdouble total;\n\n\twhile (cin >> X >> Y >> Z, X) {\n\t\tfor (int i = 0; i < X; ++i) {\n\t\t\tcin >> V[i];\n\t\t}\n\t\tmemset(EventInfo, 0, sizeof(EventInfo));\n\t\tfor (int i = 0; i < Z; ++i) {\n\t\t\tcin >> n >> e >> a;\n\t\t\tEventInfo[n][0] = e;\n\t\t\tEventInfo[n][1] = a;\n\t\t}\n\t\tmemset(DpMoney, 0, sizeof(DpMoney));\n\t\tsolve();\n\t\ttotal = 0;\n\t\tfor (int i = 0; i < 5001; ++i) {\n\t\t\ttotal += i*DpMoney[i][Y];\n\t\t}\n\t\tcout << (int)total << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5008,
"score_of_the_acc": -0.3609,
"final_rank": 8
},
{
"submission_id": "aoj_0232_4472486",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nbool solve(){\n int x, y, z;\n cin >> x >> y >> z;\n if(!x) return 0;\n vector<int> v(x);\n for (auto &&i : v) scanf(\"%d\", &i);\n vector<pair<int, int>> event(y+1);\n for (int i = 0; i < z; ++i) {\n int n, e, a;\n cin >> n >> e >> a;\n event[n] = {e, a};\n }\n auto dp = make_v(y+1, z*100+1, 0.0);\n int mx = 0;\n dp[0][0] = 1.0;\n for (int i = 0; i < y; ++i) {\n int maxx = mx;\n for (int j = 0; j <= mx; ++j) {\n for (int k = 0; k < x; ++k) {\n int ii = min(y, i+v[k]), jj = j;\n if(event[ii].first == 1){\n ii = min(y, ii+event[ii].second);\n }else if(event[ii].first == 2){\n jj += event[ii].second;\n maxx = max(maxx, jj);\n }else if(event[ii].first == 3){\n jj = max(0, jj-event[ii].second);\n }\n dp[ii][jj] += dp[i][j]/x;\n }\n }\n mx = maxx;\n }\n double ans = 0;\n for (int i = 0; i <= mx; ++i) {\n ans += i*dp.back()[i];\n }\n printf(\"%.0lf\\n\", floor(ans));\n return 1;\n}\n\nint main() {\n while(solve());\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5044,
"score_of_the_acc": -0.4531,
"final_rank": 9
},
{
"submission_id": "aoj_0232_4093354",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint X, Y, Z;\nint V[10];\nint e_flag[55], e_value[55];\ndouble dp[55][5500];\n\nint main() {\n while (true) {\n cin >> X >> Y >> Z;\n \n if (X==0 && Y==0 && Z==0) {\n break;\n }\n \n for (int i=0; i<X; i++) {\n cin >> V[i];\n }\n \n for (int i=0; i<=Y; i++) {\n e_flag[i] = -1;\n }\n \n for (int i=0; i<Z; i++) {\n int Ni, Ei, Ai; cin >> Ni >> Ei >> Ai;\n e_flag[Ni] = Ei;\n e_value[Ni] = Ai;\n }\n \n for (int i=0; i<55; i++) {\n for (int j=0; j<5500; j++) {\n dp[i][j] = 0;\n }\n }\n \n dp[0][0] = 1;\n \n for (int i=0; i<Y; i++) {\n for (int j=0; j<5500; j++) {\n for (int k=0; k<X; k++) {\n int to = i+V[k];\n \n if (to>Y) {\n to = Y;\n }\n \n if (e_flag[to]==-1) {\n dp[to][j] += dp[i][j]/X;\n }\n else if (e_flag[to]==1) {\n to += e_value[to];\n \n if (to>Y) {\n to = Y;\n }\n \n dp[to][j] += dp[i][j]/X;\n }\n else if (e_flag[to]==2 && j+e_value[to]<5500) {\n dp[to][j+e_value[to]] += dp[i][j]/X;\n }\n else if (e_flag[to]==3) {\n dp[to][max(0, j-e_value[to])] += dp[i][j]/X;\n }\n }\n }\n }\n \n double ans = 0;\n \n for (int i=0; i<5500; i++) {\n ans += dp[Y][i]*i;\n }\n \n cout << (int)ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 5452,
"score_of_the_acc": -1.2201,
"final_rank": 17
},
{
"submission_id": "aoj_0232_4093335",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint X, Y, Z;\nint V[10];\nint e_flag[55], e_value[55];\ndouble dp[70][5500];\n\nint main() {\n while (true) {\n cin >> X >> Y >> Z;\n \n if (X==0 && Y==0 && Z==0) {\n break;\n }\n \n for (int i=0; i<X; i++) {\n cin >> V[i];\n }\n \n for (int i=0; i<Y; i++) {\n e_flag[i] = -1;\n }\n \n for (int i=0; i<Z; i++) {\n int Ni, Ei, Ai; cin >> Ni >> Ei >> Ai;\n e_flag[Ni] = Ei;\n e_value[Ni] = Ai;\n }\n \n for (int i=0; i<70; i++) {\n for (int j=0; j<5500; j++) {\n dp[i][j] = 0;\n }\n }\n \n dp[0][0] = 1;\n \n for (int i=0; i<Y; i++) {\n for (int j=0; j<5500; j++) {\n for (int k=0; k<X; k++) {\n int to = i+V[k];\n \n if (to>=Y || e_flag[to]==-1) {\n dp[to][j] += dp[i][j]/X;\n }\n else if (e_flag[to]==1) {\n to += e_value[to];\n dp[to][j] += dp[i][j]/X;\n }\n else if (e_flag[to]==2 && j+e_value[to]<5500) {\n dp[to][j+e_value[to]] += dp[i][j]/X;\n }\n else if (e_flag[to]==3) {\n dp[to][max(0, j-e_value[to])] += dp[i][j]/X;\n }\n }\n }\n }\n \n double ans = 0;\n \n for (int i=Y; i<70; i++) {\n for (int j=0; j<5500; j++) {\n ans += j*dp[i][j];\n }\n }\n \n cout << (int)ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 6048,
"score_of_the_acc": -1.4501,
"final_rank": 19
},
{
"submission_id": "aoj_0232_3730049",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int x, y, z, v[4], a[55], b[55];\n while(cin >> x >> y >> z, x){\n for(int i=0;i<x;i++){\n cin >> v[i];\n }\n fill(a,a+y+1,0);\n fill(b,b+y+1,0);\n for(int i=0;i<z;i++){\n int n, e, w;\n cin >> n >> e >> w;\n if(e==1){\n b[n] = w;\n }\n else if(e==2){\n a[n] = w;\n }\n else{\n a[n] = -w;\n }\n }\n double dp[55][5005]{};\n dp[0][0] = 1;\n for(int i=0;i<y;i++){\n for(int j=0;j<=5000;j++){\n for(int k=0;k<x;k++){\n int ni = min(i+v[k], y);\n int nj = max(j+a[ni], 0);\n ni = min(ni+b[ni], y);\n dp[ni][nj] += dp[i][j]/x;\n }\n }\n }\n double ans = 0;\n for(int i=0;i<=5000;i++){\n ans += dp[y][i]*i;\n }\n cout << int(ans) << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 5248,
"score_of_the_acc": -1.0866,
"final_rank": 16
},
{
"submission_id": "aoj_0232_3422863",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n int x, y, z;\n while(cin >> x >> y >> z, x+y+z){\n vector<int> v(x);\n for(int i = 0; i < x; i++) cin >> v[i];\n vector<int> e(y+1, 0), a(y+1, 0);\n for(int i = 0; i < z; i++){\n int n; cin >> n;\n cin >> e[n] >> a[n];\n }\n vector<vector<double>> dp(y+1, vector<double>(5001, 0));\n dp[0][0] = 1.0;\n for(int i = 0; i < y; i++){\n for(int j = 0; j < 5001; j++){\n if(dp[i][j] == 0.0) continue;\n for(int k = 0; k < x; k++){\n int ni = i+v[k], nj = j;\n if(ni > y) ni = y;\n if(e[ni] == 1) ni = min(y, ni+a[ni]);\n else if(e[ni] == 2) nj += a[ni];\n else if(e[ni] == 3) nj = max(0, nj-a[ni]);\n dp[ni][nj] += dp[i][j] / x;\n }\n }\n }\n double ans = 0;\n for(int i = 0; i < 5001; i++) ans += dp[y][i]*i;\n cout << (int)ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4928,
"score_of_the_acc": -0.3412,
"final_rank": 4
},
{
"submission_id": "aoj_0232_3354609",
"code_snippet": "#include <bits/stdc++.h>\n\n#define fst(t) std::get<0>(t)\n#define snd(t) std::get<1>(t)\n#define thd(t) std::get<2>(t)\n#define unless(p) if(!(p))\n#define until(p) while(!(p))\n\nusing ll = std::int64_t;\nusing P = std::tuple<int,int>;\n\nint X, Y, Z;\nint V[10];\nP event[100];\ndouble dp[100][6000];\n\ndouble rec(int p, int m){\n if(p >= Y){\n return m;\n }\n\n if(dp[p][m] >= 0){\n return dp[p][m];\n }\n\n double ev = 0;\n\n for(int i=0;i<X;++i){\n int np = p + V[i];\n\n int e, a;\n std::tie(e, a) = event[np];\n\n if(e == -1){\n ev += 1. / X * rec(np, m);\n }else if(e == 1){\n ev += 1. / X * rec(np + a, m);\n }else if(e == 2){\n ev += 1. / X * rec(np, m + a);\n }else if(e == 3){\n ev += 1. / X * rec(np, std::max(m - a, 0));\n }\n }\n\n return dp[p][m] = ev;\n}\n\nint main(){\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n while(true){\n std::cin >> X >> Y >> Z;\n\n if(X == 0){\n break;\n }\n\n for(int i=0;i<X;++i){\n std::cin >> V[i];\n }\n\n std::fill(event, event + 100, std::make_tuple(-1, -1));\n\n for(int i=0;i<Z;++i){\n int N, E, A;\n std::cin >> N >> E >> A;\n\n event[N] = std::make_tuple(E, A);\n }\n\n std::fill(&dp[0][0], &dp[0][0] + 100 * 6000, -1);\n\n double ev = rec(0, 0);\n std::cout << floor(ev) << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7944,
"score_of_the_acc": -1,
"final_rank": 15
},
{
"submission_id": "aoj_0232_3323311",
"code_snippet": "#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\n#define FOE(i,a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT_ON(bit, i) (bit & (1LL << i))\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());\n\ntypedef long long LL;\ntemplate<typename T> using V = std::vector<T>;\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\ntemplate<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;\n\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \" \";} std::cout << v[i];} std::cout << \"\\n\"; }\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\n\nconst int INF = 1L << 30;\nconst double EPS = 1e-9;\nconst std::string YES = \"YES\", Yes = \"Yes\", NO = \"NO\", No = \"No\";\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\n\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (true) {\n int X, Y, Z;\n cin >> X >> Y >> Z;\n if (X + Y + Z == 0) {\n break;\n }\n\n V<int> v(X), E(Y + 1), A(Y + 1);\n FOR(i, 0, X) {\n cin >> v[i];\n }\n FOR(i, 0, Z) {\n int n;\n cin >> n;\n cin >> E[n] >> A[n];\n }\n\n VV<double> dp(Y + 1, V<double>(5001, 0));\n dp[0][0] = 1.0;\n\n double ans = 0.0;\n FOR(p, 0, Y + 1) {\n FOR(m, 0, 5001) {\n if (dp[p][m] == 0) {\n continue;\n }\n\n FOR(k, 0, X) {\n int next_p = p + v[k];\n\n // ゴール\n if (next_p >= Y or (E[next_p] == 1 and next_p + A[next_p] >= Y)) {\n ans += m * dp[p][m] * (1.0 / X);\n }\n // forward\n else if (E[next_p] == 1) {\n dp[next_p + A[next_p]][m] += dp[p][m] * (1.0 / X);\n }\n // get money\n else if (E[next_p] == 2) {\n dp[next_p][m + A[next_p]] += dp[p][m] * (1.0 / X);\n }\n // lost money\n else if (E[next_p] == 3) {\n dp[next_p][max(0, m - A[next_p])] += dp[p][m] * (1.0 / X);\n }\n else {\n dp[next_p][m] += dp[p][m] * (1.0 / X);\n }\n }\n }\n }\n print(int(ans));\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4984,
"score_of_the_acc": -0.355,
"final_rank": 6
}
] |
aoj_0231_cpp
|
危ない橋
会津若松市よりずっと北に位置する会津古松村では、「ヤ橋(やばし) 」と呼ばれる橋が周辺の村へ移動する唯一の手段となっています。その橋は通行人が多いにも関わらず、今にも壊れそうなほど老朽化が進んでしまっています。
ヤ橋は 150 [kg] まで耐えられる強度を持っています。例えば、80 [kg] の人と 50 [kg] の人が同時に渡ることはできますが、80 [kg] の人が渡っているときに 90 [kg] の人が渡り始めると、ヤ橋は壊れてしまいます。
もしヤ橋が壊れてしまったら、会津古松村の人々は周辺の村へ移動する手段を失ってしまいます。そこで、村で唯一のプログラマーであるあなたは、村民の生活を守るために、橋の渡り方から橋が壊れるか否かを判定するプログラムを作成することにしました。
橋を渡る通行人の人数
n
(1 ≤
n
≤ 100)、各通行人の体重
m
i
(1 ≤
m
i
≤ 100)、橋を渡り始める時刻
a
i
、渡り終える時刻
b
i
(0 ≤
a
i
,
b
i
< 2
31
) を入力とし、橋が壊れない場合は“OK ”と出力し、壊れる場合は“NG ”と出力するプログラムを作成してください。なお、橋の上にいる通行人の体重の総和が 150 [kg] を超えてしまうとヤ橋は壊れてしまいます。また、
a
i
の時点で通行人は橋の上にいますが、
b
i
の時点では橋の上にいません。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
n
m
1
a
1
b
1
m
2
a
2
b
2
:
m
n
a
n
b
n
データセットの数は 1200 を超えません。
Output
入力データセットごとに、橋が壊れるか否かを1行に出力します。
Sample Input
3
80 0 30
50 5 25
90 27 50
3
80 0 30
70 5 25
71 30 50
0
Output for the Sample Input
NG
OK
|
[
{
"submission_id": "aoj_0231_5155154",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<iomanip>\n#include <string>\n#include <math.h>\nusing namespace std;\nint main(){\n long long int n,m=0;\n string ans=\"OK\";\n cin>>n;\n while(n!=0){\n m=0;\n ans=\"OK\";\n vector<pair<long long int,long long int>> a(100000);\n for(int i=0;i<n;i++){\n cin>>a[2*i].second>>a[2*i].first>>a[2*i+1].first;\n a[2*i+1].second=-a[2*i].second;\n }\n sort(a.begin(),a.begin()+2*n);\n for(int i=0;i<2*n;i++){\n m+=a[i].second;\n if(m>150){\n ans=\"NG\";\n }\n }\n cout<<ans<<endl;\n cin>>n;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4672,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0231_1978797",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <utility>\n\nint n;\nstd::pair<unsigned int, int> arr[210];\n\nint main() {\n while(std::cin >> n, n) {\n int m, a, b;\n for(int i = 0; i < n; ++i) {\n std::cin >> m >> a >> b;\n\n arr[i * 2] = std::make_pair(a, m);\n arr[i * 2 + 1] = std::make_pair(b, -m);\n }\n\n std::sort(arr, arr + n * 2);\n\n int w = 0;\n bool ok = true;\n for(int i = 0; i < n * 2; ++i) {\n w += arr[i].second;\n\n if(w > 150) {\n ok = false;\n break;\n }\n }\n\n std::cout << (ok ? \"OK\" : \"NG\") << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0231_1800744",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nlong long a[100],b[100],cha[200];\nint main(){\n\tint n,m[100];\n\twhile(true){\n\tcin>>n;\n\tif(n==0)break;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>m[i]>>a[i]>>b[i];\n\t\tcha[i*2]=a[i],cha[i*2+1]=b[i];\n\t}\n\tsort(cha,cha+n*2);\n\tbool ok=true;\n\tint w=0,bef=-1;\n\tfor(int i=0;i<n*2;i++){\n\t\tif(bef!=cha[i]){\n\t\tfor(int j=0;j<n;j++){\n\t\tif(cha[i]==a[j])\n\t\t\tw+=m[j];\n\t\tif(cha[i]==b[j])\n\t\t\tw-=m[j];\n\t\t}\n\t\t}\n\t\tbef=cha[i];\n\t\tif(w>150)\n\t\t\tok=false;\n\t}\n\tif(ok)cout<<\"OK\"<<endl;\n\telse cout<<\"NG\"<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1184,
"score_of_the_acc": -0.008,
"final_rank": 4
},
{
"submission_id": "aoj_0231_1759650",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nvector<int>vec;\nint N, x[1000], y[1000], w[1000];\nint main() {\n\twhile (true) {\n\t\tvec.clear();\n\t\tcin >> N;\n\t\tif (N == 0) { break; }\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> w[i] >> x[i] >> y[i];\n\t\t\tint ok1 = 1, ok2 = 1;\n\t\t\tfor (int j = 0; j < vec.size(); j++) {\n\t\t\t\tif (vec[i] == x[i]) { ok1 = 0; }\n\t\t\t\tif (vec[i] == y[i]) { ok2 = 0; }\n\t\t\t}\n\t\t\tif (ok1 == 1) { vec.push_back(x[i]); }\n\t\t\tif (ok2 == 1) { vec.push_back(y[i]); }\n\t\t}\n\t\tsort(vec.begin(), vec.end());\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < vec.size(); j++) {\n\t\t\t\tif (vec[j] == x[i]) { x[i] = j; break; }\n\t\t\t}\n\t\t\tfor (int j = 0; j < vec.size(); j++) {\n\t\t\t\tif (vec[j] == y[i]) { y[i] = j; break; }\n\t\t\t}\n\t\t}\n\t\tint W = 0; int ok = 1;\n\t\tfor (int i = 0; i < vec.size(); i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (x[j] == i) { W += w[j]; }\n\t\t\t\tif (y[j] == i) { W -= w[j]; }\n\t\t\t}\n\t\t\tif (W > 150) { ok = 0; }\n\t\t}\n\t\tif (ok == 1) { cout << \"OK\" << endl; }\n\t\tif (ok == 0) { cout << \"NG\" << endl; }\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1224,
"score_of_the_acc": -0.0193,
"final_rank": 19
},
{
"submission_id": "aoj_0231_1724378",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define mp make_pair\n#define pb push_back\n#define fr first\n#define sc second\n#define Rep(i,n) for(int i=0;i<(n);i++)\n#define Rrep(i, m, n) for(int i=(m);i<(n);i++)\n#define All(v) v.begin(),v.end()\n#define Uniq(v) v.erase(unique(All(v)),v.end())\ntypedef pair<int, int> Pii;\ntypedef pair<int, Pii> Pip;\ntypedef pair<string, int> Psi;\ntypedef vector<int> Vi;\nconst int INF = (1<<30);\nconst int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};\n\nint main()\n{\n int n;\n\n while( cin >> n, n ) {\n vector<Pip> v;\n bool flag = false;\n\n Rep(i, n) {\n int m, a, b;\n cin >> m >> a >> b;\n v.pb(Pip(a, Pii(b, m)));\n }\n sort(All(v));\n \n Rep(i, n) {\n Pip p = v[i];\n int m = p.sc.sc, a = p.fr, b = p.sc.fr;\n int sum = m;\n \n Rep(j, i) {\n\tPip p_ = v[j];\n\tint m_ = p_.sc.sc, a_ = p_.fr, b_ = p_.sc.fr;\n\tif( b_ > a ) {\n\t sum += m_;\n\t}\n }\n \n if( sum > 150 ) {\n\tflag = true;\n }\n }\n\n if( flag ) cout << \"NG\" << endl;\n else cout << \"OK\" << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0091,
"final_rank": 5
},
{
"submission_id": "aoj_0231_1573682",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <functional>\n#include <queue>\n#include <set>\n#include <map>\n#include <numeric>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <cctype>\n\n#define rep(i, a) REP(i, 0, a)\n#define REP(i, a, b) for(int i = a; i < b; ++i)\n#define repll(i, a) REPLL(i, 0, a)\n#define REPLL(i, a, b) for(ll i = a; i < b; ++i)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef std::pair<int, int> P;\ntypedef std::pair<P, int> PP;\nconst double PI = 3.14159265358979323846;\nconst double esp = 1e-9;\nconst int infi = (int)1e+9 + 10;\nconst ll infll = (ll)1e+17 + 10;\n\nint n;\nstd::map<int, int> ind;\nint dat[101], s[101], e[101];\nint calc[105];\n\nint main(){\n\twhile (std::cin >> n, n){\n\t\tind.clear();\n\t\tmemset(dat, 0, sizeof(dat));\n\t\tmemset(s, 0, sizeof(s));\n\t\tmemset(e, 0, sizeof(e));\n\t\tmemset(calc, 0, sizeof(calc));\n\t\trep(i, n){\n\t\t\tstd::cin >> dat[i] >> s[i] >> e[i];\n\t\t\tind[s[i]] = 0;\n\t\t\tind[e[i]] = 0;\n\t\t}\n\n\t\tint cnt = 0;\n\t\tfor (auto it = ind.begin(); it != ind.end(); ++it){\n\t\t\tit->second = cnt;\n\t\t\t++cnt;\n\t\t}\n\n\t\trep(i, n){\n\t\t\tcalc[ind[s[i]]] += dat[i];\n\t\t\tcalc[ind[e[i]]] -= dat[i];\n\t\t}\n\n\t\tbool flg = true;\n\t\trep(i, ind.size()){\n\t\t\tif (i != 0)calc[i] += calc[i - 1];\n\t\t\tif (calc[i] > 150)flg = false;\n\t\t}\n\t\tstd::cout << (flg ? \"OK\" : \"NG\") << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0114,
"final_rank": 8
},
{
"submission_id": "aoj_0231_1570466",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i, a, b) for(int i=(a); i<(b); i++)\n#define REP(i, n) FOR(i, 0, n)\n\n//#define doutnl(args...) cout<<args\n#define doutnl(...)\n#define dout(args...) doutnl(args<<endl;)\n#define dprintl(args...) dout(\"D:\"<<__LINE__<<\": \" args)\n#define dv(v) <<#v<<\"=\"<<(v)<<\"; \"\ntypedef long long ll;\n\nvector<pair<ll,ll> > ts;\n\nint n;\nint main(){\n\twhile(true){\n\t\tts.clear();\n\t\tcin>>n;\n\t\tif(n==0) break;\n\t\tREP(i,n){\n\t\t\tll m,a,b;\n\t\t\tcin>>m>>a>>b;\n\t\t\tts.push_back(pair<ll,ll>(a,m));\n\t\t\tts.push_back(pair<ll,ll>(b,-m));\n\t\t\t\n\t\t}\n\t\tsort(ts.begin(),ts.end());\n\t\tll w=0;\n\t\tbool flag=false;\n\t\tREP(i,ts.size()){\n\t\t\tw+=ts[i].second;\n\t\t\tif(i!=ts.size()-1&&ts[i].first!=ts[i+1].first){\n\t\t\t\tdprintl(dv(i)dv(ts[i].first)dv(ts[i].second)dv(w));\n\t\t\t\tif(w>150){flag=true;break;}\n\t\t\t}\n\t\t}\n\t\tcout<<(flag?\"NG\":\"OK\")<<endl;\n\t}\n\t\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0148,
"final_rank": 15
},
{
"submission_id": "aoj_0231_1548349",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\n\nint n, m[110];\nvector< int > a, b;\n\nint compress(vector< int >& x1, vector< int >& x2, int W) {\n\tvector< int > xs;\n\t\n\tfor_(i,0,n) for_(j,-1,2) {\n\t\tint nx1 = x1[i] + j, nx2 = x2[i] + j;\n\t\tif (0 <= nx1 && nx1 < W) xs.push_back(nx1);\n\t\tif (0 <= nx2 && nx2 < W) xs.push_back(nx2);\n\t}\n\t\n\tsort(xs.begin(), xs.end());\n\txs.erase(unique(xs.begin(), xs.end()), xs.end());\n\t\n\tfor_(i,0,n) {\n\t\tx1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();\n\t\tx2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();\n\t}\n\t\n\treturn xs.size();\n}\n\nint main() {\n\twhile (cin >> n, n) {\n\t\ta.assign(n, 0); b.assign(n, 0);\n\t\tfor_(i,0,n) cin >> m[i] >> a[i] >> b[i];\n\t\t\n\t\tlong long W = (1LL << 31) - 1;\n\t\tint mm = compress(a, b, (int)W);\n\t\t\n\t\tvector< int > sum(mm + 10, 0);\n\t\t\n\t\tfor_(i,0,n) {\n\t\t\tsum[a[i]] += m[i];\n\t\t\tsum[b[i]] += -m[i];\n\t\t}\n\t\t\n\t\tint maxs = sum[0];\n\t\t\n\t\tfor_(i,1,mm+1) {\n\t\t\tsum[i] += sum[i - 1];\n\t\t\tmaxs = max(maxs, sum[i]);\n\t\t}\n\t\t\n\t\tcout << (maxs > 150 ? \"NG\" : \"OK\") << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -0.0182,
"final_rank": 18
},
{
"submission_id": "aoj_0231_1548333",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> pii;\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<pii> events(2*n);\n for(int i=0;i<n;i++){\n int m,a,b;\n cin >> m >> a >> b;\n events[2*i] = pii(a,m);\n events[2*i+1] = pii(b,-m);\n }\n sort(events.begin(), events.end());\n\n int sum = 0;\n bool ans = true;\n for(int i=0;i<2*n;i++){\n sum += events[i].second;\n if(sum > 150)ans = false;\n }\n\n cout << (ans ? \"OK\" : \"NG\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1192,
"score_of_the_acc": -0.0102,
"final_rank": 7
},
{
"submission_id": "aoj_0231_1547128",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF 99999999\n\n\n\nint main(){\n int n,a,b,c;\n while(cin>>n&&n){\n vector<pii> v;\n rep(i,n){\n cin>>a>>b>>c;\n v.pb(pii(b,a ));\n v.pb(pii(c,-a));\n }\n sort(all(v));\n int sum=0;\n bool f=false;\n rep(i,v.size()){\n sum+=v[i].second;\n if(sum>150){\n f=true;\n break;\n }\n }\n if(f)cout<<\"NG\"<<endl;\n else cout<<\"OK\"<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0114,
"final_rank": 8
},
{
"submission_id": "aoj_0231_1499653",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<int,P> Pi;\n\nint main(){\n int n;\n while(cin >> n , n){\n Pi event[n*2+1];\n for(int i=0;i<n;i++){\n int a,b,c;\n cin >> a >> b >> c;\n event[i].first = b;\n event[i].second.first = 1;\n event[i].second.second = a;\n event[i+n].first = c;\n event[i+n].second.first = 0;\n event[i+n].second.second = a;\n }\n sort(event,event+(n*2));\n int now=0;\n bool flg = false;\n for(int i=0;i<n*2;i++){\n if(event[i].second.first == 1) now += event[i].second.second;\n else now -= event[i].second.second;\n \n if(now > 150){\n\tflg = true;\n\tbreak;\n }\n }\n if(flg) cout << \"NG\" << endl;\n else cout << \"OK\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0231_1452388",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nstruct P {\n int m,a,sta;\n bool operator < (const P t ) const {\n if( a == t.a) return sta < t.sta;\n return a < t.a;\n }\n\n};\n\nint main() {\n\n while(1) {\n int n;\n cin >> n;\n if(n == 0) break;\n\n P ls[202];\n for(int i=0;i<2*n;i++) ls[i].sta = (i+1)%2;\n\n int b,c,d;\n for(int i=0;i<n;i++) {\n cin >> b >> c >> d;\n ls[i*2].m = b;\n ls[i*2+1].m = b;\n ls[i*2].a = c;\n ls[i*2+1].a = d;\n }\n\n\n sort(ls,ls+2*n);\n\n int sum = 0;\n int flg = 0;\n for(int i=0;i<2*n;i++) {\n if(ls[i].sta == 0) sum -= ls[i].m;\n if(ls[i].sta == 1) sum += ls[i].m;\n if(sum > 150) {\n flg = 1;\n break;\n }\n }\n\n if(flg == 0) cout <<\"OK\"<<endl;\n else cout <<\"NG\"<<endl;\n\n }\n\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1180,
"score_of_the_acc": -0.0068,
"final_rank": 3
},
{
"submission_id": "aoj_0231_1430061",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<pair<int, int> > ps;\n for(int i = 0; i < n; ++i) {\n int m, a, b;\n cin >> m >> a >> b;\n ps.push_back(make_pair(a, m));\n ps.push_back(make_pair(b, -m));\n }\n sort(begin(ps), end(ps));\n int cweight = 0;\n bool result = true;\n for(int i = 0; i < ps.size(); ++i) {\n cweight += ps[i].second;\n if(i < ps.size() - 1 && ps[i + 1].first == ps[i].first) continue;\n if(cweight > 150) {\n result = false;\n break;\n }\n }\n cout << (result ? \"OK\" : \"NG\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0114,
"final_rank": 8
},
{
"submission_id": "aoj_0231_1429886",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<double,int> P;\n\nint main() {\n int n;\n while(cin >> n && n) {\n vector<P> a;\n for(int i=0; i<n; i++) {\n int x,y,z;\n cin >> x >> y >> z;\n a.push_back(P(y,x));\n a.push_back(P((double)z-0.1,-x));\n }\n sort(a.begin(),a.end());\n int w=0;\n bool f=0;\n for(int i=0; i<a.size(); i++) {\n w+=a[i].second;\n if(w>150) f=1;\n }\n if(f) cout << \"NG\" << endl;\n else cout << \"OK\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.0125,
"final_rank": 12
},
{
"submission_id": "aoj_0231_1234253",
"code_snippet": "#include <iostream>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define fi first\n#define se second\n\nstruct s {\n\tint m, a, b;\n\ts() {}\n\ts(int m_, int a_, int b_) {\n\t\tm = m_; a = a_; b = b_;\n\t}\n};\n\nint main() {\n\tint n;\n\twhile(cin >> n, n) {\n\t\tvector<s> v;\n\t\tvector<int> t;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint m, a, b;\n\t\t\tcin >> m >> a >> b;\n\t\t\tv.push_back(s(m, a, b));\n\t\t\tt.push_back(a);\n\t\t\tt.push_back(b);\n\t\t}\n\n\t\tbool flg = true;\n\t\tfor(int i = 0; i < t.size(); i++) {\n\t\t\tint sum = 0;\n\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\tif(v[j].a <= t[i] && t[i] < v[j].b)\n\t\t\t\t\tsum += v[j].m;\n\t\t\t}\n\t\t\tif(sum > 150)\n\t\t\t\tflg = false;\n\t\t}\n\t\tif(flg)\n\t\t\tcout << \"OK\" << endl;\n\t\telse\n\t\t\tcout << \"NG\" << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1212,
"score_of_the_acc": -0.0159,
"final_rank": 16
},
{
"submission_id": "aoj_0231_1199910",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <iterator>\n#include <map>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\n\nstruct Time\n{\n\tint t,cost;\n\n\tTime(int _t,int _cost)\n\t{\n\t\tt = _t;\n\t\tcost = _cost;\n\t}\n\n\tbool operator<(const Time &ti) const\n\t{\n\t\treturn t < ti.t;\n\t}\n};\n\nint main()\n{\n\tint n;\n\twhile(cin >> n && n)\n\t{\n\t\tmap<int,int> ma;\n\n\t\trep(i,n)\n\t\t{\n\t\t\tint m,a,b;\n\t\t\tcin >> m >> a >> b;\n\n\t\t\tma[a] += m;\n\t\t\tma[b] -= m;\n\t\t}\n\n\t\tvector<Time> v;\n\t\tmap<int,int>::iterator ite;\n\t\tfor(ite = ma.begin();ite != ma.end();ite++)\n\t\t{\n\t\t\tv.push_back(Time(ite->first,ite->second));\t\n\t\t}\n\n\t\tsort(v.begin(),v.end());\n\t\tvector<int> res;\n\t\tres.resize(v.size());\n\t\t\n\t\tint temp = 0;\n\n\t\trep(i,v.size())\n\t\t{\n\t\t\ttemp += v[i].cost;\n\t\t\tres[i] = temp;\n\t\t}\n\n\t\tbool flag = true;\n\t\trep(i,res.size())\n\t\t{\n\t\t\tif(res[i] > 150) flag = false;\n\t\t}\n\n\n\t\tif(flag) cout << \"OK\" << endl;\n\t\telse cout << \"NG\" << endl;\n\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.0125,
"final_rank": 12
},
{
"submission_id": "aoj_0231_1169999",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <climits>\n#include <algorithm>\n#include <map>\nusing namespace std;\n\nint main() {\n int n;\n while (cin >> n, n) {\n vector<int> m(n), a(n), b(n);\n vector<int> x;\n for (int i=0; i<n; ++i) {\n cin >> m[i] >> a[i] >> b[i];\n x.push_back(a[i]);\n x.push_back(b[i]);\n }\n sort(x.begin(), x.end());\n x.erase(unique(x.begin(), x.end()), x.end());\n\n int sum[300] = {};\n for (int i=0; i<n; ++i) {\n int a2 = lower_bound(x.begin(), x.end(), a[i]) - x.begin();\n int b2 = lower_bound(x.begin(), x.end(), b[i]) - x.begin();\n sum[a2] += m[i];\n sum[b2] -= m[i];\n }\n\n bool ok = true;\n for (int i=0; i<300; ++i) {\n sum[i] += (i == 0 ? 0 : sum[i-1]);\n if (150 < sum[i]) {\n ok = false;\n break;\n }\n }\n cout << (ok ? \"OK\" : \"NG\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1212,
"score_of_the_acc": -0.0159,
"final_rank": 16
},
{
"submission_id": "aoj_0231_1157999",
"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;\n\nint main() {\n int N;\n while(cin >>N && N){\n bool f = true;\n vector<int> M(N), A(N), B(N);\n REP(i, N) cin >>M[i] >>A[i] >>B[i];\n REP(i, N){\n int sum = 0;\n REP(j, N) if(A[j] <= A[i] && A[i] < B[j]) sum += M[j];\n if(sum > 150) f = false;\n }\n cout <<(f ? \"OK\" : \"NG\") <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0091,
"final_rank": 5
},
{
"submission_id": "aoj_0231_1147359",
"code_snippet": "#include <iostream>\n#include <map>\nusing namespace std;\n\nint main(void) {\n while (1) {\n int n;\n cin >> n;\n if (n == 0) break;\n\n map<int, int> bridge;\n bridge[-1] = 0;\n while (n--) {\n int m, a, b;\n cin >> m >> a >> b;\n if (bridge.find(a) == bridge.end()) {\n bridge[a] = m;\n } else {\n bridge[a] += m;\n }\n if (bridge.find(b) == bridge.end()) {\n bridge[b] = -m;\n } else {\n bridge[b] -= m;\n }\n }\n\n bool flag = false;\n map<int, int>::iterator b_iter = bridge.begin(), iter = bridge.begin();\n iter++;\n while (iter != bridge.end()) {\n iter->second += b_iter->second;\n //cout << \"# bridge[\" << iter->first << \"]: \" << iter->second << endl;\n if (iter->second > 150) {\n flag = true;\n break;\n }\n b_iter++;\n iter++;\n }\n\n if (flag) {\n cout << \"NG\" << endl;\n } else {\n cout << \"OK\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.0114,
"final_rank": 8
},
{
"submission_id": "aoj_0231_1117848",
"code_snippet": "#include <stdio.h>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#define pb push_back\n#define fi first\n#define sc second\nusing namespace std;\nint main()\n{\n\twhile(1)\n\t{\n\t\tint n; cin >> n;\n\t\tif(n == 0) return 0;\n\t\tmap<long long,vector<int> >ma;\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tlong long a,b,c;\n\t\t\tcin >> a >> b >> c;\n\t\t\tma[b*2].push_back(a);\n\t\t\tma[c*2-1].push_back(a);\n\t\t}\n\t\tint cur = 0;\n\t\tfor(map<long long,vector<int> >::iterator it = ma.begin();it!=ma.end();++it)\n\t\t{\n\t\t\tif((it->fi)%2==0) for(int i=0;i<(it->sc).size();i++) cur += (it->sc)[i];\n\t\t\telse for(int i=0;i<(it->sc).size();i++) cur -= (it->sc)[i];\n\t\t\tif(cur>150) goto dead;\n\t\t}\n\t\tputs(\"OK\"); continue; dead:; puts(\"NG\");\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.0125,
"final_rank": 12
}
] |
aoj_0234_cpp
|
会津の埋蔵金
会津には古くから伝わる埋蔵金の伝説があります。あなたは、遂に埋蔵金が埋まっている場所を突き止めました。埋蔵金が埋まっている深さ、掘り進める地層の状態が分かっているので、綿密に計画を立てれば最小費用で埋蔵金まで到達することができます。そこであなたは、地層の状態を読み取って埋蔵金の埋まっている深さまで最小費用で到達するルートを算出するプログラムを作成することにしました。
地層の状態は 2 次元格子状に配置されたセルで表わされ、各セルの位置は座標 (x,y) で表されます。左上を (1,1) とし、x 座標は右に行くにつれて大きくなり、y 座標は下に深くなるにつれて大きくなるものとします。あなたは y 座標の一番小さいセルのうち一つを選んでそこから掘り始め、y 座標の一番大きいセルの一つまで掘り進めます。地層には以下の 2 種類のセルがあります：
土の詰まったセル。掘るのに、セルごとに決められた費用がかかる。
酸素のたまったセル。掘る必要はなく、セルごとに決まった量の酸素を補給できる。一度酸素を補給したセルの酸素はなくなり、再度の補給はできない。また、このセルに辿りついたら必ず酸素の補給をしなければならない。
あるセルから掘ることができるのは左右と下方向のセルのみです。
一度掘ったセルを左右に移動することはできますが、上に移動することはできません。
発掘にあたっては、酸素ボンベを携帯しなければなりません。酸素ボンベの残量が 0 になった瞬間、移動も発掘も酸素の補給もできなくなります。残量はセルを移動するたびに 1 減ります。酸素ボンベの残量が 0 で埋蔵金の埋まっている深さまで到達しても、到達したとみなされません。また、酸素のたまったセルでは酸素を補給することができますが、容量を超えた分は廃棄されます。
地層のサイズ 、発掘費用、酸素ボンベの容量、初期状態で持っている酸素の量、地層の情報を入力とし、一番深いセルまでたどりつくための最小費用を出力するプログラムを作成してください。ただし、最小費用が発掘費用を超えてしまう場合や、どのように掘り進めても埋蔵金にたどりつけない場合は“NA”と出力してください。
Input
複数のデータセットの並びが入力として与えられる。入力の終わりはゼロふたつの行で示される。
各データセットは以下の形式で与えられる。
W
H
f
m
o
c
1,1
c
2,1
...
c
W,1
c
1,2
c
2,2
...
c
W,2
...
c
1,H
c
2,H
...
c
W,H
１行目に地層の横方向のサイズ
W
, 縦方向のサイズ
H
(3 ≤
W
,
H
≤ 10) が与えられる。 ２行目にあなたの発掘費用を表す整数
f
(1 ≤
f
≤ 10000)、酸素ボンベの容量を表す整数
m
(3 ≤
m
≤ 50)、初期状態で持っている酸素の量を表す整数
o
(o ≤
m
) が与えられる。
続く
H
行に地層の情報
c
i,j
が与えられる。
c
i,j
は、座標 (
i
,
j
) に対するセルの情報を表し、以下の形式で与えられる：
負の値の場合、土の詰まったセルで、値は費用を表す
正の値の場合、酸素のたまったセルで、値は酸素の量を表す
ただし、酸素のたまったセルは 50 箇所以内である。
データセットの数は50 を超えない。
Output
データセットごとに、最少費用または NA を1行に出力する。
Sample Input
3 3
100 10 10
-100 -20 -100
-100 -20 -100
-100 -20 -100
3 3
100 10 10
-100 -20 -100
-100 -20 -20
-100 -60 -20
3 3
100 10 3
-100 -20 -100
-20 -20 -20
-20 -100 -20
3 3
100 3 3
-100 -20 -30
-100 -20 2
-100 -20 -20
4 5
1500 5 4
-10 -380 -250 -250
-90 2 -80 8
-250 -130 -330 -120
-120 -40 -50 -20
-250 -10 -20 -150
0 0
Output for the Sample Input
60
80
NA
50
390
|
[
{
"submission_id": "aoj_0234_8324229",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1012345678;\n\nint solve(int H, int W, int F, int L, int O, const vector<vector<int> >& C) {\n\tL -= 1;\n\tO -= 1;\n\tif (O < 0) {\n\t\treturn INF;\n\t}\n\tvector<vector<int> > dp(W, vector<int>(L + 1, INF));\n\tfor (int i = 0; i < W; i++) {\n\t\tdp[i][O] = 0;\n\t}\n\tauto check = [&](int row, int oxy, int a, int b, int c, int d) -> pair<int, int> {\n\t\t// (row, a) -> (row, b) -> (row, c) -> (row, d)\n\t\tvector<bool> vis(W, false);\n\t\toxy -= 1;\n\t\tif (oxy < 0) {\n\t\t\treturn make_pair(-1, -1);\n\t\t}\n\t\tint cost = 0;\n\t\tauto update = [&](int pos) -> void {\n\t\t\tif (!vis[pos]) {\n\t\t\t\tvis[pos] = true;\n\t\t\t\tif (C[row][pos] < 0) {\n\t\t\t\t\tcost += -C[row][pos];\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\toxy = min(oxy + C[row][pos], L);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tupdate(a);\n\t\tint cur = a;\n\t\tvector<int> targets = { b, c, d };\n\t\tfor (int i : targets) {\n\t\t\twhile (cur != i) {\n\t\t\t\tcur += (cur < i ? +1 : -1);\n\t\t\t\toxy -= 1;\n\t\t\t\tif (oxy < 0) {\n\t\t\t\t\treturn make_pair(-1, -1);\n\t\t\t\t}\n\t\t\t\tupdate(cur);\n\t\t\t}\n\t\t}\n\t\treturn make_pair(oxy, cost);\n\t};\n\tfor (int i = 0; i < H; i++) {\n\t\tvector<vector<int> > ndp(W, vector<int>(L + 1, INF));\n\t\tfor (int j = 0; j <= L; j++) {\n\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\tif (dp[k][j] != INF) {\n\t\t\t\t\tfor (int l = 0; l < W; l++) {\n\t\t\t\t\t\tfor (int x = 0; x <= min(k, l); x++) {\n\t\t\t\t\t\t\tfor (int y = max(k, l); y < W; y++) {\n\t\t\t\t\t\t\t\tpair<int, int> res1 = check(i, j, k, x, y, l);\n\t\t\t\t\t\t\t\tpair<int, int> res2 = check(i, j, k, y, x, l);\n\t\t\t\t\t\t\t\tif (res1.first != -1) {\n\t\t\t\t\t\t\t\t\tndp[l][res1.first] = min(ndp[l][res1.first], dp[k][j] + res1.second);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (res2.first != -1) {\n\t\t\t\t\t\t\t\t\tndp[l][res2.first] = min(ndp[l][res2.first], dp[k][j] + res2.second);\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}\n\t\t}\n\t\tdp = ndp;\n\t}\n\tint ans = INF;\n\tfor (int i = 0; i < W; i++) {\n\t\tfor (int j = 0; j <= L; j++) {\n\t\t\tans = min(ans, dp[i][j]);\n\t\t}\n\t}\n\tif (ans > F) {\n\t\treturn INF;\n\t}\n\treturn ans;\n}\n\nint main() {\n\twhile (true) {\n\t\tint H, W;\n\t\tcin >> W >> H;\n\t\tif (H == 0 && W == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tint F, L, O;\n\t\tcin >> F >> L >> O;\n\t\tvector<vector<int> > C(H, vector<int>(W));\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> C[i][j];\n\t\t\t}\n\t\t}\n\t\tint ans = solve(H, W, F, L, O, C);\n\t\tif (ans != INF) {\n\t\t\tcout << ans << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3456,
"score_of_the_acc": -0.257,
"final_rank": 13
},
{
"submission_id": "aoj_0234_8323846",
"code_snippet": "#include <iostream>\n#include <tuple>\n#include <queue>\n#include <vector>\n#include <cassert>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\nconst int dx[3] = { 0, 0, 1 };\nconst int dy[3] = { -1, 1, 0 };\nint H, W, F, M, O;\nint C[119][119];\nint Dist[119][119][59];\npriority_queue<tuple<int, int, int, int>, vector<tuple<int, int, int, int>>, greater<tuple<int, int, int, int>>> Q;\n\nint main() {\n\twhile (true) {\n\t\t// Step 1. Input\n\t\tcin >> W >> H; if (W + H == 0) break;\n\t\tcin >> F >> M >> O;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) cin >> C[i][j];\n\t\t}\n\n\t\t// Step 2. Constraints Check\n\t\tassert(3 <= H && H <= 10);\n\t\tassert(3 <= W && W <= 10);\n\t\tassert(1 <= F && F <= 10000);\n\t\tassert(3 <= M && M <= 50);\n\t\tassert(0 <= O && O <= M);\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) assert(-10000 <= C[i][j] && C[i][j] <= 10000 && C[i][j] != 0);\n\t\t}\n\n\t\t// Step 2. Dijkstra Init\n\t\tfor (int i = 0; i < H * W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 0; k <= M; k++) Dist[i][j][k] = (1 << 30);\n\t\t\t}\n\t\t}\n\t\tif (O >= 2) {\n\t\t\tfor (int i = 0; i < W; i++) {\n\t\t\t\tif (C[0][i] >= 1) {\n\t\t\t\t\tint oxy = min(M, O - 1 + C[0][i]);\n\t\t\t\t\tDist[i][i * W + i][oxy] = 0;\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][oxy], i, i * W + i, oxy));\n\t\t\t\t}\n\t\t\t\tif (C[0][i] <= -1) {\n\t\t\t\t\tDist[i][i * W + i][O - 1] = -C[0][i];\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][O - 1], i, i * W + i, O - 1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 3. Dijkstra\n\t\twhile (!Q.empty()) {\n\t\t\tint pos1 = get<1>(Q.top());\n\t\t\tint pos2 = get<2>(Q.top());\n\t\t\tint pos3 = get<3>(Q.top()); Q.pop();\n\t\t\tint sx = pos1 / W;\n\t\t\tint sy = pos1 % W;\n\t\t\tint cl = pos2 / W;\n\t\t\tint cr = pos2 % W;\n\t\t\tif (pos3 == 1) continue;\n\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tint tx = sx + dx[i];\n\t\t\t\tint ty = sy + dy[i];\n\t\t\t\tif (tx < 0 || tx >= H || ty < 0 || ty >= W) continue;\n\t\t\t\tint dl = cl;\n\t\t\t\tint dr = cr;\n\t\t\t\tint rem = pos3 - 1;\n\t\t\t\tint cost = 0;\n\t\t\t\tif (i == 2 || ty < dl || dr < ty) {\n\t\t\t\t\tif (C[tx][ty] >= 1) rem = min(M, rem + C[tx][ty]);\n\t\t\t\t\tif (C[tx][ty] <= -1) cost = -C[tx][ty];\n\t\t\t\t}\n\t\t\t\tif (i == 2) { dl = ty; dr = ty; }\n\t\t\t\telse { dl = min(dl, ty); dr = max(dr, ty); }\n\t\t\t\tif (Dist[tx * W + ty][dl * W + dr][rem] > Dist[pos1][pos2][pos3] + cost) {\n\t\t\t\t\tDist[tx * W + ty][dl * W + dr][rem] = Dist[pos1][pos2][pos3] + cost;\n\t\t\t\t\tQ.push(make_tuple(Dist[tx * W + ty][dl * W + dr][rem], tx * W + ty, dl * W + dr, rem));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 4. Output\n\t\tint Answer = (1 << 30);\n\t\tfor (int i = 0; i < W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 1; k <= M; k++) Answer = min(Answer, Dist[(H - 1) * W + i][j][k]);\n\t\t\t}\n\t\t}\n\t\tif (Answer == (1 << 30)) cout << \"NA\" << endl;\n\t\telse cout << Answer << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 6072,
"score_of_the_acc": -0.1365,
"final_rank": 11
},
{
"submission_id": "aoj_0234_8323841",
"code_snippet": "#include <iostream>\n#include <tuple>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\nconst int dx[3] = { 0, 0, 1 };\nconst int dy[3] = { -1, 1, 0 };\nint H, W, F, M, O;\nint C[119][119];\nint Dist[119][119][59];\npriority_queue<tuple<int, int, int, int>, vector<tuple<int, int, int, int>>, greater<tuple<int, int, int, int>>> Q;\n\nint main() {\n\twhile (true) {\n\t\t// Step 1. Input\n\t\tcin >> W >> H; if (W + H == 0) break;\n\t\tcin >> F >> M >> O;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) cin >> C[i][j];\n\t\t}\n\n\t\t// Step 2. Dijkstra Init\n\t\tfor (int i = 0; i < H * W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 0; k <= M; k++) Dist[i][j][k] = (1 << 30);\n\t\t\t}\n\t\t}\n\t\tif (O >= 2) {\n\t\t\tfor (int i = 0; i < W; i++) {\n\t\t\t\tif (C[0][i] >= 1) {\n\t\t\t\t\tint oxy = min(M, O - 1 + C[0][i]);\n\t\t\t\t\tDist[i][i * W + i][oxy] = 0;\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][oxy], i, i * W + i, oxy));\n\t\t\t\t}\n\t\t\t\tif (C[0][i] <= -1) {\n\t\t\t\t\tDist[i][i * W + i][O - 1] = -C[0][i];\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][O - 1], i, i * W + i, O - 1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 3. Dijkstra\n\t\twhile (!Q.empty()) {\n\t\t\tint pos1 = get<1>(Q.top());\n\t\t\tint pos2 = get<2>(Q.top());\n\t\t\tint pos3 = get<3>(Q.top()); Q.pop();\n\t\t\tint sx = pos1 / W;\n\t\t\tint sy = pos1 % W;\n\t\t\tint cl = pos2 / W;\n\t\t\tint cr = pos2 % W;\n\t\t\tif (pos3 == 1) continue;\n\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tint tx = sx + dx[i];\n\t\t\t\tint ty = sy + dy[i];\n\t\t\t\tif (tx < 0 || tx >= H || ty < 0 || ty >= W) continue;\n\t\t\t\tint dl = cl;\n\t\t\t\tint dr = cr;\n\t\t\t\tint rem = pos3 - 1;\n\t\t\t\tint cost = 0;\n\t\t\t\tif (i == 2 || ty < dl || dr < ty) {\n\t\t\t\t\tif (C[tx][ty] >= 1) rem = min(M, rem + C[tx][ty]);\n\t\t\t\t\tif (C[tx][ty] <= -1) cost = -C[tx][ty];\n\t\t\t\t}\n\t\t\t\tif (i == 2) { dl = ty; dr = ty; }\n\t\t\t\telse { dl = min(dl, ty); dr = max(dr, ty); }\n\t\t\t\tif (Dist[tx * W + ty][dl * W + dr][rem] > Dist[pos1][pos2][pos3] + cost) {\n\t\t\t\t\tDist[tx * W + ty][dl * W + dr][rem] = Dist[pos1][pos2][pos3] + cost;\n\t\t\t\t\tQ.push(make_tuple(Dist[tx * W + ty][dl * W + dr][rem], tx * W + ty, dl * W + dr, rem));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 4. Output\n\t\tint Answer = (1 << 30);\n\t\tfor (int i = 0; i < W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 1; k <= M; k++) Answer = min(Answer, Dist[(H - 1) * W + i][j][k]);\n\t\t\t}\n\t\t}\n\t\tif (Answer == (1 << 30)) cout << \"NA\" << endl;\n\t\telse cout << Answer << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5988,
"score_of_the_acc": -0.1346,
"final_rank": 10
},
{
"submission_id": "aoj_0234_8323784",
"code_snippet": "#include <iostream>\n#include <tuple>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\nconst int dx[3] = { 0, 0, 1 };\nconst int dy[3] = { -1, 1, 0 };\nint H, W, F, M, O;\nint C[119][119];\nint Dist[119][119][59];\npriority_queue<tuple<int, int, int, int>, vector<tuple<int, int, int, int>>, greater<tuple<int, int, int, int>>> Q;\n\nint main() {\n\twhile (true) {\n\t\t// Step 1. Input\n\t\tcin >> W >> H; if (W + H == 0) break;\n\t\tcin >> F >> M >> O;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) cin >> C[i][j];\n\t\t}\n\n\t\t// Step 2. Dijkstra Init\n\t\tfor (int i = 0; i < H * W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 0; k <= M; k++) Dist[i][j][k] = (1 << 30);\n\t\t\t}\n\t\t}\n\t\tif (O >= 2) {\n\t\t\tfor (int i = 0; i < W; i++) {\n\t\t\t\tif (C[0][i] >= 1) {\n\t\t\t\t\tDist[i][i * W + i][O - 0] = 0;\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][O - 0], i, i * W + i, O - 0));\n\t\t\t\t}\n\t\t\t\tif (C[0][i] <= -1) {\n\t\t\t\t\tDist[i][i * W + i][O - 1] = -C[0][i];\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][O - 1], i, i * W + i, O - 1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 3. Dijkstra\n\t\twhile (!Q.empty()) {\n\t\t\tint pos1 = get<1>(Q.top());\n\t\t\tint pos2 = get<2>(Q.top());\n\t\t\tint pos3 = get<3>(Q.top()); Q.pop();\n\t\t\tint sx = pos1 / W;\n\t\t\tint sy = pos1 % W;\n\t\t\tint cl = pos2 / W;\n\t\t\tint cr = pos2 % W;\n\t\t\tif (pos3 == 1) continue;\n\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tint tx = sx + dx[i];\n\t\t\t\tint ty = sy + dy[i];\n\t\t\t\tif (tx < 0 || tx >= H || ty < 0 || ty >= W) continue;\n\t\t\t\tint dl = cl;\n\t\t\t\tint dr = cr;\n\t\t\t\tint rem = pos3 - 1;\n\t\t\t\tint cost = 0;\n\t\t\t\tif (i == 2 || ty < dl || dr < ty) {\n\t\t\t\t\tif (C[tx][ty] >= 1) rem = min(M, rem + C[tx][ty]);\n\t\t\t\t\tif (C[tx][ty] <= -1) cost = -C[tx][ty];\n\t\t\t\t}\n\t\t\t\tif (i == 2) { dl = ty; dr = ty; }\n\t\t\t\telse { dl = min(dl, ty); dr = max(dr, ty); }\n\t\t\t\tif (Dist[tx * W + ty][dl * W + dr][rem] > Dist[pos1][pos2][pos3] + cost) {\n\t\t\t\t\tDist[tx * W + ty][dl * W + dr][rem] = Dist[pos1][pos2][pos3] + cost;\n\t\t\t\t\tQ.push(make_tuple(Dist[tx * W + ty][dl * W + dr][rem], tx * W + ty, dl * W + dr, rem));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 4. Output\n\t\tint Answer = (1 << 30);\n\t\tfor (int i = 0; i < W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 1; k <= M; k++) Answer = min(Answer, Dist[(H - 1) * W + i][j][k]);\n\t\t\t}\n\t\t}\n\t\tif (Answer > F) cout << \"NA\" << endl;\n\t\telse cout << Answer << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 6156,
"score_of_the_acc": -0.1383,
"final_rank": 12
},
{
"submission_id": "aoj_0234_8323605",
"code_snippet": "#include <iostream>\n#include <tuple>\n#include <queue>\n#include <vector>\n#include <cassert>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\nconst int dx[3] = { 0, 0, 1 };\nconst int dy[3] = { -1, 1, 0 };\nint H, W, F, M, O;\nint C[119][119];\nint Dist[119][119][59];\npriority_queue<tuple<int, int, int, int>, vector<tuple<int, int, int, int>>, greater<tuple<int, int, int, int>>> Q;\n\nint main() {\n\twhile (true) {\n\t\t// Step 1. Input\n\t\tcin >> W >> H; if (W + H == 0) break;\n\t\tcin >> F >> M >> O;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> C[i][j];\n\t\t\t\tassert(-10000 <= C[i][j] && C[i][j] <= 10000 && C[i][j] != 0);\n\t\t\t}\n\t\t}\n\n\t\t// Step 2. Dijkstra Init\n\t\tfor (int i = 0; i < H * W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 0; k <= M; k++) Dist[i][j][k] = (1 << 30);\n\t\t\t}\n\t\t}\n\t\tif (O >= 2) {\n\t\t\tfor (int i = 0; i < W; i++) {\n\t\t\t\tif (C[0][i] >= 1) {\n\t\t\t\t\tDist[i][i * W + i][O - 0] = 0;\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][O - 0], i, i * W + i, O - 0));\n\t\t\t\t}\n\t\t\t\tif (C[0][i] <= -1) {\n\t\t\t\t\tDist[i][i * W + i][O - 1] = -C[0][i];\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][O - 1], i, i * W + i, O - 1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 3. Dijkstra\n\t\twhile (!Q.empty()) {\n\t\t\tint pos1 = get<1>(Q.top());\n\t\t\tint pos2 = get<2>(Q.top());\n\t\t\tint pos3 = get<3>(Q.top()); Q.pop();\n\t\t\tint sx = pos1 / W;\n\t\t\tint sy = pos1 % W;\n\t\t\tint cl = pos2 / W;\n\t\t\tint cr = pos2 % W;\n\t\t\tif (pos3 == 1) continue;\n\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tint tx = sx + dx[i];\n\t\t\t\tint ty = sy + dy[i];\n\t\t\t\tif (tx < 0 || tx >= H || ty < 0 || ty >= W) continue;\n\t\t\t\tint dl = cl;\n\t\t\t\tint dr = cr;\n\t\t\t\tint rem = pos3 - 1;\n\t\t\t\tint cost = 0;\n\t\t\t\tif (i == 2 || ty < dl || dr < ty) {\n\t\t\t\t\tif (C[tx][ty] >= 1) rem = min(M, rem + C[tx][ty]);\n\t\t\t\t\tif (C[tx][ty] <= -1) cost = -C[tx][ty];\n\t\t\t\t}\n\t\t\t\tif (i == 2) { dl = ty; dr = ty; }\n\t\t\t\telse { dl = min(dl, ty); dr = max(dr, ty); }\n\t\t\t\tif (Dist[tx * W + ty][dl * W + dr][rem] > Dist[pos1][pos2][pos3] + cost) {\n\t\t\t\t\tDist[tx * W + ty][dl * W + dr][rem] = Dist[pos1][pos2][pos3] + cost;\n\t\t\t\t\tQ.push(make_tuple(Dist[tx * W + ty][dl * W + dr][rem], tx * W + ty, dl * W + dr, rem));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 4. Output\n\t\tint Answer = (1 << 30);\n\t\tfor (int i = 0; i < W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 1; k <= M; k++) Answer = min(Answer, Dist[(H - 1) * W + i][j][k]);\n\t\t\t}\n\t\t}\n\t\tif (Answer == (1 << 30)) cout << \"NA\" << endl;\n\t\telse cout << Answer << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5988,
"score_of_the_acc": -0.0989,
"final_rank": 7
},
{
"submission_id": "aoj_0234_8323180",
"code_snippet": "#include <iostream>\n#include <tuple>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\nconst int dx[3] = { 0, 0, 1 };\nconst int dy[3] = { -1, 1, 0 };\nint H, W, F, M, O;\nint C[119][119];\nint Dist[119][119][59];\npriority_queue<tuple<int, int, int, int>, vector<tuple<int, int, int, int>>, greater<tuple<int, int, int, int>>> Q;\n\nint main() {\n\twhile (true) {\n\t\t// Step 1. Input\n\t\tcin >> W >> H; if (W + H == 0) break;\n\t\tcin >> F >> M >> O;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) cin >> C[i][j];\n\t\t}\n\n\t\t// Step 2. Dijkstra Init\n\t\tfor (int i = 0; i < H * W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 0; k <= M; k++) Dist[i][j][k] = (1 << 30);\n\t\t\t}\n\t\t}\n\t\tif (O >= 2) {\n\t\t\tfor (int i = 0; i < W; i++) {\n\t\t\t\tif (C[0][i] >= 1) {\n\t\t\t\t\tDist[i][i * W + i][O - 0] = 0;\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][O - 0], i, i * W + i, O - 0));\n\t\t\t\t}\n\t\t\t\tif (C[0][i] <= -1) {\n\t\t\t\t\tDist[i][i * W + i][O - 1] = -C[0][i];\n\t\t\t\t\tQ.push(make_tuple(Dist[i][i * W + i][O - 1], i, i * W + i, O - 1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 3. Dijkstra\n\t\twhile (!Q.empty()) {\n\t\t\tint pos1 = get<1>(Q.top());\n\t\t\tint pos2 = get<2>(Q.top());\n\t\t\tint pos3 = get<3>(Q.top()); Q.pop();\n\t\t\tint sx = pos1 / W;\n\t\t\tint sy = pos1 % W;\n\t\t\tint cl = pos2 / W;\n\t\t\tint cr = pos2 % W;\n\t\t\tif (pos3 == 1) continue;\n\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tint tx = sx + dx[i];\n\t\t\t\tint ty = sy + dy[i];\n\t\t\t\tif (tx < 0 || tx >= H || ty < 0 || ty >= W) continue;\n\t\t\t\tint dl = cl;\n\t\t\t\tint dr = cr;\n\t\t\t\tint rem = pos3 - 1;\n\t\t\t\tint cost = 0;\n\t\t\t\tif (i == 2 || ty < dl || dr < ty) {\n\t\t\t\t\tif (C[tx][ty] >= 1) rem = min(M, rem + C[tx][ty]);\n\t\t\t\t\tif (C[tx][ty] <= -1) cost = -C[tx][ty];\n\t\t\t\t}\n\t\t\t\tif (i == 2) { dl = ty; dr = ty; }\n\t\t\t\telse { dl = min(dl, ty); dr = max(dr, ty); }\n\t\t\t\tif (Dist[tx * W + ty][dl * W + dr][rem] > Dist[pos1][pos2][pos3] + cost) {\n\t\t\t\t\tDist[tx * W + ty][dl * W + dr][rem] = Dist[pos1][pos2][pos3] + cost;\n\t\t\t\t\tQ.push(make_tuple(Dist[tx * W + ty][dl * W + dr][rem], tx * W + ty, dl * W + dr, rem));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Step 4. Output\n\t\tint Answer = (1 << 30);\n\t\tfor (int i = 0; i < W; i++) {\n\t\t\tfor (int j = 0; j < W * W; j++) {\n\t\t\t\tfor (int k = 1; k <= M; k++) Answer = min(Answer, Dist[(H - 1) * W + i][j][k]);\n\t\t\t}\n\t\t}\n\t\tif (Answer == (1 << 30)) cout << \"NA\" << endl;\n\t\telse cout << Answer << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 6144,
"score_of_the_acc": -0.1023,
"final_rank": 8
},
{
"submission_id": "aoj_0234_6982658",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int w, h;\n while(cin >> w >> h, h){\n int f, m, o;\n cin >> f >> m >> o;\n vector<vector<int>> C(h + 1, vector<int>(w));\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n cin >> C[y][x];\n }\n }\n //空けた場所,現在の位置,現在の酸素\n vector<vector<vector<int>>> dp(1 << w, vector<vector<int>>(w, vector<int>(m + 1, 1 << 30)));\n for(int i = 0; i < (1 << w); i++){\n for(int j = 0; j < w; j++){\n dp[i][j][o] = 0;\n }\n }\n for(int i = 0; i < h; i++){\n vector<vector<vector<int>>> ndp(1 << w, vector<vector<int>>(w, vector<int>(m + 1, 1 << 30)));\n for(int j = 0; j < (1 << w); j++){\n for(int k = 0; k < w; k++){\n for(int l = 2; l <= m; l++){\n if(dp[j][k][l] >> 30 & 1)continue;\n if(C[i][k] >= 0){\n ndp[1 << k][k][min(m, l - 1 + C[i][k])] \n = min(ndp[1 << k][k][min(m, l - 1 + C[i][k])], dp[j][k][l]);\n }else{\n ndp[1 << k][k][l - 1] \n = min(ndp[1 << k][k][l - 1], dp[j][k][l] - C[i][k]);\n }\n }\n }\n }\n swap(dp, ndp);\n for(int t = 0; t < 20; t++){\n for(int j = 0; j < (1 << w); j++){\n for(int k = 0; k < w; k++){\n for(int l = 2; l <= m; l++){\n if(dp[j][k][l] >> 30 & 1)continue;\n if(k >= 1){\n if(j >> (k - 1) & 1){\n dp[j][k - 1][l - 1] = min(dp[j][k - 1][l - 1], dp[j][k][l]);\n }else if(C[i][k - 1] >= 0){\n dp[j | (1 << (k - 1))][k - 1][min(m, l - 1 + C[i][k - 1])] \n = min(dp[j | (1 << (k - 1))][k - 1][min(m, l - 1 + C[i][k - 1])], \n dp[j][k][l]);\n }else{\n dp[j | (1 << (k - 1))][k - 1][l - 1] \n = min(dp[j | (1 << (k - 1))][k - 1][l - 1], \n dp[j][k][l] - C[i][k - 1]);\n }\n }\n if(k + 1 < w){\n if(j >> (k + 1) & 1){\n dp[j][k + 1][l - 1] = min(dp[j][k + 1][l - 1], dp[j][k][l]);\n }else if(C[i][k + 1] >= 0){\n dp[j | (1 << (k + 1))][k + 1][min(m, l - 1 + C[i][k + 1])] \n = min(dp[j | (1 << (k + 1))][k + 1][min(m, l - 1 + C[i][k + 1])], \n dp[j][k][l]);\n }else{\n dp[j | (1 << (k + 1))][k + 1][l - 1] \n = min(dp[j | (1 << (k + 1))][k + 1][l - 1], \n dp[j][k][l] - C[i][k + 1]);\n }\n }\n }\n }\n }\n }\n }\n int ans = 1 << 30;\n for(int i = 0; i < (1 << w); i++){\n for(int j = 0; j < w; j++){\n for(int k = 1; k <= m; k++){\n ans = min(ans, dp[i][j][k]);\n }\n }\n }\n if(ans > f)cout << \"NA\" << '\\n';\n else cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 6884,
"score_of_the_acc": -0.4045,
"final_rank": 14
},
{
"submission_id": "aoj_0234_4906195",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<algorithm>\nusing namespace std;\nint H,W,F,M,o;\nint c[10][10];\nint dist[10][10][1<<10][51];\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tcin>>F>>M>>o;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)cin>>c[i][j];\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t\tfor(int k=0;k<1<<W;k++)for(int l=0;l<=M;l++)dist[i][j][k][l]=F+1;\n\t\tpriority_queue<pair<int,pair<pair<int,int>,pair<int,int> > > >P;\n\t\tfor(int j=0;j<W;j++)\n\t\t{\n\t\t\tif(c[0][j]<0&&o>0)\n\t\t\t{\n\t\t\t\tdist[0][j][1<<j][o-1]=-c[0][j];\n\t\t\t\tP.push(make_pair(c[0][j],make_pair(make_pair(0,j),make_pair(1<<j,o-1))));\n\t\t\t}\n\t\t\telse if(o>1)\n\t\t\t{\n\t\t\t\tdist[0][j][1<<j][min(M,o-1+c[0][j])]=0;\n\t\t\t\tP.push(make_pair(0,make_pair(make_pair(0,j),make_pair(1<<j,min(M,o-1+c[0][j])))));\n\t\t\t}\n\t\t}\n\t\tint ans=F+1;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tint i=P.top().second.first.first;\n\t\t\tint j=P.top().second.first.second;\n\t\t\tint J=P.top().second.second.first;\n\t\t\tint o=P.top().second.second.second;\n\t\t\tint cost=-P.top().first;\n\t\t\tP.pop();\n\t\t\tif(o==0||dist[i][j][J][o]<cost)continue;\n\t\t\tif(i==H-1)\n\t\t\t{\n\t\t\t\tans=min(ans,cost);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint nxt=cost;\n\t\t\t\tint no=o-1;\n\t\t\t\tif(c[i+1][j]<0)\n\t\t\t\t{\n\t\t\t\t\tnxt+=-c[i+1][j];\n\t\t\t\t}\n\t\t\t\telse if(no>0)\n\t\t\t\t{\n\t\t\t\t\tno+=c[i+1][j];\n\t\t\t\t\tif(no>M)no=M;\n\t\t\t\t}\n\t\t\t\tint nj=1<<j;\n\t\t\t\tif(dist[i+1][j][nj][no]>nxt)\n\t\t\t\t{\n\t\t\t\t\tdist[i+1][j][nj][no]=nxt;\n\t\t\t\t\tP.push(make_pair(-nxt,make_pair(make_pair(i+1,j),make_pair(nj,no))));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(j>0)\n\t\t\t{\n\t\t\t\tint nxt=cost;\n\t\t\t\tint no=o-1;\n\t\t\t\tif(J>>j-1&1)\n\t\t\t\t{\n\t\t\t\t}\n\t\t\t\telse if(c[i][j-1]<0)\n\t\t\t\t{\n\t\t\t\t\tnxt+=-c[i][j-1];\n\t\t\t\t}\n\t\t\t\telse if(no>0)\n\t\t\t\t{\n\t\t\t\t\tno+=c[i][j-1];\n\t\t\t\t\tif(no>M)no=M;\n\t\t\t\t}\n\t\t\t\tint nj=J|1<<j-1;\n\t\t\t\tif(dist[i][j-1][nj][no]>nxt)\n\t\t\t\t{\n\t\t\t\t\tdist[i][j-1][nj][no]=nxt;\n\t\t\t\t\tP.push(make_pair(-nxt,make_pair(make_pair(i,j-1),make_pair(nj,no))));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(j<W-1)\n\t\t\t{\n\t\t\t\tint nxt=cost;\n\t\t\t\tint no=o-1;\n\t\t\t\tif(J>>j+1&1)\n\t\t\t\t{\n\t\t\t\t}\n\t\t\t\telse if(c[i][j+1]<0)\n\t\t\t\t{\n\t\t\t\t\tnxt+=-c[i][j+1];\n\t\t\t\t}\n\t\t\t\telse if(no>0)\n\t\t\t\t{\n\t\t\t\t\tno+=c[i][j+1];\n\t\t\t\t\tif(no>M)no=M;\n\t\t\t\t}\n\t\t\t\tint nj=J|1<<j+1;\n\t\t\t\tif(dist[i][j+1][nj][no]>nxt)\n\t\t\t\t{\n\t\t\t\t\tdist[i][j+1][nj][no]=nxt;\n\t\t\t\t\tP.push(make_pair(-nxt,make_pair(make_pair(i,j+1),make_pair(nj,no))));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(ans>F)cout<<\"NA\"<<endl;\n\t\telse cout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 23584,
"score_of_the_acc": -0.5249,
"final_rank": 15
},
{
"submission_id": "aoj_0234_4473529",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> inline bool chmin(T &a, const T &b){ return a > b && (a = b, true); }\ntemplate<class T> inline bool chmax(T &a, const T &b){ return a < b && (a = b, true); }\n\ntemplate <class K, class V>\nclass RadixHeap {\n static constexpr int bit_length = sizeof(K)*8;\n K last;\n size_t sz, cnt;\n array<vector<pair<K, V>>, bit_length> v;\n static inline int bsr(int x){\n return x ? bit_length-__builtin_clz(x) : 0;\n }\n static inline int bsr(ll x){\n return x ? bit_length-__builtin_clzll(x) : 0;\n }\n\n void pull() {\n if(cnt < v[0].size()) return;;\n int i = 1;\n while(v[i].empty()) i++;\n last = min_element(v[i].begin(),v[i].end())->first;\n for (auto &&x : v[i]) v[bsr(x.first ^ last)].push_back(x);\n v[i].clear();\n }\npublic:\n RadixHeap() : last(0), sz(0), cnt(0) {}\n void emplace(K x, V val){\n sz++;\n v[bsr(x^last)].emplace_back(x, val);\n }\n\n pair<K, V> top() {\n pull();\n return v[0][cnt];\n }\n\n void pop() {\n pull();\n sz--;\n cnt++;\n }\n\n size_t size() const { return sz; }\n bool empty() const { return !sz; }\n};\n\nvoid solve(int w, int h){\n int f, m, o;\n cin >> f >> m >> o;\n auto dp = make_v(h, w, w, w, m+1, INF<int>); // i, j, l, r, O;\n auto v = make_v(h, w, 0);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n cin >> v[i][j];\n }\n }\n if(o <= 1) {\n puts(\"NA\");\n return;\n }\n using P = tuple<int, int, int, int, int>;\n RadixHeap<int, P> Q;\n for (int i = 0; i < w; ++i) {\n dp[0][i][i][i][min(m, o+max(0, v[0][i])-1)] = max(0, -v[0][i]);\n Q.emplace(max(0, -v[0][i]), P{0, i, i, i, min(m, o+max(0, v[0][i])-1)});\n }\n while(!Q.empty()){\n int a, b, c, d, e; int cost; tuple<int, int, int, int, int> A;\n tie(cost, A) = Q.top(); Q.pop();\n tie(a, b, c, d, e) = A;\n if(dp[a][b][c][d][e] < cost) continue;\n if(e <= 1) continue;\n if(a+1 < h){\n int ccost = cost + max(0, -v[a+1][b]);\n int ee = min(m, e-1+max(0, v[a+1][b]));\n if(chmin(dp[a+1][b][b][b][ee], ccost)){\n Q.emplace(ccost, P{a+1, b, b, b, ee});\n }\n }\n if(b){\n int ccost = cost + (b == c ? max(0, -v[a][b-1]) : 0);\n int ee = min(m, e-1+(b == c ? max(0, v[a][b-1]) : 0));\n if(chmin(dp[a][b-1][min(c, b-1)][d][ee], ccost)){\n Q.emplace(ccost, P{a, b-1, min(c, b-1), d, ee});\n }\n }\n if(b != w-1){\n int ccost = cost + (b == d ? max(0, -v[a][b+1]) : 0);\n int ee = min(m, e-1+(b == d ? max(0, v[a][b+1]) : 0));\n if(chmin(dp[a][b+1][c][max(d, b+1)][ee], ccost)){\n Q.emplace(ccost, P{a, b+1, c, max(d, b+1), ee});\n }\n }\n }\n int ans = INF<int>;\n for (int i = 0; i < w; ++i) {\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k < w; ++k) {\n for (int l = 1; l <= m; ++l) {\n chmin(ans, dp.back()[i][j][k][l]);\n }\n }\n }\n }\n if(ans >= f) puts(\"NA\");\n else cout << ans << \"\\n\";\n}\n\nint main() {\n int w, h;\n while(cin >> w >> h, w){\n solve(w, h);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7000,
"score_of_the_acc": -0.0856,
"final_rank": 6
},
{
"submission_id": "aoj_0234_2545684",
"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>\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\tInfo(){\n\t\trow = col = oxyzen = cost = 0;\n\t}\n\n\tInfo(int arg_row,int arg_col,int arg_oxyzen,int arg_cost){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\toxyzen = arg_oxyzen;\n\t\tcost = arg_cost;\n\t}\n\n\tint row,col,oxyzen,cost;\n\tbool visited[10][10];\n};\n\nint H,W,diff_row[3] = {0,0,1},diff_col[3] = {-1,1,0};\nint min_cost[10][10][51];\nint map[10][10];\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 budget,Limit,first_oxyzen;\n\n\tscanf(\"%d %d %d\",&budget,&Limit,&first_oxyzen);\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}\n\t}\n\n\tif(first_oxyzen == 1){\n\t\tprintf(\"NA\\n\");\n\t\treturn;\n\t}\n\n\tqueue<Info> Q;\n\n\tint minimum = BIG_NUM;\n\tint next_row,next_col;\n\n\n\tfor(int start_col = 0; start_col < W; start_col++){\n\n\t\tfor(int row = 0; row <= H-1; row++){\n\t\t\tfor(int col = 0; col <= W-1; col++){\n\t\t\t\tfor(int oxy = 0; oxy <= Limit; oxy++){\n\t\t\t\t\tmin_cost[row][col][oxy] = BIG_NUM;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tInfo first;\n\t\tfor(int row = 0; row < H; row++){\n\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\tfirst.visited[row][col] = false;\n\t\t\t}\n\t\t}\n\n\t\tfirst.oxyzen = first_oxyzen-1;\n\t\tfirst.cost = 0;\n\t\tfirst.row = 0;\n\t\tfirst.col = start_col;\n\t\tfirst.visited[0][start_col] = true;\n\n\t\tif(map[0][start_col] > 0){\n\t\t\tfirst.oxyzen = min(first.oxyzen+map[0][start_col],Limit);\n\n\t\t}else{\n\t\t\tfirst.cost += abs(map[0][start_col]);\n\t\t\tif(first.cost > budget){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tmin_cost[0][start_col][first.oxyzen] = first.cost;\n\n\t\tQ.push(first);\n\n\t\twhile(!Q.empty()){\n\n\t\t\tif(Q.front().row == H-1){\n\t\t\t\tQ.pop();\n\t\t\t}else if(Q.front().cost > min_cost[Q.front().row][Q.front().col][Q.front().oxyzen] || Q.front().oxyzen == 1){\n\t\t\t\tQ.pop();\n\t\t\t}else{\n\n\t\t\t\tfor(int i = 0; i < 3; i++){\n\t\t\t\t\tnext_row = Q.front().row + diff_row[i];\n\t\t\t\t\tnext_col = Q.front().col + diff_col[i];\n\n\t\t\t\t\tif(!rangeCheck(next_row,next_col))continue;\n\n\t\t\t\t\tInfo next_info;\n\t\t\t\t\tnext_info.row = next_row;\n\t\t\t\t\tnext_info.col = next_col;\n\t\t\t\t\tnext_info.oxyzen = Q.front().oxyzen-1;\n\t\t\t\t\tnext_info.cost = Q.front().cost;\n\n\t\t\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\t\t\t\tnext_info.visited[row][col] = Q.front().visited[row][col];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(map[next_row][next_col] > 0 && next_info.visited[next_row][next_col] == false){\n\t\t\t\t\t\tnext_info.oxyzen = min(next_info.oxyzen+map[next_row][next_col],Limit);\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif(next_info.visited[next_row][next_col] == false){\n\t\t\t\t\t\t\tnext_info.cost += abs(map[next_row][next_col]);\n\t\t\t\t\t\t\tif(next_info.cost > budget){\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tnext_info.visited[next_row][next_col] = true;\n\n\t\t\t\t\tif(min_cost[next_row][next_col][next_info.oxyzen] > next_info.cost){\n\t\t\t\t\t\tmin_cost[next_row][next_col][next_info.oxyzen] = next_info.cost;\n\t\t\t\t\t\tQ.push(next_info);\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 col = 0; col < W; col++){\n\t\t\tfor(int oxy = 0; oxy <= Limit; oxy++){\n\t\t\t\tminimum = min(minimum,min_cost[H-1][col][oxy]);\n\t\t\t}\n\t\t}\n\t}\n\n\tif(minimum == BIG_NUM){\n\t\tprintf(\"NA\\n\");\n\t}else{\n\t\tprintf(\"%d\\n\",minimum);\n\t}\n\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\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3140,
"score_of_the_acc": -0.0714,
"final_rank": 4
},
{
"submission_id": "aoj_0234_2433590",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < n ;i++ )\n#define MAX 100\nint H, W;\nint dy[3] = { 0, 0, 1 }; int dx[3] = { 1, -1, 0 };\nclass State {public:\tint l, r, y, x, o;\n\tState(int y = 0, int x = 0, int o = 0) :y(y), x(x), o(o) {reset();}\n\tvoid reset() {l = W;r = -1;}\n\tvoid visit(int j) {l = min(l, j);r = max(r, j);}\n\tbool visited(int j) {return l <= j && j <= r;}\n\tbool operator <(const State &s) const {\n\t\tif (o != s.o)return o < s.o;\n\t\tif (l != s.l)\treturn l < s.l;\n\t\tif (r != s.r)return r < s.r;\n\t\tif (y != s.y)return y < s.y;\n\t\tif (x != s.x)return x < s.x;\n\t\treturn false;\n\t}\n};\nclass QState {public:\tState state;int cost; QState() {}\n\tQState(State state, int cost) :state(state), cost(cost) {}\n\tbool operator <(const QState &s) const {return cost > s.cost;\t}\n};\nint F, M, O, C[MAX][MAX];\nint dijkstra() {\n\tif (O == 0)return -1;\n\tint ncost;\tpriority_queue<QState> PQ;\tset<State> visited;\n\trep(j, W){\n\t\tState source = State(0, j, O);\n\t\tsource.visit(j);\n\t\tsource.o--;\n\t\tif (source.o == 0)continue;\n\t\tif (C[0][j] >= 0) {\n\t\t\tsource.o = min(M, source.o + C[0][j]);\n\t\t\tncost = 0;\n\t\t} else {\tncost = C[0][j] * (-1);\n\t\t}\n\t\tvisited.insert(source);\n\t\tPQ.push(QState(source, ncost));\n\t}\n\tQState u, v;int nx, ny;\n\twhile (!PQ.empty()) {\n\t\tu = PQ.top();PQ.pop();\n\t\tif (u.cost > F)continue;\n\t\tif (u.state.y == H - 1)return u.cost;\n\t\trep(r, 3){\n\t\t\tnx = u.state.x + dx[r]; ny = u.state.y + dy[r];\n\t\t\tif (nx < 0 || ny < 0 || nx >= W || ny >= H)continue;\n\t\t\tv = u;\n\t\t\tv.state.o--;\n\t\t\tif (v.state.o == 0)\tcontinue;\n\t\t\tv.state.x = nx;v.state.y = ny;\n\t\t\tif (r == 2)\tv.state.reset();\n\t\t\tif (!v.state.visited(nx)) {\n\t\t\t\tif (C[ny][nx] >= 0) {\n\t\t\t\t\tv.state.o = min(M, v.state.o + C[ny][nx]);\n\t\t\t\t\tv.state.visit(nx);\n\t\t\t\t} else if (C[ny][nx] < 0) {\n\t\t\t\t\tv.cost = u.cost + (C[ny][nx] * (-1));\n\t\t\t\t\tv.state.visit(nx);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (visited.find(v.state) == visited.end()) {\n\t\t\t\tvisited.insert(v.state);\n\t\t\t\tPQ.push(v);\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main() {\twhile( cin >> W >> H && W && H ) {\n\t\tcin >> F >> M >> O;\n\t\trep(i, H) rep(j, W) cin >> C[i][j];\n\t\tint cost = dijkstra();\n\t\tif ( cost < 0 || F < cost) cout << \"NA\" << endl;\n\t\telse cout << cost << endl;}return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3284,
"score_of_the_acc": -0.0032,
"final_rank": 2
},
{
"submission_id": "aoj_0234_2196111",
"code_snippet": "#include<bits/stdc++.h>\n#define INF 0x3f3f3f3f\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nint c[11][10], d[11][10][55][1 << 10];\nint dx[]{ 1,0,0 }, dy[]{ 0,1,-1 };\nstruct st { int x, y, p, v, c; };\nbool operator<(st a, st b) { return a.c > b.c; }\nint main() {\n\tint w, h;\n\twhile (scanf(\"%d%d\", &w, &h), w) {\n\t\tint f, m, o; scanf(\"%d%d%d\", &f, &m, &o);\n\t\trep(i, h)rep(j, w)scanf(\"%d\", &c[i + 1][j]);\n\t\tpriority_queue<st>que;\n\t\tmemset(d, 0x3f, sizeof(d));\n\t\trep(i, w) {\n\t\t\td[0][i][o][0] = 0; que.push({ 0,i,o,0,0 });\n\t\t}\n\t\twhile (!que.empty()) {\n\t\t\tst p = que.top(); que.pop();\n\t\t\tif (d[p.x][p.y][p.p][p.v] != p.c)continue;\n\t\t\tif (p.p == 1)continue;\n\t\t\trep(i, 3) {\n\t\t\t\tint nx = p.x + dx[i], ny = p.y + dy[i];\n\t\t\t\tif (!(nx <= h && 0 <= ny&&ny < w))continue;\n\t\t\t\tint a = min(m, ((c[nx][ny] > 0 && (!i || !(p.v >> ny & 1))) ? p.p - 1 + c[nx][ny] : p.p - 1));\n\t\t\t\tif (a <= 0)continue;\n\t\t\t\tint b = ((c[nx][ny] < 0 && (!i || !(p.v >> ny & 1))) ? p.c - c[nx][ny] : p.c);\n\t\t\t\tint e = ((i ? p.v : 0) | 1 << ny);\n\t\t\t\tif (d[nx][ny][a][e] > b) {\n\t\t\t\t\td[nx][ny][a][e] = b; que.push({ nx,ny,a,e,b });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint Min = INF;\n\t\trep(i, w)rep(j, m + 1)rep(k, 1 << w)Min = min(Min, d[h][i][j][k]);\n\t\tif (Min > f)puts(\"NA\");\n\t\telse printf(\"%d\\n\", Min);\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 27576,
"score_of_the_acc": -0.8277,
"final_rank": 17
},
{
"submission_id": "aoj_0234_2196094",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1001001001;\n\nint W, H, F, M, O;\nint fld[15][15];\n\nstruct data {\n\tint y, x, s, o, f;\n\tdata(int y, int x, int s, int o, int f)\n\t\t:y(y), x(x), s(s), o(o), f(f) {}\n\n\tbool operator<(const data &d)const {\n\t\treturn f>d.f;\n\t}\n};\n\nint dist[15][15][1 << 10][50];\n\nvoid solve() {\n\tfill_n(***dist, 15 * 15 * (1 << 10) * 50, INF);\n\tpriority_queue<data>que;\n\tfor (int i = 0; i<W; i++) {\n\t\tdist[0][i][1 << i][O] = 0;\n\t\tque.push(data(0, i, 1 << i, O, 0));\n\t}\n\n\twhile (que.size()) {\n\t\tdata d = que.top(); que.pop();\n\t\tif (dist[d.y][d.x][d.s][d.o]<d.f)continue;\n\t\tif (d.o == 0)continue;\n\t\tfor (int i = -1; i <= 1; i += 2) {\n\t\t\tint ny = d.y, nx = d.x + i;\n\t\t\tif (nx<0 || nx >= W)continue;\n\t\t\tint ns, no, nf;\n\t\t\tif (d.s >> nx & 1) {\n\t\t\t\tns = d.s; no = d.o - 1; nf = d.f;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tns = d.s | (1 << nx);\n\t\t\t\tno = min(M, d.o - 1 + (fld[ny][nx] >= 0 ? fld[ny][nx] : 0));\n\t\t\t\tnf = d.f + (fld[ny][nx] >= 0 ? 0 : -fld[ny][nx]);\n\t\t\t}\n\t\t\tif (no<0)continue;\n\t\t\tif (dist[ny][nx][ns][no] <= nf)continue;\n\t\t\tdist[ny][nx][ns][no] = nf;\n\t\t\tque.push(data(ny, nx, ns, no, nf));\n\t\t}\n\n\t\tint ny = d.y + 1, nx = d.x;\n\t\tif (ny>H)continue;\n\t\tint ns, no, nf;\n\t\tns = 1 << nx;\n\t\tno = min(M, d.o - 1 + (fld[ny][nx] >= 0 ? fld[ny][nx] : 0));\n\t\tnf = d.f + (fld[ny][nx] >= 0 ? 0 : -fld[ny][nx]);\n\t\tif (no<0)continue;\n\t\tif (dist[ny][nx][ns][no] <= nf)continue;\n\t\tdist[ny][nx][ns][no] = nf;\n\t\tque.push(data(ny, nx, ns, no, nf));\n\t}\n\n\tint mi = INF;\n\tfor (int j = 0; j<W; j++) {\n\t\tfor (int o = 0; o <= M; o++) {\n\t\t\tmi = min(mi, dist[H][j][1 << j][o]);\n\t\t}\n\t}\n\n\tif (mi>F)cout << \"NA\" << endl;\n\telse cout << mi << endl;\n}\n\nint main() {\n\twhile (cin >> W >> H, W || H) {\n\t\tcin >> F >> M >> O; M--; O--;\n\t\tfor (int i = 1; i <= H; i++) {\n\t\t\tfor (int j = 0; j<W; j++) {\n\t\t\t\tcin >> fld[i][j];\n\t\t\t}\n\t\t}\n\t\tsolve();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 48228,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0234_1760012",
"code_snippet": "#include <iostream>\n#include <string.h>\n#include <algorithm>\n\nusing namespace std;\nstatic const int INF = 1e9;\nint memo[10][10][10][10][50];\nint W, H;\nint field[10][10];\nint f, o, olimit;\n\n\nint rec(int y, int x, int l, int r, int oxy)\n{\n\tif (oxy <= 0)\n\t{\n\t\treturn(INF);\n\t}\n\tif (y == H - 1)\n\t{\n\t\treturn(0);\n\t}\n\tif (memo[y][x][l][r][oxy] >= 0)\n\t{\n\t\treturn(memo[y][x][l][r][oxy]);\n\t}\n\n\tif (oxy == 1) return (INF);\n\n\tint cost = 0;\n\tint oxygen = 0;\n\tint res = INF;\n\tif (x > 0)\n\t{\n\t\tif (l > x - 1)\n\t\t{\n\t\t\tif (field[y][x - 1] < 0)\n\t\t\t{\n\t\t\t\tcost = -field[y][x - 1];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\toxygen = field[y][x - 1];\n\t\t\t}\n\t\t}\n\t\tres = min(res, rec(y, x - 1, min(l, x - 1), r, min(olimit, oxy + oxygen - 1)) + cost);\n\t}\n\tif (x < W - 1)\n\t{\n\t\tcost = 0;\n\t\toxygen = 0;\n\t\tif (x + 1 > r)\n\t\t{\n\t\t\tif (field[y][x + 1] < 0)\n\t\t\t{\n\t\t\t\tcost = -field[y][x + 1];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\toxygen = field[y][x + 1];\n\t\t\t}\n\t\t}\n\t\tres = min(res, rec(y, x + 1, l, max(r, x + 1), min(olimit, oxy + oxygen - 1)) + cost);\n\t}\n\n\tcost = 0;\n\toxygen = 0;\n\tif (field[y + 1][x] < 0)\n\t{\n\t\tcost = -field[y + 1][x];\n\t}\n\telse\n\t{\n\t\toxygen = field[y + 1][x];\n\t}\n\tres = min(res, rec(y + 1, x, x, x, min(olimit, oxy + oxygen - 1)) + cost);\n\treturn(memo[y][x][l][r][oxy] = res);\n}\n\nvoid solve()\n{\n\twhile (cin >> W >> H, W || H)\n\t{\n\t\tcin >> f >> olimit >> o;\n\t\tfor (int i = 0; i < H; ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < W; ++j)\n\t\t\t{\n\t\t\t\tcin >> field[i][j];\n\t\t\t}\n\t\t}\n\t\tif (o <= 1)\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tmemset(memo, -1, sizeof(memo));\n\t\tint ans = INF;\n\t\tfor (int i = 0; i < W; ++i)\n\t\t{\n\t\t\tint cost = 0;\n\t\t\tint oxy = 0;\n\t\t\tif (field[0][i] < 0)\n\t\t\t{\n\t\t\t\tcost = -field[0][i];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\toxy = field[0][i];\n\t\t\t}\n\t\t\tans = min(ans, rec(0, i, i, i, min(olimit, o + oxy - 1)) + cost);\n\t\t}\n\t\tif (ans == INF || ans > f)\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3172,
"score_of_the_acc": -0.0007,
"final_rank": 1
},
{
"submission_id": "aoj_0234_1660806",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint g[12][12][60][12][12];//y, x, air, l, r\nint event[12][12];\nint w, h, f, m, o;\nint dx[] = {1, 0, -1}, dy[] = {0, 1, 0};\n\ntypedef struct state{\n int cost, air, x, y, l, r;\n bool operator<(const state &a)const{\n return cost < a.cost;\n }\n bool operator>(const state &a)const{\n return cost > a.cost;\n }\n}state;\n\nbool range(int y, int x){\n return (0 <= x and x < w and\n 0 <= y and y < h);\n}\n\nvoid solve(){\n priority_queue<state, vector<state>, greater<state> > que;\n for (int i = 0; i < w; i++) {\n if(m <= 1)continue;\n if(event[0][i] < 0){\n g[0][i][m - 1][i][i] = -event[0][i];\n state tmp = (state){-event[0][i], m - 1, i, 0, i, i};\n que.push(tmp);\n }else{\n int air = min(o, m + event[0][i] - 1);\n g[0][i][air][i][i] = 0;\n state tmp = (state){0, air, i, 0, i, i};\n que.push(tmp);\n } \n }\n while(not que.empty()){\n state tmp = que.top();\n que.pop();\n int l = tmp.l, r = tmp.r;\n int cost = tmp.cost;\n int air = tmp.air;\n int x = tmp.x, y = tmp.y;\n if(air <= 1)continue;\n for (int i = 0; i < 3; i++) {\n int nx = x + dx[i], ny = y + dy[i];\n if(not range(ny, nx))continue;\n int nl = min(l, nx), nr = max(r, nx);\n if(y != ny){\n nl = nx;\n nr = nx;\n }\n if(event[ny][nx] < 0){\n int add = -event[ny][nx];\n if(l <= nx and nx <= r and y == ny)add = 0;\n if(g[ny][nx][air - 1][nl][nr] > cost + add){\n g[ny][nx][air - 1][nl][nr] = cost + add;\n int c = cost + add;\n tmp = (state){c, air - 1, nx, ny, nl, nr};\n que.push(tmp);\n }\n }else{\n int nair = min(air - 1 + event[ny][nx], o);\n if(l <= nx and nx <= r and y == ny)\n nair = air - 1;\n if(g[ny][nx][nair][nl][nr] > cost){\n g[ny][nx][nair][nl][nr] = cost;\n tmp = (state){cost, nair, nx, ny, nl, nr};\n que.push(tmp);\n }\n }\n }\n }\n}\n\nvoid init(){\n for (int i = 0; i < h; i++) \n for (int j = 0; j < w; j++) \n for (int k = 0; k <= o; k++) \n for (int l = 0; l < w; l++) \n for (int m = 0; m < w; m++) \n g[i][j][k][l][m] = 1e9;\n}\n\n\nint main(){\n while(std::cin >> w >> h, w){\n std::cin >> f >> o >> m;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n std::cin >> event[i][j];\n }\n }\n init();\n solve();\n int ans = 1e9;\n for (int i = 0; i < w; i++) {\n for (int j = 1; j <= o; j++) {\n for (int k = 0; k < w; k++) {\n for (int l = 0; l < w; l++) {\n ans = min(ans, g[h - 1][i][j][k][l]);\n }\n }\n }\n }\n if(ans > f)std::cout << \"NA\" << std::endl;\n else std::cout << ans << std::endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4924,
"score_of_the_acc": -0.111,
"final_rank": 9
},
{
"submission_id": "aoj_0234_1654482",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\nusing namespace std;\ntypedef vector<int> vi;\ntypedef long double D;\n\nint d[12][11][11][11][55]; //d[curh][curw][l][r][oxy]\n\nint main(){\n int w,h;\n while(cin >> w >> h, w){\n int f, m, o;\n cin >> f >> m >> o;\n\n vector<vi> c(h, vi(w,0));\n rep(i,h)rep(j,w)cin >> c[i][j];\n\n if(o<=1){\n cout << \"NA\" << endl;\n continue;\n }\n\n memset(d,-1,sizeof(d));\n priority_queue< vi, vector<vi>, greater<vi> > q;\n\n rep(i,w){\n int no = o-1, nv = 0;\n if(c[0][i] > 0){\n\tno = min(m, no+c[0][i]);\n }else{\n\tnv = -c[0][i];\n }\n d[0][i][i][i][no] = nv;\n q.push( {nv,0,i,i,i,no} );\n }\n\n int ans = 1e9;\n while(q.size()){\n vi s = q.top(); q.pop();\n int v = s[0], y = s[1], x = s[2], l = s[3], r = s[4], o = s[5];\n if(y==h-1){\n\tans = v;\n\tbreak;\n }\n if(o<=1)continue;\n\n if(x-1>=0){\n\tint nx = x-1, ny = y, nl = l, nr = r, no = o-1, nv = v;\n\tif(nx < nl){\n\t nl--;\n\t if(c[ny][nx] > 0){\n\t no = min(m, no+c[ny][nx]);\n\t }else{\n\t nv -= c[ny][nx];\n\t }\n\t}\n\tif(d[ny][nx][nl][nr][no] < 0 || d[ny][nx][nl][nr][no] > nv){\n\t d[ny][nx][nl][nr][no] = nv;\n\t q.push( {nv,ny,nx,nl,nr,no} );\n\t}\n }\n\n if(x+1<w){\n\tint nx = x+1, ny = y, nl = l, nr = r, no = o-1, nv = v;\n\tif(nx > nr){\n\t nr++;\n\t if(c[ny][nx] > 0){\n\t no = min(m, no+c[ny][nx]);\n\t }else{\n\t nv -= c[ny][nx];\n\t }\n\t}\n\tif(d[ny][nx][nl][nr][no] < 0 || d[ny][nx][nl][nr][no] > nv){\n\t d[ny][nx][nl][nr][no] = nv;\n\t q.push( {nv,ny,nx,nl,nr,no} );\n\t}\n }\n\n if(y+1<h){\n\tint nx = x, ny = y+1, nl = x, nr = x, no = o-1, nv = v;\n\tif(c[ny][nx] > 0){\n\t no = min(m, no+c[ny][nx]);\n\t}else{\n\t nv -= c[ny][nx];\n\t}\n\n\tif(d[ny][nx][nl][nr][no] < 0 || d[ny][nx][nl][nr][no] > nv){\n\t d[ny][nx][nl][nr][no] = nv;\n\t q.push( {nv,ny,nx,nl,nr,no} );\n\t}\n }\n }\n\n if(ans > f){\n cout << \"NA\" << endl;\n }else{\n cout << ans << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6712,
"score_of_the_acc": -0.0792,
"final_rank": 5
},
{
"submission_id": "aoj_0234_1543198",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int INF=1001001001;\n\nint W,H,F,M,O;\nint fld[15][15];\n\nstruct data{\n int y,x,s,o,f;\n data(int y,int x,int s,int o,int f)\n :y(y),x(x),s(s),o(o),f(f){}\n\n bool operator<(const data &d)const{\n return f>d.f;\n }\n};\n\nint dist[15][15][1<<10][50];\n\nvoid solve(){\n fill_n(***dist,15*15*(1<<10)*50,INF);\n priority_queue<data>que;\n for(int i=0;i<W;i++){\n dist[0][i][1<<i][O]=0;\n que.push(data(0,i,1<<i,O,0));\n }\n\n while(que.size()){\n data d=que.top();que.pop();\n if(dist[d.y][d.x][d.s][d.o]<d.f)continue;\n if(d.o==0)continue;\n for(int i=-1;i<=1;i+=2){\n int ny=d.y,nx=d.x+i;\n if(nx<0||nx>=W)continue;\n int ns,no,nf;\n if(d.s>>nx&1){\n ns=d.s;no=d.o-1;nf=d.f;\n }\n else{\n ns=d.s|(1<<nx);\n no=min(M,d.o-1+(fld[ny][nx]>=0?fld[ny][nx]:0));\n nf=d.f+(fld[ny][nx]>=0?0:-fld[ny][nx]);\n }\n if(no<0)continue;\n if(dist[ny][nx][ns][no]<=nf)continue;\n dist[ny][nx][ns][no]=nf;\n que.push(data(ny,nx,ns,no,nf));\n }\n\n int ny=d.y+1,nx=d.x;\n if(ny>H)continue;\n int ns,no,nf;\n ns=1<<nx;\n no=min(M,d.o-1+(fld[ny][nx]>=0?fld[ny][nx]:0));\n nf=d.f+(fld[ny][nx]>=0?0:-fld[ny][nx]);\n if(no<0)continue;\n if(dist[ny][nx][ns][no]<=nf)continue;\n dist[ny][nx][ns][no]=nf;\n que.push(data(ny,nx,ns,no,nf));\n }\n\n int mi=INF;\n for(int j=0;j<W;j++){\n for(int o=0;o<=M;o++){\n mi=min(mi,dist[H][j][1<<j][o]);\n }\n }\n\n if(mi>F)cout<<\"NA\"<<endl;\n else cout<<mi<<endl;\n}\n\nint main(){\n while(cin>>W>>H,W||H){\n cin>>F>>M>>O;M--;O--;\n for(int i=1;i<=H;i++){\n for(int j=0;j<W;j++){\n cin>>fld[i][j];\n }\n }\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 46328,
"score_of_the_acc": -1.6721,
"final_rank": 19
},
{
"submission_id": "aoj_0234_1463870",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define pb push_back\n#define fr first\n#define sc second\ntypedef pair<int, int> Pii;\ntypedef pair<int, Pii> Pip;\ntypedef vector<int> Vi;\nconst int INF = (1<<25);\nconst int MAX_V = 101;\nconst int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};\n\nint w, h, f, m;\nint c[10][10];\n\nstruct State {\n int x, y, l, r, oxy, cost;\n State(int x_, int y_, int l_, int r_, int oxy_, int cost_) {\n x=x_; y=y_; l=l_; r=r_; oxy=oxy_; cost=cost_;\n }\n State(){}\n};\n\nbool operator<(const State& a, const State& b) {\n return a.cost > b.cost;\n}\n\nint d[10][10][10][10][51];\n\nint solve(int o) {\n if( o < 2 ) return INF;\n\n for(int y=0; y<10; y++) {\n for(int x=0; x<10; x++) {\n for(int l=0; l<10; l++) {\n\tfor(int r=0; r<10; r++) {\n\t for(int m=0; m<51; m++) {\n\t d[y][x][l][r][m] = INF;\n\t }\n\t}\n }\n }\n }\n\n priority_queue<State> q;\n for(int x=0; x<w; x++) {\n int cost = -1 * min(c[0][x], 0);\n int oxy = min(m, o - 1 + max(c[0][x], 0));\n d[0][x][x][x][oxy] = cost;\n q.push(State(x, 0, x, x, oxy, cost));\n }\n\n int res = INF;\n while( !q.empty() ) {\n State p = q.top(); q.pop();\n int x = p.x, y = p.y, l = p.l, r = p.r;\n int oxy = p.oxy, cost = d[y][x][l][r][oxy];\n\n if( oxy == 0 ) continue;\n if( f < cost ) return INF;\n if( y == h-1 ) {\n res = cost; \n break;\n }\n if( oxy == 1 ) continue;\n\n for(int dx=-1; dx<=1; dx+=2) {\n int mx = x + dx;\n if( mx < 0 || w <= mx ) continue;\n\n int l_ = min(l, mx), r_ = max(r, mx);\n int next_cost = cost, next_oxy;\n if( l_ == l && r_ == r ) {\n\tnext_oxy = oxy -1;\n }\n else {\n\tnext_cost += -1 * min(c[y][mx], 0);\n\tnext_oxy = min(m, oxy - 1 + max(c[y][mx], 0));\n }\n if( next_cost < d[y][mx][l_][r_][next_oxy] ) {\n\td[y][mx][l_][r_][next_oxy] = next_cost;\n\tq.push(State(mx, y, l_, r_, next_oxy, next_cost));\n }\n }\n\n if( y < h-1 ) {\n int next_cost = cost + -1 * min(c[y+1][x], 0);\n int next_oxy = min(m, oxy - 1 + max(c[y+1][x], 0));\n if( next_cost < d[y+1][x][x][x][next_oxy] ) {\n\td[y+1][x][x][x][next_oxy] = next_cost;\n\tq.push(State(x, y+1, x, x, next_oxy, next_cost));\n }\n }\n }\n if( f < res ) return INF;\n return res;\n}\n\nint main() {\n while( cin >> w >> h, w || h ) {\n int o;\n cin >> f >> m >> o;\n for(int y=0; y<h; y++) {\n for(int x=0; x<w; x++) {\n\tcin >> c[y][x];\n }\n }\n\n int ans = solve(o);\n if( ans == INF ) cout << \"NA\" << endl;\n else cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3324,
"score_of_the_acc": -0.0041,
"final_rank": 3
},
{
"submission_id": "aoj_0234_1460110",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst long long INF = 1LL << 60;\ntypedef long long int64;\n\nint W, H;\nint f, m, o;\nint c[10][10];\n\nint64 dp[10][10][51][1 << 10];\nint64 rec(int x, int y, int air, int dig)\n{\n if(x < 0 || x >= W || air <= 0) return(INF);\n if(y + 1 == H) return(max(0, -c[y][x]));\n air = min(m, air + max(0, c[y][x]) * (1 - ((dig >> x) & 1)));\n if(~dp[x][y][air][dig]) return(dp[x][y][air][dig]);\n int64 ret = INF;\n ret = min(ret, rec(x - 1, y, air - 1, dig|(1 << x)));\n ret = min(ret, rec(x + 1, y, air - 1, dig|(1 << x)));\n ret = min(ret, rec(x, y + 1, air - 1, 0));\n return(dp[x][y][air][dig] = min< long long >(INF, ret + (1 - ((dig >> x) & 1)) * max(0, -c[y][x])));\n}\nmain()\n{\n while(cin >> W >> H, W) {\n fill_n(***dp, 10 * 10 * 51 * (1 << 10), -1);\n cin >> f >> m >> o;\n for(int i = 0; i < H; i++) {\n for(int j = 0; j < W; j++) {\n cin >> c[i][j];\n }\n }\n int64 ret = INF;\n for(int i = 0; i < W; i++) {\n ret = min(ret, rec(i, 0, o - 1, 0));\n }\n if(ret > f) cout << \"NA\" << endl;\n else cout << ret << endl;\n }\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 41996,
"score_of_the_acc": -1.4689,
"final_rank": 18
},
{
"submission_id": "aoj_0234_1417733",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<set>\n#include<map>\n#include<cstring>\n#include<string>\n#include<sstream>\n#include<complex>\n#include<tuple>\n#include<cassert>\nusing namespace std;\n\n#define reep(i, s, n) for(int i=s;i<(int)n;i++)\n#define rep(i, n) for(int i=0;i<(int)n;i++)\n#define REP(i, n) for(int i=0;i<(int)n;i++)\n#define all(v) v.begin(), v.end()\n#define tyd typedef\n#define vc vector\n#define pb push_Back\n#define eb emplace_back\n#define mp make_pair\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\nconst int IINF = 1<<28;\n\nint dx[] = { -1, 1 ,0};\nint dy[] = { 0, 0, 1 };\n\nint field[16][16];\nint h, w;\nint f, m, o;\n\nstruct Node{\n\tint x, y, cost, oxy, v;\n\tNode( int x, int y, int cost, int oxy, int v)\n\t\t:x(x), y(y), cost(cost), oxy(oxy), v(v)\n\t{}\n\n\tfriend bool operator < ( const Node& n1, const Node& n2 )\n\t{\n\t\treturn n1.cost > n2.cost;\n\t}\n};\n\nbool visited[15][15][55][2054];\nint dijkstra (){\n\tpriority_queue<Node> que;\n\tif(o == 1) return IINF;\n\trep(i, w){\n\t\tint cost = 0, oxy = o;\n\t\tif( field[0][i] < 0 ){\n\t\t\tcost += -field[0][i];\n\t\t}else{\n\t\t\toxy += field[0][i];\n\t\t}\n\t\tque.emplace(i, 0, cost, min(oxy - 1, m), 1 << i);\n\n\t}\n\n\tmemset(visited, 0, sizeof(visited));\n\n\tint ret = IINF;\n\twhile( !que.empty() ){\n\t\tNode n = que.top();\n\t\tque.pop();\n\t\tif(n.oxy <= 0) continue;\n\t\tif( n.cost > f ){\n\t\t\tbreak;\n\t\t}\n\t\tif( n.y == h-1 ){\n\t\t\tif( n.oxy > 0 ){\n\t\t\t\treturn n.cost;\n\t\t\t}else{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\tif( visited[n.y][n.x][n.oxy][n.v] ){\n\t\t\tcontinue;\n\t\t}\n\t\tvisited[n.y][n.x][n.oxy][n.v] = true;\n\t\tif(n.oxy <= 1) continue;\n\t\trep(i, 3){\n\t\t\tint nx = n.x + dx[i];\n\t\t\tint ny = n.y + dy[i];\n\t\t\tint nv = n.v;\n\t\t\tif( nx < 0 || nx >= w ){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(ny != n.y) nv = 0;\n\t\t\tint cost = n.cost;\n\t\t\tint oxy = n.oxy - 1;\n\t\t\t\n\t\t\tif((nv & (1<<nx)) == 0){\n\t\t\t\tif( field[ny][nx] > 0 ){\n\t\t\t\t\toxy += field[ny][nx];\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tcost += -field[ny][nx];\n\t\t\t\t}\n\t\t\t}\n\t\t\tque.emplace(nx, ny, cost, min(oxy, m), nv | (1 << nx));\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nint main(){\n\twhile(cin >> w >> h) {\n\t\tif(!w && !h) break;\n\t\tcin >> f >> m >> o;\n\t\trep(i, h) {\n\t\t\trep(j, w) {\n\t\t\t\tcin >> field[i][j];\n\t\t\t}\n\t\t}\n\n\t\tint ans = IINF;\n\t\tans = min(ans, dijkstra());\n\t\tif( ans == IINF || ans > f ){\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse{\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 26232,
"score_of_the_acc": -0.655,
"final_rank": 16
}
] |
aoj_0239_cpp
|
カロリー計算
食べ物には3大栄養素と呼ばれる「たんぱく質」「脂質」「炭水化物」の３つの栄養素が含まれています。１g（グラム）あたりたんぱく質と炭水化物は 4 kcal（キロカロリー）、脂質は 9 kcal と計算されます。たとえば、下の表によると番号１のケーキにはタンパク質 7 g、脂質 14 g、炭水化物 47 g が含まれています。これをもとに含まれるカロリーを計算すると、4 × 7 + 9 × 14 + 4 × 47 = 342 kcal となります。その他も同様に計算されています。
番号
名前
たんぱく質(g)
脂質(g)
炭水化物(g)
カロリー(kcal)
1
ケーキ
7
14
47
342
2
ポテトチップス
5
35
55
555
3
どら焼き
6
3
59
287
4
プリン
6
5
15
129
分類の対象となるお菓子の個数
n
と各お菓子の情報、制限の情報を入力とし、そのお菓子一つだけなら制限を超えることがない（食べてもよい）お菓子の一覧を出力するプログラムを作成してください。
お菓子の情報は、お菓子の番号
s
、そのお菓子に含まれるたんぱく質の重量
p
、脂質の重量
q
、炭水化物の重量
r
から構成されています。制限の情報には、含むことができる最大のたんぱく質の重量
P
、脂質の重量
Q
、炭水化物の重量
R
、および摂取することができる最大のカロリー
C
からなっており、タンパク質、脂質、炭水化物、カロリーのいずれかの一つでも超えると制限違反となり、「食べてはいけないお菓子」と判断されます。
食べてもよいお菓子の一覧は、食べてもよいお菓子の番号を入力順に出力してください。なお、食べてもよいお菓子がなければ”NA”と出力してください。
上の表にある4個のお菓子について、
P
= 10,
Q
= 15,
R
= 50,
C
= 400 という制限の場合、ケーキとプリンはそれぞれの栄養素及びカロリーが制限値以下なので食べてもよいお菓子に分類されますが、ポテトチップスは炭水化物とカロリー、どら焼きは炭水化物の量が制限値を超えているため食べてはいけないお菓子に分類されます。
入力
複数のデータセットの並びが与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
n
s
1
p
1
q
1
r
1
s
2
p
2
q
2
r
2
:
s
n
p
n
q
n
r
n
P
Q
R
C
1行目にお菓子の数
n
(1 ≤
n
≤ 1000)が与えられます。続く
n
行に第
i
のお菓子の番号
s
i
(1 ≤
s
i
≤ 1000)、各栄養素の重量を表す整数
p
i
,
q
i
,
r
i
(0 ≤
p
i
,
q
i
,
r
i
≤ 100) が与えられます。
続く行に各栄養素及びカロリーの制限値を表す整数
P
,
Q
,
R
(0 ≤
P
,
Q
,
R
≤ 100),
C
(0 ≤
C
≤ 1700) が与えられます。
データセットの数は 100 を超えません。
出力
データセットごとに、食べてもよいお菓子の番号または ”NA” を出力します。
入力例
4
1 7 14 47
2 5 35 55
3 6 3 59
4 6 5 15
10 15 50 400
2
1 8 10 78
2 4 18 33
10 10 50 300
0
出力例
1
4
NA
|
[
{
"submission_id": "aoj_0239_10869794",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {//4 4 9\n\tint n, s, p, q, r, P, Q, R, C;\n\twhile (1) {\n\t\tcin >> n;\n\t\tif (n == 0) break;\n\t\tvector<int> food, num(n), ps(n), qs(n), rs(n), cal(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> s >> p >> q >> r;\n\t\t\tnum[i] = s;\n\t\t\tps[i] = p;\n\t\t\tqs[i] = q;\n\t\t\trs[i] = r;\n\t\t\tcal[i] = p * 4 + q * 9 + r * 4;\n\t\t}\n\t\tcin >> P >> Q >> R >> C;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (ps[i] <= P && qs[i] <= Q && rs[i] <= R && cal[i] <= C) food.push_back(num[i]);\n\t\t}\n\t\tif (food.empty()) cout << \"NA\\n\";\n\t\telse for (auto i : food) cout << i << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3584,
"score_of_the_acc": -1,
"final_rank": 14
},
{
"submission_id": "aoj_0239_10834543",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n int n;\n\n while(1){\n cin >> n;\n if(n==0) break;\n int s[n],p[n],q[n],r[n],c[n];\n for(int i=0;i<n;i++){\n cin >> s[i] >> p[i] >> q[i] >> r[i];\n }\n for(int i=0;i<n;i++){\n c[i] = (p[i]+r[i])*4+q[i]*9;\n }\n\n int P,Q,R,C;\n cin >> P >> Q >> R >> C;\n \n int count = 0;\n for(int i=0;i<n;i++){\n if(p[i]<=P && q[i]<=Q && r[i]<=R && c[i]<=C){\n cout << s[i] << endl;\n count ++;\n }\n }\n if(count==0) cout << \"NA\" << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3452,
"score_of_the_acc": -0.766,
"final_rank": 13
},
{
"submission_id": "aoj_0239_10827255",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n\tint n,s[1001],p[1001],q[1001],r[1001],i,pp,qq,rr,cc,flg;\n\twhile(1){\n\t\tcin>>n;\n\t\tflg=0;\n\t\tif(n==0) break;\n\t\tfor(i=0;i<n;i++) cin>>s[i]>>p[i]>>q[i]>>r[i];\n\t\tcin>>pp>>qq>>rr>>cc;\n\t\tfor(i=0;i<n;i++){\n\t\t\tif(p[i]<=pp && q[i]<=qq && r[i]<=rr && p[i]*4+q[i]*9+r[i]*4<=cc){\n\t\t\t\tflg=1;\n\t\t\t\tcout<<s[i]<<endl;\n\t\t\t}\n\t\t}\n\t\tif(flg==0) cout<<\"NA\"<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3448,
"score_of_the_acc": -0.7589,
"final_rank": 12
},
{
"submission_id": "aoj_0239_9579458",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define kai \"\\n\"\n#define mo return 0\nlong long gcd(long long a,long long b){\n if(a%b==0){\n return b;\n }else{\n return gcd(b,a%b);\n }\n}\nlong long lcm(long long a,long long b){\n return a/gcd(a,b)*b;\n}\nint main(){\n for(int _=0;_<100;_++){\n int n;\n cin>>n;\n if(n==0){\n mo;\n }\n int s[n],p[n],q[n],r[n];\n for(int i=0;i<n;i++){\n cin>>s[i]>>p[i]>>q[i]>>r[i];\n }\n int P,Q,R,C;\n cin>>P>>Q>>R>>C;\n bool no=true;\n for(int i=0;i<n;i++){\n long long ke=p[i]*4+9*q[i]+4*r[i];\n if(p[i]<=P&&q[i]<=Q&&r[i]<=R&&ke<=C){\n cout<<s[i]<<kai;\n no=false;\n }\n }\n if(no){\n cout<<\"NA\\n\";\n }\n }\n\n mo;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3104,
"score_of_the_acc": -0.1489,
"final_rank": 2
},
{
"submission_id": "aoj_0239_8432557",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REP1(i,x) for(int i=1;i<=(int)(x);i++)\n#define REP2(i,s,e) for(int i=(int)(s);i<=(int)(e);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREP1(i,x) for(int i=((int)(x));i>=1;i--)\n#define RREP2(i,s,e) for(int i=((int)(e));i>=(int)(s);i--)\n#define ALL(x) (x).begin(),(x).end()\n#define INF (1'000'001'000)\n\nint main() {\n int n, P, Q, R, C;\n while (cin >> n) {\n if (n == 0) break;\n vector<int> s(n), p(n), q(n), r(n);\n REP(i, n) {\n cin >> s[i] >> p[i] >> q[i] >> r[i];\n }\n cin >> P >> Q >> R >> C;\n vector<int> ans;\n REP(i, n) {\n if ((p[i] <= P) && (q[i] <= Q) && (r[i] <= R) && (4*(p[i]+r[i])+9*q[i] <= C)) {\n ans.push_back(s[i]);\n }\n }\n if (ans.size() == 0) {\n cout << \"NA\" << endl;\n } else {\n REP(i, ans.size()) {\n cout << ans[i] << endl;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3372,
"score_of_the_acc": -0.6241,
"final_rank": 9
},
{
"submission_id": "aoj_0239_8432550",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REP1(i,x) for(int i=1;i<=(int)(x);i++)\n#define REP2(i,s,e) for(int i=(int)(s);i<=(int)(e);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREP1(i,x) for(int i=((int)(x));i>=1;i--)\n#define RREP2(i,s,e) for(int i=((int)(e));i>=(int)(s);i--)\n#define ALL(x) (x).begin(),(x).end()\n#define INF (1'000'001'000)\n\nint main() {\n int n, P, Q, R, C;\n while (cin >> n) {\n if (n == 0) break;\n vector<int> s(n), p(n), q(n), r(n);\n REP(i, n) {\n cin >> s[i] >> p[i] >> q[i] >> r[i];\n }\n cin >> P >> Q >> R >> C;\n vector<int> ans;\n REP(i, n) {\n if ((p[i] <= P) && (q[i] <= Q) && (r[i] <= R) && (4*(p[i]+r[i])+9*q[i] <= C)) {\n ans.push_back(s[i]);\n }\n }\n if (ans.size() == 0) {\n cout << \"NA\" << endl;\n } else {\n sort(ALL(ans));\n REP(i, ans.size()) {\n cout << ans[i] << endl;\n }\n }\n }\n return 0;\n}",
"accuracy": 0.25,
"time_ms": 10,
"memory_kb": 3352,
"score_of_the_acc": -0.5887,
"final_rank": 19
},
{
"submission_id": "aoj_0239_8212582",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n //ios::sync_with_stdio(false);\n// cin.tie(nullptr);\n\n for(int x=0;x<=110;x++){\n int n;\n int cnt = 0;\n cin >> n;\n if(n==0)break;\n int S[1100],P[1100],Q[1100],R[1100],C[1100];\n for(int a=1;a<=n;a++){\n cin >> S[a] >> P[a] >> Q[a] >> R[a];\n C[a] = (P[a]+R[a])*4+Q[a]*9;\n }\n int p,q,r,c;\n cin >> p >> q >> r >> c;\n for(int f=1;f<=n;f++){\n if(P[f]<=p&&Q[f]<=q&&R[f]<=r&&C[f]<=c){\n cout << S[f] << endl;\n cnt++;\n }\n }\n\tif(cnt==0)cout << \"NA\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3020,
"score_of_the_acc": -1,
"final_rank": 14
},
{
"submission_id": "aoj_0239_8204840",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(void){\n int i, n, P, Q, R, C;\n while (true) {\n cin >> n;\n if (n == 0) break;\n int s[n], p[n], q[n], r[n], Possible[n];\n int calorie = 0;\n bool flag = true;\n for (i = 0; i < n; i++) {\n cin >> s[i] >> p[i] >> q[i] >> r[i];\n }\n cin >> P >> Q >> R >> C;\n for (i = 0; i < n; i++) {\n calorie = 4 * p[i] + 9 * q[i] + 4 * r[i];\n if (p[i] <= P && q[i] <= Q && r[i] <= R && calorie <= C) {\n cout << s[i] << endl;\n flag = false;\n }\n }\n if (flag) cout << \"NA\" << endl;\n \n \n }\n \n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3108,
"score_of_the_acc": -0.156,
"final_rank": 3
},
{
"submission_id": "aoj_0239_8204836",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(void){\n int i, n, P, Q, R, C;\n while (cin >> n) {\n int s[n], p[n], q[n], r[n], Possible[n];\n int calorie = 0;\n bool flag = false;\n for (i = 0; i < n; i++) {\n cin >> s[i] >> p[i] >> q[i] >> r[i];\n }\n cin >> P >> Q >> R >> C;\n for (i = 0; i < n; i++) {\n calorie = 4 * p[i] + 9 * q[i] + 4 * r[i];\n if (p[i] <= P && q[i] <= Q && r[i] <= R && calorie <= C) {\n cout << s[i] << endl;\n flag = true;\n }\n }\n if (flag == false && n != 0) cout << \"NA\" << endl;\n \n \n }\n \n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3120,
"score_of_the_acc": -0.1773,
"final_rank": 5
},
{
"submission_id": "aoj_0239_7819026",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define gcd(x,y) __gcd(x,y) //最大公約数\n#define lcm(x,y) x/(__gcd(x,y))*y //最小公倍数\n\nint main() {\n while (1) {\n int n;\n cin >> n;\n if (n == 0) {\n break;\n }\n int data[n][4];\n int limit[4];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 4; j++) {\n cin >> data[i][j];\n }\n }\n for (int i = 0; i < 4; i++) {\n cin >> limit[i];\n }\n bool check = true;\n for (int i = 0; i < n; i++) {\n if (data[i][1] <= limit[0] && data[i][2] <= limit[1] && data[i][3] <= limit[2] && data[i][1] * 4 + data[i][2] * 9 + data[i][3] * 4 <= limit[3]) {\n cout << data[i][0] << \"\\n\";\n check = false;\n }\n }\n if (check) {\n cout << \"NA\\n\";\n }\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3112,
"score_of_the_acc": -0.1631,
"final_rank": 4
},
{
"submission_id": "aoj_0239_7568579",
"code_snippet": "#include<iostream>\n#include<queue>\n\nusing namespace std;\n\nstruct food {\n int s;\n int p;\n int q;\n int r;\n int c;\n\n food() {\n cin >> s >> p >> q >> r;\n c = p * 4 + q * 9 + r * 4;\n }\n\n bool Nut_Is_OK(int P, int Q, int R, int C) {\n return (p <= P && q <= Q && r <= R && c <= C);\n }\n};\n\nint main(void) {\n int n;\n queue<food> foods;\n int S, P, Q, R, C;\n\n for (int d = 0; d < 100; d++) {\n // nの受け取り\n cin >> n;\n if (cin.eof() || n == 0) return 0;\n\n // n個の構造体food[n]の読み込みとカロリー計算\n for (int i = 0; i < n; i++) {\n food latest_read;\n // cerr << latest_read.s << \" \" << latest_read.p << \" \" << latest_read.q << \" \" << latest_read.r << \" \" << latest_read.c << endl;\n foods.push(latest_read);\n }\n\n // 判定部\n cin >> P >> Q >> R >> C;\n\n bool OKfood_is_nothing = false; // true -> falseに修正\n for (int i = 0; i < n; i++) {\n if (foods.front().Nut_Is_OK(P, Q, R, C)) {\n cout << foods.front().s << endl;\n foods.pop();\n OKfood_is_nothing = true; // false -> trueに修正\n break; // 一つの食品が見つかったら、ループを終了します\n }\n else foods.pop();\n }\n if (!OKfood_is_nothing) cout << \"NA\" << endl; // true -> falseに修正\n\n while (!foods.empty()) foods.pop();\n }\n\n return 0;\n}",
"accuracy": 0.25,
"time_ms": 10,
"memory_kb": 3084,
"score_of_the_acc": -0.1135,
"final_rank": 17
},
{
"submission_id": "aoj_0239_7415648",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct A {\n int s, p, q, r, c;\n};\n\nint main() {\n int n;\n while (cin >> n, n) {\n A a;\n vector<A> v;\n for (int i = 0; i < n; i++) {\n cin >> a.s >> a.p >> a.q >> a.r;\n a.c = 4 * a.p + 9 * a.q + 4 * a.r;\n v.emplace_back(a);\n }\n int P, Q, R, C;\n cin >> P >> Q >> R >> C;\n bool f = true;\n for (auto& e : v) {\n if (e.p <= P && e.q <= Q && e.r <= R && e.c <= C) {\n f = false;\n cout << e.s << \"\\n\";\n }\n }\n if (f) cout << \"NA\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3388,
"score_of_the_acc": -0.6525,
"final_rank": 10
},
{
"submission_id": "aoj_0239_6954740",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while(1){\n int n,s[1001],p[1001],q[1001],r[1001],c[1001],P,Q,R,C,sum=0;\n cin >> n;\n if(n==0){\n break;\n }\n for(int i=0; i<n; i++){\n c[i]=0;\n }\n for(int i=0; i<n; i++){\n cin >> s[i] >> p[i] >> q[i] >> r[i];\n c[i]+=(p[i]*4)+(q[i]*9)+(r[i]*4);\n }\n cin >> P >> Q >> R >> C;\n for(int i=0; i<n; i++){\n if((p[i]<=P)&&(q[i]<=Q)&&(r[i]<=R)&&(c[i]<=C)){\n cout << s[i] << endl;\n sum+=1;\n }\n }\n if(sum==0){\n cout << \"NA\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3092,
"score_of_the_acc": -0.1277,
"final_rank": 1
},
{
"submission_id": "aoj_0239_6912338",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\nint a,b,c,d,e,f;\nvector<vector<int> > snack(5,vector<int> (1000));\nwhile (true){\n cin>>a;\n if(a==0){\n break;\n }\n for(int i=0;i<a;i+=1){\n cin>>snack.at(0).at(i)>>snack.at(1).at(i)>>snack.at(2).at(i)>>snack.at(3).at(i);\n snack.at(4).at(i)=(snack.at(3).at(i)+snack.at(1).at(i))*4+snack.at(2).at(i)*9;\n }\n cin>>b>>c>>d>>e;\n f=0;\n for(int i=0;i<a;i+=1){\n if(!(b<snack.at(1).at(i)||c<snack.at(2).at(i)||d<snack.at(3).at(i)||e<snack.at(4).at(i))){\n cout<<snack.at(0).at(i)<<endl;\n f+=1;\n }\n }\n if(f==0){\n cout<<\"NA\"<<endl;\n }\n}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3132,
"score_of_the_acc": -0.1986,
"final_rank": 6
},
{
"submission_id": "aoj_0239_5887713",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(void){\n while(1){\n int n;\n cin>>n;\n if(n==0){\n return 0;\n }else{\n int s[n],p[n],q[n],r[n],c[n];\n for(int i=0;i<n;i++){\n cin>>s[i]>>p[i]>>q[i]>>r[i];\n c[i]=p[i]*4+q[i]*9+r[i]*4;\n }\n int P,Q,R,C;\n cin>>P>>Q>>R>>C;\n vector<int> v;\n for(int i=0;i<n;i++){\n if(p[i]<=P && q[i]<=Q && r[i]<=R && c[i]<=C){\n v.push_back(s[i]);\n }\n }\n if(v.size()-0==0){\n cout<<\"NA\"<<endl;\n }else{\n for(int i=0;i<v.size();i++){\n cout<<v[i]<<endl;\n }\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3200,
"score_of_the_acc": -0.3191,
"final_rank": 8
},
{
"submission_id": "aoj_0239_5887690",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(void){\n while(1){\n int n;\n cin>>n;\n if(n==0){\n return 0;\n }else{\n int s[n],p[n],q[n],r[n],c[n];\n for(int i=0;i<n;i++){\n cin>>s[i]>>p[i]>>q[i]>>r[i];\n c[i]=p[i]*4+q[i]*9+r[i]*4;\n }\n int P,Q,R,C;\n cin>>P>>Q>>R>>C;\n vector<int> v;\n for(int i=0;i<n;i++){\n if(p[i]<=P && q[i]<=Q && r[i]<=R && c[i]<=C){\n v.push_back(s[i]);\n }\n }\n if(v.size()-0==0){\n cout<<\"NA\"<<endl;\n }else{\n sort(v.begin(),v.end());\n for(int i=0;i<v.size();i++){\n cout<<v[i]<<endl;\n }\n }\n }\n }\n return 0;\n}",
"accuracy": 0.25,
"time_ms": 20,
"memory_kb": 3204,
"score_of_the_acc": -1.3262,
"final_rank": 20
},
{
"submission_id": "aoj_0239_5815223",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<set>\n#include<bitset>\n#include<vector>\n#include<string>\n#include <iomanip>\n#include <deque>\n#include<list>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\nusing ll=long long;\nusing P=pair<int,int>;\nusing P_S=pair<int,string>;\nusing P_D=pair<double,int>;\nusing T=tuple<int,int,char,ll,string>;\n\nstruct food{\n int num;\n int a;\n int b;\n int c;\n int d;\n};\n\nint main()\n{\n while(1){\n int N;\n cin>>N;\n if(N==0) break;\n vector<food> F(N); \n rep(i,N){\n cin>>F[i].num>>F[i].a>>F[i].b>>F[i].c;\n F[i].d=F[i].a*4+F[i].b*9+F[i].c*4;\n }\n int P,Q,R,C;\n cin>>P>>Q>>R>>C;\n vector<int> ans;\n rep(i,N){\n if(F[i].a<=P&&F[i].b<=Q&&F[i].c<=R&&F[i].d<=C) ans.push_back(F[i].num);\n }\n if(ans.empty()) cout<<\"NA\"<<endl;\n else{\n rep(i,ans.size()) cout<<ans[i]<<endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3136,
"score_of_the_acc": -0.2057,
"final_rank": 7
},
{
"submission_id": "aoj_0239_5745279",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n int n;\n cin >> n;\n if(n == 0) break;\n vector<vector<long long int> > vec(n,vector<long long int>(4));\n for(int i=0;i<n;i++) for(int j=0;j<4;j++) cin >> vec[i][j];\n long long int P,Q,R,C;\n cin >> P >> Q >> R >> C;\n bool flag = false;\n for(int i=0;i<n;i++){\n if(vec[i][1] <= P && vec[i][2] <= Q && vec[i][3] <= R && vec[i][1]*4+vec[i][2]*9+vec[i][3]*4 <= C){\n flag = true;\n cout << vec[i][0] << endl;\n }\n }\n if(!flag) cout << \"NA\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3212,
"score_of_the_acc": -1.3404,
"final_rank": 16
},
{
"submission_id": "aoj_0239_5745270",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n int n;\n cin >> n;\n if(n == 0) break;\n vector<vector<long long int> > vec(1000,vector<long long int>(3,1000000000));\n for(int i=0;i<n;i++){\n int s;\n long long int p,q,r;\n cin >> s >> p >> q >> r;\n s--;\n vec[s][0] = p;\n vec[s][1] = q;\n vec[s][2] = r;\n }\n long long int P,Q,R,C;\n cin >> P >> Q >> R >> C;\n bool flag = false;\n for(int i=0;i<1000;i++){\n if(vec[i][0] <= P && vec[i][1] <= Q && vec[i][2] <= R && vec[i][0]*4+vec[i][1]*9+vec[i][2]*4 <= C){\n flag = true;\n cout << i+1 << endl;\n }\n }\n if(!flag) cout << \"NA\" << endl;\n }\n}",
"accuracy": 0.25,
"time_ms": 10,
"memory_kb": 3196,
"score_of_the_acc": -0.3121,
"final_rank": 18
},
{
"submission_id": "aoj_0239_5725262",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint n,s[1000],p[1000],q[1000],r[1000],c[1000],P,Q,R,C;\n\twhile(cin>>n,n){\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>s[i]>>p[i]>>q[i]>>r[i];\n\t\t\tc[i]=p[i]*4+q[i]*9+r[i]*4;\n\t\t}\n\t\tcin>>P>>Q>>R>>C;\n\t\tbool ok=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(p[i]<=P&&q[i]<=Q&&r[i]<=R&&c[i]<=C){\n\t\t\t\tcout<<s[i]<<endl;\n\t\t\t\tok=1;\n\t\t\t}\n\t\t}\n\t\tif(!ok)\n\t\t\tcout<<\"NA\"<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3392,
"score_of_the_acc": -0.6596,
"final_rank": 11
}
] |
aoj_0242_cpp
|
入力候補
携帯電話には、メールなどの文章を効率良く入力するために入力候補を表示する機能が搭載されています。これは、使われる頻度が高い単語を記録しておき、入力された文字を頭文字に持つ単語を入力候補として提示するものです。例えば、普段”computer”という単語を多く入力しているなら、”c”と入力するだけで候補として”computer”が提示されます。このような機能の基本部分を作成してみましょう。
文章、文字を入力とし、その文字を頭文字に持つ単語を出現数の順に出力するプログラムを作成してください。ただし、出現数が同じ単語が複数ある場合は、辞書式順序で出力します。出力する単語は最大5つまでとします。該当する単語が存在しない場合は”NA”と出力してください。
入力
複数のデータセットが与えられます。入力の終わりはゼロひとつで表されます。各データセットは以下の形式で与えられます。
n
line
1
line
2
:
line
n
k
1行目に文章の行数
n
(1 ≤
n
≤ 10) が与えられます。続く
n
行に文章が与えられます。文章は半角英小文字と半角空白からなり、１行の文字数は1文字以上1024文字以下とします。空白によって区切られる単語は1文字以上20文字以下です。
続く行に頭文字
k
が半角英字で与えられます。
データセットの数は 100 を超えません。
出力
データセットごとに、指定された文字を頭文字にもつ単語または”NA” を出力します。
入力例
1
ben likes bananas the best among many fruits because bananas are sweet and cheap
b
1
winners get to visit aizu and the university of aizu and make many friends as well
a
3
ask alex about
the answer for the
assignment on android apps
a
2
programming is both
a sport and an intellectual puzzle
c
0
出力例
bananas because ben best
aizu and as
about alex android answer apps
NA
|
[
{
"submission_id": "aoj_0242_5745371",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(;;){\n int n;\n cin >> n;\n if(n == 0) break;\n cin.ignore();\n map<string,int> cnt;\n vector<string> list(0);\n for(int i=0;i<n;i++){\n string S,s;\n getline(cin,S);\n stringstream ss(S);\n vector<string> v(0);\n while(getline(ss,s,' ')) v.push_back(s);\n for(int j=0;j<(int)v.size();j++){\n if(cnt[v[j]] == 0) list.push_back(v[j]);\n cnt[v[j]]++;\n }\n }\n char b;\n cin >> b;\n vector<pair<int,string> > judge(0);\n for(int i=0;i<(int)list.size();i++){\n if(list[i][0] != b) continue;\n judge.push_back(make_pair(-cnt[list[i]],list[i]));\n }\n if((int)judge.size() == 0) cout << \"NA\" << endl;\n else{\n sort(judge.begin(),judge.end());\n cout << judge[0].second;\n for(int i=1;i<min(5,(int)judge.size());i++) cout << \" \" << judge[i].second;\n cout << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3172,
"score_of_the_acc": -0.3214,
"final_rank": 4
},
{
"submission_id": "aoj_0242_4848373",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <map>\n#include <utility>\nusing namespace std;\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n string line;\n getline(cin, line);\n map<string, int> words;\n for(int i=0; i<n; i++){\n getline(cin, line);\n stringstream ss(line);\n string s;\n while(ss >> s){\n words[s]++;\n }\n }\n char c;\n cin >> c;\n vector<pair<int,string>> ans;\n for(auto p: words){\n if(p.first[0] == c){\n ans.emplace_back(-p.second, p.first);\n }\n }\n sort(ans.begin(), ans.end());\n if(ans.size() > 5u){\n ans.erase(ans.begin()+5, ans.end());\n }\n if(ans.empty()){\n cout << \"NA\" << endl;\n }else{\n for(int i=0; i<(int)ans.size()-1; i++){\n cout << ans[i].second << \" \";\n }\n cout << ans.back().second << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3172,
"score_of_the_acc": -0.3214,
"final_rank": 4
},
{
"submission_id": "aoj_0242_4824627",
"code_snippet": "#include<bits//stdc++.h>\nusing namespace std;\nint main(){\n string str;int n;\n while(cin >> n && n){\n map<string,int> data;\n vector<pair<int,string> > v;\n char c;bool flg = false;\n getchar();\n while(n--){\n getline(cin,str);\n stringstream ss(str);\n while(ss >> str)data[str]++;\n }\n cin >> c;\n for(map<string,int>::iterator i=data.begin(),l=data.end();i!=l;i++){\n if(c==i->first[0]){\n\tv.push_back(make_pair(-i->second,i->first));\n }\n }\n sort(v.begin(),v.end());\n if(v.empty()) cout << \"NA\" << endl;\n else {\n for(int i=0,l=v.size();i<l&&i<5;i++){\n\tif(flg)cout << \" \";\n\telse flg = true;\n\tcout << v[i].second;\n }cout << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3180,
"score_of_the_acc": -0.3571,
"final_rank": 8
},
{
"submission_id": "aoj_0242_4691157",
"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 reps(i,n) for(int i=1;i<=(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define Fixed fixed << setprecision(12)\n#define int int_fast64_t\nusing pii = pair<int,int>;\nconstexpr int INF = 0x3f3f3f3f;\nconstexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7; \nconstexpr int mod2 = 998244353;\n \ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n \ntemplate <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;\ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class A, class B> using umap = unordered_map<A,B>;\n\ninline int updiv(int a,int b){ return (a + b - 1) / b; }\n \nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\n\nsigned main(){\n /*\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n */\n cout.setf(ios_base::fixed);\n cout.precision(12);\n\n int n;\n while(true){\n char buff[100];\n\n fgets(buff, sizeof(buff), stdin);\n sscanf(buff, \"%lld\", &n);\n if(n == 0){\n break;\n }\n vector<string> s(n);\n rep(i,n){\n getline(cin, s[i]);\n }\n char c;\n fgets(buff, sizeof(buff), stdin);\n sscanf(buff, \"%c\", &c);\n\n umap<string, int> cnt;\n\n rep(i,n){\n string str;\n rep(j,s[i].size()){\n if(s[i][j] == ' '){\n if(str.front() == c){\n ++cnt[str];\n }\n str = \"\";\n }else{\n str += s[i][j];\n }\n }\n if(str.front() == c){\n ++cnt[str];\n }\n }\n\n if(cnt.size() == 0){\n cout << \"NA\\n\";\n }else{\n vector<pair<int, string> > res;\n for(auto&& e : cnt){\n res.emplace_back(-e.second, e.first);\n }\n sort(all(res));\n int siz = min(res.size(), size_t(5));\n rep(i,siz){\n cout << res[i].second << (i == siz - 1 ? '\\n' : ' ');\n }\n }\n }\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3272,
"score_of_the_acc": -0.7679,
"final_rank": 17
},
{
"submission_id": "aoj_0242_4491054",
"code_snippet": "#include<stdio.h> \n#include<string.h>\n#include<iostream>\n#include<string>\n#include <vector>\n#include<algorithm>\n#include <map>\n\nusing namespace std;\n\nvector<string> Split(string str,char c)\n{\n\tvector<string> ret;\n\tint e = str.find(c);\n\twhile (e != str.npos)\n\t{\n\t\tret.push_back(str.substr(0, e));\n\t\tstr = str.substr(e + 1);\n\t\te = str.find(c);\n\t}\n\tret.push_back(str);\n\treturn ret;\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\twhile (n)\n\t{\n\t\tstring l;\n\t\tgetline(cin, l);\n\t\tmap<string, int> record;\n\t\tfor (size_t i = 0; i < n; i++)\n\t\t{\n\t\t\tgetline(cin, l);\n\t\t\tvector<string> words = Split(l, ' ');\n\t\t\tfor (string w : words) record[w]++;\n\t\t}\n\t\tchar k;\n\t\tcin >> k;\n\t\tvector <pair<string, int> > vec;\n\t\tfor (auto p : record) if (p.first[0] == k) vec.push_back(p);\n\t\tif (vec.size() == 0) cout << \"NA\" << endl;\n\t\telse\n\t\t{\n\t\t\tauto sortRule = [](pair<string, int> p1, pair<string, int> p2) ->bool\n\t\t\t{\n\t\t\t\treturn p1.second > p2.second || p1.second == p2.second && p1.first < p2.first;\n\t\t\t};\n\t\t\tsort(vec.begin(), vec.end(), sortRule);\n\t\t\tint m = vec.size();\n\t\t\tm = min(5,m);\n\t\t\tfor (size_t i = 0; i < m - 1; i++)\n\t\t\t\tcout << vec[i].first << \" \";\n\t\t\tcout << vec[m - 1].first << endl;\n\t\t}\n\t\tcin >> n;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3100,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0242_4463966",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nstring LineData;\nvector<pair<string, int> > WordsInfo;\nvector<pair<string, int> >::iterator it;\n\n\nvoid solve() {\n\tstring word;\n\tstringstream ss(LineData);\n\t\n\twhile (ss>>word) {\n\t\t//cout << word << \" \";\n\t\tfor (it = WordsInfo.begin(); it != WordsInfo.end(); ++it) {\n\t\t\tif (it->first == word) {\n\t\t\t\t++it->second;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (it == WordsInfo.end()) {\n\t\t\tWordsInfo.push_back(make_pair(word, 1));\n\t\t}\n\t}\n}\n\nbool cmp(const pair<string, int>& w1, const pair<string, int>& w2) {\n\tif (w1.second == w2.second) {\n\t\treturn w1.first < w2.first;\n\t}\n\treturn w1.second > w2.second;\n}\n\nbool matchWords(char target) {\n\t\n\tfor (it = WordsInfo.begin(); it != WordsInfo.end();) {\n\t\tif (it->first[0] != target) {\n\t\t\tit = WordsInfo.erase(it);\n\t\t\tcontinue;\n\t\t}\n\t\t++it;\n\t}\n\n\tif (WordsInfo.empty()) {\n\t\treturn false;\n\t}\n\tsort(WordsInfo.begin(), WordsInfo.end(), cmp);\n\treturn true;\n}\n\nvoid show() {\n\tint cnt;\n\n\tcnt = WordsInfo.size() > 5 ? 5 : WordsInfo.size();\n\tfor (int i = 0; i < cnt; ++i) {\n\t\tif (i != 0) {\n\t\t\tcout << \" \";\n\t\t}\n\t\tcout << WordsInfo[i].first;\n\t}\n\tcout << endl;\n}\n\nint main() {\n\tint n;\n\tchar target;\n\n\twhile (cin >> n, n) {\n\t\tgetchar();\n\t\tWordsInfo.clear();\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tgetline(cin, LineData);\n\t\t\t//cout << LineData << endl;\n\t\t\tsolve();\n\t\t}\n\t\tcin >> target;\n\t\t//cout << \"target:\" << target << endl;\n\t\tif (matchWords(target)) {\n\t\t\tshow();\n\t\t}\n\t\telse {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3228,
"score_of_the_acc": -0.5714,
"final_rank": 15
},
{
"submission_id": "aoj_0242_4447998",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<string, int> P;\n\nint main() {\n int n;\n while (cin >> n, n) {\n cin.ignore();\n vector<string> v;\n map<string, int> mp;\n while (n--) {\n string line;\n getline(cin, line);\n istringstream iss(line);\n string s;\n while (iss >> s) {\n v.push_back(s);\n }\n }\n char k;\n cin >> k;\n for (const auto& e : v) {\n if (e[0] == k) mp[e]++;\n }\n vector<P> u;\n for (const auto& e : mp) {\n u.push_back(e);\n }\n sort(u.begin(), u.end(), [](auto const& x, auto const& y) {\n if (x.second != y.second) return x.second > y.second;\n return x.first < y.first;\n });\n if (u.empty()) {\n cout << \"NA\\n\";\n } else {\n for (int i = 0; i < u.size() && i < 5; i++) {\n cout << (i == 0 ? \"\" : \" \") << u[i].first;\n }\n cout << \"\\n\";\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3164,
"score_of_the_acc": -0.2857,
"final_rank": 2
},
{
"submission_id": "aoj_0242_4447966",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<string, int> P;\n\nbool cmp(const P& x, const P& y) {\n if (x.second != y.second) return x.second > y.second;\n return x.first < y.first;\n}\n\nint main() {\n int n;\n while (cin >> n, n) {\n cin.ignore();\n vector<string> v;\n map<string, int> mp;\n while (n--) {\n string line;\n getline(cin, line);\n istringstream iss(line);\n string s;\n while (iss >> s) {\n v.push_back(s);\n }\n }\n char k;\n cin >> k;\n for (const auto& e : v) {\n if (e[0] == k) mp[e]++;\n }\n vector<P> u;\n for (const auto& e : mp) {\n u.push_back({e.first, e.second});\n }\n sort(u.begin(), u.end(), cmp);\n if (u.empty()) {\n cout << \"NA\\n\";\n } else {\n for (int i = 0; i < u.size() && i < 5; i++) {\n cout << (i == 0 ? \"\" : \" \") << u[i].first;\n }\n cout << \"\\n\";\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3168,
"score_of_the_acc": -0.3036,
"final_rank": 3
},
{
"submission_id": "aoj_0242_4385422",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n#include <iomanip>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n;\n while(cin >> n, n){\n cin.ignore();\n vector<map<string, int>> v(26);\n for (int i = 0; i < n; ++i) {\n string A; getline(cin, A);\n stringstream ss; ss << A;\n string s;\n while(ss >> s){\n v[s.front()-'a'][s]++;\n }\n }\n char c;\n cin >> c;\n if(v[c-'a'].empty()) puts(\"NA\");\n else {\n vector<pair<int, string>> ans;\n for (auto &&i : v[c-'a']) {\n ans.emplace_back(-i.second, i.first);\n }\n sort(ans.begin(),ans.end());\n for (int i = 0; i < min<int>(ans.size(), 5); ++i) {\n if(i) putchar(' ');\n cout << ans[i].second;\n }\n puts(\"\");\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3176,
"score_of_the_acc": -0.3393,
"final_rank": 6
},
{
"submission_id": "aoj_0242_3974226",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<set>\n#include<map>\n#define for0(i, n) for(int i = 0; i < (n); i++)\n#define for1(i, n) for(int i = 1; i <= (n);i++)\nusing namespace std;\nsigned main() {\n\twhile (1) {\n\t\tint n; cin >> n;\n\t\tif (n == 0)return 0;\n\t\tstring s, st; vector<string>v; set<string>ss; map<string, int>m; vector<pair<int, string>>v2;\n\t\tfor (int x = 0; x <= n; x++) {\n\t\t\tgetline(cin, s);\n\t\t\tif (x == 0)continue;\n\t\t\tfor0(i, s.size()) {\n\t\t\t\tif (s[i] == ' ') {\n\t\t\t\t\tv.push_back(st); st = \"\";\n\t\t\t\t}\n\t\t\t\telse st += s[i];\n\t\t\t}v.push_back(st); st = \"\";\n\t\t}\n\t\tchar ch; cin >> ch;\n\t\tfor (string i : v) {\n\t\t\tif (i[0] == ch) {\n\t\t\t\tif (ss.find(i) == ss.end()) {\n\t\t\t\t\tss.insert(i);\n\t\t\t\t\tm[i] = 1;\n\t\t\t\t}\n\t\t\t\telse m[i]++;\n\t\t\t}\n\t\t}\n\t\tfor (string i : ss) v2.push_back(make_pair(-m[i], i));\n\t\tsort(v2.begin(), v2.end());\n\t\tif (v2.size() == 0)cout << \"NA\";\n\t\telse for0(i, min(5, (int)v2.size())) { if (i)cout << ' '; cout << v2[i].second; }\n\t\tcout << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3192,
"score_of_the_acc": -0.4107,
"final_rank": 9
},
{
"submission_id": "aoj_0242_3733901",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\n#include<string>\n#include<sstream>\n#include<algorithm>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < (n); i++)\nint main(){\n int n;\n while(cin >> n, n != 0){\n cin.ignore();\n vector<string> str(n);\n vector<string> w;\n rep(i,n){\n getline(cin, str[i]);\n }\n rep(i,n){\n string s;\n stringstream ss(str[i]);\n while(getline(ss, s, ' ')){\n w.emplace_back(s);\n }\n }\n\n map<string, int> m[26];\n for(auto i : w){\n m[i[0] - 'a'][i]++;\n }\n\n char k;\n cin >> k;\n\n vector<pair<int, string>> p;\n for(auto i : m[k - 'a']){\n p.emplace_back(-i.second, i.first);\n }\n\n if(p.empty()){\n cout << \"NA\" << endl;\n }else{\n sort(p.begin(), p.end());\n rep(i,min<int>(5, p.size())){\n if(i) cout << ' ';\n cout << p[i].second;\n }\n cout << endl;\n }\n\n\n\n\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3240,
"score_of_the_acc": -0.625,
"final_rank": 16
},
{
"submission_id": "aoj_0242_3729843",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <map>\nusing namespace std;\n\nmap<string, int> mp[32];\nvector<pair<int, string> >arr;\nstring str;\n\nvoid init(void);\n\nint main()\n{\n int n;\n char ch;\n\n while (cin >> n, n != 0) {\n init();\n \n for (int i = 0; i < n; i++) {\n ch = '\\0';\n\n while (ch != '\\n') {\n cin >> str;\n mp[str[0] - 'a'][str]++;\n\n ch = getchar();\n }\n\n }\n\n ch = getchar();\n\n if (mp[ch - 'a'].size() == 0) {\n cout << \"NA\\n\";\n continue;\n }\n\n for (auto x : mp[ch - 'a']) {\n arr.push_back(pair<int, string>{-1 * x.second, x.first});\n }\n\n sort(arr.begin(), arr.end());\n\n int f = 0;\n for (int i = 0; i < arr.size() && i < 5; i++) {\n if (f) cout << ' ';\n cout << arr[i].second;\n\n f = 1;\n }\n cout << '\\n';\n }\n\n return 0;\n}\n\nvoid init(void)\n{\n /*\n map<string, int> mp[32];\n vector<pair<int, string> >arr;\n string str;\n */\n\n for (int i = 0; i < 32; i++) {\n mp[i].clear();\n }\n\n arr.clear();\n\n return;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3204,
"score_of_the_acc": -0.4643,
"final_rank": 10
},
{
"submission_id": "aoj_0242_3722981",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst double eps=1e-9;\ntypedef vector<int> vi;\ntypedef long long ll;\nint n;\nstruct Word {\n string word;\n int count;\n Word(){}\n Word(string _word,int _count){\n word=_word,count=_count;\n }\n bool operator < (const Word &a) const {\n if(a.count!=count)\n {\n return a.count<count;\n } else{\n return a.word>word;\n }\n }\n};\n\nint main(void)\n{\n string s;\n\tstring n;\n while(getline(cin,n) && n!=\"0\") {\n vector<set<string> > appear(26);\n vector<vector<Word> > dict(26);\n for(int line=0;line<stoi(n);line++)\n {\n //if(line==0)cin.ignore();\n getline(cin,s);\n //cout << \"OUT\" << endl;\n //cout << s << endl;\n string nowword=\"\";\n int len=s.size();\n //cout << s << endl;\n for(int i=0;i<len;i++) {\n if (s[i] != ' ') nowword += s[i];\n else if (s[i] == ' ') {\n int index = int(nowword[0] - 'a');\n auto it = appear[index].find(nowword);\n if (it == appear[index].end()) {\n dict[index].push_back(Word(nowword, 0));\n appear[index].insert(nowword);\n } else {\n for (int j = 0; j < dict[index].size(); j++) {\n if (dict[index][j].word == nowword)dict[index][j].count++;\n }\n }\n //cout << nowword << endl;\n nowword = \"\";\n }\n if (i == len - 1) {\n int index = int(nowword[0] - 'a');\n auto it = appear[index].find(nowword);\n if (it == appear[index].end()) {\n dict[index].push_back(Word(nowword, 0));\n appear[index].insert(nowword);\n } else {\n for (int j = 0; j < dict[index].size(); j++) {\n if (dict[index][j].word == nowword)dict[index][j].count++;\n }\n }\n //cout << nowword << endl;\n nowword = \"\";\n }\n }\n }\n string k;\n \tgetline(cin,k);\n int index=int(k[0]-'a');\n sort(dict[index].begin(),dict[index].end());\n int out=min(5,int(dict[index].size()));\n //cout << out << endl;\n if(out==0)\n {\n cout << \"NA\" << endl;\n } else {\n for (int i = 0; i < out; i++) {\n if (i != out - 1)\n {\n cout << dict[index][i].word << ' ';\n }\n else\n {\n cout << dict[index][i].word << endl;\n }\n }\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3176,
"score_of_the_acc": -0.3393,
"final_rank": 6
},
{
"submission_id": "aoj_0242_3722950",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <vector>\n#include <string>\n#include <tuple>\n\nusing namespace std;\n\nclass Solver {\n};\nint main() {\n\twhile (true) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0)break;\n\n\n\t\tchar dum;\n\t\tcin >> dum;\n\t\tmap<string, int> mp;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tstring line;\n\t\t\tgetline(cin, line);\n\t\t\tstring ss = \"\";\n\t\t\tif (i == 0)ss += dum;\n\t\t\tfor (int j = 0; j < line.size(); j++) {\n\t\t\t\tif (line[j] == ' ') {\n\t\t\t\t\tif (mp.find(ss) == mp.end()) {\n\t\t\t\t\t\tmp.emplace(ss, 0);\n\t\t\t\t\t}\n\t\t\t\t\tmp[ss]++;\n\t\t\t\t\tss = \"\";\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tss += line[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (mp.find(ss) == mp.end()) {\n\t\t\t\tmp.emplace(ss, 0);\n\t\t\t}\n\t\t\tmp[ss]++;\n\t\t}\n\n\t\tchar c;\n\t\tcin >> c;\n\t\tvector<tuple<int, string>> strs;\n\t\tfor (auto pair : mp) {\n\t\t\tif (pair.first[0] == c) {\n\t\t\t\tstrs.emplace_back(make_tuple(-pair.second, pair.first));\n\t\t\t}\n\t\t}\n\n\t\tif (strs.size() == 0) {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse {\n\t\t\tsort(strs.begin(), strs.end());\n\t\t\tint cnt = 5;\n\t\t\tif (strs.size() < cnt)cnt = strs.size();\n\t\t\tfor (int i = 0; i < cnt; i++) {\n\t\t\t\tcout << get<1>(strs[i]);\n\t\t\t\tif (i+1 < cnt)cout << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3216,
"score_of_the_acc": -0.5179,
"final_rank": 12
},
{
"submission_id": "aoj_0242_3722937",
"code_snippet": "#include <bits/stdc++.h>\n\n#define ALL(a) (a).begin(), (a).end()\n#define llong long long\n\nusing namespace std;\n\nsigned main(){\n\twhile(true){\n\t\tint n; cin >> n;\n\t\tif(n == 0)break;\n\t\tvector<string> strs(n);\n\t\tgetline(cin, strs[0]);\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tgetline(cin, strs[i]);\n\t\t}\n\t\tstring c;\n\t\tcin >> c;\n\t\tstringstream ss;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tss << strs[i];\n\t\t\tss << \" \";\n\t\t}\n\t\tmap<string, int> st;\n\t\tstring tmp;\n\t\twhile(ss >> tmp){\n\t\t\tif(st.find(tmp) == st.end()) st[tmp] = 0;\n\t\t\tst[tmp]++;\n\t\t}\n\t\tvector<pair<string, int>> ans;\n\t\tfor(auto e : st){\n\t\t\tif(e.first[0] == c[0])ans.emplace_back(e);\n\t\t}\n\t\tif(ans.size() == 0){\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tsort(ALL(ans), [](const pair<string, int> a, const pair<string, int> b){\n\t\t\t\treturn a.second != b.second ? a.second > b.second : a.first < b.first ;\n\t\t\t\t});\n\t\tfor(size_t i = 0; i < ans.size(); i++){\n\t\t\tif(i == 5)break;\n\t\t\tif(i != 0)cout << \" \";\n\t\t\tcout << ans[i].first;\n\t\t}\n\t\tcout << endl;\n\t}\n\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3220,
"score_of_the_acc": -0.5357,
"final_rank": 13
},
{
"submission_id": "aoj_0242_3722824",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define pp pair<int,int>\n#define ll long long\n#define ld long double\nint inf=100000000;\nll INF=5000000000000000000;\nll MOD=1000000007;\n\n\nint main() {\n \n int n;\n cin >> n;\n while (true){\n int m=0;\n string s,t;\n vector<string> a(0);\n while (true){\n \n cin >> s;\n if (s==\"0\" || s==\"1\" || s==\"2\" || s==\"3\" || s==\"4\" || s==\"5\" || s==\"6\" || s==\"7\" || s==\"8\" || s==\"9\" || s==\"10\") break;\n if (m==1) a.push_back(t);\n m=1;\n t=s;\n }\n char f=t.at(0);\n sort (a.begin(),a.end());\n vector<pair<int,string>> v(0);\n pair<int,string> o;\n for (int i=0;i<a.size();i++){\n if (i!=0) {\n if (a.at(i).at(0)==f && a.at(i)!=a.at(i-1)) {o.first=1;o.second=a.at(i);v.push_back(o);}\n if (a.at(i).at(0)==f && a.at(i)==a.at(i-1)) v.at(v.size()-1).first--;}\n if (i==0 && a.at(i).at(0)==f) {o.first=1;o.second=a.at(i);v.push_back(o);}\n }\n sort(v.begin(),v.end());\n rep(i,5){\n if (i==v.size()) break;\n if (i==v.size()-1 || i==4) cout << v.at(i).second << endl;\n else cout << v.at(i).second << \" \";\n }\n if (v.size()==0) cout << \"NA\" << endl;\n if (s==\"0\") return 0;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3256,
"score_of_the_acc": -1.6964,
"final_rank": 20
},
{
"submission_id": "aoj_0242_3683242",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// define\n#define int long long\n#define UNIQUE(v) v.erase(unique(all(v)), v.end());\n#define ZIP(v) sort(all(v)),UNIQUE(v)\n#define ADD(a, b) a = (a + b) % mod\n#define SUB(a, b) a = (a+mod-b)%mod\n#define MUL(a, b) a = (((a)%mod) * ((b)%mod)) % mod\n#define rollcall cout << \"I'm Sucu.\" << endl;\n#define repi(i,m,n) for(int i = m;i < n;i++)\n#define drep(i,n,m) for(int i = n;i >= m;i--)\n#define rep(i,n) repi(i,0,n)\n#define rrep(i,n) repi(i,1,n+1)\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define all(v) v.begin(),v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define dmp(x,y) make_pair(x,y)\n#define dmt(x, y, z) make_tuple(x, y, z)\n#define pb(x) push_back(x)\n#define pf(x) push_front(x)\n#define fi first\n#define se second\n// typedef\ntypedef complex<double> Point;\ntypedef pair<int, int> P;\ntypedef pair<int, P> PP;\ntypedef vector<int> vi;\ntypedef deque<int> dq;\nconst int inf = 1e9+7;\nconst int INF = 1e18+7;\n// int sum = accumulate(a, a+n, 0LL);\n// int mx = max_element(a, a+n);\n// int mn = min_element(a, a+n);\n// int cnt = count(a, a+n, k);\n\n\nstring sub(string str, int l, int r){\n string res;\n repi(i,l,r)res.pb(str[i]);\n return res;\n}\n\nstruct st{string str;int n;};\nbool cmp(const st &a, const st &b){\n if(a.n > b.n)return true;\n else if(a.n < b.n)return false;\n return a.str < b.str;\n}\n\nsigned main(){\n while(true){\n string line[100];\n vector<string> str;\n int n;cin >> n;\n if(n == 0)break;\n cin.ignore();\n rep(i,n)getline(cin, line[i]);\n\n map<string, int> mp;\n rep(i,n){\n int idx = 0;\n rep(j,line[i].size()+1){\n if(line[i][j] == ' ' or j == line[i].size()){\n string s = sub(line[i], idx, j);\n mp[s]++;\n idx = j + 1;\n }\n }\n }\n char c;cin >> c;\n vector<st> vec;\n for(auto it = mp.begin(); it != mp.end(); it++) {\n if(it->fi[0] != c)continue;\n vec.push_back(st{it->fi, it->se});\n }\n sort(all(vec), cmp);\n int size = vec.size();\n size = min(size, (int)5);\n if(size == 0){cout << \"NA\" << endl;continue;}\n rep(i,size){\n cout << vec[i].str;\n if(i == size-1)cout << endl;\n else cout << \" \";\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3172,
"score_of_the_acc": -1.3214,
"final_rank": 19
},
{
"submission_id": "aoj_0242_3480529",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nstruct Info\n{\n string word;\n int cnt;\n};\n\nint main()\n{\n int n;\n char c;\n\n while( cin >> n )\n {\n if( !n )\n break;\n\n string s;\n vector<string> v;\n\n getline( cin, s );\n for( int i = 0; i < n; i++ )\n {\n getline( cin, s );\n\n s += \" \";\n string t = \"\";\n for( int j = 0; j < s.size(); j++ )\n {\n if( s[j] == ' ' )\n {\n v.push_back( t );\n t = \"\";\n continue;\n }\n t += s[j];\n }\n }\n\n cin >> c;\n\n vector<Info> w;\n\n for( int i = 0; i < v.size(); i++ )\n if( c == v[i][0] )\n {\n Info x;\n x.word = v[i];\n x.cnt = 0;\n\n bool judge = true;\n for( int j = 0; j < w.size(); j++ )\n if( w[j].word == v[i] )\n {\n w[j].cnt++;\n judge = false;\n break;\n }\n\n if( judge )\n w.push_back( x );\n }\n\n for( int i = 0; i < w.size(); i++ )\n for( int j = w.size() - 1; j > i; j-- )\n if( w[j].cnt > w[j-1].cnt )\n {\n Info temp = w[j];\n w[j] = w[j-1];\n w[j-1] = temp;\n }\n\n for( int i = 0; i < w.size(); i++ )\n for( int j = w.size() - 1; j > i; j-- )\n if( w[j].cnt == w[j-1].cnt && w[j].word < w[j-1].word )\n {\n Info temp = w[j];\n w[j] = w[j-1];\n w[j-1] = temp;\n }\n if( w.size() == 0 )\n cout << \"NA\" << endl;\n else\n {\n cout << w[0].word;\n for( int i = 1; i < 5 && i < w.size(); i++ )\n cout << \" \" << w[i].word;\n cout << endl; \n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3212,
"score_of_the_acc": -0.5,
"final_rank": 11
},
{
"submission_id": "aoj_0242_3430816",
"code_snippet": "//入力候補\n\n#include<iostream>\n#include<utility>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<deque>\n#include<queue>\n#include<set>\n#include<map>\n\nusing namespace std;\n#define LL long long\n\nint main() {\n\twhile(1) {\n\t\tint n;\n\t\tchar k;\n\t\tmap<string, int> dict;//単語、単語の出現数\n\t\tvector<pair<int, string>> talf;//各頭文字の先頭\n\t\tstring ans;\n\n\t\tcin >> n;\n\t\tif (!n) break;\n\t\tcin.ignore();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tstring s;\n\t\t\tgetline(cin, s);\n\n\n\t\t\tauto pbegin = s.begin();\n\n\t\t\twhile (pbegin != s.end()) {\n\t\t\t\tauto pend = pbegin;\n\t\t\t\twhile (pend != s.end() && *pend != ' ')//文字列の終わりか対象の文字までイテレータを動かす\n\t\t\t\t\tpend++;\n\t\t\t\tstring word = string(pbegin, pend);\n\t\t\t\tif (dict.find(word) == dict.end()) dict[word] = 0;\n\t\t\t\tdict[word]++;\n\t\t\t\tif (pend != s.end())\n\t\t\t\t\tpend++;\n\t\t\t\tpbegin = pend;\n\t\t\t}\n\t\t}\n\t\tcin >> k;\n\t\t\n\t\tauto itr = dict.begin();\n\t\twhile (itr != dict.end()) {\n\t\t\tstring nword = itr->first;\n\t\t\tif (nword[0] == k) //頭文字の一致\n\t\t\t\ttalf.push_back(make_pair(-(itr->second), nword));\n\t\t\titr++;\n\t\t}\n\t\t\n\t\tif (talf.empty())ans = \"NA\";\n\t\telse {\n\t\t\tsort(talf.begin(), talf.end());\n\t\t\tfor (int i = 0; i < talf.size(); i++) {\n\t\t\t\tif (i > 4)break;\n\t\t\t\tif(i) ans += \" \";\n\t\t\t\tans += talf[i].second;\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3220,
"score_of_the_acc": -0.5357,
"final_rank": 13
},
{
"submission_id": "aoj_0242_3419554",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <string>\n#include <array>\n#include <queue>\n#include <deque>\n#include <set>\n#include <list>\n#include <map>\n#include <stack>\n#include <utility>\n#include <algorithm>\n#include <numeric>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cctype>\n#include <cstring>\n#include <climits>\n#include <bitset>\n#include <complex>\n#include <random>\n#include <functional>\n#include <sstream>\n#include <iomanip>\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#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define SORT(x) sort((x).begin(),(x).end())\n#define REVE(x) reverse((x).begin(),(x).end())\n#define mp make_pair\n#define pb push_back\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define forauto(i, a) for(auto i:a)cout << i << \" \"; puts(\"\");\n\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef vector<LL> VL;\ntypedef vector<string> VS;\ntypedef vector<bool> VB;\ntypedef vector<vector<int>> VVI;\ntypedef pair<int, int> PII;\ntypedef pair<double, double> PDD;\ntypedef complex<double> CD;\n\n//文字列分割\nVS split(string str, char del) {\n\tVS re;\n\tstring sub;\n\tfor (char c : str) {\n\t\tif (c == del) {\n\t\t\tre.pb(sub);\n\t\t\tsub.clear();\n\t\t}\n\t\telse {\n\t\t\tsub += c;\n\t\t}\n\t}\n\tre.pb(sub);\n\treturn re;\n}\n\nint main() {\n\twhile (true) {\n\t\tint n; cin >> n;\n\t\tif (n == 0)break;\n\t\tn++;\n\t\tVS line(n); rep(i, n)getline(cin, line[i]);\n\t\tchar k; cin >> k;\n\n\t\tVS a;\n\t\trep(i, n) {\n\t\t\tVS tmp = split(line[i], ' ');\n\t\t\ta.insert(a.end(), all(tmp));\n\t\t}\n\n\t\tvector<pair<int, string>> ans;\n\t\trep(i, sz(a)) {\n\t\t\tif (a[i][0] == k) {\n\n\t\t\t\tbool flag = false;\n\t\t\t\trep(j, sz(ans)) {\n\t\t\t\t\tif (ans[j].second == a[i])ans[j].first++, flag = true;\n\t\t\t\t}\n\t\t\t\tif (!flag)ans.pb(mp(1, a[i]));\n\n\t\t\t}\n\t\t}\n\t\trep(i, sz(ans))ans[i].first = 100 - ans[i].first;\n\t\tSORT(ans);\n\n\t\tif (ans.empty())puts(\"NA\");\n\t\telse {\n\t\t\trep(i, min(5, sz(ans))) {\n\t\t\t\tcout << ans[i].second;\n\t\t\t\tprintf(i == min(5, sz(ans)) - 1 ? \"\\n\" : \" \");\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3324,
"score_of_the_acc": -1,
"final_rank": 18
}
] |
aoj_0243_cpp
|
塗りつぶしゲーム
指で画面にタッチして操作することのできるタブレットインターフェースの技術は、ゲームの分野でも応用され、新しい操作感を持つ様々な種類のゲームが作られています。現在、ＡＺ社が開発しているゲームもその一つです。
このソフトウェア（ゲーム）の要件は以下の通りです。
画面には
X
列×
Y
行の2次元グリッドがあります。
グリッドのセルは赤(R)、緑(G)、茶(B)の3色のいずれかで塗られています。
セルの色を変更するボタンR、G、Bがあり、このボタンが押下されると一番左上(0,0)のセルがその色に変更されます。
一番左上のセルの色が変更されると、そのセルの元の色と同じ色に塗られた隣接するすべてのセルが指定された色に変わります。すなわち、元の色が同じ色のセルでつながったセルはすべて指定された色に変更されます。
このようにグリッドを塗りつぶしていき、最終的にグリッド全体を一色にするというゲームです。少ない手順で解くと高得点が与えられます。
ＡＺ社のプログラマーであるあなたは、このゲームのロジックの一部分を開発することになりました。まずは、この最高得点を計算するため、このゲームを最短で解いた場合、最低何回選択ボタンを操作すればグリッドが一色になるかをもとめるプログラムを作ることにしました。
入力
複数のデータセットが与えられます。入力の終わりはゼロふたつで示されます。各データセットは以下の形式で与えられます。
X
Y
c
1,1
c
2,1
...
c
X,1
c
1,2
c
2,2
...
c
X,2
:
c
1,Y
c
2,Y
...
c
X,Y
1行目にグリッドの列と行のサイズ
X
,
Y
(2 ≤
X
,
Y
≤ 10) が与えられます。続く
Y
行に
i
列目
j
行目のセルの色を表す文字
c
i,j
が空白区切りで与えられます。
出力
データセットごとに、ボタン操作の最少回数を1行に出力します。
入力例
3 3
R G B
G G G
G B B
2 4
R G
G G
R B
B R
4 3
G G B R
G R R G
B G G R
0 0
出力例
2
4
4
|
[
{
"submission_id": "aoj_0243_9659564",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint x,y;\n\nstruct S{\n int t;\n vector<char> g;\n};\n\nvoid fill(vector<char> &g,int xx,int yy,char c,char sc){\n if(xx<0||x<=xx||yy<0||y<=yy||sc!=g[yy*x+xx])return;\n g[yy*x+xx]=c;\n for(int i=0;i<4;i++){\n int d[]={0,1,0,-1,0};\n fill(g,xx+d[i],yy+d[i+1],c,sc);\n }\n}\n\nint main(){\n while(cin>>x>>y,x|y){\n vector<char> g(y*x);\n for(int i=0;i<y*x;i++){\n cin>>g[i];\n }\n queue<S> que;\n S is={0,g};\n que.push(is);\n for(;;){\n S cs=que.front();\n char l='Z',h='A';\n for(int i=0;i<y*x;i++){\n l=min(l,cs.g[i]);\n h=max(h,cs.g[i]);\n }\n if(l==h)break;\n que.pop();\n for(int i=0;i<3;i++){\n const char *c=\"RGB\";\n if(c[i]==cs.g[0])continue;\n S ns={cs.t+1,cs.g};\n fill(ns.g,0,0,c[i],ns.g[0]);\n que.push(ns);\n }\n\n }\n \n cout<<que.front().t<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 980,
"memory_kb": 37192,
"score_of_the_acc": -0.8609,
"final_rank": 13
},
{
"submission_id": "aoj_0243_9658728",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint x,y;\n\nstruct S{\n int t;\n vector<char> g;\n};\n\nvoid fill(vector<char> &g,int xx,int yy,char c,char sc){\n if(xx<0||x<=xx||yy<0||y<=yy||sc!=g[yy*x+xx])return;\n g[yy*x+xx]=c;\n for(int i=0;i<4;i++){\n int d[]={0,1,0,-1,0};\n fill(g,xx+d[i],yy+d[i+1],c,sc);\n }\n}\n\nint main(){\n while(cin>>x>>y,x|y){\n vector<char> g(y*x);\n for(int i=0;i<y*x;i++){\n cin>>g[i];\n }\n queue<S> que;\n S is={0,g};\n que.push(is);\n for(;;){\n S cs=que.front();\n char l='Z',h='A';\n for(int i=0;i<y*x;i++){\n\t l=min(l,cs.g[i]);\n\t h=max(h,cs.g[i]);\n }\n if(l==h)break;\n que.pop();\n for(int i=0;i<3;i++){\n\tconst char *c=\"RGB\";\n\tif(c[i]==cs.g[0])continue;\n\tS ns={cs.t+1,cs.g};\n\tfill(ns.g,0,0,c[i],ns.g[0]);\n\tque.push(ns);\n }\n }\n cout<<que.front().t<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 980,
"memory_kb": 37220,
"score_of_the_acc": -0.8613,
"final_rank": 14
},
{
"submission_id": "aoj_0243_7460956",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <deque>\n#include <set>\nusing namespace std;\n\ntypedef pair<int, int> Pii;\n\n\nbool is_finished(int w, int h, const vector<vector<int>>& grid) {\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] != grid[0][0]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nvector<Pii> get_same_color_xy_list(int w, int h, const vector<vector<int>>& grid) {\n\tvector<Pii> same_color_xy_list(1, {0, 0});\n\tvector<Pii> stack(1, { 0, 0 });\n\tset<Pii> is_visited;\n\tint c = grid[0][0];\n\tPii dx_dy_list[] = { {1, 0}, {0, 1}, {-1, 0}, {0, -1} };\n\n\tis_visited.insert({ 0, 0 });\n\twhile (!stack.empty()) {\n\t\tconst Pii e = stack.back(); stack.pop_back();\n\t\tint cx = e.first;\n\t\tint cy = e.second;\n\t\t\n\t\tfor (const Pii& dx_dy : dx_dy_list) {\n\t\t\tint nx = cx + dx_dy.first;\n\t\t\tint ny = cy + dx_dy.second;\n\n\t\t\tif (nx < 0 || nx >= w || ny < 0 || ny >= h || grid[ny][nx] != c || is_visited.count({ nx, ny }) > 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tis_visited.insert({ nx, ny });\n\t\t\tsame_color_xy_list.push_back({ nx, ny });\n\t\t\tstack.push_back({ nx, ny });\n\t\t}\n\t}\n\treturn same_color_xy_list;\n}\n\nbool dls(int w, int h, int max_d, int cd, vector<vector<int>>& grid) {\n\tif (cd >= max_d) {\n\t\treturn false;\n\t}\n\n\tint nd = cd + 1;\n\tvector<Pii> same_color_xy_list = get_same_color_xy_list(w, h, grid);\n\tint org_c = grid[0][0];\n\n\tfor (int c = 0; c < 3; c++) {\n\t\tif (c == org_c) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tfor (const Pii& xy : same_color_xy_list) {\n\t\t\tgrid[xy.second][xy.first] = c;\n\t\t}\n\t\t\n\t\tif (is_finished(w, h, grid)) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (dls(w, h, max_d, nd, grid)) {\n\t\t\treturn true;\n\t\t}\n\n\t\tfor (const Pii& xy : same_color_xy_list) {\n\t\t\tgrid[xy.second][xy.first] = org_c;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tint w = 0;\n\t\tint h = 0;\n\n\t\tcin >> w >> h;\n\t\tif (w == 0 && h == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tvector<vector<int>> grid(h, vector<int>(w, 0));\n\t\tfor (int y = 0; y < h; y++) {\n\t\t\tfor (int x = 0; x < w; x++) {\n\t\t\t\tchar c = 0;\n\n\t\t\t\tcin >> c;\n\t\t\t\tif (c == 'R') {\n\t\t\t\t\tgrid[y][x] = 0;\n\t\t\t\t}\n\t\t\t\telse if (c == 'G') {\n\t\t\t\t\tgrid[y][x] = 1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tgrid[y][x] = 2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (is_finished(w, h, grid)) {\n\t\t\tcout << 0 << endl;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tfor (int i = 1; i < w * h; i++) {\n\t\t\tif (dls(w, h, i, 0, grid)) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 2410,
"memory_kb": 3372,
"score_of_the_acc": -1.0035,
"final_rank": 16
},
{
"submission_id": "aoj_0243_5836229",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\n#include<complex>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nint dx[]={1,0,0,-1},dy[]={0,1,-1,0};\nstruct board{\n\tint x,y;\n\tchar val[10][10];\n\tbool operator<(const board&b)const{\n\t\tfor(int i=0;i<y;i++)\n\t\t\tfor(int j=0;j<x;j++)\n\t\t\t\tif(val[i][j]!=b.val[i][j])\n\t\t\t\t\treturn val[i][j]<b.val[i][j];\n\t\treturn 0;\n\t}\n\tbool end(){\n\t\tfor(int i=0;i<y;i++)\n\t\t\tfor(int j=0;j<x;j++)\n\t\t\t\tif(val[i][j]!=val[0][0])\n\t\t\t\t\treturn 0;\n\t\treturn 1;\n\t}\n\tvector<board>next(){\n\t\tvector<board>ans;\n\t\tfor(int i=0;i<3;i++){\n\t\t\tif(val[0][0]==\"RGB\"[i])\n\t\t\t\tcontinue;\n\t\t\tboard tmp=*this;\n\t\t\tbool used[10][10]={};\n\t\t\tqueue<pair<int,int>>que;\n\t\t\tused[0][0]=1;\n\t\t\tque.push({0,0});\n\t\t\twhile(!que.empty()){\n\t\t\t\tint py=que.front().first,px=que.front().second;\n\t\t\t\tque.pop();\n\t\t\t\ttmp.val[py][px]=\"RGB\"[i];\n\t\t\t\tfor(int j=0;j<4;j++){\n\t\t\t\t\tint ny=py+dy[j],nx=px+dx[j];\n\t\t\t\t\tif(0<=ny&&ny<y&&0<=nx&&nx<x&&!used[ny][nx]&&val[0][0]==val[ny][nx]){\n\t\t\t\t\t\tused[ny][nx]=1;\n\t\t\t\t\t\tque.push({ny,nx});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tans.push_back(tmp);\n\t\t}\n\t\treturn ans;\n\t}\n};\nsigned main(){\n\tboard puzzle;\n\twhile(cin>>puzzle.x>>puzzle.y,puzzle.x){\n\t\tfor(int i=0;i<puzzle.y;i++)\n\t\t\tfor(int j=0;j<puzzle.x;j++)\n\t\t\t\tcin>>puzzle.val[i][j];\n\t\tmap<board,int>dist;\n\t\tqueue<board>que;\n\t\tdist[puzzle]=0;\n\t\tque.push(puzzle);\n\t\twhile(!que.empty()){\n\t\t\tpuzzle=que.front();\n\t\t\tque.pop();\n\t\t\tif(puzzle.end()){\n\t\t\t\tcout<<dist[puzzle]<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tauto nxt=puzzle.next();\n\t\t\tfor(auto&x:nxt){\n\t\t\t\tif(dist.count(x))\n\t\t\t\t\tcontinue;\n\t\t\t\tdist[x]=dist[puzzle]+1;\n\t\t\t\tque.push(x);\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4472,
"score_of_the_acc": -0.0184,
"final_rank": 1
},
{
"submission_id": "aoj_0243_4901823",
"code_snippet": "#include<iostream>\n#include<array>\n#include<queue>\nusing namespace std;\nusing T=array<array<bool,10>,10>;\nint ans;\nint X,Y;\nchar c[10][10];\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nvoid dfs(int cnt,T now,char col)\n{\n\tif(ans<=cnt)return;\n\tqueue<pair<int,int> >P;\n\tfor(int i=0;i<X;i++)for(int j=0;j<Y;j++)if(now[i][j])P.push(make_pair(i,j));\n\tint ok=0;\n\tbool R=false,G=false,B=false;\n\twhile(!P.empty())\n\t{\n\t\tint x=P.front().first,y=P.front().second;\n\t\tP.pop();\n\t\tok++;\n\t\tfor(int r=0;r<4;r++)\n\t\t{\n\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\tif(tx<0||ty<0||tx>=X||ty>=Y||now[tx][ty])continue;\n\t\t\tif(col==c[tx][ty])\n\t\t\t{\n\t\t\t\tnow[tx][ty]=true;\n\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t}\n\t\t\telse if(c[tx][ty]=='R')R=true;\n\t\t\telse if(c[tx][ty]=='G')G=true;\n\t\t\telse if(c[tx][ty]=='B')B=true;\n\t\t}\n\t}\n\tif(ok==X*Y)\n\t{\n\t\tans=cnt;\n\t\treturn;\n\t}\n\tif(R)dfs(cnt+1,now,'R');\n\tif(G)dfs(cnt+1,now,'G');\n\tif(B)dfs(cnt+1,now,'B');\n}\nmain()\n{\n\twhile(cin>>Y>>X,X)\n\t{\n\t\tT now;\n\t\tfor(int i=0;i<X;i++)for(int j=0;j<Y;j++)\n\t\t{\n\t\t\tcin>>c[i][j];\n\t\t\tnow[i][j]=false;\n\t\t}\n\t\tnow[0][0]=true;\n\t\tans=300;\n\t\tdfs(0,now,c[0][0]);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 3132,
"score_of_the_acc": -0.0759,
"final_rank": 2
},
{
"submission_id": "aoj_0243_4848606",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\nint ans = 18; // worst case\nint fill(int y, int x, int from, int to, vector<vector<int>> &panel){\n if(panel[y][x] != from) return 0;\n panel[y][x] = to;\n int res = 1;\n for(int d=0; d<4; d++){\n res += fill(y+dy[d], x+dx[d], from, to, panel);\n }\n return res;\n}\nint nextcolor(int y, int x, int from, vector<vector<bool>> &used, vector<bool> &nc, vector<vector<int>> &panel){\n if(used[y][x]) return 0;\n used[y][x] = true;\n if(panel[y][x] != from){\n if(panel[y][x]!=-1) nc[panel[y][x]] = true;\n return 0;\n }\n int res = 1;\n for(int d=0; d<4; d++){\n res += nextcolor(y+dy[d], x+dx[d], from, used, nc, panel);\n }\n return res;\n}\nvoid solve(int step, vector<vector<int>> &panel){\n if(step >= ans) return;\n int h = (int)panel.size() -2;\n int w = (int)panel[0].size() -2;\n vector<bool> next(3, false);\n vector<vector<bool>> used(h+2, vector<bool>(w+2, false));\n int ret = nextcolor(1, 1, panel[1][1], used, next, panel);\n if(ret == h*w){\n ans = step;\n return;\n }\n for(int i=0; i<3; i++){\n if(i == panel[1][1]) continue;\n if(!next[i]) continue;\n auto tmp = panel;\n fill(1, 1, panel[1][1], i, tmp);\n solve(step+1, tmp);\n }\n}\n\nint main(){\n while(1){\n int w,h;\n cin >> w >> h;\n if(h == 0) break;\n\n ans = 18;\n vector<vector<int>> panel(h+2, vector<int>(w+2, -1));\n for(int i=1; i<=h; i++){\n for(int j=1; j<=w; j++){\n char c;\n cin >> c;\n if(c == 'R') panel[i][j] = 0;\n if(c == 'G') panel[i][j] = 1;\n if(c == 'B') panel[i][j] = 2;\n }\n }\n solve(0, panel);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 3216,
"score_of_the_acc": -0.2493,
"final_rank": 10
},
{
"submission_id": "aoj_0243_4848598",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\nint ans = 19;\nint fill(int y, int x, int from, int to, vector<vector<int>> &panel){\n if(panel[y][x] != from) return 0;\n panel[y][x] = to;\n int res = 1;\n for(int d=0; d<4; d++){\n res += fill(y+dy[d], x+dx[d], from, to, panel);\n }\n return res;\n}\nint nextcolor(int y, int x, int from, vector<vector<bool>> &used, vector<bool> &nc, vector<vector<int>> &panel){\n if(used[y][x]) return 0;\n used[y][x] = true;\n if(panel[y][x] != from){\n if(panel[y][x]!=-1) nc[panel[y][x]] = true;\n return 0;\n }\n int res = 1;\n for(int d=0; d<4; d++){\n res += nextcolor(y+dy[d], x+dx[d], from, used, nc, panel);\n }\n return res;\n}\nvoid solve(int step, vector<vector<int>> &panel){\n if(step >= ans) return;\n int h = (int)panel.size() -2;\n int w = (int)panel[0].size() -2;\n vector<bool> next(3, false);\n vector<vector<bool>> used(h+2, vector<bool>(w+2, false));\n int ret = nextcolor(1, 1, panel[1][1], used, next, panel);\n if(ret == h*w){\n ans = step;\n return;\n }\n for(int i=0; i<3; i++){\n if(i == panel[1][1]) continue;\n if(!next[i]) continue;\n auto tmp = panel;\n fill(1, 1, panel[1][1], i, tmp);\n solve(step+1, tmp);\n }\n}\n\nint main(){\n while(1){\n int w,h;\n cin >> w >> h;\n if(h == 0) break;\n\n ans = 19;\n vector<vector<int>> panel(h+2, vector<int>(w+2, -1));\n for(int i=1; i<=h; i++){\n for(int j=1; j<=w; j++){\n char c;\n cin >> c;\n if(c == 'R') panel[i][j] = 0;\n if(c == 'G') panel[i][j] = 1;\n if(c == 'B') panel[i][j] = 2;\n }\n }\n solve(0, panel);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 3204,
"score_of_the_acc": -0.2491,
"final_rank": 9
},
{
"submission_id": "aoj_0243_4493374",
"code_snippet": "#include<stdio.h> \n#include<string.h>\n#include<iostream>\n#include<string>\n#include <vector>\n#include<algorithm>\n#include <map>\n#include <queue>\n\nusing namespace std;\n\nint X, Y;\nint dx[4] = { 0,0,-1,1 };\nint dy[4] = { -1,1,0,0 };\nchar colors[3] = { 'R','G','B'};\n\nclass Cells\n{\npublic:\n\tchar data[10][10];\n\tCells() { data[0][0] = 'X'; };\n\tCells(char c[10][10])\n\t{\n\t\tfor (size_t i = 0; i < Y; i++)\n\t\t{\n\t\t\tfor (size_t j = 0; j < X; j++)\n\t\t\t{\n\t\t\t\tdata[j][i] = c[j][i];\n\t\t\t}\n\t\t}\n\t}\n\tCells(const Cells &cells)\n\t{\n\t\tfor (size_t i = 0; i < Y; i++)\n\t\t{\n\t\t\tfor (size_t j = 0; j < X; j++)\n\t\t\t{\n\t\t\t\tdata[j][i] = cells.data[j][i];\n\t\t\t}\n\t\t}\n\t}\n\tvoid ChangeColor(char newColor, int x = 0,int y = 0)\n\t{\n\t\tchar tmp = data[x][y];\n\t\t//\n\t\t//cout << x << \",\" << y << endl;\n\t\tdata[x][y] = newColor;\n\t\tfor (size_t i = 0; i < 4; i++)\n\t\t{\n\t\t\tint _x = x + dx[i];\n\t\t\tint _y = y + dy[i];\n\t\t\tif (_x >= 0 && _x < X && _y >= 0 && _y < Y && data[_x][_y] == tmp)\n\t\t\t{\n\t\t\t\t//cout << x << \",\" << y << \" to \" << _x << \",\" << _y << endl;\n\t\t\t\tChangeColor(newColor, _x, _y);\n\t\t\t}\n\t\t}\n\t}\n\tbool Finished()\n\t{\n\t\tint color = data[0][0];\n\t\tfor (size_t i = 0; i < Y; i++)\n\t\t{\n\t\t\tfor (size_t j = 0; j < X; j++)\n\t\t\t{\n\t\t\t\tif (data[j][i] != color) return false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n};\n\nint BFS(char g[10][10])\n{\n\tqueue<Cells> nodes;\n\tCells node(g);\n\tif (node.Finished()) return 0;\n\tnodes.push(node);\n\tnodes.push(Cells());\n\tint floor = 1;\n\twhile (!nodes.empty())\n\t{\n\t\tnode = nodes.front();\n\t\tnodes.pop();\n\t\tif (node.data[0][0] == 'X')\n\t\t{\n\t\t\tfloor++;\n\t\t\tnodes.push(Cells());\n\t\t\tcontinue;\n\t\t}\n\t\tfor (size_t i = 0; i < 3; i++)\n\t\t{\n\t\t\t//\n\t\t\t//cout << colors[i] << \" and \" << node.data[0][0] << \" 10 \" << node.data[1][0] << \" 01 \" << node.data[0][1]<< endl;\n\t\t\tif (colors[i] == node.data[0][0]) continue;\n\t\t\tif (node.data[1][0] == node.data[0][0] || node.data[0][1] == node.data[0][0])\n\t\t\t{\n\t\t\t\tCells newNode = node;\n\t\t\t\t//\n\t\t\t\t//cout << \"change color : \" << colors[i] << endl;\n\t\t\t\tnewNode.ChangeColor(colors[i]);\n\t\t\t\tif (newNode.Finished()) return floor;\n\t\t\t\tnodes.push(newNode);\n\t\t\t}\n\t\t\tif (node.data[1][0] == colors[i] || node.data[0][1] == colors[i])\n\t\t\t{\n\t\t\t\tCells newNode = node;\n\t\t\t\t//\n\t\t\t\t//cout << \"change color : \" << colors[i] << endl;\n\t\t\t\tnewNode.ChangeColor(colors[i]);\n\t\t\t\tif (newNode.Finished()) return floor;\n\t\t\t\tnodes.push(newNode);\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\tcin >> X >> Y;\n\twhile (X || Y)\n\t{\n\t\tchar g[10][10];\n\t\tfor (size_t i = 0; i < Y; i++)\n\t\t{\n\t\t\tfor (size_t j = 0; j < X; j++)\n\t\t\t{\n\t\t\t\tcin >> g[j][i];\n\t\t\t}\n\t\t}\n\t\tcout << BFS(g) << endl;\n\t\tcin >> X >> Y;\n\t}\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 9708,
"score_of_the_acc": -0.186,
"final_rank": 8
},
{
"submission_id": "aoj_0243_4455862",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint X, Y, Ans;\nint Dx[] = { 1,0,-1,0 };\nint Dy[] = { 0,1,0,-1 };\nbool Used[10][10];\n\n\nvoid show(int s[10][10]) {\n\tchar ch;\n\n\tfor (int i = 0; i < Y; i++) {\n\t\tfor (int j = 0; j < X; j++) {\n\t\t\tif (s[i][j] == 0) {\n\t\t\t\tch = 'R';\n\t\t\t}\n\t\t\telse if (s[i][j] == 1) {\n\t\t\t\tch = 'G';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tch = 'B';\n\t\t\t}\n\t\t\tcout << ch << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\tcout << \"--\\n\";\n}\n\nbool judge(int(*p)[10]) {\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < X; ++j) {\n\t\t\tif (p[i][j] != p[0][0]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid nextState(int (*pSource)[10], int (*pTo1)[10], int (*pTo2)[10]) {\n\tint color1, color2, nowX, nowY;\n\tqueue<pair<int, int> > convert;\n\n\tif (pSource[0][0] == 0) {\n\t\tcolor1 = 1;\n\t\tcolor2 = 2;\n\t}\n\telse if (pSource[0][0] == 1) {\n\t\tcolor1 = 0;\n\t\tcolor2 = 2;\n\t}\n\telse {\n\t\tcolor1 = 0;\n\t\tcolor2 = 1;\n\t}\n\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < X; ++j) {\n\t\t\tpTo1[i][j] = pTo2[i][j] = pSource[i][j];\n\t\t}\n\t}\n\t\n\tmemset(Used, false, sizeof(Used));\n\tconvert.push(make_pair(0, 0));\n\tUsed[0][0] = true;\n\tpTo1[0][0] = color1;\n\tpTo2[0][0] = color2;\n\n\twhile (!convert.empty()) {\n\t\tpair<int, int> temp;\n\t\ttemp = convert.front();\n\t\tconvert.pop();\n\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tnowX = temp.first + Dx[i];\n\t\t\tnowY = temp.second + Dy[i];\n\n\t\t\tif (nowX<0 || nowX>=X || nowY<0 || nowY>=Y) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (Used[nowY][nowX]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (pSource[nowY][nowX] != pSource[0][0]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tUsed[nowY][nowX] = true;\n\t\t\tpTo1[nowY][nowX] = color1;\n\t\t\tpTo2[nowY][nowX] = color2;\n\t\t\tconvert.push(make_pair(nowX, nowY));\n\t\t}\n\t}\n\n}\n\nvoid solve(int (*p)[10], int cnt) {\n\n\tif (judge(p)) {\n\t\tAns = min(Ans, cnt);\n\t\treturn;\n\t}\n\tif (cnt >= Ans) {\n\t\treturn;\n\t}\n\n\tint Tmp1[10][10], Tmp2[10][10];\n\n\tnextState(p, Tmp1, Tmp2);\n\tsolve(Tmp1, cnt + 1);\n\tsolve(Tmp2, cnt + 1);\n}\n\nint main() {\n\tchar c;\n\tint mapData[10][10];\n\n\twhile (cin >> X >> Y, X) {\n\t\tfor (int i = 0; i < Y; ++i) {\n\t\t\tfor (int j = 0; j < X; ++j) {\n\t\t\t\tcin >> c;\n\t\t\t\tif (c == 'R') {\n\t\t\t\t\tmapData[i][j] = 0;\n\t\t\t\t}\n\t\t\t\telse if (c == 'G') {\n\t\t\t\t\tmapData[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse if (c == 'B') {\n\t\t\t\t\tmapData[i][j] = 2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//show(mapData);\n\t\tAns = 20;\n\t\tsolve(mapData, 0);\n\t\tcout << Ans << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 820,
"memory_kb": 3112,
"score_of_the_acc": -0.3319,
"final_rank": 11
},
{
"submission_id": "aoj_0243_4455860",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint X, Y, Ans;\nint Dx[] = { 1,0,-1,0 };\nint Dy[] = { 0,1,0,-1 };\nbool Used[10][10];\n\n\nvoid show(int s[10][10]) {\n\tchar ch;\n\n\tfor (int i = 0; i < Y; i++) {\n\t\tfor (int j = 0; j < X; j++) {\n\t\t\tif (s[i][j] == 0) {\n\t\t\t\tch = 'R';\n\t\t\t}\n\t\t\telse if (s[i][j] == 1) {\n\t\t\t\tch = 'G';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tch = 'B';\n\t\t\t}\n\t\t\tcout << ch << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\tcout << \"--\\n\";\n}\n\nbool judge(int(*p)[10]) {\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < X; ++j) {\n\t\t\tif (p[i][j] != p[0][0]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid nextState(int (*pSource)[10], int (*pTo1)[10], int (*pTo2)[10]) {\n\tint color1, color2, nowX, nowY;\n\tqueue<pair<int, int> > convert;\n\n\tif (pSource[0][0] == 0) {\n\t\tcolor1 = 1;\n\t\tcolor2 = 2;\n\t}\n\telse if (pSource[0][0] == 1) {\n\t\tcolor1 = 0;\n\t\tcolor2 = 2;\n\t}\n\telse {\n\t\tcolor1 = 0;\n\t\tcolor2 = 1;\n\t}\n\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < X; ++j) {\n\t\t\tpTo1[i][j] = pTo2[i][j] = pSource[i][j];\n\t\t}\n\t}\n\t\n\tmemset(Used, false, sizeof(Used));\n\tconvert.push(make_pair(0, 0));\n\tUsed[0][0] = true;\n\tpTo1[0][0] = color1;\n\tpTo2[0][0] = color2;\n\n\twhile (!convert.empty()) {\n\t\tpair<int, int> temp;\n\t\ttemp = convert.front();\n\t\tconvert.pop();\n\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tnowX = temp.first + Dx[i];\n\t\t\tnowY = temp.second + Dy[i];\n\n\t\t\tif (nowX<0 || nowX>=X || nowY<0 || nowY>=Y) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (Used[nowY][nowX]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (pSource[nowY][nowX] != pSource[0][0]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tUsed[nowY][nowX] = true;\n\t\t\tpTo1[nowY][nowX] = color1;\n\t\t\tpTo2[nowY][nowX] = color2;\n\t\t\tconvert.push(make_pair(nowX, nowY));\n\t\t}\n\t}\n\n}\n\nvoid solve(int (*p)[10], int cnt) {\n\n\tif (judge(p)) {\n\t\tAns = min(Ans, cnt);\n\t\treturn;\n\t}\n\tif (cnt >= Ans) {\n\t\treturn;\n\t}\n\n\tint Tmp1[10][10], Tmp2[10][10];\n\n\tnextState(p, Tmp1, Tmp2);\n\tsolve(Tmp1, cnt + 1);\n\tsolve(Tmp2, cnt + 1);\n}\n\nint main() {\n\tchar c;\n\tint mapData[10][10];\n\n\twhile (cin >> X >> Y, X) {\n\t\tfor (int i = 0; i < Y; ++i) {\n\t\t\tfor (int j = 0; j < X; ++j) {\n\t\t\t\tcin >> c;\n\t\t\t\tif (c == 'R') {\n\t\t\t\t\tmapData[i][j] = 0;\n\t\t\t\t}\n\t\t\t\telse if (c == 'G') {\n\t\t\t\t\tmapData[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse if (c == 'B') {\n\t\t\t\t\tmapData[i][j] = 2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//show(mapData);\n\t\tAns = 15;\n\t\tsolve(mapData, 0);\n\t\tcout << Ans << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 0.8,
"time_ms": 120,
"memory_kb": 3112,
"score_of_the_acc": -0.0378,
"final_rank": 20
},
{
"submission_id": "aoj_0243_4455857",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint X, Y, Ans;\nint Dx[] = { 1,0,-1,0 };\nint Dy[] = { 0,1,0,-1 };\nbool Used[10][10];\n\n\nvoid show(int s[10][10]) {\n\tchar ch;\n\n\tfor (int i = 0; i < Y; i++) {\n\t\tfor (int j = 0; j < X; j++) {\n\t\t\tif (s[i][j] == 0) {\n\t\t\t\tch = 'R';\n\t\t\t}\n\t\t\telse if (s[i][j] == 1) {\n\t\t\t\tch = 'G';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tch = 'B';\n\t\t\t}\n\t\t\tcout << ch << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\tcout << \"--\\n\";\n}\n\nbool judge(int(*p)[10]) {\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < X; ++j) {\n\t\t\tif (p[i][j] != p[0][0]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid nextState(int (*pSource)[10], int (*pTo1)[10], int (*pTo2)[10]) {\n\tint color1, color2, nowX, nowY;\n\tqueue<pair<int, int> > convert;\n\n\tif (pSource[0][0] == 0) {\n\t\tcolor1 = 1;\n\t\tcolor2 = 2;\n\t}\n\telse if (pSource[0][0] == 1) {\n\t\tcolor1 = 0;\n\t\tcolor2 = 2;\n\t}\n\telse {\n\t\tcolor1 = 0;\n\t\tcolor2 = 1;\n\t}\n\n\tfor (int i = 0; i < Y; ++i) {\n\t\tfor (int j = 0; j < X; ++j) {\n\t\t\tpTo1[i][j] = pTo2[i][j] = pSource[i][j];\n\t\t}\n\t}\n\t\n\tmemset(Used, false, sizeof(Used));\n\tconvert.push(make_pair(0, 0));\n\tUsed[0][0] = true;\n\tpTo1[0][0] = color1;\n\tpTo2[0][0] = color2;\n\n\twhile (!convert.empty()) {\n\t\tpair<int, int> temp;\n\t\ttemp = convert.front();\n\t\tconvert.pop();\n\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tnowX = temp.first + Dx[i];\n\t\t\tnowY = temp.second + Dy[i];\n\n\t\t\tif (nowX<0 || nowX>=X || nowY<0 || nowY>=Y) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (Used[nowY][nowX]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (pSource[nowY][nowX] != pSource[0][0]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tUsed[nowY][nowX] = true;\n\t\t\tpTo1[nowY][nowX] = color1;\n\t\t\tpTo2[nowY][nowX] = color2;\n\t\t\tconvert.push(make_pair(nowX, nowY));\n\t\t}\n\t}\n\n}\n\nvoid solve(int (*p)[10], int cnt) {\n\n\tif (judge(p)) {\n\t\tAns = min(Ans, cnt);\n\t\treturn;\n\t}\n\tif (cnt >= Ans) {\n\t\treturn;\n\t}\n\n\tint Tmp1[10][10], Tmp2[10][10];\n\n\tnextState(p, Tmp1, Tmp2);\n\tsolve(Tmp1, cnt + 1);\n\tsolve(Tmp2, cnt + 1);\n}\n\nint main() {\n\tchar c;\n\tint mapData[10][10];\n\n\twhile (cin >> X >> Y, X) {\n\t\tfor (int i = 0; i < Y; ++i) {\n\t\t\tfor (int j = 0; j < X; ++j) {\n\t\t\t\tcin >> c;\n\t\t\t\tif (c == 'R') {\n\t\t\t\t\tmapData[i][j] = 0;\n\t\t\t\t}\n\t\t\t\telse if (c == 'G') {\n\t\t\t\t\tmapData[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse if (c == 'B') {\n\t\t\t\t\tmapData[i][j] = 2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//show(mapData);\n\t\tAns = 25;\n\t\tsolve(mapData, 0);\n\t\tcout << Ans << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 1570,
"memory_kb": 3120,
"score_of_the_acc": -0.6472,
"final_rank": 12
},
{
"submission_id": "aoj_0243_4386479",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int h, w;\n using A = array<array<char, 12>, 12>;\n while(cin >> w >> h, w){\n A v;\n for (auto &&k : v) fill(k.begin(),k.end(), -1);\n for (int i = 1; i <= h; ++i) {\n for (int j = 1; j <= w; ++j) {\n char c;\n cin >> c;\n if(c == 'R') v[i][j] = 0;\n else if(c == 'G') v[i][j] = 1;\n else v[i][j] = 2;\n }\n }\n int ans = 18;\n array<int, 4> dx{-1, 1, 0, 0}, dy{0, 0, -1, 1};\n vector<pair<int, int>> hist;\n queue<pair<int, int>> Q;\n auto dfs = [&](int dep, A a, int prv, auto &&f) -> void {\n if(dep >= ans) return;\n for (int to = 0; to < 3; ++to) {\n if(a[1][1] == to) continue;\n A b = a;\n int cnt = 0;\n Q.emplace(1, 1);\n b[1][1] = to;\n while(!Q.empty()){\n int y, x; tie(y, x) = Q.front(); Q.pop();\n cnt++;\n for (int k = 0; k < 4; ++k) {\n if(b[y+dy[k]][x+dx[k]] == a[1][1]){\n b[y+dy[k]][x+dx[k]] = to;\n Q.emplace(y+dy[k], x+dx[k]);\n }\n }\n }\n if(cnt == h*w) ans = min(ans, dep);\n else if(prv < cnt) f(dep+1, b, cnt, f);\n }\n };\n dfs(0, v, 0, dfs);\n cout << ans << \"\\n\";\n }\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3120,
"score_of_the_acc": -0.0883,
"final_rank": 5
},
{
"submission_id": "aoj_0243_4386463",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int h, w;\n using A = array<array<char, 12>, 12>;\n while(cin >> w >> h, w){\n A v;\n for (auto &&k : v) fill(k.begin(),k.end(), -1);\n for (int i = 1; i <= h; ++i) {\n for (int j = 1; j <= w; ++j) {\n char c;\n cin >> c;\n if(c == 'R') v[i][j] = 0;\n else if(c == 'G') v[i][j] = 1;\n else v[i][j] = 2;\n }\n }\n int ans = h+w;\n array<int, 4> dx{-1, 1, 0, 0}, dy{0, 0, -1, 1};\n vector<pair<int, int>> hist;\n queue<pair<int, int>> Q;\n auto dfs = [&](int dep, A a, int prv, auto &&f) -> void {\n if(dep >= ans) return;\n for (int to = 0; to < 3; ++to) {\n if(a[1][1] == to) continue;\n A b = a;\n int cnt = 0;\n Q.emplace(1, 1);\n b[1][1] = to;\n while(!Q.empty()){\n int y, x; tie(y, x) = Q.front(); Q.pop();\n cnt++;\n for (int k = 0; k < 4; ++k) {\n if(b[y+dy[k]][x+dx[k]] == a[1][1]){\n b[y+dy[k]][x+dx[k]] = to;\n Q.emplace(y+dy[k], x+dx[k]);\n }\n }\n }\n if(cnt == h*w) ans = min(ans, dep);\n else if(prv < cnt) f(dep+1, b, cnt, f);\n }\n };\n dfs(0, v, 0, dfs);\n cout << ans << \"\\n\";\n }\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3168,
"score_of_the_acc": -0.089,
"final_rank": 6
},
{
"submission_id": "aoj_0243_4172605",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<int,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1<<29;\nconstexpr ll MOD = ll(1e9)+7;\nconstexpr int di[] = {0,1,0,-1};\nconstexpr int dj[] = {1,0,-1,0};\n\nint h, w, ans;\n\nvoid solve(vector<vector<int> > &a, vector<queue<P> > que, int cnt = -1){\n bool update = false;\n vector<P3> tmp;\n auto q = que;\n for(int k=0;k<3;k++){\n if(que[k].empty()) continue;\n update = true;\n tmp.clear();\n while(!que[k].empty()){\n P p = que[k].front();\n que[k].pop();\n int i = p.first, j = p.second;\n for(int x=0;x<4;x++){\n int ni = i+di[x], nj = j+dj[x];\n if(ni < 0 || ni >= h) continue;\n if(nj < 0 || nj >= w) continue;\n if(a[ni][nj] != 4){\n tmp.push_back(P3(a[ni][nj],P(ni,nj)));\n que[a[ni][nj]].push(P(ni,nj));\n a[ni][nj] = 4;\n }\n }\n }\n if(ans >= cnt) solve(a, que, cnt+1);\n for(auto pp : tmp){\n int i = pp.second.first, j = pp.second.second;\n a[i][j] = pp.first;\n }\n que = q;\n }\n if(!update) ans = min(ans, cnt);\n}\n\nint main(){\n vector<vector<int> > a;\n while(cin >> w >> h, w){\n a.clear();\n a.resize(h, vector<int>(w));\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n char c;\n cin >> c;\n if(c == 'R') a[i][j] = 0;\n if(c == 'G') a[i][j] = 1;\n if(c == 'B') a[i][j] = 2;\n }\n }\n ans = INF;\n vector<queue<P> > q(3);\n q[a[0][0]].push(P(0,0));\n a[0][0] = 4;\n solve(a, q);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 450,
"memory_kb": 3308,
"score_of_the_acc": -0.1791,
"final_rank": 7
},
{
"submission_id": "aoj_0243_3911474",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n\nstruct Coordinate {\n\tint x, y;\n\tstd::vector<Coordinate> neighbors() const { return std::vector<Coordinate>{ Coordinate{x + 1, y}, Coordinate{x - 1, y}, Coordinate{x, y + 1}, Coordinate{x, y - 1} }; }\n};\nconstexpr std::array<char, 3> Colors = { 'R', 'G', 'B' };\nint min_step(std::vector<std::vector<char>>& state, const int current_step = 0, int current_min = 30) {\n\tif (current_step >= current_min) return current_min;\n\tif (std::all_of(state.begin(), state.end(), [&state](const std::vector<char>& line) {return std::all_of(line.begin(), line.end(), [&state](const char c) {return c == state[0][0]; }); })) return current_step;\n\tauto initial = state[0][0];\n\tstd::vector<std::vector<bool>> is_join(state.size(), std::vector<bool>(state.front().size(), false));\n\tis_join[0][0] = true;\n\tstd::queue<Coordinate> queue; queue.push(Coordinate{ 0, 0 });\n\twhile (!queue.empty()) {\n\t\tauto top = queue.front(); queue.pop();\n\t\tfor (auto next : top.neighbors()) if (0 <= next.y && next.y < state.size() && 0 <= next.x && next.x < state.front().size() && !is_join[next.y][next.x]) {\n\t\t\tif (state[next.y][next.x] == initial) {\n\t\t\t\tis_join[next.y][next.x] = true;\n\t\t\t\tqueue.push(next);\n\t\t\t}\n\t\t}\n\t}\n\tauto diff = std::distance(Colors.begin(), std::find(Colors.begin(), Colors.end(), initial));\n\tfor (auto c = 1; c < 3; ++c) {\n\t\tfor (auto i = 0; i < state.size(); ++i) for (auto j = 0; j < state[i].size(); ++j) {\n\t\t\tif (is_join[i][j]) state[i][j] = Colors[(c + diff) % 3];\n\t\t}\n\t\tcurrent_min = min_step(state, current_step + 1, current_min);\n\t}\n\tfor (auto i = 0; i < state.size(); ++i) for (auto j = 0; j < state[i].size(); ++j) if (is_join[i][j]) state[i][j] = initial;\n\treturn current_min;\n}\nint main() {\n\tstd::cin.tie(0); std::cin.sync_with_stdio(false);\n\twhile (true) {\n\t\tint x, y; std::cin >> x >> y; if (x == 0 && y == 0) break;\n\t\tstd::vector<std::vector<char>> state(y, std::vector<char>(x)); for (auto& line : state) for (auto& cell : line) std::cin >> cell;\n\t\tstd::cout << min_step(state) << '\\n';\n\t}\n}",
"accuracy": 1,
"time_ms": 2160,
"memory_kb": 3192,
"score_of_the_acc": -0.896,
"final_rank": 15
},
{
"submission_id": "aoj_0243_3713556",
"code_snippet": "#include <cstdio>\n#include <cstdint>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <utility>\n#include <tuple>\n#include <queue>\n\nconstexpr size_t m1 = -1;\nconstexpr size_t di[] = {m1, 0, 1, 0};\nconstexpr size_t dj[] = {0, m1, 0, 1};\n\nusing ban = std::vector<std::string>;\nusing zahyo = std::pair<size_t, size_t>;\n\nbool nuru(ban& t, char c) {\n char c0 = t[0][0];\n size_t h = t.size();\n size_t w = t[0].length();\n std::queue<zahyo> q;\n q.emplace(0, 0);\n t[0][0] = c;\n while (!q.empty()) {\n size_t i, j;\n std::tie(i, j) = q.front();\n q.pop();\n for (int k = 0; k < 4; ++k) {\n size_t ni = i + di[k];\n size_t nj = j + dj[k];\n if (!(ni < h && nj < w)) continue;\n if (t[ni][nj] != c0) continue;\n t[ni][nj] = c;\n q.emplace(ni, nj);\n }\n }\n\n size_t res = 0;\n for (size_t i = 0; i < h; ++i)\n for (size_t j = 0; j < w; ++j)\n if (t[i][j] == c) ++res;\n\n return (res == h * w);\n}\n\nint testcase_ends() {\n size_t H, W;\n scanf(\"%zu %zu\", &W, &H);\n if (H == 0 && W == 0) return 1;\n\n std::vector<std::string> s(H, std::string(W, '@'));\n for (size_t i = 0; i < H; ++i)\n for (size_t j = 0; j < W; ++j)\n scanf(\" %c\", &s[i][j]);\n\n {\n size_t count = 0;\n for (size_t i = 0; i < H; ++i)\n for (size_t j = 0; j < W; ++j)\n if (s[0][0] == s[i][j]) ++count;\n\n if (count == H * W) return puts(\"0\"), 0;\n }\n\n std::string const color = \"RGB\";\n\n std::queue<std::pair<ban, int>> q;\n q.emplace(s, 0);\n while (!q.empty()) {\n ban b;\n size_t res;\n std::tie(b, res) = q.front();\n q.pop();\n for (char c: color) {\n if (b[0][0] == c) continue;\n ban t = b;\n if (nuru(t, c)) return !printf(\"%zu\\n\", res+1);\n q.emplace(t, res+1);\n }\n }\n return 0;\n}\n\nint main() {\n while (!testcase_ends()) {}\n}",
"accuracy": 1,
"time_ms": 910,
"memory_kb": 74576,
"score_of_the_acc": -1.338,
"final_rank": 17
},
{
"submission_id": "aoj_0243_3713432",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\n#define int long long int\nconst int INF = 1001001001001001LL;\nconst int MOD = 1000000007;\n\nint di[4] = {1, 0, -1, 0};\nint dj[4] = {0, -1, 0, 1};\n\nint x, y;\n\nvoid dfs(int i, int j, char cur, char next, vector<vector<char>> &vec){\n \n vec[i][j] = next;\n for(int h = 0; h < 4; h++){\n int ni = i + di[h];\n int nj = j + dj[h];\n if(ni < 0 || y <= ni || nj < 0 || x <= nj) continue;\n\n if(vec[ni][nj] == cur) dfs(ni, nj, cur, next, vec);\n }\n}\n\n\n\nsigned main(){\n \n while(1){\n cin >> x >> y;\n if(x == 0) break;\n vector<vector<char>> g(y, vector<char> (x));\n for(int i = 0; i < y; i++){\n for(int j = 0; j < x; j++){\n cin >> g[i][j];\n }\n }\n \n set<vector<vector<char>>> st;\n queue<pair<int, vector<vector<char>>>> que;\n que.push({0, g});\n st.insert(g);\n \n while(1){\n \n auto tmp = que.front();\n auto vec = tmp.second;\n int cost = tmp.first;\n que.pop();\n \n /*cout << endl;\n for(int i = 0; i < y; i++){\n for(int j = 0; j < x; j++){\n cout << vec[i][j] << \" \";\n }\n cout << endl;\n }\n cout << endl;\n */\n\n bool flag = true;\n char cur = vec[0][0];\n for(int i = 0; i < y; i++){\n for(int j = 0; j < x; j++){\n if(vec[i][j] != cur) flag = false;\n }\n }\n\n if(flag){\n cout << cost << endl;\n break;\n }\n \n if(cur != 'R'){\n auto vec2 = vec;\n dfs(0, 0, cur, 'R', vec2);\n\n if(st.find(vec2) == st.end()){\n que.push({cost + 1, vec2});\n st.insert(vec2);\n }\n }\n \n if(cur != 'B'){\n auto vec2 = vec;\n dfs(0, 0, cur, 'B', vec2);\n if(st.find(vec2) == st.end()){\n\n que.push({cost + 1, vec2});\n st.insert(vec2);\n }\n }\n \n if(cur != 'G'){\n auto vec2 = vec;\n dfs(0, 0, cur, 'G', vec2);\n if(st.find(vec2) == st.end()){\n\n que.push({cost + 1, vec2});\n st.insert(vec2);\n }\n }\n \n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 7784,
"score_of_the_acc": -0.0759,
"final_rank": 3
},
{
"submission_id": "aoj_0243_3545581",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\n\nusing vc = vector<vector<char>>;\n\nvoid dfs(vc &c, int y, int x, char oldc, char newc) {\n if(y < 0 || y >= c.size() || x < 0 || x >= c[0].size()) return;\n if(c[y][x] != oldc) return;\n c[y][x] = newc;\n\n for(int i = 0; i < 4; ++i) {\n int ny = y + dy[i], nx = x + dx[i]; \n dfs(c, ny, nx, oldc, newc);\n }\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n char tmp[] = {'R', 'G', 'B'};\n\n int x, y;\n while(cin >> x >> y, y != 0) {\n vc c(y, vector<char>(x));\n for(int i = 0; i < y; ++i) {\n for(int j = 0; j < x; ++j) {\n cin >> c[i][j];\n }\n }\n\n int ans = 1e9;\n queue<vc> que;\n que.push(c);\n map<vc, int> mp;\n mp[c] = 0;\n\n while(!que.empty()) {\n vc s = que.front();\n que.pop();\n\n {\n bool ok = true;\n for(int i = 0; i < y; ++i) {\n for(int j = 0; j < x; ++j) {\n if(s[0][0] != s[i][j]) ok = false;\n }\n }\n\n if(ok) {\n ans = mp[s];\n break;\n }\n }\n\n for(int i = 0; i < 3; ++i) {\n if(s[0][0] == tmp[i]) continue;\n\n vc nc = s;\n\n dfs(nc, 0, 0, s[0][0], tmp[i]);\n if(!mp.count(nc)) {\n mp[nc] = mp[s] + 1;\n que.push(nc);\n }\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 7872,
"score_of_the_acc": -0.0855,
"final_rank": 4
},
{
"submission_id": "aoj_0243_3260346",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\nusing namespace std;\n#define inRange(x,a,b) (a <= x && x < b)\n\nint dx[8] = {0,0,1,-1,1,1,-1,-1};\nint dy[8] = {1,-1,0,0,1,-1,1,-1};\n\nstruct board{\n int y, x;\n vector<vector<char>> v;\n board(int i, int j) : y(i), x(j) {\n v.resize(i, vector<char>(j));\n }\n};\n\nbool check(vector<vector<char>> v, int siz){\n int cnt = 0;\n for(int i = 0; i < v.size(); i++){\n for(int j = 0; j < v[i].size(); j++){\n cnt += (v[i][j] == v[0][0]);\n }\n }\n return cnt == siz;\n}\n\nint main(){\n int x, y;\n while(cin >> x >> y, x+y){\n char mat[y][x];\n board ini(y, x);\n for(int i = 0; i < y; i++){\n for(int j = 0; j < x; j++){\n cin >> mat[i][j];\n ini.v[i][j] = mat[i][j];\n }\n }\n\n queue<pair<int, board>> q;\n q.push({0, ini});\n\n int ans = -1;\n while(ans == -1 && !q.empty()){\n auto p = q.front(); q.pop();\n \n if(check(p.second.v, x*y)){\n ans = p.first;\n break;\n }\n\n for(int i = 0; i < 3; i++){\n char from = p.second.v[0][0], to = \"RGB\"[i];\n if(from == to) continue;\n board next = p.second;\n queue<pair<int,int>> pq;\n pq.push({0,0});\n while(!pq.empty()){\n pair<int,int> now = pq.front(); pq.pop();\n if(next.v[now.first][now.second] == to) continue;\n next.v[now.first][now.second] = to;\n for(int k = 0; k < 4; k++){\n int ni = now.first + dx[k], nj = now.second + dy[k];\n if(inRange(ni, 0, y) && inRange(nj, 0, x) && next.v[ni][nj] == from){\n pq.push({ni,nj});\n }\n } \n }\n\n if(check(next.v, x*y)){\n ans = p.first+1;\n break;\n }\n q.push({p.first+1, next});\n }\n }\n\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1210,
"memory_kb": 76684,
"score_of_the_acc": -1.4926,
"final_rank": 19
},
{
"submission_id": "aoj_0243_3260342",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\nusing namespace std;\n#define inRange(x,a,b) (a <= x && x < b)\n\nint dx[8] = {0,0,1,-1,1,1,-1,-1};\nint dy[8] = {1,-1,0,0,1,-1,1,-1};\n\nstruct board{\n int y, x;\n vector<vector<char>> v;\n board(int i, int j) : y(i), x(j) {\n v.resize(i, vector<char>(j));\n }\n};\n\nint main(){\n int x, y;\n while(cin >> x >> y, x+y){\n char mat[y][x];\n board ini(y, x);\n for(int i = 0; i < y; i++){\n for(int j = 0; j < x; j++){\n cin >> mat[i][j];\n ini.v[i][j] = mat[i][j];\n }\n }\n\n queue<pair<int, board>> q;\n q.push({0, ini});\n\n int ans = -1;\n while(ans == -1 && !q.empty()){\n auto p = q.front(); q.pop();\n int cnt = 0;\n char c = p.second.v[0][0];\n for(int i = 0; i < y; i++){\n for(int j = 0; j < x; j++){\n if(c == p.second.v[i][j]) cnt++;\n }\n }\n if(cnt == x*y){\n ans = p.first;\n break;\n }\n\n for(int i = 0; i < 3; i++){\n char from = p.second.v[0][0], to = \"RGB\"[i];\n if(from == to) continue;\n board next = p.second;\n queue<pair<int,int>> pq;\n pq.push({0,0});\n while(!pq.empty()){\n pair<int,int> now = pq.front(); pq.pop();\n if(next.v[now.first][now.second] == to) continue;\n next.v[now.first][now.second] = to;\n for(int k = 0; k < 4; k++){\n int ni = now.first + dx[k], nj = now.second + dy[k];\n if(inRange(ni, 0, y) && inRange(nj, 0, x) && next.v[ni][nj] == from){\n pq.push({ni,nj});\n }\n } \n }\n\n cnt = 0;\n c = to;\n for(int i = 0; i < y; i++) for(int j = 0; j < x; j++) cnt += (next.v[i][j] == c);\n if(cnt == x*y){\n ans = p.first+1;\n break;\n }\n q.push({p.first+1, next});\n }\n }\n\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 960,
"memory_kb": 76920,
"score_of_the_acc": -1.3908,
"final_rank": 18
}
] |
aoj_0237_cpp
|
最後の扉
秘境の地"ナラマンダ地方"
この奥深い洞窟に眠る黄金の伝説を求め、探検家ボブとマイクは様々な困難に立ち向かいました。ようやくたどり着いた最後の扉。この先には夢に見た黄金が待っています。
その扉には多数の三角形が描かれていました。試しにマイクがその 1 つに触れてみると、その三角形は光を放ちました。光は三角形の底辺から垂直に頂点方向へ長方形を描きながら伸びていき、その先にある別の三角形に触れました。すると、光に触れた三角形も同じように光を放ち、それを繰り返していきました。
扉の三角形は全て二等辺三角形(正三角形は含まない)で、どれも同じ大きさで、どれも重ならず（かつ触れることなく）、またどれも光は一定の距離だけ伸びていました。最後の三角形が光り終えると、そこには何事もなかったかのような静けさが戻ってきました。
ボブは自分の足下に奇妙なメッセージを見つけました。
「むやみに触れるべからず。汝正しくこの扉に触れたとき、この扉は放たれん。 」
ボブとマイクはこのメッセージの意味を考えながら、 何度も三角形に触れてみましたがなかなか扉は開きません。 しかし、それを繰り返していくうちに、二人はメッセージの意味がだんだん分かってきました。
「"むやみに触れるべからず"とは、扉に触れる回数は最小ということ。
できるだけ少ない回数で触れて、全ての三角形を光らせれば、きっと扉は開くはずだ!」
例えば、扉には図 1 のように複数の二等辺三角形が描かれています。
図 1
最初に左下の三角形に触れると、図 2 に示すように、その三角形の底辺から垂直に頂点方向へ光が放たれ、その光が触れる三角形が次々に光ります。
図 2
次に左端の三角形に触れると、図 3 に示すように、全ての三角形が光ります。この手順が全ての三角形を光らせるための最少の手数(2 手)となります。
図 3
さあ、ボブとマイクが最後の扉を開ける手助けをしよう。
扉に描かれている三角形の個数、光の伸びる長さ、それぞれの三角形の頂点の座標を入力とし、全ての三角形を光らせるために扉に触れる最少の回数を出力するプログラムを作成して下さい。光の伸びる長さは、底辺からの長さであるものとします。また、光はそれを放つ三角形の頂点を含むような十分な長さを持ちます。
なお、この問題を解くにあたっては、2 点の距離が 0.01 以下の場合には、同一の点と処理します。また、1 点とひとつの直線の距離が 0.01 以下の場合には、この点はこの直線上にあるとして処理します。
Input
複数のデータセットの並びが入力として与えらる。入力の終わりはゼロふたつの行で示される。各データセットは以下の形式で与えらる。
n
d
T
1
T
2
:
T
n
１行目に扉に描かれている三角形の個数
n
(1 ≤
n
≤ 100) と光の伸びる長さを表す整数
d
(1 ≤
d
≤ 1000) が与えられる。
続く
n
行に各三角形の情報
T
i
が以下の形式で与えられる。
x1
y1
x2
y2
x3
y3
三角形の３つの頂点の座標が整数で与えられる(-1000 ≤
x1
,
y1
,
x2
,
y2
,
x3
,
y3
≤ 1000)。
データセットの数は 20 を超えない。
Output
データセットごとに、扉に触れる最少の回数を1行に出力する。
Sample Input
3 4
1 0 3 0 2 1
2 3 2 5 3 4
5 3 5 5 6 4
3 2
1 0 3 0 2 1
2 3 2 5 3 4
5 3 5 5 6 4
0 0
Output for the Sample Input
1
3
|
[
{
"submission_id": "aoj_0237_2201511",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define rep(i,n) REP(i,0,n)\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\n#define pb push_back\n#define all(r) (r).begin(),(r).end()\n#define rall(r) (r).rbegin(),(r).rend()\n#define fi first\n#define se second\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n \nconst double EPS = 0.01;\nconst double INF = 1e12;\nconst double PI = acos(-1);\ntypedef complex<double> P;\ntypedef complex<double> point;\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n}\ndouble cross(const P& a, const P& b) {\n\treturn imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n\treturn real(conj(a)*b);\n}\n\nstruct L : public vector<P> {\n\tL(const P &a, const P &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\n\ntypedef vector<P> G;\ntypedef vector<P> polygon;\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}\nbool intersectSP(const L &s, const P &p) {\n\treturn abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\nbool intersectSS(const L &s, const L &t) {\n\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n\t\t\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nenum { OUT, ON, IN };\n// int contains(const polygon& P, const point& p) {\n// \tbool in = false;\n// \tfor (int i = 0; i < P.size(); ++i) {\n// \t\tpoint a = curr(P,i) - p, b = next(P,i) - p;\n// \t\tif (imag(a) > imag(b)) swap(a, b);\n// \t\tif (imag(a) <= 0 && 0 < imag(b))\n// \t\t\tif (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// }\nint contains(const G& pol, const P& p){\n\tif(pol.size() < 2) return OUT;\n\tif(intersectSP({pol[0], pol[1]}, p)) return ON;\n\tbool f = cross(pol[1]-pol[0], p - pol[0]) > 0;\n\tfor(int i = 1; i < pol.size(); i++) {\n\t\tauto& now = pol[i];\n\t\tauto& nxt = pol[(i+1) % pol.size()];\n\t\tif(intersectSP({nxt, now}, p)) return ON;\n\t\tif(f^(cross(nxt-now, p-now)>0)) return OUT;\n\t}\n\treturn IN;\n}\n\n\n//????????´???????£???????????????????(??????????????£???????????????)\nenum{NO_HIT=0, HIT, A_IN_B, B_IN_A};\nint HitPol_Pol(const polygon& a, const polygon& b){\n\tbool f = true, hit = false;\n\trep(i, a.size()){\n\t\tif(contains(b, a[i]) == OUT) f = false;\n\t\telse hit = true;\n\t}\n\tif(f) return A_IN_B;\n\tf = true;\n\trep(i, b.size()){\n\t\tif(contains(a, b[i]) == OUT) f = false;\n\t\telse hit = true;\n\t}\n\tif(f) return B_IN_A;\n\tif(hit) return HIT;\n\trep(i, a.size()) rep(j, b.size()){\n\t\tL la(curr(a, i), next(a, i)), lb(curr(b, j), next(b, j));\n\t\tif(intersectSS(la, lb)) return HIT;\n\t}\n\treturn NO_HIT;\n}\n//point???theta???????????¢\npoint spinP(const point& p, double theta){\n\treturn p*complex<double>(cos(theta),sin(theta));\n}\npoint spinPExtend(const point& p, double theta, double rate){\n\treturn p*complex<double>(rate*cos(theta),rate*sin(theta));\n}\n\nstruct SCC{//O(V+E)\n static const int MAX_V = 1010;\n int V;\n vector<int> G[MAX_V], rG[MAX_V];\n vector<int> vs;\n bool used[MAX_V];\n int cmp[MAX_V];\n vector<vector<int> > res;\n \n \n SCC(int v) : V(v){};\n void add_edge(int from, int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n }\n \n void dfs(int v){\n used[v] = true;\n for(int i = 0; i < G[v].size(); i++){\n if(!used[G[v][i]]) dfs(G[v][i]);\n }\n vs.push_back(v);\n }\n void rdfs(int v, int k){\n used[v] = true;\n cmp[v] = k;\n for(int i = 0; i < rG[v].size(); i++){\n if(!used[rG[v][i]]) rdfs(rG[v][i], k);\n }\n }\n \n int scc(){\n memset(used, 0, sizeof(used));\n vs.clear();\n for(int v = 0; v < V; v++){\n if(!used[v]) dfs(v);\n }\n memset(used, 0, sizeof(used));\n int k = 0;\n for(int i = vs.size() - 1; i >= 0; i--){\n if(!used[vs[i]]) rdfs(vs[i], k++);\n }\n \n res.clear();\n res.resize(k);\n for(int i = 0; i < V; i++){\n res[cmp[i]].push_back(i);\n }\n return k;\n }\n};\n\nint main(){\n\tint n, d;\n\twhile(cin >> n >> d && (n+d)){\n\t\tvector<polygon> tri(n);\n\t\trep(i, n){\n\t\t\tdouble x, y;\n\t\t\trep(j, 3){\n\t\t\t\tcin >> x >> y;\n\t\t\t\ttri[i].pb({x, y});\n\t\t\t}\n\t\t}\n\t\tvector<polygon> pol(n);\n\t\trep(i, n){\n\t\t\tdouble dist[3];\n\t\t\trep(j, 3){\n\t\t\t\tdist[j] = abs(curr(tri[i], j)-next(tri[i], j));\n\t\t\t}\n\t\t\trep(j, 3) {\n\t\t\t\tif(abs(dist[j] - dist[(j+1)%3])<1e-8){\n\t\t\t\t\tpol[i].pb(tri[i][j]);\n\t\t\t\t\tpol[i].pb(tri[i][(j+2)%3]);\n\t\t\t\t\tpol[i].pb(spinPExtend(pol[i][0]-pol[i][1], (ccw(pol[i][1], pol[i][0], tri[i][(j+1)%3])> 0)?PI/2:-PI/2, d/abs(pol[i][1]-pol[i][0]))+pol[i][1]);\n\t\t\t\t\tpol[i].pb(pol[i][2]+pol[i][0]-pol[i][1]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSCC scc(n);\n\t\trep(i, n) rep(j, i){\n\t\t\tif(HitPol_Pol(pol[i], tri[j])!=NO_HIT) scc.add_edge(i, j);\n\t\t\tif(HitPol_Pol(tri[i], pol[j])!=NO_HIT) scc.add_edge(j, i);\n\t\t}\n\t\tscc.scc();\n\t\tvector<int> f(scc.res.size(), 1);\n\t\trep(i, n) rep(j, i){\n\t\t\tif(scc.cmp[i] == scc.cmp[j]) continue;\n\t\t\tif(HitPol_Pol(pol[i], tri[j])!=NO_HIT) f[scc.cmp[j]] = 0;\n\t\t\telse if(HitPol_Pol(tri[i], pol[j])!=NO_HIT) f[scc.cmp[i]] = 0;\n\t\t}\n\t\tcout<<accumulate(all(f), 0)<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3564,
"score_of_the_acc": -1.4615,
"final_rank": 20
},
{
"submission_id": "aoj_0237_1493734",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <complex>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\n#include <cstring>\n\n// ???, ????????????\ntypedef std::complex<double> Point;\ntypedef Point Vector;\n\nnamespace std {\n\tbool operator < (const Point &a, const Point &b){\n\t\treturn a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n\t}\n\t\n\tistream& operator >> (istream &is, Point &a){\n\t\tdouble x, y;\n\t\tis >> x >> y;\n\t\ta = Point(x, y);\n\t\treturn is;\n\t}\n\t\n\tostream& operator << (ostream &os, Point a){\n\t\treturn os << a.real() << \" \" << a.imag();\n\t}\n}\n\n// ??´???\nstruct Line {\n\tPoint p1, p2;\n\tLine(){}\n\tLine(const Point &p1, const Point &p2): p1(p1), p2(p2){}\n};\ntypedef Line Segment;\n\nnamespace std {\n\tistream& operator >> (istream &is, Line &a){\n\t\treturn is >> a.p1 >> a.p2;\n\t}\n}\n\n// ???\nstruct Circle {\n\tPoint p; double r;\n\tCircle(){}\n\tCircle(const Point &p, double r): p(p), r(r){}\n};\n\nnamespace std {\n\tistream& operator >> (istream &is, Circle &a){\n\t\treturn is >> a.p >> a.r;\n\t}\n}\n\n// ????§???¢\ntypedef std::vector<Point> Polygon;\n\nconst double EPS = 1e-12;\nconst double INF = 1e12;\nconst double PI = acos(-1.0);\n\n// ????????¨??????????????¢???\nenum CCW {\n\tCOUNTER_CLOCKWISE = 1,\n\tCLOCKWISE = -1,\n\tONLINE_BACK = 2,\n\tONLINE_FRONT = -2,\n\tON_SEGMENT = 0,\n};\n\n// ?????¢????£????????????¢???\nenum {\n\tOUT = 0,\n\tON = 1,\n\tIN = 2,\n};\n\n\n// a ??? 2 ??? (a ^ 2)\ndouble SQ(double a);\n\n// ?????????????????????????????¢??°\nbool EQ(double a, double b);\nbool NEQ(double a, double b);\nbool LT(double a, double b);\nbool GT(double a, double b);\nbool LEQ(double a, double b);\nbool GEQ(double a, double b);\n\n// ??§?????? <=> ?????°?????????\ndouble toDeg(double t);\ndouble toRad(double t);\n\n// ????????? (dot(a, a))\ndouble norm(const Vector &a);\n\n// ??????, ??????\ndouble dot(const Vector &a, const Vector &b);\ndouble cross(const Vector &a, const Vector &b);\n\n// ??´???, ??????\nbool orthogonal(const Segment &s1, const Segment &s2);\nbool parallel(const Segment &s1, const Segment &s2);\n\n// ?°???±, ????°?\nPoint project(const Line &l, const Point &p);\nPoint reflect(const Line &l, const Point &p);\n\n// ?????? (p0, p1) ??¨??? p2 ???????????¢???\nint ccw(const Point &p0, const Point &p1, const Point &p2);\n\n// ????????????\nbool intersectLP(const Line &l, const Point &p);\nbool intersectLL(const Line &l1, const Line &l2);\nbool intersectLS(const Line &l, const Segment &s);\nbool intersectSP(const Segment &s, const Point &p);\nbool intersectSS(const Segment &s1, const Segment &s2);\nint intersectCP(const Circle &c, const Point &p);\nbool intersectCL(const Circle &c, const Line &l);\nint intersectCS(const Circle &c, const Segment &s);\nint intersectCC(const Circle &c1, const Circle &c2);\n\n// ?????¢\ndouble distanceLP(const Line &l, const Point &p);\ndouble distanceLL(const Line &l1, const Line &l2);\ndouble distanceLS(const Line &l, const Segment &s);\ndouble distanceSP(const Segment &s, const Point &p);\ndouble distanceSS(const Segment &s1, const Segment &s2);\ndouble distanceCP(const Circle &c, const Point &p);\ndouble distanceCL(const Circle &c, const Line &l);\ndouble distanceCS(const Circle &c, const Segment &s);\ndouble distanceCC(const Circle &c1, const Circle &c2);\n\n// ??????\nPoint crossPointLL(const Line &l1, const Line &l2);\nPoint crossPointLS(const Line &l, const Segment &s);\nPoint crossPointSS(const Segment &s1, const Segment &s2);\nstd::vector<Point> crossPointCL(const Circle &c, const Line &l);\nstd::vector<Point> crossPointCS(const Circle &c, const Segment &s);\nstd::vector<Point> crossPointCC(const Circle &c1, const Circle &c2);\n\n\ndouble SQ(double a){\n\treturn a * a;\n}\n\nbool EQ(double a, double b){\n\treturn std::abs(a - b) < EPS;\n}\n\nbool NEQ(double a, double b){\n\treturn !EQ(a, b);\n}\n\nbool LT(double a, double b){\n\treturn a - b < -EPS;\n}\n\nbool GT(double a, double b){\n\treturn a - b > EPS;\n}\n\nbool LEQ(double a, double b){\n\treturn !GT(a, b);\n}\n\nbool GEQ(double a, double b){\n\treturn !LT(a, b);\n}\n\ndouble toDeg(double t){\n\treturn t * 180 / PI;\n}\n\ndouble toRad(double t){\n\treturn t / 180 * PI;\n}\n\ndouble norm(const Vector &a){\n\treturn SQ(a.real()) + SQ(a.imag());\n}\n\ndouble dot(const Vector &a, const Vector &b){\n\treturn (conj(a) * b).real();\n}\n\ndouble cross(const Vector &a, const Vector &b){\n\treturn (conj(a) * b).imag();\n}\n\n// AOJ CGL_2_A\nbool orthogonal(const Segment &s1, const Segment &s2){\n\treturn EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\n}\n\n// AOJ CGL_2_A\nbool parallel(const Segment &s1, const Segment &s2){\n\treturn EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\n}\n\n// AOJ CGL_1_A\nPoint project(const Line &l, const Point &p){\n\tVector base = l.p2 - l.p1;\n\tdouble r = dot(p - l.p1, base) / norm(base);\n\treturn l.p1 + base * r;\n}\n\n// AOJ CGL_1_B\nPoint reflect(const Line &l, const Point &p){\n\treturn p + (project(l, p) - p) * 2.0;\n}\n\n// AOJ CGL_1_C\nint ccw(const Point &p0, const Point &p1, const Point &p2){\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\tif (GT(cross(a, b), 0.0)) return COUNTER_CLOCKWISE;\n\tif (LT(cross(a, b), 0.0)) return CLOCKWISE;\n\tif (LT(dot(a, b), 0.0)) return ONLINE_BACK;\n\tif (LT(norm(a), norm(b))) return ONLINE_FRONT;\n\treturn ON_SEGMENT;\n}\n\nbool intersectLP(const Line &l, const Point &p){\n\treturn LEQ(std::abs(cross(l.p1 - p, l.p2 - p)), 0.0);\n}\n\nbool intersectLL(const Line &l1, const Line &l2){\n\treturn !parallel(l1, l2) || LEQ(std::abs(cross(l1.p2 - l1.p1, l2.p1 - l1.p1)), 0.0);\n}\n\nbool intersectLS(const Line &l, const Segment &s){\n\treturn LEQ(cross(l.p2 - l.p1, s.p1 - l.p1) * cross(l.p2 - l.p1, s.p2 - l.p1), 0.0);\n}\n\nbool intersectSP(const Segment &s, const Point &p){\n\treturn norm(s.p1 - p) + norm(s.p2 - p) - norm(s.p2 - s.p1) < EPS;\n}\n\n// CGL_2_B\nbool intersectSS(const Segment &s1, const Segment &s2){\n\treturn ccw(s1.p1, s1.p2, s2.p1) * ccw(s1.p1, s1.p2, s2.p2) <= 0 &&\n\t\tccw(s2.p1, s2.p2, s1.p1) * ccw(s2.p1, s2.p2, s1.p2) <= 0;\n}\n\nint intersectCP(const Circle &c, const Point &p){\n\tdouble dd = norm(c.p - p);\n\tif (LT(dd, SQ(c.r))) return IN;\n\tif (EQ(dd, SQ(c.r))) return ON;\n\treturn OUT;\n}\n\nbool intersectCL(const Circle &c, const Line &l){\n\tdouble d = distanceLP(l, c.p);\n\treturn LEQ(d, c.r);\n}\n\nint intersectCS(const Circle &c, const Segment &s){\n\tdouble dd1 = norm(c.p - s.p1);\n\tdouble dd2 = norm(c.p - s.p2);\n\tif (LT(dd1, SQ(c.r)) && LT(dd2, SQ(c.r))) return IN;\n\tif (GT(distanceCS(c, s), 0.0)) return OUT;\n\treturn ON;\n}\n\n// c1 ??? c2 ???????????????????????¨??? IN\n// c1 ??? c2 ????????£???????????¨??? ON\n// c1 ??? c2 ?????????????????¨??? OUT\nint intersectCC(const Circle &c1, const Circle &c2){\n\tif (GT(norm(c1.p - c2.p), SQ(c1.r + c2.r))) return OUT;\n\tif (LT(norm(c1.p - c2.p), SQ(c2.r))) return IN;\n\tif (LT(norm(c1.p - c2.p), SQ(c1.r))) return OUT;\n\treturn ON;\n}\n\ndouble distanceLP(const Line &l, const Point &p){\n\treturn std::abs(cross(l.p2 - l.p1, p - l.p1)) / std::abs(l.p2 - l.p1);\n}\n\ndouble distanceLL(const Line &l1, const Line &l2){\n\tif (intersectLL(l1, l2)) return 0.0;\n\treturn distanceLP(l1, l2.p1);\n}\n\ndouble distanceLS(const Line &l, const Segment &s){\n\tif (intersectLS(l, s)) return 0.0;\n\treturn std::min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\n\ndouble distanceSP(const Segment &s, const Point &p){\n\tif (dot(s.p2 - s.p1, p - s.p1) < 0.0) return std::abs(p - s.p1);\n\tif (dot(s.p1 - s.p2, p - s.p2) < 0.0) return std::abs(p - s.p2);\n\treturn distanceLP(s, p);\n}\n\n// AOJ CGL_2_D\ndouble distanceSS(const Segment &s1, const Segment &s2){\n\tif (intersectSS(s1, s2)) return 0.0;\n\treturn std::min(\n\t\tstd::min(\n\t\t\tdistanceSP(s1, s2.p1),\n\t\t\tdistanceSP(s1, s2.p2)\n\t\t),\n\t\tstd::min(\n\t\t\tdistanceSP(s2, s1.p1),\n\t\t\tdistanceSP(s2, s1.p2)\n\t\t)\n\t);\n}\n\ndouble distanceCP(const Circle &c, const Point &p){\n\treturn std::abs(std::abs(c.p - p) - c.r);\n} \n\ndouble distanceCL(const Circle &c, const Line &l){\n\tif (intersectCL(c, l)) return 0.0;\n\treturn distanceLP(l, c.p) - c.r;\n}\n\ndouble distanceCS(const Circle &c, const Segment &s){\n\tif (intersectCS(c, s)) return 0.0;\n\treturn std::min(distanceCP(c, s.p1), distanceCP(c, s.p2));\n}\n\ndouble distanceCC(const Circle &c1, const Circle &c2){\n\tif (intersectCC(c1, c2) == ON) return 0.0;\n\tif (intersectCC(c1, c2) == IN){\n\t\treturn c2.r - (std::abs(c1.p - c2.p) + c1.r);\n\t}\n\tif (intersectCC(c2, c1) == IN){\n\t\treturn c1.r - (std::abs(c1.p - c2.p) + c2.r);\n\t}\n\treturn (c1.r + c2.r) - (c1.r + c2.r);\n}\n\nPoint crossPointLL(const Line &l1, const Line &l2){\n\tassert(intersectLL(l1, l2));\n\tVector base = l2.p2 - l2.p1;\n\tdouble d1 = std::abs(cross(base, l1.p1 - l2.p1));\n\tdouble d2 = std::abs(cross(base, l1.p2 - l2.p1));\n\tdouble t = d1 / (d1 + d2);\n\treturn l1.p1 + (l1.p2 - l1.p1) * t;\n}\n\nPoint crossPointLS(const Line &l, const Segment &s){\n\tassert(intersectLS(l, s));\n\treturn crossPointLL(l, s);\n}\n\nPoint crossPointSS(const Segment &s1, const Segment &s2){\n\tassert(intersectSS(s1, s2));\n\treturn crossPointSS(s1, s2);\n}\n\nstd::vector<Point> crossPointCL(const Circle &c, const Line &l){\n\tif (!intersectCL(c, l)) return std::vector<Point>();\n\tstd::vector<Point> ret;\n\tVector proj = project(l, c.p);\n\tVector e = (l.p2 - l.p1) / std::abs(l.p2 - l.p1);\n\tdouble base = sqrt(SQ(c.r) - norm(proj - c.p));\n\tret.push_back(proj + e * base);\n\tret.push_back(proj - e * base);\n\treturn ret;\n}\n\nstd::vector<Point> crossPointCS(const Circle &c, const Segment &s){\n\tstd::vector<Point> ret = crossPointCL(c, s);\n\tfor (int i = 0; i < ret.size(); i++){\n\t\tif (!intersectCP(c, ret[i])){\n\t\t\tswap(ret[i], ret.back());\n\t\t\tret.pop_back();\n\t\t\ti--;\n\t\t}\n\t}\n\treturn ret;\n}\n\nstd::vector<Point> crossPointCC(const Circle &c1, const Circle &c2){\n\tif (!intersectCC(c1, c2)) return std::vector<Point>();\n\tstd::vector<Point> ret;\n\tdouble d = std::abs(c1.p - c2.p);\n\tdouble a = std::acos((SQ(c1.r) + SQ(d) - SQ(c2.r)) / (2 * c1.r * d));\n\tdouble t = std::arg(c2.p - c1.p);\n\tret.push_back(c1.p + std::polar(c1.r, t + a));\n\tret.push_back(c1.p + std::polar(c1.r, t - a));\n\treturn ret;\n}\n\nnamespace {\nenum {DIRECTED, UNDIRECTED};\nconst int GRAPH_TYPE = DIRECTED;\n\ntypedef int Weight;\nconst Weight INF = 1 << 28;\n\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge() {}\n\tEdge(int src, int dst, Weight weight = 1): src(src), dst(dst), weight(weight) {}\n\tbool operator < (const Edge &t) const { return weight < t.weight; }\n};\n\ntypedef std::vector<Edge> Edges;\ntypedef std::vector<Edges> Graph;\n\nvoid addEdge(Graph &g, int src, int dst, int weight = 1)\n{\n\tg[src].push_back(Edge(src, dst, weight));\n\tif (GRAPH_TYPE == UNDIRECTED) g[dst].push_back(Edge(dst, src, weight));\n};\n\nGraph transpose(const Graph &g)\n{\n\tGraph rg(g.size());\n\tfor (int i = 0; i < g.size(); i++){\n\t\tfor (int j = 0; j < g[i].size(); j++){\n\t\t\taddEdge(rg, g[i][j].dst, g[i][j].src, g[i][j].weight);\n\t\t}\n\t}\n\treturn rg;\n}\n\nvoid dfs_(const Graph &g, int v, bool *used, std::vector<int> &vs)\n{\n\tused[v] = true;\n\tfor (int i = 0; i < g[v].size(); i++){\n\t\tint to = g[v][i].dst;\n\t\tif (!used[to]) dfs_(g, to, used, vs);\n\t}\n\tvs.push_back(v);\n}\n\nvoid rdfs_(const Graph &g, int v, int k, bool *used, std::vector<int> &cmp)\n{\n\tused[v] = true;\n\tcmp[v] = k;\n\tfor (int i = 0; i < g[v].size(); i++){\n\t\tint to = g[v][i].dst;\n\t\tif (!used[to]) rdfs_(g, to, k, used, cmp);\n\t}\n}\n\nint scc(const Graph &g, std::vector<int> &cmp)\n{\n\tGraph rg = transpose(g);\n\tstd::vector<int> vs;\n\tbool *used = new bool[g.size()];\n\tcmp.resize(g.size());\n\t\n\tstd::memset(used, false, g.size());\n\tfor (int v = 0; v < g.size(); v++){\n\t\tif (!used[v]) dfs_(g, v, used, vs);\n\t}\n\t\n\tstd::memset(used, false, g.size());\n\tint k = 0;\n\tfor (int i = vs.size() - 1; i >= 0; i--){\n\t\tif (!used[vs[i]]) rdfs_(rg, vs[i], k++, used, cmp);\n\t}\n\t\n\tdelete used;\n\treturn k;\n}\n}\n\n\nusing namespace std;\n\nint n;\ndouble d;\nvector<Polygon> tri;\nvector<Polygon> rect;\n\nbool contains(const Polygon &g, const Point &p)\n{\n\tfor (int i = 0; i < g.size(); i++){\n\t\tint t = ccw(g[i], g[(i + 1) % g.size()], p);\n\t\tif (t == CLOCKWISE) return false;\n\t\tif (t == ON_SEGMENT) return true;\n\t}\n\treturn true;\n}\n\nbool intersect(const Polygon &g, const Polygon &h)\n{\n\tfor (int i = 0; i < g.size(); i++){\n\t\tfor (int j = 0; j < h.size(); j++){\n\t\t\tSegment s(g[i], g[(i + 1) % g.size()]);\n\t\t\tSegment t(h[j], h[(j + 1) % h.size()]);\n\t\t\tif (LEQ(distanceSS(s, t), 0.01)) return true;\n\t\t}\n\t}\n\t\n\tfor (int i = 0; i < g.size(); i++){\n\t\tif (contains(h, g[i])) return true;\n\t}\n\t\n\tfor (int i = 0; i < h.size(); i++){\n\t\tif (contains(g, h[i])) return true;\n\t}\n\t\n\treturn false;\n}\n\nint solve()\n{\n\trect.assign(n, Polygon(4));\n\t\n\tfor (int i = 0; i < n; i++){\n\t\tfor (int j = 0; j < 3; j++){\n\t\t\tif (EQ(norm(tri[i][j] - tri[i][(j + 1) % 3]), norm(tri[i][j] - tri[i][(j + 2) % 3]))){\n\t\t\t\tswap(tri[i][0], tri[i][j]);\n\t\t\t}\n\t\t}\n\t\tif (ccw(tri[i][1], tri[i][2], tri[i][0]) == CLOCKWISE){\n\t\t\tswap(tri[i][1], tri[i][2]);\n\t\t}\n\t\t\n\t\tVector s = tri[i][2] - tri[i][1];\n\t\tVector normal = s / abs(s) * Vector(0, 1) * d;\n\t\trect[i][0] = tri[i][1];\n\t\trect[i][1] = tri[i][2];\n\t\trect[i][2] = tri[i][2] + normal;\n\t\trect[i][3] = tri[i][1] + normal;\n\t}\n\t\n\tGraph graph(n);\n\tfor (int i = 0; i < n; i++){\n\t\tfor (int j = 0; j < n; j++){\n\t\t\tif (i == j) continue;\n\t\t\tif (intersect(rect[i], tri[j])){\n\t\t\t\taddEdge(graph, i, j);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvector<int> cmp;\n\tint v = scc(graph, cmp);\n\tint mat[100][100] = {};\n\tint in[100] = {};\n\tfor (int i = 0; i < n; i++){\n\t\tfor (int j = 0; j < graph[i].size(); j++){\n\t\t\tint src = cmp[i];\n\t\t\tint dst = cmp[graph[i][j].dst];\n\t\t\tif (src == dst) continue;\n\t\t\tif (mat[src][dst]++) continue;\n\t\t\tin[dst]++;\n\t\t}\n\t}\n\tint res = 0;\n\tfor (int i = 0; i < v; i++){\n\t\tif (in[i] == 0) res++;\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tstd::cout << std::fixed << std::setprecision(12);\n\t\n\twhile (cin >> n >> d, n){\n\t\ttri.assign(n, Polygon(3));\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tfor (int j = 0; j < 3; j++){\n\t\t\t\tcin >> tri[i][j];\n\t\t\t}\n\t\t}\n\t\tcout << solve() << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1356,
"score_of_the_acc": -0.5343,
"final_rank": 15
},
{
"submission_id": "aoj_0237_1246042",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\nusing namespace std;\n\nstruct coor {\n\tdouble x, y;\n};\nstruct tri {\n\tcoor p[3];\n\tcoor rec[4];\n};\n\nint n, d;\nvector<tri> v;\nvector<vector<int> > edge;\n\nconst double EPS = 1e-9;\nconst double ERR = 1e-2;\n\ntemplate<class T>\nT sqr(T x) {\n\treturn x * x;\n}\n\ndouble dist(coor a, coor b) {\n\treturn sqrt(sqr(a.x-b.x) + sqr(a.y-b.y));\n}\n\ndouble dist_lp(coor c, coor a, coor b) {\n\tcoor v0, v1;\n\tv0.x = b.x - a.x; v0.y = b.y - a.y;\n\tv1.x = c.x - a.x; v1.y = c.y - a.y;\n\n\tif(sqr(dist(a,b)) + sqr(dist(a,c)) - sqr(dist(c,b)) > 0\n\t\t\t&& sqr(dist(a,b)) + sqr(dist(b,c)) - sqr(dist(c,a)) > 0) {\n\t\tdouble cross;\n\t\tcross = fabs(v0.x * v1.y - v0.y * v1.x);\n\t\treturn cross / dist(a,b);\n\t}\n\n\treturn min(dist(a,c), dist(b,c));\n}\n\nbool in_poly(coor p, coor poly[], int sz) {\n\tdouble sign = +0.0;\n\tfor(int i = 0; i < sz; i++) {\n\t\tcoor v0, v1;\n\t\tv0.x = poly[i].x - p.x; v0.y = poly[i].y - p.y;\n\t\tv1.x = poly[(i+1)%sz].x - p.x; v1.y = poly[(i+1)%sz].y - p.y;;\n\n\t\tif(i != 0 && sign * (v0.x * v1.y - v0.y * v1.x) < EPS*EPS) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tsign = (v0.x * v1.y - v0.y * v1.x);\n\n\t\tif(i == sz-1) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < sz; i++) {\n\t\tif(dist_lp(p,poly[i], poly[(i+1)%sz]) <= ERR + EPS) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool seg_cross(coor a, coor b, coor c, coor d) {\n\tcoor v0, v1, v2;\n\t\n\tv0.x = a.x - c.x; v0.y = a.y - c.y;\n\tv1.x = b.x - c.x; v1.y = b.y - c.y;\n\tv2.x = d.x - c.x; v2.y = d.y - c.y;\n\n\tdouble s, t;\n\ts = (v0.x * v2.y - v0.y * v2.x) / (v0.x * v1.y - v0.y * v1.x);\n\tt = - (v1.x * v2.y - v1.y * v2.x) / (v0.x * v1.y - v0.y * v1.x);\n\n\tif(s + t > 1-EPS && s > -EPS && t > -EPS) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool exist_edge(tri from, tri to) {\n\tfor(int i = 0; i < 3; i++) {\n\t\tif(in_poly(to.p[i], from.rec, 4)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\tfor(int i = 0; i < 4; i++) {\n\t\tif(in_poly(from.rec[i], to.p, 3)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < 3; i++) {\n\t\tfor(int j = 0; j < 4; j++) {\n\t\t\tif(seg_cross(to.p[i], to.p[(i+1)%3], from.rec[j], from.rec[(j+1)%4])) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nbool visited[128];\nbool touch[128];\nbool path[128];\n\nvoid check(int i, int s) {\n\tif(i != s && touch[i])\n\t\ttouch[i] = false;\n\tif(path[i])\n\t\treturn;\n\tvisited[i] = true;\n\tpath[i] = true;\n\tfor(int j = 0; j < (int)edge[i].size(); j++) {\n\t\tcheck(edge[i][j], s);\n\t}\n}\n\nint main() {\n\twhile(cin >> n >> d, n || d) {\n\t\tv.clear();\n\t\tedge.clear();\n\t\tedge.resize(n);\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tvisited[i] = touch[i] = path[i] = false;\n\t\t}\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ttri in;\n\t\t\tfor(int j = 0; j < 3; j++) {\n\t\t\t\tcoor c;\n\t\t\t\tcin >> c.x >> c.y;\n\t\t\t\tin.p[j] = c;\n\t\t\t}\n\n\t\t\tfor(int j = 0; j < 3; j++) {\n\t\t\t\tif(fabs(dist(in.p[(0+j)%3],in.p[(1+j)%3]) - dist(in.p[(1+j)%3], in.p[(2+j)%3])) < EPS) {\n\t\t\t\t\tswap(in.p[(1+j)%3], in.p[1]);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcoor add;\n\t\t\tadd.x =\t(in.p[1].x - in.p[0].x) + (in.p[1].x - in.p[2].x);\n\t\t\tadd.y = (in.p[1].y - in.p[0].y) + (in.p[1].y - in.p[2].y);\n\n\t\t\tdouble addlen;\n\t\t\taddlen = sqrt(sqr(add.x) + sqr(add.y));\n\t\t\tadd.x = add.x * d / addlen;\n\t\t\tadd.y = add.y * d / addlen;\n\n\t\t\tin.rec[0].x = in.p[0].x; in.rec[0].y = in.p[0].y;\n\t\t\tin.rec[1].x = in.p[2].x; in.rec[1].y = in.p[2].y;\n\t\t\tin.rec[2].x = in.p[2].x + add.x; in.rec[2].y = in.p[2].y + add.y;\n\t\t\tin.rec[3].x = in.p[0].x + add.x; in.rec[3].y = in.p[0].y + add.y;\n\n\t\t\tv.push_back(in);\n\t\t}\n\n\t\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\t\tfor(int j = 0; j < (int)v.size(); j++) {\n\t\t\t\tif(i != j) {\n\t\t\t\t\tif(exist_edge(v[i], v[j])) {\n\t\t\t\t\t\tedge[i].push_back(j);\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 < n; i++) {\n\t\t\tif(!visited[i]) {\n\t\t\t\ttouch[i] = true;\n\t\t\t\tcheck(i, i);\n\t\t\t}\n\t\t\tfor(int j = 0; j < 128; j++) {\n\t\t\t\tpath[j] = false;\n\t\t\t}\n\t\t}\n\n\t\tint res = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(touch[i])\n\t\t\t\tres++;\n\t\t}\n\t\tcout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1292,
"score_of_the_acc": -0.4394,
"final_rank": 11
},
{
"submission_id": "aoj_0237_1131596",
"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-10)\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\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\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}\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}\n\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); }\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\nbool ccwtest(Point p,Point q,Point r){ return cross3p(p,q,r) > 0; }\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\ndouble angle(Point a,Point b,Point c) {\n double ux = b.x - a.x, uy = b.y - a.y;\n double vx = c.x - a.x, vy = c.y - a.y;\n return acos((ux*vx + uy*vy)/sqrt((ux*ux + uy*uy) * (vx*vx + vy*vy)));\n} \n \n//多角形poly内（線分上も含む）に点pが存在するかどうは判定する \nbool inPolygon(Polygon poly,Point p){\n if((int)poly.size() == 0)return false;\n rep(i,poly.size()) if(onSegment(poly[i],poly[(i+1)%poly.size()],p))return true;\n double sum = 0;\n for(int i=0; i < (int)poly.size() ;i++) {\n if( equals(cross(poly[i]-p,poly[(i+1)%poly.size()]-p),0.0) ) continue; // ３点が平行だとangleがnanを返しsumがnanになり死ぬ\n if( cross3p(p,poly[i],poly[(i+1)%poly.size()]) < 0 ) sum -= angle(p,poly[i],poly[(i+1)%poly.size()]);\n else sum += angle(p,poly[i],poly[(i+1)%poly.size()]);\n }\n const double eps = 1e-5;\n return (fabs(sum - 2*M_PI) < eps || fabs(sum + 2*M_PI) < eps);\n} \n\n\nconst int MAX_V = 200;\nint V,cmp[MAX_V];\ndouble d;\nPoint ps[MAX_V][3];\nvector<Polygon> poly;\nvector<int> G[MAX_V],rG[MAX_V],vs;\nbool used[MAX_V];\n\nvoid add_edge(int s,int t){\n G[s].push_back(t);\n rG[t].push_back(s);\n}\n\nvoid dfs(int v){\n used[v] = true;\n for(int i=0;i<G[v].size();i++) if( !used[G[v][i]] ) dfs(G[v][i]);\n vs.push_back(v);\n}\n\nvoid rdfs(int v,int k){\n used[v] = true;\n cmp[v] = k;\n for(int i=0;i<rG[v].size();i++) if( !used[rG[v][i]] ) rdfs(rG[v][i],k);\n}\n\nint scc(){\n rep(i,V) used[i] = false;\n vs.clear();\n rep(v,V) if( !used[v] ) dfs(v);\n rep(i,V) used[i] = false;\n int k = 0;\n for(int i=(int)vs.size()-1;i>=0;i--) if( !used[vs[i]] ) rdfs(vs[i],k++);\n return k;\n}\n\n\nbool check(int a,int b) {\n rep(i,(int)poly[a].size()) {\n Segment seg1 = Segment(poly[a][i],poly[a][(i+1)%poly[a].size()]);\n rep(j,3){\n Segment seg2 = Segment(ps[b][j],ps[b][(j+1)%3]);\n if( equals(cross(seg1.p1-seg1.p2,seg2.p1-seg2.p2),0.0) ) {\n if( onSegment(seg1.p1,seg1.p2,seg2.p1) || onSegment(seg1.p1,seg1.p2,seg2.p2) ||\n onSegment(seg2.p1,seg2.p2,seg1.p1) || onSegment(seg2.p1,seg2.p2,seg1.p2) ) return true;\n } else if( intersectSS(seg1,seg2) ) return true;\n }\n }\n rep(i,3) if( inPolygon(poly[a],ps[b][i]) ) return true;\n return false;\n}\n\nvoid converter(int index){\n Polygon temp;\n rep(i,3) {\n double dist[2] = {abs(ps[index][(i+1)%3]-ps[index][(i+2)%3]),\n abs(ps[index][(i+2)%3]-ps[index][i])};\n if( equals(dist[0],dist[1]) ) {\n Point p = projection(Line(ps[index][i],ps[index][(i+1)%3]),ps[index][(i+2)%3]);\n Point e = ( ps[index][(i+2)%3] - p ) / abs( ps[index][(i+2)%3] - p );\n temp.push_back(ps[index][i]);\n temp.push_back(ps[index][(i+1)%3]);\n temp.push_back(ps[index][(i+1)%3] + e * d);\n temp.push_back(ps[index][i] + e * d);\n break;\n }\n }\n assert( !temp.empty() );\n poly.push_back(temp);\n}\n\nint nV;\nstruct Edge { int to; };\n\nvoid draw(vector<vector<Edge> > &nG,int cur){ \n rep(i,(int)nG[cur].size()){\n if( !used[nG[cur][i].to] ) {\n used[nG[cur][i].to] = true;\n draw(nG,nG[cur][i].to);\n }\n }\n}\n\ntemplate<typename T>\nbool visit(const T& G,int v,vector<int>& order,vector<int>& color){\n color[v] = 1;\n for(__typeof((G[v]).begin()) e = G[v].begin();e != G[v].end();e++){\n if(color[e->to] == 2)continue;//このvisit以外のvisitで訪れた\n if(color[e->to] == 1)return false;//このvisitで訪れた\n if(!visit(G,e->to,order,color))return false;\n }\n order.push_back(v);\n color[v] = 2;\n return true;\n}\n\ntemplate<typename T>\nbool topologicalSort(const T& G,vector<int>& order){\n int SizeG = G.size();\n vector<int> color(SizeG); \n for(int u=0;u<SizeG;u++) if(!color[u] && !visit(G,u,order,color)) return false;\n reverse(order.begin(),order.end());\n return true;\n}\n\n\nvoid compute(){\n poly.clear(), vs.clear();\n rep(i,V) G[i].clear(), rG[i].clear(), used[i] = false;\n \n rep(i,V) converter(i);\n\n rep(i,V) rep(j,V) if( i != j && check(i,j) ) add_edge(i,j);\n\n nV = scc();\n\n vector<vector<Edge> > nG(nV,vector<Edge>());\n rep(i,V) rep(j,(int)G[i].size()) {\n if( cmp[i] == cmp[G[i][j]] ) continue;\n nG[cmp[i]].push_back((Edge){cmp[G[i][j]]});\n }\n\n vector<int> order;\n assert( topologicalSort(nG,order) );\n memset(used,false,sizeof(used));\n int answer = 0;\n \n rep(i,nV) if( !used[order[i]] ){\n used[order[i]] = true;\n ++answer;\n draw(nG,order[i]);\n }\n cout << answer << endl;\n}\n\nint main(){\n while( cin >> V >> d, (V|(int)d) ){\n rep(i,V) rep(j,3) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1372,
"score_of_the_acc": -0.4619,
"final_rank": 12
},
{
"submission_id": "aoj_0237_1131591",
"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-10)\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\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//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 \nbool isConvex(vector<Point> p) {\n int sz = (int)p.size();\n if(sz < 3)return false;//boundary case, we treat a point or a line as not convex\n bool isLeft = ccwtest(p[0],p[1],p[2]);\n for(int i=1; i<(int)p.size();i++)\n if(ccwtest(p[i],p[(i+1)%sz],p[(i+2)%sz]) != isLeft) return false;\n return true;\n}\n\n\ndouble angle(Point a,Point b,Point c) {\n double ux = b.x - a.x, uy = b.y - a.y;\n double vx = c.x - a.x, vy = c.y - a.y;\n return acos((ux*vx + uy*vy)/sqrt((ux*ux + uy*uy) * (vx*vx + vy*vy)));\n} \n \n//多角形poly内（線分上も含む）に点pが存在するかどうは判定する \nbool inPolygon(Polygon poly,Point p){\n if((int)poly.size() == 0)return false;\n rep(i,poly.size()) if(onSegment(poly[i],poly[(i+1)%poly.size()],p))return true;\n double sum = 0;\n for(int i=0; i < (int)poly.size() ;i++) {\n if( equals(cross(poly[i]-p,poly[(i+1)%poly.size()]-p),0.0) ) continue; // ３点が平行だとangleがnanを返しsumがnanになり死ぬ\n if( cross3p(p,poly[i],poly[(i+1)%poly.size()]) < 0 ) sum -= angle(p,poly[i],poly[(i+1)%poly.size()]);\n else sum += angle(p,poly[i],poly[(i+1)%poly.size()]);\n }\n // あまり誤差を厳しくしすぎると良くないので以下のほうが良い \n const double eps = 1e-5;\n return (fabs(sum - 2*M_PI) < eps || fabs(sum + 2*M_PI) < eps);\n} \n\n\nconst int MAX_V = 200;\nint V,cmp[MAX_V];\ndouble d;\nPoint ps[MAX_V][3];\nvector<Polygon> poly;\nvector<int> G[MAX_V],rG[MAX_V],vs;\nbool used[MAX_V];\n\nvoid add_edge(int s,int t){\n G[s].push_back(t);\n rG[t].push_back(s);\n}\n\nvoid dfs(int v){\n used[v] = true;\n for(int i=0;i<G[v].size();i++) if( !used[G[v][i]] ) dfs(G[v][i]);\n vs.push_back(v);\n}\n\nvoid rdfs(int v,int k){\n used[v] = true;\n cmp[v] = k;\n for(int i=0;i<rG[v].size();i++) if( !used[rG[v][i]] ) rdfs(rG[v][i],k);\n}\n\nint scc(){\n rep(i,V) used[i] = false;\n vs.clear();\n rep(v,V) if( !used[v] ) dfs(v);\n rep(i,V) used[i] = false;\n int k = 0;\n for(int i=(int)vs.size()-1;i>=0;i--) if( !used[vs[i]] ) rdfs(vs[i],k++);\n return k;\n}\n\n\nbool check(int a,int b) {\n rep(i,(int)poly[a].size()) {\n Segment seg1 = Segment(poly[a][i],poly[a][(i+1)%poly[a].size()]);\n rep(j,3){\n Segment seg2 = Segment(ps[b][j],ps[b][(j+1)%3]);\n if( equals(cross(seg1.p1-seg1.p2,seg2.p1-seg2.p2),0.0) ) {\n if( onSegment(seg1.p1,seg1.p2,seg2.p1) || onSegment(seg1.p1,seg1.p2,seg2.p2) ||\n onSegment(seg2.p1,seg2.p2,seg1.p1) || onSegment(seg2.p1,seg2.p2,seg1.p2) ) return true;\n } else if( intersectSS(seg1,seg2) ) return true;\n }\n }\n rep(i,3) if( inPolygon(poly[a],ps[b][i]) ) return true;\n return false;\n}\n\nvoid converter(int index){\n Polygon temp;\n rep(i,3) {\n double dist[2] = {abs(ps[index][(i+1)%3]-ps[index][(i+2)%3]),\n abs(ps[index][(i+2)%3]-ps[index][i])};\n if( equals(dist[0],dist[1]) ) {\n Point p = projection(Line(ps[index][i],ps[index][(i+1)%3]),ps[index][(i+2)%3]);\n Point e = ( ps[index][(i+2)%3] - p ) / abs( ps[index][(i+2)%3] - p );\n temp.push_back(ps[index][i]);\n temp.push_back(ps[index][(i+1)%3]);\n temp.push_back(ps[index][(i+1)%3] + e * d);\n temp.push_back(ps[index][i] + e * d);\n break;\n }\n }\n assert( !temp.empty() );\n poly.push_back(temp);\n}\n\nint nV;\nstruct Edge { int to; };\n\nvoid draw(vector<vector<Edge> > &nG,int cur){ \n rep(i,(int)nG[cur].size()){\n if( !used[nG[cur][i].to] ) {\n used[nG[cur][i].to] = true;\n draw(nG,nG[cur][i].to);\n }\n }\n}\n\ntemplate<typename T>\nbool visit(const T& G,int v,vector<int>& order,vector<int>& color){\n color[v] = 1;\n for(__typeof((G[v]).begin()) e = G[v].begin();e != G[v].end();e++){\n if(color[e->to] == 2)continue;//このvisit以外のvisitで訪れた\n if(color[e->to] == 1)return false;//このvisitで訪れた\n if(!visit(G,e->to,order,color))return false;\n }\n order.push_back(v);\n color[v] = 2;\n return true;\n}\n\ntemplate<typename T>\nbool topologicalSort(const T& G,vector<int>& order){\n int SizeG = G.size();\n vector<int> color(SizeG); \n for(int u=0;u<SizeG;u++) if(!color[u] && !visit(G,u,order,color)) return false;\n reverse(order.begin(),order.end());\n return true;\n}\n\n\nvoid compute(){\n poly.clear(), vs.clear();\n rep(i,V) G[i].clear(), rG[i].clear(), used[i] = false;\n \n rep(i,V) converter(i);\n\n rep(i,V) rep(j,V) if( i != j && check(i,j) ) add_edge(i,j);\n\n nV = scc();\n\n vector<vector<Edge> > nG(nV,vector<Edge>());\n rep(i,V) rep(j,(int)G[i].size()) {\n if( cmp[i] == cmp[G[i][j]] ) continue;\n nG[cmp[i]].push_back((Edge){cmp[G[i][j]]});\n }\n\n vector<int> order;\n assert( topologicalSort(nG,order) );\n memset(used,false,sizeof(used));\n int answer = 0;\n \n rep(i,nV) if( !used[order[i]] ){\n used[order[i]] = true;\n ++answer;\n draw(nG,order[i]);\n }\n cout << answer << endl;\n}\n\nint main(){\n while( cin >> V >> d, (V|(int)d) ){\n rep(i,V) rep(j,3) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1380,
"score_of_the_acc": -0.4641,
"final_rank": 13
},
{
"submission_id": "aoj_0237_1126365",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<math.h>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e+10;\nconst double PI = acos(-1);\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\ninline double ABS(double a){return max(a,-a);}\nstruct Pt {\n\tdouble x, y;\n\tPt() {}\n\tPt(double x, double y) : x(x), y(y) {}\n\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\n\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\n\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\n\tPt operator-() const { return Pt(-x, -y); }\n\tPt operator*(const double &k) const { return Pt(x * k, y * k); }\n\tPt operator/(const double &k) const { return Pt(x / k, y / k); }\n\tdouble ABS() const { return sqrt(x * x + y * y); }\n\tdouble abs2() const { return x * x + y * y; }\n\tdouble arg() const { return atan2(y, x); }\n\tdouble dot(const Pt &a) const { return x * a.x + y * a.y; }\n\tdouble det(const Pt &a) const { return x * a.y - y * a.x; }\n};\ndouble tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }\nint iSP(Pt a, Pt b, Pt c) {\n\tint s = sig((b - a).det(c - a));\n\tif (s) return s;\n\tif (sig((b - a).dot(c - a)) < 0) return -2; // c-a-b\n\tif (sig((a - b).dot(c - b)) < 0) return +2; // a-b-c\n\treturn 0;\n}\nbool iSS(Pt a, Pt b, Pt c, Pt d) {\n\treturn (iSP(a, b, c) * iSP(a, b, d) <= 0 && iSP(c, d, a) * iSP(c, d, b) <= 0);\n}\nint g[110][110];\nPt p[110][3];\nint UF[110];\nint v[110];\nint FIND(int a){\n\tif(UF[a]<0)return a;\n\treturn UF[a]=FIND(UF[a]);\n}\nvoid UNION(int a,int b){\n\ta=FIND(a);b=FIND(b);if(a==b)return;UF[a]+=UF[b];UF[b]=a;\n}\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++)UF[i]=-1;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++)g[i][j]=0;\n\t\tfor(int i=0;i<a;i++)g[i][i]=1;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tdouble ax,bx,cx,ay,by,cy;\n\t\t\tscanf(\"%lf%lf%lf%lf%lf%lf\",&ax,&ay,&bx,&by,&cx,&cy);\n\t\t\tdouble A=(bx-cx)*(bx-cx)+(by-cy)*(by-cy);\n\t\t\tdouble B=(ax-cx)*(ax-cx)+(ay-cy)*(ay-cy);\n\t\t\tdouble C=(ax-bx)*(ax-bx)+(ay-by)*(ay-by);\n\t\t\tif(ABS(A-B)<EPS){\n\t\t\t\tp[i][0]=Pt(ax,ay);p[i][1]=Pt(bx,by);p[i][2]=Pt(cx,cy);\n\t\t\t}\n\t\t\tif(ABS(B-C)<EPS){\n\t\t\t\tp[i][2]=Pt(ax,ay);p[i][0]=Pt(bx,by);p[i][1]=Pt(cx,cy);\n\t\t\t}\n\t\t\tif(ABS(C-A)<EPS){\n\t\t\t\tp[i][1]=Pt(ax,ay);p[i][2]=Pt(bx,by);p[i][0]=Pt(cx,cy);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a;i++)if(iSP(p[i][0],p[i][2],p[i][1])==-1)swap(p[i][0],p[i][1]);\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++){\n\t\t\tif(i==j)continue;\n\t\t\tPt t[4];\n\t\t\tt[0]=p[i][0];\n\t\t\tt[1]=p[i][1];\n\t\t\tt[3]=(t[1]-t[0])*Pt(0,-1);\n\t\t\tt[3]=t[0]+t[3]/t[3].ABS()*(double)b;\n\t\t\tt[2]=(t[1]-t[0])*Pt(0,-1);\n\t\t\tt[2]=t[1]+t[2]/t[2].ABS()*(double)b;\n\t\t\n\t\t\tbool ok=false;\n\t\t\tfor(int k=0;k<3;k++){\n\t\t\t\tbool L=false;\n\t\t\t\tbool R=false;\n\t\t\t\tfor(int l=0;l<4;l++){\n\t\t\t\t\tif(iSS(t[l],t[(l+1)%4],p[j][k],p[j][k]+(p[j][(k+1)%3]-p[j][k])*1000000.0))L=true;\n\t\t\t\t\tif(iSS(t[l],t[(l+1)%4],p[j][(k+1)%3],p[j][(k+1)%3]+(p[j][k]-p[j][(k+1)%3])*1000000.0))R=true;\n\t\t\t\t\tif(iSS(t[l],t[(l+1)%4],p[j][k],p[j][(k+1)%3]))ok=true;\n\t\t\t\t}\n\t\t\t\tif(L&&R)ok=true;\n\t\t\t}\n\t\t\tfor(int l=0;l<4;l++){\n\t\t\t\tbool L=false;\n\t\t\t\tbool R=false;\n\t\t\t\tfor(int k=0;k<3;k++){\n\t\t\t\t\tif(iSS(t[l],t[l]+(t[(l+1)%4]-t[l])*1000000.0,p[j][k],p[j][(k+1)%3]))L=true;\n\t\t\t\t\tif(iSS(t[(l+1)%4],t[(l+1)%4]+(t[l]-t[(l+1)%4])*1000000.0,p[j][k],p[j][(k+1)%3]))R=true;\n\t\t\t\t}\n\t\t\t\tif(L&&R)ok=true;\n\t\t\t}\n\t\t\t\n\t\t\tif(ok){\n\t\t\t\tg[i][j]=1;\n\t\t\t}\n\t\t}\n\t\tfor(int k=0;k<a;k++)for(int i=0;i<a;i++)for(int j=0;j<a;j++)\n\t\t\tg[i][j]|=g[i][k]&g[k][j];\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++)if(g[i][j]&&g[j][i])UNION(i,j);\n\t\tint ret=0;\n\t\tfor(int i=0;i<a;i++)v[i]=0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tbool ok=true;\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(FIND(i)!=FIND(j)&&g[j][i])ok=false;\n\t\t\t}\n\t\t\tif(ok&&!v[FIND(i)]){\n\t\t\t\tret++;v[FIND(i)]=1;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1116,
"score_of_the_acc": -0.3131,
"final_rank": 4
},
{
"submission_id": "aoj_0237_1037210",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<functional>\n#include<cfloat>\n#include<tuple>\n#include<set>\n#include<stack>\n#include<algorithm>\n\nconst double INF = DBL_MAX / 3.0;\n\nconst double EPS = 1e-10;\nenum POSITION {ONLINE_FRONT = -2, CLOCKWISE, ON_SEGMENT, COUNTER_CLOCKWISE, ONLINE_BACK};\n// class\nclass Point;\nclass Segment;\nclass Line;\nclass Polygon;\n// member\nclass Point {\ndouble x_value, y_value;\npublic:\nPoint() :x_value(0.0), y_value(0.0) {}\nPoint(double d) :x_value(d), y_value(d) {}\nPoint(double a, double b) :x_value(a), y_value(b) {}\ndouble x() const {return x_value;}\ndouble y() const {return y_value;}\ndouble x(double d) {return x_value = d;}\ndouble y(double d) {return y_value = d;}\nconst Point operator-() const;\nconst Point& operator=(const Point&);\nconst Point& operator+=(const Point&);\nconst Point& operator-=(const Point&);\nconst Point& operator*=(const Point&);\nconst Point& operator/=(const Point&);\ndouble dot(const Point&) const;\ndouble cross(const Point&) const;\ndouble abs() const;\ndouble norm() const;\nconst Point normalize() const;\ndouble distance(const Point&) const;\ndouble distance(const Segment&) const;\ndouble distance(const Line&) const;\nbool intersect(const Point&) const;\nbool intersect(const Segment&) const;\nbool intersect(const Line&) const;\nconst Point projection(const Line&) const;\nconst Point reflection(const Line&) const;\nPOSITION ccw(const Point&, const Point&) const;\n};\nbool operator==(const Point& lhs, const Point& rhs);\nbool operator!=(const Point& lhs, const Point& rhs);\nbool operator<(const Point& lhs, const Point& rhs);\nbool operator>(const Point& lhs, const Point& rhs);\nbool operator<=(const Point& lhs, const Point& rhs);\nbool operator>=(const Point& lhs, const Point& rhs);\nconst Point operator+(const Point& lhs, const Point& rhs);\nconst Point operator-(const Point& lhs, const Point& rhs);\nconst Point operator*(const Point& lhs, const Point& rhs);\nconst Point operator/(const Point& lhs, const Point& rhs);\nclass Segment {\nPoint source_point, target_point;\npublic:\nSegment(double x1 = 0.0, double y1 = 0.0, double x2 = 0.0, double y2 = 0.0) :source_point(Point(x1, y1)), target_point(Point(x2, y2)) {}\nSegment(const Point& a, const Point& b) :source_point(a), target_point(b) {}\nconst Point& source() const {return source_point;}\nconst Point& target() const {return target_point;}\nconst Point& source(const Point& p) {return source_point = p;}\nconst Point& target(const Point& p) {return target_point = p;}\nconst Line line() const;\ndouble distance(const Point&) const;\ndouble distance(const Segment&) const;\ndouble distance(const Line&) const;\nbool intersect(const Point&) const;\nbool intersect(const Segment&) const;\nbool intersect(const Line&) const;\nPOSITION ccw(const Point&) const;\n};\nclass Line {\nPoint source_point, target_point;\npublic:\nLine(double x1 = 0.0, double y1 = 0.0, double x2 = 0.0, double y2 = 0.0) :source_point(Point(x1, y1)), target_point(Point(x2, y2)) {}\nLine(const Point& a, const Point& b) :source_point(a), target_point(b) {}\nconst Point& source() const {return source_point;}\nconst Point& target() const {return target_point;}\nconst Point& source(const Point& p) {return source_point = p;}\nconst Point& target(const Point& p) {return target_point = p;}\nconst Segment segment() const;\ndouble distance(const Point&) const;\ndouble distance(const Segment&) const;\ndouble distance(const Line&) const;\nbool intersect(const Point&) const;\nbool intersect(const Segment&) const;\nbool intersect(const Line&) const;\nconst Point projection(const Point&) const;\nconst Point reflection(const Point&) const;\nconst Point crosspoint(const Line&) const;\nPOSITION ccw(const Point&) const;\n};\nclass Polygon {\nstd::vector<Point> point;\npublic:\nPolygon() {}\nexplicit Polygon(std::vector<Point> p) :point(p) {}\nconst std::vector<Point>& vertex() const {return point;}\nconst Point& vertex(int i) const {return point.at(i);}\nconst std::vector<Segment> edge() const {\nstd::vector<Segment> result;\nfor(int i = 0; i < size(); ++i) result.push_back(Segment(vertex(i), vertex((i + 1) % size())));\nreturn result;\n}\nconst Segment edge(int i) const {return Segment(vertex(i), vertex((i + 1) % size()));}\nint size() const {return point.size();}\nvoid add(const Point&);\ndouble area() const;\nbool convex() const;\nbool include(const Point&) const;\nbool intersect(const Polygon&) const;\nbool on_edge(const Point&) const;\nconst Polygon convex_hull() const;\n};\n// Point\nbool operator==(const Point& lhs, const Point& rhs) {return lhs.x() == rhs.x() && lhs.y() == rhs.y();}\nbool operator!=(const Point& lhs, const Point& rhs) {return lhs.x() != rhs.x() || lhs.y() != rhs.y();}\nbool operator<(const Point& lhs, const Point& rhs) {return lhs.x() != rhs.x() ? lhs.x() < rhs.x() : lhs.y() < rhs.y();}\nbool operator>(const Point& lhs, const Point& rhs) {return lhs.x() != rhs.x() ? lhs.x() > rhs.x() : lhs.y() > rhs.y();}\nbool operator<=(const Point& lhs, const Point& rhs) {return lhs.x() != rhs.x() ? lhs.x() < rhs.x() : lhs.y() <= rhs.y();}\nbool operator>=(const Point& lhs, const Point& rhs) {return lhs.x() != rhs.x() ? lhs.x() > rhs.x() : lhs.y() >= rhs.y();}\nconst Point operator+(const Point& lhs, const Point& rhs) {return Point(lhs.x() + rhs.x(), lhs.y() + rhs.y());}\nconst Point operator-(const Point& lhs, const Point& rhs) {return Point(lhs.x() - rhs.x(), lhs.y() - rhs.y());}\nconst Point operator*(const Point& lhs, const Point& rhs) {return Point(lhs.x() * rhs.x(), lhs.y() * rhs.y());}\nconst Point operator/(const Point& lhs, const Point& rhs) {return Point(lhs.x() / rhs.x(), lhs.y() / rhs.y());}\nconst Point Point::operator-() const {return Point(-x(), -y());}\nconst Point& Point::operator=(const Point& p) {x(p.x()); y(p.y()); return *this;}\nconst Point& Point::operator+=(const Point& p) {return *this = *this + p;}\nconst Point& Point::operator-=(const Point& p) {return *this = *this - p;}\nconst Point& Point::operator*=(const Point& p) {return *this = *this * p;}\nconst Point& Point::operator/=(const Point& p) {return *this = *this / p;}\ndouble Point::dot(const Point& p) const {return x() * p.x() + y() * p.y();}\ndouble Point::cross(const Point& p) const {return x() * p.y() - y() * p.x();}\ndouble Point::abs() const {return hypot(x(), y());}\ndouble Point::norm() const {return x() * x() + y() * y();}\nconst Point Point::normalize() const {return abs() == 0.0 ? Point(0.0, 0.0) : Point(x(), y()) / abs();}\ndouble Point::distance(const Point& p) const {return (p - (*this)).abs();}\ndouble Point::distance(const Segment& s) const {return s.distance(*this);}\ndouble Point::distance(const Line& l) const {return l.distance(*this);}\nbool Point::intersect(const Point& p) const {return *this == p;}\nbool Point::intersect(const Segment& s) const {return s.intersect(*this);}\nbool Point::intersect(const Line& l) const {return l.intersect(*this);}\nconst Point Point::projection(const Line& l) const {return l.projection(*this);}\nconst Point Point::reflection(const Line& l) const {return l.reflection(*this);}\nPOSITION Point::ccw(const Point& b, const Point& p) const {\nconst Point& a = *this;\nPoint v1 = b - a;\nPoint v2 = p - a;\nif(v1.cross(v2) > EPS) return COUNTER_CLOCKWISE;\nif(v1.cross(v2) < -EPS) return CLOCKWISE;\nif(v1.dot(v2) < -EPS) return ONLINE_BACK;\nif(v2.norm() - v1.norm() > EPS) return ONLINE_FRONT;\nreturn ON_SEGMENT;\n}\n// Segment\nconst Line Segment::line() const {return Line(source(), target());}\ndouble Segment::distance(const Point& p) const {\nPoint q = line().projection(p);\nif(intersect(q)) return q.distance(p);\nreturn std::min(source().distance(p), target().distance(p));\n}\ndouble Segment::distance(const Segment& s) const {\nif(intersect(s)) return 0.0;\ndouble a = distance(s.source());\ndouble b = distance(s.target());\ndouble c = s.distance(source());\ndouble d = s.distance(target());\nreturn std::min({a, b, c, d});\n}\ndouble Segment::distance(const Line& l) const {return l.distance(*this);}\nbool Segment::intersect(const Point& p) const {return source().distance(p) + target().distance(p) - target().distance(source()) <= EPS;}\nbool Segment::intersect(const Segment& s) const {\nbool a = ccw(s.source()) * ccw(s.target()) <= 0;\nbool b = s.ccw(source()) * s.ccw(target()) <= 0;\nreturn a && b;\n}\nbool Segment::intersect(const Line& l) const {return l.intersect(*this);}\nPOSITION Segment::ccw(const Point& p) const {return source().ccw(target(), p);}\n// Line\nconst Segment Line::segment() const {return Segment(source(), target());}\ndouble Line::distance(const Point& p) const {return p.distance(projection(p));}\ndouble Line::distance(const Segment& s) const {\nif(intersect(s)) return 0.0;\ndouble a = distance(s.source());\ndouble b = distance(s.target());\nreturn a < b ? a : b;\n}\ndouble Line::distance(const Line& l) const {return intersect(l) ? 0.0 : distance(l.source());}\nbool Line::intersect(const Point& p) const {\nPoint v1 = source() - p;\nPoint v2 = target() - p;\nreturn fabs(v2.cross(v1)) < EPS;\n}\nbool Line::intersect(const Segment& s) const {\nPoint v1 = target() - source();\nPoint v2 = s.source() - source();\nPoint v3 = s.target() - source();\nreturn v1.cross(v2) * v1.cross(v3) <= EPS;\n}\nbool Line::intersect(const Line& l) const {\nPoint v1 = target() - source();\nPoint v2 = l.target() - l.source();\nPoint v3 = l.source() - source();\nreturn fabs(v1.cross(v2)) > EPS || fabs(v1.cross(v3)) < EPS;\n}\nconst Point Line::projection(const Point& p) const {\nPoint v1 = p - source();\nPoint v2 = source() - target();\nreturn Point(source() + v2 * (v1.dot(v2) / v2.norm()));\n}\nconst Point Line::reflection(const Point& p) const {\nreturn p + (projection(p) - p) * 2.0;\n}\nconst Point Line::crosspoint(const Line& l) const {\nPoint v1 = target() - source();\nPoint v2 = l.target() - l.source();\nPoint v3 = target() - l.source();\ndouble a = v1.cross(v2);\ndouble b = v1.cross(v3);\nif(fabs(a) <= EPS && fabs(b) <= EPS) return l.source();\nreturn l.source() + v2 * (b / a);\n}\nPOSITION Line::ccw(const Point& p) const {return source().ccw(target(), p);}\n// Polygon\nvoid Polygon::add(const Point& p) {point.push_back(p);}\ndouble Polygon::area() const {\ndouble sum = 0.0;\nfor(int i = 0; i < size(); ++i) sum += vertex(i).cross(vertex((i+1) % size()));\nreturn fabs(sum) / 2.0;\n}\nbool Polygon::convex() const {\nPOSITION direction = ONLINE_BACK;\nfor(int i = 1; i < size(); ++i) {\nPOSITION d = vertex(i - 1).ccw(vertex(i), vertex((i + 1) % size()));\nif(d != CLOCKWISE && d != COUNTER_CLOCKWISE) continue;\nif(direction == ONLINE_BACK) direction = d;\nif(direction != d) return false;\n}\nreturn true;\n}\nbool Polygon::include(const Point& p) const {\nbool in = false;\nfor(int i = 0; i < size(); ++i) {\nPoint a = vertex(i) - p;\nPoint b = vertex((i + 1) % size()) - p;\nif(a.y() > b.y()) std::swap(a, b);\nif(a.y() <= 0.0 && 0 < b.y() && a.cross(b) < 0.0) in = !in;\nif(fabs(a.cross(b)) <= EPS && a.dot(b) <= EPS) return true;\n}\nreturn in;\n}\nbool Polygon::intersect(const Polygon& p) const {\nfor(const auto& e1: edge()) for(const auto& e2: p.edge()) if(e1.intersect(e2)) return true;\nreturn false;\n}\nbool Polygon::on_edge(const Point& p) const {\nfor(int i = 0; i < size(); ++i) if(vertex(i).ccw(vertex((i + 1) % size()), p) == ON_SEGMENT) return true;\nreturn false;\n}\nconst Polygon Polygon::convex_hull() const { // Andrew's Monotone Chain\nPolygon result;\nstd::vector<Point> res;\nstd::vector<Point> original = vertex();\nsort(original.begin(), original.end());\noriginal.insert(original.end(), original.rbegin() + 1, original.rend());\nfor(const auto& v: original) {\nwhile(res.size() >= 2 && res[res.size() - 2].ccw(res[res.size() - 1], v) == CLOCKWISE) res.pop_back();\nres.push_back(v);\n}\nres.pop_back();\nfor(const auto& v: res) result.add(v);\nreturn result;\n}\n\n// Edge\nclass Edge {\nint from_value, to_value;\ndouble weight_value;\npublic:\nEdge() {}\nEdge(int f, int t, double w) :from_value(f), to_value(t), weight_value(w) {}\nint from() const {return from_value;}\nint to() const {return to_value;}\ndouble weight() const {return weight_value;}\n};\n\n// Graph\nclass Graph {\nint size_value;\nstd::vector<std::vector<Edge>> edge_value;\n\npublic:\nexplicit Graph(int s) :size_value(s) {edge_value.resize(s);}\n\nint size() const {return size_value;}\nconst std::vector<Edge>& edge(int v) const {return edge_value[v];}\n\nvoid add(const Edge& e);\nvoid add(int from, int to, double weight);\npublic:\nstd::vector<std::vector<int>> Kosaraju() const;\nprivate:\nvoid Kosaraju_dfs_postorder(int from, std::vector<bool>& visited, std::stack<int>& order) const;\nstd::vector<int> Kosaraju_dfs_decompose(const std::vector<std::vector<Edge>>& reverse_edge, int from, std::vector<bool>& visited) const;\n};\n\n// implements\nvoid Graph::add(const Edge& e) {edge_value[e.from()].push_back(e);}\nvoid Graph::add(int from, int to, double weight) {edge_value[from].push_back(Edge(from, to, weight));}\nstd::vector<std::vector<int>> Graph::Kosaraju() const {\nstd::vector<std::vector<int>> result;\nstd::vector<bool> visited(size(), false);\nstd::stack<int> order;\nfor(int v = 0; v < size(); ++v) if(!visited[v]) Kosaraju_dfs_postorder(v, visited, order);\nstd::vector<std::vector<Edge>> reverse_edge(size(), std::vector<Edge>());\nfor(int v = 0; v < size(); ++v) for(const auto& e: edge(v)) reverse_edge[e.to()].push_back(Edge(e.to(), e.from(), e.weight()));\nvisited = std::vector<bool>(size(), false);\nwhile(!order.empty()) {\nint v = order.top();\norder.pop();\nif(visited[v]) continue;\nresult.push_back(Kosaraju_dfs_decompose(reverse_edge, v, visited));\n}\nreturn result;\n}\nvoid Graph::Kosaraju_dfs_postorder(int from, std::vector<bool>& visited, std::stack<int>& order) const {\nvisited[from] = true;\nfor(const auto& e: edge(from)) if(!visited[e.to()]) Kosaraju_dfs_postorder(e.to(), visited, order);\norder.push(from);\n}\nstd::vector<int> Graph::Kosaraju_dfs_decompose(const std::vector<std::vector<Edge>>& reverse_edge, int from, std::vector<bool>& visited) const {\nstd::vector<int> result;\nresult.push_back(from);\nvisited[from] = true;\nfor(const auto& e: reverse_edge[from]) {\nif(visited[e.to()]) continue;\nstd::vector<int> add = Kosaraju_dfs_decompose(reverse_edge, e.to(), visited);\nresult.insert(result.end(), add.begin(), add.end());\n}\nreturn result;\n}\n\nusing namespace std; \nint main() {\nint n, d;\nwhile(cin >> n >> d, n | d) {\nvector<Polygon> triangle(n);\nfor(auto &t: triangle) {\nvector<Point> vertex(3);\nfor(auto &v: vertex) {\ndouble x, y;\ncin >> x >> y;\nv = Point(x, y);\n}\nif(vertex[0].distance(vertex[1]) == vertex[0].distance(vertex[2])) swap(vertex[0], vertex[2]);\nif(vertex[1].distance(vertex[0]) == vertex[1].distance(vertex[2])) swap(vertex[1], vertex[2]);\nfor(const auto &v: vertex) t.add(v);\n}\n\nvector<Polygon> light(n);\nfor(int i = 0; i < triangle.size(); ++i) {\nPoint n = (triangle[i].vertex(1) - triangle[i].vertex(0)).normalize();\nif(triangle[i].vertex(0).ccw(triangle[i].vertex(1), triangle[i].vertex(2)) > 0) n = Point(-n.y(), n.x());\nelse n = Point(n.y(), -n.x());\nlight[i].add(triangle[i].vertex(0));\nlight[i].add(triangle[i].vertex(0) + (n * d));\nlight[i].add(triangle[i].vertex(1) + (n * d));\nlight[i].add(triangle[i].vertex(1));\n}\n\nGraph g(n);\nfor(int i = 0; i < n; ++i) {\nfor(int j = 0; j < n; ++j) {\nif(i == j) continue;\nbool shine = false;\n\n// 辺の交差判定\nfor(const auto &l: light[i].edge())\nfor(const auto &t: triangle[j].edge())\nif(l.intersect(t)) shine = true;\n// 点の包含判定\nfor(const auto &v: light[i].vertex())\nif(triangle[j].include(v)) shine = true;\nfor(const auto &v: triangle[j].vertex())\nif(light[i].include(v)) shine = true;\n// 線分と点の距離が0.01以下\nfor(const auto &l: light[i].edge())\nfor(const auto &t: triangle[j].edge())\nif(l.distance(t) <= 0.01) shine = true;\n\nif(!shine) continue;\ng.add(Edge(i, j, 1));\n}\n}\n\nauto scc = g.Kosaraju();\nvector<int> indegree(scc.size(), 0);\nfor(int i = 0; i < scc.size(); ++i) {\nfor(int j = i + 1; j < scc.size(); ++j) {\nfor(const auto& v: scc[i]) for(const auto& e: g.edge(v)){\nif(find(scc[j].begin(), scc[j].end(), e.to()) != scc[j].end()) ++indegree[j];\n}\n}\n}\ncout << count(indegree.begin(), indegree.end(), 0) << endl;\n}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 1320,
"score_of_the_acc": -0.9088,
"final_rank": 18
},
{
"submission_id": "aoj_0237_659072",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < (int)n; i++)\n#define EPS 0.01\n#define equals(a, b) (fabs((a) - (b)) <= EPS )\n#define dle(a, b) (equals(a, b) || a < b )\n\n#define MAX 100\n\nclass Point{\n public:\n double x, y;\n Point ( double x = 0, double y = 0): x(x), y(y){}\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 bool operator < ( const Point &p ) const {\n\treturn x != p.x ? x < p.x : y < p.y;\n }\n bool operator == ( const Point &p ) const {\n\treturn fabs(x-p.x) <= EPS && fabs(y-p.y) <= EPS;\n }\n double abs() { return sqrt(norm());}\n double norm() { return x*x + y*y; }\n};\ntypedef Point Vector;\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)); }\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; }\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}\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 isInside(Polygon gon, Point p ){\n for ( int i = 0; i < gon.size(); i++ ){\n\tif ( ccw(gon[i], gon[(i+1)%gon.size()], p) == CLOCKWISE ) return false;\n }\n return true;\n}\n\nclass Triangle{\n public:\n vector<Point> P;\n Triangle(){ P.resize(3);}\n void normalize(){\n\tvector<Point> tmp(3);\n\tif ( equals(norm(P[0]-P[1]), norm(P[0]-P[2])) ){\n\t tmp[0] = P[1]; tmp[1] = P[2]; tmp[2] = P[0];\n\t} else if ( equals(norm(P[1]-P[0]), norm(P[1]-P[2])) ){\n\t tmp[0] = P[0]; tmp[1] = P[2]; tmp[2] = P[1];\n\t} else if ( equals(norm(P[2]-P[0]), norm(P[2]-P[1])) ){\n\t tmp[0] = P[0]; tmp[1] = P[1]; tmp[2] = P[2];\n\t}\n\tP = tmp;\n\tif ( ccw(P[0], P[1], P[2]) != COUNTER_CLOCKWISE ) swap(P[0], P[1]);\n }\n\n double getArea(){\n\tdouble a = abs(P[0]-P[1]); \n\tdouble b = abs(P[0]-P[2]); \n\tdouble c = abs(P[2]-P[1]); \n\tdouble s= (a + b + c)/2.0;\n\treturn sqrt(s*(s-a)*(s-b)*(s-c));\n }\n};\n\nclass Graph{\npublic:\n int n;\n vector<vector<int> > adj;\n Graph(int n = 0):n(n){\n\tadj.resize(n);\n\trep(i, n) adj[i].clear();\n }\n void connect(int i, int j){ adj[i].push_back(j); }\n void transpose(){\n\tvector<vector<int> > nadj;\n\tnadj.resize(n);\n\trep(i, n) nadj[i].clear();\n\trep(i, n) rep(j, adj[i].size())\tnadj[adj[i][j]].push_back(i);\n\trep(i, n) adj[i] = nadj[i];\n }\n};\n\nint n;\ndouble d;\nTriangle T[MAX];\n\nGraph g;\nint visited[MAX], finish[MAX], t;\nvector<int> com;\n\nbool overlapPolygon(Polygon p1, Polygon p2){\n rep(i, p1.size()) if ( isInside(p2, p1[i]) ) return true;\n rep(i, p2.size()) if ( isInside(p1, p2[i]) ) return true;\n rep(i, p1.size()) rep(j, p2.size()){\n if ( isIntersect(p1[i], p1[(i+1)%p1.size()], p2[j], p2[(j+1)%p2.size()])) return true;\n }\n return false;\n}\n\nbool overlap( int t1, int t2){\n Triangle s = T[t1];\n vector<Point> rect, tri;\n Point c = Point((s.P[0].x+s.P[1].x)/2, (s.P[0].y+s.P[1].y)/2);\n Vector v = s.P[2] - c;\n double a = v.abs();\n v.x = d*v.x/a;\n v.y = d*v.y/a;\n Point l = s.P[0] + v;\n Point r = s.P[1] + v;\n rect.push_back(s.P[1]);\n rect.push_back(r);\n rect.push_back(l);\n rect.push_back(s.P[0]);\n tri = T[t2].P;\n return overlapPolygon(rect, tri);\n}\n\nvoid dfs(int &u){\n visited[u] = t++;\n rep(i, g.adj[u].size()){\n\tint v = g.adj[u][i];\n\tif ( visited[v] == -1 ) dfs(v);\n }\n finish[u] = t++;\n}\n\nvoid dfsT(int &u){\n com.push_back(u);\n visited[u] = 1;\n rep(i, g.adj[u].size()){\n\tint v = g.adj[u][i];\n\tif ( visited[v] == 0 ) dfsT(v);\n }\n}\n\nvoid makeGraph(){\n g = Graph(n);\n rep(i, n) rep(j, n)\n\tif ( i != j && overlap(i, j) )\n\t g.connect(i, j);\n}\n\nint scc(){\n int id[MAX];\n bool indeg[MAX];\n\n rep(i, n) visited[i] = finish[i] = -1;\n t = 0;\n rep(i, n) if ( visited[i] == -1 ) dfs(i);\n\n g.transpose();\n \n vector<pair<int, int> > order;\n rep(i, n) order.push_back(make_pair(finish[i], i));\n sort(order.begin(), order.end());\n \n rep(i, n) visited[i] = 0;\n \n int ncom = 0;\n \n for ( int i = n-1; i >= 0; i-- ){\n\tint u = order[i].second;\n\tcom.clear();\n\tif ( visited[u] == 0 ) {\n\t dfsT(u);\n\t rep(c, com.size()) id[com[c]] = ncom;\n\t ncom++;\n\t}\n }\n \n int cnt = 0;\n g.transpose();\n\n rep(i, ncom) indeg[i] = false;\n \n rep(u, n) rep(i, g.adj[u].size()){\n\tint v = g.adj[u][i];\n\tif ( id[v] != id[u] ) indeg[id[v]] = true;\n }\n rep(i, ncom) if (!indeg[i]) cnt++;\n \n return cnt;\n}\n\nmain(){\n while( cin >> n >> d && n ){\n\trep(i, n){\n\t Triangle t;\n\t rep(j, 3) cin >> t.P[j].x >> t.P[j].y;\n\t t.normalize();\n\t T[i] = t;\n\t}\n\tdouble a = T[0].getArea();\n\n\tfor ( int i = 0; i < n-1; i++ ){\n\t for ( int j = i+1; j < n; j++ ){\n\t\trep(a, 3) rep(b, 3){\n\t\t Point p1 = T[i].P[a];\n\t\t Point p2 = T[i].P[(a+1)%3];\n\t\t Point p3 = T[j].P[b];\n\t\t Point p4 = T[j].P[(b+1)%3];\n\t\t}\n\t }\n\t}\n\n\tmakeGraph();\n\tcout << scc() << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1284,
"score_of_the_acc": -0.3603,
"final_rank": 8
},
{
"submission_id": "aoj_0237_608702",
"code_snippet": "#include<cstdio>\n#include<vector>\n#include<complex>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,a) for(int i=0;i<a;i++)\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define pb push_back\n#define fs first\n#define sc second\nusing namespace std;\n\ntypedef double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\ntypedef vector<P> Poly;\n\nconst D EPS = 1e-8;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\n }\n}\n\nvector<int> g[110];\nvector<int> rg[110];\nvector<int> vs;\nbool use[110];\nint ord[110];\nint n,d;\nPoly tri[110];\nPoly rect[110];\n\ninline P unit(P p){return p/abs(p);}\ninline D dot(P x,P y){return real(conj(x)*y);}\ninline D cross(P x,P y){return imag(conj(x)*y);}\n\ninline vector<P> convex_hull(vector<P> v){\n int n = v.size(), k = 0;\n sort(v.begin(),v.end());\n vector<P> r(2*n);\n for(int i=0;i<n;i++){\n while(k>1 && cross(r[k-1]-r[k-2],v[i]-r[k-1]) <= EPS)k--;\n r[k++] = v[i];\n }\n for(int i=n-2,t=k;i>=0;i--){\n while(k>t && cross(r[k-1]-r[k-2],v[i]-r[k-1]) <= EPS)k--;\n r[k++] = v[i];\n }\n r.resize(k-1);\n return r;\n}\n\ninline int 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(abs(b)<abs(c))return -2;\n return 0;\n}\n\ninline bool is_cp(L a,L b){\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\n return false;\n}\n\ninline bool inter_pos(Poly &p,P &x){\n int s = p.size();\n if(!s)return false;\n rep(i,s)if(ccw(p[i],p[(i+1)%s],x)==-1)return false;\n return true;\n}\n\ninline bool cross_poly(Poly &a, Poly &b){\n int n1 = a.size(), n2 = b.size();\n rep(i,n2)if(inter_pos(a,b[i]))return true;\n rep(i,n1)if(inter_pos(b,a[i]))return true;\n rep(i,n1)rep(j,n2)\n if(is_cp(L(a[i],a[(i+1)%n1]),L(b[j],b[(j+1)%n2])))return true;\n return false;\n}\n\nvoid fdfs(int v){\n use[v] = true;\n for(int i=0;i<g[v].size();i++){\n if(!use[g[v][i]])fdfs(g[v][i]);\n }\n vs.pb(v);\n}\n\nvoid rdfs(int v,int k){\n use[v] = true;\n ord[v] = k;\n for(int i=0;i<rg[v].size();i++){\n if(!use[rg[v][i]])rdfs(rg[v][i],k);\n }\n}\n\ninline int scc(){\n memset(use,0,sizeof(use));\n vs.clear();\n for(int i=0;i<n;i++){\n if(!use[i])fdfs(i);\n }\n\n memset(use,0,sizeof(use));\n int k = 0;\n for(int i=vs.size()-1;i>=0;i--){\n if(!use[vs[i]])rdfs(vs[i],k++);\n }\n return k;\n}\n\nint main(){\n while(scanf(\"%d%d\",&n,&d), n+d){\n rep(i,n){\n tri[i].resize(3);\n scanf(\"%lf%lf\",&tri[i][0].real(),&tri[i][0].imag());\n scanf(\"%lf%lf\",&tri[i][1].real(),&tri[i][1].imag());\n scanf(\"%lf%lf\",&tri[i][2].real(),&tri[i][2].imag());\n tri[i] = convex_hull(tri[i]);\n\n rect[i].clear();\n rep(j,3){\n\tint n1 = (j+1)%3, n2 = (j+2)%3;\n\tif(EQ(abs(tri[i][n1]-tri[i][j]),abs(tri[i][n2]-tri[i][j]))){\n\t rect[i].pb(tri[i][n1]); rect[i].pb(tri[i][n2]); break;\n\t}\n }\n\n P ver = (D)d*unit((rect[i][0]-rect[i][1])*P(0,-1));\n rect[i].pb(ver+rect[i][1]); rect[i].pb(ver+rect[i][0]);\n rect[i] = convex_hull(rect[i]);\n }\n\n rep(i,n){g[i].clear(); rg[i].clear();}\n rep(i,n){\n rep(j,n){\n\tif(i==j)continue;\n\tif(cross_poly(rect[i],tri[j])){g[i].pb(j); rg[j].pb(i);}\n }\n }\n\n\n int cmp = scc();\n\n int in[110] = {0};\n rep(i,n){\n rep(j,g[i].size())if(ord[g[i][j]] != ord[i])in[ord[g[i][j]]]++;\n }\n \n int res = 0;\n rep(i,cmp)if(!in[i])res++;\n printf(\"%d\\n\",res);\n \n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1148,
"score_of_the_acc": -0.3221,
"final_rank": 5
},
{
"submission_id": "aoj_0237_608699",
"code_snippet": "#include<cstdio>\n#include<vector>\n#include<complex>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,a) for(int i=0;i<a;i++)\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define pb push_back\n#define fs first\n#define sc second\nusing namespace std;\n\ntypedef double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\ntypedef vector<P> Poly;\n\nconst D EPS = 1e-8;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\n }\n}\n\nvector<int> g[110];\nvector<int> rg[110];\nvector<int> vs;\nbool use[110];\nint ord[110];\nint n,d;\nPoly tri[110];\nPoly rect[110];\n\nP unit(P p){return p/abs(p);}\nD dot(P x,P y){return real(conj(x)*y);}\nD cross(P x,P y){return imag(conj(x)*y);}\n\nvector<P> convex_hull(vector<P> v){\n int n = v.size(), k = 0;\n sort(v.begin(),v.end());\n vector<P> r(2*n);\n for(int i=0;i<n;i++){\n while(k>1 && cross(r[k-1]-r[k-2],v[i]-r[k-1]) <= EPS)k--;\n r[k++] = v[i];\n }\n for(int i=n-2,t=k;i>=0;i--){\n while(k>t && cross(r[k-1]-r[k-2],v[i]-r[k-1]) <= EPS)k--;\n r[k++] = v[i];\n }\n r.resize(k-1);\n return r;\n}\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(abs(b)<abs(c))return -2;\n return 0;\n}\n\nbool is_cp(L a,L b){\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\n return false;\n}\n\nbool inter_pos(Poly &p,P &x){\n int s = p.size();\n if(!s)return false;\n rep(i,s)if(ccw(p[i],p[(i+1)%s],x)==-1)return false;\n return true;\n}\n\nbool cross_poly(Poly &a, Poly &b){\n int n1 = a.size(), n2 = b.size();\n rep(i,n2)if(inter_pos(a,b[i]))return true;\n rep(i,n1)if(inter_pos(b,a[i]))return true;\n rep(i,n1)rep(j,n2)\n if(is_cp(L(a[i],a[(i+1)%n1]),L(b[j],b[(j+1)%n2])))return true;\n return false;\n}\n\nvoid fdfs(int v){\n use[v] = true;\n for(int i=0;i<g[v].size();i++){\n if(!use[g[v][i]])fdfs(g[v][i]);\n }\n vs.pb(v);\n}\n\nvoid rdfs(int v,int k){\n use[v] = true;\n ord[v] = k;\n for(int i=0;i<rg[v].size();i++){\n if(!use[rg[v][i]])rdfs(rg[v][i],k);\n }\n}\n\nint scc(){\n memset(use,0,sizeof(use));\n vs.clear();\n for(int i=0;i<n;i++){\n if(!use[i])fdfs(i);\n }\n\n memset(use,0,sizeof(use));\n int k = 0;\n for(int i=vs.size()-1;i>=0;i--){\n if(!use[vs[i]])rdfs(vs[i],k++);\n }\n return k;\n}\n\nint main(){\n while(scanf(\"%d%d\",&n,&d), n+d){\n rep(i,n){\n tri[i].resize(3);\n scanf(\"%lf%lf\",&tri[i][0].real(),&tri[i][0].imag());\n scanf(\"%lf%lf\",&tri[i][1].real(),&tri[i][1].imag());\n scanf(\"%lf%lf\",&tri[i][2].real(),&tri[i][2].imag());\n tri[i] = convex_hull(tri[i]);\n\n rect[i].clear();\n rep(j,3){\n\tint n1 = (j+1)%3, n2 = (j+2)%3;\n\tif(EQ(abs(tri[i][n1]-tri[i][j]),abs(tri[i][n2]-tri[i][j]))){\n\t rect[i].pb(tri[i][n1]); rect[i].pb(tri[i][n2]); break;\n\t}\n }\n\n P ver = (D)d*unit((rect[i][0]-rect[i][1])*P(0,-1));\n rect[i].pb(ver+rect[i][1]); rect[i].pb(ver+rect[i][0]);\n rect[i] = convex_hull(rect[i]);\n }\n\n rep(i,n){g[i].clear(); rg[i].clear();}\n rep(i,n){\n rep(j,n){\n\tif(i==j)continue;\n\tif(cross_poly(rect[i],tri[j])){g[i].pb(j); rg[j].pb(i);}\n }\n }\n\n\n int cmp = scc();\n\n int in[110] = {0};\n rep(i,n){\n rep(j,g[i].size())if(ord[g[i][j]] != ord[i])in[ord[g[i][j]]]++;\n }\n \n int res = 0;\n rep(i,cmp)if(!in[i])res++;\n printf(\"%d\\n\",res);\n \n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1148,
"score_of_the_acc": -0.3221,
"final_rank": 5
},
{
"submission_id": "aoj_0237_608691",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<complex>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,a) for(int i=0;i<a;i++)\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define pb push_back\n#define fs first\n#define sc second\nusing namespace std;\n\ntypedef double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\ntypedef vector<P> Poly;\n\nconst D EPS = 1e-8;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\n }\n}\n\nvector<int> g[110];\nvector<int> rg[110];\nvector<int> vs;\nbool use[110];\nint ord[110];\nint n,d;\nPoly tri[110];\nPoly rect[110];\n\nP unit(P p){return p/abs(p);}\npair<P,P> norm(P p){return make_pair(p*P(0,1),p*P(0,-1));}\n\nD dot(P x,P y){return real(conj(x)*y);}\nD cross(P x,P y){return imag(conj(x)*y);}\n\nvector<P> convex_hull(vector<P> v){\n int n = v.size(), k = 0;\n sort(v.begin(),v.end());\n vector<P> r(2*n);\n for(int i=0;i<n;i++){\n while(k>1 && cross(r[k-1]-r[k-2],v[i]-r[k-1]) <= EPS)k--;\n r[k++] = v[i];\n }\n for(int i=n-2,t=k;i>=0;i--){\n while(k>t && cross(r[k-1]-r[k-2],v[i]-r[k-1]) <= EPS)k--;\n r[k++] = v[i];\n }\n r.resize(k-1);\n return r;\n}\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(abs(b)<abs(c))return -2;\n return 0;\n}\n\nbool is_cp(L a,L b){\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\n return false;\n}\n\nbool inter_pos(Poly p,P x){\n int s = p.size();\n if(!s)return false;\n rep(i,s)if(ccw(p[i],p[(i+1)%s],x)==-1)return false;\n return true;\n}\n\nbool cross_poly(Poly a, Poly b){\n int n1 = a.size(), n2 = b.size();\n rep(i,n2)if(inter_pos(a,b[i]))return true;\n rep(i,n1)if(inter_pos(b,a[i]))return true;\n rep(i,n1)rep(j,n2)\n if(is_cp(L(a[i],a[(i+1)%n1]),L(b[j],b[(j+1)%n2])))return true;\n return false;\n}\n\nvoid fdfs(int v){\n use[v] = true;\n for(int i=0;i<g[v].size();i++){\n if(!use[g[v][i]])fdfs(g[v][i]);\n }\n vs.pb(v);\n}\n\nvoid rdfs(int v,int k){\n use[v] = true;\n ord[v] = k;\n for(int i=0;i<rg[v].size();i++){\n if(!use[rg[v][i]])rdfs(rg[v][i],k);\n }\n}\n\nint scc(){\n memset(use,0,sizeof(use));\n vs.clear();\n for(int i=0;i<n;i++){\n if(!use[i])fdfs(i);\n }\n\n memset(use,0,sizeof(use));\n int k = 0;\n for(int i=vs.size()-1;i>=0;i--){\n if(!use[vs[i]])rdfs(vs[i],k++);\n }\n return k;\n}\n\nint main(){\n while(cin >> n >> d, n+d){\n rep(i,n){\n tri[i].resize(3);\n cin >> tri[i][0].real() >> tri[i][0].imag();\n cin >> tri[i][1].real() >> tri[i][1].imag();\n cin >> tri[i][2].real() >> tri[i][2].imag();\n tri[i] = convex_hull(tri[i]);\n\n rect[i].clear();\n rep(j,3){\n\tint n1 = (j+1)%3, n2 = (j+2)%3;\n\tif(EQ(abs(tri[i][n1]-tri[i][j]),abs(tri[i][n2]-tri[i][j]))){\n\t rect[i].pb(tri[i][n1]); rect[i].pb(tri[i][n2]); break;\n\t}\n }\n\n P ver = (D)d*unit(norm(rect[i][0]-rect[i][1]).sc);\n rect[i].pb(ver+rect[i][1]); rect[i].pb(ver+rect[i][0]);\n rect[i] = convex_hull(rect[i]);\n }\n\n rep(i,n){g[i].clear(); rg[i].clear();}\n rep(i,n){\n rep(j,n){\n\tif(i==j)continue;\n\tif(cross_poly(rect[i],tri[j])){g[i].pb(j); rg[j].pb(i);}\n }\n }\n\n\n int cmp = scc();\n\n int in[110] = {0};\n rep(i,n){\n rep(j,g[i].size())if(ord[g[i][j]] != ord[i])in[ord[g[i][j]]]++;\n }\n \n int res = 0;\n rep(i,cmp)if(!in[i])res++;\n cout << res << endl;\n \n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1316,
"score_of_the_acc": -0.3692,
"final_rank": 9
},
{
"submission_id": "aoj_0237_608472",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < (int)n; i++)\n#define EPS (1e-8)\n#define equals(a, b) (fabs((a) - (b)) < EPS )\n#define dle(a, b) (equals(a, b) || a < b )\n#define MAX 100\nclass Point{\npublic:\ndouble x, y;\n Point ( double x = 0, double y = 0):x(x),y(y){}\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\n double abs() { return sqrt(norm());}\n double norm() { return x*x + y*y; }\n bool operator < ( const Point &p ) const {\n return x != p.x ? x < p.x : y < p.y;\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;\ntypedef vector<Point> Polygon;\n\ndouble norm( Vector a ){ return a.x*a.x + a.y*a.y; }\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; }\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 isInside(Polygon gon, Point p ){\n for ( int i = 0; i < gon.size(); i++ ){\n if ( ccw(gon[i], gon[(i+1)%gon.size()], p) == CLOCKWISE ) return false;\n }\n return true;\n}\n\nclass Triangle{\npublic:\n vector<Point> P;\n Triangle(){ P.resize(3);}\n void normalize(){\n vector<Point> tmp(3);\n if ( norm(P[0]-P[1]) == norm(P[0]-P[2]) ){\n tmp[0] = P[1]; tmp[1] = P[2]; tmp[2] = P[0];\n } else if ( norm(P[1]-P[0]) == norm(P[1]-P[2]) ){\n tmp[0] = P[0]; tmp[1] = P[2]; tmp[2] = P[1];\n } else if ( norm(P[2]-P[0]) == norm(P[2]-P[1]) ){\n tmp[0] = P[0]; tmp[1] = P[1]; tmp[2] = P[2];\n }\n P = tmp;\n if ( ccw(P[0], P[1], P[2]) != COUNTER_CLOCKWISE ) {\n swap(P[0], P[1]);\n }\n }\n};\n\nclass Graph{\npublic:\n int n;\n vector<vector<int> > adj;\n Graph(int n = 0):n(n){\n adj.resize(n);\n rep(i, n) adj[i].clear();\n }\n void connect(int i, int j){ adj[i].push_back(j); }\n void transpose(){\n vector<vector<int> > nadj;\n nadj.resize(n);\n rep(i, n) nadj[i].clear();\n rep(i, n) rep(j, adj[i].size()) nadj[adj[i][j]].push_back(i);\n rep(i, n) adj[i] = nadj[i];\n }\n};\n\nint n;\ndouble d;\nTriangle T[MAX];\n\nGraph g;\nint visited[MAX], finish[MAX], t;\nvector<int> com;\n\nbool overlapPolygon(Polygon p1, Polygon p2){\n rep(i, p1.size()) if ( isInside(p2, p1[i]) ) return true;\n rep(i, p2.size()) if ( isInside(p1, p2[i]) ) return true;\n rep(i, p1.size()) rep(j, p2.size()){\n if ( isIntersect(p1[i], p1[(i+1)%p1.size()], p2[j], p2[(j+1)%p2.size()]))\n return true;\n }\n return false;\n}\n\nbool overlap( int t1, int t2){\n Triangle s = T[t1];\n vector<Point> rect, tri;\n Point c = Point((s.P[0].x+s.P[1].x)/2, (s.P[0].y+s.P[1].y)/2);\n Vector v = s.P[2] - c;\n double a = v.abs();\n v.x = d*v.x/a;\n v.y = d*v.y/a;\n Point l = s.P[0] + v;\n Point r = s.P[1] + v;\n rect.push_back(s.P[1]);\n rect.push_back(r);\n rect.push_back(l);\n rect.push_back(s.P[0]);\n tri = T[t2].P;\n return overlapPolygon(rect, tri);\n}\n\nvoid dfs(int &u){\n visited[u] = t++;\n rep(i, g.adj[u].size()){\n int v = g.adj[u][i];\n if ( visited[v] == -1 ) dfs(v);\n }\n finish[u] = t++;\n}\n\nvoid dfsT(int &u){\n com.push_back(u);\n visited[u] = 1;\n rep(i, g.adj[u].size()){\n int v = g.adj[u][i];\n if ( visited[v] == 0 ) dfsT(v);\n }\n}\n\nvoid makeGraph(){\n g = Graph(n);\n rep(i, n) rep(j, n){\n if ( i != j && overlap(i, j) ) {\n g.connect(i, j);\n }\n }\n}\n\nint scc(){\n int id[MAX];\n bool indeg[MAX];\n rep(i, n) visited[i] = finish[i] = -1;\n t = 0;\n rep(i, n) if ( visited[i] == -1 ) dfs(i);\n g.transpose();\n vector<pair<int, int> > order;\n rep(i, n) order.push_back(make_pair(finish[i], i));\n sort(order.begin(), order.end());\n rep(i, n) visited[i] = 0;\n int ncom = 0;\n for ( int i = n-1; i >= 0; i-- ){\n int u = order[i].second;\n com.clear();\n if ( visited[u] == 0 ) {\n dfsT(u);\n rep(c, com.size()) id[com[c]] = ncom;\n ncom++;\n }\n }\n int cnt = 0;\n g.transpose();\n rep(i, ncom) indeg[i] = false;\n rep(u, n) rep(i, g.adj[u].size()){\n int v = g.adj[u][i];\n if ( id[v] != id[u] ) indeg[id[v]] = true;\n }\n rep(i, ncom) if (!indeg[i]) cnt++;\n return cnt;\n}\n\nmain(){\n while( cin >> n >> d && n ){\n rep(i, n){\n Triangle t;\n rep(j, 3) cin >> t.P[j].x >> t.P[j].y;\n t.normalize();\n T[i] = t;\n }\n makeGraph();\n cout << scc() << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1284,
"score_of_the_acc": -0.4372,
"final_rank": 10
},
{
"submission_id": "aoj_0237_548351",
"code_snippet": "#include<iostream>\n#include<sstream>\n#include<vector>\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>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define each(i,c) for(__typeof(c.begin()) i=c.begin();i!=c.end();i++)\n#define pb push_back\n#define mp make_pair\n#define all(c) c.begin(),c.end()\n#define dbg(x) cerr<<__LINE__<<\": \"<<#x<<\" = \"<<(x)<<endl\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pi;\ntypedef long long ll;\nconst int inf=(int)1e9;\nconst double EPS = 1e-9, INF = 1e12, PI = acos(-1.0);\ntypedef complex<double> P;\nnamespace std{\n\tbool operator<(const P& a, const P& b){\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n}\ninline double cross(const P& a, const P& b){ return imag(conj(a)*b); }\ninline double 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};\ntypedef vector<P> G;\ninline int ccw(P a, P b, P c) {\n\tb -= a; c -= a;\n\tif(cross(b, c) > 0) return +1;\t\t// counter clockwise\n\tif(cross(b, c) < 0) return -1;\t\t// clockwise\n\tif(dot(b, c) < 0) return +2;\t\t// c--a--b on line\n\tif(norm(b) < norm(c)) return -2;\t\t// a--b--c on line\n\treturn 0;\n}\nG convex_hull(G ps) {\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n G ch(2*n);\n for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n ch.resize(k-1);\n return ch;\n}\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\ndouble distanceSP(const L &s, const P &p) {\n const P r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nenum { OUT, ON, IN };\nint contains(const G& g, const P& p) {\n bool in = false;\n for (int i = 0; i < g.size(); ++i) {\n P a = curr(g,i) - p, b = next(g,i) - p;\n if (imag(a) > imag(b)) swap(a, b);\n if (imag(a) <= 0 && 0 < imag(b))\n if (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#include<stack>\nvoid visit(const vector<vi> &g, int v, vector<vi>& scc,\n stack<int> &S, vector<bool> &inS,\n vector<int> &low, vector<int> &num, int& time) {\n low[v] = num[v] = ++time;\n S.push(v); inS[v] = true;\n each(e, g[v]) {\n int w = *e;\n if (num[w] == 0) {\n visit(g, w, scc, S, inS, low, num, time);\n low[v] = min(low[v], low[w]);\n } else if (inS[w])\n low[v] = min(low[v], num[w]);\n }\n if (low[v] == num[v]) {\n scc.push_back(vector<int>());\n while (1) {\n int w = S.top(); S.pop(); inS[w] = false;\n scc.back().push_back(w);\n if (v == w) break;\n }\n }\n}\nvoid stronglyConnectedComponents(const vector<vi>& g,\n vector<vi>& scc) {\n const int n = g.size();\n vector<int> num(n), low(n);\n stack<int> S;\n vector<bool> inS(n);\n int time = 0;\n rep(u, n) if (num[u] == 0)\n visit(g, u, scc, S, inS, low, num, time);\n}\n\nint n, d;\nvector<vi> g;\n\nint main(){\n\twhile(cin >> n >> d, n || d){\n\t\tg.clear(); g.resize(n);\n\t\tvector<G> tri;\n\t\trep(i, n){\n\t\t\tint t = -1;\n\t\t\tG p(3);\n\t\t\tdouble l[3];\n\t\t\trep(j, 3) cin >> p[j].real() >> p[j].imag();\n\t\t\trep(j, 3) l[j] = abs(p[j] - p[(j + 1) % 3]);\n\t\t\trep(j, 3) if(abs(l[j] - l[(j + 1) % 3]) < EPS){\n\t\t\t\tt = (j + 1) % 3;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tassert(t >= 0);\n\t\t\tif(t) swap(p[t], p[0]);\n\t\t\ttri.pb(p);\n\t\t}\n\t\t\n\t\trep(i, n){\n\t\t\tG &p = tri[i];\n\t\t\tP dir = p[0] - (p[1] + p[2]) * 0.5;\n\t\t\tdir *= d / abs(dir);\n\t\t\t\n\t\t\tG ps;\n\t\t\tps.pb(p[1]); ps.pb(p[2]);\n\t\t\tps.pb(p[1] + dir); ps.pb(p[2] + dir);\n\t\t\tps = convex_hull(ps);\n\t\t\t\n\t\t\trep(j, n){\n\t\t\t\tbool ok = 0;\n\t\t\t\trep(k, 3){\n\t\t\t\t\trep(l, 4) if(distanceSP(L(ps[l], ps[(l + 1) % 4]), tri[j][k])\n\t\t\t\t\t\t< 0.01) ok = 1;\n\t\t\t\t\tif(contains(ps, tri[j][k]) != OUT) ok = 1;\n\t\t\t\t}\n\t\t\t\tif(ok) g[i].pb(j);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tmap<int, int> to;\n\t\tvector<vi> scc;\n\t\tstronglyConnectedComponents(g, scc);\n\t\tint m = scc.size();\n\t\tvi in(m);\n\t\t\n\t\trep(i, m) rep(j, scc[i].size()){\n\t\t\tto[scc[i][j]] = i;\n\t\t}\n\t\trep(i, n) rep(j, g[i].size()){\n\t\t\tint a = to[i], b = to[g[i][j]];\n\t\t\tif(a != b) in[b]++;\n\t\t}\n\t\trep(i, m) if(in[i] == 0) ans++;\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1316,
"score_of_the_acc": -0.5231,
"final_rank": 14
},
{
"submission_id": "aoj_0237_498208",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <queue>\n#include <set>\n#include <map>\n#include <valarray>\n#include <bitset>\n#include <stack>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\n\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n // if (abs(a-b)<EPS) return 0;\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n L() {}\n};\ntypedef vector<P> G;\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nstruct C {\n P p; double r;\n C(const P &p, double r) : p(p), r(r) { }\n};\n\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0;\n}\n\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSS2(const L &s, const L &t) { // 接しているやつは交差と考えない\n REP(i, 2) {\n if (ccw(s[0], s[1], t[i]) == 0) {\n int c = ccw(s[0],s[1],t[!i]);\n if (s[0] == t[i]) {\n if (c!=-2&&c) return 0;\n } else if (s[1] == t[i]) {\n if (c!=2&&c) return 0;\n } else if (abs(c)==1) return 0;\n }\n }\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\nP reflection(const L &l, const P &p) {\n return p + P(2,0) * (projection(l, p) - p);\n}\ndouble distanceLP(const L &l, const P &p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(const L &l, const L &m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const L &l, const L &s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const L &s, const P &p) {\n const P r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\nbool convex_contain(const G &g, const P &p) { // 半時計回りを仮定\n REP(i,g.size())\n if (ccw(g[i], next(g, i), p) == -1 && distanceSP(L(g[i],next(g,i)), p) > 0.01) return 0;\n return 1;\n}\n\ndouble distanceSS(const L &s, const L &t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n min(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\n\nbool intersectGG(const G &g1, const G &g2) {\n if (convex_contain(g1, g2[0])) return 1;\n if (convex_contain(g2, g1[0])) return 1;\n REP(i,g1.size()) REP(j,g2.size()) {\n if (distanceSS(L(g1[i], next(g1, i)), L(g2[j], next(g2, j))) <= 0.01) return 1;\n }\n return 0;\n}\n\ntypedef int Weight;\nstruct Edge {\n int src, dst;\n Weight weight;\n Edge(int src, int dst, Weight weight) :\n src(src), dst(dst), weight(weight) { }\n};\nbool operator < (const Edge &e, const Edge &f) {\n return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\n e.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n\nvoid visit(const Graph &g, int v, vector< vector<int> >& scc,\n stack<int> &S, vector<bool> &inS,\n vector<int> &low, vector<int> &num, int& time) {\n low[v] = num[v] = ++time;\n S.push(v); inS[v] = true;\n FOR(e, g[v]) {\n int w = e->dst;\n if (num[w] == 0) {\n visit(g, w, scc, S, inS, low, num, time);\n low[v] = min(low[v], low[w]);\n } else if (inS[w])\n low[v] = min(low[v], num[w]);\n }\n if (low[v] == num[v]) {\n scc.push_back(vector<int>());\n while (1) {\n int w = S.top(); S.pop(); inS[w] = false;\n scc.back().push_back(w);\n if (v == w) break;\n }\n }\n}\nvoid stronglyConnectedComponents(const Graph& g,\n vector< vector<int> >& scc) {\n const int n = g.size();\n vector<int> num(n), low(n);\n stack<int> S;\n vector<bool> inS(n);\n int time = 0;\n REP(u, n) if (num[u] == 0)\n visit(g, u, scc, S, inS, low, num, time);\n}\n\n// 強連結成分を縮約する\nGraph edgeContractionAndSort(const Graph &g) {\n int n = g.size();\n vector<vector<int> > scc;\n stronglyConnectedComponents(g, scc);\n int m = scc.size();\n vector<int> cmp(n);\n REP(i,m) FOR(jt, scc[i])\n cmp[*jt] = i;\n map<pii, bool> mp;\n Graph res(m);\n REP(i,n) {\n int a = cmp[i];\n FOR(it,g[i]) {\n int b = cmp[it->dst];\n if (a != b) {\n if (mp.count(pii(a,b)) == 0) {\n mp[pii(a,b)] = 1;\n res[a].push_back(Edge(a,b,1));\n }\n }\n }\n }\n return res;\n}\n\n\nG triangle[100];\nint deg[100];\n\nint main() {\n int n, d;\n while(cin>>n>>d,n||d) {\n REP(i,n) {\n triangle[i].clear();\n REP(j,3) {\n P p; cin >> p.real() >> p.imag();\n triangle[i].push_back(p);\n }\n if (abs(abs(triangle[i][0]-triangle[i][1]) - abs(triangle[i][0]-triangle[i][2])) < EPS) {\n swap(triangle[i][0], triangle[i][2]);\n }\n if (abs(abs(triangle[i][1]-triangle[i][0]) - abs(triangle[i][1]-triangle[i][2])) < EPS) {\n swap(triangle[i][1], triangle[i][2]);\n }\n if (cross(triangle[i][1]-triangle[i][0], triangle[i][2]-triangle[i][0]) < 0) {\n swap(triangle[i][0], triangle[i][1]);\n }\n // REP(j,3) cout << triangle[i][j] << \" \";\n // cout << endl;\n }\n Graph g(n);\n REP(i,n) {\n G rect;\n P p = triangle[i][1] - triangle[i][0];\n p /= abs(p);\n p *= P(0,1);\n p *= d;\n rect.push_back(triangle[i][0]);\n rect.push_back(triangle[i][1]);\n rect.push_back(triangle[i][1] + p);\n rect.push_back(triangle[i][0] + p);\n REP(j,n) {\n if (i == j) continue;\n if (intersectGG(rect, triangle[j])) {\n //cout << i << \" \" << j << endl;\n g[i].push_back(Edge(i,j,0));\n }\n }\n }\n Graph g2 = edgeContractionAndSort(g);\n memset(deg,0,sizeof(deg));\n FOR(it, g2) {\n FOR(e, *it) {\n deg[e->dst]++;\n }\n }\n int ans = 0;\n REP(i,g2.size()) {\n if (deg[i] == 0) ans++;\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 1304,
"score_of_the_acc": -0.8274,
"final_rank": 17
},
{
"submission_id": "aoj_0237_453284",
"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 <cassert>\n#include <memory>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\nusing namespace std;\n\nconst double EPS = 0.01;\n\ntypedef complex<double> P,point;\ntypedef vector<P> G,polygon;\nnamespace std {bool operator < (const P& a, const P& b) {return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);} }\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> {L(const P &a, const P &b) {push_back(a); push_back(b);} };\nint ccw(P a, P b, P c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > 0) return +1;\n\tif (cross(b, c) < 0) return -1;\n\tif (dot(b, c) < 0) return +2;\n\tif (norm(b) < norm(c)) return -2;\n\treturn 0;\n}\n\nbool intersectSS(const L &s, const L &t) {return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 && ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;}\n\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\n\n \ndouble area(vector<P> p){\n\tdouble S = 0 ; \n\tp.push_back(p[0]);\n\t/* 多角形の面積公式 (反時計回りの場合) */\n\tfor(int i = 0 ; i < p.size()-1 ; i++){\n\t\tS += (p[i].real() - p[i+1].real()) * (p[i].imag()+p[i+1].imag());\n\t}\n\tS /= 2.0;\n\treturn S;\n}\nbool contains(vector<P> &a,P b){\n\t//b = (-10000,-10000);\n\tdouble ans = 0;\n\tfor(int i = 0 ; i < a.size() ; i++){\n\t\tvector<P> w;\n\t\tw.push_back(a[i]);\n\t\tw.push_back(a[(i+1)%a.size()]);\n\t\tw.push_back(b);\n\t\tans += abs(area(w));\n\t}\n\tans = abs(ans);\n\t//cout << a[0] << \" \" << a[1] << \" \" << a[2] << \" \" << a[3] << \" \" << b << \" \" << (fabs(abs(area(a)) - ans ) < EPS) << endl;\n\t//cout << ans << \" \" << abs(area(a)) << \" \" << a.size() << endl;\n\treturn fabs(abs(area(a)) - ans ) < EPS;\n}\n\n/*\n\t幾何: \n\t\t・凸多角形の点包含判定\n\t\t・凸多角形同士の線分交差判定\n\tグラフ:\n\t\t・強連結成分分解\n\t\t・入次数数える\n*/\n\nint n;\n\n\nbool eq(double a,double b){\n\treturn fabs(a-b) < EPS;\n}\n\nint wf[100][100]={};\n\nint main(){\n\tdouble d;\n\twhile(cin >> n >> d && n ){\n\t\tmemset(wf,0,sizeof(wf));\n\t\tfor(int i = 0 ; i < n ; i++) \n\t\t\twf[i][i] = 1;\n\t\tvector<G> g(n);\n\t\tvector<G> g2(n);\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tdouble x1,x2,x3,y1,y2,y3;\n\t\t\tcin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;\n\t\t\tg[i].push_back(P(x1,y1));\n\t\t\tg[i].push_back(P(x2,y2));\n\t\t\tg[i].push_back(P(x3,y3));\n\t\t\tdouble A = abs( P(x2,y2) - P(x1,y1) );\n\t\t\tdouble B = abs( P(x2,y2) - P(x3,y3) );\n\t\t\tdouble C = abs( P(x3,y3) - P(x1,y1) );\n\t\t\tL l(P(-1,-1),P(-1,-1));\n\t\t\tif( eq(A,B) ) l = L( P(x3,y3) , P(x1,y1) );\n\t\t\telse if( eq(A,C) ) l = L( P(x2,y2) , P(x3,y3) );\n\t\t\telse if( eq(B,C) ) l = L( P(x2,y2) , P(x1,y1) );\n\t\t\telse while(1){}\n\t\t\t\n\t\t\tassert( !( eq(A,B) && eq(B,C) ) );\n\t\t\tP r = l[1] - l[0];\n\t\t\tr = P(-r.imag(),r.real());\n\t\t\tr /= abs(r);\n\t\t\t\n\t\t\t//cout << A << \" \" << B << \" \" << C << \" \" << l[0] << \"-\" << l[1] << \" \" << r << endl;\n\t\t\tfor(int coef = -1 ; coef <= 1 ; coef += 2 ){\n\t\t\t\tvector<P> XX;\n\t\t\t\tXX.push_back(l[0]);\n\t\t\t\tXX.push_back(l[0] + coef * d * r );\n\t\t\t\tXX.push_back(l[1] + coef * d * r );\t\t\t\n\t\t\t\tXX.push_back(l[1]);\n\t\t\t\tint ok = 1;\n\t\t\t\t\n\t\t\t\tfor(int j = 0 ; j < 3 ; j++){\n\t\t\t\t\tif( !contains(XX,g[i][j]) ){\n\t\t\t\t\t\tok = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif( ok ) {\n\t\t\t\t\tif( g2[i].size() ) assert(0);\n\t\t\t\t\tg2[i] = XX;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\tif( i != j ) {\n\t\t\t\t\tint ok = 0;\n\t\t\t\t\tfor(int l = 0 ; l < 3 ; l++){\n\t\t\t\t\t\tif( contains(g2[i],g[j][l]) ){\n\t\t\t\t\t\t\tok = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor(int k = 0 ; k < 4 ; k++){\n\t\t\t\t\t\tfor(int l = k+1 ; l < 4 ; l++){\n\t\t\t\t\t\t\tfor(int m = 0 ; m < 3 ; m++){\n\t\t\t\t\t\t\t\tfor(int o = m+1 ; o < 3 ; o++){\n\t\t\t\t\t\t\t\t\tif( intersectSS(L(g2[i][k],g2[i][l]),L(g[j][m],g[j][o])) ){\n\t\t\t\t\t\t\t\t\t\tok = 1;\n\t\t\t\t\t\t\t\t\t\t\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}\n\t\t\t\t\tif( ok ) {\n\t\t\t\t\t\twf[i][j] = 1;\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 < n ; i++)\n\t\t\tfor(int j = 0 ; j < n ; j++)\n\t\t\t\tfor(int k = 0 ; k < n ; k++)\n\t\t\t\t\twf[j][k] |= wf[j][i] & wf[i][k];\n\t\n\t\t\n\t\tint in[100] = {} , id[100] = {} , cur = 0;\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tid[i] = -1;\n\t\t\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tif( id[i] == -1 ){\n\t\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\t\tif( wf[i][j] & wf[j][i] ){\n\t\t\t\t\t\tid[j] = cur;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcur++;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\tif(wf[i][j] && id[i] != id[j]) in[id[j]]++;\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor(int i = 0 ; i < cur ; i++){\n\t\t\tif( !in[i] ){\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 1044,
"score_of_the_acc": -1.2929,
"final_rank": 19
},
{
"submission_id": "aoj_0237_323330",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < (int)n; i++)\n//#define EPS (1e-8)\n#define EPS 0.01\n#define equals(a, b) (fabs((a) - (b)) <= EPS )\n#define dle(a, b) (equals(a, b) || a < b )\n\n#define MAX 100\n\nclass Point{\n public:\n double x, y;\n \n Point ( double x = 0, double y = 0): x(x), y(y){}\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\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};\ntypedef Point Vector;\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)); }\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; }\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}\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 isInside(Polygon gon, Point p ){\n for ( int i = 0; i < gon.size(); i++ ){\n\tif ( ccw(gon[i], gon[(i+1)%gon.size()], p) == CLOCKWISE ) return false;\n }\n return true;\n}\n\nclass Triangle{\n public:\n vector<Point> P;\n Triangle(){ P.resize(3);}\n\n void normalize(){\n\tvector<Point> tmp(3);\n\tif ( norm(P[0]-P[1]) == norm(P[0]-P[2]) ){\n\t tmp[0] = P[1]; tmp[1] = P[2]; tmp[2] = P[0];\n\t} else if ( norm(P[1]-P[0]) == norm(P[1]-P[2]) ){\n\t tmp[0] = P[0]; tmp[1] = P[2]; tmp[2] = P[1];\n\t} else if ( norm(P[2]-P[0]) == norm(P[2]-P[1]) ){\n\t tmp[0] = P[0]; tmp[1] = P[1]; tmp[2] = P[2];\n\t}\n\tP = tmp;\n\tif ( ccw(P[0], P[1], P[2]) != COUNTER_CLOCKWISE ) {\n\t swap(P[0], P[1]);\n\t}\n }\n\n double getArea(){\n\tdouble a = abs(P[0]-P[1]); \n\tdouble b = abs(P[0]-P[2]); \n\tdouble c = abs(P[2]-P[1]); \n\tassert(!(a==b && a==c && b==c));\n\tdouble s= (a + b + c)/2.0;\n\treturn sqrt(s*(s-a)*(s-b)*(s-c));\n }\n\n};\n\nclass Graph{\npublic:\n int n;\n vector<vector<int> > adj;\n Graph(int n = 0):n(n){\n\tadj.resize(n);\n\trep(i, n) adj[i].clear();\n }\n void connect(int i, int j){ adj[i].push_back(j); }\n void transpose(){\n\tvector<vector<int> > nadj;\n\tnadj.resize(n);\n\trep(i, n) nadj[i].clear();\n\trep(i, n) rep(j, adj[i].size())\tnadj[adj[i][j]].push_back(i);\n\trep(i, n) adj[i] = nadj[i];\n }\n};\n\nint n;\ndouble d;\nTriangle T[MAX];\n\nGraph g;\nint visited[MAX], finish[MAX], t;\nvector<int> com;\n\nbool overlapPolygon(Polygon p1, Polygon p2){\n rep(i, p1.size()) if ( isInside(p2, p1[i]) ) return true;\n rep(i, p2.size()) if ( isInside(p1, p2[i]) ) return true;\n rep(i, p1.size()) rep(j, p2.size()){\n if ( isIntersect(p1[i], p1[(i+1)%p1.size()], p2[j], p2[(j+1)%p2.size()])) return true;\n }\n return false;\n}\n\nbool overlap( int t1, int t2){\n Triangle s = T[t1];\n vector<Point> rect, tri;\n Point c = Point((s.P[0].x+s.P[1].x)/2, (s.P[0].y+s.P[1].y)/2);\n Vector v = s.P[2] - c;\n double a = v.abs();\n v.x = d*v.x/a;\n v.y = d*v.y/a;\n Point l = s.P[0] + v;\n Point r = s.P[1] + v;\n rect.push_back(s.P[1]);\n rect.push_back(r);\n rect.push_back(l);\n rect.push_back(s.P[0]);\n\n assert( isInside(rect, s.P[0]) &&\n\t isInside(rect, s.P[1]) &&\n\t isInside(rect, s.P[2]));\n\n tri = T[t2].P;\n return overlapPolygon(rect, tri);\n}\n\nvoid dfs(int &u){\n visited[u] = t++;\n rep(i, g.adj[u].size()){\n\tint v = g.adj[u][i];\n\tif ( visited[v] == -1 ) dfs(v);\n }\n finish[u] = t++;\n}\n\nvoid dfsT(int &u){\n com.push_back(u);\n visited[u] = 1;\n rep(i, g.adj[u].size()){\n\tint v = g.adj[u][i];\n\tif ( visited[v] == 0 ) dfsT(v);\n }\n}\n\nvoid makeGraph(){\n g = Graph(n);\n rep(i, n) rep(j, n){\n\tif ( i != j && overlap(i, j) ) {\n\t g.connect(i, j);\n\t}\n }\n}\n\nint scc(){\n int id[MAX];\n bool indeg[MAX];\n\n rep(i, n) visited[i] = finish[i] = -1;\n t = 0;\n rep(i, n) if ( visited[i] == -1 ) dfs(i);\n\n g.transpose();\n \n vector<pair<int, int> > order;\n rep(i, n) order.push_back(make_pair(finish[i], i));\n sort(order.begin(), order.end());\n \n rep(i, n) visited[i] = 0;\n \n int ncom = 0;\n \n for ( int i = n-1; i >= 0; i-- ){\n\tint u = order[i].second;\n\tcom.clear();\n\tif ( visited[u] == 0 ) {\n\t dfsT(u);\n\t rep(c, com.size()) id[com[c]] = ncom;\n\t ncom++;\n\t}\n }\n \n int cnt = 0;\n g.transpose();\n\n rep(i, ncom) indeg[i] = false;\n \n rep(u, n) rep(i, g.adj[u].size()){\n\tint v = g.adj[u][i];\n\tif ( id[v] != id[u] ) indeg[id[v]] = true;\n }\n rep(i, ncom) if (!indeg[i]) cnt++;\n \n return cnt;\n}\n\nmain(){\n while( cin >> n >> d && n ){\n\trep(i, n){\n\t Triangle t;\n\t rep(j, 3) cin >> t.P[j].x >> t.P[j].y;\n\t t.normalize();\n\t T[i] = t;\n\t}\n\tdouble a = T[0].getArea();\n\tfor ( int i = 0; i < n-1; i++ ){\n\t for ( int j = i+1; j < n; j++ ){\n\n\t\tTriangle t1 = T[i];\n\t\tTriangle t2 = T[j];\n\t\tfor ( int a= 0; a < 3; a++ ){\n\t\t for ( int b = 0; b < 3; b++ ){\n\t\t\tPoint p1 = t1.P[a];\n\t\t\tPoint p2 = t1.P[(a+1)%3];\n\t\t\tPoint p3 = t2.P[b];\n\t\t\tPoint p4 = t2.P[(b+1)%3];\n\t\t \n\t\t }\n\n\t\t}\n\n\t }\n\t}\n\n\tmakeGraph();\n\tcout << scc() << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 984,
"score_of_the_acc": -0.353,
"final_rank": 7
},
{
"submission_id": "aoj_0237_279561",
"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\nvoid stronglyConnectedComponents(const vector<vector<int> >& edges1, vector<vector<int> >& nodes, vector<vector<int> >& edges2)\n{\n const int n = edges1.size();\n\n class Func{\n vector<int> num, low;\n vector<bool> isStk;\n stack<int> stk;\n int time;\n public:\n Func(int n){\n num.assign(n, 0);\n low.assign(n, 0);\n isStk.assign(n, false);\n time = 0;\n }\n void visit(const vector<vector<int> >& edges, int v, vector<vector<int> >& nodes){\n if(num[v] != 0)\n return;\n num[v] = low[v] = ++ time;\n stk.push(v);\n isStk[v] = true;\n for(unsigned i=0; i<edges[v].size(); ++i){\n int w = edges[v][i];\n visit(edges, w, nodes);\n if(isStk[w])\n low[v] = min(low[v], low[w]);\n }\n if(low[v] == num[v]){\n nodes.push_back(vector<int>());\n for(;;){\n int w = stk.top();\n stk.pop();\n isStk[w] = false;\n nodes.back().push_back(w);\n if(v == w)\n break;\n }\n }\n }\n }func(n);\n\n for(int i=0; i<n; ++i)\n func.visit(edges1, i, nodes);\n reverse(nodes.begin(), nodes.end()); // DAGÉ·é½ßɽ]³¹é\n\n const int m = nodes.size();\n vector<int> index(n); // ³ÌOtÌe¸_ÌDAGɨ¯é¸_\n for(int i=0; i<m; ++i){\n for(unsigned j=0; j<nodes[i].size(); ++j)\n index[nodes[i][j]] = i;\n }\n edges2.assign(m, vector<int>());\n vector<vector<bool> > check(m, vector<bool>(m, false));\n for(int i=0; i<n; ++i){\n for(unsigned j=0; j<edges1[i].size(); ++j){\n int v = index[i];\n int w = index[edges1[i][j]];\n if(v != w && !check[v][w]){\n edges2[v].push_back(w);\n check[v][w] = true;\n }\n }\n }\n}\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 Point operator+(const Point& p) const{\n return Point(y + p.y, x + p.x);\n }\n Point operator-(const Point& p) const{\n return Point(y - p.y, x - p.x);\n }\n Point operator*(double a) const{\n return Point(y * a, x * a);\n }\n Point operator/(double a) const{\n return Point(y / a, x / a);\n }\n double length() const{\n return sqrt(y * y + x * x);\n }\n double dist(const Point& p) const{\n return sqrt(pow(y - p.y, 2) + pow(x - p.x, 2));\n }\n double dot(const Point& p) const{\n return y * p.y + x * p.x; // |a|*|b|*cosÆ\n }\n double cross(const Point& p) const{\n return x * p.y - y * p.x; // |a|*|b|*sinÆ\n }\n};\n\ndouble segmentPointDist(const Point& a1, const Point& a2, const Point& p)\n{\n if((a2-a1).dot(p-a1) < 0)\n return a1.dist(p);\n else if((a1-a2).dot(p-a2) < 0)\n return a2.dist(p);\n else\n return abs((a2-a1).cross(p-a1)) / a1.dist(a2);\n}\n\ndouble segmentsDist(const Point& a1, const Point& a2, const Point& b1, const Point& b2)\n{\n if(((a2-a1).cross(b1-a1) * (a2-a1).cross(b2-a1) < -EPS) && ((b2-b1).cross(a1-b1) * (b2-b1).cross(a2-b1) < -EPS))\n return 0.0;\n\n double ret = segmentPointDist(a1, a2, b1);\n ret = min(ret, segmentPointDist(a1, a2, b2));\n ret = min(ret, segmentPointDist(b1, b2, a1));\n ret = min(ret, segmentPointDist(b1, b2, a2));\n return ret;\n}\n\nbool convexContain(const vector<Point>& cp, const Point& p)\n{\n int n = cp.size();\n bool ret1 = true;\n bool ret2 = true;\n for(int i=0; i<n; ++i){\n double a = (cp[(i+1)%n] - cp[i]).cross(p - cp[i]);\n if(a < -EPS)\n ret1 = false;\n if(a > EPS)\n ret2 = false;\n }\n return ret1 || ret2;\n}\n\nbool polygonsCollide(const vector<Point>& cp1, const vector<Point>& cp2)\n{\n int n = cp1.size();\n int m = cp2.size();\n for(int i=0; i<n; ++i){\n for(int j=0; j<m; ++j){\n if(segmentsDist(cp1[i], cp1[(i+1)%n], cp2[j], cp2[(j+1)%m]) < 0.01 + EPS)\n return true;\n }\n }\n\n return convexContain(cp1, cp2[0]) || convexContain(cp2, cp1[0]);\n}\n\nint main()\n{\n for(;;){\n int n, d;\n cin >> n >> d;\n if(n == 0)\n return 0;\n\n vector<vector<Point> > p(n, vector<Point>(3));\n for(int i=0; i<n; ++i){\n for(int j=0; j<3; ++j){\n cin >> p[i][j].x >> p[i][j].y;\n }\n if(p[i][0].dist(p[i][2]) > p[i][0].dist(p[i][1]))\n swap(p[i][1], p[i][2]);\n if(p[i][1].dist(p[i][2]) > p[i][0].dist(p[i][1]))\n swap(p[i][0], p[i][2]);\n if((p[i][1] - p[i][0]).cross(p[i][2] - p[i][0]) < 0)\n swap(p[i][0], p[i][1]);\n }\n\n vector<vector<int> > edges(n);\n for(int i=0; i<n; ++i){\n Point v = p[i][1] - p[i][0];\n v = v / v.length() * d;\n swap(v.y, v.x);\n v.x *= -1;\n\n vector<Point> p1(4);\n p1[0] = p[i][0];\n p1[1] = p[i][0] + v;\n p1[2] = p[i][1] + v;\n p1[3] = p[i][1];\n\n for(int j=0; j<n; ++j){\n if(j == i)\n continue;\n if(polygonsCollide(p1, p[j]))\n edges[i].push_back(j);\n }\n }\n\n vector<vector<int> > nodes, edges2;\n stronglyConnectedComponents(edges, nodes, edges2);\n\n int m = edges2.size();\n vector<bool> check(m, false);\n int ret = m;\n for(int i=0; i<m; ++i){\n for(unsigned j=0; j<edges2[i].size(); ++j){\n if(!check[edges2[i][j]]){\n check[edges2[i][j]] = true;\n -- ret;\n }\n }\n }\n cout << ret << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0237_195026",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<complex>\n#include<vector>\n#include<algorithm>\n#define MAX_N 100\n#define M 3\n#define L 4\n#define EPS (1e-10)\n#define MIN (0.01)\nusing namespace std;\ntypedef complex<double> P;\ntypedef vector<int> edges;\ntypedef vector<edges> graph;\ndouble dot(P a, P b){\n\treturn a.real() * b.real() + a.imag() * b.imag();\n}\ndouble cross(P a, P b){\n\treturn a.real() * b.imag() - a.imag() * b.real();\n}\ndouble distance_ls_p(P a, P b, P c){\n\tif(dot(b-a, c-a) < EPS)\t\t\treturn abs(c-a);\n\telse if(dot(a-b, c-b) < EPS)\treturn abs(c-b);\n\telse \t\t\t\t\t\t\treturn abs(cross(b-a, c-a)) / abs(b-a);\n}\nbool is_intersected_ls(P a, P b, P c, P d){\n\tif(\tabs(c-a) < MIN + EPS || abs(d-a) < MIN + EPS ||\n\t\tabs(c-b) < MIN + EPS || abs(d-b) < MIN + EPS)\n\t\t\treturn true;\n\tif(distance_ls_p(a, b, c) < MIN + EPS ||\n\t\tdistance_ls_p(a, b, d) < MIN + EPS ||\n\t\tdistance_ls_p(c, d, a) < MIN + EPS ||\n\t\tdistance_ls_p(c, d, b) < MIN + EPS)\n\t\t\treturn true;\n\treturn\n\t\t(cross(b-a, c-a) * cross(b-a, d-a) < -EPS) &&\n\t\t(cross(d-c, a-c) * cross(d-c, b-c) < -EPS);\n}\nbool contains(P *x, int n, P p){\n\tdouble o = cross(p-x[0], x[1]-x[0]);\n\tfor(int i=0;i<n;++i){\n\t\tif(distance_ls_p(x[i], x[(i+1)%n], p) < MIN + EPS){\n\t\t\treturn true;\n\t\t}\n\t}\n\tfor(int i=0;i<n;++i){\n\t\tdouble d = cross(p-x[i], x[(i+1)%n]-x[i]);\n\t\tif(d * o < EPS) return false;\n\t}\n\treturn true;\n}\nbool overlap(P *x, int n, P *y, int m){\n\tfor(int j=0;j<m;++j){\n\t\tif(contains(x, n, y[j])){\n\t\t\treturn true;\n\t\t}\n\t}\n\tfor(int i=0;i<n;++i){\n\t\tif(contains(y, m, x[i])){\n\t\t\treturn true;\n\t\t}\n\t}\n\tfor(int i=0;i<n;++i){\n\t\tint k = (i + 1) % n;\n\t\tfor(int j=0;j<m;++j){\n\t\t\tint l = (j + 1) % m;\n\t\t\tif(is_intersected_ls(x[i], x[k], y[j], y[l])){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nint n, d;\nP tr[MAX_N][M];\nP sq[MAX_N][L];\ngraph g, gi, dag;\nvector<int> vi;\nvector<int> f;\nvector<int> c;\nvoid create_squares(){\n\tfor(int i=0;i<n;++i){\n\t\tP t = tr[i][1] - tr[i][0];\n\t\tP v = P(-t.imag(), t.real());\n\t\tif(dot(v, tr[i][2] - tr[i][0]) < -EPS){\n\t\t\tv = -v;\n\t\t}\n\t\tv = v / abs(v) * double(d);\n\t\tsq[i][0] = tr[i][0];\t\tsq[i][1] = tr[i][0] + v;\n\t\tsq[i][2] = tr[i][1] + v;\tsq[i][3] = tr[i][1];\n\t}\n}\nvoid create_graph(){\n\tg.clear();\n\tgi.clear();\n\tg.resize(n);\n\tgi.resize(n);\n\tfor(int i=0;i<n;++i){\n\t\tfor(int j=0;j<n;++j){\n\t\t\tif(overlap(sq[i], L, tr[j], M)){\n\t\t\t\tg[i].push_back(j);\n\t\t\t\tgi[j].push_back(i);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid dfs(graph &g, int v){\n\tif(f[v] == 1) return;\n\tf[v] = 1;\n\tfor(edges::iterator i=g[v].begin(); i!=g[v].end(); ++i){\n\t\tdfs(g, *i);\n\t}\n\tvi.push_back(v);\n}\nvoid dfs_2(graph &g, int v, int label){\n\tif(f[v] == 1) return;\n\tf[v] = 1;\n\tc[v] = label;\n\tfor(edges::iterator i=g[v].begin(); i!=g[v].end(); ++i){\n\t\tdfs_2(g, *i, label);\n\t}\n}\nvoid dfs_3(graph &g, int v){\n\tif(f[v] == 1) return;\n\tf[v] = 1;\n\tfor(edges::iterator i=g[v].begin(); i!=g[v].end(); ++i){\n\t\tdfs_3(g, *i);\n\t}\n\tvi.push_back(v);\n}\nvoid dfs_4(graph &g, int v){\n\tif(f[v] == 1) return;\n\tf[v] = 1;\n\tfor(edges::iterator i=g[v].begin(); i!=g[v].end(); ++i){\n\t\tdfs_4(g, *i);\n\t}\n}\nint count(){\n\tf.clear();\n\tf.resize(n);\n\tvi.clear();\n\tint t = 1;\n\tint res = 0;\n\tfor(int i=0;i<n;++i){\n\t\tif(f[i] == 0){\n\t\t\tdfs(g, i);\n\t\t}\n\t}\n\tf.clear();\n\tf.resize(n);\n\treverse(vi.begin(), vi.end());\n\tdag.clear();\n\tc.clear();\n\tc.resize(n);\n\tfor(vector<int>::iterator i=vi.begin();i!=vi.end();++i){\n\t\tif(f[*i] == 0){\n\t\t\tdfs_2(gi, *i, res);\n\t\t\t++res;\n\t\t}\n\t}\n\tdag.resize(res);\n\tfor(int i=0;i<res;++i){\n\t\tdag[i].clear();\n\t}\n\tfor(int i=0;i<n;++i){\n\t\tfor(vector<int>::iterator j=g[i].begin();j!=g[i].end();++j){\n\t\t\tif(c[i] != c[*j]){\n\t\t\t\tdag[c[i]].push_back(c[*j]);\n\t\t\t}\n\t\t}\n\t}\n\tf.clear();\n\tf.resize(res);\n\tvi.clear();\n\tfor(int i=0;i<res;++i){\n\t\tif(f[i] == 0){\n\t\t\tdfs_3(dag, i);\n\t\t}\n\t}\n\tint cnt = 0;\n\tf.clear();\n\tf.resize(res);\n\treverse(vi.begin(), vi.end());\n\tfor(vector<int>::iterator i=vi.begin();i!=vi.end();++i){\n\t\tif(f[*i] == 0){\n\t\t\tdfs_4(dag, *i);\n\t\t\t++cnt;\n\t\t}\n\t}\n\treturn cnt;\n}\nvoid solve(){\n\tcreate_squares();\n\tcreate_graph();\n\tprintf(\"%d\\n\", count());\n}\nint main(){\n\tfor(;;){\n\t\tscanf(\"%d%d\", &n, &d);\n\t\tif(n == 0) return 0;\n\t\tfor(int i=0;i<n;++i){\n\t\t\tfor(int j=0;j<M;++j){\n\t\t\t\tint x, y;\n\t\t\t\tscanf(\"%d%d\", &x, &y);\n\t\t\t\ttr[i][j] = P(x, y);\n\t\t\t}\n\t\t\tfor(int j=0;j<M;++j){\n\t\t\t\tdouble d1, d2;\n\t\t\t\td1 = abs(tr[i][(j+1)%M] - tr[i][j]);\n\t\t\t\td2 = abs(tr[i][(j+2)%M] - tr[i][j]);\n\t\t\t\tif(abs(d1 - d2) < EPS){\n\t\t\t\t\tP t = tr[i][2];\n\t\t\t\t\ttr[i][2] = tr[i][j];\n\t\t\t\t\ttr[i][j] = t;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsolve();\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 0,
"score_of_the_acc": -0.2308,
"final_rank": 3
},
{
"submission_id": "aoj_0237_159877",
"code_snippet": "#include<complex>\n#include<vector>\n#include<iostream>\n#include<stack>\n#include<cmath>\n\nenum CCW{FRONT=0x01,RIGHT=0x02,BACK=0x04,LEFT=0x08,OVER=0x10};\nenum CIRCLE_RELATION{CIRCLE_SAME=0x01,CIRCLE_CONTAIN=0x02,\n\t\t CIRCLE_NO_CROSS=0x04,CIRCLE_ONE_CROSS=0x08,\n\t\t CIRCLE_ONE_INSIDE_CROSS=0x10,CIRCLE_TWO_CROSS=0x20};\n#define sc second\n#define fr first\n\n#define REP(i,n) for(int i = 0; i < (int)(n); ++i)\n\nusing namespace std;\n\ntypedef double elem;\ntypedef complex<elem> point, vec;\ntypedef pair<point, point> line, hline, seg, pp;\n\nconst double infty = 1e40;\nconst double eps = 1e-8;\nconst double pi = acos(-1.0);\npoint base(0,0);\n\n// oÍ\nostream &operator<<(ostream &os, const pair<point,point> &p){\n os << p.fr << \"-\" << p.sc;\n return os;\n}\n\n// lZ\ninline elem sq(elem a){ return a*a; }\ninline elem cq(elem a){ return a*a*a; }\n\n// pxÏ·\nelem rad(elem deg){ return (deg/180)*pi; }\nelem deg(elem rad){ return (rad*180)/pi; }\n\n// ®¬_Ìô¢AÈÇ\nbool eq(elem a, elem b){ return abs(a-b) < eps; }\nbool eqv(vec a, vec b){ return eq( abs(b-a),0); }\n\n// _Iy[^\nbool far(point a, point b){ return abs(b-a)>0; }\nbool near(point a, point b){ return abs(b-a)<=0; }\nelem dot(vec a, vec b){ return (a.real() * b.real() + a.imag() * b.imag() ); }\nelem cross(vec a, vec b){ return ( a.real() * b.imag() - a.imag() * b.real() ); }\n\n// a©çbÜÅvñèÌpxAàpA]ñ]\nelem varg(vec a, vec b){\n elem ret=arg(a)-arg(b);\n if(ret<0)ret+=2*pi;\n if(ret>2*pi)ret-=2*pi;\n if(eq(ret,2*pi))ret=0;\n return ret;\n}\nelem varg2(vec a, vec b){\n elem ret = varg(a,b);\n if(ret>pi)return 2*pi-ret;\n return ret;\n}\nelem arg(vec a, vec b){ return acos( dot(a,b) / ( abs(a) * abs(b) ) ); }\npoint rot(point p, elem theta){ return p * polar((elem)1.0, theta); }\npoint rotdeg(point p, elem deg){ return p * polar((elem)1.0, rad(deg)); }\npoint proj(line l, point p){\n double t=dot(p-l.first,l.first-l.second)/abs(l.first-l.second);\n return l.first + t*(l.first-l.second);\n}\npoint reflect(line l, point p){ return p+2.0*(proj(l,p)-p); }\n\n// ñ_Ô£A¼üÆ_ÌÅZ£AüªÆ_ÌÅZ£\nelem dist(point a, point b){ return abs(a-b); }\nelem dist_l(line l, point x){ return abs(cross(l.sc-l.fr,x-l.fr)) / abs(l.sc-l.fr); }\nelem dist_seg(seg s, point x)\n{\n if( dot(s.sc-s.fr,x-s.fr)<0 ) return abs(x-s.fr);\n if( dot(s.fr-s.sc,x-s.sc)<0 ) return abs(x-s.sc);\n return dist_l(s,x);\n}\n\n// PÊxNgA@üxNgAPÊ@üxNg\nvec uvec(vec a){ return a / abs(a); }\nvec nmr(vec a){ return a * vec(0,-1); }\nvec nml(vec a){ return a * vec(0,1); }\nvec unmr(vec a){ return uvec( nmr(a) ); }\nvec unml(vec a){ return uvec( nml(a) ); }\n\n// ¼ðA½s»è\nbool orth(point a1, point a2, point b1, point b2){ return eq( dot( a2 - a1, b2 - b1 ), 0 ); }\nbool orth(vec v1, vec v2){ return eq( dot(v1, v2), 0 ); }\nbool prll(point a1, point a2, point b1, point b2){ return eq( cross( a2 - a1, b2 - b1 ), 0 ); }\nbool prll(vec v1, vec v2){ return eq( cross(v1, v2), 0 ); }\n\n// CCW oXg¾ªA¸xÉæé\ninline int ccw(const point &a, point b, point x){\n b -= a;\n x -= a;\n if( eq(cross(b,x),0.0) && dot(b,x) < 0 ) return BACK;\n if( eq(cross(b,x),0.0) && abs(b) < abs(x) ) return FRONT;\n if( eq(cross(b,x),0.0) ) return OVER;\n if( cross(b,x) > 0 ) return LEFT;\n if( cross(b,x) < 0 ) return RIGHT;\n}\n\n// üªg£\nline expandLine(line l, elem mag){\n line ret = l;\n vec vf(l.first - l.second);\n vec vs(l.second - l.first);\n ret.first = l.second + mag * vf;\n ret.second = l.first + mag * vs;\n return ret;\n}\n\n// üªÌð·»è\ninline bool intersectedSS(const seg &a, const seg &b)\n{\n int cwaf=ccw(a.fr,a.sc,b.fr);\n int cwbf=ccw(b.fr,b.sc,a.fr);\n int cwas=ccw(a.fr,a.sc,b.sc);\n int cwbs=ccw(b.fr,b.sc,a.sc);\n if( cwaf==OVER || cwas==OVER || cwbf==OVER || cwbs==OVER ) return true;\n return ( cwaf | cwas ) == (LEFT|RIGHT) && ( cwbf | cwbs ) == (LEFT|RIGHT);\n}\n\n// ¼üÌð·»è\nbool intersectedLL(line a, line b){ return !eq( cross(a.sc-a.fr,b.sc-b.fr), 0.0 ); }\n\n// ð_vZ\npoint intersectionSS(seg a, seg b)\n{\n elem d1 = dist_l(b,a.fr);\n elem d2 = dist_l(b,a.sc);\n return a.fr + ( d1 / (d1 + d2 ) ) * (a.sc-a.fr);\n}\npoint intersectionLL(line a, line b)\n{\n vec va = a.sc - a.fr;\n vec vb = b.sc - b.fr;\n return a.fr + va * ( cross(vb, b.fr - a.fr) / cross(vb,va) );\n}\n\n// üªð_êÅ\nbool intersectionLL(line a, line b, point &ret){\n return intersectedLL( a, b ) ? ret = intersectionLL( a, b ), true : false;\n}\nbool intersectionLH(line a, hline b, point &ret){\n point tmp;\n return intersectionLL(a,b,tmp) ? ( ccw(b.fr,b.sc,tmp)&(OVER|FRONT) ? ret=tmp, true : false ) : false;\n}\nbool intersectionLS(line l, seg s, point &ret){\n point tmp;\n return intersectionLL(l,s,tmp) ? ( ccw(s.fr,s.sc,tmp)&OVER ? ret=tmp, true : false ) : false;\n}\nbool intersectionHH(hline a, hline b, point &ret){\n point tmp;\n return intersectionLL(a,b,tmp) ? ( ccw(a.fr,a.sc,tmp)&(OVER|FRONT)&&ccw(b.fr,b.sc,tmp)&(OVER|FRONT) ? ret = tmp, true : false ) : false;\n}\nbool intersectionHS(hline a, seg s, point &ret){\n point tmp;\n return intersectionLS(a,s,tmp) ? ( ccw(a.fr,a.sc,tmp)&(OVER|FRONT) ? ret = tmp, true : false ) : false;\n}\nbool intersectionSS(seg a, seg b, point &ret){\n return intersectedSS(a,b) ? ret = intersectionSS(a,b), true : false;\n}\n\n/* Op` */\nstruct triangle{\n vector<point> p;\n triangle():p(3,point(0,0)){}\n triangle(point a,point b,point c){p.push_back(a);p.push_back(b);p.push_back(c);}\n bool inside(const point &t)const{\n int ccw01=ccw(p[0],p[1],t),ccw02=ccw(p[1],p[2],t),ccw03=ccw(p[2],p[0],t);\n return ccw01==ccw02&&ccw02==ccw03;\n }\n bool contain(const point &t)const{\n int ccw01=ccw(p[0],p[1],t),ccw02=ccw(p[1],p[2],t),ccw03=ccw(p[2],p[0],t);\n if((ccw01|ccw02|ccw03)&OVER)return true;\n else return ccw01==ccw02&&ccw02==ccw03;\n }\n};\n\n/* é` */\nstruct rectangle{\n vector<point> p;\n rectangle():p(4,point(0,0)){}\n rectangle(point a, point b, point c, point d){\n p.push_back(a); p.push_back(b); p.push_back(c); p.push_back(d);\n }\n bool inside(const point &t)const{\n int ccw01=ccw(p[0],p[1],t),ccw02=ccw(p[1],p[2],t),ccw03=ccw(p[2],p[0],t);\n return ccw01==ccw02&&ccw02==ccw03;\n }\n bool contain(const point &t)const{\n int ccw01=ccw(p[0],p[1],t),ccw02=ccw(p[1],p[2],t),ccw03=ccw(p[2],p[3],t),ccw04=ccw(p[3],p[0],t);\n if((ccw01|ccw02|ccw03|ccw04)&OVER)return true;\n else return ccw01==ccw02&&ccw02==ccw03&&ccw03==ccw04;\n }\n bool rayReach(const triangle &t){ // t : traignle\n for(int i = 0; i < (int)t.p.size(); ++i){\n if( this->contain(t.p[i]) ) return true;\n }\n for(int i = 0; i < 4; ++i){\n seg s(p[i],p[(i+1)%4]);\n for(int j = 0; j < (int)t.p.size(); ++j){\n\tseg ss(t.p[j],t.p[(j+1)%t.p.size()]);\n\tif( intersectedSS( s, ss ) ) return true;\n }\n }\n return false;\n }\n};\n\nrectangle touch(triangle t, elem d)\n{\n rectangle ret;\n elem da=abs(t.p[0]-t.p[1]);\n elem db=abs(t.p[1]-t.p[2]);\n elem dc=abs(t.p[2]-t.p[0]);\n \n if(eq(da,db)){\n vec v=d*uvec( t.p[1] - (t.p[2]+t.p[0])/2.0 );\n ret.p[0]=t.p[2]+v;\n ret.p[1]=t.p[2];\n ret.p[2]=t.p[0];\n ret.p[3]=t.p[0]+v;\n }else if(eq(da,dc)){\n vec v=d*uvec( t.p[0] - (t.p[1]+t.p[2])/2.0 );\n ret.p[0]=t.p[1]+v;\n ret.p[1]=t.p[1];\n ret.p[2]=t.p[2];\n ret.p[3]=t.p[2]+v;\n }else if(eq(db,dc)){\n vec v=d*uvec( t.p[2] - (t.p[0]+t.p[1])/2.0 );\n ret.p[0]=t.p[0]+v;\n ret.p[1]=t.p[0];\n ret.p[2]=t.p[1];\n ret.p[3]=t.p[1]+v;\n }\n return ret;\n}\n\nstruct Node{\n vector<int> con;\n};\n\ntypedef vector<Node> Graph;\n\nvoid visit(const Graph &g, int v, vector< vector<int> > &scc,\n\t stack<int> &S, vector<int> &inS,\n\t vector<int> &low, vector<int> &num, int &time)\n{\n low[v] = num[v] = ++time;\n S.push(v);\n inS[v]=1;\n for(int i = 0; i < (int)g[v].con.size(); ++i){\n int w=g[v].con[i];\n if(num[w]==0){\n visit(g,w,scc,S,inS,low,num,time);\n low[v]=min(low[v],low[w]);\n }else if(inS[w])\n low[v]=min(low[v],num[w]);\n }\n if(low[v]==num[v]){\n scc.push_back(vector<int>());\n while(true){\n int w=S.top(); S.pop(); inS[w]=0;\n scc.back().push_back(w);\n if( v == w ) break;\n }\n }\n}\nvoid stronglyConnectedComponents(const Graph &g, vector< vector<int> > &scc)\n{\n int n = g.size();\n vector<int> num(n),low(n);\n stack<int> S;\n vector<int> inS(n);\n int time=0;\n for(int i=0;i<n;++i){\n if(num[i]==0)\n visit(g,i,scc,S,inS,low,num,time);\n }\n}\n\nint solve(const vector<triangle> &vt, elem d)\n{\n Graph G;\n\n for(int i = 0; i < (int)vt.size(); ++i){\n Node node;\n for(int j = 0; j < (int)vt.size(); ++j){\n if( i != j ){\n\trectangle R = touch(vt[i],d);\n\tif( R.rayReach( vt[j] ) ){\n\t node.con.push_back(j);\n\t}\n }else\n\tnode.con.push_back(j);\n }\n G.push_back(node);\n }\n \n vector< vector<int> > scc;\n stronglyConnectedComponents( G, scc );\n\n int in[scc.size()];\n for(int i = 0; i < (int)scc.size(); ++i){\n in[i] = 0;\n }\n Graph DAG;\n for(int i = 0; i < (int)scc.size(); ++i){\n Node node;\n for(int ii = 0; ii < (int)scc[i].size(); ++ii){\n int from = scc[i][ii];\n for(int j = 0; j < (int)scc.size(); ++j){\n\tif(i!=j){\n\t for(int jj = 0; jj < (int)scc[j].size(); ++jj){\n\t int to = scc[j][jj];\n\t for(int k = 0; k < (int)G[from].con.size(); ++k){\n\t if( G[from].con[k] == to ){\n\t\tnode.con.push_back(j);\n\t\tin[j]++;\n\t\tgoto next;\n\t }\n\t }\n\t }\n\tnext:;\n\t}\n }\n }\n DAG.push_back(node);\n }\n\n /*\n for(int i = 0; i < (int)DAG.size(); ++i){\n printf(\"%d : \", i );\n for(int j = 0; j < (int)DAG[i].con.size(); ++j){\n printf(\"%d \", DAG[i].con[j] );\n }\n printf(\"\\n\");\n }\n */\n\n int ret = 0;\n for(int i = 0; i < (int)DAG.size(); ++i){\n if( in[i] == 0 ) ++ret;\n }\n return ret;\n}\n\nint main(){\n while(true){\n int n;\n elem d;\n vector<triangle> vt;\n scanf(\"%d%lf\", &n, &d);\n if(n==0)break;\n for(int i = 0; i < n; ++i){\n double x1,y1,x2,y2,x3,y3;\n scanf(\"%lf%lf%lf%lf%lf%lf\", &x1, &y1, &x2, &y2, &x3, &y3);\n point ta(x1,y1),tb(x2,y2),tc(x3,y3);\n vt.push_back(triangle(ta,tb,tc));\n }\n int res = solve( vt, d );\n printf(\"%d\\n\", res);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0237_158366",
"code_snippet": "#include<iostream>\n#include<map>\n#include<complex>\n#include<queue>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<set>\n#include<cassert>\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;\n\n//graph part\nvector<int> edge[N];\nbool vis[N];\n\nint ord;\nvector<int> inedge[N];\nvector<int> redge[N];\nint component[N];\nstruct PO{\n int order,num;\n};\nPO postorder[N];\n\nbool cmp(const PO a,const PO b){\n return a.order > b.order;\n}\n\nvoid sccdfs(int now){\n vis[now]=1;\n rep(i,inedge[now].size()){\n int next=inedge[now][i];\n if (!vis[next])sccdfs(next);\n }\n postorder[now].order=ord++;\n postorder[now].num=now;\n}\n\nvoid sccbfs(int ini,int comp){\n queue<int> Q;\n Q.push(ini);\n vis[ini]=true;\n component[ini]=comp;\n while(!Q.empty()){\n int now=Q.front();Q.pop();\n component[now]=comp;\n rep(i,redge[now].size()){\n int next=redge[now][i];\n if (!vis[next])Q.push(next),vis[next]=true;\n }\n }\n}\n\nint scc(int n,map<int,int> &M){\n ord=0;\n rep(i,n)vis[i]=false;\n rep(i,n){\n if (!vis[i])sccdfs(i);\n }\n int cnt=0;\n rep(i,n)vis[i]=false;\n sort(postorder,postorder+n,cmp);\n rep(i,n){\n int now = postorder[i].num;\n if (vis[now])continue;\n sccbfs(now,cnt);\n cnt++;\n }\n rep(i,n)M[i]=component[i];\n return cnt;\n}\n\nvoid tsort(int now,vector<int> &a){\n if (vis[now])return;\n vis[now]=true;\n rep(i,edge[now].size())tsort(edge[now][i],a);\n a.pb(now);\n}\n\nvoid dfs(int now){\n if (vis[now])return;\n vis[now]=true;\n rep(i,edge[now].size())dfs(edge[now][i]);\n}\n\nint solve(int n){\n map<int,int> M;\n int tmpn=scc(n,M);\n rep(i,n){\n int me=M[i];\n rep(j,inedge[i].size()){\n int you=M[inedge[i][j]];\n edge[me].pb(you);\n }\n }\n\n n=tmpn;\n vector<int> in;\n rep(i,n)vis[i]=false;\n rep(i,n){\n if (!vis[i])tsort(i,in);\n }\n reverse(ALL(in));\n int cnt=0;\n rep(i,n)vis[i]=false;\n rep(i,in.size()){\n if (!vis[in[i]])dfs(in[i]),cnt++;\n }\n return cnt;\n}\n\n//geometry part\ntypedef complex<double> P;\nconst double eps = 1e-1;\nvector<P> getpolygon(vector<P> a,double d){\n int in[3]={0,1,2};\n vector<P> ret;\n do{\n if (fabs(abs(a[in[2]]-a[in[1]])-abs(a[in[2]]-a[in[0]])) < eps){\n P mid =(a[in[0]]+a[in[1]])/2.;\n P tmp=a[in[2]]-mid;\n tmp/=abs(tmp);\n tmp*=d;\n ret.pb(a[in[0]]);\n ret.pb(a[in[1]]);\n ret.pb(a[in[1]]+tmp);\n ret.pb(a[in[0]]+tmp);\n return ret;\n }\n }while(next_permutation(in,in+3));\n assert(false);\n return ret;\n}\n\ndouble cross(P a,P b){\n return ( a.real()*b.imag() - a.imag()*b.real());\n}\n\ndouble dot(P a,P b){\n return a.real()*b.real()+a.imag()*b.imag();\n}\n\ndouble distance_ls_p(P a,P b,P c){\n if (dot(b-a,c-a) < eps)return abs(c-a);\n if (dot(a-b,c-b) < eps)return abs(c-b);\n return abs( cross(b-a,c-a))/abs(b-a);\n}\n\nbool isp(P a,P b,P c){\n return ( abs(a-c)+abs(b-c) < abs(a-b)+eps);\n}\n\nbool is_in(vector<P> in,P a){\n int cnt =0;\n int n = in.size();\n rep(i,n){\n P cur = in[i]-a,next=in[(i+1)%n]-a;\n if (cur.imag() > next.imag())swap(cur,next);\n if (cur.imag()<0 && 0<=next.imag() &&\n cross(next,cur)>=0)cnt++;\n if (isp(in[i],in[(i+1)%n],a))return true;\n }\n\n if (cnt %2 == 1)return true;\n else return false;\n}\n\nbool is_intersected_ls(P a1,P a2,P b1,P b2){\n if ( isp(a1,a2,b1))return true;\n if ( isp(a1,a2,b2))return true;\n if ( isp(b1,b2,a1))return true;\n if ( isp(b1,b2,a2))return true;\n if ( ( cross(a2-a1,b1-a1) * cross(a2-a1,b2-a1)<-eps ) && //-EPS\n ( cross(b2-b1,a1-b1)*cross(b2-b1,a2-b1) <-eps))return true;\n else return false;\n}\n\nbool is_intersected_polygon(vector<P> a,vector<P> b){\n int n = a.size();\n int m = b.size();\n rep(i,a.size()){\n rep(j,b.size()){\n if (is_intersected_ls(a[i],a[(i+1)%n],b[j],b[(j+1)%m]))\n return true;\n }\n }\n rep(i,b.size()){\n if (is_in(a,b[i]))return true;\n }\n return false;\n}\n\nvoid makegraph(int n,vector<P> *sq,vector<P> *tri){\n rep(i,n){\n rep(j,n){\n if (i == j)continue;\n if (is_intersected_polygon(sq[i],tri[j])){\n inedge[i].pb(j);\n redge[j].pb(i);\n }\n }\n }\n}\n\nmain(){\n int n;\n double d;\n while(cin>>n>>d && n){\n rep(i,n){\n edge[i].clear();\n inedge[i].clear();\n redge[i].clear();\n }\n vector<P> in[n];\n vector<P> sq[n];\n rep(i,n){\n rep(j,3){\n P tmp;cin>>tmp.real()>>tmp.imag();in[i].pb(tmp);\n }\n sq[i]=getpolygon(in[i],d);\n }\n makegraph(n,sq,in);\n cout << solve(n) << endl;\n }\n return false;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1020,
"score_of_the_acc": -0.6708,
"final_rank": 16
}
] |
aoj_0244_cpp
|
温泉旅行
温泉好きのたけしさんは、次の長期休暇を利用してとある温泉地への旅行を計画しています。移動は長距離バスを乗り継ぎ、なるべくお金をかけずに目的地へたどり着きたいと思っています。貯金があるとはいえ、資金に心許ないたけしさんは、おじいさんに相談することにしました。計画を聞いて感心したおじいさんは、たけしさんに特別な切符を渡しました。
その切符は、長距離バスの連続した2区間を1回だけ無料で乗れるというものでした。使いようによってはかなりの移動費削減が見込めますが、より大きな効果を発揮させるためにはしっかりした計画を練る必要があります。
出発地と目的地、及び中継地点が合わせて
n
個、2つの地点を結ぶ路線が
m
個与えられます。各地点にはそれぞれ 1 から
n
までの数字が割り振られています。出発地は 1、目的地は
n
です。路線の情報は、その路線が結ぶ2つの地点
a
と
b
、及びその料金
c
で表されます。特別な切符の効力により、任意の地点から、一度だけ連続した2つの路線を料金0で通過することができます。ただし、途中で目的地を通過しても、目的地にたどり着いたことにはなりません。
出発地、目的地、及び中継地点の総数
n
と路線の数
m
、各路線の情報を入力とし、料金の最小値を出力するプログラムを作成してください。ただし、必ず出発地から目的地へと到達する経路が存在するものとします。
入力
複数のデータセットが与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
n
m
a
1
b
1
c
1
a
2
b
2
c
2
:
a
m
b
m
c
m
1行目に出発地、目的地、及び中継地点の総数
n
(2 ≤
n
≤ 100)と路線の数
m
(1 ≤
m
≤ 300)が与えられます。続く
m
行に各路線の情報
a
i
,
b
i
,
c
i
(1 ≤
c
i
≤ 1000) が与えられます。
データセットの数は 40 を超えません。
出力
入力データセットごとに、料金の最小値を1行に出力します。
入力例
2 1
1 2 5
3 2
1 2 5
2 3 5
6 9
1 2 7
1 3 9
1 5 14
2 3 10
2 4 15
3 4 11
3 5 2
4 5 9
4 6 8
0 0
出力例
5
0
7
|
[
{
"submission_id": "aoj_0244_4963746",
"code_snippet": "#include<bits//stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define req(i,n) for(int i = 1;i <= n; i++)\n#define rrep(i,n) for(ll i = n-1;i >= 0;i--)\n#define ALL(obj) begin(obj), end(obj)\n#define RALL(a) rbegin(a),rend(a)\ntypedef long long int ll;\ntypedef long double ld;\nconst int MAX = 510000;\nconst ll MOD = 1000000007;\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; }\nint main(void){\n int n,m;\n while(cin >>n >>m,n){\n vector<vector<int>> d(n,vector<int>(n,1e9));\n rep(i,n) d[i][i]=0;\n int a,b,c;\n rep(i,m){\n cin >>a>>b>>c;a--;b--;\n d[a][b] = c;d[b][a] = c;\n }auto g = d;\n rep(i,n) rep(j,n) rep(k,n) chmin(d[j][k],d[j][i]+d[i][k]);\n int ans = d[0][n-1];\n rep(i,n) rep(j,n) rep(k,n){\n if(i==j||j==k||i==k) continue;\n if(g[i][j]==1e9||g[j][k]==1e9) continue;\n chmin(ans,d[0][i]+d[k][n-1]);\n }cout << ans <<endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3248,
"score_of_the_acc": -0.1976,
"final_rank": 14
},
{
"submission_id": "aoj_0244_4848644",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nconst int inf = 1e9;\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n \n vector<vector<int>> g(n, vector<int>(n, inf));\n for(int i=0; i<n; i++){\n g[i][i] = 0;\n }\n for(int i=0; i<m; i++){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n g[a][b] = min(g[a][b], c);\n g[b][a] = min(g[b][a], c);\n }\n auto d = g;\n for(int k=0; k<n; k++){\n for(int i=0; i<n; i++){\n for(int j=0; j<n; j++){\n d[i][j] = min(d[i][j], d[i][k]+d[k][j]);\n }\n }\n }\n int ans = d[0][n-1];\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 or j==k or k==i) continue;\n if(g[i][j]==inf or g[j][k]==inf) continue;\n ans = min(ans, d[0][i]+d[k][n-1]);\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3236,
"score_of_the_acc": -0.1971,
"final_rank": 13
},
{
"submission_id": "aoj_0244_4690835",
"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 reps(i,n) for(int i=1;i<=(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define Fixed fixed << setprecision(12)\n#define int int_fast64_t\nusing pii = pair<int,int>;\nconstexpr int INF = 0x3f3f3f3f;\nconstexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7; \nconstexpr int mod2 = 998244353;\n \ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n \ntemplate <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;\ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class A, class B> using umap = unordered_map<A,B>;\n\ninline int updiv(int a,int b){ return (a + b - 1) / b; }\n \nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout.setf(ios_base::fixed);\n cout.precision(12);\n\n int n, m;\n while(cin >> n >> m, n){\n vector<vector<pii> > g(n+1);\n rep(i,m){\n int a, b, c;\n cin >> a >> b >> c;\n g[a].emplace_back(b, c);\n g[b].emplace_back(a, c);\n }\n\n vector<vector<int> > cost(n+1, vector<int>(2, LINF));\n priority_queue<tuple<int, int, int> > que;\n cost[1][0] = 0;\n que.emplace(0, 1, 0);\n while(!que.empty()){\n int now_node, now_cost, st;\n tie(now_cost, now_node, st) = que.top();\n que.pop();\n if(st != 2 && cost[now_node][st] < now_cost){\n continue;\n }\n for(auto &&e : g[now_node]){\n int to, c;\n tie(to, c) = e;\n if(st == 2){\n que.emplace(now_cost, to, 1);\n chmin(cost[to][1], now_cost);\n }else if(st == 1 && chmin(cost[to][1], cost[now_node][1] + c)){\n que.emplace(cost[to][1], to, 1);\n }else if(st == 0){\n if(chmin(cost[to][0], cost[now_node][0] + c)){\n que.emplace(cost[to][0], to, 0);\n }\n que.emplace(now_cost, to, 2);\n }\n }\n }\n cout << min(cost[n][0], cost[n][1]) << '\\n';\n }\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3208,
"score_of_the_acc": -0.2316,
"final_rank": 15
},
{
"submission_id": "aoj_0244_4477926",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nint MapData[101][101], DpMoney[2][101];\nbool Used[2][101];\nconst int INF = 100000000;\n\n\nvoid solve() {\n\tint u, v;\n\n\tfor (int i = 0; i < 2; ++i) {\n\t\tfill(DpMoney[i], DpMoney[i] + 101, INF);\n\t\tfill(Used[i], Used[i] + 101, false);\n\t}\n\n\tDpMoney[0][1] = 0;\n\twhile (true) {\n\t\tu = -1;\n\t\tfor (int i = 0; i < 2; ++i) {\n\t\t\tfor (int j = 1; j <= N; ++j) {\n\t\t\t\tif (!Used[i][j] && (u == -1 || DpMoney[i][j] < DpMoney[u][v])) {\n\t\t\t\t\tu = i;\n\t\t\t\t\tv = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (u == -1) {\n\t\t\tbreak;\n\t\t}\n\t\tUsed[u][v] = true;\n\t\t//cout << \"u(ticket):\" << u << \" v(dest):\" << v << endl;\n\n\t\tfor (int k = 1; k <= N; ++k) {\n\t\t\tDpMoney[u][k] = min(DpMoney[u][k], DpMoney[u][v] + MapData[v][k]);\n\t\t\t//cout << \"u(ticket):\" << u << \" k(now):\" << k << \" money:\" << DpMoney[u][k] << endl;\n\t\t\tif (u == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int next = 1; next <= N; ++next) {\n\t\t\t\tif (MapData[v][k] == INF || MapData[k][next] == INF) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tDpMoney[1][next] = min(DpMoney[1][next], DpMoney[0][v] + 0);\n\t\t\t\t//cout << \"k(now):\" << k << \" next:\" << next << \" money:\" << DpMoney[1][next] << endl;\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\tint a, b, c;\n\n\twhile (cin >> N >> M, N) {\n\t\tfor (int i = 0; i < 101; ++i) {\n\t\t\tfill(MapData[i], MapData[i] + 101, INF);\n\t\t}\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tcin >> a >> b >> c;\n\t\t\tMapData[a][b] = c;\n\t\t\tMapData[b][a] = c;\n\t\t}\n\t\tsolve();\n\t\tcout << min(DpMoney[0][N], DpMoney[1][N]) << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3136,
"score_of_the_acc": -0.0856,
"final_rank": 4
},
{
"submission_id": "aoj_0244_4093414",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define INF 200000\n\nint n, m;\nbool is_edge[110][110];\nint d[110][110];\n\nvoid warshall_floyd() {\n for (int k=0; k<n; k++) {\n for (int i=0; i<n; i++) {\n for (int j=0; j<n; j++) {\n d[i][j] = min(d[i][j], d[i][k]+d[k][j]);\n }\n }\n }\n}\n\nint main() {\n while (true) {\n cin >> n >> m;\n \n if (n==0 && m==0) {\n break;\n }\n \n for (int i=0; i<n; i++) {\n for (int j=0; j<n; j++) {\n is_edge[i][j] = false;\n d[i][j] = (i==j) ? 0 : INF;\n }\n }\n \n for (int i=0; i<m; i++) {\n int a, b, c; cin >> a >> b >> c;\n is_edge[a-1][b-1] = true, is_edge[b-1][a-1] = true;\n d[a-1][b-1] = c, d[b-1][a-1] = c;\n }\n \n warshall_floyd();\n \n int ans = d[0][n-1];\n \n for (int i=0; i<n; i++) {\n for (int j=i+1; j<n; j++) {\n for (int k=0; k<n; k++) {\n if (is_edge[k][i] && is_edge[k][j]) {\n ans = min({ans, d[0][i]+d[j][n-1], d[0][j]+d[i][n-1]});\n break;\n }\n }\n }\n }\n \n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3160,
"score_of_the_acc": -0.1224,
"final_rank": 8
},
{
"submission_id": "aoj_0244_3157505",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\ntypedef pair<ll, pair<ll, ll> > P3;\n\nconst ll MOD = ll(1e9 + 7);\nconst ll LLINF = LLONG_MAX;\nconst int IINF = INT_MAX;\nconst int MAX_N = int(3e5) + 5;\nconst double EPS = 1e-8;\nconst int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};\nstring dir = \"RDLU\";\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define REPR(i, n) for (int i = n; i >= 0; i--)\n#define FOR(i, m, n) for (int i = m; i < n; i++)\n#define SORT(v) sort((v).begin(), (v), end())\n#define SORTR(v) sort((v).rbegin(), (v), rend())\n#define ALL(v) (v).begin(), (v).end()\n\nint main() {\n while (1) {\n int n, m, d[105][105]{};\n vector<int> g[105];\n cin >> n >> m;\n if(n==0)break;\n REP(i, n) fill(d[i], d[i] + n, IINF / 2);\n REP(i,n) d[i][i] = 0;\n REP(i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n b--;\n d[a][b] = c;\n d[b][a] = c;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n REP(k, n) REP(i, n) REP(j, n) {\n d[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n }\n int ans = d[0][n-1];\n REP(k, n) REP(j, g[k].size()) REP(i, j) {\n ans = min(ans,d[0][g[k][i]]+d[g[k][j]][n-1]);\n ans = min(ans,d[0][g[k][j]]+d[g[k][i]][n-1]);\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3196,
"score_of_the_acc": -0.0882,
"final_rank": 6
},
{
"submission_id": "aoj_0244_3047338",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint n,m;\nvector<int>G[100];\nint D[100][100];\nmain()\n{\n\twhile(cin>>n>>m,n)\n\t{\n\t\tfor(int i=0;i<n;i++)G[i].clear();\n\t\tfor(int i=0;i<n;i++)for(int j=0;j<n;j++)if(i!=j)D[i][j]=1e9;\n\t\tfor(int i=0;i<m;i++)\n\t\t{\n\t\t\tint a,b,c;cin>>a>>b>>c;a--,b--;\n\t\t\tG[a].push_back(b);\n\t\t\tG[b].push_back(a);\n\t\t\tD[a][b]=D[b][a]=c;\n\t\t}\n\t\tfor(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)\n\t\t\tD[i][j]=min(D[i][j],D[i][k]+D[k][j]);\n\t\tint ans=D[0][n-1];\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tfor(int j=0;j<G[i].size();j++)\n\t\t\t{\n\t\t\t\tfor(int k=0;k<G[i].size();k++)\n\t\t\t\t{\n\t\t\t\t\tif(j==k)continue;\n\t\t\t\t\tans=min(ans,D[0][G[i][j]]+D[G[i][k]][n-1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3176,
"score_of_the_acc": -0.0874,
"final_rank": 5
},
{
"submission_id": "aoj_0244_3000109",
"code_snippet": "#include <bits/stdc++.h>\n#define range(i, a, b) for(int i = (a); i < (b); i++)\n#define rep(i, a) range(i, 0, a)\nusing namespace std;\n\nconst int INF = 1e9;\n\nint main() {\n int n, m;\n while (cin >> n >> m, n) {\n vector <vector <int>> G(n, vector <int> (n, INF));\n rep (i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n a--; b--;\n G[a][b] = c;\n G[b][a] = c;\n }\n //state -> dist, pre, now, usedTicket\n using state = tuple <int, int, int, bool>;\n priority_queue <state> que;\n vector <vector <vector <int>>> dp(n, vector <vector<int>> (n, vector <int> (2, INF)));\n\n que.emplace(0, 0, 0, 0);\n dp[0][0][0] = 0;\n dp[0][0][1] = 0;\n\n while(!que.empty()) {\n state p = que.top(); que.pop();\n int dist, pre, now; bool usedTicket;\n tie(dist, pre, now, usedTicket) = p;\n\n rep (to, n) {\n if (now == to || G[now][to] == INF) continue;\n //チケット使わない\n if (dp[to][now][usedTicket] > dist + G[now][to]) {\n dp[to][now][usedTicket] = dist + G[now][to];\n que.emplace(dist + G[now][to], now, to, usedTicket);\n }\n //チケット使う\n if (!usedTicket && G[pre][now] != INF) {\n if (dp[to][now][true] > dist - G[pre][now]) {\n dp[to][now][true] = dist - G[pre][now];\n que.emplace(dist - G[pre][now], now, to, true);\n }\n }\n }\n }\n int ans = INF;\n rep (i, n) rep (j, 2) {\n ans = min(ans, dp[n - 1][i][j]);\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 3420,
"score_of_the_acc": -1.098,
"final_rank": 18
},
{
"submission_id": "aoj_0244_2640037",
"code_snippet": "#include \"bits/stdc++.h\"\n#define int long long\n#define loop(i, a, b) for(int i = a; i < b; i++)\n#define rep(i, a) loop(i, 0, a)\n#define all(a) (a).begin(),(a).end()\nusing namespace std;\nconst int MOD = 1e9 + 7, INF = 1e9;\nusing vi = vector <int>;\nusing vvi = vector <vi>;\n//g++ -std==c++14\nstruct edge {int to, cost;};\nvector <edge> G[100010];\nusing P = pair<int , int>;\nint V;\nint d[100010];\n\nvoid dijkstra(int s){\n priority_queue <P, vector<P>, greater<P> > que;\n fill(d, d + V, 1000000000);\n d[s] = 0;\n que.push(P(0 , s));\n \n while(!que.empty()){\n P p = que.top(); que.pop();\n int v = p.second;\n if(d[v] < p.first) continue;\n for(int i = 0; i < G[v].size(); i++){\n edge e = G[v][i];\n if(d[e.to] > d[v] + e.cost){\n d[e.to] = d[v] + e.cost;\n que.push(P(d[e.to], e.to));\n }\n }\n }\n}\n\nsigned main(){\n\tint m;\n\twhile(cin >> V >> m, V){\n\t\tint a, b, c;\n\t\trep(i, m){\n\t\t\tcin >> a >> b >> c;\n\t\t\ta--; b--;\n\t\t\tG[a].push_back({b, c});\n\t\t\tG[b].push_back({a, c});\n\t\t}\n\t\tstruct add{int kokkara, kokomade;};\n\t\tvector <add> karen;\n\t\trep(i, V){\n\t\t\trep(j, G[i].size()){\n\t\t\t\tint va = G[i][j].to;\n\t\t\t\trep(k, G[va].size()){\n\t\t\t\t\tif(G[va][k].to == i)continue;\n\t\t\t\t\tkaren.push_back({i, G[va][k].to});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdijkstra(0);\n\t\tint mini = d[V - 1];\n\t\trep(i, karen.size()){\n\t\t\tG[karen[i].kokkara].push_back({karen[i].kokomade, 0});\n\t\t\tdijkstra(0);\n\t\t\tG[karen[i].kokkara].pop_back();\n\t\t\tmini = min(mini, d[V - 1]);\n\t\t}\n\t\tcout << mini << endl;\n\t\trep(i, V)\n\t\t\tG[i].clear();\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 5556,
"score_of_the_acc": -0.5481,
"final_rank": 17
},
{
"submission_id": "aoj_0244_2567517",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint n,m,a,b,c,d[101][101];\nbool t[101][101];\nmain(){\n while(cin>>n>>m,n){\n int ans=1e9;\n r(i,n)r(j,n)d[i][j]=i==j?0:1e8;\n memset(t,0,sizeof(t));\n r(i,m){\n cin>>a>>b>>c;a--;b--;\n d[a][b]=d[b][a]=c;\n t[a][b]=t[b][a]=1;\n }\n r(o,n)r(i,n)r(j,n)d[i][j]=min(d[i][j],d[i][o]+d[o][j]);\n r(o,n)r(i,n)r(j,n)if(t[i][o]&&t[o][j])ans=min(ans,d[0][i]+d[j][n-1]);\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3084,
"score_of_the_acc": -0.1905,
"final_rank": 12
},
{
"submission_id": "aoj_0244_2520884",
"code_snippet": "#include <bits/stdc++.h>\n#define INF 1e+9\nusing namespace std;\n\nstruct edge{ int to,cost; };\ntypedef pair<int,int> P;\n\nint main(){\n\tint n,m;\n\twhile(cin >> n >> m,n){\n\t\tint mi = INF,d[100];\n\t\tvector<edge> G[100];\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tint a,b,c;\n\t\t\tcin >> a >> b >> c; a--; b--;\n\t\t\tG[a].push_back({b,c});\n\t\t\tG[b].push_back({a,c});\n\t\t}\n\t\tif(n == 2){\n\t\t\tcout << G[0][0].cost << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = i + 1;j < n;j++){\n\t\t\t\tset<int> st;\n\t\t\t\tbool flag = false;\n\t\t\t\tfor(int k = 0;k < G[i].size();k++) st.insert(G[i][k].to);\n\t\t\t\tfor(int k = 0;k < G[j].size();k++){\n\t\t\t\t\tif(st.count(G[j][k].to)) flag = true;\n\t\t\t\t}\n\t\t\t\tif(!flag) continue;\n\t\t\t\tvector<edge> G2[100];\n\t\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\t\td[k] = INF;\n\t\t\t\t\tG2[k] = G[k];\n\t\t\t\t}\n\t\t\t\tG2[i].push_back({j,0});\n\t\t\t\tG2[j].push_back({i,0});\n\t\t\t\td[0] = 0;\n\t\t\t\tpriority_queue<P,vector<P>,greater<P> > que;\n\t\t\t\tque.push(P(0,0));\n\t\t\t\twhile(!que.empty()){\n\t\t\t\t\tP p = que.top();que.pop();\n\t\t\t\t\tint v = p.second;\n\t\t\t\t\tif(d[v] < p.first) continue;\n\t\t\t\t\tfor(int k = 0;k < G2[v].size();k++){\n\t\t\t\t\t\tedge e = G2[v][k];\n\t\t\t\t\t\tif(d[e.to] > d[v] + e.cost){\n\t\t\t\t\t\t\td[e.to] = d[v] + e.cost;\n\t\t\t\t\t\t\tque.push(P(d[e.to],e.to));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmi = min(mi,d[n - 1]);\n\t\t\t}\n\t\t}\n\t\tcout << mi << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3164,
"score_of_the_acc": -0.4797,
"final_rank": 16
},
{
"submission_id": "aoj_0244_2490699",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<algorithm>\n#include<string>\n#include<queue>\n#include<vector>\n#include<functional>\n#include<cmath>\n#include<map>\n#include<stack>\n#include<set>\n#include<numeric>\n#include<limits>\n#include<iterator>\n\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define rep(i,n) for(int i=0; i<n; i++)\n#define INF (1<<20)\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pi;\ntypedef pair<ll, ll> pl;\ntypedef pair<ll, char> plc;\n\nint main()\n{\n\tint n,m;\n\tint d[110][110], M[110][110];\n\twhile (cin >> n >> m, n) \n\t{\n\t\trep(i, n)rep(j, n) { d[i][j] = INF; M[i][j] = 0; };\n\t\trep(i, n)d[i][i] = 0;\n\t\trep(i, m) {\n\t\t\tint a, b, c;\n\t\t\tcin >> a >> b >> c;\n\t\t\ta--, b--;\n\t\t\td[a][b] = d[b][a] = c;\n\t\t\tM[a][b] = M[b][a] = 1;\n\t\t}\n\n\t\trep(k, n)rep(i, n)rep(j, n)\n\t\t\td[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n\n\t\tint ans = d[0][n - 1];\n\t\trep(k, n)rep(i, n)rep(j, n)\n\t\t\tif (M[i][k] && M[k][j])ans = min(ans, d[0][i] + d[j][n - 1]);\n\n\t\tcout << ans << endl;\n\t} \n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3172,
"score_of_the_acc": -0.1586,
"final_rank": 11
},
{
"submission_id": "aoj_0244_1857182",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\n\n#define INF 100000000\n\nint main() {\n\tint n, m;\n\twhile (cin >> n >> m) {\n\t\tif (n == 0 && m == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector< vector<int> > cc(n, vector<int>(n, INF));\n\t\tvector< vector<int> > d(n, vector<int>(n, INF));\n\t\tint a, b, c;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> a >> b >> c;\n\t\t\tcc[a-1][b-1] = cc[b-1][a-1] = d[a-1][b-1] = d[b-1][a-1] = c;\n\t\t}\n\t\t//cout << 'a' << endl;\n\t\tfor (int k = 0; k < n; k++) {\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\tcc[i][j] = min(cc[i][j], cc[i][k]+cc[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcc[i][i] = 0;\n\t\t}\n\n\t\t//cout << 'b' << endl;\n\t\tint MIN = cc[0][n-1];\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 = 0; k < n; k++) {\n\t\t\t\t\tif (d[i][j] != INF && d[j][k] != INF) {\n\t\t\t\t\t\tMIN = min(MIN, cc[0][i]+cc[k][n-1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << MIN << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1304,
"score_of_the_acc": -0.1131,
"final_rank": 7
},
{
"submission_id": "aoj_0244_1769380",
"code_snippet": "//1.includes\n#include<iostream>\n#include<algorithm>\n#include<functional>\n#include<queue>\n#include<vector>\n#include<tuple>\nusing namespace std;\n//2.defines\n#define INF 1000000000000000000LL//(10^18)\n#define MAX_N 300000\n#define MAX_C 3\n#define BLACK 2\n#define GRAY 1\n#define WHITE 0\n//3.variables\npriority_queue<tuple<long long, long long, long long>, vector<tuple<long long, long long, long long> >, greater<tuple<long long, long long, long long> > >Q;\nvector<pair<long long, long long> >X[MAX_N];\nlong long dist[MAX_N][MAX_C];\nlong long color[MAX_N][MAX_C];\nlong long N, M, A, B, C;\n//4.functions\nvoid _memset() {\n\tfor (int i = 0; i < MAX_N; i++) {\n\t\tfor (int j = 0; j < MAX_C; j++) {\n\t\t\tdist[i][j] = 0;\n\t\t\tcolor[i][j] = 0;\n\t\t}\n\t}\n\tfor (int i = 0; i < MAX_N; i++) {\n\t\tX[i].clear();\n\t}\n\twhile (!Q.empty()) {\n\t\tQ.pop();\n\t}\n}\nlong long dijkstra(long long s, long long t) {\n\tfor (int i = 0; i < MAX_N; i++) {\n\t\tfor (int j = 0; j < MAX_C; j++) {\n\t\t\tdist[i][j] = INF;\n\t\t}\n\t}\n\tcolor[s][0] = GRAY;\n\tQ.push(make_tuple(0, 0, s));//Q.first=dist,second=time,third=place\n\tdist[s][0] = 0;\n\twhile (!Q.empty()) {\n\t\ttuple<long long, long long, long long>tup = Q.top();\n\t\tQ.pop();\n\t\tlong long a1 = get<0>(tup);\n\t\tlong long a2 = get<1>(tup);\n\t\tlong long a3 = get<2>(tup);\n\t\tfor (int i = 0; i < X[a3].size(); i++) {\n\t\t\tlong long a4 = X[a3][i].first;\n\t\t\tlong long a5 = X[a3][i].second;\n\t\t\tif (a2 == 0) {\n\t\t\t\tif (dist[a4][0] > a1 + a5) {\n\t\t\t\t\tdist[a4][0] = a1 + a5;\n\t\t\t\t\tQ.push(make_tuple(dist[a4][0], 0, a4));\n\t\t\t\t}\n\t\t\t\tif (dist[a4][1] > a1) {\n\t\t\t\t\tdist[a4][1] = a1;\n\t\t\t\t\tQ.push(make_tuple(dist[a4][1], 1, a4));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (a2 == 1) {\n\t\t\t\tif (dist[a4][2] > a1) {\n\t\t\t\t\tdist[a4][2] = a1;\n\t\t\t\t\tQ.push(make_tuple(dist[a4][2], 2, a4));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (a2 == 2) {\n\t\t\t\tif (dist[a4][2] > a1 + a5) {\n\t\t\t\t\tdist[a4][2] = a1 + a5;\n\t\t\t\t\tQ.push(make_tuple(dist[a4][2], 2, a4));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tlong long minx = INF;\n\tminx = min(minx, dist[t][0]);\n\tminx = min(minx, dist[t][2]);\n\treturn minx;\n}\n//5.main\nint main() {\n\twhile (true) {\n\t\t_memset();\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0) { break; }\n\t\tfor (int i = 1; i <= M; i++) {\n\t\t\tcin >> A >> B >> C;\n\t\t\tX[A].push_back(make_pair(B, C));\n\t\t\tX[B].push_back(make_pair(A, C));\n\t\t}\n\t\tlong long dist2 = dijkstra(1, N);\n\t\tif (dist2 >= INF) { dist2 = -1; }\n\t\tcout << dist2 << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 24152,
"score_of_the_acc": -1.5714,
"final_rank": 19
},
{
"submission_id": "aoj_0244_1655527",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint i,j,k,a,b,c,m,n,an,g[100][100],lk[100][100],ln[100];\n\twhile(cin >> n >> m && n>0) {\n\tfor (i=0;i<100;i++) { ln[i]=0; for (j=0;j<100;j++) { g[i][j]=99999999; if (i==j) g[i][j]=0;}}\t\n\tfor (i=0;i<m;i++) {\n\t\tcin >> a >> b >> c; a--; b--;\n\t\tg[a][b]=g[b][a]=c; lk[a][ln[a]++]=b; lk[b][ln[b]++]=a;\n\t}\n\tfor (k=0;k<n;k++) for (i=0;i<n;i++) for (j=0;j<n;j++) {c=g[i][k]+g[k][j]; if (g[i][j]>c) g[i][j]=c;}\n\tan=99999999;\n\tfor (k=0;k<n;k++) for (i=0;i<ln[k];i++) for (j=0;j<ln[k];j++) {\n\tc=g[0][lk[k][i]]+g[lk[k][j]][n-1]; if (i!=j && c<an) an=c;}\n\tif (an>g[0][n-1]) an=g[0][n-1];\n\tif (n==2) an=g[0][1]; \n\tcout << an << endl;\n\t} \n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1236,
"score_of_the_acc": -0.0387,
"final_rank": 2
},
{
"submission_id": "aoj_0244_1613525",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nint n,m,mm;\nint a[302],b[302],c[302],mn[302];\nint ans;\nint slv();\n\nint main(){\n while(1){\n cin>>n>>m;\n if(n==0 && m==0)break;\n mm=m;\n ans=2000000;\n memset(a,0,sizeof(a));\n memset(b,0,sizeof(b));\n memset(c,0,sizeof(c));\n for(int i=2;i<=n;i++)mn[i]=2000000;\n for(int i=1;i<=m;i++)cin>>a[i]>>b[i]>>c[i];\n\n mn[1]=0;\n slv();\n mm++;\n for(int i=1;i<=n;i++){\n for(int j=1;j<=m;j++){\n\tif(a[j]==i){\n\t for(int k=1;k<=m;k++){\n\t if(a[k]==b[j]){\n\t a[mm]=i;\n\t b[mm]=b[k];\n\t for(int ii=2;ii<=n;ii++)mn[ii]=2000000;\n\t mn[1]=0;\n\t slv();\n\t }\n\t else if(b[k]==b[j]){\n\t a[mm]=i;\n\t b[mm]=a[k];\n\t for(int ii=2;ii<=n;ii++)mn[ii]=2000000;\n\t mn[1]=0;\n\t slv();\n\t }\n\t }\n\t}\n\telse if(b[j]==i){\n\t for(int k=1;k<=m;k++){\n\t if(a[k]==a[j]){\n\t a[mm]=i;\n\t b[mm]=b[k];\n\t for(int ii=2;ii<=n;ii++)mn[ii]=2000000;\n\t mn[1]=0;\n\t slv();\n\t }\n\t else if(b[k]==a[j]){\n\t a[mm]=i;\n\t b[mm]=a[k];\n\t for(int ii=2;ii<=n;ii++)mn[ii]=2000000;\n\t mn[1]=0;\n\t slv();\n\t }\n\t }\n\t}\n }\n }\n \n cout<<ans<<endl;\n }\n}\n\nint slv(){\n for(int cnt=0;cnt<2;cnt++){\n for(int i=1;i<=n;i++){\n for(int j=1;j<=mm;j++){\n\tif(a[j]==i){\n\t mn[b[j]]=min(mn[b[j]],mn[a[j]]+c[j]);\n\t mn[a[j]]=min(mn[a[j]],mn[b[j]]+c[j]);\n\t}\n\telse if(b[j]==i){\n\t mn[a[j]]=min(mn[a[j]],mn[b[j]]+c[j]);\n\t mn[b[j]]=min(mn[b[j]],mn[a[j]]+c[j]);\n\t}\n }\n }\n }\n ans=min(ans,mn[n]);\n}",
"accuracy": 0.3333333333333333,
"time_ms": 120,
"memory_kb": 1168,
"score_of_the_acc": -0.3929,
"final_rank": 20
},
{
"submission_id": "aoj_0244_1548923",
"code_snippet": "#include <bits/stdc++.h>\n#define PB push_back\n#define MP make_pair\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define ALL(a) (a).begin(),(a).end()\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\nconst int INF=1e9;\nconst int MOD=100000;\nint B=1000000;\nstruct edge{int to,cost;};\nint N,M;\nint d[100][100];\nvector<edge>G[100];\nvoid dijkstra(int s){\n d[s][s]=0;\n priority_queue<P,vector<P>,greater<P> >Q;\n Q.push(P(0,s));\n while(!Q.empty()){\n P p=Q.top();Q.pop();\n int v=p.second;\n if(p.first>d[s][v])continue;\n for(int i=0;i<G[v].size();i++){\n edge e=G[v][i];\n if(d[s][e.to]>d[s][v]+e.cost){\n d[s][e.to]=d[s][v]+e.cost;\n Q.push(P(d[s][e.to],e.to));\n }\n }\n }\n}\nint main(){\n while(cin>>N>>M&&(N||M)){\n REP(i,N)G[i].clear();\n REP(i,100)REP(j,100)d[i][j]=INF;\n// REP(i,N)REP(j,N)printf(\"%d%c\",d[i][j],j==N-1?'\\n':' ');\n REP(i,M){\n int a,b,c;\n cin>>a>>b>>c;a--;b--;\n G[a].PB((edge){b,c});\n G[b].PB((edge){a,c});\n }\n REP(i,N)dijkstra(i);\n vector<P>V;\n set<P> f;\n REP(i,N){\n REP(j,G[i].size()){\n int mid=G[i][j].to;\n REP(k,G[mid].size()){\n if(f.count(P(i,G[mid][k].to))==0){\n f.insert(P(i,G[mid][k].to));\n V.PB(P(i,G[mid][k].to));\n }\n }\n }\n }\n int ans=INF;\n REP(i,V.size()){\n if(ans>d[0][V[i].first]+d[V[i].second][N-1]){\n ans=d[0][V[i].first]+d[V[i].second][N-1];\n// cout<<V[i].first<<\" \"<<V[i].second<<\" \"<<ans<<endl;\n }\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1356,
"score_of_the_acc": -0.0796,
"final_rank": 3
},
{
"submission_id": "aoj_0244_1482701",
"code_snippet": "#include <iostream>\nusing namespace std;\n#define rep(x,to) for(int x=0; x<(to); ++(x))\n#define INF 1<<29\nint main() {\n int m,n;\n\n while(cin >> n >> m, m) {\n int d[100][100];\n bool ok[100][100] = {};\n rep(i,100) {\n fill(d[i],d[i]+100,INF);\n }\n rep(i,100) {\n d[i][i] = 0;\n }\n int s,t,cost;\n rep(i,m) {\n cin >> s >> t >> cost;\n s--, t--;\n d[s][t] = d[t][s] = cost;\n ok[s][t] = ok[t][s] = true;\n }\n rep(i,n) {\n rep(j,n) {\n rep(k,n) {\n d[j][k] = min(d[j][k], d[j][i] + d[i][k]);\n }\n }\n }\n int ans = d[0][n-1];\n rep(i,n) {\n rep(j,n) {\n if(i==j) continue;\n rep(k,n) {\n if(k==i || k==j) continue;\n if(ok[i][k] && ok[k][j]) {\n ans = min(ans, d[0][i] + d[j][n-1]);\n break;\n }\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1216,
"score_of_the_acc": -0.1449,
"final_rank": 9
},
{
"submission_id": "aoj_0244_1447345",
"code_snippet": "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=INT_MAX/2;\n\nvoid mainmain(){\n\tint n,m;\n\twhile(cin>>n>>m,n){\n\t\tvvint wf1;\n\t\tvvint wf2;\n\t\tinitvv(wf1,n,n,0);\n\t\tinitvv(wf2,n,n,INF);\n\t\trep(i,n) wf1[i][i]=wf2[i][i]=0;\n\t\trep(i,m){\n\t\t\tint a,b,c;\n\t\t\tcin>>a>>b>>c;\n\t\t\ta--; b--;\n\t\t\twf1[a][b]=wf1[b][a]=1;\n\t\t\twf2[a][b]=wf2[b][a]=c;\n\t\t}\n\t\trep(k,n) rep(i,n) rep(j,n){\n\t\t\twf2[i][j]=min(wf2[i][j],wf2[i][k]+wf2[k][j]);\n\t\t}\n\t\tint ans=wf2[0][n-1];\n\t\trep(i,n){\n\t\t\trep(j,n){\n\t\t\t\trep(k,n){\n\t\t\t\t\tif(wf1[i][k]&&wf1[k][j]){\n\t\t\t\t\t\tans=min(ans,wf2[0][i]+wf2[j][n-1]);\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}\n\n\nsigned main() {\n\tios_base::sync_with_stdio(false);\n \tcout<<fixed<<setprecision(0);\n mainmain();\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1308,
"score_of_the_acc": -0.1489,
"final_rank": 10
},
{
"submission_id": "aoj_0244_1415004",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1e+9;\ntypedef pair<int, int> P;\n\nstruct node {\n\tint c, to, t;\n\tnode(int c, int to, int t) : c(c), to(to), t(t){}\n};\n\nbool operator > (const node& n1, const node& n2){\n\treturn (n1.c == n2.c) ? n1.to > n2.to : n1.c > n2.c; \n}\n\nint N, M;\nvector<P> G[101];\nint d[101][2];\n\nvoid dijkstra(int s){\n\tfor(int i = 0; i <= N; ++i){\n\t\td[i][0] = INF;\n\t\td[i][1] = INF;\n\t}\n\tpriority_queue<node, vector<node>, greater<node>> que;\n\tque.push(node(0, s, 1));\n\td[s][1] = 0;\n\twhile(!que.empty()){\n\t\tnode n = que.top();\n\t\tque.pop();\n\t\tif(n.c > d[n.to][n.t])\n\t\t\tcontinue;\n\t\tfor(auto& u : G[n.to]){\n\t\t\tif(d[u.first][n.t] > d[n.to][n.t] + u.second){\n\t\t\t\td[u.first][n.t] = d[n.to][n.t] + u.second;\n\t\t\t\tque.push(node(d[u.first][n.t], u.first, n.t));\n\t\t\t}\n\t\t\tif(n.t){\n\t\t\t\tif(G[u.first].empty())\n\t\t\t\t\tcontinue;\n\t\t\t\tfor(auto w : G[u.first]){\n\t\t\t\t\td[w.first][0] = min(d[w.first][0], d[n.to][1]);\n\t\t\t\t\tque.push(node(d[w.first][0], w.first, 0));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\twhile(cin >> N >> M && (N || M)){\n\t\tfor(int i = 0; i <= N; ++i)\n\t\t\tG[i].clear();\n\t\tint a, b, c;\n\t\tfor(int i = 0; i < M; ++i){\n\t\t\tscanf(\"%d%d%d\", &a, &b, &c);\n\t\t\tG[a].push_back(P(b, c));\n\t\t\tG[b].push_back(P(a, c));\n\t\t}\n\t\tdijkstra(1);\n\t\tcout << d[N][0] << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1264,
"score_of_the_acc": -0.0042,
"final_rank": 1
}
] |
aoj_0236_cpp
|
宇宙人のメッセージ
宇宙人 Mr.X は地球への来星記念として、地球人に向けてのメッセージを残しました。 Mr.X がメッセージを残す場所に選んだのは古代遺跡として有名な"トロンコ遺跡"でした。 ここはいろいろな大きさの碁盤のマス目に、奇抜な石像が無造作に配置されている不思議な場所でした。
Mr.X は、メッセージとして、石像が置かれていない全てのマス目を一度だけ通る、単一の閉曲線を描きました。Mr.X はとても賢く、このような閉曲線を描くことが可能な碁盤であれば必ず閉曲線を描き、メッセージを残しました。しかし、石像の配置によっては、閉曲線を描くことが不可能な碁盤もあり、その場合はメッセージを残しませんでした。 図1の碁盤に描かれている閉曲線は、全ての空いているマス目を一度だけ通っています。Mr.X はこのような閉曲線をメッセージとして残しました。
図1
Mr.X は、図2の碁盤に描かれているような閉曲線は描きませんでした。
図2
後に Mr.X のメッセージは、古代遺跡と見事に調和した宇宙人の美として、地球人に夢とロマンを与える伝説となりました。しかし、長年に渡る風化によってメッセージは消えてしまい、伝説だけが残りました。
碁盤の情報を入力とし、Mr.X がその碁盤上にメッセージを残した場合は Yes と、残さなかった場合は No と出力するプログラムを作成してください。ただし、全てのマスに石像が配置されている場合は、No と出力することとします。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
W
H
c
1,1
c
1,2
...
c
1,W
c
2,1
c
2,2
...
c
2,W
:
c
H,1
c
H,2
...
c
H,W
1 行目に碁盤の横方向に並ぶマス目の数
W
, 縦方向に並ぶマス目の数
H
(1 ≤
W, H
≤ 7) が与えられる。
続く
H
行に碁盤の状態が与えられる。
c
i,j
は碁盤の
i
行目の左から
j
番目のマス目を表す整数であり、0 のとき何も置かれていないマス目、1 のとき石像が置かれているマス目を表す。
データセットの数は 1000 を超えない。
Output
データセットごとに、Yes または No を１行に出力する。
Sample Input
5 4
0 0 0 0 0
0 1 1 0 0
0 0 1 0 1
1 0 0 0 1
5 4
0 0 0 0 0
0 1 1 0 0
0 0 0 0 1
1 0 0 0 1
0 0
Output for the Sample Input
Yes
No
|
[
{
"submission_id": "aoj_0236_8819232",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(size);\n edge.reserve(size);\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n int visitedCount = visited.count();\n for (int u = 0; u < size; ++u) {\n if (u == from || visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 28860,
"score_of_the_acc": -1.0621,
"final_rank": 11
},
{
"submission_id": "aoj_0236_8810241",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <stack>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n stack<int> st;\n st.push(from);\n visited.set(from);\n while (!st.empty()) {\n int curr = st.top();\n st.pop();\n for (const auto &to : edge[curr]) {\n if (!visited[to]) {\n visited.set(to);\n st.push(to);\n }\n }\n }\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 29068,
"score_of_the_acc": -1.0796,
"final_rank": 20
},
{
"submission_id": "aoj_0236_8214612",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <bitset>\n#include <unordered_set>\nusing namespace std;\n\nconstexpr int N = 49;\nconstexpr int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\nconstexpr int NIL = -1;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nunordered_set<unsigned long long> memo;\n\ninline void make_graph() {\n size = 0;\n vertex.assign(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge.assign(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[0];\n int nx = x + d[1];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n}\n\ninline void reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited.test(to))\n reachability(to, visited);\n}\n\ninline bool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n if (dup.count() != size)\n return true;\n }\n return false;\n}\n\ninline bool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from || visited.test(u))\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited.test(v))\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\n\nbool solve() {\n visited.reset();\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n while (cin >> w >> h, w | h) {\n field.assign(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\\n\" : \"No\\n\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 27392,
"score_of_the_acc": -1.0109,
"final_rank": 9
},
{
"submission_id": "aoj_0236_8214607",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex.assign(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge.assign(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[0];\n int nx = x + d[1];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(int from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(int from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n if (dup.count() != size)\n return true;\n }\n return false;\n}\nbool dfs(int start, int from) {\n unsigned long long m = (unsigned long long)visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from || visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited.reset();\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (cin >> w >> h, w | h) {\n field.assign(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\\n\" : \"No\\n\");\n }\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 29168,
"score_of_the_acc": -1.0739,
"final_rank": 13
},
{
"submission_id": "aoj_0236_8214601",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(int from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(int from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(int start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n bool deadend = true;\n for (const auto &v : edge[start])\n deadend &= visited[v];\n if (deadend)\n return false;\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 17528,
"score_of_the_acc": -0.5726,
"final_rank": 7
},
{
"submission_id": "aoj_0236_8214600",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 29056,
"score_of_the_acc": -1.0744,
"final_rank": 14
},
{
"submission_id": "aoj_0236_8115028",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n if (dup.count() != size)\n return true;\n }\n return false;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from || visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (cin >> w >> h, w | h) {\n field.assign(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 29052,
"score_of_the_acc": -1.0694,
"final_rank": 12
},
{
"submission_id": "aoj_0236_8115025",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(size, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 29012,
"score_of_the_acc": -1.0751,
"final_rank": 16
},
{
"submission_id": "aoj_0236_8115024",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(size, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 29176,
"score_of_the_acc": -1.0766,
"final_rank": 17
},
{
"submission_id": "aoj_0236_8112438",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 29152,
"score_of_the_acc": -1.078,
"final_rank": 19
},
{
"submission_id": "aoj_0236_8112437",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <unordered_set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nunordered_set<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 27632,
"score_of_the_acc": -1.0177,
"final_rank": 10
},
{
"submission_id": "aoj_0236_8112436",
"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 <algorithm>\n#include <bitset>\n#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 29088,
"score_of_the_acc": -1.078,
"final_rank": 18
},
{
"submission_id": "aoj_0236_8112434",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int N = 49;\nint w, h;\nvector<vector<int>> field;\nint size;\nvector<vector<int>> vertex;\nvector<vector<int>> edge;\nbitset<N> visited;\nset<unsigned long long> memo;\nvoid make_graph() {\n enum { Y, X };\n const int NEXT[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n const int NIL = -1;\n size = 0;\n vertex = vector<vector<int>>(h, vector<int>(w, NIL));\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n vertex[y][x] = size++;\n edge = vector<vector<int>>(h * w, vector<int>());\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x) {\n if (vertex[y][x] == NIL)\n continue;\n for (const auto &d : NEXT) {\n int ny = y + d[Y];\n int nx = x + d[X];\n if (ny < 0 || h <= ny || nx < 0 || w <= nx)\n continue;\n if (vertex[ny][nx] == NIL)\n continue;\n edge[vertex[y][x]].push_back(vertex[ny][nx]);\n }\n }\n};\nvoid reachability(const int &from, bitset<N> &visited) {\n visited.set(from);\n for (const auto &to : edge[from])\n if (!visited[to])\n reachability(to, visited);\n}\nbool cut_vertex(const int &from) {\n auto dup = visited;\n dup.set(from);\n for (const auto &to : edge[from]) {\n if (dup[to])\n continue;\n reachability(to, dup);\n return dup.count() != size;\n }\n return dup.count() != size;\n}\nbool dfs(const int &start, int from) {\n unsigned long long m = visited.to_ullong() * N + from;\n if (memo.count(m))\n return false;\n memo.insert(m);\n if (cut_vertex(from))\n return false;\n for (int u = 0; u < size; ++u) {\n if (u == from)\n continue;\n if (visited[u])\n continue;\n int degree = 0;\n for (const auto &v : edge[u])\n if (v == start || !visited[v])\n ++degree;\n if (degree < 2)\n return false;\n }\n visited.set(from);\n for (const auto &to : edge[from]) {\n if (to == start && visited.count() == size)\n return true;\n if (visited[to])\n continue;\n if (dfs(start, to))\n return true;\n }\n visited.reset(from);\n return false;\n}\nbool solve() {\n visited = bitset<N>(0);\n make_graph();\n memo.clear();\n for (int y = 0; y < h; ++y)\n for (int x = 0; x < w; ++x)\n if (!field[y][x])\n return dfs(vertex[y][x], vertex[y][x]);\n return false;\n}\nint main() {\n while (cin >> w >> h, w | h) {\n field = vector<vector<int>>(h, vector<int>(w));\n for (auto &line : field)\n for (auto &v : line)\n cin >> v;\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 29072,
"score_of_the_acc": -1.075,
"final_rank": 15
},
{
"submission_id": "aoj_0236_7442696",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <set>\nusing namespace std;\n\ntypedef pair<int, int> Pii;\n\n\nPii dx_dy_array[] = { {1, 0}, {0, 1}, {-1, 0}, {0, -1} };\n\nbool is_degree_ok(int w, int h, const vector<vector<int>>& grid, vector<vector<int>>& degree_grid, set<Pii>& exception_set) {\n\tfor (int y = 0; y < h; y++) {\n\t\tfill(degree_grid[y].begin(), degree_grid[y].end(), 0);\n\t}\n\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (exception_set.count({ x, y }) > 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (grid[y][x] == 0) {\n\t\t\t\tfor (Pii dx_dy : dx_dy_array) {\n\t\t\t\t\tint nx = x + dx_dy.first;\n\t\t\t\t\tint ny = y + dx_dy.second;\n\n\t\t\t\t\tif (nx < 0 || nx >= w || ny < 0 || ny >= h) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (grid[ny][nx] == 0) {\n\t\t\t\t\t\tdegree_grid[y][x]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (degree_grid[y][x] == 1) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool backtrack(int w, int h, int sx, int sy, int cx, int cy, vector<vector<int>>& is_visited_grid, vector<vector<int>>& degree_grid) {\n\tbool is_end = true;\n\n\tfor (Pii dx_dy : dx_dy_array) {\n\t\tint nx = cx + dx_dy.first;\n\t\tint ny = cy + dx_dy.second;\n\n\t\tif (nx < 0 || nx >= w || ny < 0 || ny >= h) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (is_visited_grid[ny][nx] == 0) {\n\t\t\tis_end = false;\n\n\t\t\tset<Pii> exception_set;\n\t\t\t\n\t\t\texception_set.insert({ sx, sy });\n\t\t\texception_set.insert({ nx, ny });\n\n\t\t\tfor (Pii ddx_ddy : dx_dy_array) {\n\t\t\t\tint nsx = sx + ddx_ddy.first;\n\t\t\t\tint nsy = sy + ddx_ddy.second;\n\n\t\t\t\tif (0 <= nsx && nsx < w && 0 <= nsy && nsy < h) {\n\t\t\t\t\texception_set.insert({ nsx, nsy });\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!is_degree_ok(w, h, is_visited_grid, degree_grid, exception_set)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tis_visited_grid[ny][nx] = 1;\n\t\t\tif (backtrack(w, h, sx, sy, nx, ny, is_visited_grid, degree_grid)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tis_visited_grid[ny][nx] = 0;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (!is_end) {\n\t\treturn false;\n\t}\n\n\tfor (Pii dx_dy : dx_dy_array) {\n\t\tint nx = cx + dx_dy.first;\n\t\tint ny = cy + dx_dy.second;\n\n\t\tif (nx == sx && ny == sy) {\n\t\t\tfor (int y = 0; y < h; y++) {\n\t\t\t\tfor (int x = 0; x < w; x++) {\n\t\t\t\t\tif (is_visited_grid[y][x] == 0) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\nbool is_ok(int w, int h, const vector<vector<int>>& grid) {\n\tint sx = -1;\n\tint sy = -1;\n\tint num_space_cells = 0;\n\t\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] == 0) {\n\t\t\t\tnum_space_cells++;\n\t\t\t\tif (sx < 0) {\n\t\t\t\t\tsx = x;\n\t\t\t\t\tsy = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (sx < 0 || num_space_cells % 2 != 0) {\n\t\treturn false;\n\t}\n\n\tvector<vector<int>> degree_grid(h, vector<int>(w));\n\tset<Pii> exception_set;\n\n\tif (!is_degree_ok(w, h, grid, degree_grid, exception_set)) {\n\t\treturn false;\n\t}\n\n\tvector<vector<int>> is_visited_grid = grid;\n\t\n\tis_visited_grid[sy][sx] = 1;\n\treturn backtrack(w, h, sx, sy, sx, sy, is_visited_grid, degree_grid);\n}\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tint w = 0;\n\t\tint h = 0;\n\n\t\tcin >> w >> h;\n\t\tif (w == 0 && h == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tvector<vector<int>> grid(h, vector<int>(w));\n\n\t\tfor (int y = 0; y < h; y++) {\n\t\t\tfor (int x = 0; x < w; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\n\t\tcout << (is_ok(w, h, grid) ? \"Yes\" : \"No\") << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 880,
"memory_kb": 3388,
"score_of_the_acc": -0.1747,
"final_rank": 6
},
{
"submission_id": "aoj_0236_7442655",
"code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <set>\nusing namespace std;\n\ntypedef pair<int, int> Pii;\n\n\nPii dx_dy_array[] = { {1, 0}, {0, 1}, {-1, 0}, {0, -1} };\n\nbool is_degree_ok(int w, int h, const vector<vector<int>>& grid, vector<vector<int>>& degree_grid, set<Pii>& exception) {\n\tfor (int y = 0; y < h; y++) {\n\t\tfill(degree_grid[y].begin(), degree_grid[y].end(), 0);\n\t}\n\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (exception.count({ x, y }) > 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (grid[y][x] == 0) {\n\t\t\t\tfor (Pii dx_dy : dx_dy_array) {\n\t\t\t\t\tint nx = x + dx_dy.first;\n\t\t\t\t\tint ny = y + dx_dy.second;\n\n\t\t\t\t\tif (nx < 0 || nx >= w || ny < 0 || ny >= h) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (grid[ny][nx] == 0) {\n\t\t\t\t\t\tdegree_grid[y][x]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (degree_grid[y][x] == 1) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool backtrack(int w, int h, int sx, int sy, int cx, int cy, vector<vector<int>>& is_visited_grid, vector<vector<int>>& degree_grid) {\n\tbool is_end = true;\n\n\tfor (Pii dx_dy : dx_dy_array) {\n\t\tint nx = cx + dx_dy.first;\n\t\tint ny = cy + dx_dy.second;\n\n\t\tif (nx < 0 || nx >= w || ny < 0 || ny >= h) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (is_visited_grid[ny][nx] == 0) {\n\t\t\tis_end = false;\n\n\t\t\tset<Pii> exception;\n\t\t\t\n\t\t\texception.insert({ sx, sy });\n\t\t\texception.insert({ nx, ny });\n\n\t\t\tfor (Pii ddx_ddy : dx_dy_array) {\n\t\t\t\tint nsx = sx + ddx_ddy.first;\n\t\t\t\tint nsy = sy + ddx_ddy.second;\n\n\t\t\t\tif (0 <= nsx && nsx < w && 0 <= nsy && nsy < h) {\n\t\t\t\t\texception.insert({ nsx, nsy });\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!is_degree_ok(w, h, is_visited_grid, degree_grid, exception)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tis_visited_grid[ny][nx] = 1;\n\t\t\tif (backtrack(w, h, sx, sy, nx, ny, is_visited_grid, degree_grid)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tis_visited_grid[ny][nx] = 0;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (!is_end) {\n\t\treturn false;\n\t}\n\n\tfor (Pii dx_dy : dx_dy_array) {\n\t\tint nx = cx + dx_dy.first;\n\t\tint ny = cy + dx_dy.second;\n\n\t\tif (nx == sx && ny == sy) {\n\t\t\tfor (int y = 0; y < h; y++) {\n\t\t\t\tfor (int x = 0; x < w; x++) {\n\t\t\t\t\tif (is_visited_grid[y][x] == 0) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\nbool is_ok(int w, int h, const vector<vector<int>>& grid) {\n\tint sx = -1;\n\tint sy = -1;\n\tint num_space_cells = 0;\n\t\n\tfor (int y = 0; y < h; y++) {\n\t\tfor (int x = 0; x < w; x++) {\n\t\t\tif (grid[y][x] == 0) {\n\t\t\t\tnum_space_cells++;\n\t\t\t\tif (sx < 0) {\n\t\t\t\t\tsx = x;\n\t\t\t\t\tsy = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (sx < 0 || num_space_cells % 2 != 0) {\n\t\treturn false;\n\t}\n\n\tvector<vector<int>> degree_grid(h, vector<int>(w));\n\tset<Pii> exception;\n\n\tif (!is_degree_ok(w, h, grid, degree_grid, exception)) {\n\t\treturn false;\n\t}\n\n\tvector<vector<int>> is_visited_grid = grid;\n\t\n\tis_visited_grid[sy][sx] = 1;\n\treturn backtrack(w, h, sx, sy, sx, sy, is_visited_grid, degree_grid);\n}\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tint w = 0;\n\t\tint h = 0;\n\n\t\tcin >> w >> h;\n\t\tif (w == 0 && h == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tvector<vector<int>> grid(h, vector<int>(w));\n\n\t\tfor (int y = 0; y < h; y++) {\n\t\t\tfor (int x = 0; x < w; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\n\t\tcout << (is_ok(w, h, grid) ? \"Yes\" : \"No\") << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 870,
"memory_kb": 3076,
"score_of_the_acc": -0.1604,
"final_rank": 5
},
{
"submission_id": "aoj_0236_4906293",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint H,W;\nint d[5]={0,1,0,-1};\nint sx,sy;\nint c[10][10];\nint deg[10][10];\nbool dfs(int x,int y,int rest)\n{\n\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(!c[i][j])\n\t{\n\t\tif(abs(sx-i)+abs(sy-j)<=1)continue;\n\t\tif(abs(x-i)+abs(y-j)<=1)continue;\n\t\tif(deg[i][j]<=1)return false;\n\t}\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+d[r],ty=y+d[r+1];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(sx==tx&&sy==ty)\n\t\t{\n\t\t\tif(rest==0)return true;\n\t\t}\n\t\telse if(!c[tx][ty])\n\t\t{\n\t\t\tfor(int nr=0;nr<4;nr++)\n\t\t\t{\n\t\t\t\tint ttx=tx+d[nr],tty=ty+d[nr+1];\n\t\t\t\tif(ttx>=0&&tty>=0&&ttx<H&&tty<W)deg[ttx][tty]--;\n\t\t\t}\n\t\t\tc[tx][ty]=1;\n\t\t\tif(dfs(tx,ty,rest-1))return true;\n\t\t\tc[tx][ty]=0;\n\t\t\tfor(int nr=0;nr<4;nr++)\n\t\t\t{\n\t\t\t\tint ttx=tx+d[nr],tty=ty+d[nr+1];\n\t\t\t\tif(ttx>=0&&tty>=0&&ttx<H&&tty<W)deg[ttx][tty]++;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tsx=sy=-1;\n\t\tint cnt=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tcin>>c[i][j];\n\t\t\tif(!c[i][j])\n\t\t\t{\n\t\t\t\tsx=i;\n\t\t\t\tsy=j;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tif(sx<0||cnt%2==1)\n\t\t{\n\t\t\tcout<<\"No\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tc[sx][sy]=1;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tdeg[i][j]=0;\n\t\t\tif(!c[i][j])\n\t\t\t{\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint x=i+d[r],y=j+d[r+1];\n\t\t\t\t\tif(x>=0&&y>=0&&x<H&&y<W&&!c[x][y])deg[i][j]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<(dfs(sx,sy,cnt-1)?\"Yes\":\"No\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3096,
"score_of_the_acc": -0.0056,
"final_rank": 1
},
{
"submission_id": "aoj_0236_4906292",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint H,W;\nint d[5]={0,1,0,-1};\nint sx,sy;\nint c[10][10];\nint deg[10][10];\nbool dfs(int x,int y,int rest)\n{\n\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(!c[i][j])\n\t{\n\t\tif(abs(sx-i)+abs(sy-j)<=1)continue;\n\t\tif(abs(x-i)+abs(y-j)<=2)continue;\n\t\tif(deg[i][j]<=1)return false;\n\t}\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+d[r],ty=y+d[r+1];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(sx==tx&&sy==ty)\n\t\t{\n\t\t\tif(rest==0)return true;\n\t\t}\n\t\telse if(!c[tx][ty])\n\t\t{\n\t\t\tfor(int nr=0;nr<4;nr++)\n\t\t\t{\n\t\t\t\tint ttx=tx+d[nr],tty=ty+d[nr+1];\n\t\t\t\tif(ttx>=0&&tty>=0&&ttx<H&&tty<W)deg[ttx][tty]--;\n\t\t\t}\n\t\t\tc[tx][ty]=1;\n\t\t\tif(dfs(tx,ty,rest-1))return true;\n\t\t\tc[tx][ty]=0;\n\t\t\tfor(int nr=0;nr<4;nr++)\n\t\t\t{\n\t\t\t\tint ttx=tx+d[nr],tty=ty+d[nr+1];\n\t\t\t\tif(ttx>=0&&tty>=0&&ttx<H&&tty<W)deg[ttx][tty]++;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tsx=sy=-1;\n\t\tint cnt=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tcin>>c[i][j];\n\t\t\tif(!c[i][j])\n\t\t\t{\n\t\t\t\tsx=i;\n\t\t\t\tsy=j;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tif(sx<0||cnt%2==1)\n\t\t{\n\t\t\tcout<<\"No\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tc[sx][sy]=1;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tdeg[i][j]=0;\n\t\t\tif(!c[i][j])\n\t\t\t{\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint x=i+d[r],y=j+d[r+1];\n\t\t\t\t\tif(x>=0&&y>=0&&x<H&&y<W&&!c[x][y])deg[i][j]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<(dfs(sx,sy,cnt-1)?\"Yes\":\"No\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 3060,
"score_of_the_acc": -0.1024,
"final_rank": 3
},
{
"submission_id": "aoj_0236_4679958",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 10\n\nenum DIR{\n\tN,\n\tW,\n\tE,\n\tS\n};\n\nenum Type{\n\tN_S,\n\tW_E,\n\tW_S,\n\tW_N,\n\tN_E,\n\tS_E,\n\tUNDEFINED,\n};\n\nstruct LOC{\n\tLOC(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\n\nbool FLG;\nint h,w;\nint first_row,first_col;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nint base_map[SIZE][SIZE],rest[SIZE][SIZE];\nint sum_rest; //未確定出次の個数\nType table[SIZE][SIZE];\nbool check[6][4] = {{true,false,false,true},//N_S\n\t\t\t\t\t {false,true,true,false}, //W_E\n\t\t\t\t\t {false,true,false,true},//W_S\n\t\t\t\t\t {true,true,false,false},//W_N\n\t\t\t\t\t {true,false,true,false},//N_E\n\t\t\t\t\t {false,false,true,true} //S_E\n\t\t\t\t\t };\nType type_array[7] = {N_S,W_E,W_S,W_N,N_E,S_E,UNDEFINED};\nvector<LOC> V;\n\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= h-1 && col >= 0 && col <= w-1;\n}\n\nvoid recursive(int row,int col){\n\n\tif(FLG)return;\n\n\tif(row == h){\n\n\t\tif(sum_rest == 0){\n\n\t\t\tFLG = true;\n\t\t}\n\n\t\treturn;\n\t}\n\n\tint next_row,next_col;\n\tif(col == w-1){\n\n\t\tnext_row = row+1;\n\t\tnext_col = 0;\n\t}else{\n\n\t\tnext_row = row;\n\t\tnext_col = col+1;\n\t}\n\n\tif(base_map[row][col] == 1){ //石マス\n\n\t\trecursive(next_row,next_col);\n\t\treturn;\n\t}\n\n\t//空白マス\n\n\tif((row != first_row || col != first_col) && sum_rest == 0){\n\t\treturn; //非初セル&&未確定出次が残っていないなら閉路が発生しているはず\n\t}\n\n\tfor(int i = 0; i < 6; i++){ //配置パネルを走査\n\t\tint adj_row[2],adj_col[2];\n\n\t\tswitch(type_array[i]){\n\t\tcase N_S:\n\n\t\t\tadj_row[0] = row-1;\n\t\t\tadj_col[0] = col;\n\n\t\t\tadj_row[1] = row+1;\n\t\t\tadj_col[1] = col;\n\n\t\t\tbreak;\n\t\tcase W_E:\n\n\t\t\tadj_row[0] = row;\n\t\t\tadj_col[0] = col-1;\n\n\t\t\tadj_row[1] = row;\n\t\t\tadj_col[1] = col+1;\n\n\t\t\tbreak;\n\t\tcase W_S:\n\n\t\t\tadj_row[0] = row;\n\t\t\tadj_col[0] = col-1;\n\n\t\t\tadj_row[1] = row+1;\n\t\t\tadj_col[1] = col;\n\n\t\t\tbreak;\n\t\tcase W_N:\n\n\t\t\tadj_row[0] = row;\n\t\t\tadj_col[0] = col-1;\n\n\t\t\tadj_row[1] = row-1;\n\t\t\tadj_col[1] = col;\n\n\t\t\tbreak;\n\t\tcase N_E:\n\n\t\t\tadj_row[0] = row-1;\n\t\t\tadj_col[0] = col;\n\n\t\t\tadj_row[1] = row;\n\t\t\tadj_col[1] = col+1;\n\n\t\t\tbreak;\n\t\tcase S_E:\n\n\t\t\tadj_row[0] = row+1;\n\t\t\tadj_col[0] = col;\n\n\t\t\tadj_row[1] = row;\n\t\t\tadj_col[1] = col+1;\n\n\t\t\tbreak;\n\t\t}\n\n\t\t//出次先が範囲外または石マスならSKIP\n\t\tif(!rangeCheck(adj_row[0],adj_col[0])||!rangeCheck(adj_row[1],adj_col[1])||\n\t\t\t\t(base_map[adj_row[0]][adj_col[0]] == 1)||(base_map[adj_row[1]][adj_col[1]] == 1))continue;\n\n\n\t\tif(rangeCheck(row-1,col) && check[table[row-1][col]][S] && !check[i][N])continue; //上のS出次を満たせないなら刈る\n\t\tif(rangeCheck(row,col-1) && check[table[row][col-1]][E] && !check[i][W])continue; //左のE出次を満たせないなら刈る\n\n\n\t\tint rest_add = 0; //sum_restに足した分\n\t\tint rest_minus = 0; //sum_restから引いた分\n\t\tbool is_OK = true;\n\n\t\t//パネルの整合性チェック\n\t\tswitch(i){\n\t\tcase N_S: //N_S\n\n\t\t\t//上のパネルのS\n\t\t\tif(!check[table[adj_row[0]][adj_col[0]]][S]){\n\n\t\t\t\tis_OK = false;\n\t\t\t}else{\n\n\t\t\t\t//sum_restは変動なし\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase W_E:\n\n\t\t\t//左のパネルのE\n\t\t\tif(!check[table[adj_row[0]][adj_col[0]]][E]){\n\n\t\t\t\tis_OK = false;\n\t\t\t}else{\n\n\t\t\t\t//sum_restは変動なし\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase W_S:\n\n\t\t\t//左のパネルのE\n\t\t\tif(!check[table[adj_row[0]][adj_col[0]]][E]){\n\n\t\t\t\tis_OK = false;\n\t\t\t}else{\n\n\t\t\t\t//sum_restは変動なし\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase W_N:\n\n\t\t\t//左のパネルのEと上のパネルのS\n\t\t\tif(!check[table[adj_row[0]][adj_col[0]]][E]||!check[table[adj_row[1]][adj_col[1]]][S]){\n\n\t\t\t\tis_OK = false;\n\t\t\t}else{\n\n\t\t\t\tsum_rest -= 2;\n\t\t\t\trest_minus = 2;\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase N_E:\n\n\t\t\t//上のパネルのS\n\t\t\tif(!check[table[adj_row[0]][adj_col[0]]][S]){\n\n\t\t\t\tis_OK = false;\n\t\t\t}else{\n\n\t\t\t\t//sum_restは変動なし\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase S_E: //S_E\n\n\t\t\tsum_rest += 2;\n\t\t\trest_add = 2;\n\n\t\t\tbreak;\n\t\t}\n\n\n\t\tif(!is_OK){\n\n\t\t\tcontinue;\n\t\t}\n\n\t\ttable[row][col] = type_array[i];\n\n\t\trecursive(next_row,next_col);\n\n\t\tsum_rest -= rest_add;\n\t\tsum_rest += rest_minus;\n\t}\n}\n\nvoid func(){\n\n\tV.clear();\n\tfirst_row = -1;\n\n\tfor(int row = 0; row < h; row++){\n\t\tfor(int col = 0; col < w; col++){\n\n\t\t\tscanf(\"%d\",&base_map[row][col]);\n\t\t\tif(base_map[row][col] == 0){\n\n\t\t\t\tV.push_back(LOC(row,col));\n\t\t\t\tif(first_row == -1){\n\t\t\t\t\tfirst_row = row;\n\t\t\t\t\tfirst_col = col;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(V.size() == 0){\n\n\t\tprintf(\"No\\n\");\n\t\treturn;\n\t}\n\n\tsum_rest = 0;\n\tFLG = false;\n\n\tfor(int row = 0; row < h; row++){\n\t\tfor(int col = 0; col < w; col++){\n\n\t\t\ttable[row][col] = UNDEFINED;\n\t\t}\n\t}\n\n\trecursive(0,0);\n\n\tif(FLG){\n\n\t\tprintf(\"Yes\\n\");\n\n\t}else{\n\n\t\tprintf(\"No\\n\");\n\t}\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&w,&h);\n\t\tif(h == 0 && w == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 3068,
"score_of_the_acc": -0.1027,
"final_rank": 4
},
{
"submission_id": "aoj_0236_4474591",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\narray<int, 4> dy{-1, 1, 0, 0}, dx{0, 0, -1, 1};\narray<int, 6> A{3, 5, 6, 9, 10, 12};\nstruct Solution {\n int h, w, cnt;\n vector<vector<int>> G, used;\n Solution(int h, int w) : h(h), w(w), G(h, vector<int>(w, 0)), used(h, vector<int>(w, 0)), cnt(0) {};\n\n void dfs(int y, int x, int &cnt2){\n used[y][x] = 1;\n cnt2++;\n for (int k = 0; k < 4; ++k) {\n if(G[y][x] & (1 << k) && !used[y+dy[k]][x+dx[k]]){\n dfs(y+dy[k], x+dx[k], cnt2);\n }\n }\n }\n bool rec(int y, int x){\n if(y == h){\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n used[i][j] = 0;\n }\n }\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if(G[i][j]){\n int c = 0;\n dfs(i, j, c);\n return c == cnt;\n }\n }\n }\n return false;\n }\n if(!G[y][x]){\n if(y && G[y-1][x] & 2) return false;\n if(x && G[y][x-1] & 8) return false;\n if(rec(y+(x == w-1), (x+1)%w)) return true;\n }else {\n for (int k = 0; k < 6; ++k) {\n if(y && ((G[y-1][x] >> 1)^A[k])&1) continue;\n if(x && ((G[y][x-1] >> 3)^(A[k] >> 2))&1) continue;\n if(!y && A[k]&1) continue;\n if(y == h-1 && A[k]&2) continue;\n if(!x && A[k]&4) continue;\n if(x == w-1 && A[k]&8) continue;\n G[y][x] = A[k];\n if(rec(y+(x == w-1), (x+1)%w)) return true;\n }\n G[y][x] = 1;\n }\n return false;\n }\n};\n\nvoid solve(int w, int h){\n Solution S(h, w);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n cin >> S.G[i][j];\n S.G[i][j] ^= 1;\n S.cnt += S.G[i][j];\n }\n }\n puts((S.rec(0, 0)) ? \"Yes\" : \"No\");\n}\n\nint main() {\n int w, h;\n while(cin >> w >> h, w){\n solve(w, h);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 400,
"memory_kb": 2948,
"score_of_the_acc": -0.0431,
"final_rank": 2
},
{
"submission_id": "aoj_0236_3696814",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nconst int dx[] = {1, -1, 0, 0};\nconst int dy[] = {0, 0, 1, -1};\n\nint H, W, sum;\n\nbool dfs(int x, int y, int sx, int sy, int cnt, vector< vector<int> > °s, vector< vector<int> > &board) {\n if(false) {\n fprintf(stderr, \"x = %d, y = %d, cnt = %d\\n\", x, y, cnt);\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n if(i == x and j == y) fprintf(stderr, \"* \");\n else fprintf(stderr, \"%d \", board[i][j]);\n }\n fprintf(stderr, \"\\n\");\n }\n }\n \n if(x == sx and y == sy) {\n if(cnt != sum) return cnt == 0;\n }\n else if(cnt == 0) return false;\n \n for(int k=0; k<4; k++) {\n int nx = x + dx[k], ny = y + dy[k];\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\n if(board[nx][ny] == 1) continue;\n for(int i=0; i<4; i++) {\n int gx = nx + dx[i], gy = ny + dy[i];\n if(gx < 0 or gx >= H or gy < 0 or gy >= W) continue;\n if(board[gx][gy] == 1) continue;\n degs[gx][gy]--;\n }\n\n bool ok = true;\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n if(board[i][j] == 1) continue;\n {\n int d = abs(sx - i) + abs(sy - j);\n if(d <= 1) continue;\n }\n\n {\n int d = abs(nx - i) + abs(ny - j);\n if(d <= 1) continue;\n }\n\n if(degs[i][j] <= 1) {\n // fprintf(stderr, \"[x = %d, y = %d, nx = %d, ny = %d] false: i = %d, j = %d\\n\", x, y, nx, ny, i, j);\n ok = false;\n i = H, j = W;\n }\n }\n }\n\n if(ok) {\n board[nx][ny] = 1;\n bool b = dfs(nx, ny, sx, sy, cnt - 1, degs, board);\n board[nx][ny] = 0;\n if(b) return true;\n }\n\n for(int i=0; i<4; i++) {\n int gx = nx + dx[i], gy = ny + dy[i];\n if(gx < 0 or gx >= H or gy < 0 or gy >= W) continue;\n if(board[gx][gy] == 1) continue;\n degs[gx][gy]++;\n }\n }\n return false;\n}\n\nint solve_testcase() {\n cin >> W >> H;\n if(W == 0 and H == 0) return 1;\n \n vector< vector<int> > board(H, vector<int>(W));\n vector< vector<int> > degs(H, vector<int>(W));\n \n int cnt = 0, deg0 = 0, deg1 = 0, sx = -1, sy = -1;\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n cin >> board[i][j];\n if(board[i][j] == 0) {\n cnt++;\n sx = i, sy = j;\n }\n }\n }\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n if(board[i][j] == 1) continue;\n int deg = 0;\n for(int k=0; k<4; k++) {\n int x = i + dx[k], y = j + dy[k];\n if(x < 0 or x >= H or y < 0 or y >= W) continue;\n if(board[x][y] == 1) continue;\n deg++;\n }\n degs[i][j] = deg;\n\n if(deg == 0) deg0++;\n if(deg == 1) deg1++;\n }\n }\n\n sum = cnt;\n bool ok = true;\n // ok &= (deg0 == 0 and deg1 == 0);\n // ok &= (cnt > 0 and cnt % 2 == 0);\n cout << (ok && dfs(sx, sy, sx, sy, cnt, degs, board) ? \"Yes\" : \"No\") << endl;\n return 0;\n}\n\nint main() {\n while(!solve_testcase());\n return 0;\n}",
"accuracy": 1,
"time_ms": 4400,
"memory_kb": 3052,
"score_of_the_acc": -1.004,
"final_rank": 8
}
] |
aoj_0245_cpp
|
タイムセール
より良い物を、より安く。今日もどこかのスーパーマーケットで行われるタイムセールでは、激しい闘いが繰り広げられています。ここ会津にある「LL堂」もそんなスーパーマーケットのひとつで、他のチェーン店と対抗すべく、少し変わったタイムセールを実施しています。一般的なタイムセールでは複数の商品が同じ時間に安くなるものですが、LL堂では対象となる商品によって、タイムセールを開始する時間が別々に設定されています。
坂井家はLL堂をよく利用する家庭の一つです。そんな坂井家では、奥様主導のもと、次の日曜に行われるタイムセールに向けて作戦会議を開き、どのような順番で買い物をすれば値引きが最大となるかを分析することになりました。店内を熟知している坂井家は売り場の見取り図を書き、また欲しい品物がどこにあるか、値引きは幾らであるか、売り切れるまでの時間を把握することに成功しました。
ここまでは完璧だった坂井家ですが、分析を行える人がいませんでした。そこで坂井家と親交があったあなたはプログラムを書くことにしました。一人の人が動くことを想定してシミュレーションを行います。
商品は10種類あり、数字1桁の商品番号
g
によって 区別されます。タイムセール情報には商品番号
g
、 値引き額
d
、タイムセールの開始時刻
s
と売り切れ時刻
e
があります。
店内は横
X
、縦
Y
のマスで構成される2次元 グリッドで表され、マスごとに通路、商品棚の どちらかが割り当てられています。一つの商品棚には 1種類の商品があり、それは商品番号
g
で区別されます。
どの商品を買ってもよいですが、同じ商品番号の商品を複数買ってはいけません。商品棚からは、上下左右に隣接する通路のマスならどんな向きでも商品を取れます。
タイムセールが始まる時刻から商品を取ることができますが、売り切れる時刻からは商品を取ることができません。また、時間は入店した時点で0から始まります。
移動は現在いるマスから上下左右の隣接する通路マスに移動することができますが、商品棚のマスに移動することはできません。グリッドで表される店の外に出ることもできません。１回移動する毎に１単位時間経過します。また、商品を取る時間は考えないものとします。
店内の見取り図と買い物をする人の初期位置と商品のタイムセール情報を入力とし、取ることのできた商品の値引き額の合計の最大値を出力するプログラムを作成してください。
入力
複数のデータセットが与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
X
Y
m
1,1
m
2,1
...
m
X,1
m
1,2
m
2,2
...
m
X,2
:
m
1,Y
m
2,Y
...
m
X,Y
n
g
1
d
1
s
1
e
1
g
2
d
2
s
2
e
2
:
g
n
d
n
s
n
e
n
1行目に店舗の大きさ
X
,
Y
(3 ≤
X
,
Y
≤ 20) が与えられます。続く
Y
行に
i
列目
j
行目の店内情報
m
i,j
が以下の内容で与えられます。
. (ピリオド) ：通路のマス
数字 ：商品の番号
P ：買い物をする人の初期位置のマス
続く行にタイムセール情報の数
n
(1 ≤
n
≤ 8) が与えられます。続く
n
行に
i
番目のタイムセール情報
g
i
d
i
s
i
e
i
が与えられます(0 ≤
g
i
≤ 9, 1 ≤
d
i
≤ 10000, 0 ≤
s
i
,
e
i
≤ 100)。
データセットの数は 50 を超えません。
出力
データセットごとに、取ることのできる商品の値引き額合計の最大値を１行に出力します。
入力例
6 5
1 1 . 0 0 4
1 . . . . .
. . 2 2 . .
. . 2 2 3 3
P . . . . .
5
0 50 5 10
1 20 0 10
2 10 5 15
3 150 3 5
4 100 8 9
0 0
出力例
180
|
[
{
"submission_id": "aoj_0245_10846541",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\nint dp[20][20][256],np[20][20][256];\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n for(int H,W;cin>>W>>H,H!=0;){\n vector A(H,vector<char>(W,0));\n rep(i,H)rep(j,W)cin>>A[i][j];\n int N;\n cin>>N;\n vector<array<int,4>> B(10,{-1,-1,-1,-1}),C(N);\n rep(i,N){\n int g,d,s,e;\n cin>>g>>d>>s>>e;\n B[g]={g,d,s,e};\n C[i]={g,d,s,e};\n }\n sort(all(C));\n int sy,sx;\n rep(i,H)rep(j,W)if(A[i][j]=='P') sy=i,sx=j,A[i][j]='.';\n rep(i,H)rep(j,W){\n if(A[i][j]!='.'){\n if(B[A[i][j]-'0'][1]==-1) A[i][j]='.';\n else{\n A[i][j]=(char)('0'+(lower_bound(all(C), array<int,4>{A[i][j]-'0', 0, 0, 0})-C.begin()));\n }\n }\n }\n rep(i,H)rep(j,W)rep(k,1<<N) dp[i][j][k]=0;\n dp[sy][sx][0]=1;\n vector<int> dd={0,1,0,-1,0};\n rep(t,101){\n rep(i,H)rep(j,W)rep(k,1<<N) np[i][j][k]=0;\n\n for(int k=(1<<N);k--;) rep(i,H)rep(j,W){\n rep(l,4){\n int y=i+dd[l];\n int x=j+dd[l+1];\n if(y<0||H<=y||x<0||W<=x) continue;\n if(A[y][x]!='.'){\n auto [g,d,s,e]=B[A[y][x]-'0'];\n if(d==-1) continue;\n if(t<s||e<=t) continue;\n dp[i][j][k|(1<<(A[y][x]-'0'))]|=dp[i][j][k];\n }\n }\n }\n for(int k=(1<<N);k--;) rep(i,H)rep(j,W){\n np[i][j][k]|=dp[i][j][k];\n rep(l,4){\n int y=i+dd[l];\n int x=j+dd[l+1];\n if(y<0||H<=y||x<0||W<=x) continue;\n if(A[y][x]=='.'){\n np[y][x][k]|=dp[i][j][k];\n }\n }\n }\n swap(dp, np);\n }\n int ans=0;\n rep(k,1<<N){\n int b=0;\n rep(i,H)rep(j,W)b|=dp[i][j][k];\n if(!b) continue;\n int wa=0;\n rep(i,N) if((k>>i)&1) wa+=B[i][1];\n chmax(ans, wa);\n }\n cout<<ans<<\"\\n\";\n }\n\n}",
"accuracy": 1,
"time_ms": 660,
"memory_kb": 4352,
"score_of_the_acc": -0.1687,
"final_rank": 6
},
{
"submission_id": "aoj_0245_5854309",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<unordered_set>\n#include<unordered_map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\n#include<complex>\n#include<cassert>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\nconstexpr int mod=1e9+7;\nconstexpr int Mod=998244353;\nconstexpr int inf=mod;\nconstexpr ll linf=(ll)mod*mod;\nstruct fastio{\n\tfastio(){\n\t\tcin.tie(0);\n\t\tios::sync_with_stdio(0);\n\t\tcout<<fixed<<setprecision(20);\n\t};\n}fio;\ntemplate<class T>\nbool chmax(T&a,const T&b){\n\tif(a<b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\ntemplate<class T>\nbool chmin(T&a,const T&b){\n\tif(a>b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\ntypedef pair<int,int>P;\nconstexpr int dx[]={1,0,0,-1},dy[]={0,1,-1,0};\nint dist[20][20][1024];\nint main(){\n\tint h,w;\n\twhile(cin>>w>>h,h){\n\t\tchar m[20][20];\n\t\tint sx,sy,n,g,d[10]={},s[10]={},e[10]={};\n\t\tfor(int i=0;i<h;i++){\n\t\t\tfor(int j=0;j<w;j++){\n\t\t\t\tcin>>m[i][j];\n\t\t\t\tif(m[i][j]=='P'){\n\t\t\t\t\tsx=i;\n\t\t\t\t\tsy=j;\n\t\t\t\t\tm[i][j]='.';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin>>n;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>g;\n\t\t\tcin>>d[g]>>s[g]>>e[g];\n\t\t\tif(s[g]==e[g])\n\t\t\t\te[g]=0;\n\t\t}\n\t\tfor(int i=0;i<h;i++)\n\t\t\tfor(int j=0;j<w;j++)\n\t\t\t\tfor(int S=0;S<1<<10;S++)\n\t\t\t\t\tdist[i][j][S]=inf;\n\t\tdist[sx][sy][0]=0;\n\t\tpriority_queue<P,vector<P>,greater<>>que;\n\t\tque.push({0,sx*w+sy<<10});\n\t\tint ans=0;\n\t\twhile(!que.empty()){\n\t\t\tP p=que.top();\n\t\t\tque.pop();\n\t\t\tint x=(p.second>>10)/w,y=(p.second>>10)%w,S=p.second&(1<<10)-1;\n\t\t\tif(dist[x][y][S]<p.first)\n\t\t\t\tcontinue;\n\t\t\tint tmp=0;\n\t\t\tfor(int i=0;i<10;i++)\n\t\t\t\tif(S>>i&1)\n\t\t\t\t\ttmp+=d[i];\n\t\t\tchmax(ans,tmp);\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tint nx=x+dx[i],ny=y+dy[i];\n\t\t\t\tif(0<=nx&&nx<h&&0<=ny&&ny<w){\n\t\t\t\t\tif(m[nx][ny]=='.'){\n\t\t\t\t\t\tif(dist[nx][ny][S]>dist[x][y][S]+1){\n\t\t\t\t\t\t\tdist[nx][ny][S]=dist[x][y][S]+1;\n\t\t\t\t\t\t\tque.push({dist[nx][ny][S],nx*w+ny<<10|S});\n\t\t\t\t\t\t}\n\t\t\t\t\t} else{\n\t\t\t\t\t\tint g=m[nx][ny]-'0';\n\t\t\t\t\t\tif(e[g]<=dist[x][y][S])\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tif(dist[x][y][S|1<<g]>max(dist[x][y][S],s[g])){\n\t\t\t\t\t\t\tdist[x][y][S|1<<g]=max(dist[x][y][S],s[g]);\n\t\t\t\t\t\t\tque.push({dist[x][y][S|1<<g],x*w+y<<10|S|1<<g});\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\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5188,
"score_of_the_acc": -0.0379,
"final_rank": 4
},
{
"submission_id": "aoj_0245_4908181",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint H,W;\nchar m[20][20];\nint dp[2][20][20][1<<10];\nint N,D[10],S[10],E[10];\nint d[5]={0,1,0,-1};\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tint now=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tcin>>m[i][j];\n\t\t\tfor(int k=0;k<1<<10;k++)dp[now][i][j][k]=-1;\n\t\t\tif(m[i][j]=='P')dp[now][i][j][0]=0;\n\t\t}\n\t\tcin>>N;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint g;cin>>g;\n\t\t\tcin>>D[g]>>S[g]>>E[g];\n\t\t}\n\t\tint ans=0;\n\t\tfor(int tm=0;tm<100;tm++)\n\t\t{\n\t\t\tint nxt=1-now;\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)for(int k=0;k<1<<10;k++)dp[nxt][i][j][k]=-1;\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)for(int k=0;k<1<<10;k++)\n\t\t\t{\n\t\t\t\tint cost=dp[now][i][j][k];\n\t\t\t\tif(cost<0)continue;\n\t\t\t\tint nk=k;\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint x=i+d[r],y=j+d[r+1];\n\t\t\t\t\tif(x>=0&&y>=0&&x<H&&y<W&&'0'<=m[x][y]&&m[x][y]<='9')\n\t\t\t\t\t{\n\t\t\t\t\t\tint id=m[x][y]-'0';\n\t\t\t\t\t\tif(S[id]<=tm&&tm<E[id]&&~nk>>id&1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tnk|=1<<id;\n\t\t\t\t\t\t\tcost+=D[id];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(ans<cost)ans=cost;\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint x=i+d[r],y=j+d[r+1];\n\t\t\t\t\tif(x>=0&&y>=0&&x<H&&y<W&&!('0'<=m[x][y]&&m[x][y]<='9'))\n\t\t\t\t\t{\n\t\t\t\t\t\tdp[nxt][x][y][nk]=max(dp[nxt][x][y][nk],cost);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tnow=nxt;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 6272,
"score_of_the_acc": -0.1834,
"final_rank": 7
},
{
"submission_id": "aoj_0245_4387181",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n#include <assert.h>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nbool dp[2][20][20][1 << 10];\n\nint main() {\n int h, w;\n array<int, 5> dy{-1, 1, 0, 0, 0}, dx{0, 0, -1, 1, 0};\n while(cin >> w >> h, w){\n vector<vector<int>> grid(h+2, vector<int>(w+2, -1));\n int sy = 0, sx = 0;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n char c; cin >> c;\n if(c == 'P') sy = i, sx = j, grid[i+1][j+1] = 0;\n else if(c == '.') grid[i+1][j+1] = 0;\n else grid[i+1][j+1] = 1+(c-'0');\n }\n }\n int n;\n cin >> n;\n vector<int> gs(n), ds(n), ss(n), es(n);\n int M = 110;\n vector<int> id(11, -1);\n for (int i = 0; i < n; ++i) {\n cin >> gs[i] >> ds[i] >> ss[i] >> es[i];\n assert(id[gs[i]+1] == -1);\n id[gs[i]+1] = i;\n }\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k < 1 << n; ++k) {\n dp[0][i][j][k] = 0;\n }\n }\n }\n dp[0][sy][sx][0] = 1;\n for (int i = 0; i < M; ++i) {\n int now = i&1, nxt = now^1;\n for (int j = 0; j < h; ++j) {\n for (int k = 0; k < w; ++k) {\n for (int l = 0; l < 1 << n; ++l) {\n dp[nxt][j][k][l] = 0;\n }\n }\n }\n for (int j = 0; j < h; ++j) {\n for (int k = 0; k < w; ++k) {\n for (int d = 0; d < 5; ++d) {\n if(grid[j+1+dy[d]][k+1+dx[d]]) continue;\n for (int l = 0; l < (1 << n); ++l) {\n if(!dp[now][j][k][l]) continue;\n int l2 = l;\n for (int dd = 0; dd < 4; ++dd) {\n if(!~grid[j+1+dy[dd]][k+1+dx[dd]] || !~id[grid[j+1+dy[dd]][k+1+dx[dd]]]) continue;\n int m = id[grid[j+1+dy[dd]][k+1+dx[dd]]];\n if(!(l2 & (1 << m)) && ss[m] <= i && i < es[m]) {\n l2 |= (1 << m);\n }\n }\n dp[nxt][j+dy[d]][k+dx[d]][l2] = 1;\n }\n }\n }\n }\n }\n int ans = 0;\n for (int j = 0; j < h; ++j) {\n for (int k = 0; k < w; ++k) {\n for (int l = 0; l < (1 << n); ++l) {\n if(!dp[M&1][j][k][l]) continue;\n int val = 0;\n for (int m = 0; m < n; ++m) {\n if(l & (1 << m)) val += ds[m];\n }\n ans = max(ans, val);\n }\n }\n }\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 3852,
"score_of_the_acc": -0.0909,
"final_rank": 5
},
{
"submission_id": "aoj_0245_3217753",
"code_snippet": "// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nchar board[30][30];\nint H, W, disc[10][105], rec[20][20][105][1 << 8];\n\nstruct Elem {\n int x, y, time, bit, cost;\n bool operator<(const Elem &e) const {\n return cost < e.cost;\n }\n};\n \nsigned main() {\n while(cin >> W >> H, H || W) {\n memset(disc, 0, sizeof(disc));\n memset(rec, -1, sizeof(rec));\n int sx = -1, sy = -1;\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n cin >> board[i][j];\n if(board[i][j] == 'P') sx = i, sy = j;\n }\n }\n\n int N, lim = 0, ans = 0; cin >> N;\n vector<int> comp(10, -1);\n for(int i=0; i<N; i++) {\n int g, d, s, e; cin >> g >> d >> s >> e;\n comp[g]++;\n chmax(lim, e + 1);\n for(int k=s; k<e; k++) {\n chmax(disc[g][k], d);\n }\n }\n\n // ざあつ\n int id = 0;\n for(auto &x : comp) {\n if(x >= 0) x = id++;\n }\n vector<int> inv(id);\n for(int i=0; i<10; i++) {\n if(comp[i] < 0) continue;\n inv[ comp[i] ] = i;\n }\n\n // cand の部分集合\n vector< vector<int> > sum(1 << id, vector<int>(lim));\n for(int bit=0; bit<(1<<id); bit++) {\n for(int i=0; i<id; i++) {\n if(bit >> i & 1) {\n int orig_id = inv[i];\n for(int t=0; t<lim; t++) {\n sum[bit][t] += disc[orig_id][t];\n }\n }\n }\n }\n\n priority_queue<Elem> que;\n que.push(Elem{sx, sy, 0, 0, 0});\n rec[sx][sy][0][0] = 0;\n\n while(que.size()) {\n Elem cur = que.top(); que.pop();\n int x = cur.x, y = cur.y, bit = cur.bit, time = cur.time, cost = cur.cost;\n chmax(ans, cost);\n if(cost < rec[x][y][time][bit] || time >= lim) continue;\n\n // 商品を取る\n int cand = 0;\n for(int k=0; k<4; k++) {\n int mx = x + dx[k], my = y + dy[k];\n if(!(mx < 0 || mx >= H || my < 0 || my >= W) and ('0' <= board[mx][my] && board[mx][my] <= '9')) {\n int c = comp[ board[mx][my] - '0' ]; // 圧縮する\n if(bit >> c & 1) continue;\n cand |= (1 << c);\n }\n }\n\n for(int mask=cand; mask>=0; mask=(mask-1)&cand) {\n int nbit = bit | mask;\n int ncost = cost + sum[mask][time];\n\n // 移動先\n for(int k=0; k<4; k++) {\n int nx = x + dx[k], ny = y + dy[k], ntime = time + 1;\n if(!(nx < 0 || nx >= H || ny < 0 || ny >= W) and !('0' <= board[nx][ny] && board[nx][ny] <= '9') and (rec[nx][ny][ntime][nbit] < ncost)) {\n rec[nx][ny][ntime][nbit] = ncost;\n que.push(Elem{nx, ny, ntime, nbit, ncost});\n }\n }\n\n if(mask == 0) break;\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 4580,
"memory_kb": 92248,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_0245_2924464",
"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\nbool check(const vector<vector<pair<int, int>>>&humans, int x, int y) {\n\tfor (int i = 0; i < 4; ++i) {\n\t\tauto it=find(humans[i].begin(),humans[i].end(),make_pair(x,y));\n\t\tif(it!=humans[i].end())return false;\n\t}\n\treturn true;\n}\nint dx[] = { -1,0,1,0,0 };\nint dy[] = { 0,1,0,-1,0 };\n\ntemplate<typename T> struct Compress {\n\tmap<T, int>mp;\n\tmap<int, T>revmp;\n\n\tCompress(vector<T>vs) {\n\t\tsetmp(vs);\n\t}\n\n\tCompress() :mp(), revmp() {\n\n\t}\n\tvoid setmp(vector<T>vs) {\n\t\tsort(vs.begin(), vs.end());\n\t\tvs.erase(unique(vs.begin(), vs.end()), vs.end());\n\t\tfor (int i = 0; i < static_cast<int>(vs.size()); ++i) {\n\t\t\tmp[vs[i]] = i;\n\t\t\trevmp[i] = vs[i];\n\t\t}\n\t}\n\n};\nstruct sale {\n\tint id;\n\tint d;\n\tint s;\n\tint e;\n};\n\nstruct aa {\n\tint flag;\n\tint x;\n\tint y;\n\tint cost;\n};\n\n\nint main()\n{\n\twhile (true) {\n\t\tint W,H;cin>>W>>H;\n\t\tif(!W)break;\n\t\tvector<vector<int>>field(H,vector<int>(W,-1));\n\t\tvector<sale>aas;\n\t\tint sx,sy;\n\t\t{\n\t\t\tfor (int i = 0; i < H; ++i) {\n\t\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\t\tchar ch;cin>>ch;\n\t\t\t\t\tif (ch == '.') {\n\n\t\t\t\t\t}\n\t\t\t\t\telse if (ch == 'P') {\n\t\t\t\t\t\tsx = j;\n\t\t\t\t\t\tsy = i;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tassert(isdigit(ch));\n\t\t\t\t\t\tfield[i][j] = ch - '0';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint N; cin >> N;\n\t\t\tCompress<int> comp;\n\n\t\t\tvector<int>v;\n\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tint g, d, s, e; cin >> g >> d >> s >> e;\n\t\t\t\tv.push_back(g);\n\t\t\t\taas.push_back(sale{ g,d,s,e });\n\t\t\t}\n\t\t\tcomp.setmp(v);\n\t\t\tfor (auto & line : field) {\n\t\t\t\tfor (auto&n : line) {\n\t\t\t\t\tif (n >= 0) {\n\t\t\t\t\t\tif (comp.mp.find(n) != comp.mp.end()) {\n\t\t\t\t\t\t\tn = comp.mp[n];\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tn=-3;\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\tvector<sale>real_aas(comp.mp.size(), sale{ -1,0,0,0 });\n\t\t\tfor (auto aaa : aas) {\n\t\t\t\treal_aas[comp.mp[aaa.id]]=(sale{ aaa.id,aaa.d,aaa.s,aaa.e });\n\t\t\t}\n\t\t\taas=real_aas;\n\t\t}\n\t\tvector<vector<vector<int>>>memo(H,vector<vector<int>>(W,vector<int>(1<<aas.size(),-1e9)));\n\t\tmemo[sy][sx][0]=0;\n\n\t\tfor (int time = 0; time < 110; ++time) {\n\n\t\t\tvector<vector<vector<int>>>next_memo(H, vector<vector<int>>(W, vector<int>(1 << aas.size(), -1e9)));\n\t\t\tfor (int y = 0; y < H; ++y) {\n\t\t\t\tfor (int x = 0; x < W; ++x) {\n\t\t\t\t\tfor (int flag = 0; flag < (1 << aas.size()); ++flag) {\n\n\t\t\t\t\t\tfor (int way = 0; way < 4; ++way) {\n\t\t\t\t\t\t\tconst int next_y=y+dy[way];\n\t\t\t\t\t\t\tconst int next_x=x+dx[way];\n\t\t\t\t\t\t\tif(next_x<0||W<=next_x||next_y<0||H<=next_y)continue;\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tconst int k=field[next_y][next_x];\n\t\t\t\t\t\t\t\tif (k >= 0&&(flag&(1<<k))==0) {\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tsale asale(aas[k]);\n\t\t\t\t\t\t\t\t\tif (asale.s <= time&&time < asale.e) {\n\t\t\t\t\t\t\t\t\t\tmemo[y][x][flag|(1<<k)]=max(memo[y][x][flag|(1<<k)],memo[y][x][flag]+asale.d);\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\n\t\t\t\t\t\tfor (int way = 0; way < 5; ++way) {\n\t\t\t\t\t\t\tconst int next_y = y + dy[way];\n\t\t\t\t\t\t\tconst int next_x = x + dx[way];\n\t\t\t\t\t\t\tif (next_x<0 || W <= next_x || next_y<0 || H <= next_y)continue;\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tconst int k = field[next_y][next_x];\n\t\t\t\t\t\t\t\tif (k == -1) {\n\t\t\t\t\t\t\t\t\tnext_memo[next_y][next_x][flag]=max(next_memo[next_y][next_x][flag],memo[y][x][flag]);\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}\n\t\t\tmemo=next_memo;\n\t\t}\n\t\tint ans=0;\n\t\tfor (int y = 0; y < H; ++y) {\n\t\t\tfor (int x = 0; x < W; ++x) {\n\t\t\t\tfor (int flag = 0; flag < (1 << aas.size()); ++flag) {\n\t\t\t\t\tans=max(ans,memo[y][x][flag]);\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\t\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 1070,
"memory_kb": 3784,
"score_of_the_acc": -0.2521,
"final_rank": 9
},
{
"submission_id": "aoj_0245_2562424",
"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 Cell{\n\tCell(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tbool operator<(const struct Cell &arg) const{\n\t\tif(row != arg.row){\n\t\t\treturn row < arg.row;\n\t\t}else{\n\t\t\treturn col < arg.col;\n\t\t}\n\t};\n\tint row,col;\n};\n\nstruct Info{\n\tint discount,start,end;\n};\n\nstruct Data{\n\tData(int arg_row,int arg_col,int arg_total_dist){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\ttotal_dist = arg_total_dist;\n\t}\n\n\tint row,col,total_dist;\n};\n\nstruct SALE{\n\tSALE(){\n\t\tstate = time = row = col = sum_discount = 0;\n\t}\n\n\tSALE(int arg_state,int arg_time,int arg_row,int arg_col,int arg_sum_discount){\n\t\tstate = arg_state;\n\t\ttime = arg_time;\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tsum_discount = arg_sum_discount;\n\t}\n\n\tint state,time,row,col,sum_discount;\n};\n\nint W,H;\nint POW[11];\nint dp[1024][20][20];\nInfo info[10];\nbool is_sale[10];\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\n\nchar base_map[20][21];\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\n\n\nvoid func(){\n\n\tchar buf[2];\n\n\tint start_row,start_col;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tscanf(\"%s\",buf);\n\t\t\tbase_map[row][col] = buf[0];\n\t\t\tif(buf[0] == 'P'){\n\t\t\t\tbase_map[row][col] = '.';\n\t\t\t\tstart_row = row;\n\t\t\t\tstart_col = col;\n\t\t\t}\n\t\t}\n\t}\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tint g,d,s,e;\n\n\tfor(int i = 0; i < 10; i++)is_sale[i] = false;\n\n\tfor(int loop = 0; loop < N; loop++){\n\t\tscanf(\"%d %d %d %d\",&g,&d,&s,&e);\n\n\t\tinfo[g].discount = d;\n\t\tinfo[g].start = s;\n\t\tinfo[g].end = e;\n\n\t\tis_sale[g] = true;\n\t}\n\n\tint limit = POW[10];\n\n\tfor(int state = 0; state < limit; state++){\n\t\tfor(int row = 0; row < H; row++){\n\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\tdp[state][row][col] = -1;\n\t\t\t}\n\t\t}\n\t}\n\n\tqueue<SALE> Q;\n\n\tdp[0][start_row][start_col] = 0;\n\n\tSALE first;\n\tfirst.row = start_row;\n\tfirst.col = start_col;\n\tfirst.state = 0;\n\tfirst.sum_discount = 0;\n\tfirst.time = 0;\n\n\tQ.push(first);\n\tint max_value = 0;\n\n\twhile(!Q.empty()){\n\n\t\tmax_value = max(max_value,Q.front().sum_discount);\n\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tint adj_row = Q.front().row + diff_row[i];\n\t\t\tint adj_col = Q.front().col + diff_col[i];\n\n\t\t\tif(rangeCheck(adj_row,adj_col) == false)continue;\n\n\t\t\tif(base_map[adj_row][adj_col] == '.'){\n\n\t\t\t\tif(dp[Q.front().state][adj_row][adj_col] < Q.front().sum_discount){\n\t\t\t\t\tdp[Q.front().state][adj_row][adj_col] = Q.front().sum_discount;\n\n\t\t\t\t\tSALE next_sale;\n\t\t\t\t\tnext_sale.row = adj_row;\n\t\t\t\t\tnext_sale.col = adj_col;\n\t\t\t\t\tnext_sale.state = Q.front().state;\n\t\t\t\t\tnext_sale.sum_discount = Q.front().sum_discount;\n\t\t\t\t\tnext_sale.time = Q.front().time+1;\n\n\t\t\t\t\tQ.push(next_sale);\n\t\t\t\t}\n\t\t\t}else if(base_map[adj_row][adj_col] >= '0' && base_map[adj_row][adj_col] <= '9'){\n\n\t\t\t\tint adj_item = base_map[adj_row][adj_col]-'0';\n\n\t\t\t\tif(Q.front().state & (1 << adj_item))continue;\n\t\t\t\tif(is_sale[adj_item] == false)continue;\n\n\t\t\t\tint next_state = Q.front().state + POW[adj_item];\n\n\t\t\t\tif(Q.front().time >= info[adj_item].start && Q.front().time < info[adj_item].end){\n\n\t\t\t\t\tif(dp[next_state][Q.front().row][Q.front().col] < Q.front().sum_discount+info[adj_item].discount){\n\n\t\t\t\t\t\tdp[next_state][Q.front().row][Q.front().col] = Q.front().sum_discount+info[adj_item].discount;\n\n\t\t\t\t\t\tSALE next_sale;\n\t\t\t\t\t\tnext_sale.row = Q.front().row;\n\t\t\t\t\t\tnext_sale.col = Q.front().col;\n\t\t\t\t\t\tnext_sale.state = next_state;\n\t\t\t\t\t\tnext_sale.sum_discount = Q.front().sum_discount+info[adj_item].discount;\n\t\t\t\t\t\tnext_sale.time = Q.front().time;\n\n\t\t\t\t\t\tQ.push(next_sale);\n\n\t\t\t\t\t}\n\n\t\t\t\t}else if(Q.front().time < info[adj_item].start){\n\n\t\t\t\t\tSALE next_sale;\n\t\t\t\t\tnext_sale.row = Q.front().row;\n\t\t\t\t\tnext_sale.col = Q.front().col;\n\t\t\t\t\tnext_sale.state = Q.front().state;\n\t\t\t\t\tnext_sale.sum_discount = Q.front().sum_discount;\n\t\t\t\t\tnext_sale.time = info[adj_item].start;\n\n\t\t\t\t\tQ.push(next_sale);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tQ.pop();\n\t}\n\n\tprintf(\"%d\\n\",max_value);\n}\n\n\nint main(){\n\n\tfor(int i = 0; i <= 10; i++)POW[i] = pow(2,i);\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": 10,
"memory_kb": 5136,
"score_of_the_acc": -0.0351,
"final_rank": 3
},
{
"submission_id": "aoj_0245_2562421",
"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 Cell{\n\tCell(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tbool operator<(const struct Cell &arg) const{\n\t\tif(row != arg.row){\n\t\t\treturn row < arg.row;\n\t\t}else{\n\t\t\treturn col < arg.col;\n\t\t}\n\t};\n\tint row,col;\n};\n\nstruct Info{\n\tint discount,start,end;\n};\n\nstruct Data{\n\tData(int arg_row,int arg_col,int arg_total_dist){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\ttotal_dist = arg_total_dist;\n\t}\n\n\tint row,col,total_dist;\n};\n\nstruct SALE{\n\tSALE(){\n\t\tstate = time = row = col = sum_discount = 0;\n\t}\n\n\tSALE(int arg_state,int arg_time,int arg_row,int arg_col,int arg_sum_discount){\n\t\tstate = arg_state;\n\t\ttime = arg_time;\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tsum_discount = arg_sum_discount;\n\t}\n\n\tint state,time,row,col,sum_discount;\n};\n\nint W,H;\nint POW[11];\nint dp[1024][20][20];\nInfo info[10];\nbool is_sale[10];\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\n\nchar base_map[20][21];\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\n\n\nvoid func(){\n\n\tchar buf[2];\n\n\tint start_row,start_col;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tscanf(\"%s\",buf);\n\t\t\tbase_map[row][col] = buf[0];\n\t\t\tif(buf[0] == 'P'){\n\t\t\t\tbase_map[row][col] = '.';\n\t\t\t\tstart_row = row;\n\t\t\t\tstart_col = col;\n\t\t\t}\n\t\t}\n\t}\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tint g,d,s,e;\n\n\tfor(int i = 0; i < 10; i++)is_sale[i] = false;\n\n\tfor(int loop = 0; loop < N; loop++){\n\t\tscanf(\"%d %d %d %d\",&g,&d,&s,&e);\n\n\t\tinfo[g].discount = d;\n\t\tinfo[g].start = s;\n\t\tinfo[g].end = e;\n\n\t\tis_sale[g] = true;\n\t}\n\n\tint limit = POW[10];\n\n\tfor(int state = 0; state < limit; state++){\n\t\tfor(int row = 0; row < H; row++){\n\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\t//dp[state][row][col] = BIG_NUM; //????????????????????????\n\t\t\t\tdp[state][row][col] = -1;\n\t\t\t}\n\t\t}\n\t}\n\n\tqueue<SALE> Q;\n\n\tdp[0][start_row][start_col] = 0;\n\n\tSALE first;\n\tfirst.row = start_row;\n\tfirst.col = start_col;\n\tfirst.state = 0;\n\tfirst.sum_discount = 0;\n\tfirst.time = 0;\n\n\tQ.push(first);\n\tint max_value = 0;\n\n\twhile(!Q.empty()){\n\n\t\t//printf(\"row:%d col:%d time:%d sum:%d state:%d\\n\",Q.front().row,Q.front().col,Q.front().time,Q.front().sum_discount,Q.front().state);\n\n\t\tmax_value = max(max_value,Q.front().sum_discount);\n\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tint adj_row = Q.front().row + diff_row[i];\n\t\t\tint adj_col = Q.front().col + diff_col[i];\n\n\t\t\tif(rangeCheck(adj_row,adj_col) == false)continue;\n\n\t\t\tif(base_map[adj_row][adj_col] == '.'){ //???????????´???\n\n\t\t\t\tif(dp[Q.front().state][adj_row][adj_col] < Q.front().sum_discount){\n\t\t\t\t\tdp[Q.front().state][adj_row][adj_col] = Q.front().sum_discount;\n\n\t\t\t\t\tSALE next_sale;\n\t\t\t\t\tnext_sale.row = adj_row;\n\t\t\t\t\tnext_sale.col = adj_col;\n\t\t\t\t\tnext_sale.state = Q.front().state;\n\t\t\t\t\tnext_sale.sum_discount = Q.front().sum_discount;\n\t\t\t\t\tnext_sale.time = Q.front().time+1;\n\n\t\t\t\t\t//printf(\"?????? row:%d col:%d?????????%d state:%d??§????§?\\n\",adj_row,adj_col,Q.front().time+1,Q.front().state);\n\n\t\t\t\t\tQ.push(next_sale);\n\t\t\t\t}\n\t\t\t}else if(base_map[adj_row][adj_col] >= '0' && base_map[adj_row][adj_col] <= '9'){\n\n\t\t\t\tint adj_item = base_map[adj_row][adj_col]-'0';\n\n\t\t\t\tif(Q.front().state & (1 << adj_item))continue;\n\t\t\t\tif(is_sale[adj_item] == false)continue;\n\n\t\t\t\tint next_state = Q.front().state + POW[adj_item];\n\n\t\t\t\tif(Q.front().time >= info[adj_item].start && Q.front().time < info[adj_item].end){ //??????????§??????????????????§?????????????????????\n\n\t\t\t\t\tif(dp[next_state][Q.front().row][Q.front().col] < Q.front().sum_discount+info[adj_item].discount){\n\n\t\t\t\t\t\tdp[next_state][Q.front().row][Q.front().col] = Q.front().sum_discount+info[adj_item].discount;\n\n\t\t\t\t\t\tSALE next_sale;\n\t\t\t\t\t\tnext_sale.row = Q.front().row;\n\t\t\t\t\t\tnext_sale.col = Q.front().col;\n\t\t\t\t\t\tnext_sale.state = next_state;\n\t\t\t\t\t\tnext_sale.sum_discount = Q.front().sum_discount+info[adj_item].discount;\n\t\t\t\t\t\tnext_sale.time = Q.front().time;\n\n\t\t\t\t\t\t//printf(\"?????? row:%d col:%d?????????%d state:%d??§????§?\\n\",adj_row,adj_col,Q.front().time+1,Q.front().state);\n\n\t\t\t\t\t\tQ.push(next_sale);\n\n\t\t\t\t\t}\n\n\t\t\t\t}else if(Q.front().time < info[adj_item].start){\n\n\t\t\t\t\t/*if(dp[next_state][Q.front().row][Q.front().col] < Q.front().sum_discount+info[adj_item].discount){\n\n\t\t\t\t\t\tdp[next_state][Q.front().row][Q.front().col] = Q.front().sum_discount+info[adj_item].discount;*/\n\t\t\t\t\t\tSALE next_sale;\n\t\t\t\t\t\tnext_sale.row = Q.front().row;\n\t\t\t\t\t\tnext_sale.col = Q.front().col;\n\t\t\t\t\t\tnext_sale.state = Q.front().state;\n\t\t\t\t\t\tnext_sale.sum_discount = Q.front().sum_discount;\n\t\t\t\t\t\tnext_sale.time = info[adj_item].start;\n\n\t\t\t\t\t\t//printf(\"?????\\?????? row:%d col:%d?????????%d state:%d??§????§?\\n\",adj_row,adj_col,Q.front().time+1,Q.front().state);\n\n\t\t\t\t\t\tQ.push(next_sale);\n\t\t\t\t\t//}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tQ.pop();\n\t}\n\n\tprintf(\"%d\\n\",max_value);\n}\n\n\nint main(){\n\n\tfor(int i = 0; i <= 10; i++)POW[i] = pow(2,i);\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": 10,
"memory_kb": 5076,
"score_of_the_acc": -0.0345,
"final_rank": 2
},
{
"submission_id": "aoj_0245_2457026",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0 ; i < (int)(n) ; i++)\nstatic const int INF = (1 << 29);\nstatic const int dx[] = {1,-1,0,0};\nstatic const int dy[] = {0,0,1,-1};\n\nstruct State{\n int x,y,t,sum,unvisit;\n State(int x, int y, int t, int s, int v):x(x),y(y),t(t),sum(s),unvisit(v){};\n};\n\nstruct Goods{\n int price,s,e;\n Goods(){}\n Goods(int p, int s, int e):price(p),s(s),e(e){};\n};\n\nint h,w,n;\nint sx,sy;\nint G[20][20];\nGoods goods[10];\nbool visited[20][20][(1 << 10)][101];\n\nint bfs(){\n memset(visited,false,sizeof(visited)); int ans = 0;\n queue<State> q;\n q.push(State(sx, sy, 0, 0, (1<<10)-1));\n\n while(!q.empty()){\n State s = q.front(); q.pop();\n if(s.t > 100)continue;\n if(visited[s.x][s.y][s.unvisit][s.t])continue;\n visited[s.x][s.y][s.unvisit][s.t] = true;\n ans = max(ans, s.sum);\n rep(k,4){\n \t int nx = s.x + dx[k];int ny = s.y + dy[k];\n \t if(0<=nx&&nx<h && 0<=ny&&ny<w && G[nx][ny]!=-1){\n\t int num = G[nx][ny];\n\t if((s.unvisit >> num) & 1){\n\t if(goods[num].s <= s.t && s.t < goods[num].e){\n\t\t s.sum += goods[num].price;\n\t\t s.unvisit = s.unvisit & ~(1 << num);\n\t }\n\t }\n\t }\n }\n\n rep(k,4){\n\t int nx = s.x + dx[k]; int ny = s.y + dy[k];\n\t if(0<=nx&&nx<h && 0<=ny&&ny<w && G[nx][ny]==-1){\n\t q.push(State(nx, ny, s.t+1, s.sum, s.unvisit));\n\t }\n }\n }\n return ans;\n}\n\nvoid input(){\n rep(i,h){rep(j,w){char c;cin >> c;\n\t if(c=='P'){sx = i;sy = j;G[i][j] = -1;}\n\t else if(c=='.')G[i][j] = -1; else G[i][j] = (int)(c - '0');}\n }\n cin >> n;\n rep(i,n){int g,d,s,e; cin >> g >> d >> s >> e;\n goods[g] = Goods(d,s,e);\n }\n}\n\nint main(){\n while(cin >> w >> h){\n if(w==0 && h==0)break;\n input();\n cout << bfs() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 45452,
"score_of_the_acc": -0.5429,
"final_rank": 15
},
{
"submission_id": "aoj_0245_1852766",
"code_snippet": "#include <iostream>\n#include <cstring>\n#include <vector>\n\nusing namespace std;\n\n#define MAX_H 20\n#define MAX_W 20\n#define MAX_T 150\n\nstruct Data{\n int n,c,s,t;\n Data(){}\n Data(int n,int c,int s,int t) :\n n(n),c(c),s(s),t(t) {}\n\n bool operator < (const Data &d)const{\n return n < d.n;\n }\n};\n\nint H,W,LIMIT;\nint memo[MAX_H][MAX_W][MAX_T][1<<8];\nvector<Data> v;\nchar field[MAX_H][MAX_W];\nconst int dx[] = {-1,0,1,0};\nconst int dy[] = {0,-1,0,1};\n\nbool inField(int x,int y){\n return (0 <= x && x < W && 0 <= y && y < H);\n}\n\nbool check(int nt,int idx){\n return (v[idx].s <= nt && nt < v[idx].t);\n}\n\nint solve(int x,int y,int t,int p){\n if(t == LIMIT) return 0;\n int &res = memo[x][y][t][p];\n if(res != -1) return res;\n int S = p,cost = 0;\n for(int i = 0 ; i < 4 ; i++){\n int nx = x + dx[i];\n int ny = y + dy[i];\n if(!inField(nx,ny)) continue;\n if(field[ny][nx] == '.') continue;\n int x = field[ny][nx]-'0';\n if(S >> x & 1) continue;\n if(check(t,x)){\n S |= (1<<x);\n cost += v[x].c;\n }\n }\n for(int i = 0 ; i < 4 ; i++){\n int nx = x + dx[i];\n int ny = y + dy[i];\n if(!inField(nx,ny)) continue;\n if(field[ny][nx] != '.') continue;\n res = max(res,solve(nx,ny,t+1,S)+cost);\n }\n return res;\n}\n\nint main(){\n int sx,sy,N;\n while(cin >> W >> H, W){\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] == 'P'){\n sx = j; sy = i;\n field[i][j] = '.';\n }\n }\n }\n LIMIT = 0;\n cin >> N;\n v.clear(); v.resize(N);\n for(int i = 0 ; i < N ; i++){\n cin >> v[i].n >> v[i].c >> v[i].s >> v[i].t;\n LIMIT = max(LIMIT,v[i].t);\n }\n LIMIT++;\n memset(memo,-1,sizeof(memo));\n cout << solve(sx,sy,0,0) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 63100,
"score_of_the_acc": -0.7516,
"final_rank": 18
},
{
"submission_id": "aoj_0245_1674659",
"code_snippet": "#include <iostream>\nusing namespace std;\nstruct comd { int sn,d,s,e; };\nint main() {\n int x,y,i,j,k,g,n,t,a,b,e,h,dx[4]={1,0,-1,0},dy[4]={0,-1,0,1},d[2][20][20][256],m[20][20],f[20][20];\n char c;\n comd co[10];\n while(cin >> x >> y && x>0) {\n\t for (h=0;h<2;h++) for (j=0;j<20;j++) for (k=0;k<20;k++) for (g=0;g<256;g++) d[h][j][k][g]=-1;\n\t for (i=0;i<y;i++) {\n\t\t for (j=0;j<x;j++) {\n\t\t\t cin >> c; \n\t\t\t f[i][j]=0;\n\t\t\t if (c>='0' && c<='9') m[i][j]=c-'0'; else m[i][j]=-1;\n\t\t\t if (c=='P') { f[i][j]=1; d[0][i][j][0]=0;}\n\t\t }\n\t }\n\t cin >> n;\n\t for (i=0; i<n; i++) { cin >> g; cin >> co[g].d >> co[g].s >> co[g].e; co[g].sn=(1 << i);}\n\t for (t=0,h=0;t<=100;t++) {\n\t\t for (i=0;i<y;i++) for (j=0;j<x;j++) {\n\t\t\t if (f[i][j]==0) continue;\n\t\t for (k=0;k<256;k++) {\n\t\t\t\tif (d[h][i][j][k]==-1) continue;\n\t\t\t\ta=k; b=d[h][i][j][k];\n\t\t\t\tfor (g=0;g<4;g++) {\n\t\t\t\t\tif (j+dx[g]<0 || j+dx[g]>=x || i+dy[g]<0 || i+dy[g]>=y) continue;\n\t\t\t\t\te=m[i+dy[g]][j+dx[g]];\n\t\t\t\t\tif (e>=0) if ((co[e].sn & a)==0 && co[e].s<=t && co[e].e>t) {b+=co[e].d; a=a | co[e].sn;}\n\t\t\t\t}\n\t\t\t\td[h][i][j][a]=b;\n\t\t\t\tfor (g=0;g<4;g++) if (j+dx[g]>=0 && j+dx[g]<x && i+dy[g]>=0 && i+dy[g]<y) if (m[i+dy[g]][j+dx[g]]<0) { d[1-h][i+dy[g]][j+dx[g]][a]=b; f[i+dy[g]][j+dx[g]]=1;} \n\t\t\t\t}\n\t\t\t}\n\t\t\th=1-h;\n\t\t}\n\t\ta=-1;\n\t\tfor (i=0;i<y;i++) for (j=0;j<x;j++) for (k=0;k<256;k++) if (a<d[0][i][j][k]) a=d[0][i][j][k];\n\t\tcout << a << endl;\n\t }\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 1964,
"score_of_the_acc": -0.0263,
"final_rank": 1
},
{
"submission_id": "aoj_0245_1407418",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <queue>\n#include <algorithm>\n#include <set>\n#include <math.h>\n#include <utility>\n#include <stack>\n#include <string.h>\n#include <complex>\nusing namespace std;\nconst int INF = 1<<29;\nconst double EPS = 1e-8;\n//typedef vector<int> vec;\ntypedef vector<char> vec;\ntypedef vector<vec> mat;\ntypedef pair<int,int> P;\nstruct edge{int to,cost;};\n\nstruct State{\n int t,get,y,x;\n};\nconst int dx[] = {0,0,1,-1};\nconst int dy[] = {1,-1,0,0};\n\nbool visited[100][(1<<10)][20][20];\n\nint main(){\n int w, h;\n while(cin >> w >> h, w){\n mat field(h, vec(w));\n int sx,sy;\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]=='P'){\n sx = j; sy = i;\n }\n }\n }\n\n int de_sum[(1<<10)];\n fill(de_sum, de_sum+(1<<10), 0);\n int n;\n cin >> n;\n int st_i[10], et_i[10];\n fill(st_i,st_i+10,INF);\n fill(et_i,et_i+10,-INF);\n for(int i=0;i<n;i++){\n int go, de, st, et;\n scanf(\"%d%d%d%d\", &go, &de, &st, &et);\n st_i[go] = st; et_i[go] = et;\n for(int j=1;j<(1<<10);j++){\n if((j>>go)&1){\n de_sum[j] += de;\n }\n }\n }\n\n memset(visited, 0, sizeof(visited));\n queue<State> que;\n que.push((State){0,0,sy,sx});\n int ans = 0;\n while(que.size()){\n State p = que.front(); que.pop();\n //printf(\"p.t=%d p.get=%d p.y=%d p.x=%d\\n\",p.t,p.get,p.y,p.x);\n for(int j=0;j<4;j++){\n int ny = p.y + dy[j], nx = p.x + dx[j];\n if(ny<0||h<=ny||nx<0||w<=nx)continue;\n if('0'<=field[ny][nx]&&field[ny][nx]<='9'){\n int g_i = field[ny][nx] - '0';\n if(st_i[g_i] <= p.t && p.t < et_i[g_i]){\n p.get |= (1<<g_i);\n }\n }\n }\n if(visited[p.t][p.get][p.y][p.x]) continue;\n visited[p.t][p.get][p.y][p.x] = true;\n ans = max(ans, de_sum[p.get]);\n for(int i=0;i<4;i++){\n int ny = p.y + dy[i], nx = p.x + dx[i];\n if(ny<0||h<=ny||nx<0||w<=nx) continue;\n if(field[ny][nx]=='.'||field[ny][nx]=='P'){\n if(p.t+1<100&&!visited[p.t+1][p.get][ny][nx]){\n que.push((State){p.t+1, p.get, ny, nx});\n }\n }\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 42968,
"score_of_the_acc": -0.5111,
"final_rank": 12
},
{
"submission_id": "aoj_0245_1375801",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define Rep(i, s, t) for (int i = (int)(s); i <= (int)(t); i++)\n#define rep(i, n) Rep(i, 0, (n) - 1)\nconst int INF = 1 << 26;\nconst int dx[] = {-1, 0, 1, 0};\nconst int dy[] = {0, -1, 0, 1};\n\nint h, w;\nint sx, sy;\nchar grid[22][22];\nint sale[10][100];\nint dp[101][22][22][1 << 8];\nvector<int> salev;\nint toid[10];\n\nint main()\n{\n\twhile (scanf(\"%d %d\", &w, &h), w){\n\t\tfill_n(*sale, 10 * 100, -INF);\n\t\tfill_n(*grid, 22 * 22, '\\0');\n\t\tfill_n(toid, 10, -1);\n\t\tsalev.clear();\n\t\t\n\t\tfor (int i = 1; i <= h; i++){\n\t\t\tfor (int j = 1; j <= w; j++){\n\t\t\t\tscanf(\" %c\", &grid[i][j]);\n\t\t\t\tif (grid[i][j] == 'P'){\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t\tgrid[i][j] = '.';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint n;\n\t\tscanf(\"%d\", &n);\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tint g, d, s, e;\n\t\t\tscanf(\"%d %d %d %d\", &g, &d, &s, &e);\n\t\t\tfor (int j = s; j < e; j++){\n\t\t\t\tsale[g][j] = max(sale[g][j], d);\n\t\t\t}\n\t\t\tsalev.push_back(g);\n\t\t}\n\t\t\n\t\tsort(salev.begin(), salev.end());\n\t\tsalev.erase(unique(salev.begin(), salev.end()), salev.end());\n\t\t\n\t\tfor (int i = 0; i < salev.size(); i++){\n\t\t\ttoid[salev[i]] = i;\n\t\t}\n\t\t\n\t\tfill_n(***dp, 101 * 22 * 22 * (1 << 8), -INF);\n\t\tdp[0][sx][sy][0] = 0;\n\t\trep (t, 100) Rep (x, 1, h) Rep (y, 1, w){\n\t\t\trep (got, 1 << salev.size()){\n\t\t\t\tif (dp[t][x][y][got] == -INF) continue;\n\t\t\t\tif (grid[x][y] != '.') continue;\n\t\t\t\t//if (dp[t][x][y][got] > 0) printf(\"%d\\n\", dp[t][x][y][got]);\n\t\t\t\t//printf(\"%d %d %d %d\\n\", t, x, y, got);\n\t\t\t\t//dp[t + 1][x][y][got] = max(dp[t + 1][x][y][got], dp[t][x][y][got]);\n\t\t\t\trep (dir, 4){\n\t\t\t\t\tint nx = x + dx[dir];\n\t\t\t\t\tint ny = y + dy[dir];\n\t\t\t\t\tif (grid[nx][ny] >= '0' && grid[nx][ny] <= '9'){\n\t\t\t\t\t\tint g = grid[nx][ny] - '0';\n\t\t\t\t\t\tint id = toid[g];\n\t\t\t\t\t\tif (id != -1 && !(got & (1 << id))){\n\t\t\t\t\t\t\tdp[t][x][y][got | (1 << id)] = max(\n\t\t\t\t\t\t\t\tdp[t][x][y][got | (1 << id)],\n\t\t\t\t\t\t\t\tdp[t][x][y][got] + sale[g][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\tdp[t + 1][nx][ny][got] = max(\n\t\t\t\t\t\tdp[t + 1][nx][ny][got],\n\t\t\t\t\t\tdp[t][x][y][got]\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint res = 0;\n\t\trep (t, 100) Rep (x, 1, h) Rep(y, 1, w) rep(st, 1 << salev.size()){\n\t\t\tres = max(res, dp[t][x][y][st]);\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\", res);\n\t}\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 50100,
"score_of_the_acc": -0.636,
"final_rank": 16
},
{
"submission_id": "aoj_0245_1251103",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n\nstruct pos {\n\tint x, y;\n\tint c;\n\n\tpos() {}\n\tpos(int x_, int y_, int c_) {\n\t\tx = x_; y = y_; c = c_;\n\t}\n};\n\nbool visited[22][22][105][1024];\n\nint main() {\n\tint x, y;\n\twhile(cin >> x >> y, x || y) {\n\t\tvector<string> shop;\n\t\tstring str;\n\t\tint sale[10][3];\n\t\tint mx_t = 0;\n\t\tfor(int i = 0; i < 22*22*105*1024; i++)\n\t\t\tvisited[0][0][0][i] = false;\n\t\tfor(int i = 0; i < x+2; i++)\n\t\t\tstr += \"#\";\n\t\tshop.push_back(str);\n\t\tcin.ignore();\n\t\tfor(int i = 0; i < y; i++) {\n\t\t\tstring tmp;\n\t\t\ttmp = \"#\";\n\t\t\tfor(int j = 0; j < x; j++) {\n\t\t\t\tchar in;\n\t\t\t\tcin >> in; cin.ignore();\n\t\t\t\ttmp += in;\n\t\t\t}\n\t\t\ttmp += \"#\";\n\t\t\tshop.push_back(tmp);\n\t\t}\n\t\tshop.push_back(str);\n\n\t\tint n;\n\t\tcin >> n;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint g, d, s, e;\n\t\t\tcin >> g >> d >> s >> e;\n\t\t\tsale[g][0] = s; sale[g][1] = e; sale[g][2] = d;\n\t\t\tmx_t = max(mx_t, e);\n\t\t}\n\n\t\tpos P;\n\t\tfor(int i = 0; i < y; i++) {\n\t\t\tfor(int j = 0; j < x; j++) {\n\t\t\t\tif(shop[i+1][j+1] == 'P') {\n\t\t\t\t\tP = pos(j+1, i+1, 0);\n\t\t\t\t\tshop[i+1][j+1] = '.';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/*\n\t\tfor(int i = 0; i < shop.size(); i++) {\n\t\t\tfor(int j = 0; j < shop[i].size(); j++) {\n\t\t\t\tcout << shop[i][j];\n\t\t\t} cout << endl;\n\t\t}\n\t\t// */\n\n\t\tconst int dxy[] = {0, 1, 0, -1, 0};\n\t\tint res = 0;\n\t\tqueue<pos> q;\n\t\tq.push(P);\n\t\tfor(int t = 0; t <= mx_t; t++) {\n\t\t\tqueue<pos> nex;\n\t\t\twhile(!q.empty()) {\n\t\t\t\tpos cur = q.front(); q.pop();\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i < 4; i++) {\n\t\t\t\t\tchar ca = shop[cur.y+dxy[i]][cur.x+dxy[i+1]];\n\t\t\t\t\tif(ca != '.' && ca != '#' && sale[ca-'0'][0] <= t && t < sale[ca-'0'][1]) {\n\t\t\t\t\t\tcur.c |= 1 << (ca - '0');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(int i = 0; i < 4; i++) {\n\t\t\t\t\tchar ca = shop[cur.y+dxy[i]][cur.x+dxy[i+1]];\n\t\t\t\t\tif(ca == '.' && !visited[cur.y+dxy[i]][cur.x+dxy[i+1]][t+1][cur.c]) {\n\t\t\t\t\t\tvisited[cur.y+dxy[i]][cur.x+dxy[i+1]][t+1][cur.c] = true;\n\t\t\t\t\t\tnex.push(pos(cur.x + dxy[i+1], cur.y + dxy[i], cur.c));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(t == mx_t) {\n\t\t\t\twhile(!nex.empty()) {\n\t\t\t\t\tpos cur = nex.front(); nex.pop();\n\t\t\t\t\tint tmp = 0;\n\t\t\t\t\tfor(int i = 0; i < 10; i++) {\n\t\t\t\t\t\tif(cur.c & (1 << i)) {\n\t\t\t\t\t\t\ttmp += sale[i][2];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tres = max(res, tmp);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tq = nex;\n\t\t}\n\n\t\tcout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 900,
"memory_kb": 52944,
"score_of_the_acc": -0.7594,
"final_rank": 19
},
{
"submission_id": "aoj_0245_1226777",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cmath>\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\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,string> P;\n\nconst static int tx[4] = {+0,+1,+0,-1};\nconst static int ty[4] = {-1,+0,+1,+0};\n\nbool dp[21][21][101][1<<10];\n\nclass State{\npublic:\n int x;\n int y;\n int time;\n int got;\n bool operator<(const State& s) const {\n return time < s.time;\n }\n bool operator>(const State& s) const {\n return time > s.time;\n }\n State(int x,int y,int time,int got) \n : x(x), y(y), time(time), got(got){}\n};\n\nclass Goods{\npublic:\n int item_id;\n int discounted_price;\n int sale_start_time;\n int sale_end_time;\n Goods(int item_id,int discounted_price, int sale_start_time,int sale_end_time)\n : item_id(item_id),discounted_price(discounted_price),sale_start_time(sale_start_time), sale_end_time(sale_end_time){}\n Goods(){}\n};\n\nint main(){\n int W,H;\n while(~scanf(\"%d %d\",&W,&H)){\n if(W == 0 && H == 0) break;\n char stage[21][21];\n memset(dp,false,sizeof(dp));\n int sx,sy;\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n char cell[8];\n scanf(\"%s\",cell);\n stage[y][x] = cell[0];\n if(stage[y][x] == 'P'){\n sy = y;\n sx = x;\n }\n }\n }\n int total_time_sales;\n scanf(\"%d\",&total_time_sales);\n\n map<int,Goods> goods;\n for(int i = 0; i < total_time_sales; i++){\n int item_id;\n int discounted_price;\n int sale_start_time;\n int sale_end_time;\n scanf(\"%d %d %d %d\",\n &item_id,\n &discounted_price,\n &sale_start_time,\n &sale_end_time);\n goods[item_id] = Goods(item_id,discounted_price,sale_start_time,sale_end_time);\n }\n priority_queue<State,vector<State>,greater<State> > que;\n que.push(State(sx,sy,0,0));\n dp[sx][sy][0][0] = true;\n while(!que.empty()){\n State s = que.top();\n que.pop();\n for(int i = 0; i < 4; i++){\n int dx = s.x + tx[i];\n int dy = s.y + ty[i];\n if(dx < 0 || dx >= W || dy < 0 || dy >= H) continue;\n if(stage[dy][dx] == '.' || stage[dy][dx] == 'P') continue;\n const Goods& g = goods[stage[dy][dx] - '0'];\n if(g.sale_start_time <= s.time && s.time < g.sale_end_time){\n s.got |= (1 << g.item_id);\n }\n }\n\n for(int i = 0; i < 4; i++){\n int dx = s.x + tx[i];\n int dy = s.y + ty[i];\n if(dx < 0 || dx >= W || dy < 0 || dy >= H) continue;\n if(stage[dy][dx] != '.' && stage[dy][dx] != 'P') continue;\n if(dp[dx][dy][s.time+1][s.got]) continue;\n if(s.time+1 > 100) continue;\n dp[dx][dy][s.time+1][s.got] = true;\n que.push(State(dx,dy,s.time+1,s.got));\n }\n }\n\n int res = 0;\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n for(int time = 0; time <= 100; time++){\n for(int S = 0; S < (1<<10); S++){\n if(dp[x][y][time][S]){\n int sum = 0;\n for(int i = 0; i < 10; i++){\n if(S & (1<<i)){\n sum += goods[i].discounted_price;\n }\n }\n res = max(res,sum);\n }\n }\n }\n }\n }\n printf(\"%d\\n\",res);\n }\n}",
"accuracy": 1,
"time_ms": 840,
"memory_kb": 46712,
"score_of_the_acc": -0.6773,
"final_rank": 17
},
{
"submission_id": "aoj_0245_1131625",
"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 Data {\n int cur,time,bitmask,score;\n};\n\nint dx[] = {0,1,0,-1};\nint dy[] = {1,0,-1,0};\nint maxi[20*20][1<<8][110],info[30][30][110];\nint w,h,sp,n,g[10],d[10],s[10],e[10],limit,trans[10];\nchar field[30][30];\n\nbool isValid(int x,int y) { return 0 <= x && x < w && 0 <= y && y < h; }\n\nint getDiff(int bits1,int bits2){\n int ret = 0;\n int diff = bits1 ^ bits2;\n diff = diff & bits2;\n while( diff ){\n int here = diff & -diff;\n diff -= here;\n int pos = log2(here);\n ret += d[trans[pos]];\n }\n return ret;\n}\n\nvoid compute(){\n rep(tm,limit) {\n rep(i,h) rep(j,w) {\n info[i][j][tm] = 0;\n rep(k,4) {\n int nx = j + dx[k], ny = i + dy[k];\n if( !isValid(nx,ny) ) continue;\n if( field[ny][nx] == '.' ) continue;\n int index = field[ny][nx] - '0';\n if( s[index] <= tm && tm < e[index] ) {\n info[i][j][tm] |= (1<<(field[ny][nx]-'0'));\n }\n }\n }\n }\n\n deque<Data> deq;\n rep(i,h*w) rep(j,(1<<n)) rep(k,limit) maxi[i][j][k] = -1;\n deq.push_back((Data){sp,0,0,0});\n int answer = 0;\n while( !deq.empty() ){\n Data data = deq.front(); deq.pop_front();\n if( maxi[data.cur][data.bitmask][data.time] > data.score ) continue;\n int x = data.cur % w, y = data.cur / w;\n rep(i,4){\n int nx = x + dx[i], ny = y + dy[i];\n if( !isValid(nx,ny) ) continue;\n if( field[ny][nx] != '.' ) continue;\n if( data.time + 1 >= limit ) continue;\n int ntime = data.time + 1;\n int nbitmask = data.bitmask | info[ny][nx][ntime];\n int nscore = data.score + getDiff(data.bitmask,info[ny][nx][ntime]);\n if( maxi[nx+ny*w][nbitmask][ntime] < nscore ) {\n maxi[nx+ny*w][nbitmask][ntime] = nscore;\n answer = max(answer,nscore);\n deq.push_back((Data){nx+ny*w,ntime,nbitmask,nscore});\n }\n }\n }\n cout << answer << endl;\n}\n\nint main(){\n while( cin >> w >> h, w|h ){\n rep(i,h) rep(j,w) {\n cin >> field[i][j];\n if( field[i][j] == 'P' ) {\n field[i][j] = '.';\n sp = j + i * w;\n }\n }\n limit = 0;\n cin >> n;\n rep(i,n) {\n cin >> g[i] >> d[i] >> s[i] >> e[i];\n trans[g[i]] = i;\n limit = max(limit,e[i]);\n }\n compute();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 46040,
"score_of_the_acc": -0.521,
"final_rank": 13
},
{
"submission_id": "aoj_0245_1107048",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar in[2];\nint m[30][30];\nint dp[101][21][21][1<<8];\nint dx[]={1,0,-1,0};\nint dy[]={0,1,0,-1};\nint can[11][110];\nint lis[11];\nint con[11];\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&b,&a),a){\n\t\tint sr,sc;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\t\tscanf(\"%s\",in);\n\t\t\tif(in[0]=='P'){sr=i;sc=j;}\n\t\t\tif(in[0]=='P'||in[0]=='.')m[i][j]=-1;\n\t\t\telse m[i][j]=in[0]-'0';\n\t\t}\n\t\tint c;scanf(\"%d\",&c);\n\t\tfor(int i=0;i<11;i++)for(int j=0;j<110;j++)can[i][j]=0;\n\t\tfor(int i=0;i<c;i++){\n\t\t\tint p,q,r,s;\n\t\t\tscanf(\"%d%d%d%d\",&p,&q,&r,&s);\n\t\t\tfor(int j=r;j<s;j++)can[p][j]=max(can[p][j],q);\n\t\t}\n\t\tfor(int i=0;i<11;i++)lis[i]=-1;\n\t\tint sz=0;\n\t\tfor(int i=0;i<10;i++){\n\t\t\tbool ok=false;\n\t\t\tfor(int j=0;j<101;j++)if(can[i][j])ok=true;\n\t\t\tif(ok){\n\t\t\t\tcon[sz]=i;\n\t\t\t\tlis[i]=sz++;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<101;i++){\n\t\t\tfor(int j=0;j<a;j++)for(int k=0;k<b;k++)for(int l=0;l<(1<<sz);l++){\n\t\t\t\tdp[i][j][k][l]=-1;\n\t\t\t}\n\t\t}\n\t\tint ret=0;\n\t\tdp[0][sr][sc][0]=0;\n\t\tfor(int i=0;i<100;i++){\n\t\t\tfor(int j=0;j<a;j++)for(int k=0;k<b;k++)for(int l=0;l<(1<<sz);l++){\n\t\t\t\tif(!~dp[i][j][k][l])continue;\n\t\t\t\tret=max(ret,dp[i][j][k][l]);\n\t\t\t\tfor(int x=0;x<4;x++){\n\t\t\t\t\tif(j+dx[x]<0||j+dx[x]>=a||k+dy[x]<0||k+dy[x]>=b)continue;\n\t\t\t\t\tif(~m[j+dx[x]][k+dy[x]]){\n\t\t\t\t\t\tif(!~lis[m[j+dx[x]][k+dy[x]]])continue;\n\t\t\t\t\t\tif(l&(1<<lis[m[j+dx[x]][k+dy[x]]]))continue;\n\t\t\t\t\t\tdp[i][j][k][l+(1<<lis[m[j+dx[x]][k+dy[x]]])]=max(dp[i][j][k][l+(1<<lis[m[j+dx[x]][k+dy[x]]])],dp[i][j][k][l]+can[m[j+dx[x]][k+dy[x]]][i]);\n\t\t\t\t\t}else{\n\t\t\t\t\t\tdp[i+1][j+dx[x]][k+dy[x]][l]=max(dp[i+1][j+dx[x]][k+dy[x]][l],dp[i][j][k][l]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 45432,
"score_of_the_acc": -0.5318,
"final_rank": 14
},
{
"submission_id": "aoj_0245_1065169",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n//とおしたいね\ntypedef long long int64;\n//同じ商品で何回かタイムせーるしてる？\n//うーん//\nstruct Sale{\n int g;\n int64 d;\n int s, e;\n} sale[8];\nstruct State{\n unsigned char x, y, time;\n unsigned bit, used_pop; //used_pop: 使った商品\n State( unsigned char x, unsigned char y, unsigned bit, unsigned char time, unsigned used_pop):x(x),y(y),bit(bit),time(time),used_pop(used_pop){};\n};\n\nint W, H, N, sy, sx;\nbool used[20][20][1 << 8][101];\nchar m[20][20];\nint64 cost[1 << 8];\nconst int dy[] = { 0, 1, 0, -1, 0}, dx[] = { 1, 0, -1, 0, 0};\nqueue< State > que;\nint64 BFS(){\n que.push(State( sx, sy, 0, 0, 0));\n used[sy][sx][0][0] = true;\n memset( used, false, sizeof(used));\n for(int i = 0; i < 1 << N; i++){\n cost[i] = 0;\n for(int j = 0; j < N; j++){\n if((i >> j) & 1){\n cost[i] += sale[j].d;\n }\n }\n }\n int64 ret = 0;\n while(!que.empty()){\n State p = que.front(); que.pop();\n ret = max( ret, cost[p.bit]);\n if(p.time > 100) continue;\n for(int i = 0; i < 4; i++){\n int ny = p.y + dy[i], nx = p.x + dx[i];\n if(ny < 0 || ny >= H || nx < 0 || nx >= W) continue;\n if(isdigit(m[ny][nx])){\n for(int j = 0; j < N; j++){\n if(m[ny][nx] - '0' == sale[j].g && !((p.bit >> j) & 1) && !((p.used_pop >> sale[j].g) & 1)){\n if(sale[j].s <= p.time && p.time < sale[j].e){\n if(used[p.y][p.x][p.bit|(1 << j)][p.time]++) continue;\n que.push( State( p.x, p.y, p.bit|(1 << j), p.time,\n p.used_pop|(1 << sale[j].g)));\n }\n }\n }\n }\n }\n for(int i = 0; i < 5; i++){\n int ny = p.y + dy[i], nx = p.x + dx[i];\n if(ny < 0 || ny >= H || nx < 0 || nx >= W || m[ny][nx] != '.') continue;\n if(used[ny][nx][p.bit][p.time + 1]++) continue;\n que.push( State( nx, ny, p.bit, p.time + 1, p.used_pop));\n }\n }\n return ret;\n}\n\nint main(){\n while(cin >> W >> H, W||H){\n for(int i = 0; i < H; i++){\n for(int j = 0; j < W; j++){\n cin >> m[i][j];\n if(m[i][j] == 'P') m[i][j] = '.', sy = i, sx = j;\n }\n }\n cin >> N;\n for(int i = 0; i < N; i++){\n cin >> sale[i].g >> sale[i].d >> sale[i].s >> sale[i].e;\n }\n cout << BFS() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 12188,
"score_of_the_acc": -0.1942,
"final_rank": 8
},
{
"submission_id": "aoj_0245_1064787",
"code_snippet": "#include <cstdio>\n#include <queue>\n#include <cctype>\n#include <cstring>\n#include <cassert>\n\nusing namespace std;\n\nstruct state {\n int x,y,u,t,c;\n state(){}\n state(int x,int y,int u,int t,int c):x(x),y(y),u(u),t(t),c(c){}\n};\n\nint cost[20][20][1<<8][100];\nchar g[20][20],gt[20][20];\nint n,v[8],d[8],s[8],e[8];\nint w,h;\nint dx[]={0,1,0,-1,0},dy[]={1,0,-1,0,0};\n\nint main(void)\n{\n for(;;) {\n scanf(\"%d%d\",&w,&h); if(w+h == 0)break;\n int x,y; x = y = -1;\n for( int i = 0; i < h; i++ ) {\n for( int j = 0; j < w; j++ ) {\n scanf(\" %c\",g[i]+j);\n if( g[i][j] == 'P' ) {\n g[i][j] = '.';\n x = j;\n y = i;\n }\n }\n }\n memcpy(gt,g,sizeof(gt));\n for( int i = 0; i < h; i++ ) {\n for( int j = 0; j < w; j++ ) {\n if( isdigit(g[i][j]) ) {\n g[i][j] = '#';\n }\n }\n }\n assert(x>=0 && y>=0);\n scanf(\"%d\",&n);\n int id[10],ct=0; memset(id,-1,sizeof(id));\n for( int i = 0; i < n; i++ ) {\n scanf(\"%d%d%d%d\",v+i,d+i,s+i,e+i);\n if( id[v[i]] < 0 ) {\n id[v[i]] = ct;\n for( int j = 0; j < h; j++ ) {\n for( int k = 0; k < w; k++ ) {\n if( gt[j][k] == v[i]+'0' ) g[j][k] = ct+'0';\n }\n }\n ct += 1;\n }\n v[i] = id[v[i]];\n }\n int res = 0;\n queue<state> q;\n q.push(state(x,y,0,0,0));\n memset(cost,-1,sizeof(cost));\n while( !q.empty() ) {\n state p = q.front(); q.pop();\n //printf(\"%d %d %02x %d %d\\n\",p.x,p.y,p.u,p.t,p.c);\n if( p.t >= 100 ) continue;\n if( res < p.c ) res = p.c;\n for( int i = 0; i < 4; i++ ) {\n x = p.x+dx[i];\n y = p.y+dy[i];\n if( x < 0 || x >= w || y < 0 || y >= h ) continue;\n if( isdigit(g[y][x]) ) {\n int k = g[y][x]-'0';\n if( !(p.u>>k&1) ) {\n for( int j = 0; j < n; j++ ) {\n if( s[j] <= p.t && p.t < e[j] && v[j] == k ) {\n if( cost[p.y][p.x][p.u|1<<k][p.t] < p.c+d[j] ) {\n cost[p.y][p.x][p.u|1<<k][p.t] = p.c+d[j];\n q.push(state(p.x,p.y,p.u|1<<k,p.t,p.c+d[j]));\n }\n }\n }\n }\n }\n if( g[y][x] == '.' && cost[y][x][p.u][p.t+1] < p.c ) {\n cost[y][x][p.u][p.t+1] = p.c;\n q.push(state(x,y,p.u,p.t+1,p.c));\n }\n }\n }\n printf(\"%d\\n\",res);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 41756,
"score_of_the_acc": -0.4911,
"final_rank": 10
},
{
"submission_id": "aoj_0245_1064778",
"code_snippet": "#include <cstdio>\n#include <queue>\n#include <cctype>\n#include <cstring>\n#include <cassert>\n\nusing namespace std;\n\nstruct state {\n int x,y,u,t,c;\n state(){}\n state(int x,int y,int u,int t,int c):x(x),y(y),u(u),t(t),c(c){}\n};\n\nint cost[20][20][1<<8][100];\nchar g[20][20];\nint n,v[8],d[8],s[8],e[8];\nint w,h;\nint dx[]={0,1,0,-1},dy[]={1,0,-1,0};\n\nint main(void)\n{\n for(;;) {\n scanf(\"%d%d\",&w,&h); if(w+h == 0)break;\n int x,y; x = y = -1;\n for( int i = 0; i < h; i++ ) {\n for( int j = 0; j < w; j++ ) {\n scanf(\" %c\",g[i]+j);\n if( g[i][j] == 'P' ) {\n g[i][j] = '.';\n x = j;\n y = i;\n }\n }\n }\n assert(x>=0 && y>=0);\n scanf(\"%d\",&n);\n for( int i = 0; i < n; i++ ) {\n scanf(\"%d%d%d%d\",v+i,d+i,s+i,e+i);\n }\n int res = 0;\n queue<state> q;\n q.push(state(x,y,0,0,0));\n memset(cost,-1,sizeof(cost));\n while( !q.empty() ) {\n state p = q.front(); q.pop();\n //printf(\"%d %d %02x %d %d\\n\",p.x,p.y,p.u,p.t,p.c);\n if( p.t >= 100 ) continue;\n if( res < p.c ) res = p.c;\n for( int i = 0; i < 4; i++ ) {\n x = p.x+dx[i];\n y = p.y+dy[i];\n if( x < 0 || x >= w || y < 0 || y >= h ) continue;\n if( isdigit(g[y][x]) ) {\n int k = g[y][x]-'0';\n if( !(p.u>>k&1) ) {\n for( int j = 0; j < n; j++ ) {\n if( s[j] <= p.t && p.t < e[j] && v[j] == k ) {\n if( cost[p.y][p.x][p.u|1<<k][p.t] < p.c+d[j] ) {\n cost[p.y][p.x][p.u|1<<k][p.t] = p.c+d[j];\n q.push(state(p.x,p.y,p.u|1<<k,p.t,p.c+d[j]));\n }\n }\n }\n }\n }\n if( g[y][x] == '.' && cost[y][x][p.u][p.t+1] < p.c ) {\n cost[y][x][p.u][p.t+1] = p.c;\n q.push(state(x,y,p.u,p.t+1,p.c));\n }\n }\n }\n printf(\"%d\\n\",res);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 41756,
"score_of_the_acc": -0.4911,
"final_rank": 10
}
] |
aoj_0247_cpp
|
氷の迷路
四角のマスを縦横にならべた長方形の迷路があります。この迷路では東西南北の隣接するマスへ移動しながら、スタートのマスSを出発し、ゴールのマスGを目指します。マスの種類には、平原、山、氷の３種類があります。SとGは、平原のマスに置かれています。平原のマスには移動できますが、山のマスには移動できません。氷のマスは移動できますが、条件によって氷が割れ動けなくなります。
氷のマスは東西南北に隣接するもの全体でひとつの塊として扱われます。
氷の塊のなかで、マスの個数の半分より多くのマスに移動すると、塊全体が割れます。
例えば、図１は与えられた迷路の最短経路のステップ数が 11 であることを示しています。
図1
しかし、図２のように氷のマスを通って近道をしようとすると、大きさが６の氷の塊に対する４回目の移動後に動けなくなってしまいGには到達できません。
図2
このような迷路の情報を入力とし、SからGまでの最短経路のステップ数を求めるプログラムを作成してください。マスの種類はそれぞれ以下の文字で表されます：
文字（半角）
マスの種類
. （ピリオド）
平原
#（シャープ）
山
X
氷
与えられる迷路は必ず解けるものとします。迷路はその東西方向のマスの数
X
、南北方向のマスの数
Y
と
X
×
Y
個の文字として与えられます。
入力
複数のデータセットが与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。
X
Y
line
1
line
2
:
line
Y
1行目に迷路の大きさを表す整数
X
,
Y
(2 ≤
X, Y
≤ 12) が与えられます。続く
Y
行に迷路の
i
行目の情報
line
i
(長さ
X
の半角英文字列) が与えられます。
データセットの数は 40 を超えない。
出力
データセットごとに、最小のステップ数を１行に出力します。
入力例
5 5
.X.S.
.X#..
.XX##
.#XG.
..X..
7 3
SXX.XXG
X.#.#X.
XXX.XX#
4 4
S...
X.X.
GX..
...X
10 10
..XXXXX.XX
.X.#.#X.XX
SX.#X.X..X
#X.##.X.XX
..XXXX#.XX
##.##.##XX
....X.XX#X
.##X..#X#X
....XX#..X
...#XXG..X
0 0
出力例
11
10
10
33
|
[
{
"submission_id": "aoj_0247_4908281",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint H,W;\nstring S[12];\nint sx,sy,gx,gy;\nint A[12][12];\nint dx[4]={1,0,0,-1},dy[4]={0,1,-1,0};\nint dfs(int x,int y,int col)\n{\n\tA[x][y]=col;\n\tint ret=1;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(A[tx][ty]==-2)ret+=dfs(tx,ty,col);\n\t}\n\treturn ret;\n}\nint xcnt[150],nowcnt[150];\nint dg[12][12];\nbool vis[12][12];\nint ans;\nvoid rec(int x,int y,int now)\n{\n\tif(gx==x&&gy==y)ans=now;\n\tif(ans<=now+dg[x][y])return;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(vis[tx][ty]||A[tx][ty]==-1)continue;\n\t\tbool ok=true;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]++;\n\t\t\tif(nowcnt[A[tx][ty]]*2>xcnt[A[tx][ty]])ok=false;\n\t\t}\n\t\tvis[tx][ty]=true;\n\t\tif(ok)rec(tx,ty,now+1);\n\t\tvis[tx][ty]=false;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]--;\n\t\t}\n\t}\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tA[i][j]=0;\n\t\t\tvis[i][j]=false;\n\t\t}\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tcin>>S[i];\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(S[i][j]=='X')A[i][j]=-2;\n\t\t\t\telse if(S[i][j]=='#')A[i][j]=-1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i][j]=='S')sx=i,sy=j;\n\t\t\t\t\telse if(S[i][j]=='G')gx=i,gy=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint xc=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(A[i][j]==-2)\n\t\t{\n\t\t\txc++;\n\t\t\txcnt[xc]=dfs(i,j,xc);\n\t\t\tnowcnt[xc]=0;\n\t\t}\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)dg[i][j]=H*W*2;\n\t\t\tdg[gx][gy]=0;\n\t\t\tqueue<pair<int,int> >P;\n\t\t\tP.push(make_pair(gx,gy));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\t\tP.pop();\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\t\tif(A[tx][ty]==-1||dg[tx][ty]<=dg[x][y]+1)continue;\n\t\t\t\t\tdg[tx][ty]=dg[x][y]+1;\n\t\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=74;\n\t\tvis[sx][sy]=true;\n\t\trec(sx,sy,0);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3220,
"score_of_the_acc": -0.0448,
"final_rank": 5
},
{
"submission_id": "aoj_0247_4908279",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint H,W;\nstring S[12];\nint sx,sy,gx,gy;\nint A[12][12];\nint dx[4]={1,0,0,-1},dy[4]={0,1,-1,0};\nint dfs(int x,int y,int col)\n{\n\tA[x][y]=col;\n\tint ret=1;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(A[tx][ty]==-2)ret+=dfs(tx,ty,col);\n\t}\n\treturn ret;\n}\nint xcnt[150],nowcnt[150];\nint dg[12][12];\nbool vis[12][12];\nint ans;\nvoid rec(int x,int y,int now,int nr)\n{\n\tif(gx==x&&gy==y)ans=now;\n\tif(ans<=now+dg[x][y])return;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(vis[tx][ty]||A[tx][ty]==-1)continue;\n\t\tbool ok=true;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]++;\n\t\t\tif(nowcnt[A[tx][ty]]*2>xcnt[A[tx][ty]])ok=false;\n\t\t}\n\t\tvis[tx][ty]=true;\n\t\tif(ok)rec(tx,ty,now+1,r);\n\t\tvis[tx][ty]=false;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]--;\n\t\t}\n\t}\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tA[i][j]=0;\n\t\t\tvis[i][j]=false;\n\t\t}\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tcin>>S[i];\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(S[i][j]=='X')A[i][j]=-2;\n\t\t\t\telse if(S[i][j]=='#')A[i][j]=-1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i][j]=='S')sx=i,sy=j;\n\t\t\t\t\telse if(S[i][j]=='G')gx=i,gy=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint xc=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(A[i][j]==-2)\n\t\t{\n\t\t\txc++;\n\t\t\txcnt[xc]=dfs(i,j,xc);\n\t\t\tnowcnt[xc]=0;\n\t\t}\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)dg[i][j]=H*W*2;\n\t\t\tdg[gx][gy]=0;\n\t\t\tqueue<pair<int,int> >P;\n\t\t\tP.push(make_pair(gx,gy));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\t\tP.pop();\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\t\tif(A[tx][ty]==-1||dg[tx][ty]<=dg[x][y]+1)continue;\n\t\t\t\t\tdg[tx][ty]=dg[x][y]+1;\n\t\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=74;\n\t\tvis[sx][sy]=true;\n\t\trec(sx,sy,0,-1);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3212,
"score_of_the_acc": -0.0446,
"final_rank": 2
},
{
"submission_id": "aoj_0247_4908275",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint H,W;\nstring S[12];\nint sx,sy,gx,gy;\nint A[12][12];\nint dx[4]={1,0,0,-1},dy[4]={0,1,-1,0};\nint dfs(int x,int y,int col)\n{\n\tA[x][y]=col;\n\tint ret=1;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(A[tx][ty]==-2)ret+=dfs(tx,ty,col);\n\t}\n\treturn ret;\n}\nint xcnt[150],nowcnt[150];\nint dg[12][12];\nbool vis[12][12];\nint ans;\nvoid rec(int x,int y,int now,int nr)\n{\n\tif(gx==x&&gy==y)ans=now;\n\tif(ans<=now+dg[x][y])return;\n\tfor(int r=0;r<4;r++)if(r+nr!=3)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(vis[tx][ty]||A[tx][ty]==-1)continue;\n\t\tbool ok=true;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]++;\n\t\t\tif(nowcnt[A[tx][ty]]*2>xcnt[A[tx][ty]])ok=false;\n\t\t}\n\t\tvis[tx][ty]=true;\n\t\tif(ok)rec(tx,ty,now+1,r);\n\t\tvis[tx][ty]=false;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]--;\n\t\t}\n\t}\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tA[i][j]=0;\n\t\t\tvis[i][j]=false;\n\t\t}\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tcin>>S[i];\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(S[i][j]=='X')A[i][j]=-2;\n\t\t\t\telse if(S[i][j]=='#')A[i][j]=-1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i][j]=='S')sx=i,sy=j;\n\t\t\t\t\telse if(S[i][j]=='G')gx=i,gy=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint xc=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(A[i][j]==-2)\n\t\t{\n\t\t\txc++;\n\t\t\txcnt[xc]=dfs(i,j,xc);\n\t\t\tnowcnt[xc]=0;\n\t\t}\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)dg[i][j]=H*W*2;\n\t\t\tdg[gx][gy]=0;\n\t\t\tqueue<pair<int,int> >P;\n\t\t\tP.push(make_pair(gx,gy));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\t\tP.pop();\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\t\tif(A[tx][ty]==-1||dg[tx][ty]<=dg[x][y]+1)continue;\n\t\t\t\t\tdg[tx][ty]=dg[x][y]+1;\n\t\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=74;\n\t\tvis[sx][sy]=true;\n\t\trec(sx,sy,0,-1);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3220,
"score_of_the_acc": -0.0448,
"final_rank": 5
},
{
"submission_id": "aoj_0247_4908274",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint H,W;\nstring S[12];\nint sx,sy,gx,gy;\nint A[12][12];\nint dx[4]={1,0,0,-1},dy[4]={0,1,-1,0};\nint dfs(int x,int y,int col)\n{\n\tA[x][y]=col;\n\tint ret=1;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(A[tx][ty]==-2)ret+=dfs(tx,ty,col);\n\t}\n\treturn ret;\n}\nint xcnt[150],nowcnt[150];\nint dg[12][12];\nbool vis[12][12];\nint ans;\nvoid rec(int x,int y,int now,int nr)\n{\n\tif(gx==x&&gy==y)ans=now;\n\tif(ans<=now+dg[x][y])return;\n\tfor(int r=0;r<4;r++)if(r+nr!=3)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(vis[tx][ty]||A[tx][ty]==-1)continue;\n\t\tbool ok=true;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]++;\n\t\t\tif(nowcnt[A[tx][ty]]*2>xcnt[A[tx][ty]])ok=false;\n\t\t}\n\t\tvis[tx][ty]=true;\n\t\tif(ok)rec(tx,ty,now+1,r);\n\t\tvis[tx][ty]=false;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]--;\n\t\t}\n\t}\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tA[i][j]=0;\n\t\t\tvis[i][j]=false;\n\t\t}\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tcin>>S[i];\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(S[i][j]=='X')A[i][j]=-2;\n\t\t\t\telse if(S[i][j]=='#')A[i][j]=-1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i][j]=='S')sx=i,sy=j;\n\t\t\t\t\telse if(S[i][j]=='G')gx=i,gy=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint xc=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(A[i][j]==-2)\n\t\t{\n\t\t\txc++;\n\t\t\txcnt[xc]=dfs(i,j,xc);\n\t\t\tnowcnt[xc]=0;\n\t\t}\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)dg[i][j]=H*W*2;\n\t\t\tdg[gx][gy]=0;\n\t\t\tqueue<pair<int,int> >P;\n\t\t\tP.push(make_pair(gx,gy));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\t\tP.pop();\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\t\tif(A[tx][ty]==-1||dg[tx][ty]<=dg[x][y]+1)continue;\n\t\t\t\t\tdg[tx][ty]=dg[x][y]+1;\n\t\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=75;\n\t\tvis[sx][sy]=true;\n\t\trec(sx,sy,0,-1);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3216,
"score_of_the_acc": -0.0447,
"final_rank": 4
},
{
"submission_id": "aoj_0247_4908273",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint H,W;\nstring S[12];\nint sx,sy,gx,gy;\nint A[12][12];\nint dx[4]={1,0,0,-1},dy[4]={0,1,-1,0};\nint dfs(int x,int y,int col)\n{\n\tA[x][y]=col;\n\tint ret=1;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(A[tx][ty]==-2)ret+=dfs(tx,ty,col);\n\t}\n\treturn ret;\n}\nint xcnt[150],nowcnt[150];\nint dg[12][12];\nbool vis[12][12];\nint ans;\nvoid rec(int x,int y,int now,int nr)\n{\n\tif(gx==x&&gy==y)ans=now;\n\tif(ans<=now+dg[x][y])return;\n\tfor(int r=0;r<4;r++)if(r+nr!=3)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(vis[tx][ty]||A[tx][ty]==-1)continue;\n\t\tbool ok=true;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]++;\n\t\t\tif(nowcnt[A[tx][ty]]*2>xcnt[A[tx][ty]])ok=false;\n\t\t}\n\t\tvis[tx][ty]=true;\n\t\tif(ok)rec(tx,ty,now+1,r);\n\t\tvis[tx][ty]=false;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]--;\n\t\t}\n\t}\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tA[i][j]=0;\n\t\t\tvis[i][j]=false;\n\t\t}\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tcin>>S[i];\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(S[i][j]=='X')A[i][j]=-2;\n\t\t\t\telse if(S[i][j]=='#')A[i][j]=-1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i][j]=='S')sx=i,sy=j;\n\t\t\t\t\telse if(S[i][j]=='G')gx=i,gy=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint xc=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(A[i][j]==-2)\n\t\t{\n\t\t\txc++;\n\t\t\txcnt[xc]=dfs(i,j,xc);\n\t\t\tnowcnt[xc]=0;\n\t\t}\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)dg[i][j]=H*W*2;\n\t\t\tdg[gx][gy]=0;\n\t\t\tqueue<pair<int,int> >P;\n\t\t\tP.push(make_pair(gx,gy));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\t\tP.pop();\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\t\tif(A[tx][ty]==-1||dg[tx][ty]<=dg[x][y]+1)continue;\n\t\t\t\t\tdg[tx][ty]=dg[x][y]+1;\n\t\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=77;\n\t\tvis[sx][sy]=true;\n\t\trec(sx,sy,0,-1);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3212,
"score_of_the_acc": -0.0446,
"final_rank": 2
},
{
"submission_id": "aoj_0247_4908271",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint H,W;\nstring S[12];\nint sx,sy,gx,gy;\nint A[12][12];\nint dx[4]={1,0,0,-1},dy[4]={0,1,-1,0};\nint dfs(int x,int y,int col)\n{\n\tA[x][y]=col;\n\tint ret=1;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(A[tx][ty]==-2)ret+=dfs(tx,ty,col);\n\t}\n\treturn ret;\n}\nint xcnt[150],nowcnt[150];\nint dg[12][12];\nbool vis[12][12];\nint ans;\nvoid rec(int x,int y,int now,int nr)\n{\n\tif(gx==x&&gy==y)ans=now;\n\tif(ans<=now+dg[x][y])return;\n\tfor(int r=0;r<4;r++)if(r+nr!=3)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(vis[tx][ty]||A[tx][ty]==-1)continue;\n\t\tbool ok=true;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]++;\n\t\t\tif(nowcnt[A[tx][ty]]*2>xcnt[A[tx][ty]])ok=false;\n\t\t}\n\t\tvis[tx][ty]=true;\n\t\tif(ok)rec(tx,ty,now+1,r);\n\t\tvis[tx][ty]=false;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]--;\n\t\t}\n\t}\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tA[i][j]=0;\n\t\t\tvis[i][j]=false;\n\t\t}\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tcin>>S[i];\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(S[i][j]=='X')A[i][j]=-2;\n\t\t\t\telse if(S[i][j]=='#')A[i][j]=-1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i][j]=='S')sx=i,sy=j;\n\t\t\t\t\telse if(S[i][j]=='G')gx=i,gy=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint xc=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(A[i][j]==-2)\n\t\t{\n\t\t\txc++;\n\t\t\txcnt[xc]=dfs(i,j,xc);\n\t\t\tnowcnt[xc]=0;\n\t\t}\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)dg[i][j]=H*W*2;\n\t\t\tdg[gx][gy]=0;\n\t\t\tqueue<pair<int,int> >P;\n\t\t\tP.push(make_pair(gx,gy));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\t\tP.pop();\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\t\tif(A[tx][ty]==-1||dg[tx][ty]<=dg[x][y]+1)continue;\n\t\t\t\t\tdg[tx][ty]=dg[x][y]+1;\n\t\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=80;\n\t\tvis[sx][sy]=true;\n\t\trec(sx,sy,0,-1);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3176,
"score_of_the_acc": -0.0439,
"final_rank": 1
},
{
"submission_id": "aoj_0247_4908270",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint H,W;\nstring S[12];\nint sx,sy,gx,gy;\nint A[12][12];\nint dx[4]={1,0,0,-1},dy[4]={0,1,-1,0};\nint dfs(int x,int y,int col)\n{\n\tA[x][y]=col;\n\tint ret=1;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(A[tx][ty]==-2)ret+=dfs(tx,ty,col);\n\t}\n\treturn ret;\n}\nint xcnt[150],nowcnt[150];\nint dg[12][12];\nbool vis[12][12];\nint ans;\nvoid rec(int x,int y,int now,int nr)\n{\n\tif(gx==x&&gy==y)ans=now;\n\tif(ans<=now+dg[x][y])return;\n\tfor(int r=0;r<4;r++)if(r+nr!=3)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(vis[tx][ty]||A[tx][ty]==-1)continue;\n\t\tbool ok=true;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]++;\n\t\t\tif(nowcnt[A[tx][ty]]*2>xcnt[A[tx][ty]])ok=false;\n\t\t}\n\t\tvis[tx][ty]=true;\n\t\tif(ok)rec(tx,ty,now+1,r);\n\t\tvis[tx][ty]=false;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]--;\n\t\t}\n\t}\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tA[i][j]=0;\n\t\t\tvis[i][j]=false;\n\t\t}\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tcin>>S[i];\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(S[i][j]=='X')A[i][j]=-2;\n\t\t\t\telse if(S[i][j]=='#')A[i][j]=-1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i][j]=='S')sx=i,sy=j;\n\t\t\t\t\telse if(S[i][j]=='G')gx=i,gy=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint xc=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(A[i][j]==-2)\n\t\t{\n\t\t\txc++;\n\t\t\txcnt[xc]=dfs(i,j,xc);\n\t\t\tnowcnt[xc]=0;\n\t\t}\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)dg[i][j]=H*W*2;\n\t\t\tdg[gx][gy]=0;\n\t\t\tqueue<pair<int,int> >P;\n\t\t\tP.push(make_pair(gx,gy));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\t\tP.pop();\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\t\tif(A[tx][ty]==-1||dg[tx][ty]<=dg[x][y]+1)continue;\n\t\t\t\t\tdg[tx][ty]=dg[x][y]+1;\n\t\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=90;\n\t\tvis[sx][sy]=true;\n\t\trec(sx,sy,0,-1);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3240,
"score_of_the_acc": -0.1166,
"final_rank": 11
},
{
"submission_id": "aoj_0247_4908266",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nint H,W;\nstring S[12];\nint sx,sy,gx,gy;\nint A[12][12];\nint dx[4]={1,0,0,-1},dy[4]={0,1,-1,0};\nint dfs(int x,int y,int col)\n{\n\tA[x][y]=col;\n\tint ret=1;\n\tfor(int r=0;r<4;r++)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(A[tx][ty]==-2)ret+=dfs(tx,ty,col);\n\t}\n\treturn ret;\n}\nint xcnt[150],nowcnt[150];\nint dg[12][12];\nbool vis[12][12];\nint ans;\nvoid rec(int x,int y,int now,int nr)\n{\n\tif(gx==x&&gy==y)ans=now;\n\tif(ans<=now+dg[x][y])return;\n\tfor(int r=0;r<4;r++)if(r+nr!=3)\n\t{\n\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\tif(vis[tx][ty]||A[tx][ty]==-1)continue;\n\t\tbool ok=true;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]++;\n\t\t\tif(nowcnt[A[tx][ty]]*2>xcnt[A[tx][ty]])ok=false;\n\t\t}\n\t\tvis[tx][ty]=true;\n\t\tif(ok)rec(tx,ty,now+1,r);\n\t\tvis[tx][ty]=false;\n\t\tif(A[tx][ty]>0)\n\t\t{\n\t\t\tnowcnt[A[tx][ty]]--;\n\t\t}\n\t}\n}\nmain()\n{\n\twhile(cin>>W>>H,H)\n\t{\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t\t{\n\t\t\tA[i][j]=0;\n\t\t\tvis[i][j]=false;\n\t\t}\n\t\tfor(int i=0;i<H;i++)\n\t\t{\n\t\t\tcin>>S[i];\n\t\t\tfor(int j=0;j<W;j++)\n\t\t\t{\n\t\t\t\tif(S[i][j]=='X')A[i][j]=-2;\n\t\t\t\telse if(S[i][j]=='#')A[i][j]=-1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i][j]=='S')sx=i,sy=j;\n\t\t\t\t\telse if(S[i][j]=='G')gx=i,gy=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint xc=0;\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)if(A[i][j]==-2)\n\t\t{\n\t\t\txc++;\n\t\t\txcnt[xc]=dfs(i,j,xc);\n\t\t\tnowcnt[xc]=0;\n\t\t}\n\t\t{\n\t\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)dg[i][j]=H*W*2;\n\t\t\tdg[gx][gy]=0;\n\t\t\tqueue<pair<int,int> >P;\n\t\t\tP.push(make_pair(gx,gy));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\t\tP.pop();\n\t\t\t\tfor(int r=0;r<4;r++)\n\t\t\t\t{\n\t\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W)continue;\n\t\t\t\t\tif(A[tx][ty]==-1||dg[tx][ty]<=dg[x][y]+1)continue;\n\t\t\t\t\tdg[tx][ty]=dg[x][y]+1;\n\t\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=H*W/2;\n\t\tif(ans<90)ans=90;\n\t\tvis[sx][sy]=true;\n\t\trec(sx,sy,0,-1);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3216,
"score_of_the_acc": -0.1161,
"final_rank": 10
},
{
"submission_id": "aoj_0247_4387702",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nvoid solve(int h, int w){\n array<int, 4> dx{-1, 1, 0, 0}, dy{0, 0, -1, 1};\n vector<vector<int>> v(h+2, vector<int>(w+2, -1));\n int sy, sx, gy, gx;\n for (int i = 0; i < h; ++i) {\n string s;\n cin >> s;\n for (int j = 0; j < w; ++j) {\n if(s[j] == 'X') v[i+1][j+1] = 1000;\n else if(s[j] == '#' || s[j] == 'S') v[i+1][j+1] = -1;\n else v[i+1][j+1] = 0;\n if(s[j] == 'S') sy = i+1, sx = j+1;\n else if(s[j] == 'G') gy = i+1, gx = j+1;\n }\n }\n vector<int> M{0};\n for (int i = 0, cur = 1; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if(v[i+1][j+1] == 1000){\n queue<pair<int, int>> Q;\n Q.emplace(i+1, j+1);\n M.emplace_back();\n v[i+1][j+1] = cur;\n while(!Q.empty()){\n M.back()++;\n int y, x; tie(y, x) = Q.front(); Q.pop();\n for (int k = 0; k < 4; ++k) {\n if(v[y+dy[k]][x+dx[k]] == 1000){\n v[y+dy[k]][x+dx[k]] = cur;\n Q.emplace(y+dy[k], x+dx[k]);\n }\n }\n }\n M.back() /= 2;\n cur++;\n }\n }\n }\n for (int ans = abs(sx-gx)+abs(sy-gy); ; ++ans) {\n auto G = v;\n vector<int> m(M.size());\n auto dfs = [&](int y, int x, int dep, auto &&f) -> bool {\n if(gy == y && gx == x) return true;\n if(dep+abs(gy-y)+abs(gx-x) > ans) return false;\n for (int k = 0; k < 4; ++k) {\n int p = G[y+dy[k]][x+dx[k]];\n if(p == 0){\n G[y+dy[k]][x+dx[k]] = -1;\n if(f(y+dy[k], x+dx[k], dep+1, f)) return true;\n G[y+dy[k]][x+dx[k]] = 0;\n }else if(p > 0 && m[p]+1 <= M[p]){\n m[p]++;\n G[y+dy[k]][x+dx[k]] = -1;\n if(f(y+dy[k], x+dx[k], dep+1, f)) return true;\n G[y+dy[k]][x+dx[k]] = p;\n m[p]--;\n }\n }\n return false;\n };\n if(dfs(sy, sx, 0, dfs)){\n cout << ans << \"\\n\";\n return;\n }\n }\n\n\n}\n\nint main() {\n int h, w;\n while(cin >> w >> h, h){\n solve(h, w);\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 3184,
"score_of_the_acc": -0.7583,
"final_rank": 14
},
{
"submission_id": "aoj_0247_3355176",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include <tuple>\n#include <queue>\nusing namespace std;\n\nint H, W, sx, sy, gx, gy, col[13][13], G[130], cnts, bit[130]; char c[13][13]; long long J[130], JJ[130];\nint dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };\nmap<long long, int>Map[13][13];\n\nvoid init() {\n\tH = 0; W = 0; sx = 0; sy = 0; gx = 0; gy = 0; cnts = 0;\n\tfor (int i = 0; i < 13; i++) {\n\t\tfor (int j = 0; j < 13; j++) { col[i][j] = 0; Map[i][j].clear(); c[i][j] = 0; }\n\t}\n\tfor (int i = 0; i < 130; i++) { G[i] = 0; J[i] = 0; JJ[i] = 0; }\n}\n\nvoid dfs1(int px, int py) {\n\tif (px < 0 || py < 0 || px >= H || py >= W) return;\n\tif (col[px][py] >= 1 || c[px][py] != 'X') return;\n\tcol[px][py] = cnts; G[cnts]++;\n\tfor (int i = 0; i < 4; i++) {\n\t\tdfs1(px + dx[i], py + dy[i]);\n\t}\n}\n\nint main() {\n\twhile (true) {\n\t\tinit();\n\t\tcin >> W >> H; if (H == 0 && W == 0) break;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> c[i][j];\n\t\t\t\tif (c[i][j] == 'S') { sx = i; sy = j; c[i][j] = '.'; }\n\t\t\t\tif (c[i][j] == 'G') { gx = i; gy = j; c[i][j] = '.'; }\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tif (c[i][j] != 'X' || col[i][j] >= 1) continue;\n\t\t\t\tcnts++; dfs1(i, j);\n\t\t\t}\n\t\t}\n\t\tJJ[1] = 1;\n\t\tfor (int i = 1; i <= cnts; i++) { J[i] = (G[i] / 2 + 1); if (i >= 2) JJ[i] = JJ[i - 1] * J[i - 1]; }\n\n\t\tqueue<tuple<int, int, long long>> Q;\n\t\tQ.push(make_tuple(sx, sy, 0)); Map[sx][sy][0] = 1;\n\t\t\n\t\tint ans = (1 << 30);\n\n\t\twhile (!Q.empty()) {\n\t\t\tint px = get<0>(Q.front()), py = get<1>(Q.front()); long long V = get<2>(Q.front()); Q.pop();\n\t\t\tint cost = Map[px][py][V];\n\t\t\tif (px == gx && py == gy) {\n\t\t\t\tans = min(ans, cost); break;\n\t\t\t}\n\n\t\t\tlong long VV = V;\n\t\t\tfor (int i = 1; i <= cnts; i++) { bit[i] = VV % J[i]; VV /= J[i]; }\n\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint vx = px + dx[i], vy = py + dy[i];\n\t\t\t\tif (vx < 0 || vy < 0 || vx >= H || vy >= W || c[vx][vy] == '#') continue;\n\n\t\t\t\tlong long I = V; bool die = false;\n\t\t\t\tif (col[vx][vy] >= 1) {\n\t\t\t\t\tI += JJ[col[vx][vy]];\n\t\t\t\t\tif (bit[col[vx][vy]] + 1 == J[col[vx][vy]]) die = true;\n\t\t\t\t}\n\t\t\t\tif (die == true) continue;\n\t\t\t\t\n\t\t\t\tif (Map[vx][vy][I] == 0) {\n\t\t\t\t\tMap[vx][vy][I] = cost + 1; Q.push(make_tuple(vx, vy, I));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans - 1 << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 50596,
"score_of_the_acc": -1.7429,
"final_rank": 16
},
{
"submission_id": "aoj_0247_3173489",
"code_snippet": "#include <queue>\n#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\nconst vector<int> dx = { 1, 0, -1, 0 };\nconst vector<int> dy = { 0, 1, 0, -1 };\nint H, W, sx, sy, gx, gy, comp_cnt; vector<int> comp_size; vector<vector<int> > dist, used; vector<vector<int> > comp; vector<string> s;\nvoid comp_dfs(int x, int y) {\n\tcomp[x][y] = comp_cnt;\n\t++comp_size[comp_cnt];\n\tfor (int i = 0; i < 4; ++i) {\n\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W && s[tx][ty] == 'X' && comp[tx][ty] == -1) {\n\t\t\tcomp_dfs(tx, ty);\n\t\t}\n\t}\n}\nbool reach(int x, int y, int rem) {\n\tif (x == gx && y == gy) return true;\n\tif (dist[x][y] > rem) return false;\n\tused[x][y] = rem;\n\tfor (int i = 0; i < 4; ++i) {\n\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W && s[tx][ty] != '#' && (s[tx][ty] != 'X' || comp_size[comp[tx][ty]] >= 2) && used[tx][ty] == -1) {\n\t\t\tbool ok = true;\n\t\t\tfor (int j = 0; j < 4 && ok; ++j) {\n\t\t\t\tint rx = tx + dx[j], ry = ty + dy[j];\n\t\t\t\tif (0 <= rx && rx < H && 0 <= ry && ry < W && used[rx][ry] >= rem + 2) ok = false;\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tif (s[tx][ty] == 'X') comp_size[comp[tx][ty]] -= 2;\n\t\t\t\tif (reach(tx, ty, rem - 1)) return true;\n\t\t\t\tif (s[tx][ty] == 'X') comp_size[comp[tx][ty]] += 2;\n\t\t\t}\n\t\t}\n\t}\n\tused[x][y] = -1;\n\treturn false;\n}\nint main() {\n\twhile (cin >> W >> H, H != 0) {\n\t\ts = vector<string>(H);\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tcin >> s[i];\n\t\t\tif (s[i].find('S') != string::npos) sx = i, sy = s[i].find('S');\n\t\t\tif (s[i].find('G') != string::npos) gx = i, gy = s[i].find('G');\n\t\t}\n\t\tcomp = vector<vector<int> >(H, vector<int>(W, -1));\n\t\tcomp_size.clear();\n\t\tcomp_cnt = 0;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (s[i][j] == 'X' && comp[i][j] == -1) {\n\t\t\t\t\tcomp_size.push_back(0);\n\t\t\t\t\tcomp_dfs(i, j);\n\t\t\t\t\t++comp_cnt;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdist = vector<vector<int> >(H, vector<int>(W, -1));\n\t\tdist[gx][gy] = 0;\n\t\tqueue<pair<int, int> > que; que.push(make_pair(gx, gy));\n\t\twhile (!que.empty()) {\n\t\t\tpair<int, int> u = que.front(); que.pop();\n\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\tint tx = u.first + dx[i], ty = u.second + dy[i];\n\t\t\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W && dist[tx][ty] == -1) {\n\t\t\t\t\tdist[tx][ty] = dist[u.first][u.second] + 1;\n\t\t\t\t\tque.push(make_pair(tx, ty));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tused = vector<vector<int> >(H, vector<int>(W, -1));\n\t\tint steps = 1;\n\t\twhile (!reach(sx, sy, steps)) ++steps;\n\t\tcout << steps << '\\n';\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3184,
"score_of_the_acc": -0.144,
"final_rank": 12
},
{
"submission_id": "aoj_0247_3173432",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\nconst vector<int> dx = { 1, 0, -1, 0 };\nconst vector<int> dy = { 0, 1, 0, -1 };\nint H, W, sx, sy, gx, gy, comp_cnt; vector<int> comp_size; vector<vector<int> > used; vector<vector<int> > comp; vector<string> s;\nvoid comp_dfs(int x, int y) {\n\tcomp[x][y] = comp_cnt;\n\t++comp_size[comp_cnt];\n\tfor (int i = 0; i < 4; ++i) {\n\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W && s[tx][ty] == 'X' && comp[tx][ty] == -1) {\n\t\t\tcomp_dfs(tx, ty);\n\t\t}\n\t}\n}\nbool reach(int x, int y, int rem) {\n\tif (x == gx && y == gy) return true;\n\tif (abs(x - gx) + abs(y - gy) > rem) return false;\n\tused[x][y] = rem;\n\tfor (int i = 0; i < 4; ++i) {\n\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W && s[tx][ty] != '#' && (s[tx][ty] != 'X' || comp_size[comp[tx][ty]] >= 2) && used[tx][ty] == -1) {\n\t\t\tbool ok = true;\n\t\t\tfor (int j = 0; j < 4 && ok; ++j) {\n\t\t\t\tint rx = tx + dx[j], ry = ty + dy[j];\n\t\t\t\tif (0 <= rx && rx < H && 0 <= ry && ry < W && used[rx][ry] >= rem + 2) ok = false;\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tif (s[tx][ty] == 'X') comp_size[comp[tx][ty]] -= 2;\n\t\t\t\tif (reach(tx, ty, rem - 1)) return true;\n\t\t\t\tif (s[tx][ty] == 'X') comp_size[comp[tx][ty]] += 2;\n\t\t\t}\n\t\t}\n\t}\n\tused[x][y] = -1;\n\treturn false;\n}\nint main() {\n\twhile (cin >> W >> H, H != 0) {\n\t\ts = vector<string>(H);\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tcin >> s[i];\n\t\t\tif (s[i].find('S') != string::npos) sx = i, sy = s[i].find('S');\n\t\t\tif (s[i].find('G') != string::npos) gx = i, gy = s[i].find('G');\n\t\t}\n\t\tcomp = vector<vector<int> >(H, vector<int>(W, -1));\n\t\tcomp_size.clear();\n\t\tcomp_cnt = 0;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (s[i][j] == 'X' && comp[i][j] == -1) {\n\t\t\t\t\tcomp_size.push_back(0);\n\t\t\t\t\tcomp_dfs(i, j);\n\t\t\t\t\t++comp_cnt;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tused = vector<vector<int> >(H, vector<int>(W, -1));\n\t\tint steps = 1;\n\t\twhile (!reach(sx, sy, steps)) ++steps;\n\t\tcout << steps << '\\n';\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3196,
"score_of_the_acc": -0.1586,
"final_rank": 13
},
{
"submission_id": "aoj_0247_3173386",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\nconst vector<int> dx = { 1, 0, -1, 0 };\nconst vector<int> dy = { 0, 1, 0, -1 };\nint H, W, sx, sy, gx, gy, comp_cnt; vector<int> comp_size, used; vector<vector<int> > comp; vector<string> s;\nvoid comp_dfs(int x, int y) {\n\tcomp[x][y] = comp_cnt;\n\t++comp_size[comp_cnt];\n\tfor (int i = 0; i < 4; ++i) {\n\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W && s[tx][ty] == 'X' && comp[tx][ty] == -1) {\n\t\t\tcomp_dfs(tx, ty);\n\t\t}\n\t}\n}\nbool reach(int x, int y, int rem) {\n\tif (x == gx && y == gy) return true;\n\tif (abs(x - gx) + abs(y - gy) > rem) return false;\n\tused[x] += 1 << y;\n\tfor (int i = 0; i < 4; ++i) {\n\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W && s[tx][ty] != '#' && (s[tx][ty] != 'X' || comp_size[comp[tx][ty]] >= 2) && !((used[tx] >> ty) & 1)) {\n\t\t\tif (s[tx][ty] == 'X') comp_size[comp[tx][ty]] -= 2;\n\t\t\tif (reach(tx, ty, rem - 1)) return true;\n\t\t\tif (s[tx][ty] == 'X') comp_size[comp[tx][ty]] += 2;\n\t\t}\n\t}\n\tused[x] -= 1 << y;\n\treturn false;\n}\nint main() {\n\twhile (cin >> W >> H, H != 0) {\n\t\ts = vector<string>(H);\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tcin >> s[i];\n\t\t\tif (s[i].find('S') != string::npos) sx = i, sy = s[i].find('S');\n\t\t\tif (s[i].find('G') != string::npos) gx = i, gy = s[i].find('G');\n\t\t}\n\t\tcomp = vector<vector<int> >(H, vector<int>(W, -1));\n\t\tcomp_size.clear();\n\t\tcomp_cnt = 0;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (s[i][j] == 'X' && comp[i][j] == -1) {\n\t\t\t\t\tcomp_size.push_back(0);\n\t\t\t\t\tcomp_dfs(i, j);\n\t\t\t\t\t++comp_cnt;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tused = vector<int>(H, 0);\n\t\tint steps = 1;\n\t\twhile (!reach(sx, sy, steps)) ++steps;\n\t\tcout << steps << '\\n';\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 710,
"memory_kb": 3192,
"score_of_the_acc": -1.0013,
"final_rank": 15
},
{
"submission_id": "aoj_0247_3096073",
"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 12\n\nstruct Info{\n\tInfo(){\n\t\trow = col = 0;\n\t}\n\tInfo(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tvoid set(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tbool operator==(const struct Info &arg) const{\n\t\treturn row == arg.row && col == arg.col;\n\t}\n\tint row,col;\n};\n\nint W,H;\nint ice_index,index_table[NUM][NUM];\nint diff_row[4] = {1,0,-1,0},diff_col[4] = {0,1,0,-1};\nint num_member[NUM*NUM],ice_count_table[NUM*NUM];\nint ans;\nchar base_map[NUM][NUM+1];\nbool visited[NUM][NUM];\nInfo start,goal;\n\nbool rangeCheck(Info info){\n\tif(info.row >= 0 && info.row <= H-1 && info.col >= 0 && info.col <= W-1){\n\t\treturn true;\n\t}else{\n\t\treturn false;\n\t}\n}\n\nvoid recursive(Info info,int sum_cost){\n\n\tif(info == goal){\n\t\tans = min(ans,sum_cost);\n\t\treturn;\n\t}\n\n\t//最小値が出ないならreturn\n\tif(sum_cost+abs(info.row-goal.row)+abs(info.col-goal.col) >= ans){\n\t\treturn;\n\t}\n\n\tint adj_row,adj_col;\n\tint adj_row_2,adj_col_2;\n\n\tbool FLG;\n\n\tfor(int i = 0; i < 4; i++){\n\n\t\tadj_row = info.row+diff_row[i];\n\t\tadj_col = info.col+diff_col[i];\n\n\t\tif(rangeCheck(Info(adj_row,adj_col)) == false || base_map[adj_row][adj_col] == '#' ||\n\t\t\t\tvisited[adj_row][adj_col] == true)continue;\n\n\t\t//最小値が出ないならcontinue\n\t\tif(sum_cost+abs(adj_row-goal.row)+abs(adj_col-goal.col) >= ans)continue;\n\n\t\tFLG = true;\n\n\t\tfor(int k = 0; k < 4; k++){\n\t\t\tadj_row_2 = adj_row+diff_row[k];\n\t\t\tadj_col_2 = adj_col+diff_col[k];\n\n\t\t\tif(rangeCheck(Info(adj_row_2,adj_col_2)) == false || base_map[adj_row_2][adj_col_2] == '#' ||\n\t\t\t\t\t(adj_row_2 == info.row && adj_col_2 == info.col))continue;\n\n\t\t\tif(visited[adj_row_2][adj_col_2]){\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!FLG)continue;\n\n\t\tif(base_map[adj_row][adj_col] == '.'){\n\n\t\t\tvisited[adj_row][adj_col] = true;\n\t\t\trecursive(Info(adj_row,adj_col),sum_cost+1);\n\n\t\t\tvisited[adj_row][adj_col] = false;\n\n\t\t}else{ //base_map[adj_row][adj_col] == 'X'\n\n\t\t\tint tmp_index = index_table[adj_row][adj_col];\n\t\t\tif(ice_count_table[tmp_index]+1 > num_member[tmp_index]/2)continue; //氷が割れるのでcontinue\n\n\t\t\tvisited[adj_row][adj_col] = true;\n\t\t\tice_count_table[tmp_index]++;\n\t\t\trecursive(Info(adj_row,adj_col),sum_cost+1);\n\n\t\t\tvisited[adj_row][adj_col] = false;\n\t\t\tice_count_table[tmp_index]--;\n\t\t}\n\t}\n}\n\nvoid func(){\n\n\tfor(int row = 0; row < H; row++){\n\t\tscanf(\"%s\",base_map[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(base_map[row][col] == 'S'){\n\n\t\t\t\tstart.set(row,col);\n\t\t\t\tbase_map[row][col] = '.';\n\n\t\t\t}else if(base_map[row][col] == 'G'){\n\n\t\t\t\tgoal.set(row,col);\n\t\t\t\tbase_map[row][col] = '.';\n\t\t\t}\n\t\t}\n\t}\n\n\t//氷マスを連結させる&枚数を数える\n\tice_index = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tindex_table[row][col] = -1;\n\t\t}\n\t}\n\n\tqueue<Info> Q;\n\tint adj_row,adj_col,count;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(base_map[row][col] != 'X' || index_table[row][col] != -1)continue;\n\n\t\t\tindex_table[row][col] = ice_index;\n\t\t\tQ.push(Info(row,col));\n\n\t\t\tcount = 1;\n\n\t\t\twhile(!Q.empty()){\n\n\t\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\t\tadj_row = Q.front().row+diff_row[i];\n\t\t\t\t\tadj_col = Q.front().col+diff_col[i];\n\n\t\t\t\t\tif(rangeCheck(Info(adj_row,adj_col)) == false || base_map[adj_row][adj_col] != 'X' ||\n\t\t\t\t\t\t\tindex_table[adj_row][adj_col] != -1)continue;\n\n\t\t\t\t\tindex_table[adj_row][adj_col] = ice_index;\n\t\t\t\t\tcount++;\n\n\t\t\t\t\tQ.push(Info(adj_row,adj_col));\n\t\t\t\t}\n\t\t\t\tQ.pop();\n\t\t\t}\n\n\t\t\tnum_member[ice_index] = count;\n\t\t\tice_index++;\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tvisited[row][col] = false;\n\t\t}\n\t}\n\tvisited[start.row][start.col] = true;\n\n\tans = H*W;\n\tfor(int i = 0; i < ice_index; i++)ice_count_table[i] = 0;\n\n\trecursive(start,0);\n\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": 90,
"memory_kb": 3128,
"score_of_the_acc": -0.1143,
"final_rank": 8
},
{
"submission_id": "aoj_0247_2460549",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n\nint W, H;\n\nchar ma[16][16];\nchar g[16][16];\nbool v[16][16];\n\nint maxIce[128];\nint ice[128];\n\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\n\nint ans;\nint px, py;\nint sx, sy, gx, gy;\n\nbool getMin(int ty, int tx, int turn)\n{\n\n if (turn + abs(ty - gy) + abs(tx - gx) >= ans){\n return (false);\n }\n\n if (ty == gy && tx == gx){\n ans = turn;\n return (true);\n }\n\n for (int i = 0; i < 4; i++){\n int mx = tx + dx[i], my = ty + dy[i];\n if (0 <= mx && mx < W && 0 <= my && my < H && px != mx && py != my && v[my][mx]){\n return (false);\n }\n }\n\n for (int i = 0; i < 4; i++){\n int mx = tx + dx[i], my = ty + dy[i];\n px = tx, py = ty;\n if (0 <= mx && mx < W && 0 <= my && my < H && ma[my][mx] != '#' && !v[my][mx]){\n if (g[my][mx] == -1){\n v[my][mx] = true;\n if (getMin(my, mx, turn + 1)) return (true);\n v[my][mx] = false;\n }\n else if (maxIce[g[my][mx]] >= ice[g[my][mx]] + 1){\n ice[g[my][mx]]++;\n v[my][mx] = true;\n if (getMin(my, mx, turn + 1)) return (true);\n v[my][mx] = false;\n ice[g[my][mx]]--;\n }\n }\n }\n\n return (false);\n}\n\nvoid label(int ty, int tx, int p)\n{\n g[ty][tx] = p;\n maxIce[p]++;\n\n for (int i = 0; i < 4; i++){\n int mx = tx + dx[i], my = ty + dy[i];\n\n if (0 <= mx && mx < W && 0 <= my && my < H &&\n ma[my][mx] == 'X' && g[my][mx] == -1){\n label(my, mx, p);\n }\n }\n}\n\nint main()\n{\n int idx;\n\n while (1){\n scanf(\"%d %d\", &W, &H);\n\n if (W + H == 0){\n break;\n }\n\n for (int i = 0; i < H; i++){\n scanf(\"%s\", ma[i]);\n for (int j = 0; j < W; j++){\n if (ma[i][j] == 'S'){\n ma[i][j] = '.';\n sx = j, sy = i;\n }\n if (ma[i][j] == 'G'){\n ma[i][j] = '.';\n gx = j, gy = i;\n }\n }\n }\n\n memset(g, -1, sizeof(g));\n memset(maxIce, 0, sizeof(maxIce));\n\n idx = 0;\n for (int i = 0; i < H; i++){\n for (int j = 0; j < W; j++){\n if (ma[i][j] == 'X' && g[i][j] == -1){\n label(i, j, idx);\n maxIce[idx++] /= 2;\n }\n }\n }\n\n memset(ice, 0, sizeof(ice));\n memset(v, 0, sizeof(v));\n px = py = -1;\n v[sy][sx] = true;\n\n ans = 0;\n while (!getMin(sy, sx, 0)){\n memset(ice, 0, sizeof(ice));\n memset(v, 0, sizeof(v));\n px = py = -1;\n v[sy][sx] = true;\n ans++;\n }\n\n printf(\"%d\\n\", ans);\n }\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3152,
"score_of_the_acc": -0.1148,
"final_rank": 9
},
{
"submission_id": "aoj_0247_2095444",
"code_snippet": "#include<iostream>\n#include<stack>\n#include<queue>\n#include<cstring>\n#define INF 1 << 15\nusing namespace std;\nstruct d{\n\tint x;\n\tint y;\n\tint visited[12][12];\n\tint ic[144];\n\tint cnt;\n};\nstruct b{\n\tint x;\n\tint y;\n};\nint main(){\n\tint lx,ly,i,j,nc=1,k,a,min=144,gx,gy,ex,ey;\n\tint maps[12][12]={0};\n\tint mx[4]={-1,0,1,0};\n\tint my[4]={0,-1,0,1};\n\tint ig[144]={0};\n\tint f[12][12];\n\tint mapc[13][13];\n\tchar map[13][13];\n\tqueue<b> q;\n\tb v,u;\n\tstack<d> s;\n\td r,t;\n\twhile(1){\n\t\tcin>>lx>>ly;\n\t\t\tif(lx==0&&ly==0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\tmemset(mapc,-1,sizeof(mapc));\n\t\t\tnc=1;\n\t\t\tmemset(maps,0,sizeof(maps));\n\t\t\tmemset(ig,0,sizeof(ig));\n\t\t\tmin=144;\n\t\tfor(i=0;i<ly;i++){\n\t\t\tcin>>map[i];\n\t\t}\n\t\tfor(i=0;i<ly;i++){\n\t\t\tfor(j=0;j<lx;j++){\n\t\t\t\t\tif(map[i][j]=='S'){\n\t\t\t\t\tr.x=j;\n\t\t\t\t\t\tr.y=i;\n\t\t\t\t\tmemset(r.visited,0,sizeof(r.visited));\n\t\t\t\t\tmemset(r.ic,0,sizeof(r.ic));\n\t\t\t\t\tr.cnt=0;\n\t\t\t\t\t\tmapc[i][j]=0;\n\t\t\t\t\ts.push(r);\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='G'){\n\t\t\t\t\tgx=j;\n\t\t\t\t\tgy=i;\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='X'&&maps[i][j]==0){\n\t\t\t\t\tv.x=j;\n\t\t\t\t\tv.y=i;\n\t\t\t\t\tq.push(v);\n\t\t\t\t\twhile(!q.empty()){\n\t\t\t\t\t\tv=q.front();\n\t\t\t\t\t\tq.pop();\n\t\t\t\t\t\tmaps[v.y][v.x]=nc;\n\t\t\t\t\t\tig[nc]++;\n\t\t\t\t\t\tfor(k=0;k<4;k++){\n\t\t\t\t\t\t\tu=v;\n\t\t\t\t\t\t\tu.x+=mx[k];\n\t\t\t\t\t\t\tu.y+=my[k];\n\t\t\t\t\t\t\tif(map[u.y][u.x]=='X'&&maps[u.y][u.x]==0&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly){\n\t\t\t\t\t\t\t\tq.push(u);\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(ig[nc]==1){\n\t\t\t\t\t\tmap[v.y][v.x]='#';\n\t\t\t\t\t}\n\t\t\t\t\tnc++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tv.x=gx;\n\t\tv.y=gy;\n\t\t\n\t\tmemset(f,-1,sizeof(f));\n\t\tf[gy][gx]=0;\n\t\tq.push(v);\n\t\twhile(!q.empty()){\n\t\t\tv=q.front();\n\t\t\tq.pop();\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tu=v;\n\t\t\t\tu.x+=mx[i];\n\t\t\t\tu.y+=my[i];\n\t\t\t\tif(map[u.y][u.x]!='#'&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly&&f[u.y][u.x]==-1){\n\t\t\t\t\tq.push(u);\n\t\t\t\t\tf[u.y][u.x]=f[v.y][v.x]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\twhile(!s.empty()){\n\t\t\tr=s.top();\n\t\t\ts.pop();\n\t\t\tif(r.visited[r.y][r.x]==1){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tr.visited[r.y][r.x]=1;\n\t\t\t}\n\t\t\tif(r.cnt+f[r.y][r.x]>=min){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tt=r;\n\t\t\t\tt.x+=mx[i];\n\t\t\t\tt.y+=my[i];\n\t\t\t\tt.cnt++;\n\t\t\t\tif(map[t.y][t.x]!='#'&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly){\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tif(mapc[t.y][t.x]>=r.cnt+1||mapc[t.y][t.x]==-1){\n\t\t\t\t\t\t\tif(map[t.y][t.x]=='G'){\n\t\t\t\t\t\t\t\tex=t.x;\n\t\t\t\t\t\t\t\tey=t.y;\n\t\t\t\t\t\t\t\tmin=t.cnt;\n\t\t\t\t\t\t\t\tmapc[t.y][t.x]=r.cnt+1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(map[t.y][t.x]=='X'){\n\t\t\t\t\t\t\t\ta=maps[t.y][t.x];\n\t\t\t\t\t\t\t\tt.ic[a]++;\n\t\t\t\t\t\t\t\tif(t.ic[a]<=(ig[a]/2)){\n\t\t\t\t\t\t\t\t\tmapc[t.y][t.x]=r.cnt+1;\n\t\t\t\t\t\t\t\t\ts.push(t);\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\telse{\n\t\t\t\t\t\t\t\tmapc[t.y][t.x]=r.cnt+1;\n\t\t\t\t\t\t\t\ts.push(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\tif(mapc[t.y][t.x]<=r.cnt){\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t}\n\t\tcout<<mapc[ey][ex]<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5696,
"score_of_the_acc": -0.0541,
"final_rank": 7
},
{
"submission_id": "aoj_0247_2095393",
"code_snippet": "#include<iostream>\n#include<stack>\n#include<queue>\n#include<cstring>\n#define INF 1 << 15\nusing namespace std;\nstruct d{\n\tint x;\n\tint y;\n\tint visited[12][12];\n\tint ic[144];\n\tint cnt;\n};\nstruct b{\n\tint x;\n\tint y;\n};\nint main(){\n\tint lx,ly,i,j,nc=1,k,a,min=144,gx,gy,ex,ey;\n\tint maps[12][12]={0};\n\tint mx[4]={-1,0,1,0};\n\tint my[4]={0,-1,0,1};\n\tint ig[144]={0};\n\tint f[12][12];\n\tint mapc[13][13];\n\tchar map[13][13];\n\tqueue<b> q;\n\tb v,u;\n\tstack<d> s;\n\td r,t;\n\twhile(1){\n\t\tcin>>lx>>ly;\n\t\t\tif(lx==0&&ly==0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\tmemset(mapc,-1,sizeof(mapc));\n\t\t\tnc=1;\n\t\t\tmemset(maps,0,sizeof(maps));\n\t\t\tmemset(ig,0,sizeof(ig));\n\t\t\tmin=144;\n\t\tfor(i=0;i<ly;i++){\n\t\t\tcin>>map[i];\n\t\t}\n\t\tfor(i=0;i<ly;i++){\n\t\t\tfor(j=0;j<lx;j++){\n\t\t\t\t\tif(map[i][j]=='S'){\n\t\t\t\t\tr.x=j;\n\t\t\t\t\t\tr.y=i;\n\t\t\t\t\tmemset(r.visited,0,sizeof(r.visited));\n\t\t\t\t\tmemset(r.ic,0,sizeof(r.ic));\n\t\t\t\t\tr.cnt=0;\n\t\t\t\t\t\tmapc[i][j]=0;\n\t\t\t\t\ts.push(r);\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='G'){\n\t\t\t\t\tgx=j;\n\t\t\t\t\tgy=i;\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='X'&&maps[i][j]==0){\n\t\t\t\t\tv.x=j;\n\t\t\t\t\tv.y=i;\n\t\t\t\t\tq.push(v);\n\t\t\t\t\twhile(!q.empty()){\n\t\t\t\t\t\tv=q.front();\n\t\t\t\t\t\tq.pop();\n\t\t\t\t\t\tmaps[v.y][v.x]=nc;\n\t\t\t\t\t\tig[nc]++;\n\t\t\t\t\t\tfor(k=0;k<4;k++){\n\t\t\t\t\t\t\tu=v;\n\t\t\t\t\t\t\tu.x+=mx[k];\n\t\t\t\t\t\t\tu.y+=my[k];\n\t\t\t\t\t\t\tif(map[u.y][u.x]=='X'&&maps[u.y][u.x]==0&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly){\n\t\t\t\t\t\t\t\tq.push(u);\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(ig[nc]==1){\n\t\t\t\t\t\tmap[v.y][v.x]='#';\n\t\t\t\t\t}\n\t\t\t\t\tnc++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tv.x=gx;\n\t\tv.y=gy;\n\t\t\n\t\tmemset(f,-1,sizeof(f));\n\t\tf[gy][gx]=0;\n\t\tq.push(v);\n\t\twhile(!q.empty()){\n\t\t\tv=q.front();\n\t\t\tq.pop();\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tu=v;\n\t\t\t\tu.x+=mx[i];\n\t\t\t\tu.y+=my[i];\n\t\t\t\tif(map[u.y][u.x]!='#'&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly&&f[u.y][u.x]==-1){\n\t\t\t\t\tq.push(u);\n\t\t\t\t\tf[u.y][u.x]=f[v.y][v.x]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\twhile(!s.empty()){\n\t\t\tr=s.top();\n\t\t\ts.pop();\n\t\t\tif(r.visited[r.y][r.x]==1){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tr.visited[r.y][r.x]=1;\n\t\t\t}\n\t\t\tif(r.cnt+f[r.y][r.x]>=min){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tt=r;\n\t\t\t\tt.x+=mx[i];\n\t\t\t\tt.y+=my[i];\n\t\t\t\tt.cnt++;\n\t\t\t\tif(map[t.y][t.x]!='#'&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly){\n\t\t\t\t\t\n\t\t\t\tif(mapc[t.y][t.x]>r.cnt+1||mapc[t.y][t.x]==-1){\n\t\t\t\t\t\tmapc[t.y][t.x]=r.cnt+1;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tif(mapc[t.y][t.x]<=r.cnt){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tif(map[t.y][t.x]=='G'&&t.cnt<min&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly){\n\t\t\t\t\tex=t.x;\n\t\t\t\t\tey=t.y;\n\t\t\t\t\tmin=t.cnt;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\tif(map[t.y][t.x]=='X'){\n\t\t\t\t\t\ta=maps[t.y][t.x];\n\t\t\t\t\t\tt.ic[a]++;\n\t\t\t\t\t\tif(t.ic[a]<=(ig[a]/2)){\n\t\t\t\t\t\t\ts.push(t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\ts.push(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<mapc[ey][ex]<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.8,
"time_ms": 10,
"memory_kb": 5648,
"score_of_the_acc": -0.0531,
"final_rank": 17
},
{
"submission_id": "aoj_0247_2095381",
"code_snippet": "#include<iostream>\n#include<stack>\n#include<queue>\n#include<cstring>\n#define INF 1 << 15\nusing namespace std;\nstruct d{\n\tint x;\n\tint y;\n\tint visited[12][12];\n\tint ic[144];\n\tint cnt;\n};\nstruct b{\n\tint x;\n\tint y;\n};\nint main(){\n\tint lx,ly,i,j,nc=1,k,a,min=144,gx,gy,ex,ey;\n\tint maps[12][12]={0};\n\tint mx[4]={-1,0,1,0};\n\tint my[4]={0,-1,0,1};\n\tint ig[144]={0};\n\tint f[12][12];\n\tint mapc[13][13];\n\tchar map[13][13];\n\tqueue<b> q;\n\tb v,u;\n\tstack<d> s;\n\td r,t;\n\twhile(1){\n\t\tcin>>lx>>ly;\n\t\t\tif(lx==0&&ly==0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\tmemset(mapc,-1,sizeof(mapc));\n\t\t\tnc=1;\n\t\t\tmemset(maps,0,sizeof(maps));\n\t\t\tmemset(ig,0,sizeof(ig));\n\t\t\tmin=144;\n\t\tfor(i=0;i<ly;i++){\n\t\t\tcin>>map[i];\n\t\t}\n\t\tfor(i=0;i<ly;i++){\n\t\t\tfor(j=0;j<lx;j++){\n\t\t\t\t\tif(map[i][j]=='S'){\n\t\t\t\t\tr.x=j;\n\t\t\t\t\t\tr.y=i;\n\t\t\t\t\tmemset(r.visited,0,sizeof(r.visited));\n\t\t\t\t\tmemset(r.ic,0,sizeof(r.ic));\n\t\t\t\t\tr.cnt=0;\n\t\t\t\t\t\tmapc[i][j]=0;\n\t\t\t\t\ts.push(r);\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='G'){\n\t\t\t\t\tgx=j;\n\t\t\t\t\tgy=i;\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='X'&&maps[i][j]==0){\n\t\t\t\t\tv.x=j;\n\t\t\t\t\tv.y=i;\n\t\t\t\t\tq.push(v);\n\t\t\t\t\twhile(!q.empty()){\n\t\t\t\t\t\tv=q.front();\n\t\t\t\t\t\tq.pop();\n\t\t\t\t\t\tmaps[v.y][v.x]=nc;\n\t\t\t\t\t\tig[nc]++;\n\t\t\t\t\t\tfor(k=0;k<4;k++){\n\t\t\t\t\t\t\tu=v;\n\t\t\t\t\t\t\tu.x+=mx[k];\n\t\t\t\t\t\t\tu.y+=my[k];\n\t\t\t\t\t\t\tif(map[u.y][u.x]=='X'&&maps[u.y][u.x]==0&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly){\n\t\t\t\t\t\t\t\tq.push(u);\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(ig[nc]==1){\n\t\t\t\t\t\tmap[v.y][v.x]='#';\n\t\t\t\t\t}\n\t\t\t\t\tnc++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tv.x=gx;\n\t\tv.y=gy;\n\t\t\n\t\tmemset(f,-1,sizeof(f));\n\t\tf[gy][gx]=0;\n\t\tq.push(v);\n\t\twhile(!q.empty()){\n\t\t\tv=q.front();\n\t\t\tq.pop();\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tu=v;\n\t\t\t\tu.x+=mx[i];\n\t\t\t\tu.y+=my[i];\n\t\t\t\tif(map[u.y][u.x]!='#'&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly&&f[u.y][u.x]==-1){\n\t\t\t\t\tq.push(u);\n\t\t\t\t\tf[u.y][u.x]=f[v.y][v.x]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\twhile(!s.empty()){\n\t\t\tr=s.top();\n\t\t\ts.pop();\n\t\t\tif(r.visited[r.y][r.x]==1){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tr.visited[r.y][r.x]=1;\n\t\t\t}\n\t\t\tif(r.cnt+f[r.y][r.x]>=min){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tt=r;\n\t\t\t\tt.x+=mx[i];\n\t\t\t\tt.y+=my[i];\n\t\t\t\tt.cnt++;\n\t\t\t\tif(map[t.y][t.x]!='#'&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly){\n\t\t\t\t\t\n\t\t\t\tif(mapc[t.y][t.x]>r.cnt+1||mapc[t.y][t.x]==-1){\n\t\t\t\t\t\tmapc[t.y][t.x]=r.cnt+1;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tif(mapc[t.y][t.x]<=r.cnt){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tif(map[t.y][t.x]=='G'&&t.cnt<min&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly){\n\t\t\t\t\tex=t.x;\n\t\t\t\t\tey=t.y;\n\t\t\t\t\tmin=t.cnt;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(r.visited[t.y][t.x]==0){\n\t\t\t\t\t\n\t\t\t\t\tif(map[t.y][t.x]=='X'){\n\t\t\t\t\t\ta=maps[t.y][t.x];\n\t\t\t\t\t\tt.ic[a]++;\n\t\t\t\t\t\tif(t.ic[a]<=(ig[a]/2)){\n\t\t\t\t\t\t\ts.push(t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\ts.push(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<mapc[ey][ex]<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.8,
"time_ms": 10,
"memory_kb": 5660,
"score_of_the_acc": -0.0533,
"final_rank": 18
},
{
"submission_id": "aoj_0247_2095373",
"code_snippet": "#include<iostream>\n#include<stack>\n#include<queue>\n#include<cstring>\n#define INF 1 << 15\nusing namespace std;\nstruct d{\n\tint x;\n\tint y;\n\tint visited[12][12];\n\tint ic[144];\n\tint cnt;\n};\nstruct b{\n\tint x;\n\tint y;\n};\nint main(){\n\tint lx,ly,i,j,nc=1,k,a,min=144,gx,gy,ex,ey;\n\tint maps[12][12]={0};\n\tint mx[4]={-1,0,1,0};\n\tint my[4]={0,-1,0,1};\n\tint ig[144]={0};\n\tint f[12][12];\n\tint mapc[13][13];\n\tchar map[13][13];\n\tqueue<b> q;\n\tb v,u;\n\tstack<d> s;\n\td r,t;\n\twhile(1){\n\t\tcin>>lx>>ly;\n\t\t\tif(lx==0&&ly==0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\tmemset(mapc,-1,sizeof(mapc));\n\t\t\tnc=1;\n\t\t\tmemset(maps,0,sizeof(maps));\n\t\t\tmemset(ig,0,sizeof(ig));\n\t\t\tmin=144;\n\t\tfor(i=0;i<ly;i++){\n\t\t\tcin>>map[i];\n\t\t}\n\t\tfor(i=0;i<ly;i++){\n\t\t\tfor(j=0;j<lx;j++){\n\t\t\t\t\tif(map[i][j]=='S'){\n\t\t\t\t\tr.x=j;\n\t\t\t\t\t\tr.y=i;\n\t\t\t\t\tmemset(r.visited,0,sizeof(r.visited));\n\t\t\t\t\tmemset(r.ic,0,sizeof(r.ic));\n\t\t\t\t\tr.cnt=0;\n\t\t\t\t\t\tmapc[i][j]=0;\n\t\t\t\t\ts.push(r);\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='G'){\n\t\t\t\t\tgx=j;\n\t\t\t\t\tgy=i;\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='X'&&maps[i][j]==0){\n\t\t\t\t\tv.x=j;\n\t\t\t\t\tv.y=i;\n\t\t\t\t\tq.push(v);\n\t\t\t\t\twhile(!q.empty()){\n\t\t\t\t\t\tv=q.front();\n\t\t\t\t\t\tq.pop();\n\t\t\t\t\t\tmaps[v.y][v.x]=nc;\n\t\t\t\t\t\tig[nc]++;\n\t\t\t\t\t\tfor(k=0;k<4;k++){\n\t\t\t\t\t\t\tu=v;\n\t\t\t\t\t\t\tu.x+=mx[k];\n\t\t\t\t\t\t\tu.y+=my[k];\n\t\t\t\t\t\t\tif(map[u.y][u.x]=='X'&&maps[u.y][u.x]==0&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly){\n\t\t\t\t\t\t\t\tq.push(u);\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(ig[nc]==1){\n\t\t\t\t\t\tmap[v.y][v.x]='#';\n\t\t\t\t\t}\n\t\t\t\t\tnc++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tv.x=gx;\n\t\tv.y=gy;\n\t\t\n\t\tmemset(f,-1,sizeof(f));\n\t\tf[gy][gx]=0;\n\t\tq.push(v);\n\t\twhile(!q.empty()){\n\t\t\tv=q.front();\n\t\t\tq.pop();\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tu=v;\n\t\t\t\tu.x+=mx[i];\n\t\t\t\tu.y+=my[i];\n\t\t\t\tif(map[u.y][u.x]!='#'&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly&&f[u.y][u.x]==-1){\n\t\t\t\t\tq.push(u);\n\t\t\t\t\tf[u.y][u.x]=f[v.y][v.x]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\twhile(!s.empty()){\n\t\t\tr=s.top();\n\t\t\ts.pop();\n\t\t\tif(r.visited[r.y][r.x]==1){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tr.visited[r.y][r.x]=1;\n\t\t\t}\n\t\t\tif(r.cnt+f[r.y][r.x]>=min){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tt=r;\n\t\t\t\tt.x+=mx[i];\n\t\t\t\tt.y+=my[i];\n\t\t\t\tt.cnt++;\n\t\t\t\tif(map[t.y][t.x]!='#'&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly){\n\t\t\t\t\t\n\t\t\t\tif(mapc[t.y][t.x]>r.cnt+1||mapc[t.y][t.x]==-1){\n\t\t\t\t\t\tmapc[t.y][t.x]=r.cnt+1;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tif(mapc[t.y][t.x]<r.cnt){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tif(map[t.y][t.x]=='G'&&t.cnt<min&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly){\n\t\t\t\t\tex=t.x;\n\t\t\t\t\tey=t.y;\n\t\t\t\t\tmin=t.cnt;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(r.visited[t.y][t.x]==0){\n\t\t\t\t\t\n\t\t\t\t\tif(map[t.y][t.x]=='X'){\n\t\t\t\t\t\ta=maps[t.y][t.x];\n\t\t\t\t\t\tt.ic[a]++;\n\t\t\t\t\t\tif(t.ic[a]<=(ig[a]/2)){\n\t\t\t\t\t\t\ts.push(t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\ts.push(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<mapc[ey][ex]<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.8,
"time_ms": 10,
"memory_kb": 5796,
"score_of_the_acc": -0.0562,
"final_rank": 20
},
{
"submission_id": "aoj_0247_2095353",
"code_snippet": "#include<iostream>\n#include<stack>\n#include<queue>\n#include<cstring>\n#define INF 1 << 15\nusing namespace std;\nstruct d{\n\tint x;\n\tint y;\n\tint visited[12][12];\n\tint ic[144];\n\tint cnt;\n};\nstruct b{\n\tint x;\n\tint y;\n};\nint main(){\n\tint lx,ly,i,j,nc=1,k,a,min=144,gx,gy;\n\tint maps[12][12]={0};\n\tint mx[4]={-1,0,1,0};\n\tint my[4]={0,-1,0,1};\n\tint ig[144]={0};\n\tint f[12][12];\n\tint mapc[12][12];\n\tchar map[13][13];\n\tqueue<b> q;\n\tb v,u;\n\tstack<d> s;\n\td r,t;\n\twhile(1){\n\t\tcin>>lx>>ly;\n\t\t\tif(lx==0&&ly==0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\tmemset(mapc,-1,sizeof(mapc));\n\t\t\tnc=1;\n\t\t\tmemset(maps,0,sizeof(maps));\n\t\t\tmemset(ig,0,sizeof(ig));\n\t\t\tmin=144;\n\t\tfor(i=0;i<ly;i++){\n\t\t\tcin>>map[i];\n\t\t}\n\t\tfor(i=0;i<ly;i++){\n\t\t\tfor(j=0;j<lx;j++){\n\t\t\t\t\tif(map[i][j]=='S'){\n\t\t\t\t\tr.x=j;\n\t\t\t\t\t\tr.y=i;\n\t\t\t\t\tmemset(r.visited,0,sizeof(r.visited));\n\t\t\t\t\tmemset(r.ic,0,sizeof(r.ic));\n\t\t\t\t\tr.cnt=0;\n\t\t\t\t\t\tmapc[i][j]=0;\n\t\t\t\t\ts.push(r);\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='G'){\n\t\t\t\t\tgx=j;\n\t\t\t\t\tgy=i;\n\t\t\t\t}\n\t\t\t\tif(map[i][j]=='X'&&maps[i][j]==0){\n\t\t\t\t\tv.x=j;\n\t\t\t\t\tv.y=i;\n\t\t\t\t\tq.push(v);\n\t\t\t\t\twhile(!q.empty()){\n\t\t\t\t\t\tv=q.front();\n\t\t\t\t\t\tq.pop();\n\t\t\t\t\t\tmaps[v.y][v.x]=nc;\n\t\t\t\t\t\tig[nc]++;\n\t\t\t\t\t\tfor(k=0;k<4;k++){\n\t\t\t\t\t\t\tu=v;\n\t\t\t\t\t\t\tu.x+=mx[k];\n\t\t\t\t\t\t\tu.y+=my[k];\n\t\t\t\t\t\t\tif(map[u.y][u.x]=='X'&&maps[u.y][u.x]==0&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly){\n\t\t\t\t\t\t\t\tq.push(u);\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(ig[nc]==1){\n\t\t\t\t\t\tmap[v.y][v.x]='#';\n\t\t\t\t\t}\n\t\t\t\t\tnc++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tv.x=gx;\n\t\tv.y=gy;\n\t\t\n\t\tmemset(f,-1,sizeof(f));\n\t\tf[gy][gx]=0;\n\t\tq.push(v);\n\t\twhile(!q.empty()){\n\t\t\tv=q.front();\n\t\t\tq.pop();\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tu=v;\n\t\t\t\tu.x+=mx[i];\n\t\t\t\tu.y+=my[i];\n\t\t\t\tif(map[u.y][u.x]!='#'&&u.x>=0&&u.x<lx&&u.y>=0&&u.y<ly&&f[u.y][u.x]==-1){\n\t\t\t\t\tq.push(u);\n\t\t\t\t\tf[u.y][u.x]=f[v.y][v.x]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\twhile(!s.empty()){\n\t\t\tr=s.top();\n\t\t\ts.pop();\n\t\t\tif(r.visited[r.y][r.x]==1){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tr.visited[r.y][r.x]=1;\n\t\t\t}\n\t\t\tif(r.cnt+f[r.y][r.x]>=min){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t/*\n\t\t\tif(map[r.y][r.x]=='X'){\n\t\t\t\ta=maps[r.y][r.x];\n\t\t\t\tr.ic[a]++;\n\t\t\t\tif(r.ic[a]>(ig[a]/2)){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}*/\n\t\t\tfor(i=0;i<4;i++){\n\t\t\t\tt=r;\n\t\t\t\tt.x+=mx[i];\n\t\t\t\tt.y+=my[i];\n\t\t\t\tt.cnt++;\n\t\t\t\tif(map[t.y][t.x]=='G'&&t.cnt<min&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly){\n\t\t\t\t\tmin=t.cnt;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(map[t.y][t.x]!='#'&&t.x>=0&&t.x<lx&&t.y>=0&&t.y<ly&&r.visited[t.y][t.x]==0){\n\t\t\t\t\tif(mapc[t.y][t.x]>r.cnt+1||mapc[t.y][t.x]==-1){\n\t\t\t\t\t\tmapc[t.y][t.x]=r.cnt+1;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tif(mapc[t.y][t.x]<r.cnt){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(map[t.y][t.x]=='X'){\n\t\t\t\t\t\ta=maps[t.y][t.x];\n\t\t\t\t\t\tt.ic[a]++;\n\t\t\t\t\t\tif(t.ic[a]<=(ig[a]/2)){\n\t\t\t\t\t\t\ts.push(t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\ts.push(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<min<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.8,
"time_ms": 10,
"memory_kb": 5704,
"score_of_the_acc": -0.0543,
"final_rank": 19
}
] |
aoj_0254_cpp
|
スコーン配達計画
愛歌さんの家は、小さな喫茶店を経営しています。愛歌さんのお母さんが焼くスコーンはとても美味しくて、店はとても繁盛していました。
ウェイトレスである愛歌さんの仕事の一つは、次々と焼き上がるスコーンを、お客様の席まで届けることです。焼きあがったスコーンはお盆の上に乗せられ、カウンターの上に一列に並べられます。
i
番目のお盆の上に乗っているスコーンの数を
K
i
としましょう。愛歌さんは、それぞれのお客様にちょうど
m
個のスコーンを運ばなければなりません。愛歌さんは一度にいくつでもお盆を持つことができ、また複数のお盆から 1 人のお客様にスコーンを配ったり、１つのお盆から複数のお客様に配っても構いません。
喫茶店にはとてもたくさんのお客様がやってくるので、カウンターに置いてある全てのスコーンを運んでも、全てのお客様に届けることはできません。しかし、できるだけ多くのお客様に届けた後で、
m
個に満たない数のスコーンが余ることもあるかもしれません。そのようなスコーンは、お手伝いのご褒美として、愛歌さんが貰えることになりました。
ここでふと、愛歌さんは考えました。一度に全てのお盆を持つのではなく、一部のお盆だけを持ってお客様にスコーンを届けると、余るスコーンの数も違ってくるはずです。適切にお盆を選ぶことで、より多くのスコーンが余るようにできるかもしれません。愛歌さんは、作為的にお盆を選んでいることをお母さんに見抜かれないように、カウンターの上の1つの連続した範囲のお盆を選ぶことにしました。また、残ったお盆はお父さんやお母さんが運んでしまうので、愛歌さんがスコーンをもらうチャンスは一度しかありません。
さて、愛歌さんは最大いくつのスコーンを貰えるでしょうか？計算するプログラムを書いてください。お盆の数
n
は 1 以上 30,000以下、
m
は 1 以上 100,000 以下です。また数列の各要素
K
i
は 0 以上 2
32
-1 です。
入力
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下のとおりです。
1行目
n
m
（整数 整数；半角空白区切り）
2行目 お盆上のスコーンの情報
K
1
K
2
...
K
n
（すべて整数 ; 半角空白区切り）
K
i
:
i
番目のお盆上のスコーンの数
データセットの数は 50 を超えません。
出力
データセットごとに、もらえるスコーンの最大数を１行に出力します。
入力例
5 11
11 27 34 45 56
8 5
0 2 1 5 4 6 8 3
5 2
2 4 2 4 6
10 18
10 15 12 31 12 50 11 23 43 181
1 100
5
0 0
出力例
8
4
0
17
5
|
[
{
"submission_id": "aoj_0254_10854003",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing P = pair<int, int>;\n\nint main() {\n int n, m;\n while(cin >> n >> m, n) {\n vector<int> a(n+1);\n for(int i=1; i<=n; ++i) {\n cin >> a[i];\n a[i] %= m;\n (a[i] += a[i-1]) %= m;\n }\n int res = 0;\n set<int> s;\n s.insert(0);\n for(int i=1; i<=n; ++i) {\n auto it = s.upper_bound(a[i]);\n res = max(res, a[i]);\n if(it != s.end()) {\n res = max(res, (a[i] - *it + m) % m);\n }\n s.insert(a[i]);\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4684,
"score_of_the_acc": -1.3389,
"final_rank": 7
},
{
"submission_id": "aoj_0254_9055106",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m;\n while (cin >> n >> m, n) {\n vector<ll> a(n);\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n a[i] %= m;\n }\n ll res = 0;\n set<ll> st;\n st.insert(0);\n ll sum = 0;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n sum %= m;\n auto it = st.lower_bound(sum + 1);\n if (it == st.end()) {\n res = max(res, sum);\n } else {\n res = max(res, m - (*it - sum));\n }\n st.insert(sum);\n }\n\n cout << res << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4876,
"score_of_the_acc": -0.9543,
"final_rank": 4
},
{
"submission_id": "aoj_0254_8524477",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0254.cc: スコーン配達計画\n */\n\n#include<cstdio>\n#include<set>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 30000;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef set<int> si;\n\n/* global variables */\n\nint ass[MAX_N + 1];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n for (int n, m; scanf(\"%d%d\", &n, &m), n > 0;) {\n for (int i = 0; i < n; i++) {\n ll ai;\n scanf(\"%lld\", &ai);\n ass[i + 1] = (ass[i] + ai % m) % m;\n }\n\n int maxd = 0;\n si ps;\n for (int i = 0; i < n; i++) {\n ps.insert(ass[i]);\n auto sit = ps.upper_bound(ass[i + 1]);\n int d = (m + ass[i + 1] - (sit != ps.end() ? *sit : *ps.begin())) % m;\n maxd = max(maxd, d);\n }\n\n printf(\"%d\\n\", maxd);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4332,
"score_of_the_acc": -0.6274,
"final_rank": 1
},
{
"submission_id": "aoj_0254_7139522",
"code_snippet": "#include <iostream>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\n\n\nint main() {\n\t// your code goes here\nwhile(true){\n\tint n,m;\n\tlong long int s1,ans;\n\tset<long long int> ss;\n\tcin>>n>>m;\n\tif (n+m==0) break;\n\tss.insert(0);\n\ts1=0;\n\tans=0;\n\tfor(int i=0;i<n;i++){\n\t\tlong long int t,s2;\n\t\tcin>>t;\n\t\ts1=(s1+t)%m;\n\t\tset<long long int>::iterator it=ss.lower_bound((s1+1)%m);\n\t\tif (it!=ss.end()){\n\t\t\ts2=(s1+(m-(*it)))%m;\n\t\t\tans=max(ans,s2);\n\t\t}\n\t\tans=max(ans,s1);\n\t\tss.insert(s1);\n\t}\n\tcout<<ans<<endl;\n}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 4296,
"score_of_the_acc": -1.3558,
"final_rank": 8
},
{
"submission_id": "aoj_0254_7139483",
"code_snippet": "#include <iostream>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\n\n\nint main() {\n\t// your code goes here\nwhile(true){\n\tint n,m;\n\tlong long int s1,ans;\n\tset<long long int> ss;\n\tcin>>n>>m;\n\tif (n+m==0) break;\n\tss.insert(0);\n\ts1=0;\n\tans=0;\n\tfor(int i=0;i<n;i++){\n\t\tlong long int t,s2;\n\t\tcin>>t;\n\t\ts1=(s1+t)%m;\n\t\ts2=(m+(m-s1-1))%m;\n\t\tset<long long int>::iterator it=ss.lower_bound(s2);\n\t\tif (it!=ss.end()){\n\t\t\ts2=(s1+(*it))%m;\n\t\t\tans=max(ans,s2);\n\t\t}\n\t\tif(it!=ss.begin()){\n\t\t\tit--;\n\t\t\ts2=(s1+(*it))%m;\n\t\t\tans=max(ans,s2);\n\t\t}\n\t\tans=max(ans,s1);\n\t\tss.insert(s1);\n\t}\n\tcout<<ans<<endl;\n}\n\treturn 0;\n}",
"accuracy": 0.5,
"time_ms": 90,
"memory_kb": 3288,
"score_of_the_acc": -0.375,
"final_rank": 20
},
{
"submission_id": "aoj_0254_4929667",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <set>\nusing namespace std;\ntypedef long long int lli;\n\nint main(){\n while(1){\n lli n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n vector<lli> a(n+1, 0);\n for(int i=1; i<=n; i++){\n cin >> a[i];\n a[i] = (a[i-1]+a[i]) %m;\n }\n\n lli ans = 0;\n set<lli> b;\n b.insert(0);\n for(int i=1; i<=n; i++){\n if(*b.begin() < a[i]){\n ans = max(ans, a[i] -*b.begin());\n }\n if(b.upper_bound(a[i]) != b.end()){\n ans = max(ans, a[i] -*b.upper_bound(a[i]) +m);\n }\n b.insert(a[i]);\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 4344,
"score_of_the_acc": -1.3846,
"final_rank": 9
},
{
"submission_id": "aoj_0254_4929665",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <set>\nusing namespace std;\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n vector<int> a(n+1, 0);\n for(int i=1; i<=n; i++){\n cin >> a[i];\n a[i] = (a[i-1]+a[i]) %m;\n }\n\n int ans = 0;\n set<int> b;\n b.insert(0);\n for(int i=1; i<=n; i++){\n if(*b.begin() < a[i]){\n ans = max(ans, a[i] -*b.begin());\n }\n if(b.upper_bound(a[i]) != b.end()){\n ans = max(ans, a[i] -*b.upper_bound(a[i]) +m);\n }\n b.insert(a[i]);\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 0.75,
"time_ms": 120,
"memory_kb": 4164,
"score_of_the_acc": -1.2764,
"final_rank": 14
},
{
"submission_id": "aoj_0254_4531403",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nvector<int> SconeData;\nset<int> DpScone;\n\nvoid solve() {\n\tint sum, maxScone;\n\tset<int>::iterator it;\n\n\tsum = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tsum += SconeData[i] % M;\n\t\tSconeData[i] = sum%M;\n\t}\n\n\tmaxScone = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tit = DpScone.upper_bound(SconeData[i]);\n\t\tif (it != DpScone.end()) {\n\t\t\tmaxScone = max(maxScone, (SconeData[i] - *it + M) % M);\n\t\t}\n\t\telse {\n\t\t\tmaxScone = max(maxScone, SconeData[i]);\n\t\t}\n\t\tDpScone.insert(SconeData[i]);\n\t}\n\t\n\tcout << maxScone << endl;\n}\n\nint main() {\n\tint num;\n\n\twhile (cin >> N >> M, N) {\n\t\tSconeData.clear();\n\t\tDpScone.clear();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> num;\n\t\t\tSconeData.push_back(num);\n\t\t}\n\t\tsolve();\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 4236,
"score_of_the_acc": -1.3197,
"final_rank": 6
},
{
"submission_id": "aoj_0254_4531380",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nvector<int> SconeData;\nset<int> DpScone;\n\nvoid solve() {\n\tint sum, maxScone;\n\tset<int>::iterator it;\n\n\tsum = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tsum += SconeData[i];\n\t\tSconeData[i] = sum%M;\n\t}\n\n\tmaxScone = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tit = DpScone.upper_bound(SconeData[i]);\n\t\tif (it != DpScone.end()) {\n\t\t\tmaxScone = max(maxScone, (SconeData[i] - *it + M) % M);\n\t\t}\n\t\telse {\n\t\t\tmaxScone = max(maxScone, SconeData[i]);\n\t\t}\n\t\tDpScone.insert(SconeData[i]);\n\t}\n\t\n\tcout << maxScone << endl;\n}\n\nint main() {\n\tint num;\n\n\twhile (cin >> N >> M, N) {\n\t\tSconeData.clear();\n\t\tDpScone.clear();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> num;\n\t\t\tSconeData.push_back(num);\n\t\t}\n\t\tsolve();\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 0.5,
"time_ms": 70,
"memory_kb": 3384,
"score_of_the_acc": -0.1827,
"final_rank": 18
},
{
"submission_id": "aoj_0254_4531131",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nvector<int> SconeData;\n\n\nvoid solve() {\n\tint sum, maxScone;\n\tset<int> DpScone;\n\tset<int>::iterator it;\n\n\tsum = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tsum += SconeData[i];\n\t\tSconeData[i] = sum%M;\n\t}\n\n\tmaxScone = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tit = DpScone.upper_bound(SconeData[i]);\n\t\tif (it != DpScone.end()) {\n\t\t\tmaxScone = max(maxScone, (SconeData[i] - *it + M) % M);\n\t\t}\n\t\telse {\n\t\t\tmaxScone = max(maxScone, SconeData[i]);\n\t\t}\n\t\tDpScone.insert(SconeData[i]);\n\t}\n\t\n\tcout << maxScone << endl;\n}\n\nint main() {\n\tint num;\n\n\twhile (cin >> N >> M, N) {\n\t\tSconeData.clear();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> num;\n\t\t\tSconeData.push_back(num);\n\t\t}\n\t\tsolve();\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 0.5,
"time_ms": 70,
"memory_kb": 3396,
"score_of_the_acc": -0.1899,
"final_rank": 19
},
{
"submission_id": "aoj_0254_4531096",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nint SconeData[30000];\nvector<int> RestScone;\nset<int> DpScone;\n\n\nvoid solve() {\n\tint sum, maxScone;\n\tset<int>::iterator it;\n\n\tsum = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tsum += SconeData[i];\n\t\tRestScone.push_back(sum%M);\n\t}\n\n\tmaxScone = 0;\n\tfor (unsigned int i = 0; i < N; ++i) {\n\t\tmaxScone = max(maxScone, RestScone[i]);\n\t\tit = DpScone.upper_bound(RestScone[i]);\n\t\tif (it != DpScone.end()) {\n\t\t\tmaxScone = max(maxScone, (RestScone[i] - *it + M) % M);\n\t\t}\n\t\tDpScone.insert(RestScone[i]);\n\t}\n\t\n\tcout << maxScone << endl;\n}\n\nint main() {\n\n\twhile (cin >> N >> M, N) {\n\t\tRestScone.clear();\n\t\tDpScone.clear();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> SconeData[i];\n\t\t}\n\t\tsolve();\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 0.5,
"time_ms": 70,
"memory_kb": 3336,
"score_of_the_acc": -0.1538,
"final_rank": 16
},
{
"submission_id": "aoj_0254_4531067",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nint SconeData[30000];\nvector<int> RestScone;\nset<int> DpScone;\n\n\nvoid solve() {\n\tint sum, maxScone;\n\tset<int>::iterator it;\n\n\tsum = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tsum += SconeData[i];\n\t\tRestScone.push_back(sum%M);\n\t}\n\n\tmaxScone = 0;\n\tfor (unsigned int i = 0; i < RestScone.size(); ++i) {\n\t\t\n\t\tmaxScone = max(maxScone, RestScone[i]);\n\t\tit = DpScone.upper_bound(RestScone[i]);\n\t\tif (it != DpScone.end()) {\n\t\t\tmaxScone = max(maxScone, (RestScone[i] - *it + M) % M);\n\t\t}\n\t\tDpScone.insert(RestScone[i]);\n\t}\n\t\n\tcout << maxScone << endl;\n}\n\nint main() {\n\n\twhile (cin >> N >> M, N) {\n\t\tRestScone.clear();\n\t\tDpScone.clear();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> SconeData[i];\n\t\t}\n\t\tsolve();\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 0.5,
"time_ms": 70,
"memory_kb": 3288,
"score_of_the_acc": -0.125,
"final_rank": 15
},
{
"submission_id": "aoj_0254_4531027",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nint SconeData[30000];\nvector<int> RestScone;\nset<int> DpScone;\n\n\nvoid solve() {\n\tint sum, maxScone;\n\tset<int>::iterator it;\n\n\tsum = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tsum += SconeData[i];\n\t\tRestScone.push_back(sum%M);\n\t}\n\n\tmaxScone = 0;\n\tfor (unsigned int i = 0; i < RestScone.size(); ++i) {\n\t\tDpScone.insert(RestScone[i]);\n\t\tmaxScone = max(maxScone, RestScone[i]);\n\t\tit = DpScone.upper_bound(RestScone[i]);\n\t\tif (it != DpScone.end()) {\n\t\t\tmaxScone = max(maxScone, (RestScone[i] - *it + M) % M);\n\t\t}\n\t}\n\t\n\tcout << maxScone << endl;\n}\n\nint main() {\n\n\twhile (cin >> N >> M, N) {\n\t\tRestScone.clear();\n\t\tDpScone.clear();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> SconeData[i];\n\t\t}\n\t\tsolve();\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 0.5,
"time_ms": 70,
"memory_kb": 3368,
"score_of_the_acc": -0.1731,
"final_rank": 17
},
{
"submission_id": "aoj_0254_4475519",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n, m;\n while(cin >> n >> m, n){\n vector<ll> v(n);\n for (auto &&i : v) scanf(\"%lld\", &i);\n ll S = 0;\n set<ll> s;\n s.emplace(0);\n ll ans = 0;\n for (int i = 0; i < n; ++i) {\n (S += v[i]) %= m;\n auto a = s.upper_bound(S);\n if(a != s.end()){\n ans = max(ans, (S-*a+m)%m);\n }else {\n ans = max(ans, S-*s.begin());\n }\n s.emplace(S);\n }\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4532,
"score_of_the_acc": -0.7476,
"final_rank": 3
},
{
"submission_id": "aoj_0254_4475512",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n, m;\n while(cin >> n >> m, n){\n vector<int> v(n);\n for (auto &&i : v) scanf(\"%d\", &i);\n int S = 0;\n set<int> s;\n s.emplace(0);\n int ans = 0;\n for (int i = 0; i < n; ++i) {\n (S += v[i]) %= m;\n auto a = s.upper_bound(S);\n if(a != s.end()){\n ans = max(ans, (S-*a+m)%m);\n }else {\n ans = max(ans, S-*s.begin());\n }\n s.emplace(S);\n }\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 0.75,
"time_ms": 70,
"memory_kb": 4196,
"score_of_the_acc": -0.6707,
"final_rank": 12
},
{
"submission_id": "aoj_0254_3894269",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nsigned main(){\n\n int n, m;\n while(cin >> n >> m, n != 0){\n int num = 0;\n int a[30010];\n int b[30010];\n\n multiset<int> st;\n for(int i = 0;i < n;i++){\n cin >> a[i];\n num += a[i];\n num %= m;\n b[i] = num;\n st.insert(b[i]);\n }\n\n int ans = 0;\n\n num = 0;\n for(int i = 0;i < n;i++){\n auto itr = st.lower_bound(num);\n if(itr == st.begin()){\n itr = st.end();\n itr--;\n }else{\n itr--;\n }\n\n ans = max(ans, (m + (*itr) - num) % m);\n\n num = b[i];\n st.erase(st.lower_bound(num));\n }\n cout << ans << endl;\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 4952,
"score_of_the_acc": -2,
"final_rank": 11
},
{
"submission_id": "aoj_0254_3396346",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\n#include <queue>\n#include <functional>\n#include <algorithm>\n#include <random>\n#include <cmath>\n#include <climits>\n#include <iomanip>\n#include <cfloat>\n#include <set>\nint main() {\n\tint n, m; std::cin >> n >> m;\n\twhile (n != 0) {\n\t\tstd::vector<long long int> scone(n);\n\t\tfor (auto &s : scone) std::cin >> s;\n\t\tscone[0] %= m;\n\t\tfor (auto i = 1; i < n; ++i) scone[i] = (scone[i] + scone[i - 1]) % m;\n\t\tstd::set<long long int> set;\n\t\tlong long int result = 0;\n\t\tfor (const auto s : scone) {\n\t\t\tset.insert(s);\n\t\t\tauto upper = set.upper_bound(s);\n\t\t\tif (upper != set.end()) {\n\t\t\t\tif (result < m - (*upper) + s) result = m - (*upper) + s;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (result < s) result = s;\n\t\t\t}\n\t\t}\n\t\tstd::cout << result << std::endl;\n\t\tstd::cin >> n >> m;\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 4304,
"score_of_the_acc": -1.2356,
"final_rank": 5
},
{
"submission_id": "aoj_0254_3396344",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\n#include <queue>\n#include <functional>\n#include <algorithm>\n#include <random>\n#include <cmath>\n#include <climits>\n#include <iomanip>\n#include <cfloat>\n#include <set>\nint main() {\n\tint n, m; std::cin >> n >> m;\n\twhile (n != 0) {\n\t\tstd::vector<int> scone(n);\n\t\tfor (auto &s : scone) std::cin >> s;\n\t\tscone[0] %= m;\n\t\tfor (auto i = 1; i < n; ++i) scone[i] = (scone[i] + scone[i - 1]) % m;\n\t\tstd::set<int> set;\n\t\tint result = 0;\n\t\tfor (const auto s : scone) {\n\t\t\tset.insert(s);\n\t\t\tauto upper = set.upper_bound(s);\n\t\t\tif (upper != set.end()) {\n\t\t\t\tif (result < m - (*upper) + s) result = m - (*upper) + s;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (result < s) result = s;\n\t\t\t}\n\t\t}\n\t\tstd::cout << result << std::endl;\n\t\tstd::cin >> n >> m;\n\t}\n}",
"accuracy": 0.75,
"time_ms": 110,
"memory_kb": 4128,
"score_of_the_acc": -1.1298,
"final_rank": 13
},
{
"submission_id": "aoj_0254_3262948",
"code_snippet": "#include <set>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\tint N, M;\n\twhile (cin >> N >> M, N) {\n\t\tset<int> s; int S = 0, mn = 1 << 30, ans = 0;\n\t\tfor (int i = 0; i <= N; ++i) {\n\t\t\tlong long X;\n\t\t\tif (i >= 1) cin >> X;\n\t\t\tS = (S + X) % M;\n\t\t\tset<int>::iterator ptr = s.lower_bound(S + 1);\n\t\t\tif (ptr != s.end()) {\n\t\t\t\tans = max(ans, S - *ptr + M);\n\t\t\t}\n\t\t\tans = max(ans, S - mn);\n\t\t\tmn = min(mn, S);\n\t\t\ts.insert(S);\n\t\t}\n\t\tcout << ans << '\\n';\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4344,
"score_of_the_acc": -0.6346,
"final_rank": 2
},
{
"submission_id": "aoj_0254_3261082",
"code_snippet": "#include<iostream>\n#include<set>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n int n, m;\n while(cin >> n >> m, n+m){\n ll k[n];\n for(int i = 0; i < n; i++) cin >> k[i], k[i] %= m;\n for(int i = 1; i < n; i++) k[i] = (k[i]+k[i-1])%m;\n set<ll> s;\n s.insert(0);\n ll ans = 0;\n for(int i = 0; i < n; i++){\n auto r = s.upper_bound(k[i]);\n if(r == s.end()) r = s.begin();\n ans = max(ans, (k[i]-(*r)+m)%m);\n s.insert(k[i]);\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 4544,
"score_of_the_acc": -1.5048,
"final_rank": 10
}
] |
aoj_0251_cpp
|
魔法陣
人里離れた森の奥深くに、マリーという名の魔女が住んでいました。彼女は魔女なので、食料・水・燃料など、生活に必要なものを魔法によってまかなっています。
彼女の魔法は、魔力を込めたいくつかの石と紐を使って、魔法陣を描くことによって発動します。この魔法陣は、石を設置し、いくつかの石のペアを紐で繋ぐことで描かれます。ただし、紐は弛んでいてはいけません。さらに、どの紐も、(両端を除いて) 他の紐や石に触れてはいけません。もちろん、同じ場所に複数の石を置くこともできません。この制約が守られる限り、石と石の位置関係や紐の長さに制限はありません。また、石は十分小さいので点として扱うことができ、紐は十分細いので線分として扱うことができます。さらに、彼女は同じ石のペアを2本以上の紐で繋ぐことも、ある紐の両端を同じ石に結ぶこともありません。
マリーは初め、石を彼女の家の平らな壁に貼り付けて魔法陣を描いていました。しかし、彼女はやがて、どうしても作ることのできない魔法陣があることに気付いたのです。しばらくして、彼女は魔法陣を平らな壁、つまり二次元平面の上で作ることができるか判定する方法を編み出しました。ある魔法陣は、次のような部分を含む場合、またその場合に限って、二次元平面上で作ることができないのです。
図１ 頂点数 5 の完全グラフ
図２ 頂点数 3, 3 の完全二部グラフ
このような魔法陣を描くために、彼女は石を空中に固定する魔法を編み出しました。三次元空間では、これらの魔法陣も描くことができるのです。それどころか、どんな魔法陣も三次元空間中では描くことができることを彼女は突き止めたのです。
さて、ここからが問題です。ある日マリーは、彼女の家の玄関に足元灯の魔法陣を作ることにしました。しかし、彼女は既に狭い玄関にいろいろな魔法陣を設置していたので、足元灯の魔法陣を、残された唯一のスペースである一次元の直線の上に描かなければなりません。彼女が設計したいくつかの足元灯の魔法陣について、それが直線の上に描けるかどうかを判定し、描ける場合
yes
と、そうでない場合
no
と出力するプログラムを作成して下さい。
魔法陣は、石の個数
n
、紐の本数
m
、
m
個の紐の情報で与えられます。紐は、その両端の石の番号
u
、
v
で表されます。石には 1 から
n
までの番号が与えられ、
n
は 1 以上 100,000 以下、
m
は 0 以上 1,000,000 以下とします。
入力
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。各データセットは以下のとおりです。
1 行目 石の個数
n
紐の本数
m
（整数 整数；半角空白区切り）
2 行目 第1の紐の情報
u
v
（整数 整数；半角空白区切り）
3 行目 第2の紐の情報
:
m+1
行目 第
m
の紐の情報
データセットの数は 20 を超えません。
出力
入力データセットごとに、yes または no と１行に出力します。
入力例
5 4
1 2
2 3
3 4
4 5
4 6
1 2
1 3
1 4
2 3
2 4
3 4
5 0
0 0
出力例
yes
no
yes
|
[
{
"submission_id": "aoj_0251_10932859",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <functional>\n#include <algorithm>\n#include <queue>\nusing namespace std;\n\nusing ll = long long;\ntemplate <class T> using v = vector<T>;\ntemplate <class T> using vv = vector<vector<T>>;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(x) (x).begin(), (x).end()\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vvvi vector<vector<vector<int>>>\n#define pii pair<int, int>\n#define el '\\n'\n#define Yes cout<<\"yes\"<<endl\n#define No cout<<\"no\"<<endl\n\nint bfs(vvi& G) {\n int N = G.size();\n vi dist(N, -1);\n queue<int> que;\n for (int x = 0; x < N; x++) {\n if (dist[x] != -1) continue;\n que.push(x); dist[x] = 0;\n while (!que.empty()) {\n int pos = que.front(); que.pop();\n for (int i : G[pos]) {\n if (dist[i] == -1) {\n dist[i] = dist[pos] + 1; que.push(i);\n }\n else if (dist[i] >= dist[pos]) {\n return 0;\n }\n }\n }\n }\n return 1;\n}\nint main() {\n int n = 1, m = 1, u, v, D;\n\n while (1) {\n cin >> n >> m;\n if ((n + m) == 0) return 0;\n vi g(n);\n vvi G(n);\n while (m--) {\n cin >> u >> v;\n u--; v--;\n ++g[u]; ++g[v];\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n D = 1;\n for (int& i : g) {\n if (i > 2) {\n D = 0;\n break;\n }\n }\n D *= bfs(G);\n if (D == 1) Yes;\n else No;\n }\n}\n\n//g++ tmp.cpp\n//./a.out",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 7296,
"score_of_the_acc": -1.0394,
"final_rank": 13
},
{
"submission_id": "aoj_0251_10932043",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Graph = vector<vector<int>>;\n\nstruct Unionfind{\n vector<int> par;\n Unionfind(int n) : par(n){\n for(int i = 0; i < n; i++) par[i] = i;\n }\n \n int root(int x){\n if(par[x] == x) return x;\n return par[x] = root(par[x]);\n }\n \n void unite(int a, int b){\n int ra = root(a), rb = root(b);\n if(ra != rb) par[ra] = rb;\n }\n \n bool isunion(int a, int b){\n int ra = root(a), rb = root(b);\n return ra == rb;\n }\n};\n\nint main(){\n while(1){\n int n, m;\n cin >> n >> m;\n if(n == 0) break; \n Graph g(n);\n Unionfind t(n);\n bool flg = true;\n while(m--){\n int u, v;\n cin >> u >> v;\n g[u - 1].push_back(v);\n g[v - 1].push_back(u);\n if(t.isunion(u - 1, v - 1)) flg = false;\n else t.unite(u - 1, v - 1);\n }\n if(flg){\n for(auto i : g) {\n if(i.size() >= 3){\n flg = false;\n break;\n }\n }\n }\n if(flg) cout << \"yes\";\n else cout << \"no\";\n cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 7084,
"score_of_the_acc": -0.7814,
"final_rank": 11
},
{
"submission_id": "aoj_0251_9156372",
"code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to;\n double cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, double cost) : to(to), cost(cost) {}\n Edge(int from, int to, double cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nvector<string> split_str(string S, char c) {\n vector<string> ret;\n stringstream ss;\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == c) {\n ret.pb(ss.str());\n ss.str(\"\");\n ss.clear();\n } else {\n ss << S[i];\n }\n }\n ret.pb(ss.str());\n return ret;\n}\n\nsigned main() {\n int N, M;\n while (cin >> N >> M, N) {\n vector<int> deg(N);\n UnionFind uf(N);\n bool ok = true;\n for (int i = 0; i < M; i++) {\n int u, v;\n cin >> u >> v;\n u--; v--;\n deg[u]++;\n deg[v]++;\n if (uf.issame(u, v)) {\n ok = false;\n }\n uf.unite(u, v);\n }\n for (int i = 0; i < N; i++) {\n if (deg[i] >= 3) ok = false;\n }\n if (ok) cout << \"yes\" << endl;\n else cout << \"no\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 5516,
"score_of_the_acc": -0.2015,
"final_rank": 4
},
{
"submission_id": "aoj_0251_9105145",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"/opt/library/ds/unionfind/unionfind.hpp\"\n\nstruct UnionFind {\n ll n, n_comp;\n vi dat; // parent or (-size)\n UnionFind(ll n = 0) { build(n); }\n\n void build(ll m) {\n n = m, n_comp = m;\n dat.assign(n, -1);\n }\n\n void reset() { build(n); }\n\n ll operator[](ll x) {\n while (dat[x] >= 0) {\n ll parent = dat[dat[x]];\n if (parent < 0) { return dat[x]; }\n x = dat[x] = parent;\n }\n return x;\n }\n\n ll size(ll x) {\n x = (*this)[x];\n return -dat[x];\n }\n\n bool merge(ll x, ll y) {\n x = (*this)[x], y = (*this)[y];\n if (x == y) return false;\n if (-dat[x] < -dat[y]) swap(x, y);\n dat[x] += dat[y], dat[y] = x, n_comp--;\n return true;\n }\n};\n#line 3 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, m;\n cin >> n >> m;\n if (n==0 and m==0) return 1;\n UnionFind uf(n);\n vi U(m), V(m);\n rep(i, m) cin >> U[i] >> V[i];\n vi cnt(n, 0);\n rep(i, m) {\n ll u = U[i] - 1;\n ll v = V[i] - 1;\n if (u == v) continue;\n cnt[u]++;\n cnt[v]++;\n if (uf[u] == uf[v]) {\n no();\n return 0;\n }\n uf.merge(u, v);\n }\n yes(MAX(cnt) <= 2);\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 6936,
"score_of_the_acc": -0.3538,
"final_rank": 6
},
{
"submission_id": "aoj_0251_9098174",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"/opt/library/ds/unionfind/unionfind.hpp\"\n\nstruct UnionFind {\n ll n, n_comp;\n vi dat; // parent or (-size)\n UnionFind(ll n = 0) { build(n); }\n\n void build(ll m) {\n n = m, n_comp = m;\n dat.assign(n, -1);\n }\n\n void reset() { build(n); }\n\n ll operator[](ll x) {\n while (dat[x] >= 0) {\n ll parent = dat[dat[x]];\n if (parent < 0) { return dat[x]; }\n x = dat[x] = parent;\n }\n return x;\n }\n\n ll size(ll x) {\n x = (*this)[x];\n return -dat[x];\n }\n\n bool merge(ll x, ll y) {\n x = (*this)[x], y = (*this)[y];\n if (x == y) return false;\n if (-dat[x] < -dat[y]) swap(x, y);\n dat[x] += dat[y], dat[y] = x, n_comp--;\n return true;\n }\n};\n#line 3 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, m;\n cin >> n >> m;\n if (n==0 and m==0) return 1;\n vi U(m), V(m);\n rep(i, m) cin >> U[i] >> V[i];\n vi a(n, 0);\n UnionFind uf(n);\n rep(i, m) {\n ll u = U[i]-1;\n ll v = V[i]-1;\n if (u == v) continue;\n a[u]++;\n a[v]++;\n if (uf[u] == uf[v]) {\n no();\n return 0;\n }\n uf.merge(u, v);\n }\n yes(MAX(a) <= 2);\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 6936,
"score_of_the_acc": -0.4126,
"final_rank": 7
},
{
"submission_id": "aoj_0251_9097214",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"/opt/library/ds/unionfind/unionfind.hpp\"\n\nstruct UnionFind {\n ll n, n_comp;\n vi dat; // parent or (-size)\n UnionFind(ll n = 0) { build(n); }\n\n void build(ll m) {\n n = m, n_comp = m;\n dat.assign(n, -1);\n }\n\n void reset() { build(n); }\n\n ll operator[](ll x) {\n while (dat[x] >= 0) {\n ll parent = dat[dat[x]];\n if (parent < 0) { return dat[x]; }\n x = dat[x] = parent;\n }\n return x;\n }\n\n ll size(ll x) {\n x = (*this)[x];\n return -dat[x];\n }\n\n bool merge(ll x, ll y) {\n x = (*this)[x], y = (*this)[y];\n if (x == y) return false;\n if (-dat[x] < -dat[y]) swap(x, y);\n dat[x] += dat[y], dat[y] = x, n_comp--;\n return true;\n }\n};\n#line 3 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, m, u, v;\n cin >> n >> m;\n if (n==0 and m==0) return 1;\n vi a(n, 0);\n UnionFind uf(n);\n rep(m) {\n cin >> u >> v;\n if (u == v) continue;\n u--; v--;\n a[u]++;\n a[v]++;\n uf.merge(u, v);\n }\n rep(i, n) if (a[i] >= 3) {\n no();\n return 0;\n }\n ll groups = 0;\n rep(i, n) {\n if (uf[i] == i) groups++;\n }\n yes(groups == n-m);\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 4468,
"score_of_the_acc": -0.0892,
"final_rank": 1
},
{
"submission_id": "aoj_0251_9097206",
"code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\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)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"/opt/library/ds/unionfind/unionfind.hpp\"\n\nstruct UnionFind {\n ll n, n_comp;\n vi dat; // parent or (-size)\n UnionFind(ll n = 0) { build(n); }\n\n void build(ll m) {\n n = m, n_comp = m;\n dat.assign(n, -1);\n }\n\n void reset() { build(n); }\n\n ll operator[](ll x) {\n while (dat[x] >= 0) {\n ll parent = dat[dat[x]];\n if (parent < 0) { return dat[x]; }\n x = dat[x] = parent;\n }\n return x;\n }\n\n ll size(ll x) {\n x = (*this)[x];\n return -dat[x];\n }\n\n bool merge(ll x, ll y) {\n x = (*this)[x], y = (*this)[y];\n if (x == y) return false;\n if (-dat[x] < -dat[y]) swap(x, y);\n dat[x] += dat[y], dat[y] = x, n_comp--;\n return true;\n }\n};\n#line 3 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, m, u, v;\n cin >> n >> m;\n if (n==0 and m==0) return 1;\n vi a(n, 0);\n UnionFind uf(n);\n rep(m) {\n cin >> u >> v;\n u--; v--;\n a[u]++;\n a[v]++;\n uf.merge(u, v);\n }\n rep(i, n) if (a[i] >= 3) {\n no();\n return 0;\n }\n ll groups = 0;\n rep(i, n) {\n if (uf[i] == i) groups++;\n }\n yes(groups == n-m);\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 4636,
"score_of_the_acc": -0.1072,
"final_rank": 2
},
{
"submission_id": "aoj_0251_9064153",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m;\n while (cin >> n >> m, n) {\n vector<vector<int>> g(n);\n for (int i = 0; i < m; ++i) {\n int x, y;\n cin >> x >> y;\n x -= 1, y -= 1;\n g[x].push_back(y);\n g[y].push_back(x);\n }\n bool ok = true;\n vector<bool> used(n);\n auto dfs = [&](auto dfs, int s, int p) -> void {\n used[s] = true;\n if (g[s].size() > 2) {\n ok = false;\n return;\n }\n for (int t : g[s]) {\n if (t == p) continue;\n if (used[t]) {\n ok = false;\n return;\n }\n dfs(dfs, t, s);\n }\n };\n for (int i = 0; i < n; ++i) {\n if (!used[i]) dfs(dfs, i, -1);\n }\n if (ok) cout << \"yes\" << endl;\n else cout << \"no\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 6416,
"score_of_the_acc": -0.298,
"final_rank": 5
},
{
"submission_id": "aoj_0251_6899952",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\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\nint main(){\n int n, m;\n while(cin >> n >> m, n){\n int u, v;\n vector<int> cnt(n);\n dsu uf(n);\n int ans = 0;\n for(int i = 0; i < m; i++){\n cin >> u >> v;\n u--, v--;\n if(uf.same(u, v))ans = 3;\n uf.merge(u, v);\n cnt[u]++, cnt[v]++;\n ans = max(ans, cnt[u]);\n ans = max(ans, cnt[v]);\n }\n cout << (ans <= 2 ? \"yes\" : \"no\") << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3824,
"score_of_the_acc": -0.6672,
"final_rank": 10
},
{
"submission_id": "aoj_0251_5731350",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nvector<int>G[100000];\nint col[100000],cnt[100000],deg[100000];\nvoid dfs(int v,int c){\n\tcol[v]=c;\n\tfor(auto x:G[v])\n\t\tif(col[x]==-1)\n\t\t\tdfs(x,c);\n}\nsigned main(){\n\tint n,m;\n\twhile(cin>>n>>m,n){\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcol[i]=-1;\n\t\t\tG[i].clear();\n\t\t}\n\t\tint u,v;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tcin>>u>>v;\n\t\t\tu--,v--;\n\t\t\tG[u].push_back(v);\n\t\t\tG[v].push_back(u);\n\t\t}\n\t\tint k=0;\n\t\tfor(int i=0;i<n;i++)\n\t\t\tif(col[i]==-1)\n\t\t\t\tdfs(i,k++);\n\t\tfor(int i=0;i<k;i++)\n\t\t\tcnt[i]=deg[i]=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcnt[col[i]]++;\n\t\t\tdeg[col[i]]+=G[i].size();\n\t\t}\n\t\tbool ok=1;\n\t\tfor(int i=0;i<k;i++){\n\t\t\tdeg[i]/=2;\n\t\t\tif(deg[i]!=cnt[i]-1)\n\t\t\t\tok=0;\n\t\t}\n\t\tfor(int i=0;i<n;i++)\n\t\t\tif(G[i].size()>2)\n\t\t\t\tok=0;\n\t\tcout<<(ok?\"yes\":\"no\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 12964,
"score_of_the_acc": -1.6471,
"final_rank": 20
},
{
"submission_id": "aoj_0251_5233848",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n vector<vector<int>> adj(n);\n for(int i=0; i<m; i++){\n int a,b;\n cin >> a >> b;\n a--; b--;\n adj[a].push_back(b);\n adj[b].push_back(a);\n }\n bool ng = false;\n for(int i=0; i<n; i++){\n if(adj[i].size() > 2u){\n ng = true;\n break;\n }\n }\n if(ng){\n cout << \"no\" << endl;\n continue;\n }\n vector<int> used(n, 0);\n for(int i=0; i<n; i++){\n if(adj[i].size() == 0u){\n used[i] = 1;\n }else if(adj[i].size() == 1u){\n used[i] = 1;\n int curr = i;\n int prev = -1;\n while(1){\n int next = adj[curr][0];\n if(next == prev){\n if(adj[curr].size() == 1u) break;\n next = adj[curr][1];\n }\n used[next] = 1;\n prev = curr;\n curr = next;\n }\n }\n }\n if(*min_element(used.begin(), used.end()) == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 6892,
"score_of_the_acc": -0.9961,
"final_rank": 12
},
{
"submission_id": "aoj_0251_4815966",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define each(i, a) for(auto &i : a)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#define line cout << \"-----------------------------\\n\" \n#define ENDL(i,n) ((i) == (n) - 1 ? \"\\n\" : \" \")\n#define elif else if\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\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 (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\n\nclass unionfind {\n VI par, rank;\n int forest_num;\npublic:\n unionfind(const int& n) : par(n), rank(n, 1), forest_num(n) {\n FOR(i, 0, n)par[i] = i;\n }\n int root(int x) {\n if (par[x] == x)return x;\n return par[x] = root(par[x]);\n }\n int size(int x) {\n if (par[x] == x)return rank[x];\n return size(par[x]);\n }\n void unite(int x, int y) {\n int rx = root(x), ry = root(y);\n if (rx == ry)return;\n if (rank[rx] < rank[ry]) {\n par[rx] = ry;\n rank[ry] += rank[rx];\n }\n else {\n par[ry] = rx;\n rank[rx] += rank[ry];\n }\n --forest_num;\n }\n bool same(int x, int y) { return root(x) == root(y); }\n int fnum() { return forest_num; }\n};\n\nint main() {\n init();\n\n for (int n, m; cin >> n >> m && n;) {\n vector<VI> g(n);\n unionfind uf(n);\n bool ng = false;\n FOR(i, 0, m) {\n int a, b; cin >> a >> b;\n --a, --b;\n ng |= uf.same(a, b);\n uf.unite(a, b);\n g[a].push_back(b);\n g[b].push_back(a);\n }\n FOR(i, 0, n)ng |= g[i].size() > 2;\n print(ng ? \"no\" : \"yes\");\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 7008,
"score_of_the_acc": -0.4791,
"final_rank": 8
},
{
"submission_id": "aoj_0251_4475414",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nclass UnionFind {\n int n;\n vector<int> uni;\n int forest_size;\npublic:\n explicit UnionFind(int n) : n(n), uni(static_cast<u32>(n), -1), forest_size(n) {};\n\n int root(int a){\n if (uni[a] < 0) return a;\n else return (uni[a] = root(uni[a]));\n }\n\n bool unite(int a, int b) {\n a = root(a);\n b = root(b);\n if(a == b) return false;\n if(uni[a] > uni[b]) swap(a, b);\n uni[a] += uni[b];\n uni[b] = a;\n forest_size--;\n return true;\n }\n int size(){ return forest_size; }\n int size(int i){ return -uni[root(i)]; }\n bool same(int a, int b) { return root(a) == root(b); }\n};\n\nvoid solve(int n, int m){\n vector<int> deg(n);\n UnionFind uf(n);\n int ok = 1;\n for (int i = 0; i < m; ++i) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--; b--;\n if(!uf.unite(a, b)) ok = 0;\n\n deg[a]++; deg[b]++;\n }\n for (int i = 0; i < n; ++i) {\n if(deg[i] > 2) ok = 0;\n }\n puts(ok ? \"yes\" : \"no\");\n};\n\nint main() {\n int n, m;\n while(cin >> n >> m, n) solve(n, m);\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3636,
"score_of_the_acc": -0.1176,
"final_rank": 3
},
{
"submission_id": "aoj_0251_3894136",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct UnionFind{\n vector<int> tree;\n\n UnionFind(int n): tree(n+1, -1) {};\n int root(int i) {return tree[i] < 0 ? i : tree[i] = root(tree[i]); }\n\n bool unite(int i, int j){\n i = root(i), j = root(j);\n if(i == j) return false;\n tree[i] += tree[j], tree[j] = i;\n return true;\n }\n};\n\n\nint main(){\n int n, m;\n\n while(cin >> n >> m, n != 0){\n vector<vector<int> > graph(n);\n\n bool flag = true;\n UnionFind uf(n);\n\n for(int i = 0;i < m;i++){\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n graph[a].push_back(b);\n graph[b].push_back(a);\n flag = (flag && uf.unite(a, b));\n }\n\n for(int i = 0;i < n;i++){\n if(graph[i].size() >= 3){\n flag = false;\n break;\n }\n }\n\n if(flag){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 6708,
"score_of_the_acc": -1.2705,
"final_rank": 15
},
{
"submission_id": "aoj_0251_3885637",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n,m;\n\nvector<vector<int> > vl;\n\nbool findEndPoint(int idx,vector<bool> &v,int pre=-1){\n\tif(v[idx]){\n\t\treturn false;\n\t}\n\tv[idx] = true;\n\tif(pre != -1 && vl[idx].size() == 1){\n\t\treturn true;\n\t}\n\n\tif(vl[idx][0] == pre){\n\t\treturn findEndPoint(vl[idx][1],v,idx);\n\t}\n\telse{\n\t\treturn findEndPoint(vl[idx][0],v,idx);\n\t}\n}\nbool loopNotExist(int idx,vector<bool> &v){\n\tif(vl[idx].size() == 0){\n\t\treturn true;\n\t}\n\tif(vl[idx].size() == 1){\n\t\treturn findEndPoint(idx,v);\n\t}\n\tbool b1 = findEndPoint(vl[idx][0],v,idx);\n\tbool b2 = findEndPoint(vl[idx][1],v,idx);\n\treturn b1 && b2;\n}\n\n// no branch, no loop\nint main(){\n\twhile(scanf(\"%d%d\",&n,&m), !(n==0 && m==0)){\n\t\tvl = vector<vector<int> >(n); // adj list\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tvl[i] = vector<int>();\n\t\t}\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tint u,v;\n\t\t\tscanf(\"%d%d\",&u,&v);\n\t\t\tu--;\n\t\t\tv--;\n\t\t\tvl[u].push_back(v);\n\t\t\tvl[v].push_back(u);\n\t\t}\n\t\tif(m >= n){\n\t\t\tcout << \"no\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t// check branch\n\t\tbool ok = true;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tif(vl[i].size() > 2){\n\t\t\t\tok = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!ok){\n\t\t\tcout << \"no\" << endl;\n\t\t\tcontinue;\n\t\t}\n\n\n\t\t// check loop\n\t\tvector<bool> visited = vector<bool>(n,false);\n\t\tint idx = 0;\n\t\twhile(idx < n){\n\t\t\tif(!visited[idx]){\n\t\t\t\tok = loopNotExist(idx,visited);\n\t\t\t\tif(!ok){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tidx++;\n\t\t}\n\t\tif(ok){\n\t\t\tcout << \"yes\" << endl;\n\t\t}\n\t\telse{\n\t\t\tcout << \"no\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 8080,
"score_of_the_acc": -0.5941,
"final_rank": 9
},
{
"submission_id": "aoj_0251_3876192",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool ContainLoop( int c, int p, const vector< vector<int> >& g, vector<int>& visit ) {\n\n visit[c] = true;\n \n for ( int dst : g[c] ) {\n\tif ( dst == p ) continue;\n\tif ( visit[dst] ) return true;\n\tif ( ContainLoop( dst, c, g, visit ) ) return true;\n }\n\n return false;\n}\n\nint main() {\n int n, m;\n while ( cin >> n >> m ) {\n\n\tif ( !n && !m ) break;\n\n\tvector<int> cnt( n );\n\tvector< vector<int> > g( n );\n\tvector<int> visit( n );\n\n\tbool ok = true;\n\tint s, t;\n\tfor ( int i=0; i<m; ++i ) {\n\t cin >> s >> t;\n\t --s, --t;\n\t ++cnt[s];\n\t ++cnt[t];\n\t if ( cnt[s] > 2 || cnt[t] > 2 ) ok = false;\n\t g[s].push_back( t );\n\t g[t].push_back( s );\n\t}\n\n\tif ( !ok ) cout << \"no\" << endl;\n\telse {\n\t int i = 0;\n\t for ( ; i<n; ++i ) {\n\t\tif ( !visit[i] && ContainLoop( i, -1, g, visit ) ) break;;\n\t }\n\t if ( i == n ) cout << \"yes\" << endl;\n\t else cout << \"no\" << endl;\n\t \n\t}\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 7008,
"score_of_the_acc": -1.3027,
"final_rank": 16
},
{
"submission_id": "aoj_0251_3502835",
"code_snippet": "#include<iostream>\n#include<string>\n#include<iomanip>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\n#define int long long\n#define rep(i,n) for(int i = 0; i < (n); i++)\n#define INF ((long long)1e18)\n#define MOD ((int)1e9+7)\n#define endl \"\\n\"\n\n#define yn(f) ((f)?\"yes\":\"no\")\n#define YN(f) ((f)?\"YES\":\"NO\")\n\n#define MAX\n\nsigned main(){\n\t// cin.tie(0);\n\t// ios::sync_with_stdio(false);\n\t// cout<<fixed<<setprecision(10);\n\t\n\twhile(true){\n\t\tint n, m, u, v;\n\t\tbool flag = true;\n\t\tvector<vector<int>> graph;\n\t\tvector<int> used;\n\t\t\n\t\tcin>>n>>m;\n\t\t\n\t\tif(!n && !m) break;\n\t\t\n\t\tgraph.resize(n+1);\n\t\tused.resize(n+1);\n\t\t// for(int y : used){\n\t\t\t// cout<<\"used \"<<y<<endl;\n\t\t// }\n\t\t\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tcin>>u>>v;\n\t\t\tgraph[u].push_back(v);\n\t\t\tgraph[v].push_back(u);\n\t\t}\n\t\t\n\t\tfor(int i = 1; i <= n; i++){//cout<<i<<endl;\n\t\t\tif(graph[i].size() > 2){\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t} else if(graph[i].size() == 1 && used[i] == false){\n\t\t\t\tint n = graph[i][0];\n\t\t\t\tused[i] = true;\n\t\t\t\t\n\t\t\t\t// cout<<\" AA \"<<i<<endl;\n\t\t\t\twhile(true){\n\t\t\t\t\t// cout<<\" BB \"<<n<<endl;\n\t\t\t\t\tif(graph[n].size() > 2){\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if(graph[n].size() == 2){\n\t\t\t\t\t\tif(used[graph[n][0]] == false){\n\t\t\t\t\t\t\tused[n] = true;\n\t\t\t\t\t\t\tn = graph[n][0];\n\t\t\t\t\t\t} else if(used[graph[n][1]] == false){\n\t\t\t\t\t\t\tused[n] = true;\n\t\t\t\t\t\t\tn = graph[n][1];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if(graph[n].size() == 1){\n\t\t\t\t\t\tused[n] = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(flag == false) break;\n\t\t\t}\n\t\t}\n\t\t// cout<<\"END\"<<endl;\n\t\t\n\t\tfor(int i = 1; i <= n && flag; i++){\n\t\t\t// cout<<i<<endl;\n\t\t\tif(graph[i].size() && used[i] == false){\n\t\t\t\tflag = false;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tcout<<yn(flag)<<endl;\n\t}\n\t\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 8376,
"score_of_the_acc": -1.4493,
"final_rank": 17
},
{
"submission_id": "aoj_0251_3502261",
"code_snippet": "#include<bits/stdc++.h>\n#define REP(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\n#define int long long\n\nconst int SIZE=100010;\nbool used[SIZE];\n\nbool bfs(int s,vector<vector<int> >& G)\n{\n used[s]=true;\n queue<int> Q;\n Q.push(s);\n\n bool ok=true;\n bool all2=true;\n while(!Q.empty()){\n int v=Q.front(); Q.pop();\n //check\n if((int)G[v].size()>=3) ok=false;\n if((int)G[v].size()<2) all2=false;\n\n for(int u:G[v]){\n if(!used[u]){\n used[u]=true;\n Q.push(u);\n }\n }\n }\n return (ok and !all2);\n}\n\nsigned main()\n{\n while(true){\n int N,M; cin>>N>>M;\n if(N==0 and M==0) break;\n\n vector<vector<int> > G;\n G.resize(N);\n REP(i,M){\n int a,b; cin>>a>>b;\n a--; b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n\n REP(i,N) used[i]=false;\n bool ok=true;\n REP(i,N){\n if(!used[i]){\n if(!bfs(i,G)) ok=false;\n }\n }\n cout<<(ok? \"yes\":\"no\")<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 8428,
"score_of_the_acc": -1.5137,
"final_rank": 18
},
{
"submission_id": "aoj_0251_3502212",
"code_snippet": "#include<iostream>\n#include<vector>\n#define REP(i,N) for(int i=0;i<(N);++i)\nusing namespace std;\nbool check(vector<vector<int> >&map, vector<char> &used,int place,int bplace){\n bool res = true;\n REP(i,map[place].size()){\n if(map[place][i] == bplace)continue;\n if(used[map[place][i]])return false;\n used[map[place][i]] = true;\n res &= check(map,used,map[place][i],place);\n }\n return res;\n}\nint main(){\n int n,m;\n while(cin>>n>>m&&n!=0){\n vector<vector<int> > count(n,vector<int>());\n vector<char> used(n,false);\n REP(i,m){\n int a,b;\n cin>>a>>b;\n --a;--b;\n count[a].push_back(b);\n count[b].push_back(a);\n }\n bool flag = true;\n REP(i,n){\n if(count[i].size()>=3){\n flag=false;\n continue;\n }\n }\n if(!flag){\n cout << \"no\" << endl;\n continue;\n }\n REP(i,count.size()){\n if(used[i])continue;\n flag &= check(count,used,i,-1);\n }\n cout << (flag?\"yes\":\"no\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 6408,
"score_of_the_acc": -1.2383,
"final_rank": 14
},
{
"submission_id": "aoj_0251_3502078",
"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;\n#define F first\n#define S second\n\nvector<int>v[100009];\nint used[100009];\nint n,m;\n\nint dfs(int x,int t,int par){\n used[x]=t;\n r(i,v[x].size()){\n int nex=v[x][i];\n if(nex==par)continue;\n if(used[nex]==-1){\n if(dfs(nex,t,x))return 1;\n }\n else{\n if(used[nex]==t){\n return 1;\n }\n }\n }\n return 0;\n}\n\nbool FALSE(){\n r(i,n){\n if(v[i].size()>=3){\n return false;\n }\n }\n r(i,n)if(used[i]==-1){\n int x=dfs(i,1,-1);\n if(x)return false;\n }\n return true;\n}\n\nsigned main(){\n\n while(cin>>n>>m,n){\n r(i,n+1)v[i].clear();\n memset(used,-1,sizeof(used));\n r(i,m){\n int a,b;\n cin>>a>>b;\n v[b].push_back(a);\n v[a].push_back(b);\n }\n\n if(!FALSE())cout<<\"no\"<<endl;\n else cout<<\"yes\"<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 9156,
"score_of_the_acc": -1.5329,
"final_rank": 19
}
] |
aoj_0246_cpp
|
ばらばら饅頭
会津若松市にある和菓子屋・友栗堂の店長さんは、とても腕のいい職人さんなのにちょっと気分屋なのが玉にキズです。店長さんの作る饅頭はとても美味しいのですが、その時の気分によって大きさがまちまちになってしまいます。
見かねた店長さんの奥さんは、大きさと重さがばらばらな饅頭を袋に詰めて売り出すことを思いつきました。一定の重さになるように饅頭を袋に詰めて売れば、一つ一つの大きさはばらばらでも一定の値段で売り出すことが出来ますし、どんな饅頭が入っているのか開けるまでわからないというサプライズも売りになるかもしれません。
「ばらばら饅頭」という名前で売りだしたところ、新しいアイディアが話題となり友栗堂はたちまち評判となりました。しかし、問題もあり、袋に入れる饅頭の組み合わせ方によって作れる「ばらばら饅頭」の数が変わり、無駄が発生してしまうことがありました。アルバイトで友栗堂に来ていたあなたは無駄なく袋に詰めるためにプログラムをつくることにしました。
饅頭の重さは1から9の9種類あります。袋に詰める時には、饅頭の重さの合計がぴったり10になるように詰め込みます。饅頭の組み合わせ方は1+1+2+4+2=10や1+1+1+1+1+5=10などで、同じ重さの饅頭をいくつ使っても構いません。
作られる饅頭の個数と饅頭の重さの情報を入力とし、作ることのできる「ばらばら饅頭」の最大の数を出力するプログラムを作成してください。
入力
複数のデータセットが与えられます。入力の終わりはゼロひとつで示されます。各データセットは以下の形式で与えられます。
n
m
1
m
2
...
m
n
1行目に饅頭の個数
n
(2 ≤
n
≤ 100) が与えられます。
2行目に各饅頭の重さ
m
i
(1 ≤
m
i
≤ 9) が与えられます。
データセットの数は 100 を超えません。
出力
データセットごとに、詰め込むことのできた「ばらばら饅頭」の最大の数を1行に出力します。
入力例
5
4 9 1 3 8
10
8 5 3 6 2 1 4 5 4 5
9
5 7 3 8 2 9 6 4 1
0
出力例
1
4
4
|
[
{
"submission_id": "aoj_0246_10184019",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\nint accum(const vector<int>& a) {\n int s = 0;\n for (int i = 0; i < a.size(); ++i) {\n s += i * a[i];\n }\n return s;\n}\n\nmap<vector<int>, int> m;\n\nint rec(vector<int>& a, int w) {\n if (m.find(a) != m.end()) return m[a];\n if (accum(a) + w < 10) return 0;\n if (w > 10) {\n return 0;\n }\n int ans = 0;\n for (int i = 1; i < 10; ++i) {\n if (a[i] > 0) {\n --a[i];\n if (w + i == 10) ans = max(ans, rec(a, 0) + 1);\n else ans = max(ans, rec(a, w + i));\n ++a[i];\n }\n }\n m[a] = ans;\n return ans;\n}\n\nvoid run_test(int n) {\n m.clear();\n vector<int> a(10);\n for (int x, i = 0; i < n; ++i) {\n cin >> x;\n ++a[x];\n }\n int ans = 0;\n for (int i = 1; i < 5; ++i) {\n int cnt = min(a[i], a[10 - i]);\n a[i] -= cnt;\n a[10 - i] -= cnt;\n ans += cnt;\n }\n ans += a[5] / 2;\n a[5] %= 2;\n ans += rec(a, 0);\n cout << ans << '\\n';\n}\n\nint main() {\n int n;\n cin >> n;\n while (n > 0) {\n run_test(n);\n cin >> n;\n }\n /*for (int i = 0; i < 100; ++i) {\n cout << 100 << '\\n';\n for (int j = 0; j < 100; ++j) cout << 1 << ' ';\n cout << '\\n';\n }\n cout << 0;*/\n}",
"accuracy": 1,
"time_ms": 1780,
"memory_kb": 68184,
"score_of_the_acc": -1.3952,
"final_rank": 8
},
{
"submission_id": "aoj_0246_10179366",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#define Release\n\nusing namespace std;\n\nint max_ans;\n\nint accum(const vector<int>& a) {\n int s = 0;\n for (int i = 0; i < a.size(); ++i) {\n s += i * a[i];\n }\n return s;\n}\n\nmap<vector<int>, int> m;\n\nint rec(vector<int>& a, int w) {\n if (m.find(a) != m.end()) return m[a];\n if (accum(a) + w < 10) return 0;\n if (w > 10) {\n return 0;\n }\n int ans = 0;\n for (int i = 1; i < 10; ++i) {\n if (a[i] > 0) {\n --a[i];\n if (w + i == 10) ans = max(ans, rec(a, 0) + 1);\n else ans = max(ans, rec(a, w + i));\n ++a[i];\n }\n }\n m[a] = ans;\n return ans;\n}\n\nvoid run_test(int n) {\n m.clear();\n vector<int> a(10);\n for (int x, i = 0; i < n; ++i) {\n cin >> x;\n ++a[x];\n }\n int ans = 0;\n for (int i = 1; i < 5; ++i) {\n int cnt = min(a[i], a[10 - i]);\n a[i] -= cnt;\n a[10 - i] -= cnt;\n ans += cnt;\n }\n ans += a[5] / 2;\n a[5] %= 2;\n max_ans = 0;\n ans += rec(a, 0);\n cout << ans << '\\n';\n}\n\nint main() {\n#ifdef Release\n int n;\n cin >> n;\n while (n > 0) {\n run_test(n);\n cin >> n;\n }\n#endif // Release\n //run();\n}",
"accuracy": 1,
"time_ms": 1800,
"memory_kb": 68348,
"score_of_the_acc": -1.4032,
"final_rank": 9
},
{
"submission_id": "aoj_0246_10179359",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#define Release\n\nusing namespace std;\n\nint max_ans;\n\nint accum(const vector<int>& a) {\n int s = 0;\n for (int i = 0; i < a.size(); ++i) {\n s += i * a[i];\n }\n return s;\n}\n\nmap<vector<int>, int> m;\n\nint rec(vector<int>& a, int w) {\n if (m.find(a) != m.end()) return m[a];\n if (accum(a) + w < 10) return 0;\n if (w > 10) {\n return 0;\n }\n int ans = 0;\n for (int i = 1; i < 10; ++i) {\n if (a[i] > 0) {\n --a[i];\n if (w + i == 10) ans = max(ans, rec(a, 0) + 1);\n ans = max(ans, rec(a, w + i));\n ++a[i];\n }\n }\n m[a] = ans;\n return ans;\n}\n\nvoid run_test(int n) {\n vector<int> a(10);\n for (int x, i = 0; i < n; ++i) {\n cin >> x;\n ++a[x];\n }\n int ans = 0;\n for (int i = 1; i < 5; ++i) {\n int cnt = min(a[i], a[10 - i]);\n a[i] -= cnt;\n a[10 - i] -= cnt;\n ans += cnt;\n }\n ans += a[5] / 2;\n a[5] %= 2;\n max_ans = 0;\n ans += rec(a, 0);\n cout << ans << '\\n';\n}\n\nint main() {\n#ifdef Release\n int n;\n cin >> n;\n while (n > 0) {\n run_test(n);\n cin >> n;\n }\n#endif // Release\n //run();\n}",
"accuracy": 0.125,
"time_ms": 40,
"memory_kb": 9456,
"score_of_the_acc": -0.0885,
"final_rank": 20
},
{
"submission_id": "aoj_0246_10096583",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef pair<int, int> pii;\n\n// Function to generate all possible subsets of weights 1..9 that sum to 10 with more than 2 buns\nVVI generate_subsets(int i, int s, VI current, VVI &subsets) {\n if (i == 0) {\n if (s == 10 && accumulate(current.begin(), current.end(), 0) > 2) {\n subsets.emplace_back(current);\n }\n return subsets;\n }\n for(int k =0; k <= (10 - s)/i; ++k){\n current[i] = k;\n generate_subsets(i-1, s + k*i, current, subsets);\n }\n return subsets;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n VVI subsets;\n VI current(10, 0);\n generate_subsets(9, 0, current, subsets);\n int L = subsets.size();\n int n;\n while(cin >> n && n !=0){\n VI weights(n);\n for(auto &w : weights) cin >> w;\n VI C(10, 0);\n for(auto &w : weights){\n if(w >=1 && w <=9){\n C[w]++;\n }\n }\n int ans =0;\n for(int k=1; k<=4; ++k){\n int c = min(C[k], C[10 -k]);\n C[k] -=c;\n C[10 -k] -=c;\n ans +=c;\n }\n int c = C[5] /2;\n C[5] -=c*2;\n ans +=c;\n // Memoization\n unordered_map<string, int> memo[L];\n // DFS function\n function<int(int, VI)> dfs = [&](int idx, VI state) -> int{\n if(idx == L) return 0;\n string key = \"\";\n for(int j=1; j<=9; ++j) key += to_string(state[j]) + \",\";\n if(memo[idx].find(key) != memo[idx].end()) return memo[idx][key];\n int res =0;\n // Try all possible k\n VI rc = subsets[idx];\n int mk = INT32_MAX;\n for(int j=1; j<=9; ++j){\n if(rc[j] >0){\n mk = min(mk, state[j]/rc[j]);\n }\n }\n for(int k_val=0; k_val <= mk; ++k_val){\n VI new_state = state;\n bool valid = true;\n for(int j=1; j<=9; ++j){\n new_state[j] -= rc[j]*k_val;\n if(new_state[j] <0){\n valid = false;\n break;\n }\n }\n if(valid){\n res = max(res, dfs(idx+1, new_state) + k_val);\n }\n }\n return memo[idx][key] = res;\n };\n ans += dfs(0, C);\n cout << ans << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 3160,
"memory_kb": 75992,
"score_of_the_acc": -1.8971,
"final_rank": 14
},
{
"submission_id": "aoj_0246_7049171",
"code_snippet": "#include <iostream>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\n\n\n\nint f(int n){\n\tint rr[102][911];\n\tmemset(rr,-1,sizeof(rr));\n\tint ds[101];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>ds[i];\n\t}\n\tint ans=0;\n\tint sum=0;\n\trr[0][0]=0;\n\tfor(int i=0;i<n;i++){\n\t\tint d=ds[i];\n\t\tfor(int j=sum;j>=0;j--){\n\t\t\tif(rr[i][j]==-1)continue;\n\t\t\tint x=rr[i][j];\n\t\t\tint add=0;\n\t\t\tfor(int k=j;k<=sum;k++){\n\t\t\t\tif(rr[i][k]==-1)continue;\n\t\t\t\tint t=k+d;\n\t\t\t\tif(t%10==0&&k>j){\n\t\t\t\t\tadd++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\trr[i+1][t]=max(rr[i+1][t],add);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tsum+=d;\n\t\tfor(int j=0;j<=sum;j++){\n\t\t\trr[i+1][j]=max(rr[i+1][j],rr[i][j]);\n\t\t\tans=max(ans,rr[i+1][j]);\n\t\t}\n\t\t\n\t\t//for(int j=0;j<21;j++){\n\t\t//\tcout<<\" \"<<rr[i+1][j];\n\t\t//}\n\t\t//cout<<endl;\n\t}\n\treturn ans;\n}\n\nint main() {\n\t// your code goes here\n\tint n;\n\twhile(true){\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tcout<<f(n)<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.25,
"time_ms": 230,
"memory_kb": 3452,
"score_of_the_acc": -0.06,
"final_rank": 17
},
{
"submission_id": "aoj_0246_5752508",
"code_snippet": "#include <iostream>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nint dp[101][1001];\nconst int l=901;\nint main() {\n\t// your code goes here\n\twhile(true){\n\t\tint n;\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tmemset(dp,-1,sizeof(dp));\n\t\tdp[0][0]=0;\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint m;\n\t\t\tcin>>m;\n\t\t\tfor(int j=l;j>=m;j--){\n\t\t\t\tint m2=j-m;\n\t\t\t\tif(dp[i][m2]>-1){\n\t\t\t\t\tif(j%10==0&&(dp[i][m2]+1==(j/10))){\n\t\t\t\t\t\tif(dp[i+1][j]<dp[i][m2]+1){\n\t\t\t\t\t\t\tdp[i+1][j]=dp[i][m2]+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tdp[i+1][j]=max(dp[i+1][j],dp[i][m2]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint m3=0;\n\n\t\t\t\n\t\t\tfor(int j=l;j>=0;j--){\n\t\t\t\tdp[i+1][j]=max(dp[i+1][j],dp[i][j]);\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j=10;j<l;j+=10){\n\t\t\t\t\n\t\t\t\tif(dp[i+1][j]>dp[i][j]){\n\t\t\t\t\tfor(int k=1;k<11;k++){\n\t\t\t\t\t\tdp[i+1][j+k]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=0;j<l;j++){\n\t\t\t\tans=max(dp[i+1][j],ans);\n\t\t\t//\tcout<<(dp[i+1][j]==-1?9:dp[i+1][j]);\n\t\t\t}\n\t\t\t//cout<<endl;\n\t\t\t\n\t\t\t//cout<<(dp[i+1][j]==-1?9:dp[i+1][j]);\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.25,
"time_ms": 20,
"memory_kb": 3452,
"score_of_the_acc": 0,
"final_rank": 16
},
{
"submission_id": "aoj_0246_4981933",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).endf()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).endf())\n#define SORT(c) sort((c).begin(), (c).endf())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-4, PI = acos(-1);\n//ここから編集 \ntypedef string::const_iterator State;\nmap<vector<int>, int> dp;\nint rec(vector<int> &v, int sum) {\n if(dp.count(v)) return dp[v];\n int res = 0;\n for(int i=1; i<=9; i++){\n if(v[i] > 0 && sum+i <= 10){\n v[i]--;\n res = max(res, rec(v, (sum+i)%10) + (sum+i)/10);\n v[i]++;\n }\n }\n return dp[v] = res;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n int n;\n while(cin >> n, n){\n \n vector<int> cnt(10, 0);\n REP(i,n){\n int a; cin >> a;\n cnt[a]++;\n }\n\n int ans = 0;\n for(int i=1; i<=4; i++){\n int mi = min(cnt[i], cnt[10-i]);\n ans += mi;\n cnt[i] -= mi;\n cnt[10-i] -= mi;\n }\n ans += cnt[5]/2;\n cnt[5] = cnt[5]%2;\n dp.clear();\n ans += rec(cnt, 0);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1980,
"memory_kb": 68244,
"score_of_the_acc": -1.4532,
"final_rank": 10
},
{
"submission_id": "aoj_0246_4955200",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nmap<vector<int>, int> dp;\n\nint Dfs(vector<int> &ko, int s){\n if(dp.count(ko)) return dp[ko];\n\n int res = 0;\n for(int i=1;i<10;i++){\n if(ko[i] == 0) continue;\n if(s + i <= 10){\n ko[i]--;\n res = max(res, Dfs(ko, (s + i) % 10) + (s + i) / 10);\n ko[i]++;\n }\n }\n\n return dp[ko] = res;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n while(1){\n int n; cin>>n; if(n == 0) break;\n dp.clear();\n vector<int> ko(10,0);\n int ans = 0;\n rep(i,n){\n int a; cin>>a; ko[a]++;\n }\n\n for(int i=1;i<=4;i++){\n int c = min(ko[i], ko[10 - i]);\n ans += c; ko[i] -= c; ko[10 - i] -= c;\n }\n ans += ko[5] / 2; ko[5] %= 2;\n ans += Dfs(ko, 0);\n cout << ans << '\\n';\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 2210,
"memory_kb": 68244,
"score_of_the_acc": -1.5189,
"final_rank": 11
},
{
"submission_id": "aoj_0246_4908201",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\nint N;\nint cnt[10];\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tfor(int i=1;i<=9;i++)cnt[i]=0;\n\t\tint ans=0;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint m;cin>>m;cnt[m]++;\n\t\t}\n\t\tvector<pair<int,int> >X;\n\t\tfor(int i=1;i<5;i++)\n\t\t{\n\t\t\tint L=cnt[i],R=cnt[10-i];\n\t\t\tif(L<=R)\n\t\t\t{\n\t\t\t\tans+=L;\n\t\t\t\tX.push_back(make_pair(R-L,10-i));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tans+=R;\n\t\t\t\tX.push_back(make_pair(L-R,i));\n\t\t\t}\n\t\t}\n\t\tans+=cnt[5]/2;\n\t\tX.push_back(make_pair(cnt[5]%2,5));\n\t\tvector<vector<vector<vector<vector<vector<int> > > > > >dp(X[0].first+1,\n\t\t\tvector<vector<vector<vector<vector<int> > > > >(X[1].first+1,\n\t\t\t\tvector<vector<vector<vector<int> > > >(X[2].first+1,\n\t\t\t\t\tvector<vector<vector<int> > >(X[3].first+1,\n\t\t\t\t\t\tvector<vector<int> >(X[4].first+1,\n\t\t\t\t\t\t\tvector<int>(10,-1))))));\n\t\tdp[0][0][0][0][0][0]=0;\n\t\tint mx=0;\n\t\tfor(int a=0;a<=X[0].first;a++)\n\t\t\tfor(int b=0;b<=X[1].first;b++)\n\t\t\t\tfor(int c=0;c<=X[2].first;c++)\n\t\t\t\t\tfor(int d=0;d<=X[3].first;d++)\n\t\t\t\t\t\tfor(int e=0;e<=X[4].first;e++)\n\t\t\t\t\t\t\tfor(int k=0;k<10;k++)\n\t\t\t\t\t\t\t\tif(dp[a][b][c][d][e][k]>=0)\n\t\t{\n\t\t\tint now=dp[a][b][c][d][e][k];\n\t\t\tif(mx<now)mx=now;\n\t\t\tif(a<X[0].first&&k+X[0].second<=10)\n\t\t\t{\n\t\t\t\tint nk=k+X[0].second;\n\t\t\t\tint nxt=now;\n\t\t\t\tif(nk==10)nk=0,nxt++;\n\t\t\t\tdp[a+1][b][c][d][e][nk]=max(dp[a+1][b][c][d][e][nk],nxt);\n\t\t\t}\n\t\t\tif(b<X[1].first&&k+X[1].second<=10)\n\t\t\t{\n\t\t\t\tint nk=k+X[1].second;\n\t\t\t\tint nxt=now;\n\t\t\t\tif(nk==10)nk=0,nxt++;\n\t\t\t\tdp[a][b+1][c][d][e][nk]=max(dp[a][b+1][c][d][e][nk],nxt);\n\t\t\t}\n\t\t\tif(c<X[2].first&&k+X[2].second<=10)\n\t\t\t{\n\t\t\t\tint nk=k+X[2].second;\n\t\t\t\tint nxt=now;\n\t\t\t\tif(nk==10)nk=0,nxt++;\n\t\t\t\tdp[a][b][c+1][d][e][nk]=max(dp[a][b][c+1][d][e][nk],nxt);\n\t\t\t}\n\t\t\tif(d<X[3].first&&k+X[3].second<=10)\n\t\t\t{\n\t\t\t\tint nk=k+X[3].second;\n\t\t\t\tint nxt=now;\n\t\t\t\tif(nk==10)nk=0,nxt++;\n\t\t\t\tdp[a][b][c][d+1][e][nk]=max(dp[a][b][c][d+1][e][nk],nxt);\n\t\t\t}\n\t\t\tif(e<X[4].first&&k+X[4].second<=10)\n\t\t\t{\n\t\t\t\tint nk=k+X[4].second;\n\t\t\t\tint nxt=now;\n\t\t\t\tif(nk==10)nk=0,nxt++;\n\t\t\t\tdp[a][b][c][d][e+1][nk]=max(dp[a][b][c][d][e+1][nk],nxt);\n\t\t\t}\n\t\t}\n\t\tcout<<ans+mx<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 55112,
"score_of_the_acc": -0.7607,
"final_rank": 5
},
{
"submission_id": "aoj_0246_4387364",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\n\n\nint main() {\n int n;\n while(cin >> n, n){\n array<int, 11> cnt{};\n for (int i = 0; i < n; ++i) {\n int x; cin >> x;\n cnt[x]++;\n }\n int ans = 0;\n while(cnt[1] && cnt[9]) cnt[1]--, cnt[9]--, ans++;\n while(cnt[2] && cnt[8]) cnt[2]--, cnt[8]--, ans++;\n while(cnt[3] && cnt[7]) cnt[3]--, cnt[7]--, ans++;\n while(cnt[4] && cnt[6]) cnt[4]--, cnt[6]--, ans++;\n while(cnt[5] >= 2) cnt[5] -= 2, ans++;\n vector<pair<int, int>> v;\n for (int i = 1; i < 9; ++i) if(cnt[i]) v.emplace_back(cnt[i], i);\n while(v.size() < 5) v.emplace_back(0, 0);\n using A = array<char, 5>;\n A x;\n for (int i = 0; i < v.size(); ++i) x[i] = v[i].first;\n vector<A> ok;\n for (char i = 0; i <= v[0].first; ++i) {\n for (char j = 0; j <= v[1].first; ++j) {\n for (char k = 0; k <= v[2].first; ++k) {\n for (char l = 0; l <= v[3].first; ++l) {\n for (char m = 0; m <= v[4].first; ++m) {\n if(i*v[0].second+j*v[1].second+k*v[2].second+l*v[3].second+m*v[4].second == 10) ok.emplace_back(A{i, j, k, l, m});\n }\n }\n }\n }\n }\n map<A, int> dp;\n auto dfs = [&](A x, int dep, auto &&f) -> int {\n if(dp.count(x)) return dp[x];\n int ret = dep;\n for (int i = 0; i < ok.size(); ++i) {\n A y;\n for (int j = 0; j < 5; ++j) y[j] = x[j]-ok[i][j];\n if(*min_element(y.begin(),y.end()) >= 0) ret = max(ret, f(y, dep+1, f));\n }\n return dp[x] = ret;\n };\n cout << dfs(x, ans, dfs) << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 590,
"memory_kb": 6268,
"score_of_the_acc": -0.2017,
"final_rank": 2
},
{
"submission_id": "aoj_0246_3732349",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nmap<vector<int>, int> dp;\n\nint rec(vector<int> &v, int sum){\n if(dp.count(v)) return dp[v];\n int res = 0;\n for(int i=9; i>=1; i--){\n if(v[i]>0 && sum+i<=10){\n v[i]--;\n res = max(res, rec(v, (sum+i)%10)+(sum+i)/10);\n v[i]++;\n }\n }\n return dp[v] = res;\n}\n\nint main() {\n int n;\n while(cin >> n, n){\n vector<int> v(10,0);\n int ans = 0;\n for(int i=0;i<n;i++){\n int a;\n cin >> a;\n v[a]++;\n }\n for(int i=1;i<=4;i++){\n int tmp = min(v[i], v[10-i]);\n ans += tmp;\n v[i] -= tmp;\n v[10-i] -= tmp;\n }\n ans += v[5]/2;\n v[5] %= 2;\n dp.clear();\n ans += rec(v, 0);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2630,
"memory_kb": 68112,
"score_of_the_acc": -1.6371,
"final_rank": 13
},
{
"submission_id": "aoj_0246_3732127",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nmap<vector<int>, int> dp;\n\nint rec(vector<int> &v, int sum){\n if(dp.count(v)) return dp[v];\n int res = 0;\n for(int i=9; i>=1; i--){\n if(v[i]>0 && sum+i<=10){\n v[i]--;\n res = max(res, rec(v, (sum+i)%10)+(sum+i)/10);\n v[i]++;\n }\n }\n return dp[v] = res;\n}\n\nint main() {\n int n;\n while(cin >> n, n){\n vector<int> v(10,0);\n int ans = 0;\n for(int i=0;i<n;i++){\n int a;\n cin >> a;\n v[a]++;\n }\n for(int i=1;i<=4;i++){\n int tmp = min(v[i], v[10-i]);\n ans += tmp;\n v[i] -= tmp;\n v[10-i] -= tmp;\n }\n ans += v[5]/2;\n v[5] %= 2;\n ans += rec(v, 0);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 0.125,
"time_ms": 40,
"memory_kb": 9292,
"score_of_the_acc": -0.0862,
"final_rank": 19
},
{
"submission_id": "aoj_0246_3732080",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nmap<vector<int>, int> dp;\n\nint rec(vector<int> &v, int sum){\n if(dp.count(v)) return dp[v];\n int res = 0;\n for(int i=1; i<=9; i++){\n if(v[i]>0 && sum+i<=10){\n v[i]--;\n res = max(res, rec(v, (sum+i)%10)+(sum+i)/10);\n v[i]++;\n }\n }\n return dp[v] = res;\n}\n\nint main() {\n int n;\n while(cin >> n, n){\n vector<int> v(10,0);\n int ans = 0;\n for(int i=0;i<n;i++){\n int a;\n cin >> a;\n v[a]++;\n }\n for(int i=1;i<=4;i++){\n int tmp = min(v[i], v[10-i]);\n ans += tmp;\n v[i] -= tmp;\n v[10-i] -= tmp;\n }\n ans += v[5]/2;\n v[5] %= 2;\n ans += rec(v, 0);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 0.125,
"time_ms": 40,
"memory_kb": 9248,
"score_of_the_acc": -0.0856,
"final_rank": 18
},
{
"submission_id": "aoj_0246_3598145",
"code_snippet": "#include<algorithm>\n#include<stdio.h>\n#include<map>\nusing namespace std;\nstruct wolf{\n\tint t[9];\n\twolf(){}\n};\nint v[9];\nint D[36][9]={\n{2,0,0,0,0,0,0,1,0},\n{1,1,0,0,0,0,1,0,0},\n{3,0,0,0,0,0,1,0,0},\n{1,0,1,0,0,1,0,0,0},\n{0,2,0,0,0,1,0,0,0},\n{2,1,0,0,0,1,0,0,0},\n{4,0,0,0,0,1,0,0,0},\n{1,0,0,1,1,0,0,0,0},\n{0,1,1,0,1,0,0,0,0},\n{2,0,1,0,1,0,0,0,0},\n{1,2,0,0,1,0,0,0,0},\n{3,1,0,0,1,0,0,0,0},\n{5,0,0,0,1,0,0,0,0},\n{0,1,0,2,0,0,0,0,0},\n{0,0,2,1,0,0,0,0,0},\n{2,0,0,2,0,0,0,0,0},\n{1,1,1,1,0,0,0,0,0},\n{0,3,0,1,0,0,0,0,0},\n{3,0,1,1,0,0,0,0,0},\n{2,2,0,1,0,0,0,0,0},\n{4,1,0,1,0,0,0,0,0},\n{6,0,0,1,0,0,0,0,0},\n{1,0,3,0,0,0,0,0,0},\n{0,2,2,0,0,0,0,0,0},\n{2,1,2,0,0,0,0,0,0},\n{4,0,2,0,0,0,0,0,0},\n{1,3,1,0,0,0,0,0,0},\n{3,2,1,0,0,0,0,0,0},\n{5,1,1,0,0,0,0,0,0},\n{7,0,1,0,0,0,0,0,0},\n{0,5,0,0,0,0,0,0,0},\n{2,4,0,0,0,0,0,0,0},\n{4,3,0,0,0,0,0,0,0},\n{6,2,0,0,0,0,0,0,0},\n{8,1,0,0,0,0,0,0,0},\n{10,0,0,0,0,0,0,0,0}\n};\nlong long conv(wolf a){\n\tlong long ret=0;\n\tfor(int i=0;i<9;i++){\n\t\tret*=128;\n\t\tret+=a.t[i];\n\t}\n\treturn ret;\n}\nmap<long long,int> dp;\nint solve(wolf a,int b){\n\tif((int)(dp.count(conv(a))))return dp[conv(a)];\n\tint ret=0;\n\tfor(int i=b;i<36;i++){\n\t\tbool ok=true;\n\t\tfor(int j=0;j<9;j++){\n\t\t\tif(a.t[j]<D[i][j]){\n\t\t\t\tok=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(ok){\n\t\t\tfor(int j=0;j<9;j++)a.t[j]-=D[i][j];\n\t\t\tret=max(ret,solve(a,i)+1);\n\t\t\tfor(int j=0;j<9;j++)a.t[j]+=D[i][j];\n\t\t}\n\t}\n\treturn dp[conv(a)]=ret;\n}\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tdp.clear();\n\t\tfor(int i=0;i<10;i++)v[i]=0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint b;\n\t\t\tscanf(\"%d\",&b);\n\t\t\tb--;\n\t\t\tv[b]++;\n\t\t}\n\t\tint ret=0;\n\t\tfor(int i=5;i<9;i++){\n\t\t\tint V=min(v[i],v[8-i]);\n\t\t\tret+=V;\n\t\t\tv[i]-=V;\n\t\t\tv[8-i]-=V;\n\t\t}\n\t\tret+=v[4]/2;\n\t\tv[4]%=2;\n\t\twolf S;\n\t\tfor(int i=0;i<9;i++)S.t[i]=v[i];\n\t\tprintf(\"%d\\n\",ret+solve(S,0));\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 5928,
"score_of_the_acc": -0.0598,
"final_rank": 1
},
{
"submission_id": "aoj_0246_3220362",
"code_snippet": "// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nint N;\nmap< vector<int>, int > dp;\n\nint solve(vector<int>& vec, int sum = 0, int id = 1) {\n int res = 0;\n if(sum == 10) {\n res++;\n sum = 0; id = 1;\n }\n if(dp.count(vec)) return dp[vec];\n\n int add = 0;\n for(int i=id; i<=9; i++) {\n if(vec[i] > 0 && sum + i <= 10) {\n vec[i]--; sum += i;\n chmax(add, solve(vec, sum, i));\n vec[i]++; sum -= i;\n }\n }\n res += add;\n\n if(sum == 0) dp[vec] = res;\n return res;\n}\n\nsigned main() {\n while(cin >> N, N) {\n dp.clear();\n vector<int> countManju(11);\n\n for(int i=0; i<N; i++) {\n int val; cin >> val;\n countManju[val]++;\n }\n \n int ans = 0;\n for(int i=1; i<5; i++) {\n int add = min(countManju[i], countManju[10 - i]);\n ans += add;\n countManju[i ] -= add;\n countManju[10 - i] -= add;\n }\n ans += countManju[5] / 2;\n countManju[5] %= 2;\n\n ans += solve(countManju);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2340,
"memory_kb": 12064,
"score_of_the_acc": -0.7816,
"final_rank": 6
},
{
"submission_id": "aoj_0246_3220361",
"code_snippet": "// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nint N;\nmap< vector<int>, int > dp;\n\nint solve(vector<int>& vec, int sum = 0, int id = 1) {\n int res = 0;\n if(sum == 10) {\n res++;\n sum = 0; id = 1;\n }\n if(dp.count(vec)) return dp[vec];\n if(sum > 10) return 0;\n\n int add = 0;\n for(int i=id; i<=9; i++) {\n if(vec[i] > 0 && sum + i <= 10) {\n vec[i]--; sum += i;\n chmax(add, solve(vec, sum, i));\n vec[i]++; sum -= i;\n }\n }\n res += add;\n\n if(sum == 0) dp[vec] = res;\n return res;\n}\n\nsigned main() {\n while(cin >> N, N) {\n dp.clear();\n vector<int> countManju(11);\n\n for(int i=0; i<N; i++) {\n int val; cin >> val;\n countManju[val]++;\n }\n \n int ans = 0;\n for(int i=1; i<5; i++) {\n int add = min(countManju[i], countManju[10 - i]);\n ans += add;\n countManju[i ] -= add;\n countManju[10 - i] -= add;\n }\n ans += countManju[5] / 2;\n countManju[5] %= 2;\n\n ans += solve(countManju);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2260,
"memory_kb": 12044,
"score_of_the_acc": -0.7584,
"final_rank": 4
},
{
"submission_id": "aoj_0246_3220358",
"code_snippet": "// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nint N;\nmap< vector<int>, int > dp;\n\nint solve(vector<int>& vec, int sum = 0, int id = 1) {\n int res = 0;\n if(sum == 10) {\n res++;\n sum = 0; id = 1;\n }\n if(dp.count(vec)) return dp[vec];\n if(sum > 10) return 0;\n\n int add = 0;\n for(int i=id; i<=9; i++) {\n if(vec[i] > 0) {\n vec[i]--; sum += i;\n chmax(add, solve(vec, sum, i));\n vec[i]++; sum -= i;\n }\n }\n res += add;\n\n if(sum == 0) dp[vec] = res;\n return res;\n}\n\nsigned main() {\n while(cin >> N, N) {\n dp.clear();\n vector<int> countManju(11);\n\n for(int i=0; i<N; i++) {\n int val; cin >> val;\n countManju[val]++;\n }\n \n int ans = 0;\n for(int i=1; i<5; i++) {\n int add = min(countManju[i], countManju[10 - i]);\n ans += add;\n countManju[i ] -= add;\n countManju[10 - i] -= add;\n }\n ans += countManju[5] / 2;\n countManju[5] %= 2;\n\n ans += solve(countManju);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 3520,
"memory_kb": 12084,
"score_of_the_acc": -1.119,
"final_rank": 7
},
{
"submission_id": "aoj_0246_3220318",
"code_snippet": "// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nint N;\nmap< vector<int>, int > dp;\n\nint solve(vector<int>& vec, int sum = 0, int id = 1) {\n int res = 0;\n if(sum == 10) {\n res++;\n sum = 0; id = 1;\n }\n if(sum == 0 and dp.count(vec)) return dp[vec];\n if(id > 9 or sum + id > 10) return 0;\n\n int add = 0;\n if(vec[id] > 0) {\n vec[id]--;\n chmax(add, solve(vec, sum + id, id));\n vec[id]++;\n }\n chmax(add, solve(vec, sum, id + 1));\n res += add;\n\n if(sum == 0) dp[vec] = res;\n return res;\n}\n\nsigned main() {\n while(cin >> N, N) {\n dp.clear();\n vector<int> countManju(11);\n\n for(int i=0; i<N; i++) {\n int val; cin >> val;\n countManju[val]++;\n }\n \n int ans = 0;\n for(int i=1; i<5; i++) {\n int add = min(countManju[i], countManju[10 - i]);\n ans += add;\n countManju[i ] -= add;\n countManju[10 - i] -= add;\n }\n ans += countManju[5] / 2;\n countManju[5] %= 2;\n\n ans += solve(countManju);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1190,
"memory_kb": 12116,
"score_of_the_acc": -0.4537,
"final_rank": 3
},
{
"submission_id": "aoj_0246_2924526",
"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\nbool check(const vector<vector<pair<int, int>>>&humans, int x, int y) {\n\tfor (int i = 0; i < 4; ++i) {\n\t\tauto it=find(humans[i].begin(),humans[i].end(),make_pair(x,y));\n\t\tif(it!=humans[i].end())return false;\n\t}\n\treturn true;\n}\nint dx[] = { -1,0,1,0,0 };\nint dy[] = { 0,1,0,-1,0 };\n\ntemplate<typename T> struct Compress {\n\tmap<T, int>mp;\n\tmap<int, T>revmp;\n\n\tCompress(vector<T>vs) {\n\t\tsetmp(vs);\n\t}\n\n\tCompress() :mp(), revmp() {\n\n\t}\n\tvoid setmp(vector<T>vs) {\n\t\tsort(vs.begin(), vs.end());\n\t\tvs.erase(unique(vs.begin(), vs.end()), vs.end());\n\t\tfor (int i = 0; i < static_cast<int>(vs.size()); ++i) {\n\t\t\tmp[vs[i]] = i;\n\t\t\trevmp[i] = vs[i];\n\t\t}\n\t}\n\n};\nstruct sale {\n\tint id;\n\tint d;\n\tint s;\n\tint e;\n};\n\nstruct aa {\n\tint flag;\n\tint x;\n\tint y;\n\tint cost;\n};\n\nbool operator <(const vector<int>&l, const vector<int>&r) {\n\tfor (int i = 0; i < l.size(); ++i) {\n\t\tif(l[i]<r[i])return true;\n\t\telse if(l[i]>r[i])return false;\n\t}\n\treturn false;\n}\nint solve(vector<int>haves, vector<int>nums) {\n\tmap<pair<vector<int>,int>,int>mp;\n\tmp[make_pair(nums,0)]=1;\n\n\tint ans=1;\n\tqueue<pair<vector<int>,int>>que;\n\tque.push(make_pair(nums,0));\n\twhile (!que.empty()) {\n\t\tauto atop(que.front());\n\t\tque.pop();\n\n\t\tint x=atop.second;\n\t\tvector<int>v(atop.first);\n\n\t\tint cost=mp[make_pair(atop.first,atop.second)];\n\t\tans=max(ans,cost);\n\t\tfor (int i = 0; i < haves.size(); ++i) {\n\t\t\tif (v[i]){\n\t\t\t\tif (x+haves[i] >= 11) {\n\n\t\t\t\t}\n\t\t\t\telse if (x + haves[i] == 10) {\n\t\t\t\t\tv[i]--;\n\t\t\t\t\tauto np=make_pair(v,0);\n\t\t\t\t\tif (mp[np] < cost + 1) {\n\t\t\t\t\t\tmp[np]=cost+1;\n\t\t\t\t\t\tque.push(np);\n\t\t\t\t\t}\n\t\t\t\t\tv[i]++;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tv[i]--;\n\t\t\t\t\tauto np=make_pair(v,x+haves[i]);\n\t\t\t\t\tif (mp[np] < cost) {\n\t\t\t\t\t\tmp[np]=cost;\n\t\t\t\t\t\tque.push(np);\n\t\t\t\t\t}\n\t\t\t\t\tv[i]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn ans-1;\n}\n\nint main()\n{\n\twhile (true) {\n\t\tint N;cin>>N;\n\t\tif(N==0)break;\n\t\tvector<int>vs(10);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint a;cin>>a;\n\t\t\tvs[a]++;\n\n\t\t}\n\t\tint ans=0;\n\t\tfor (int i = 6; i <= 9; ++i) {\n\t\t\tint x=min(vs[i],vs[10-i]);\n\t\t\tvs[i]-=x;\n\t\t\tvs[10-i]-=x;\n\t\t\tans+=x;\n\t\t}\n\t\t{\n\t\t\tint x=vs[5]/2;\n\t\t\tvs[5]-=2*x;\n\t\t\tans+=x;\n\t\t}\n\t\tvector<int>haves;\n\t\tvector<int>nums;\n\t\tfor (int i = 1; i <= 9; ++i) {\n\t\t\tif (vs[i]) {\n\t\t\t\thaves.push_back(i);\n\t\t\t\tnums.push_back(vs[i]);\n\t\t\t}\n\t\t}\n\t\tans+=solve(haves,nums);\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 2980,
"memory_kb": 60276,
"score_of_the_acc": -1.6291,
"final_rank": 12
},
{
"submission_id": "aoj_0246_2518073",
"code_snippet": "#include<bits/stdc++.h>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) for(int i = 0; i < (b); i++)\n#define all(a) (a).begin(), (a).end()\n#define show(x) cerr << #x << \" = \" << (x) << endl;\n//const int INF = 1e8;\nusing namespace std;\n\nint main(){\n int n;\n while(cin >> n,n){\n int a[205];\n rep(i,n) cin >> a[i];\n sort(a,a + n,greater<int>());\n\n int ans = 0, f = true;\n map<pair<int, int>, int> pre;\n rep(i,n){\n rep(j,n){\n pre[make_pair(i,j)] = -1;\n }\n }\n\n int num = 2;\n while(f){\n f = false;\n bool dp[11][11] = {{0}};\n dp[0][0] = true;\n rep(i,n){\n if(a[i] == 0) continue;\n for(int k = num; k >= 0; k--){\n if(a[i] == 0) continue;\n for(int j = 10; j >= 0; j--){\n if(j - a[i] < 0) continue;\n if(not dp[j][k + 1] && dp[j - a[i]][k]){\n //cout << i << ' ' << j << endl;\n dp[j][k + 1] = true;\n pre[make_pair(j,k + 1)] = i;\n //cout << j << ' ' << k + 1 << ' ' << i << endl;\n }\n }\n }\n }\n //cin >> n;\n if(dp[10][num]){\n f = true;\n ans++;\n int sum = 10, k = num;\n while(sum != 0){\n int prev = pre[make_pair(sum,k)];\n //cout << prev.first << ' ' << prev.second << endl;\n sum -= a[prev];\n a[prev] = 0;\n k--;\n //show(sum)\n }\n }\n if(not f && num < 10){\n num++;\n f = true;\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 0.375,
"time_ms": 40,
"memory_kb": 3752,
"score_of_the_acc": -0.0098,
"final_rank": 15
}
] |
aoj_0253_cpp
|
アリの巣箱の形状
求悟君は夏休みの自由研究としてアリの巣の観察を行うことにしました。彼のおじいちゃんが孫のために用意してくれた観察用の透明ケースはとてもユニークで、図1のような形をしています。
図１
このケースは、2枚の合同な凸多角形 s1、s2 と何枚かの長方形で構成されています。s1、s2 以外のいずれかの長方形の面を床に接するように置きます。観察を始めた求悟君は、入っている土の量が同じにもかかわらず、底面の選び方によって土の高さが変わることに気付きました（図2）。
図２
求悟君は、ケースの置き方によって、どのくらい高くなるか知りたくなりました。凸多角形 s1 の形、s1 と s2 間の距離
d
、土の体積
V
を入力とし、土の高さの最大値を出力するプログラムを作成してください。土は、ケースの底面を床に置くとすぐに水平になるものとします。透明ケースの s1 の形は、二次元の座標平面上の
n
個の頂点で与えられます。これらの頂点は、反時計回りの順番で入力されます。
n
は 3 以上 100 以下で、
d
と
V
はそれぞれ 1 以上 10,000 以下の整数とします。また、多角形の頂点の座標
(x, y)
の
x
、
y
はそれぞれ -1,000 以上 1,000 以下の整数とします。
V
はケースの体積を超えません。
入力
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロみっつの行で示されます。各データセットは以下のとおりです。
1 行目
n
d
V
（整数 整数 整数；半角空白区切り）
2 行目 第 1 の頂点の座標
x
y
（整数 整数；半角空白区切り）
3 行目 第 2 の頂点の座標
:
n+1
行目 第
n
の頂点の座標
データセットの数は 20 を超えません。
出力
入力データセットごとに、土の高さの最大値を出力します。答えには 0.00001 を越える誤差があってはいけません。
入力例
4 1 1
0 0
1 0
1 2
0 2
0 0 0
出力例
1.000000
|
[
{
"submission_id": "aoj_0253_4782435",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\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\t\treturn x != p.x? x < p.x: y < p.y;\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 \tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\nint N;\ndouble D,V;\ndouble NUM = 10000;\ndouble RAD[105];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\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\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\ndouble calc_slope(Line A){\n\n\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\n\n\t\treturn 0;\n\n\t}else{\n\n\t\treturn (A.p[0].y-A.p[1].y)/(A.p[0].x-A.p[1].x);\n\t}\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\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\n//交点を求める関数\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_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\ndouble calc_S(Polygon g){\n\n\tint N = g.size();\n\tdouble ret = 0;\n\n\tfor(int i = 0; i < g.size(); i++){\n\t\tret += cross(g[i],g[(i+1)%N]);\n\t}\n\treturn ret/2.0;\n}\n\ndouble calc_bottomS(Polygon P,Line line){\n\n\tint count = 0;\n\tint N = P.size();\n\n\tint index_1 = -1,index_2;\n\tPoint cross1,cross2;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tLine tmp_line = Line(P[i],P[(i+1)%N]);\n\t\tif(is_Cross(tmp_line,line)){\n\t\t\tcount++;\n\t\t\tif(index_1 == -1){\n\n\t\t\t\tindex_1 = i;\n\t\t\t\tcross1 = calc_Cross_Point(tmp_line,line);\n\n\t\t\t}else{\n\n\t\t\t\tindex_2 = i;\n\t\t\t\tcross2 =calc_Cross_Point(tmp_line,line);\n\t\t\t}\n\t\t}\n\t}\n\n\tif(count <= 1)return 0;\n\n\tPolygon A;\n\tfor(int i = 0; i <= index_1; i++){\n\n\t\tA.push_back(P[i]);\n\t}\n\tA.push_back(cross1);\n\tA.push_back(cross2);\n\n\tfor(int i = index_2+1; i < N; i++){\n\n\t\tA.push_back(P[i]);\n\t}\n\n\treturn calc_S(A);\n}\n\nvoid func(){\n\n\tPolygon P;\n\n\tdouble x,y;\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&x,&y);\n\n\t\tP.push_back(Point(x,y));\n\t}\n\n\tfor(int i = 0; i <= N-1; i++){\n\n\t\tVector vec1 = P[(i-1+N)%N]-P[i];\n\t\tVector vec2 = P[(i+1)%N]-P[i];\n\n\t\tRAD[i] = M_PI-acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n\t}\n\n\tdouble ans = 0;\n\n\tPolygon work;\n\n\tfor(int i = 0; i <= N-1; i++){\n\n\t\tdouble tmp_dist = calc_dist(P[i],P[(i+1)%N]);\n\t\twork.clear();\n\n\t\twork.push_back(Point(0,0)); //P[i]を(0,0)、P[(i+1)%N]を(tmp_dist,0)にする\n\t\twork.push_back(Point(tmp_dist,0));\n\n\t\tPoint pre = work[1];\n\t\tdouble rad = 0;\n\n\t\tdouble L = 0,R = 0;\n\n\t\tfor(int k = 0; k < N-2; k++){\n\n\t\t\tdouble tmp_dist = calc_dist(P[(i+1+k)%N],P[(i+2+k)%N]);\n\n\t\t\trad += RAD[(i+1+k)%N];\n\n\t\t\tVector tmp = Vector(tmp_dist*cos(rad),tmp_dist*sin(rad));\n\n\t\t\tPoint next = pre+tmp;\n\n\t\t\tL = min(L,next.y);\n\t\t\tR = max(R,next.y);\n\n\t\t\twork.push_back(next);\n\t\t\tpre = next;\n\t\t}\n\n\t\tfor(int loop = 0; loop < 100; loop++){\n\n\t\t\tdouble mid1 = (2.0*L+R)/3.0;\n\t\t\tdouble mid2 = (1.0*L+2.0*R)/3.0;\n\n\t\t\tLine tmp_line1 = Line(Point(-NUM,mid1),Point(NUM,mid1));\n\t\t\tLine tmp_line2 = Line(Point(-NUM,mid2),Point(NUM,mid2));\n\n\t\t\tdouble V1 = calc_bottomS(work,tmp_line1)*D;\n\t\t\tdouble V2 = calc_bottomS(work,tmp_line2)*D;\n\n\t\t\tif(fabs(V-V1) < fabs(V-V2)){\n\n\t\t\t\tR = mid2;\n\n\t\t\t}else{\n\n\t\t\t\tL = mid1;\n\t\t\t}\n\t\t}\n\t\tans = max(ans,(L+R)/2);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %lf %lf\",&N,&D,&V);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3612,
"score_of_the_acc": -1.134,
"final_rank": 18
},
{
"submission_id": "aoj_0253_4782425",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\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\t\treturn x != p.x? x < p.x: y < p.y;\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 \tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\nint N;\ndouble D,V;\ndouble NUM = 10000;\ndouble RAD[105];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\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\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\ndouble calc_slope(Line A){\n\n\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\n\n\t\treturn 0;\n\n\t}else{\n\n\t\treturn (A.p[0].y-A.p[1].y)/(A.p[0].x-A.p[1].x);\n\t}\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\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\n//交点を求める関数\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_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\ndouble calc_S(Polygon g){\n\n\tint N = g.size();\n\tdouble ret = 0;\n\n\tfor(int i = 0; i < g.size(); i++){\n\t\tret += cross(g[i],g[(i+1)%N]);\n\t}\n\treturn ret/2.0;\n}\n\ndouble calc_bottomS(Polygon P,Line line){\n\n\tint count = 0;\n\tint N = P.size();\n\n\tint index_1 = -1,index_2;\n\tPoint cross1,cross2;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tLine tmp_line = Line(P[i],P[(i+1)%N]);\n\t\tif(is_Cross(tmp_line,line)){\n\t\t\t//printf(\"線%dで交差\\n\",i);\n\t\t\tcount++;\n\t\t\tif(index_1 == -1){\n\n\t\t\t\tindex_1 = i;\n\t\t\t\tcross1 = calc_Cross_Point(tmp_line,line);\n\t\t\t\t//cross1.debug();\n\n\t\t\t}else{\n\n\t\t\t\tindex_2 = i;\n\t\t\t\tcross2 =calc_Cross_Point(tmp_line,line);\n\t\t\t\t//cross2.debug();\n\t\t\t}\n\t\t}\n\t}\n\n\tif(count <= 1)return 0;\n\n\tPolygon A;\n\tfor(int i = 0; i <= index_1; i++){\n\n\t\tA.push_back(P[i]);\n\t}\n\tA.push_back(cross1);\n\tA.push_back(cross2);\n\n\tfor(int i = index_2+1; i < N; i++){\n\n\t\tA.push_back(P[i]);\n\t}\n\n\treturn calc_S(A);\n}\n\nvoid func(){\n\n\tPolygon P;\n\n\tdouble x,y;\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&x,&y);\n\n\t\tP.push_back(Point(x,y));\n\t}\n\n\tfor(int i = 0; i <= N-1; i++){\n\n\t\tVector vec1 = P[(i-1+N)%N]-P[i];\n\t\tVector vec2 = P[(i+1)%N]-P[i];\n\n\t\tRAD[i] = M_PI-acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n\t\t//printf(\"RAD[%d]:%.3lf\\n\",i,RAD[i]);\n\t}\n\n\tdouble ans = 0;\n\n\tPolygon work;\n\n\tfor(int i = 0; i <= N-1; i++){\n\t//for(int i = 1; i <= 1; i++){\n\n\t\t//printf(\"\\n\\n★★★i:%d\\n\",i);\n\n\t\tdouble tmp_dist = calc_dist(P[i],P[(i+1)%N]);\n\t\twork.clear();\n\n\t\twork.push_back(Point(0,0)); //P[i]を(0,0)、P[(i+1)%N]を(tmp_dist,0)にする\n\t\twork.push_back(Point(tmp_dist,0));\n\n\t\tPoint pre = work[1];\n\t\tdouble rad = 0;\n\n\t\tdouble L = 0,R = 0;\n\n\t\tfor(int k = 0; k < N-2; k++){\n\n\t\t\tdouble tmp_dist = calc_dist(P[(i+1+k)%N],P[(i+2+k)%N]);\n\t\t\t//printf(\"k:%d tmp_dist:%.3lf\\n\",k,tmp_dist);\n\n\t\t\trad += RAD[(i+1+k)%N];\n\t\t\t//printf(\"rad:%.3lf\\n\",rad);\n\t\t\tVector tmp = Vector(tmp_dist*cos(rad),tmp_dist*sin(rad));\n\n\t\t\t//printf(\"cos:%.3lf sin:%.3lf\\n\",tmp_dist*cos(rad),tmp_dist*sin(rad));\n\n\t\t\tPoint next = pre+tmp;\n\n\t\t\tL = min(L,next.y);\n\t\t\tR = max(R,next.y);\n\n\t\t\twork.push_back(next);\n\t\t\tpre = next;\n\t\t}\n\n\t/*\tprintf(\"\\nwork\");\n\t\tfor(int a = 0; a < work.size(); a++){\n\n\t\t\twork[a].debug();\n\t\t}\n\n\n\t\tprintf(\"\\nL:%.3lf R:%.3lf\\n\",L,R);*/\n\n\t\t//Line dog = Line(Point(-NUM,1.0),Point(NUM,1.0));\n\t\t//printf(\"想定開 %.3lf\\n\",calc_bottomS(work,dog));\n\n\t\t//continue;\n\n\t\tfor(int loop = 0; loop < 100; loop++){\n\n\t\t\tdouble mid1 = (2.0*L+R)/3.0;\n\t\t\tdouble mid2 = (1.0*L+2.0*R)/3.0;\n\n\t\t\tLine tmp_line1 = Line(Point(-NUM,mid1),Point(NUM,mid1));\n\t\t\tLine tmp_line2 = Line(Point(-NUM,mid2),Point(NUM,mid2));\n\n\t\t\tdouble V1 = calc_bottomS(work,tmp_line1)*D;\n\t\t\tdouble V2 = calc_bottomS(work,tmp_line2)*D;\n\n\t\t\tif(fabs(V-V1) < fabs(V-V2)){\n\n\t\t\t\tR = mid2;\n\n\t\t\t}else{\n\n\t\t\t\tL = mid1;\n\t\t\t}\n\t\t}\n\t\t//printf(\"L:%.3lf R:%.3lf\\n\",L,R);\n\t\tans = max(ans,(L+R)/2);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %lf %lf\",&N,&D,&V);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3640,
"score_of_the_acc": -1.1456,
"final_rank": 19
},
{
"submission_id": "aoj_0253_4475491",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nusing real = double;\nstatic constexpr real EPS = 1e-10;\nstruct Point {\n real x, y;\n Point& operator+=(const Point a) { x += a.x; y += a.y; return *this; }\n Point& operator-=(const Point a) { x -= a.x; y -= a.y; return *this; }\n Point& operator*=(const real k) { x *= k; y *= k; return *this; }\n Point& operator/=(const real k) { x /= k; y /= k; return *this; }\n Point operator+(const Point a) const {return Point(*this) += a; }\n Point operator-(const Point a) const {return Point(*this) -= a; }\n Point operator*(const real k) const {return Point(*this) *= k; }\n Point operator/(const real k) const {return Point(*this) /= k; }\n bool operator<(const Point &a) const { return (x != a.x ? x < a.x : y < a.y); }\n explicit Point(real a = 0, real b = 0) : x(a), y(b) {};\n};\n\nbool sorty(Point a, Point b){\n return (a.y != b.y ? a.y < b.y : a.x < b.x);\n}\n\nistream& operator>> (istream& s, Point& P){\n s >> P.x >> P.y;\n return s;\n}\n\ninline real dot(Point a, Point b){ return a.x*b.x + a.y*b.y; }\ninline real cross(Point a, Point b){ return a.x*b.y - a.y*b.x; }\ninline real abs(Point a){ return sqrt(dot(a, a)); }\n\n\nreal angle(Point A, Point B){\n return acos(dot(A, B)/abs(A)/abs(B));\n}\n\n\n\nstatic constexpr int COUNTER_CLOCKWISE = 1;\nstatic constexpr int CLOCKWISE = -1;\nstatic constexpr int ONLINE_BACK = 2;\nstatic constexpr int ONLINE_FRONT = -2;\nstatic constexpr int ON_SEGMENT = 0;\n\nint ccw(Point a, Point b, Point c){\n b -= a; c -= a;\n if(cross(b, c) > EPS) return COUNTER_CLOCKWISE;\n if(cross(b, c) < -EPS) return CLOCKWISE;\n if(dot(b, c) < 0) return ONLINE_BACK;\n if(abs(b) < abs(c)) return ONLINE_FRONT;\n return ON_SEGMENT;\n}\nstruct Segment {\n Point a, b;\n Segment(Point x, Point y) : a(x), b(y) {};\n};\n\nstruct Line {\n Point a, b;\n Line(Point x, Point y) : a(x), b(y) {};\n};\n\nstruct Circle{\n Point c; real r;\n Circle(Point c, real r): c(c), r(r) {};\n};\n\nusing Polygon = vector<Point>;\n\nbool intersect(Segment s, 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\nbool intersect(Segment s, Line t){\n int a = ccw(t.a, t.b, s.a), b = ccw(t.a, t.b, s.b);\n return (!(a&1) || !(b&1) || a != b);\n}\n\nPoint polar(double r, double t){\n return Point(r*cos(t), r*sin(t));\n}\n\ndouble arg(Point p){\n return atan2(p.y, p.x);\n}\n\nstatic constexpr int CONTAIN = 0;\nstatic constexpr int INSCRIBE = 1;\nstatic constexpr int INTERSECT = 2;\nstatic constexpr int CIRCUMSCRIBED = 3;\nstatic constexpr int SEPARATE = 4;\n\nint intersect(Circle c1, Circle c2){\n if(c1.r < c2.r) swap(c1, c2);\n real d = abs(c1.c-c2.c);\n real r = c1.r + c2.r;\n if(fabs(d-r) < EPS) return CIRCUMSCRIBED;\n if(d > r) return SEPARATE;\n if(fabs(d+c2.r-c1.r) < EPS) return INSCRIBE;\n if(d+c2.r < c1.r) return CONTAIN;\n return INTERSECT;\n}\n\nreal distance(Line l, Point c){\n return abs(cross(l.b-l.a, c-l.a)/abs(l.b-l.a));\n}\n\n\nreal distance(Segment s, Point c){\n if(dot(s.b-s.a, c-s.a) < EPS) return abs(c-s.a);\n if(dot(s.a-s.b, c-s.b) < EPS) return abs(c-s.b);\n return abs(cross(s.b-s.a, c-s.a)) / abs(s.a-s.b);\n}\n\nreal distance(Segment s, Segment t){\n if(intersect(s, t)) return 0.0;\n return min({distance(s, t.a), distance(s, t.b),\n distance(t, s.a), distance(t, s.b)});\n}\n\n\nPoint project(Line l, Point p){\n Point Q = l.b-l.a;\n return l.a + Q*(dot(p-l.a, Q) / dot(Q, Q));\n}\n\n\nPoint project(Segment s, Point p){\n Point Q = s.b-s.a;\n return s.a + Q*(dot(p-s.a, Q) / dot(Q, Q));\n}\n\nPoint refrect(Segment s, Point p){\n Point Q = project(s, p);\n return Q*2-p;\n}\n\nbool isOrthogonal(Segment s, Segment t){\n return fabs(dot(s.b-s.a, t.b-t.a)) < EPS;\n}\n\nbool isparallel(Segment s, Segment t){\n return fabs(cross(s.b-s.a, t.b-t.a)) < EPS;\n}\n\n\nPoint crossPoint(Segment s, Segment t){\n real d1 = cross(s.b-s.a, t.b-t.a);\n real d2 = cross(s.b-s.a, s.b-t.a);\n if(fabs(d1) < EPS && fabs(d2) < EPS) return t.a;\n return t.a+(t.b-t.a)*d2/d1;\n}\n\nPoint crossPoint(Line s, Line t){\n real d1 = cross(s.b-s.a, t.b-t.a);\n real d2 = cross(s.b-s.a, s.b-t.a);\n if(fabs(d1) < EPS && fabs(d2) < EPS) return t.a;\n return t.a+(t.b-t.a)*d2/d1;\n}\n\nPolygon crossPoint(Circle c, Line l){\n Point p = project(l, c.c), q = (l.b-l.a)/abs(l.b-l.a);\n if(abs(distance(l, c.c)-c.r) < EPS){\n return {p};\n }\n double k = sqrt(c.r*c.r-dot(p-c.c, p-c.c));\n return {p-q*k, p+q*k};\n}\n\nPolygon crossPoint(Circle c, Segment s){\n auto tmp = crossPoint(c, Line(s.a, s.b));\n Polygon ret;\n for (auto &&i : tmp) {\n if(distance(s, i) < EPS) ret.emplace_back(i);\n }\n return ret;\n}\n\n\nPolygon crossPoint(Circle c1, Circle 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 {c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a)};\n}\n\nPolygon tangent(Circle c1, Point p){\n Circle c2 = Circle(p, sqrt(dot(c1.c-p, c1.c-p)-c1.r*c1.r));\n return crossPoint(c1, c2);\n}\nvector<Line> tangent(Circle c1, Circle c2){\n vector<Line> ret;\n if(c1.r < c2.r) swap(c1, c2);\n double k = dot(c1.c-c2.c, c1.c-c2.c);\n if(abs(k) < EPS) return {};\n Point u = (c2.c-c1.c)/sqrt(k);\n Point v(-u.y, u.x);\n for (auto &&i : {-1, 1}) {\n double h = (c1.r+i*c2.r)/sqrt(k);\n if(abs(h*h-1) < EPS){\n ret.emplace_back(c1.c+u*c1.r, c1.c+(u+v)*c1.r);\n }else if(h*h < 1){\n Point u2 = u*h, v2 = v*sqrt(1-h*h);\n ret.emplace_back(c1.c+(u2+v2)*c1.r, c2.c-(u2+v2)*c2.r*i);\n ret.emplace_back(c1.c+(u2-v2)*c1.r, c2.c-(u2-v2)*c2.r*i);\n }\n }\n return ret;\n}\n\nreal area(Polygon v){\n if(v.size() < 3) return 0.0;\n real ans = 0.0;\n for (int i = 0; i < v.size(); ++i) {\n ans += cross(v[i], v[(i+1)%v.size()]);\n }\n return ans/2;\n}\n\nreal area(Circle c, Polygon &v){\n int n = v.size();\n real ans = 0.0;\n Polygon u;\n for (int i = 0; i < n; ++i) {\n u.emplace_back(v[i]);\n auto q = crossPoint(c, Segment(v[i], v[(i+1)%n]));\n for (auto &&j : q) {\n u.emplace_back(j);\n }\n }\n for (int i = 0; i < u.size(); ++i) {\n Point A = u[i]-c.c, B = u[(i+1)%u.size()]-c.c;\n if(abs(A) >= c.r+EPS || abs(B) >= c.r+EPS){\n Point C = polar(1, arg(B)-arg(A));\n ans += c.r*c.r*arg(C)/2;\n }else {\n ans += cross(A, B)/2;\n }\n }\n return ans;\n}\n\nPolygon convex_hull(Polygon v){\n int n = v.size();\n sort(v.begin(),v.end(), sorty);\n int k = 0;\n Polygon ret(n*2);\n for (int i = 0; i < n; ++i) {\n while(k > 1 && cross(ret[k-1]-ret[k-2], v[i]-ret[k-1]) < 0) k--;\n ret[k++] = v[i];\n }\n for(int i = n-2, t=k; i >= 0; i--){\n while(k > t && cross(ret[k-1]-ret[k-2], v[i]-ret[k-1]) < 0) k--;\n ret[k++] = v[i];\n }\n ret.resize(k-1);\n return ret;\n}\n\nbool isconvex(Polygon v){\n int n = v.size();\n for (int i = 0; i < n; ++i) {\n if(ccw(v[(i+n-1)%n], v[i], v[(i+1)%n]) == CLOCKWISE) return false;\n }\n return true;\n}\n\nint contains(Polygon v, Point p){\n int n = v.size();\n bool x = false;\n static constexpr int IN = 2;\n static constexpr int ON = 1;\n static constexpr int OUT = 0;\n for (int i = 0; i < n; ++i) {\n Point a = v[i]-p, b = v[(i+1)%n]-p;\n if(fabs(cross(a, b)) < EPS && dot(a, b) < EPS) return ON;\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?IN:OUT);\n}\n\nreal diameter(Polygon v){\n int n = v.size();\n if(n == 2) return abs(v[0]-v[1]);\n int i = 0, j = 0;\n for (int k = 0; k < n; ++k) {\n if(v[i] < v[k]) i = k;\n if(!(v[j] < v[k])) j = k;\n }\n real ret = 0;\n int si = i, sj = j;\n while(i != sj || j != si){\n ret = max(ret, abs(v[i]-v[j]));\n if(cross(v[(i+1)%n]-v[i], v[(j+1)%n]-v[j]) < 0.0) i = (i+1)%n;\n else j = (j+1)%n;\n }\n return ret;\n}\n\nPolygon convexCut(Polygon v, Line l){\n Polygon q;\n int n = v.size();\n for (int i = 0; i < n; ++i) {\n Point a = v[i], b = v[(i+1)%n];\n if(ccw(l.a, l.b, a) != -1) q.push_back(a);\n if(ccw(l.a, l.b, a)*ccw(l.a, l.b, b) < 0){\n q.push_back(crossPoint(Line(a, b), l));\n }\n }\n return q;\n}\n\nreal closest_pair(Polygon &v, int l = 0, int r = -1){\n if(!(~r)){\n r = v.size();\n sort(v.begin(),v.end());\n }\n if(r - l < 2) {\n return abs(v.front()-v.back());\n }\n int mid = (l+r)/2;\n real p = v[mid].x;\n real d = min(closest_pair(v, l, mid), closest_pair(v, mid, r));\n inplace_merge(v.begin()+l, v.begin()+mid, v.begin()+r, sorty);\n Polygon u;\n for (int i = l; i < r; ++i) {\n if(fabs(v[i].x-p) >= d) continue;\n for (int j = 0; j < u.size(); ++j) {\n real dy = v[i].y-next(u.rbegin(), j)->y;\n if(dy >= d) break;\n d = min(d, abs(v[i]-*next(u.rbegin(), j)));\n }\n u.emplace_back(v[i]);\n }\n return d;\n}\n\nvoid solve(int n, int d, int v){\n Polygon p(n);\n for (auto &&i : p) cin >> i;\n vector<Segment> S;\n for (int i = 0; i < n; ++i) {\n S.emplace_back(p[i], p[(i+1)%n]);\n }\n double ans = 0;\n for (int i = 0; i < n; ++i) {\n Point A(-(p[(i+1)%n]-p[i]).y, (p[(i+1)%n]-p[i]).x);\n A /= abs(A);\n double ok = 0, ng = 3000;\n for (int j = 0; j < 100; ++j) {\n double mid = (ok+ng)/2;\n Line x(p[(i+1)%n]+A*mid, p[i]+A*mid);\n int good = 0;\n for (int k = 0; k < n; ++k) {\n if(intersect(S[k], x)) good = 1;\n }\n if(!good){\n ng = mid;\n continue;\n }\n if(area(convexCut(p, x))*d <= v) ok = mid;\n else ng = mid;\n }\n ans = max(ans, ok);\n }\n printf(\"%.10lf\\n\", ans);\n}\n\n\nint main() {\n int n, d, v;\n while(cin >> n >> d >> v, n){\n solve(n, d, v);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3232,
"score_of_the_acc": -0.8228,
"final_rank": 8
},
{
"submission_id": "aoj_0253_3721674",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\n\nusing namespace std;\nusing Real = double;\nusing Point = complex<Real>;\nconst Real EPS = 1e-8, PI = acos(-1);\n\ninline bool eq(double a, double b){ return fabs(b - a) < EPS; }\n\nnamespace std{\n bool operator<(const Point &a, const Point &b){\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\nstruct Line{\n\n Point a, b;\n Line(Point a, Point b) : a(a), b(b){}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\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\nPoint rotate(double theta, const Point &p){\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if(cross(b, c) > EPS) return +1; \n if(cross(b, c) < -EPS) return -1; \n if(dot(b, c) < 0) return +2; \n if(norm(b) < norm(c)) return -2; \n return 0; \n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\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 area2(const Polygon &p) {\n Real A = 0;\n for(int i = 0; i < p.size(); ++i) {\n A += cross(p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\n\n\nsigned main(){\n \n while(1){\n int n, d, v; cin >> n >> d >> v;\n if(n == 0) break;\n\n Polygon poly(n);\n for(int i = 0; i < n; i++){\n double x, y; cin >> x >> y;\n poly[i] = Point(x, y);\n\n }\n \n //cout << area2(poly) << endl;\n\n double ans = 0.0;\n for(int i = 0; i < n; i++){\n Point a = poly[i];\n Point b = poly[(i + 1) % n];\n double theta = PI / 2.0;\n Point pp = rotate(theta, b - a);\n pp = pp / abs(pp);\n\n\n double lb = 0.0;\n double ub = 1e9;\n for(int itr = 0; itr < 100; itr++){\n\n double h = (lb + ub) / 2.0;\n Line l = Line(b + h * pp, a + h * pp);\n\n auto tmp = convex_cut(poly, l);\n double Sum = abs(area2(convex_cut(poly, l)) / 2.0);\n //cout << Sum << endl;\n if(Sum * d < v) lb = h;\n else ub = h;\n }\n\n ans = max(ans, lb);\n }\n printf(\"%.10f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3660,
"score_of_the_acc": -1,
"final_rank": 15
},
{
"submission_id": "aoj_0253_2924626",
"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\n\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\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//多角形の回転方向\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\n\nint main()\n{\n\twhile (true) {\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\t\tld D,V;cin>>D>>V;\n\t\tld S=V/D;\n\n\t\tPolygon poly(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint x,y;cin>>x>>y;\n\t\t\tpoly[i]=Point(x,y);\n\t\t}\n\n\t\tld ans=0;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tLine l(poly[i],poly[(i+1)%N]);\n\n\t\t\tLine bis=point_bisection(l.a,l.b);\n\t\t\tPoint vec(bis.b-bis.a);\n\n\t\t\tvec/=abs(vec);\n\n\t\t\tld amin=0;\n\t\t\tld amax=1e6;\n\t\t\tint num=100;\n\t\t\twhile (num--) {\n\t\t\t\tld amid(amin/2+amax/2);\n\t\t\t\tPolygon cut_poly=convex_cut(poly,Line(l.a+vec*amid,l.b+vec*amid))[1];\n\n\t\t\t\tld ar=get_area(cut_poly);\n\n\t\t\t\tif(ar<S)amin=amid;\n\t\t\t\telse amax=amid;\n\t\t\t}\n\t\t\tans=max(ans,amin);\n\t\t}\n\t\tcout<<setprecision(10)<<fixed<<ans<<endl;\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3348,
"score_of_the_acc": -1.1786,
"final_rank": 20
},
{
"submission_id": "aoj_0253_2666823",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define all(c) (c).begin(),(c).end()\n#define pb push_back\n#define dbg(...) do{cerr<<__LINE__<<\": \";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);\n\nusing namespace std;\n\nnamespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}\ntemplate<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<\"[ \";rep(i,v.size())os<<v[i]<<(i==v.size()-1?\" ]\":\", \");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<\"{ \"; for(const auto &i:v)os<<i<<\", \";return os<<\"}\";}\ntemplate<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<\"{\";for(const auto &i:v)os<<\" \"<<i.first<<\": \"<<i.second<<\",\";return os<<\"}\";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<\"(\"<<p.first<<\", \"<<p.second<<\")\";}\nvoid dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(\",\"))<<\"= \"<<h<<\" \";dbgprint(fmt.substr(fmt.find(\",\")+1),r...);}\ntypedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;\nconst double EPS = 1e-12, INF = 1e12, PI = acos(-1.0);\ntypedef complex<long double> P;\nnamespace std{\n\tbool operator<(const P& a, const P& b){\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n}\ninline long double cross(const P& a, const P& b){ return imag(conj(a)*b); }\ninline long double 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};\ntypedef vector<P> G;\ninline int ccw(P a, P b, P c) {\n\tb -= a; 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)+EPS <norm(c)) return -2; // a--b--c on line\n\treturn 0; // c is between a and b (inclusive)\n}\nP crosspoint(const L &l, const L &m) {\n\tlong double A = cross(l[1] - l[0], m[1] - m[0]);\n\tlong double 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}\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nlong double area2(const G& g) {\n\tlong double A = 0;\n\tfor (int i = 0; i < g.size(); ++i) \n\t\tA += cross(curr(g, i), next(g, i));\n\treturn A;\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}\nint main(){\n\tcin.tie(0); cin.sync_with_stdio(0);\n\tint n, d, v;\n\twhile(cin >> n >> d >> v, n){\n\t\tG g;\n\t\tlong double ans = 0;\n\t\trep(i, n){ int x, y; cin >> x >> y; g.emplace_back(x, y); }\n\t\trep(i, n){\n\t\t\tlong double lo = 0, hi = 4000, mid;\n\t\t\trep(it, 100){\n\t\t\t\tmid = (lo + hi) / 2;\n\t\t\t\tL l(g[(i + 1) % n], g[i]);\n\t\t\t\tP p = (l[0] - l[1]) * P(0, mid / abs(l[0] - l[1]));\n\t\t\t\tl[0] += p;\n\t\t\t\tl[1] += p;\n\t\t\t\tG h = convex_cut(g, l);\n\t\t\t\tif(area2(h) * d / 2 >= v - EPS) hi = mid;\n\t\t\t\telse lo = mid;\n\t\t\t}\n\t\t\tans = max(ans, lo);\n\t\t}\n\t\tprintf(\"%.20f\\n\", (double)ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3252,
"score_of_the_acc": -1.0619,
"final_rank": 17
},
{
"submission_id": "aoj_0253_2461606",
"code_snippet": "#include <bits/stdc++.h>\n#define x real()\n#define y imag()\nusing namespace std;\ntypedef complex<double> point;\n\ndouble dot(point a, point b) {\n\treturn a.x * b.x + a.y * b.y;\n}\ndouble cross(point a, point b) {\n\treturn a.x * b.y - a.y * b.x;\n}\nint ccw(point a, point b, point c) {\n\tpoint d = b - a, e = c - a;\n\tif (cross(d, e) > 0)\n\t\treturn 1; //\"COUNTER_CLOCKWISE\"\n\tif (cross(d, e) < 0)\n\t\treturn -1; //\"CLOCKWISE\"\n\tif (dot(d, e) < 0)\n\t\treturn 2; //\"ONLINE_BACK\"\n\tif (abs(d) < abs(e))\n\t\treturn -2; //\"ONLINE_FRONT\"\n\treturn 0; //\"ON_SEGMENT\"\n}\n\npoint crosspoint(point a, point b, point c, point d) {\n\ta -= d;\n\tb -= d;\n\tc -= d;\n\treturn d + a + (b - a) * imag(a / c) / imag(a / c - b / c);\n}\n\nvector<point> ConvexCut(vector<point> &polygon, point a, point b) {\n\tvector<point> res;\n\tfor (int i = 0; i < polygon.size(); i++) {\n\t\tpoint A = polygon[i], B = polygon[(i + 1) % polygon.size()];\n\t\tif (ccw(a, b, A) != -1)\n\t\t\tres.push_back(A);\n\t\tif (ccw(a, b, A) * ccw(a, b, B) == -1)\n\t\t\tres.push_back(crosspoint(a, b, A, B));\n\t}\n\treturn res;\n}\n\ndouble get_area(vector<point> polygon) {\n\tif (polygon.size() < 3)\n\t\treturn 0;\n\tdouble res = 0;\n\tfor (int i = 0; i < polygon.size(); i++)\n\t\tres += cross(polygon[i], polygon[(i + 1) % polygon.size()]) / 2;\n\treturn res;\n}\n\nint main() {\n\twhile (1) {\n\t\tint n, d;\n\t\tdouble V;\n\t\tvector<point> pl;\n\t\tcin >> n >> d >> V;\n\t\tif (!n && !d && !V)\n\t\t\tbreak;\n\t\tfor (int i = 0, a, b; i < n; i++)\n\t\t\tcin >> a >> b, pl.push_back(point(a, b));\n\t\tV = min(get_area(pl) * d, V);\n\n\t\tdouble ans = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdouble L = 0, M, R = 2010;\n\t\t\tint I = 100;\n\t\t\twhile (I--) {\n\t\t\t\tM = (L + R) / 2;\n\t\t\t\tpoint h = pl[(i + 1) % n] - pl[i], b = h;\n\t\t\t\th = (point(0, M) * h / abs(h)) + pl[i];\n\t\t\t\tvector<point> a = ConvexCut(pl, h + b, h);\n\t\t\t\tif (get_area(a) * d >= V)\n\t\t\t\t\tR = M;\n\t\t\t\telse\n\t\t\t\t\tL = M + 0.00000001;\n\t\t\t}\n\t\t\tans = max(ans, L);\n\t\t}\n\t\tprintf(\"%.8f\\n\", ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3268,
"score_of_the_acc": -0.8377,
"final_rank": 9
},
{
"submission_id": "aoj_0253_1884449",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef complex<double> point;\ntypedef pair<point,point> line;\nconst double EPS=1e-8;\n\n//テ・ツ??ァツゥツ?\ndouble dot(point a,point b){\n return real(conj(a)*b);\n}\n\n//テ・ツ、ツ姪ァツゥツ?\ndouble cross(point a,point b){\n return imag(conj(a)*b);\n}\n\nint ccw(point a,point b,point c){\n point d=b-a;\n point e=c-a;\n if(cross(d,e)>0)return 1;//テ・ツキツヲテ・ツ?エ\n if(cross(d,e)<0)return -1;//テ・ツ渉ウテ・ツ?エ\n if(dot(d,e)<0)return 2;//onlineback\n if(abs(d)<abs(e))return -2;//onlinefront\n return 0;//onsegment\n}\n\npoint crosspoint_ll(line l1, line l2){\n double a=cross(l1.second-l1.first,l2.second-l2.first);\n double b=cross(l1.second-l1.first,l1.second-l2.first);\n if(fabs(a)<EPS&&fabs(b)<EPS)return l2.first;\n else if(fabs(a)>=EPS) return l2.first+b/a*(l2.second-l2.first);\n}\n\nvector<point> Convex_Cut(vector<point> polygon,line l){\n vector<point> res;\n for(int i=0;i<polygon.size();i++){\n point a=polygon[i],b=polygon[(i+1)%polygon.size()];\n if(ccw(l.first,l.second,a)!=-1)res.push_back(a);\n if(ccw(l.first,l.second,a)*ccw(l.first,l.second,b)<0)\n res.push_back(crosspoint_ll(line(a,b),l));\n }\n return res;\n}\n\ndouble get_area(vector<point> polygon){\n double res=0;\n for(int i=0;i<polygon.size();i++)\n res+=cross(polygon[i],polygon[(i+1)%polygon.size()]);\n return res/2;\n}\n\nint n,d,V,x,y;\n\ndouble bynary_search(vector<point> polygon,point a,point b){\n b-=a;\n for(int i=0;i<n;i++)\n polygon[i]-=a,polygon[i]=polygon[i]*conj(b)/abs(b);\n double l=0,r=(1e9),m;\n while(l+EPS<r){\n m=(l+r)/2;\n point A=point(abs(b),m),B=point(0,m);\n if(get_area(Convex_Cut(polygon,line(A,B)))*d<V)l=m+EPS;\n else r=m;\n }\n return l;\n}\n\nint main(){\n vector<point> polygon;\n while(1){\n double ans=0;\n cin>>n>>d>>V;\n if(!n&&!d&&!V)break;\n for(int i=0;i<n;i++)\n cin>>x>>y,polygon.push_back(point(x,y));\n for(int i=0;i<n;i++){\n point a=polygon[i],b=polygon[(i+1)%n];\n ans=max(ans,bynary_search(polygon,a,b));\n }\n printf(\"%.9f\\n\",ans);\n polygon.clear();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1248,
"score_of_the_acc": -0.0017,
"final_rank": 1
},
{
"submission_id": "aoj_0253_1852696",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define EPS 1e-9\n \nstruct Point {\n double x, y;\n Point() {}\n Point(double x, double y) : x(x), y(y){}\n \n Point operator + (const Point &p) const {\n return Point(x + p.x, y + p.y);\n }\n \n Point operator - (const Point &p) const {\n return Point(x - p.x, y - p.y);\n }\n \n Point operator * (const double k) const {\n return Point(x * k, y * k);\n }\n \n Point operator / (const double k) const {\n return Point(x / k, y / k);\n }\n};\n \ntypedef Point Vector;\n \ndouble dot(const Point &a, const Point &b)\n{\n return a.x * b.x + a.y * b.y;\n}\n \ndouble cross(const Point &a, const Point &b)\n{\n return a.x * b.y - b.x * a.y;\n}\n \ndouble norm(const Point &p)\n{\n return dot(p, p);\n}\n \ndouble abs(const Point &p)\n{\n return sqrt(norm(p));\n}\n \nstruct Line {\n Point s, t;\n Line(){}\n Line(Point s, Point t) : s(s), t(t) {}\n};\n \nvector<Vector> normal_line_vector(const Line &l)\n{\n vector<Vector> vs;\n Vector v = l.t - l.s, p = v / abs(v);\n vs.push_back(Point(-p.y, p.x));\n vs.push_back(Point(p.y, p.x));\n return vs;\n}\n \nvector<Line> translation(const Line &l, double d)\n{\n vector<Vector> nlv = normal_line_vector(l);\n vector<Line> nl;\n nl.push_back(Line(l.t + nlv[0] * d, l.s + nlv[0] * d));\n nl.push_back(Line(l.t + nlv[1] * d, l.s + nlv[1] * d));\n return nl;\n}\n \nint ccw(const Point &p0, const Point &p1, const Point &p2)\n{\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}\n \nPoint crosspointLL(const Line &a, const Line &b)\n{\n Vector va = a.t - a.s, vb = b.t - b.s;\n double d = cross(vb, va);\n if (abs(d) < EPS) return b.s;\n return a.s + va * cross(vb, b.t - a.s) * (1.0 / d);\n}\n \ntypedef vector<Point> Polygon;\n#define curr(G, i) (G[i%G.size()])\n#define next(G, i) (G[(i+1)%G.size()])\n \nPolygon convex_cut(const Polygon &pg, const Line &l)\n{\n Polygon res;\n for (int i = 0; i < (int)pg.size(); i++) {\n Point cp = curr(pg,i), np = next(pg,i);\n if(ccw(l.s, l.t, cp) != -1) res.push_back(cp);\n if(ccw(l.s, l.t, cp) * ccw(l.s, l.t, np) < 0){\n res.push_back(crosspointLL(Line(cp, np), l));\n }\n }\n return res;\n}\n \ndouble area(const Polygon &pg)\n{\n double res = 0;\n for (int i = 0; i < (int)pg.size(); i++) {\n res += cross(pg[i], next(pg, i));\n }\n return abs(res) / 2.0;\n}\n \ndouble calc(Polygon &pg, double d, Line &l, double V)\n{\n double lb = 0, ub = 25252;\n for (int i = 0; i < 150; i++) {\n double h = (lb + ub) / 2;\n vector<Line> vl = translation(l, h);\n Line nl = (ccw(l.s, l.t, vl[0].s) == 1 ? vl[0] : vl[1]); \n Polygon npg = convex_cut(pg, nl);\n double v = d * area(npg);\n if (v < V) {\n lb = h;\n } else {\n ub = h;\n }\n }\n return lb;\n}\n \ndouble solve(Polygon &pg, double d, double V)\n{\n int n = pg.size();\n double max_height = 0;\n for (int i = 0; i < n; i++) {\n Line l(curr(pg, i), next(pg, i));\n max_height = max(max_height, calc(pg, d, l, V));\n }\n return max_height;\n}\n \nint main()\n{\n int n;\n double d, V;\n while (cin >> n >> d >> V, n) {\n Polygon pg(n);\n for (int i = 0; i < n; i++) {\n cin >> pg[i].x >> pg[i].y;\n }\n printf(\"%.10f\\n\", solve(pg, d, V));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3216,
"score_of_the_acc": -0.8162,
"final_rank": 7
},
{
"submission_id": "aoj_0253_1827719",
"code_snippet": "#include <bits/stdc++.h>\n#define x real()\n#define y imag()\nusing namespace std;\ntypedef complex<double> point;\n\ndouble dot(point a,point b){return a.x*b.x+a.y*b.y;}\ndouble cross(point a,point b){return a.x*b.y-a.y*b.x;}\nint ccw(point a,point b,point c){\n point d = b-a,e = c-a;\n if(cross(d,e)>0) return 1;//\"COUNTER_CLOCKWISE\"\n if(cross(d,e)<0) return -1;//\"CLOCKWISE\"\n if(dot(d,e)<0) return 2;//\"ONLINE_BACK\"\n if(abs(d) < abs(e)) return -2;//\"ONLINE_FRONT\"\n return 0;//\"ON_SEGMENT\"\n}\n\npoint crosspoint(point a,point b,point c,point d){\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n\nvector<point> ConvexCut(vector<point> &polygon,point a,point b){\n vector <point> res;\n for(int i=0;i<polygon.size();i++){\n point A=polygon[i],B=polygon[(i+1)%polygon.size()];\n if(ccw(a,b,A)!=-1)res.push_back(A);\n if(ccw(a,b,A)*ccw(a,b,B)==-1)res.push_back(crosspoint(a,b,A,B));\n }\n return res;\n}\n\ndouble get_area(vector <point> &polygon){\n if(polygon.size()<3)return 0;\n double res=0;\n for(int i=0;i<polygon.size();i++)\n res+=cross(polygon[i],polygon[(i+1)%polygon.size()])/2;\n return res;\n}\n\nint main(){\n while(1){\n int n,d;\n double V;\n vector <point> pl;\n cin>>n>>d>>V;\n if(!n&&!d&&!V) break;\n for(int i=0,a,b;i<n;i++) cin>>a>>b,pl.push_back(point(a,b));\n V=min(get_area(pl)*d,V);\n\n double ans=0;\n for(int i=0;i<n;i++){\n double L=0,M,R=2010;\n int I=100;\n while(I--){\n\tM=(L+R)/2;\n\tpoint h=pl[(i+1)%n]-pl[i],b=h;\n\th=(point(0,M)*h/abs(h))+pl[i];\n\tvector<point> a=ConvexCut(pl,h+b,h);\n\tif(get_area(a)*d>=V)R=M;\n\telse L=M+0.00000001;\n }\n ans=max(ans,L);\n }\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1276,
"score_of_the_acc": -0.0132,
"final_rank": 2
},
{
"submission_id": "aoj_0253_1827687",
"code_snippet": "#include <bits/stdc++.h>\n#define x real()\n#define y imag()\nusing namespace std;\ntypedef complex<double> point;\n\ndouble dot(point a,point b){return a.x*b.x+a.y*b.y;}\ndouble cross(point a,point b){return a.x*b.y-a.y*b.x;}\nint ccw(point a,point b,point c){\n point d = b-a,e = c-a;\n if(cross(d,e)>0) return 1;//\"COUNTER_CLOCKWISE\"\n if(cross(d,e)<0) return -1;//\"CLOCKWISE\"\n if(dot(d,e)<0) return 2;//\"ONLINE_BACK\"\n if(abs(d) < abs(e)) return -2;//\"ONLINE_FRONT\"\n return 0;//\"ON_SEGMENT\"\n}\n\npoint crosspoint(point a,point b,point c,point d){\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n\nvector<point> ConvexCut(vector<point> &polygon,point a,point b){\n vector <point> res;\n for(int i=0;i<polygon.size();i++){\n point A=polygon[i],B=polygon[(i+1)%polygon.size()];\n if(ccw(a,b,A)!=-1)res.push_back(A);\n if(ccw(a,b,A)*ccw(a,b,B)==-1)res.push_back(crosspoint(a,b,A,B));\n }\n return res;\n}\n\ndouble get_area(vector <point> &polygon){\n if(polygon.size()<3)return 0;\n double res=0;\n for(int i=0;i<polygon.size();i++)\n res+=cross(polygon[i],polygon[(i+1)%polygon.size()])/2;\n return res;\n}\n\nint main(){\n while(1){\n int v,n,d;\n vector <point> pl;\n cin>>n>>d>>v;\n if(!n&&!d&&!v) break;\n for(int i=0,a,b;i<n;i++) cin>>a>>b,pl.push_back(point(a,b));\n double V=min(get_area(pl)*d,(double)v),ans=0;\n \n for(int i=0;i<n;i++){\n double L=0,M,R=2010;\n int I=1000;\n while(I--){\n\tM=(L+R)/2;\n\tpoint h=pl[(i+1)%n]-pl[i],b=h;\n\th=(point(0,M)*h/abs(h))+pl[i];\n\tvector<point> a=ConvexCut(pl,h+b,h);\n\tif(get_area(a)*d>=V)R=M;\n\telse L=M+0.000000001;\n }\n ans=max(ans,L);\n }\n printf(\"%f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 1244,
"score_of_the_acc": -0.9231,
"final_rank": 11
},
{
"submission_id": "aoj_0253_1827683",
"code_snippet": "#include <bits/stdc++.h>\n#define x real()\n#define y imag()\nusing namespace std;\ntypedef complex<double> point;\n\ndouble dot(point a,point b){return a.x*b.x+a.y*b.y;}\ndouble cross(point a,point b){return a.x*b.y-a.y*b.x;}\nint ccw(point a,point b,point c){\n point d = b-a,e = c-a;\n if(cross(d,e)>0) return 1;//\"COUNTER_CLOCKWISE\"\n if(cross(d,e)<0) return -1;//\"CLOCKWISE\"\n if(dot(d,e)<0) return 2;//\"ONLINE_BACK\"\n if(abs(d) < abs(e)) return -2;//\"ONLINE_FRONT\"\n return 0;//\"ON_SEGMENT\"\n}\n\npoint crosspoint(point a,point b,point c,point d){\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n\nvector<point> ConvexCut(vector<point> &polygon,point a,point b){\n vector <point> res;\n for(int i=0;i<polygon.size();i++){\n point A=polygon[i],B=polygon[(i+1)%polygon.size()];\n if(ccw(a,b,A)!=-1)res.push_back(A);\n if(ccw(a,b,A)*ccw(a,b,B)==-1)res.push_back(crosspoint(a,b,A,B));\n }\n return res;\n}\n\ndouble get_area(vector <point> &polygon){\n if(polygon.size()<3)return 0;\n double res=0;\n for(int i=0;i<polygon.size();i++)\n res+=cross(polygon[i],polygon[(i+1)%polygon.size()])/2;\n return res;\n}\n\nint main(){\n while(1){\n int v,n,d;\n vector <point> pl;\n cin>>n>>d>>v;\n if(!n&&!d&&!v) break;\n for(int i=0,a,b;i<n;i++) cin>>a>>b,pl.push_back(point(a,b));\n \n double V=min(get_area(pl)*d,(double)v),ans=0;\n \n for(int i=0;i<n;i++){\n double L=0,M,R=2010;\n int I=1000;\n while(I--){\n\tM=(L+R)/2;\n\tpoint h=pl[(i+1)%n]-pl[i],b=h;\n\th=(point(0,M)*h/abs(h))+pl[i];\n\tvector<point> a=ConvexCut(pl,h+b,h);\n\tif(get_area(a)*d>=V)R=M;\n\telse L=M+0.000000001;\n }\n ans=max(ans,L);\n }\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 1252,
"score_of_the_acc": -1.0033,
"final_rank": 16
},
{
"submission_id": "aoj_0253_1827666",
"code_snippet": "#include <bits/stdc++.h>\n#define x real()\n#define y imag()\nusing namespace std;\ntypedef complex<double> point;\n\ndouble dot(point a,point b){return a.x*b.x+a.y*b.y;}\ndouble cross(point a,point b){return a.x*b.y-a.y*b.x;}\nint ccw(point a,point b,point c){\n point d = b-a,e = c-a;\n if(cross(d,e)>0) return 1;//\"COUNTER_CLOCKWISE\"\n if(cross(d,e)<0) return -1;//\"CLOCKWISE\"\n if(dot(d,e)<0) return 2;//\"ONLINE_BACK\"\n if(abs(d) < abs(e)) return -2;//\"ONLINE_FRONT\"\n return 0;//\"ON_SEGMENT\"\n}\n\npoint crosspoint(point a,point b,point c,point d){\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n\nvector<point> ConvexCut(vector<point> &polygon,point a,point b){\n vector <point> res;\n for(int i=0;i<polygon.size();i++){\n point A=polygon[i],B=polygon[(i+1)%polygon.size()];\n if(ccw(a,b,A)!=-1)res.push_back(A);\n if(ccw(a,b,A)*ccw(a,b,B)==-1)res.push_back(crosspoint(a,b,A,B));\n }\n return res;\n}\n\ndouble get_area(vector <point> &polygon){\n if(polygon.size()<3)return 0;\n double res=0;\n for(int i=0;i<polygon.size();i++)\n res+=cross(polygon[i],polygon[(i+1)%polygon.size()])/2;\n return res;\n}\n\nint main(){\n while(1){\n int v,n,d;\n vector <point> pl;\n cin>>n>>d>>v;\n if(!n&&!d&&!v) break;\n for(int i=0,a,b;i<n;i++) cin>>a>>b,pl.push_back(point(a,b));\n \n double V=min(get_area(pl)*d,(double)v),ans=0;\n \n for(int i=0;i<n;i++){\n double L=0,M,R=2010;\n int I=1000;\n while(I--){\n\tM=(L+R)/2;\n\tpoint h=pl[(i+1)%n]-pl[i],b=h;\n\th=(point(0,M)*h/abs(h))+pl[i];\n\tvector<point> a=ConvexCut(pl,h+b,h);\n\tdouble res=get_area(a);\n\tassert(res>0);\n\tif(res*d>=V)R=M;\n\telse L=M+0.000000001;\n }\n ans=max(ans,L);\n }\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 1252,
"score_of_the_acc": -0.9264,
"final_rank": 12
},
{
"submission_id": "aoj_0253_1827665",
"code_snippet": "#include <bits/stdc++.h>\n#define x real()\n#define y imag()\n#define EPS 0.0000001\nusing namespace std;\ntypedef complex<double> point;\n\ndouble dot(point a,point b){return a.x*b.x+a.y*b.y;}\ndouble cross(point a,point b){return a.x*b.y-a.y*b.x;}\nint ccw(point a,point b,point c){\n point d = b-a,e = c-a;\n if(cross(d,e)>0) return 1;//\"COUNTER_CLOCKWISE\"\n if(cross(d,e)<0) return -1;//\"CLOCKWISE\"\n if(dot(d,e)<0) return 2;//\"ONLINE_BACK\"\n if(abs(d) < abs(e)) return -2;//\"ONLINE_FRONT\"\n return 0;//\"ON_SEGMENT\"\n}\n\npoint crosspoint(point a,point b,point c,point d){\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n\nvector<point> ConvexCut(vector<point> &polygon,point a,point b){\n vector <point> res;\n for(int i=0;i<polygon.size();i++){\n point A=polygon[i],B=polygon[(i+1)%polygon.size()];\n if(ccw(a,b,A)!=-1)res.push_back(A);\n if(ccw(a,b,A)*ccw(a,b,B)==-1)res.push_back(crosspoint(a,b,A,B));\n }\n return res;\n}\n\ndouble get_area(vector <point> &polygon){\n if(polygon.size()<3)return 0;\n double res=0;\n for(int i=0;i<polygon.size();i++)\n res+=cross(polygon[i],polygon[(i+1)%polygon.size()])/2;\n return res;\n}\n\nint main(){\n while(1){\n int v,n,d;\n vector <point> pl;\n cin>>n>>d>>v;\n if(!n&&!d&&!v) break;\n for(int i=0,a,b;i<n;i++) cin>>a>>b,pl.push_back(point(a,b));\n \n double V=min(get_area(pl)*d,(double)v),ans=0;\n\n for(int i=0;i<n;i++){\n double L=0,M,R=2010;\n int I=1000;\n while(I--){\n\tM=(L+R)/2;\n\tpoint h=pl[(i+1)%n]-pl[i],b=h;\n\th=(point(0,M)*h/abs(h))+pl[i];\n\n\tif(ccw(pl[(i+1)%n],pl[i],h)*ccw(pl[(i+1)%n],pl[i],h+b)<=0)assert(0);\n\tvector<point> a=ConvexCut(pl,h+b,h);\n\tdouble res=get_area(a);\n\tassert(res>0);\n\tif(res*d>=V)R=M;\n\telse L=M+0.000000001;\n }\n ans=max(ans,L);\n }\n assert(ans<2001&&ans>0.0001);\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 1252,
"score_of_the_acc": -0.9264,
"final_rank": 12
},
{
"submission_id": "aoj_0253_1776203",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <iomanip>\n#include <assert.h>\n#include <array>\n#include <cstdio>\n#include <cstring>\n#include <random>\n#include <functional>\n#include <numeric>\n#include <bitset>\n#include <fstream>\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#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nconst double EPS = 1e-9;\n\nusing number = double;\n\nstruct point {\n number x, y;\n point operator + (point r) { return point{x + r.x, y + r.y}; }\n point operator + (const point& r) const { return point{x + r.x, y + r.y}; }\n point operator - (point r) { return point{x - r.x, y - r.y}; }\n point operator - (const point& r) const { return point{x - r.x, y - r.y}; }\n point operator * (point r) { return point{x*r.x - y*r.y, x*r.y + r.x*y}; }\n void operator -= (point r) { x -= r.x, y -= r.y; }\n point nml() { return point{x/sqrt(x*x+y*y), y/sqrt(x*x+y*y)}; }\n};\npoint operator * (number k, point p) { return point{k * p.x, k * p.y}; }\n\nstruct line {\n point s, t;\n};\n\ntypedef line segment;\n\nnumber dot(point a, point b) {\n return a.x*b.x + a.y*b.y;\n}\n\nnumber cross(point a, point b) {\n return a.x*b.y - a.y*b.x;\n}\n\nnumber norm(point p) {\n return p.x * p.x + p.y * p.y;\n}\n\nstruct polygon : public vector<point> {\n number area2() {\n number ret{};\n rep(i, this->size())\n ret += cross((*this)[i],(*this)[(i+1)%this->size()]);\n return abs(ret);\n }\n};\n\nint ccw(point a, point b, point 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) < norm(c)) return -2;\n return 0;\n}\n\npoint crosspoint(const line &l, const line &m) {\n number A = cross(l.t - l.s, m.t - m.s);\n number B = cross(l.t - l.s, l.t - m.s);\n if(abs(A) < EPS && abs(B) < EPS) return m.s; // same line\n if(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m.s + B / A * (m.t - m.s);\n}\n\npolygon convex_cut(polygon& g, line& l) {\n polygon ret{};\n rep(i, g.size()) {\n auto a = g[i], b = g[(i+1)%g.size()];\n if(ccw(l.s, l.t, a) != -1) ret.push_back(a);\n if(ccw(l.s, l.t, a) * ccw(l.s, l.t, b) < 0)\n ret.push_back(crosspoint(line{a, b}, l));\n }\n return ret;\n}\n\nbool compare(polygon& g, number V, number D, int ridx, number height) {\n line l{g[(ridx+1)%g.size()], g[ridx]};\n point v = height * ((l.t - l.s) * point{0, -1}).nml();\n l.s = l.s + v, l.t = l.t + v;\n return convex_cut(g, l).area2() * D < V * 2;\n}\n\nint main() {\n int N; number D, V;\n while(cin >> N >> D >> V && (N||D||V)) {\n polygon g{};\n rep(i, N) {\n number x, y; cin >> x >> y;\n g.push_back(point{x, y});\n }\n\n number ans = 0;\n\n rep(i, N) {\n number l = 0, h = 114514;\n rep(_, 100) {\n number mid = (l + h) / 2;\n (compare(g, V, D, i, mid) ? l : h) = mid;\n }\n ans = max(ans, l);\n }\n\n printf(\"%.10f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3208,
"score_of_the_acc": -0.8129,
"final_rank": 6
},
{
"submission_id": "aoj_0253_1776200",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <iomanip>\n#include <assert.h>\n#include <array>\n#include <cstdio>\n#include <cstring>\n#include <random>\n#include <functional>\n#include <numeric>\n#include <bitset>\n#include <fstream>\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#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nconst double EPS = 1e-9;\n\nusing number = double;\n\nstruct point {\n number x, y;\n point operator + (point r) { return point{x + r.x, y + r.y}; }\n point operator + (const point& r) const { return point{x + r.x, y + r.y}; }\n point operator - (point r) { return point{x - r.x, y - r.y}; }\n point operator - (const point& r) const { return point{x - r.x, y - r.y}; }\n point operator * (point r) { return point{x*r.x - y*r.y, x*r.y + r.x*y}; }\n void operator -= (point r) { x -= r.x, y -= r.y; }\n point nml() { return point{x/sqrt(x*x+y*y), y/sqrt(x*x+y*y)}; }\n};\npoint operator * (number k, point p) { return point{k * p.x, k * p.y}; }\n\nstruct line {\n point s, t;\n};\n\ntypedef line segment;\n\nnumber dot(point a, point b) {\n return a.x*b.x + a.y*b.y;\n}\n\nnumber cross(point a, point b) {\n return a.x*b.y - a.y*b.x;\n}\n\nnumber norm(point p) {\n return p.x * p.x + p.y * p.y;\n}\n\nstruct polygon : public vector<point> {\n number area2() {\n number ret{};\n rep(i, this->size())\n ret += cross((*this)[i],(*this)[(i+1)%this->size()]);\n return abs(ret);\n }\n};\n\nint ccw(point a, point b, point 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) < norm(c)) return -2;\n return 0;\n}\n\npoint crosspoint(const line &l, const line &m) {\n number A = cross(l.t - l.s, m.t - m.s);\n number B = cross(l.t - l.s, l.t - m.s);\n if(abs(A) < EPS && abs(B) < EPS) return m.s; // same line\n if(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m.s + B / A * (m.t - m.s);\n}\n\npolygon convex_cut(polygon& g, line& l) {\n polygon ret{};\n rep(i, g.size()) {\n auto a = g[i], b = g[(i+1)%g.size()];\n if(ccw(l.s, l.t, a) != -1) ret.push_back(a);\n if(ccw(l.s, l.t, a) * ccw(l.s, l.t, b) < 0)\n ret.push_back(crosspoint(line{a, b}, l));\n }\n return ret;\n}\n\nbool compare(polygon& g, number V, number D, int ridx, number height) {\n line l{g[(ridx+1)%g.size()], g[ridx]};\n point v = height * ((l.t - l.s) * point{0, -1}).nml();\n l.s = l.s + v, l.t = l.t + v;\n return convex_cut(g, l).area2() * D < V * 2;\n}\n\nint main() {\n int N; number D, V;\n while(cin >> N >> D >> V && (N||D||V)) {\n polygon g{};\n rep(i, N) {\n number x, y; cin >> x >> y;\n g.push_back(point{x, y});\n }\n\n number ans = 0;\n\n rep(i, N) {\n number l = 0, h = 114514;\n rep(_, 300) {\n number mid = (l + h) / 2;\n (compare(g, V, D, i, mid) ? l : h) = mid;\n }\n ans = max(ans, l);\n }\n\n printf(\"%.10f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3284,
"score_of_the_acc": -0.9982,
"final_rank": 14
},
{
"submission_id": "aoj_0253_1776197",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <iomanip>\n#include <assert.h>\n#include <array>\n#include <cstdio>\n#include <cstring>\n#include <random>\n#include <functional>\n#include <numeric>\n#include <bitset>\n#include <fstream>\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#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nconst double EPS = 1e-9;\n\nusing number = double;\n\nstruct point {\n number x, y;\n point operator + (point r) { return point{x + r.x, y + r.y}; }\n point operator + (const point& r) const { return point{x + r.x, y + r.y}; }\n point operator - (point r) { return point{x - r.x, y - r.y}; }\n point operator - (const point& r) const { return point{x - r.x, y - r.y}; }\n point operator * (point r) { return point{x*r.x - y*r.y, x*r.y + r.x*y}; }\n void operator -= (point r) { x -= r.x, y -= r.y; }\n point nml() { return point{x/sqrt(x*x+y*y), y/sqrt(x*x+y*y)}; }\n};\npoint operator * (number k, point p) { return point{k * p.x, k * p.y}; }\n\nstruct line {\n point s, t;\n};\n\ntypedef line segment;\n\nnumber dot(point a, point b) {\n return a.x*b.x + a.y*b.y;\n}\n\nnumber cross(point a, point b) {\n return a.x*b.y - a.y*b.x;\n}\n\nnumber norm(point p) {\n return p.x * p.x + p.y * p.y;\n}\n\nstruct polygon : public vector<point> {\n number area2() {\n number ret{};\n rep(i, this->size())\n ret += cross((*this)[i],(*this)[(i+1)%this->size()]);\n return abs(ret);\n }\n};\n\nint ccw(point a, point b, point 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) < norm(c)) return -2;\n return 0;\n}\n\npoint crosspoint(const line &l, const line &m) {\n number A = cross(l.t - l.s, m.t - m.s);\n number B = cross(l.t - l.s, l.t - m.s);\n if(abs(A) < EPS && abs(B) < EPS) return m.s; // same line\n if(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m.s + B / A * (m.t - m.s);\n}\n\npolygon convex_cut(polygon& g, line& l) {\n polygon ret{};\n rep(i, g.size()) {\n auto a = g[i], b = g[(i+1)%g.size()];\n if(ccw(l.s, l.t, a) != -1) ret.push_back(a);\n if(ccw(l.s, l.t, a) * ccw(l.s, l.t, b) < 0)\n ret.push_back(crosspoint(line{a, b}, l));\n }\n return ret;\n}\n\nbool compare(polygon& g, number V, number D, int ridx, number height) {\n line l{g[(ridx+1)%g.size()], g[ridx]};\n point v = height * ((l.t - l.s) * point{0, -1}).nml();\n l.s = l.s + v, l.t = l.t + v;\n return convex_cut(g, l).area2() * D < V * 2;\n}\n\nint main() {\n int N; number D, V;\n while(cin >> N >> D >> V && (N||D||V)) {\n polygon g{};\n rep(i, N) {\n number x, y; cin >> x >> y;\n g.push_back(point{x, y});\n }\n\n number ans = 0;\n\n rep(i, N) {\n number l = 0, h = 114514;\n rep(_, 150) {\n number mid = (l + h) / 2;\n (compare(g, V, D, i, mid) ? l : h) = mid;\n }\n ans = max(ans, l);\n }\n\n printf(\"%.10f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3184,
"score_of_the_acc": -0.803,
"final_rank": 5
},
{
"submission_id": "aoj_0253_1776196",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <iomanip>\n#include <assert.h>\n#include <array>\n#include <cstdio>\n#include <cstring>\n#include <random>\n#include <functional>\n#include <numeric>\n#include <bitset>\n#include <fstream>\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#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nconst double EPS = 1e-9;\n\nusing number = double;\n\nstruct point {\n number x, y;\n point operator + (point r) { return point{x + r.x, y + r.y}; }\n point operator + (const point& r) const { return point{x + r.x, y + r.y}; }\n point operator - (point r) { return point{x - r.x, y - r.y}; }\n point operator - (const point& r) const { return point{x - r.x, y - r.y}; }\n point operator * (point r) { return point{x*r.x - y*r.y, x*r.y + r.x*y}; }\n void operator -= (point r) { x -= r.x, y -= r.y; }\n point nml() { return point{x/sqrt(x*x+y*y), y/sqrt(x*x+y*y)}; }\n};\npoint operator * (number k, point p) { return point{k * p.x, k * p.y}; }\n\nstruct line {\n point s, t;\n};\n\ntypedef line segment;\n\nnumber dot(point a, point b) {\n return a.x*b.x + a.y*b.y;\n}\n\nnumber cross(point a, point b) {\n return a.x*b.y - a.y*b.x;\n}\n\nnumber norm(point p) {\n return p.x * p.x + p.y * p.y;\n}\n\nstruct polygon : public vector<point> {\n number area2() {\n number ret{};\n rep(i, this->size())\n ret += cross((*this)[i],(*this)[(i+1)%this->size()]);\n return abs(ret);\n }\n};\n\nint ccw(point a, point b, point 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) < norm(c)) return -2;\n return 0;\n}\n\npoint crosspoint(const line &l, const line &m) {\n number A = cross(l.t - l.s, m.t - m.s);\n number B = cross(l.t - l.s, l.t - m.s);\n if(abs(A) < EPS && abs(B) < EPS) return m.s; // same line\n if(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m.s + B / A * (m.t - m.s);\n}\n\npolygon convex_cut(polygon& g, line& l) {\n polygon ret{};\n rep(i, g.size()) {\n auto a = g[i], b = g[(i+1)%g.size()];\n if(ccw(l.s, l.t, a) != -1) ret.push_back(a);\n if(ccw(l.s, l.t, a) * ccw(l.s, l.t, b) < 0)\n ret.push_back(crosspoint(line{a, b}, l));\n }\n return ret;\n}\n\nbool compare(polygon& g, number V, number D, int ridx, number height) {\n line l{g[(ridx+1)%g.size()], g[ridx]};\n point v = height * (l.t - l.s).nml() * point{0, -1};\n l.s = l.s + v, l.t = l.t + v;\n return convex_cut(g, l).area2() * D < V * 2;\n}\n\nint main() {\n int N; number D, V;\n while(cin >> N >> D >> V && (N||D||V)) {\n polygon g{};\n rep(i, N) {\n number x, y; cin >> x >> y;\n g.push_back(point{x, y});\n }\n\n number ans = 0;\n\n rep(i, N) {\n number l = 0, h = 114514;\n rep(_, 150) {\n number mid = (l + h) / 2;\n (compare(g, V, D, i, mid) ? l : h) = mid;\n }\n ans = max(ans, l);\n }\n\n printf(\"%.10f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3288,
"score_of_the_acc": -0.846,
"final_rank": 10
},
{
"submission_id": "aoj_0253_1776179",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define EPS 1e-9\n \nstruct Point {\n double x, y;\n Point() {}\n Point(double x, double y) : x(x), y(y){}\n \n Point operator + (const Point &p) const {\n return Point(x + p.x, y + p.y);\n }\n \n Point operator - (const Point &p) const {\n return Point(x - p.x, y - p.y);\n }\n \n Point operator * (const double k) const {\n return Point(x * k, y * k);\n }\n \n Point operator / (const double k) const {\n return Point(x / k, y / k);\n }\n};\n \ntypedef Point Vector;\n \ndouble dot(const Point &a, const Point &b)\n{\n return a.x * b.x + a.y * b.y;\n}\n \ndouble cross(const Point &a, const Point &b)\n{\n return a.x * b.y - b.x * a.y;\n}\n \ndouble norm(const Point &p)\n{\n return dot(p, p);\n}\n \ndouble abs(const Point &p)\n{\n return sqrt(norm(p));\n}\n \nstruct Line {\n Point s, t;\n Line(){}\n Line(Point s, Point t) : s(s), t(t) {}\n};\n \nvector<Vector> normal_line_vector(const Line &l)\n{\n vector<Vector> vs;\n Vector v = l.t - l.s, p = v / abs(v);\n vs.push_back(Point(-p.y, p.x));\n vs.push_back(Point(p.y, p.x));\n return vs;\n}\n \nvector<Line> translation(const Line &l, double d)\n{\n vector<Vector> nlv = normal_line_vector(l);\n vector<Line> nl;\n nl.push_back(Line(l.t + nlv[0] * d, l.s + nlv[0] * d));\n nl.push_back(Line(l.t + nlv[1] * d, l.s + nlv[1] * d));\n return nl;\n}\n \nint ccw(const Point &p0, const Point &p1, const Point &p2)\n{\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}\n \nPoint crosspointLL(const Line &a, const Line &b)\n{\n Vector va = a.t - a.s, vb = b.t - b.s;\n double d = cross(vb, va);\n if (abs(d) < EPS) return b.s;\n return a.s + va * cross(vb, b.t - a.s) * (1.0 / d);\n}\n \ntypedef vector<Point> Polygon;\n#define curr(G, i) (G[i%G.size()])\n#define next(G, i) (G[(i+1)%G.size()])\n \nPolygon convex_cut(const Polygon &pg, const Line &l)\n{\n Polygon res;\n for (int i = 0; i < (int)pg.size(); i++) {\n Point cp = curr(pg,i), np = next(pg,i);\n if(ccw(l.s, l.t, cp) != -1) res.push_back(cp);\n if(ccw(l.s, l.t, cp) * ccw(l.s, l.t, np) < 0){\n res.push_back(crosspointLL(Line(cp, np), l));\n }\n }\n return res;\n}\n \ndouble area(const Polygon &pg)\n{\n double res = 0;\n for (int i = 0; i < (int)pg.size(); i++) {\n res += cross(pg[i], next(pg, i));\n }\n return abs(res) / 2.0;\n}\n \ndouble calc(Polygon &pg, double d, Line &l, double V)\n{\n double lb = 0, ub = 25252;\n for (int i = 0; i < 150; i++) {\n double h = (lb + ub) / 2;\n vector<Line> vl = translation(l, h);\n Line nl = vl[0]; \n Polygon npg = convex_cut(pg, nl);\n double v = d * area(npg);\n if (v < V) {\n lb = h;\n } else {\n ub = h;\n }\n }\n return lb;\n}\n \ndouble solve(Polygon &pg, double d, double V)\n{\n int n = pg.size();\n double max_height = 0;\n for (int i = 0; i < n; i++) {\n Line l(curr(pg, i), next(pg, i));\n max_height = max(max_height, calc(pg, d, l, V));\n }\n return max_height;\n}\n \nint main()\n{\n int n;\n double d, V;\n while (cin >> n >> d >> V, n) {\n Polygon pg(n);\n for (int i = 0; i < n; i++) {\n cin >> pg[i].x >> pg[i].y;\n }\n printf(\"%.10f\\n\", solve(pg, d, V));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1252,
"score_of_the_acc": -0.1572,
"final_rank": 4
},
{
"submission_id": "aoj_0253_1775145",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef complex<double> P; //Point\ntypedef pair<P,P> L; //Line, Segment\n\nconst double EPS = 1e-9;\n\ndouble dot(P a, P b){ return a.real() * b.real() + a.imag() * b.imag(); }\ndouble cross(P a, P b){ return a.real() * b.imag() - a.imag() * b.real(); }\n\nint ccw(P a, P b, P c){\n b -= a;\n 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; // c -- a -- b ????????´???\n if(norm(b) < norm(c)) return -2; // a -- b -- c ????????´???\n return 0; // a -- c -- b ????????´????\n}\n\nP crossPoint(L l, L m){\n double A = cross(l.second - l.first, m.second - m.first);\n double B = cross(l.second - l.first, l.second - m.first);\n if(fabs(A) < EPS && fabs(B) < EPS) return m.first;\n else if(fabs(A) >= EPS) return m.first + B / A * (m.second - m.first);\n}\n\nvoid view(vector<P> G){\n cout << \"view : \";\n for(int i=0;i<(int)G.size();i++) cout << G[i] << \" \";\n cout << endl;\n}\n\nvector<P> convex_cut(vector<P> G, L l){\n vector<P> ans;\n for(int i=0;i<G.size();i++){\n P A = G[i];\n P B = G[(i+1)%G.size()];\n if(ccw(l.first, l.second, A) != -1) ans.push_back(A);\n if(ccw(l.first, l.second, A) * ccw(l.first, l.second, B) < 0)\n ans.push_back(crossPoint(L(A,B), l));\n }\n //view(ans);\n return ans;\n}\n\ndouble area(vector<P> v){\n double sum = 0.0;\n int n = v.size();\n for(int i=0;i<n;i++) sum += (real(v[i]) - real(v[(i+1)%n])) * (imag(v[i]) + imag(v[(i+1)%n]));\n return fabs(sum) / 2;\n};\n\nint N,D,V;\ndouble dV;\nL p_move( L s, double h ){\n P v = s.second - s.first;\n v = P( -v.imag(), v.real() );\n v /= abs(v);\n s.first += v*h;\n s.second += v*h;\n return s;\n}\n\ndouble solve( vector<P> v, L s ){\n double st = 0.0, ed = 100000.0;\n double A=area(v);\n for(int l=0;l<50;l++){\n double h = (st+ed)/2.0;\n L ns = p_move( s, h );\n double a = A-area(convex_cut( v, ns ));\n if( a < dV )\n st = h;\n else\n ed = h;\n }\n return ed;\n}\n\nint main(){\n while( ~scanf(\"%d%d%d\",&N,&D,&V) && (N|D|V) ){\n dV = (double)V/(double)D;\n vector<P> v;\n for(int i=0;i<N;i++){\n int x,y; cin >> x >> y;\n v.push_back( P( x, y ) );\n }\n double res = 0.0;\n for(int i=0;i<N;i++){\n int nd = (i+1)%N;\n L sp = L( v[i], v[nd] );\n res = max( res, solve( v, sp ) );\n }\n printf(\"%.9lf\\n\",res);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1280,
"score_of_the_acc": -0.0149,
"final_rank": 3
}
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.